Unary types selected by extremal refinement
Lax369799.ExtremalUnaryTypes · concepts/Lax369799/ExtremalUnaryTypes.lean · lax-369799
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
Unary values can themselves be refined by the extremal construction. The selected types retain acceptance in a prescribed context and lie below the original value. Their tests in normal contexts are principal filters of the unary context data.
Concept map
Evidence
Lean source view on GitHub
| 1 | import Lax369799.ExpandedSyntacticAlgebra |
| 2 | import Lax369799.SplitExtremal |
| 3 | |
| 4 | /-! |
| 5 | --- |
| 6 | title: Unary types selected by extremal refinement |
| 7 | type: theorem |
| 8 | --- |
| 9 | Unary values can themselves be refined by the extremal construction. |
| 10 | The selected types retain acceptance in a prescribed context and lie |
| 11 | below the original value. Their tests in normal contexts are principal |
| 12 | filters of the unary context data. |
| 13 | -/ |
| 14 | namespace Lax369799.ExtremalUnaryTypes |
| 15 | open RankedSystems (RankedSet) |
| 16 | open FinitePresentations FiniteContexts FiniteContextualOrder FiniteAcceptance |
| 17 | open FiniteSyntacticAlgebra ExpandedSyntacticAlgebra FiniteExtremal |
| 18 | open ExtremalContexts (Data) |
| 19 | |
| 20 | def Selected {A : RankedSet} (L : Algebras.Language A) (E : SyntacticAlgebra L) |
| 21 | (b : Carrier (Accepting L) 1) : Prop := |
| 22 | ∃ (a : Carrier (Accepting L) 1) (x : Data (Carrier (Accepting L)) 1), |
| 23 | IsExtremal (Accepting L) E.algebra a x ∧ |
| 24 | b = E.algebra.eval 1 (SplitExtremal.delta x.1 x.2 a) |
| 25 | |
| 26 | axiom replacement {A : RankedSet} (L : Algebras.Language A) |
| 27 | (hL : Algebras.UnfoldInvariantLanguage L) (hrec : Algebras.Recognizable L) |
| 28 | (E : SyntacticAlgebra L) (C : Context (Carrier (Accepting L)) 1 0) |
| 29 | (a : Carrier (Accepting L) 1) |
| 30 | (ha : AcceptingClass (Accepting L) (E.algebra.eval 0 (plug C (atomic a)))) : |
| 31 | ∃ b, Selected L E b ∧ ClassBelow (Accepting L) b a ∧ |
| 32 | AcceptingClass (Accepting L) (E.algebra.eval 0 (plug C (atomic b))) |
| 33 | |
| 34 | axiom normal_test {A : RankedSet} (L : Algebras.Language A) (E : SyntacticAlgebra L) |
| 35 | (b : Carrier (Accepting L) 1) (hb : Selected L E b) : |
| 36 | ∃ x : Data (Carrier (Accepting L)) 1, ∀ y, |
| 37 | Accepts (Accepting L) E.algebra b y ↔ DataBelow (Accepting L) x y |
| 38 | |
| 39 | end Lax369799.ExtremalUnaryTypes |
| 40 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments