While this submission is a draft, it cannot be used by other submissions.

Reachable substitution with root-free components

Lax369799.RootlessFlattening · concepts/Lax369799/RootlessFlattening.lean · lax-369799

proven

Loading review…

Sign in with ORCID

Community review

Flags

Each flag is tied to a public ORCID identity and explains why this concept may be incorrect.

No flags have been submitted.

    Community review

    Flag this concept

    State precisely what appears incorrect. This explanation will be public under your ORCID name.

    No source line selected.

    Natural 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
    7 concepts
    100%
    Proven claimDefinitionThis conceptRelated conceptA → B: B builds on A
    Evidence

    Each proof establishes this claim relative to its assumptions.

    Lean source view on GitHub

    1import Lax369799.RootExpansion
    2import Lax369799.Flattening
    3
    4/-!
    5---
    6title: Reachable substitution with root-free components
    7type: theorem
    8---
    9When every component has no roots, pruning unreachable outer vertices
    10before substitution is sound. One may first restrict each component and
    11then the outer pattern to reachable vertices. The resulting reachable
    12flattening covers the reachable restriction of the original substitution.
    13-/
    14namespace Lax369799.RootlessFlattening
    15open RankedSystems
    16
    17noncomputable 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
    22axiom 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
    28end Lax369799.RootlessFlattening
    29
    Show Proof
    Builds on
    Used by

    none

    From Mathlib

    none

    Discussion

    Ask a question or add context. Endorsements and structured flags are kept in the review panel above.

    Loading discussion…