Yield continuity for finite-presentation contexts
Lax369799.FiniteYieldContinuity · concepts/Lax369799/FiniteYieldContinuity.lean · lax-369799
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
The finite approximation of yields also holds for contexts retaining unreachable vertices. Substitution precedes the final reachable restriction, so roots supplied at an unreachable hole remain observable.
Concept map
Evidence
Lean source view on GitHub
| 1 | import Lax369799.YieldContinuity |
| 2 | import Lax369799.FiniteContexts |
| 3 | import Lax369799.InitialResolutionApproximation |
| 4 | |
| 5 | /-! |
| 6 | --- |
| 7 | title: Yield continuity for finite-presentation contexts |
| 8 | type: theorem |
| 9 | --- |
| 10 | The finite approximation of yields also holds for contexts retaining |
| 11 | unreachable vertices. Substitution precedes the final reachable |
| 12 | restriction, so roots supplied at an unreachable hole remain observable. |
| 13 | -/ |
| 14 | namespace Lax369799.FiniteYieldContinuity |
| 15 | open RankedSystems Morphisms |
| 16 | |
| 17 | noncomputable def insert {A : RankedSet} {k n : ℕ} |
| 18 | (C : FiniteContexts.Context A k n) (S : SetSystem A k) : SetSystem A n := |
| 19 | trim (FiniteContexts.plug C (FinitePresentations.ofSetSystem S)).graph |
| 20 | |
| 21 | axiom context_mono {A : RankedSet} {k n : ℕ} |
| 22 | (C : FiniteContexts.Context A k n) (S T : SetSystem A k) (h : YieldBelow S T) : |
| 23 | YieldBelow (insert C S) (insert C T) |
| 24 | |
| 25 | axiom continuity {A : RankedSet} {k n : ℕ} |
| 26 | (C : FiniteContexts.Context A k n) (S : SetSystem A k) (R : SetSystem A n) : |
| 27 | Yield (insert C S) R ↔ |
| 28 | ∃ (m : ℕ) (F : Fin m → SetSystem A k), |
| 29 | (∀ i, Yield S (F i)) ∧ Yield (insert C (YieldContinuity.finiteSum F)) R |
| 30 | |
| 31 | end Lax369799.FiniteYieldContinuity |
| 32 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments