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

Renaming variables in systems and resolutions

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

    Variable renaming preserves deterministic systems, commutes with relabelling, and respects identity and composition. Morphisms and their local lifting properties are preserved even when several variables are identified.

    Concept map
    6 concepts
    100%
    Proven claimDefinitionThis conceptRelated conceptA → B: B builds on ADescendants are omitted for concepts with more than 10 descendants.
    Evidence

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

    1 rename_composition proven

    2 rename_identity proven

    3 rename_morphism proven

    4 rename_relabel proven

    5 resolution_factor proven

    Lean source view on GitHub

    1import Lax369799.Resolutions
    2
    3/-!
    4---
    5title: Renaming variables in systems and resolutions
    6type: theorem
    7---
    8Variable renaming preserves deterministic systems, commutes with relabelling,
    9and respects identity and composition. Morphisms and their local lifting
    10properties are preserved even when several variables are identified.
    11-/
    12namespace Lax369799.Renaming
    13open RankedSystems Morphisms Resolutions
    14
    15def renameSystem {A : RankedSet} {m n : ℕ} (σ : Fin m → Fin n) (S : System A m) : System A n :=
    16 ⟨rename σ S.val, S.property.1, S.property.2.1, by
    17 intro v d hd
    18 obtain ⟨t, ht, hu⟩ := S.property.2.2 v d hd
    19 refine ⟨Sum.map id σ t, ⟨t, ht, rfl⟩, ?_⟩
    20 rintro u ⟨s, hs, rfl⟩
    21 exact congrArg (Sum.map id σ) (hu s hs)⟩
    22
    23axiom rename_identity {A : RankedSet} {n : ℕ} (S : SetSystem A n) : rename id S = S
    24
    25axiom rename_composition {A : RankedSet} {m n k : ℕ}
    26 (σ : Fin m → Fin n) (τ : Fin n → Fin k) (S : SetSystem A m) :
    27 rename τ (rename σ S) = rename (τ ∘ σ) S
    28
    29axiom rename_relabel {A B : RankedSet} (η : RankedMap A B) {m n : ℕ}
    30 (σ : Fin m → Fin n) (S : SetSystem A m) :
    31 rename σ (relabel η S) = relabel η (rename σ S)
    32
    33axiom rename_morphism {A : RankedSet} {m n : ℕ} (σ : Fin m → Fin n)
    34 {S T : SetSystem A m} (f : Morphism S T) :
    35 ∃ g : Morphism (rename σ S) (rename σ T), g.toFun = f.toFun ∧
    36 (f.LocallySurjective → g.LocallySurjective)
    37
    38axiom resolution_factor {A : RankedSet} {m m' n : ℕ} (S : SetSystem A n) (T : System A m)
    39 (σ : Fin m → Fin n) (τ : Fin m → Fin m') (σ' : Fin m' → Fin n)
    40 (hσ : ∀ i, σ' (τ i) = σ i) (h : IsResolution S T σ) :
    41 IsResolution S (renameSystem τ T) σ'
    42
    43end Lax369799.Renaming
    44
    Show 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…