Finite resolution approximation in a context
Lax369799.ContextResolutionApproximation · concepts/Lax369799/ContextResolutionApproximation.lean · lax-369799
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
A direct resolution in a context needs only a finite family of direct resolutions at its hole. Keeping their sum inside the context permits independent choices at different occurrences. This is the approximation behind Corollary 46 of arXiv v6 (Corollary 50 in the revised manuscript), and its consequence for initial yields, using the earlier reachable interface.
Concept map
Evidence
This concept declares 4 statements. Each proof establishes one of them relative to its assumptions.
1 direct_approximation proven
2 initial_yields proven
3 root_yields proven
4 yields proven
Lean source view on GitHub
| 1 | import Lax369799.FiniteResolutionApproximation |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: Finite resolution approximation in a context |
| 6 | type: theorem |
| 7 | --- |
| 8 | A direct resolution in a context needs only a finite family of direct |
| 9 | resolutions at its hole. Keeping their sum inside the context permits |
| 10 | independent choices at different occurrences. This is the approximation |
| 11 | behind Corollary 46 of arXiv v6 (Corollary 50 in the revised manuscript), |
| 12 | and its consequence for initial yields, using the earlier reachable interface. |
| 13 | -/ |
| 14 | namespace Lax369799.ContextResolutionApproximation |
| 15 | open RankedSystems Morphisms Flattening FiniteResolutionNormalForms |
| 16 | |
| 17 | axiom direct_approximation {A : RankedSet} {k n : ℕ} |
| 18 | (C : SetContext A k n) (S : SetSystem A k) (R : System A n) |
| 19 | (hR : DirectResolution (plug C S) R) : |
| 20 | ∃ (m : ℕ) (c : Fin m → Component S) (U : System A n), |
| 21 | (∀ i, (c i).rooted = false) ∧ |
| 22 | DirectResolution (plug C (trim (family c).graph)) U ∧ UnfoldsTo R.val U.val |
| 23 | |
| 24 | axiom initial_yields {A : RankedSet} {k n : ℕ} |
| 25 | (C : SetContext A k n) (S : SetSystem A k) (R : System A n) : |
| 26 | InitYield (plug C S) R ↔ |
| 27 | ∃ (m : ℕ) (c : Fin m → Component S), |
| 28 | (∀ i, (c i).rooted = false) ∧ InitYield (plug C (trim (family c).graph)) R |
| 29 | |
| 30 | axiom root_yields {A : RankedSet} {k n : ℕ} |
| 31 | (C : SetContext A k n) (S : SetSystem A k) (R : System A n) : |
| 32 | InitYield (uproot (plug C S)) R ↔ |
| 33 | ∃ (m : ℕ) (c : Fin m → Component S), |
| 34 | InitYield (uproot (plug C (trim (family c).graph))) R |
| 35 | |
| 36 | axiom yields {A : RankedSet} {k n : ℕ} |
| 37 | (C : SetContext A k n) (S : SetSystem A k) (R : SetSystem A n) : |
| 38 | Yield (plug C S) R ↔ |
| 39 | ∃ (m : ℕ) (c : Fin m → Component S), |
| 40 | Yield (plug C (trim (family c).graph)) R |
| 41 | |
| 42 | end Lax369799.ContextResolutionApproximation |
| 43 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments