Finite yield approximation with supported witnesses
Lax369799.SupportedYieldContinuity · concepts/Lax369799/SupportedYieldContinuity.lean · lax-369799
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
Corollary 50 for unpruned contexts. Each approximating component records a fully supported system, its variable map, and its initial or root yield witness. The disjoint sum realizes those maps before insertion. Both initial and root target yields retain their original variable map.
Concept map
Evidence
This concept declares 2 statements. Each proof establishes one of them relative to its assumptions.
1 initial_continuity proven
2 root_continuity proven
Lean source view on GitHub
| 1 | import Lax369799.SupportedYields |
| 2 | import Lax369799.FiniteYieldContinuity |
| 3 | |
| 4 | /-! |
| 5 | --- |
| 6 | title: Finite yield approximation with supported witnesses |
| 7 | type: theorem |
| 8 | --- |
| 9 | Corollary 50 for unpruned contexts. Each approximating component records |
| 10 | a fully supported system, its variable map, and its initial or root |
| 11 | yield witness. The disjoint sum realizes those maps before insertion. |
| 12 | Both initial and root target yields retain their original variable map. |
| 13 | -/ |
| 14 | |
| 15 | namespace Lax369799.SupportedYieldContinuity |
| 16 | open RankedSystems FinitePresentations SupportedMorphisms SupportedYields |
| 17 | |
| 18 | structure Component {A : RankedSet} {n : ℕ} (S : FiniteSystem A n) where |
| 19 | arity : ℕ |
| 20 | system : SupportedSystems.System A arity |
| 21 | variableMap : Fin arity → Fin n |
| 22 | rooted : Bool |
| 23 | yields : if rooted then RootYield S system variableMap else InitialYield S system variableMap |
| 24 | |
| 25 | def Component.realize {A : RankedSet} {n : ℕ} {S : FiniteSystem A n} (c : Component S) : SetSystem A n := |
| 26 | if c.rooted then RankedSystems.plant (Renaming.renameSystem c.variableMap c.system.val).val |
| 27 | else (Renaming.renameSystem c.variableMap c.system.val).val |
| 28 | |
| 29 | noncomputable def realizationSum {A : RankedSet} {n m : ℕ} {S : FiniteSystem A n} |
| 30 | (F : Fin m → Component S) : FiniteSystem A n := |
| 31 | ofSetSystem (YieldContinuity.finiteSum (fun i => (F i).realize)) |
| 32 | |
| 33 | |
| 34 | open FiniteContexts |
| 35 | |
| 36 | axiom initial_continuity {A : RankedSet} {k n r : ℕ} (C : Context A k n) |
| 37 | (S : FiniteSystem A k) (U : SupportedSystems.System A r) (σ : Fin r → Fin n) : |
| 38 | InitialYield (plug C S) U σ ↔ |
| 39 | ∃ (m : ℕ) (F : Fin m → Component S), InitialYield (plug C (realizationSum F)) U σ |
| 40 | |
| 41 | axiom root_continuity {A : RankedSet} {k n r : ℕ} (C : Context A k n) |
| 42 | (S : FiniteSystem A k) (U : SupportedSystems.System A r) (σ : Fin r → Fin n) : |
| 43 | RootYield (plug C S) U σ ↔ |
| 44 | ∃ (m : ℕ) (F : Fin m → Component S), RootYield (plug C (realizationSum F)) U σ |
| 45 | |
| 46 | end Lax369799.SupportedYieldContinuity |
| 47 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments