A common condition for finite and infinite algebraic branch words
Lax369799.AlgebraicBranchCondition · concepts/Lax369799/AlgebraicBranchCondition.lean · lax-369799
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
The word condition of Section 6.3 combines terminating-word evaluation with the linked-pair condition on infinite words. Both conditions are realized by one finite deterministic parity word automaton with final states for terminating words.
Concept map
Lean source view on GitHub
| 1 | import Lax369799.AlgebraicOmegaWords |
| 2 | import Lax369799.CombinedWordCondition |
| 3 | |
| 4 | /-! |
| 5 | --- |
| 6 | title: A common condition for finite and infinite algebraic branch words |
| 7 | type: theorem |
| 8 | --- |
| 9 | The word condition of Section 6.3 combines terminating-word evaluation |
| 10 | with the linked-pair condition on infinite words. Both conditions are |
| 11 | realized by one finite deterministic parity word automaton with final |
| 12 | states for terminating words. |
| 13 | -/ |
| 14 | |
| 15 | namespace Lax369799.AlgebraicBranchCondition |
| 16 | open RankedSystems (RankedSet) |
| 17 | open FiniteSyntacticAlgebra UnfoldAutomata |
| 18 | |
| 19 | axiom exists_condition {A : RankedSet} (E : Algebra A) (F : Set (A 0)) |
| 20 | [Fintype (A 1)] [Fintype (A 0)] : |
| 21 | ∃ D : WordCondition (Fintype.card (A 1)) (Fintype.card (A 0)), |
| 22 | (∀ w a, D.AcceptsFinite w a ↔ |
| 23 | FiniteBranchWords.value E (w.map (Fintype.equivFin (A 1)).symm) |
| 24 | ((Fintype.equivFin (A 0)).symm a) ∈ F) ∧ |
| 25 | (∀ w, D.AcceptsInfinite w ↔ |
| 26 | AlgebraicOmegaWords.Accepts E F (fun n => (Fintype.equivFin (A 1)).symm (w n))) |
| 27 | |
| 28 | end Lax369799.AlgebraicBranchCondition |
| 29 |
From Mathlib
none
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments