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

Unpruned substitution preserves morphisms and unfold-equivalence

Lax369799.FiniteFlatteningMorphisms · concepts/Lax369799/FiniteFlatteningMorphisms.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

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

    This concept declares 4 statements. Each proof establishes one of them relative to its assumptions.

    Lean source view on GitHub

    1import Lax369799.FiniteStructureTheorems
    2
    3/-!
    4---
    5title: Unpruned substitution preserves morphisms and unfold-equivalence
    6type: theorem
    7---
    8Lemmas 34 and 35 and their congruence consequences (Lemmas 39 and 40),
    9with all vertices retained. The outer lifting uses global surjectivity
    10to cover roots belonging to labels at unreachable outer vertices.
    11-/
    12
    13namespace Lax369799.FiniteFlatteningMorphisms
    14open RankedSystems FinitePresentations FiniteMorphisms FiniteStructureTheorems
    15
    16axiom 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
    23axiom 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
    27axiom outer_congruence {A : RankedSet} {n : ℕ} (S T : FiniteSystem (FiniteSystem A) n)
    28 (h : UnfoldEquivalent S T) : UnfoldEquivalent (flatten S) (flatten T)
    29
    30axiom 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
    35end Lax369799.FiniteFlatteningMorphisms
    36
    Show ProofShow ProofShow ProofShow 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…