While this submission is a draft, it cannot be used by other submissions.

The algebraic condition on infinite branch words

Lax369799.AlgebraicOmegaWords · concepts/Lax369799/AlgebraicOmegaWords.lean · lax-369799

proven

Loading review…

Sign in with ORCID

Community review

Flags

Each flag is tied to a public ORCID identity and explains why this concept may be incorrect.

No flags have been submitted.

    Community review

    Flag this concept

    State precisely what appears incorrect. This explanation will be public under your ORCID name.

    No source line selected.

    Natural Language Statement

    Theorem

    Section 6.3 accepts an infinite unary word when it belongs to V_a(V_e)^ω for a linked pair (a,e) whose lasso evaluates to an accepting nullary value. For a finite unary sort this language is recognized by a finite deterministic parity word automaton.

    Concept map
    18 concepts
    100%
    Proven claimDefinitionThis conceptRelated conceptA → B: B builds on ADescendants are omitted for concepts with more than 10 descendants.
    Evidence

    This concept declares 2 statements. Each proof establishes one of them relative to its assumptions.

    Lean source view on GitHub

    1import Lax369799.UnaryFactorization
    2import Lax369799.OmegaProducts
    3
    4/-!
    5---
    6title: The algebraic condition on infinite branch words
    7type: theorem
    8---
    9Section 6.3 accepts an infinite unary word when it belongs to V_a(V_e)^ω
    10for a linked pair (a,e) whose lasso evaluates to an accepting nullary
    11value. For a finite unary sort this language is recognized by a finite
    12deterministic parity word automaton.
    13-/
    14
    15namespace Lax369799.AlgebraicOmegaWords
    16open RankedSystems (RankedSet)
    17open FiniteSyntacticAlgebra UnaryComposition UnaryFactorization UnfoldAutomata
    18
    19def Accepts {A : RankedSet} (E : Algebra A) (F : Set (A 0)) (w : ℕ → A 1) : Prop :=
    20 ∃ (a e : A 1) (cut : ℕ → ℕ), E.eval 0 (lasso a e) ∈ F ∧
    21 product E e e = e ∧ product E a e = a ∧ StrictMono cut ∧ 0 < cut 0 ∧
    22 block E w 0 (cut 0) = a ∧ ∀ i, block E w (cut i) (cut (i + 1)) = e
    23
    24axiom regular {A : RankedSet} (E : Algebra A) (F : Set (A 0)) [Fintype (A 1)] {z : ℕ} :
    25 ∃ D : WordCondition (Fintype.card (A 1)) z, ∀ w, D.AcceptsInfinite w ↔
    26 Accepts E F (fun n => (Fintype.equivFin (A 1)).symm (w n))
    27
    28axiom recurrent_factorization {A : RankedSet} (E : Algebra A) (F : Set (A 0))
    29 {V : Type} [Finite V] (w : ℕ → A 1) (v : ℕ → V) (h : Accepts E F w) :
    30 ∃ (a e : A 1) (c : ℕ → ℕ) (r : V), E.eval 0 (lasso a e) ∈ F ∧
    31 product E e e = e ∧ product E a e = a ∧ StrictMono c ∧ 0 < c 0 ∧
    32 (∀ i, v (c i) = r) ∧ (∀ i, block E w 0 (c i) = a) ∧
    33 (∀ i j, i < j → block E w (c i) (c j) = e)
    34
    35end Lax369799.AlgebraicOmegaWords
    36
    Show ProofShow Proof

    Discussion

    Ask a question or add context. Endorsements and structured flags are kept in the review panel above.

    Loading discussion…