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

Selection and common unfoldings of fully supported systems

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

    Morphisms between revised systems are foldings. A locally surjective morphism from an unpruned set-system to a system admits an injective system selection (Lemma 11). Common unfoldings can be chosen to be systems (Lemma 20), and unfoldings lift through surjective renaming while preserving full support (Lemma 24).

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

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

    Lean source view on GitHub

    1import Lax369799.SupportedSystems
    2import Lax369799.FiniteStructureTheorems
    3import Lax369799.ResolutionLifting
    4
    5/-!
    6---
    7title: Selection and common unfoldings of fully supported systems
    8type: theorem
    9---
    10Morphisms between revised systems are foldings. A locally surjective
    11morphism from an unpruned set-system to a system admits an injective
    12system selection (Lemma 11). Common unfoldings can be chosen to be
    13systems (Lemma 20), and unfoldings lift through surjective renaming
    14while preserving full support (Lemma 24).
    15-/
    16
    17namespace Lax369799.SupportedMorphisms
    18open RankedSystems (RankedSet)
    19open FinitePresentations FiniteMorphisms FiniteStructureTheorems
    20
    21def presentation {A : RankedSet} {n : ℕ} (S : SupportedSystems.System A n) : FiniteSystem A n :=
    22 ofSetSystem S.val.val
    23
    24axiom source_support {A : RankedSet} {n : ℕ}
    25 (S : RankedSystems.System A n) (T : SupportedSystems.System A n)
    26 (f : Morphism (ofSetSystem S.val) (presentation T)) : SupportedSystems.FullySupported S
    27
    28axiom system_folding {A : RankedSet} {n : ℕ} (S T : SupportedSystems.System A n)
    29 (f : Morphism (presentation S) (presentation T)) : Folding f
    30
    31axiom system_selection {A : RankedSet} {n : ℕ} (S : FiniteSystem A n)
    32 (T : SupportedSystems.System A n) (f : Morphism S (presentation T))
    33 (hf : LocallySurjective f) :
    34 ∃ (U : SupportedSystems.System A n) (i : Morphism (presentation U) S)
    35 (g : Morphism (presentation U) (presentation T)),
    36 Function.Injective i.toFun ∧ g.toFun = f.toFun ∘ i.toFun ∧ Folding g
    37
    38axiom common_system_unfolding {A : RankedSet} {n : ℕ}
    39 (S T : SupportedSystems.System A n)
    40 (h : UnfoldEquivalent (presentation S) (presentation T)) :
    41 ∃ (U : SupportedSystems.System A n) (f : Morphism (presentation U) (presentation S))
    42 (g : Morphism (presentation U) (presentation T)), Folding f ∧ Folding g
    43
    44axiom system_pullback {A : RankedSet} {n : ℕ} (S T U : SupportedSystems.System A n)
    45 (f : Morphism (presentation S) (presentation U))
    46 (g : Morphism (presentation T) (presentation U)) :
    47 ∃ (P : SupportedSystems.System A n) (p : Morphism (presentation P) (presentation S))
    48 (q : Morphism (presentation P) (presentation T)),
    49 f.toFun ∘ p.toFun = g.toFun ∘ q.toFun ∧ Folding p ∧ Folding q ∧
    50 (∀ (V : SupportedSystems.System A n) (a : Morphism (presentation V) (presentation S))
    51 (b : Morphism (presentation V) (presentation T)),
    52 f.toFun ∘ a.toFun = g.toFun ∘ b.toFun →
    53 ∃! h : Morphism (presentation V) (presentation P),
    54 p.toFun ∘ h.toFun = a.toFun ∧ q.toFun ∘ h.toFun = b.toFun)
    55
    56axiom rename_lift {A : RankedSet} {m n : ℕ} (σ : Fin m → Fin n)
    57 (hσ : Function.Surjective σ) (S : SupportedSystems.System A m)
    58 (R : SupportedSystems.System A n)
    59 (f : Morphisms.Morphism R.val.val (Resolutions.rename σ S.val.val)) :
    60 ∃ U : SupportedSystems.System A m,
    61 SupportedSystems.rename σ hσ U = R ∧ Morphisms.UnfoldsTo S.val.val U.val.val
    62
    63end Lax369799.SupportedMorphisms
    64
    Show ProofShow ProofShow ProofShow ProofShow ProofShow Proof

    Discussion

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

    Loading discussion…