Renaming variables in systems and resolutions
Lax369799.Renaming · concepts/Lax369799/Renaming.lean · lax-369799
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural 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
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
| 1 | import Lax369799.Resolutions |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: Renaming variables in systems and resolutions |
| 6 | type: theorem |
| 7 | --- |
| 8 | Variable renaming preserves deterministic systems, commutes with relabelling, |
| 9 | and respects identity and composition. Morphisms and their local lifting |
| 10 | properties are preserved even when several variables are identified. |
| 11 | -/ |
| 12 | namespace Lax369799.Renaming |
| 13 | open RankedSystems Morphisms Resolutions |
| 14 | |
| 15 | def 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 | |
| 23 | axiom rename_identity {A : RankedSet} {n : ℕ} (S : SetSystem A n) : rename id S = S |
| 24 | |
| 25 | axiom 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 | |
| 29 | axiom 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 | |
| 33 | axiom 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 | |
| 38 | axiom 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 | |
| 43 | end Lax369799.Renaming |
| 44 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments