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

Regular infinite products of linked pairs

Lax369799.OmegaProducts · concepts/Lax369799/OmegaProducts.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

    For a finite monoid, a union of languages V_a(V_e)^ω over linked pairs ae = a and ee = e is recognized by a deterministic parity word automaton. Here V_a consists of nonempty words of product a. Increasing cut points give the nonempty prefix and the successive nonempty blocks explicitly.

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

    Each proof establishes this claim relative to its assumptions.

    Lean source view on GitHub

    1import Lax369799.OmegaDeterminization
    2import Lax369799.WordFactorization
    3
    4/-!
    5---
    6title: Regular infinite products of linked pairs
    7type: theorem
    8---
    9For a finite monoid, a union of languages V_a(V_e)^ω over linked pairs
    10ae = a and ee = e is recognized by a deterministic parity word automaton.
    11Here V_a consists of nonempty words of product a. Increasing cut points
    12give the nonempty prefix and the successive nonempty blocks explicitly.
    13-/
    14
    15namespace Lax369799.OmegaProducts
    16open UnfoldAutomata WordFactorization
    17
    18def Accepts {M : Type} [Monoid M] {u : ℕ} (f : Fin u → M)
    19 (P : M → M → Prop) (w : ℕ → Fin u) : Prop :=
    20 ∃ (a e : M) (cut : ℕ → ℕ), P a e ∧ e * e = e ∧ a * e = a ∧
    21 StrictMono cut ∧ 0 < cut 0 ∧ block (f ∘ w) 0 (cut 0) = a ∧
    22 ∀ i, block (f ∘ w) (cut i) (cut (i + 1)) = e
    23
    24axiom regular {M : Type} [Monoid M] [Finite M] {u z : ℕ}
    25 (f : Fin u → M) (P : M → M → Prop) :
    26 ∃ D : WordCondition u z, ∀ w, D.AcceptsInfinite w ↔ Accepts f P w
    27
    28end Lax369799.OmegaProducts
    29
    Show Proof

    Discussion

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

    Loading discussion…