Finite approximation of a flattening resolution
Lax369799.FiniteResolutionApproximation · concepts/Lax369799/FiniteResolutionApproximation.lean · lax-369799
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
A direct resolution of a flattening can be reproduced, up to unfolding, using only finitely many direct resolutions of each inner label. The variable maps of the flatten-resolution are retained when selecting and reassembling these components. This is the initial-resolution argument underlying the yield-continuity corollary in Section 2.9.
Concept map
Evidence
This concept declares 2 statements. Each proof establishes one of them relative to its assumptions.
1 direct_approximation proven
2 finite_support proven
Lean source view on GitHub
| 1 | import Lax369799.FiniteResolutionNormalForms |
| 2 | import Lax369799.FlatteningTheorems |
| 3 | import Lax369799.ProfileSubstitution |
| 4 | |
| 5 | /-! |
| 6 | --- |
| 7 | title: Finite approximation of a flattening resolution |
| 8 | type: theorem |
| 9 | --- |
| 10 | A direct resolution of a flattening can be reproduced, up to unfolding, |
| 11 | using only finitely many direct resolutions of each inner label. The |
| 12 | variable maps of the flatten-resolution are retained when selecting and |
| 13 | reassembling these components. This is the initial-resolution argument |
| 14 | underlying the yield-continuity corollary in Section 2.9. |
| 15 | -/ |
| 16 | namespace Lax369799.FiniteResolutionApproximation |
| 17 | open RankedSystems Morphisms Flattening Resolutions FiniteResolutionNormalForms |
| 18 | |
| 19 | noncomputable def replace {A : RankedSet} {n : ℕ} (S : SetSystem (SetSystem A) n) |
| 20 | (k : S.Vertex → ℕ) (c : ∀ v, Fin (k v) → Component (Inner S v)) : SetSystem (SetSystem A) n := |
| 21 | { S with graph := { S.graph with label := fun v => ⟨(S.graph.label v).1, trim (family (c v)).graph⟩ } } |
| 22 | |
| 23 | /-- A finite family of local resolutions suffices for any replacement |
| 24 | that still admits those resolutions. -/ |
| 25 | axiom finite_support {A : RankedSet} {n : ℕ} |
| 26 | (S : SetSystem (SetSystem A) n) (R : System A n) |
| 27 | (hR : DirectResolution (flatten S) R) : |
| 28 | ∃ (k : S.Vertex → ℕ) (c : ∀ v, Fin (k v) → Component (Inner S v)), |
| 29 | (∀ v i, (c v i).rooted = false) ∧ |
| 30 | ∀ (Q : ∀ v, SetSystem A (S.graph.label v).1), |
| 31 | (∀ v i, DirectResolution (Q v) (c v i).system) → |
| 32 | ∃ U : System A n, |
| 33 | DirectResolution (flatten (ProfileSubstitution.withLabels S Q)) U ∧ |
| 34 | UnfoldsTo R.val U.val |
| 35 | |
| 36 | axiom direct_approximation {A : RankedSet} {n : ℕ} |
| 37 | (S : SetSystem (SetSystem A) n) (R : System A n) |
| 38 | (hR : DirectResolution (flatten S) R) : |
| 39 | ∃ (k : S.Vertex → ℕ) (c : ∀ v, Fin (k v) → Component (Inner S v)) (U : System A n), |
| 40 | (∀ v i, (c v i).rooted = false) ∧ |
| 41 | DirectResolution (flatten (replace S k c)) U ∧ UnfoldsTo R.val U.val |
| 42 | |
| 43 | end Lax369799.FiniteResolutionApproximation |
| 44 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments