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

Variable renaming and inverse renaming without pruning

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

    Direct images and inverse images of variable edges retain all vertices. Their adjunction is Lemma 17 of the revised manuscript. Both operations preserve morphisms, local surjectivity, and foldings.

    Concept map
    15 concepts; 5 descendants hidden
    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: Variable renaming and inverse renaming without pruning
    6type: theorem
    7---
    8Direct images and inverse images of variable edges retain all vertices.
    9Their adjunction is Lemma 17 of the revised manuscript. Both operations
    10preserve morphisms, local surjectivity, and foldings.
    11-/
    12
    13namespace Lax369799.FiniteRenaming
    14open RankedSystems FinitePresentations FiniteMorphisms FiniteStructureTheorems
    15
    16def push {A : RankedSet} {m n : ℕ} (σ : Fin m → Fin n) (S : FiniteSystem A m) :
    17 FiniteSystem A n where
    18 size := S.size
    19 graph := {
    20 label := S.graph.label, initial := S.graph.initial, root := S.graph.root
    21 edge := fun v d t => ∃ s, S.graph.edge v d s ∧ t = Sum.map id σ s
    22 direction_valid := by rintro v d t ⟨s,hs,_⟩; exact S.graph.direction_valid v d s hs }
    23
    24def pull {A : RankedSet} {m n : ℕ} (σ : Fin m → Fin n) (S : FiniteSystem A n) :
    25 FiniteSystem A m where
    26 size := S.size
    27 graph := {
    28 label := S.graph.label, initial := S.graph.initial, root := S.graph.root
    29 edge := fun v d t => S.graph.edge v d (Sum.map id σ t)
    30 direction_valid := fun v d _t h => S.graph.direction_valid v d _ h }
    31
    32axiom adjunction {A : RankedSet} {m n : ℕ} (σ : Fin m → Fin n)
    33 (S : FiniteSystem A m) (T : FiniteSystem A n) (ρ : S.Vertex → T.Vertex) :
    34 (∃ f : Morphism (push σ S) T, f.toFun = ρ) ↔
    35 (∃ g : Morphism S (pull σ T), g.toFun = ρ)
    36
    37axiom push_morphism {A : RankedSet} {m n : ℕ} (σ : Fin m → Fin n)
    38 {S T : FiniteSystem A m} (f : Morphism S T) :
    39 ∃ g : Morphism (push σ S) (push σ T), g.toFun = f.toFun ∧
    40 (LocallySurjective f → LocallySurjective g) ∧ (Folding f → Folding g)
    41
    42axiom pull_morphism {A : RankedSet} {m n : ℕ} (σ : Fin m → Fin n)
    43 {S T : FiniteSystem A n} (f : Morphism S T) :
    44 ∃ g : Morphism (pull σ S) (pull σ T), g.toFun = f.toFun ∧
    45 (LocallySurjective f → LocallySurjective g) ∧ (Folding f → Folding g)
    46
    47axiom pull_flatten {A : RankedSet} {m n : ℕ} (σ : Fin m → Fin n)
    48 (P : FiniteSystem (FiniteSystem A) n) : pull σ (flatten P) = flatten (pull σ P)
    49
    50end Lax369799.FiniteRenaming
    51
    Show ProofShow ProofShow ProofShow Proof

    Discussion

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

    Loading discussion…