Yields with explicit variable maps and full support
Lax369799.SupportedYields · concepts/Lax369799/SupportedYields.lean · lax-369799
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
Definition 25 records both a supported system and its variable map. Initial and root yields are kept separate. Theorems cover invariance with this map fixed (Lemma 26), morphism monotonicity and invariance under local surjectivity (Lemma 27), unfold-invariance (Corollary 28), and the characterization of unfold-equivalence on systems (Lemma 29).
Concept map
Evidence
Lean source view on GitHub
| 1 | import Lax369799.SupportedMorphisms |
| 2 | import Lax369799.FiniteRenaming |
| 3 | |
| 4 | /-! |
| 5 | --- |
| 6 | title: Yields with explicit variable maps and full support |
| 7 | type: theorem |
| 8 | --- |
| 9 | Definition 25 records both a supported system and its variable map. |
| 10 | Initial and root yields are kept separate. Theorems cover invariance |
| 11 | with this map fixed (Lemma 26), morphism monotonicity and invariance |
| 12 | under local surjectivity (Lemma 27), unfold-invariance (Corollary 28), |
| 13 | and the characterization of unfold-equivalence on systems (Lemma 29). |
| 14 | -/ |
| 15 | |
| 16 | namespace Lax369799.SupportedYields |
| 17 | open RankedSystems (RankedSet) |
| 18 | open FinitePresentations FiniteMorphisms FiniteStructureTheorems |
| 19 | open SupportedMorphisms FiniteRenaming |
| 20 | |
| 21 | def uproot {A : RankedSet} {n : ℕ} (S : FiniteSystem A n) : FiniteSystem A n := |
| 22 | ⟨S.size,{S.graph with initial := S.graph.root,root := ∅}⟩ |
| 23 | |
| 24 | def InitialYield {A : RankedSet} {m n : ℕ} (S : FiniteSystem A n) |
| 25 | (T : SupportedSystems.System A m) (σ : Fin m → Fin n) : Prop := |
| 26 | ∃ (U : SupportedSystems.System A m) (_a : Morphism (push σ (presentation U)) S) |
| 27 | (b : Morphism (presentation U) (presentation T)), Folding b |
| 28 | |
| 29 | def RootYield {A : RankedSet} {m n : ℕ} (S : FiniteSystem A n) |
| 30 | (T : SupportedSystems.System A m) (σ : Fin m → Fin n) : Prop := |
| 31 | InitialYield (uproot S) T σ |
| 32 | |
| 33 | def YieldBelow {A : RankedSet} {n : ℕ} (S T : FiniteSystem A n) : Prop := |
| 34 | ∀ (m : ℕ) (R : SupportedSystems.System A m) (σ : Fin m → Fin n), |
| 35 | (InitialYield S R σ → InitialYield T R σ) ∧ (RootYield S R σ → RootYield T R σ) |
| 36 | |
| 37 | def YieldEquivalent {A : RankedSet} {n : ℕ} (S T : FiniteSystem A n) : Prop := |
| 38 | ∀ (m : ℕ) (R : SupportedSystems.System A m) (σ : Fin m → Fin n), |
| 39 | (InitialYield S R σ ↔ InitialYield T R σ) ∧ (RootYield S R σ ↔ RootYield T R σ) |
| 40 | |
| 41 | axiom unfold_invariance {A : RankedSet} {m n : ℕ} (S : FiniteSystem A n) |
| 42 | (T T' : SupportedSystems.System A m) (σ : Fin m → Fin n) |
| 43 | (h : UnfoldEquivalent (presentation T) (presentation T')) : |
| 44 | (InitialYield S T σ ↔ InitialYield S T' σ) ∧ (RootYield S T σ ↔ RootYield S T' σ) |
| 45 | |
| 46 | axiom morphism_yields {A : RankedSet} {n : ℕ} {S T : FiniteSystem A n} |
| 47 | (f : Morphism S T) : YieldBelow S T ∧ (LocallySurjective f → YieldEquivalent S T) |
| 48 | |
| 49 | axiom unfold_yields {A : RankedSet} {n : ℕ} {S T : FiniteSystem A n} |
| 50 | (h : UnfoldEquivalent S T) : YieldEquivalent S T |
| 51 | |
| 52 | axiom system_yield_equivalence {A : RankedSet} {n : ℕ} |
| 53 | (S T : SupportedSystems.System A n) : |
| 54 | UnfoldEquivalent (presentation S) (presentation T) ↔ |
| 55 | YieldEquivalent (presentation S) (presentation T) |
| 56 | |
| 57 | end Lax369799.SupportedYields |
| 58 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments