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

Composition and pullbacks without reachability pruning

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

    The morphisms of revised Definition 8 retain every vertex. Local surjectivity and surjectivity on vertices are separate requirements. Lemmas 9 and 14 hold for these presentations, including the folding clauses and the full pullback universal property.

    Concept map
    14 concepts; 8 descendants hidden
    100%
    Proven claimDefinitionThis conceptRelated conceptA → B: B builds on A
    Evidence

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

    Lean source view on GitHub

    1import Lax369799.FiniteMorphisms
    2
    3/-!
    4---
    5title: Composition and pullbacks without reachability pruning
    6type: theorem
    7---
    8The morphisms of revised Definition 8 retain every vertex. Local
    9surjectivity and surjectivity on vertices are separate requirements.
    10Lemmas 9 and 14 hold for these presentations, including the folding
    11clauses and the full pullback universal property.
    12-/
    13
    14namespace Lax369799.FiniteStructureTheorems
    15open RankedSystems FinitePresentations FiniteMorphisms
    16
    17def LocallySurjective {A : RankedSet} {n : ℕ} {S T : FiniteSystem A n}
    18 (f : Morphism S T) : Prop :=
    19 (∀ w, T.graph.initial w → ∃ v, S.graph.initial v ∧ f.toFun v = w) ∧
    20 (∀ w, T.graph.root w → ∃ v, S.graph.root v ∧ f.toFun v = w) ∧
    21 ∀ v d t, T.graph.edge (f.toFun v) d t →
    22 ∃ s, S.graph.edge v d s ∧ Sum.map f.toFun id s = t
    23
    24def Folding {A : RankedSet} {n : ℕ} {S T : FiniteSystem A n}
    25 (f : Morphism S T) : Prop := LocallySurjective f ∧ Function.Surjective f.toFun
    26
    27def UnfoldEquivalent {A : RankedSet} {n : ℕ} (S T : FiniteSystem A n) : Prop :=
    28 ∃ (U : FiniteSystem A n) (f : Morphism U S) (g : Morphism U T), Folding f ∧ Folding g
    29
    30axiom composition {A : RankedSet} {n : ℕ} {S T U : FiniteSystem A n}
    31 (f : Morphism S T) (g : Morphism T U) :
    32 ∃ h : Morphism S U, h.toFun = g.toFun ∘ f.toFun ∧
    33 (LocallySurjective f → LocallySurjective g → LocallySurjective h) ∧
    34 (Folding f → Folding g → Folding h)
    35
    36axiom pullback {A : RankedSet} {n : ℕ} {S T U : FiniteSystem A n}
    37 (f : Morphism S U) (g : Morphism T U) :
    38 ∃ (P : FiniteSystem A n) (p : Morphism P S) (q : Morphism P T),
    39 f.toFun ∘ p.toFun = g.toFun ∘ q.toFun ∧
    40 (∀ (V : FiniteSystem A n) (a : Morphism V S) (b : Morphism V T),
    41 f.toFun ∘ a.toFun = g.toFun ∘ b.toFun →
    42 ∃! h : Morphism V P, p.toFun ∘ h.toFun = a.toFun ∧ q.toFun ∘ h.toFun = b.toFun) ∧
    43 (LocallySurjective f → LocallySurjective q) ∧
    44 (LocallySurjective g → LocallySurjective p) ∧
    45 (Folding f → Folding q) ∧ (Folding g → Folding p)
    46
    47axiom unfold_equivalence (A : RankedSet) (n : ℕ) :
    48 Equivalence (@UnfoldEquivalent A n)
    49
    50end Lax369799.FiniteStructureTheorems
    51
    Show ProofShow ProofShow Proof

    Discussion

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

    Loading discussion…