Reachable substitution with root-free components
Lax369799.RootlessFlattening · concepts/Lax369799/RootlessFlattening.lean · lax-369799
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
When every component has no roots, pruning unreachable outer vertices before substitution is sound. One may first restrict each component and then the outer pattern to reachable vertices. The resulting reachable flattening covers the reachable restriction of the original substitution.
Concept map
Lean source view on GitHub
| 1 | import Lax369799.RootExpansion |
| 2 | import Lax369799.Flattening |
| 3 | |
| 4 | /-! |
| 5 | --- |
| 6 | title: Reachable substitution with root-free components |
| 7 | type: theorem |
| 8 | --- |
| 9 | When every component has no roots, pruning unreachable outer vertices |
| 10 | before substitution is sound. One may first restrict each component and |
| 11 | then the outer pattern to reachable vertices. The resulting reachable |
| 12 | flattening covers the reachable restriction of the original substitution. |
| 13 | -/ |
| 14 | namespace Lax369799.RootlessFlattening |
| 15 | open RankedSystems |
| 16 | |
| 17 | noncomputable def trimLabels {A : RankedSet} {n : ℕ} {V : Type} |
| 18 | (P : Presentation (FinitePresentations.FiniteSystem A) n V) : |
| 19 | Presentation (SetSystem A) n V := { |
| 20 | P with label := fun v => ⟨(P.label v).1, trim (FinitePresentations.Inner P v).graph⟩ } |
| 21 | |
| 22 | axiom flatten_cover {A : RankedSet} {n : ℕ} {V : Type} [Fintype V] |
| 23 | (P : Presentation (FinitePresentations.FiniteSystem A) n V) |
| 24 | (h : ∀ v, (FinitePresentations.Inner P v).graph.root = ∅) : |
| 25 | Morphisms.UnfoldsTo (trim (FinitePresentations.flattenPresentation P)) |
| 26 | (Flattening.flatten (trim (trimLabels P))) |
| 27 | |
| 28 | end Lax369799.RootlessFlattening |
| 29 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments