Choice preservation of extremally selected unary types
Lax369799.SelectedChoicePreservation · concepts/Lax369799/SelectedChoicePreservation.lean · lax-369799
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
Rank-one extremal selection makes acceptance in normal contexts a principal test on their data. The data for a sum of closed continuations are the meet of the separate data. Contextual order separation therefore gives preservation of binary choices by every selected unary type.
Concept map
Evidence
Each proof establishes this claim relative to its assumptions.
Lean source view on GitHub
| 1 | import Lax369799.ExtremalUnaryTypes |
| 2 | import Lax369799.ChoicePreservingUnary |
| 3 | |
| 4 | /-! |
| 5 | --- |
| 6 | title: Choice preservation of extremally selected unary types |
| 7 | type: theorem |
| 8 | --- |
| 9 | Rank-one extremal selection makes acceptance in normal contexts a |
| 10 | principal test on their data. The data for a sum of closed continuations |
| 11 | are the meet of the separate data. Contextual order separation therefore |
| 12 | gives preservation of binary choices by every selected unary type. |
| 13 | -/ |
| 14 | namespace Lax369799.SelectedChoicePreservation |
| 15 | open RankedSystems (RankedSet) |
| 16 | open FiniteContextualOrder FiniteAcceptance ExpandedSyntacticAlgebra |
| 17 | |
| 18 | axiom selected_preserves_choices {A : RankedSet} (L : Algebras.Language A) |
| 19 | (E : SyntacticAlgebra L) (b : Carrier (Accepting L) 1) |
| 20 | (hb : ExtremalUnaryTypes.Selected L E b) : |
| 21 | ChoicePreservingUnary.PreservesChoices E.algebra b |
| 22 | |
| 23 | end Lax369799.SelectedChoicePreservation |
| 24 |
Used by
From Mathlib
none
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments