Finite sums are contextual meets
Lax369799.FiniteYieldMeets · concepts/Lax369799/FiniteYieldMeets.lean · lax-369799
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
A finite disjoint sum represents the meet of its summands in the contextual order. The empty sum represents the greatest element. Together with finite yield approximation, this gives continuity over base-alphabet yields.
Concept map
Evidence
Lean source view on GitHub
| 1 | import Lax369799.FiniteContinuityOrder |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: Finite sums are contextual meets |
| 6 | type: theorem |
| 7 | --- |
| 8 | A finite disjoint sum represents the meet of its summands in the |
| 9 | contextual order. The empty sum represents the greatest element. |
| 10 | Together with finite yield approximation, this gives continuity over |
| 11 | base-alphabet yields. |
| 12 | -/ |
| 13 | namespace Lax369799.FiniteYieldMeets |
| 14 | open RankedSystems (RankedSet SetSystem trim) |
| 15 | open FinitePresentations FiniteContextualOrder FiniteAcceptance |
| 16 | |
| 17 | axiom finite_meet {A : RankedSet} (L : Algebras.Language A) {n m : ℕ} |
| 18 | (R : FiniteSystem A n) (F : Fin m → SetSystem A n) : |
| 19 | Below (Accepting L) R (ofSetSystem (YieldContinuity.finiteSum F)) ↔ |
| 20 | ∀ i, Below (Accepting L) R (ofSetSystem (F i)) |
| 21 | |
| 22 | axiom yield_lower_bound {A : RankedSet} (L : Algebras.Language A) {n : ℕ} |
| 23 | (R S : FiniteSystem A n) : |
| 24 | Below (Accepting L) R S ↔ |
| 25 | ∀ T : SetSystem A n, Morphisms.Yield (trim S.graph) T → |
| 26 | Below (Accepting L) R (ofSetSystem T) |
| 27 | |
| 28 | end Lax369799.FiniteYieldMeets |
| 29 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments