Continuity of yields in a context
Lax369799.YieldContinuity · concepts/Lax369799/YieldContinuity.lean · lax-369799
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
Corollary 46 of arXiv v6 (Corollary 50 in the revised manuscript), using the earlier reachable interface: every yield of a substituted context occurs when the hole is replaced by a finite sum of yields of its label. Conversely, every such finite sum gives only yields of the original substitution. The sum stays inside the context, preserving independent choices at different occurrences. Finite indexed families allow repetitions.
Concept map
Lean source view on GitHub
| 1 | import Lax369799.ContextResolutionApproximation |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: Continuity of yields in a context |
| 6 | type: theorem |
| 7 | --- |
| 8 | Corollary 46 of arXiv v6 (Corollary 50 in the revised manuscript), using |
| 9 | the earlier reachable interface: every yield of a substituted context occurs when |
| 10 | the hole is replaced by a finite sum of yields of its label. Conversely, |
| 11 | every such finite sum gives only yields of the original substitution. |
| 12 | The sum stays inside the context, preserving independent choices at |
| 13 | different occurrences. Finite indexed families allow repetitions. |
| 14 | -/ |
| 15 | namespace Lax369799.YieldContinuity |
| 16 | open RankedSystems Morphisms Flattening |
| 17 | |
| 18 | def sumGraph {A : RankedSet} {n : ℕ} {I : Type} (F : I → SetSystem A n) : |
| 19 | Presentation A n ((i : I) × (F i).Vertex) where |
| 20 | label := fun v => (F v.1).graph.label v.2 |
| 21 | initial := fun v => (F v.1).graph.initial v.2 |
| 22 | root := fun v => (F v.1).graph.root v.2 |
| 23 | edge := fun v d t => ∃ s, (F v.1).graph.edge v.2 d s ∧ t = Sum.map (Sigma.mk v.1) id s |
| 24 | direction_valid := by rintro v d t ⟨s, hs, _⟩; exact (F v.1).graph.direction_valid v.2 d s hs |
| 25 | |
| 26 | noncomputable def finiteSum {A : RankedSet} {n : ℕ} {I : Type} [Fintype I] |
| 27 | (F : I → SetSystem A n) : SetSystem A n := trim (sumGraph F) |
| 28 | |
| 29 | axiom continuity {A : RankedSet} {k n : ℕ} |
| 30 | (C : SetContext A k n) (S : SetSystem A k) (R : SetSystem A n) : |
| 31 | Yield (plug C S) R ↔ |
| 32 | ∃ (m : ℕ) (F : Fin m → SetSystem A k), |
| 33 | (∀ i, Yield S (F i)) ∧ Yield (plug C (finiteSum F)) R |
| 34 | |
| 35 | end Lax369799.YieldContinuity |
| 36 |
From Mathlib
none
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments