Unpruned substitution preserves morphisms and unfold-equivalence
Lax369799.FiniteFlatteningMorphisms · concepts/Lax369799/FiniteFlatteningMorphisms.lean · lax-369799
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
Lemmas 34 and 35 and their congruence consequences (Lemmas 39 and 40), with all vertices retained. The outer lifting uses global surjectivity to cover roots belonging to labels at unreachable outer vertices.
Concept map
Evidence
Lean source view on GitHub
| 1 | import Lax369799.FiniteStructureTheorems |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: Unpruned substitution preserves morphisms and unfold-equivalence |
| 6 | type: theorem |
| 7 | --- |
| 8 | Lemmas 34 and 35 and their congruence consequences (Lemmas 39 and 40), |
| 9 | with all vertices retained. The outer lifting uses global surjectivity |
| 10 | to cover roots belonging to labels at unreachable outer vertices. |
| 11 | -/ |
| 12 | |
| 13 | namespace Lax369799.FiniteFlatteningMorphisms |
| 14 | open RankedSystems FinitePresentations FiniteMorphisms FiniteStructureTheorems |
| 15 | |
| 16 | axiom inner {A : RankedSet} {n : ℕ} (P : FiniteSystem (FiniteSystem A) n) |
| 17 | (Q : ∀ v, FiniteSystem A (P.graph.label v).1) |
| 18 | (f : ∀ v, Morphism (Inner P.graph v) (Q v)) : |
| 19 | ∃ g : Morphism (flatten P) (flatten (withLabels P Q)), |
| 20 | ((∀ v, LocallySurjective (f v)) → LocallySurjective g) ∧ |
| 21 | ((∀ v, Folding (f v)) → Folding g) |
| 22 | |
| 23 | axiom outer {A : RankedSet} {n : ℕ} {S T : FiniteSystem (FiniteSystem A) n} |
| 24 | (f : Morphism S T) : |
| 25 | ∃ g : Morphism (flatten S) (flatten T), Folding f → Folding g |
| 26 | |
| 27 | axiom outer_congruence {A : RankedSet} {n : ℕ} (S T : FiniteSystem (FiniteSystem A) n) |
| 28 | (h : UnfoldEquivalent S T) : UnfoldEquivalent (flatten S) (flatten T) |
| 29 | |
| 30 | axiom inner_congruence {A : RankedSet} {n : ℕ} (P : FiniteSystem (FiniteSystem A) n) |
| 31 | (Q : ∀ v, FiniteSystem A (P.graph.label v).1) |
| 32 | (h : ∀ v, UnfoldEquivalent (Inner P.graph v) (Q v)) : |
| 33 | UnfoldEquivalent (flatten P) (flatten (withLabels P Q)) |
| 34 | |
| 35 | end Lax369799.FiniteFlatteningMorphisms |
| 36 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments