Morphism and yield theorems
Lax369799.MorphismTheorems · concepts/Lax369799/MorphismTheorems.lean · lax-369799
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
The structural results of Sections 2.3–2.5: composition and pullbacks of morphisms, stability of local surjectivity, equivalence of unfoldings, and preservation of yields. The pullback includes its universal property and the local-surjectivity conclusions for both projections.
Concept map
Evidence
This concept declares 6 statements. Each proof establishes one of them relative to its assumptions.
1 composition proven
2 morphism_yields proven
3 pullback proven
4 system_morphism_locally_surjective proven
5 system_yield_equivalence proven
6 unfold_equivalence proven
Lean source view on GitHub
| 1 | import Lax369799.Morphisms |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: Morphism and yield theorems |
| 6 | type: theorem |
| 7 | --- |
| 8 | The structural results of Sections 2.3–2.5: composition and pullbacks of |
| 9 | morphisms, stability of local surjectivity, equivalence of unfoldings, |
| 10 | and preservation of yields. The pullback includes its universal property |
| 11 | and the local-surjectivity conclusions for both projections. |
| 12 | -/ |
| 13 | |
| 14 | namespace Lax369799.MorphismTheorems |
| 15 | open RankedSystems Morphisms |
| 16 | |
| 17 | axiom composition {A : RankedSet} {n : ℕ} {S T U : SetSystem A n} |
| 18 | (f : Morphism S T) (g : Morphism T U) : |
| 19 | ∃ h : Morphism S U, h.toFun = g.toFun ∘ f.toFun ∧ |
| 20 | (f.LocallySurjective → g.LocallySurjective → h.LocallySurjective) |
| 21 | |
| 22 | axiom pullback {A : RankedSet} {n : ℕ} {S T U : SetSystem A n} |
| 23 | (f : Morphism S U) (g : Morphism T U) : |
| 24 | ∃ (P : SetSystem A n) (p : Morphism P S) (q : Morphism P T), |
| 25 | f.toFun ∘ p.toFun = g.toFun ∘ q.toFun ∧ |
| 26 | (∀ (V : SetSystem A n) (a : Morphism V S) (b : Morphism V T), |
| 27 | f.toFun ∘ a.toFun = g.toFun ∘ b.toFun → |
| 28 | ∃! h : Morphism V P, p.toFun ∘ h.toFun = a.toFun ∧ q.toFun ∘ h.toFun = b.toFun) ∧ |
| 29 | (f.LocallySurjective → q.LocallySurjective) ∧ |
| 30 | (g.LocallySurjective → p.LocallySurjective) |
| 31 | |
| 32 | axiom unfold_equivalence (A : RankedSet) (n : ℕ) : |
| 33 | Equivalence (@UnfoldEquivalent A n) |
| 34 | |
| 35 | axiom system_morphism_locally_surjective {A : RankedSet} {n : ℕ} |
| 36 | (S T : System A n) (f : Morphism S.val T.val) : f.LocallySurjective |
| 37 | |
| 38 | axiom morphism_yields {A : RankedSet} {n : ℕ} {S T : SetSystem A n} |
| 39 | (f : Morphism S T) : YieldBelow S T ∧ (f.LocallySurjective → YieldEquivalent S T) |
| 40 | |
| 41 | axiom system_yield_equivalence {A : RankedSet} {n : ℕ} (S T : System A n) : |
| 42 | UnfoldEquivalent S.val T.val ↔ YieldEquivalent S.val T.val |
| 43 | |
| 44 | end Lax369799.MorphismTheorems |
| 45 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments