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

A common condition for finite and infinite algebraic branch words

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

    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
    20 concepts; 6 descendants hidden
    100%
    Proven claimDefinitionThis conceptRelated conceptA → B: B builds on A
    Evidence

    Each proof establishes this claim relative to its assumptions.

    Lean source view on GitHub

    1import Lax369799.AlgebraicOmegaWords
    2import Lax369799.CombinedWordCondition
    3
    4/-!
    5---
    6title: A common condition for finite and infinite algebraic branch words
    7type: theorem
    8---
    9The word condition of Section 6.3 combines terminating-word evaluation
    10with the linked-pair condition on infinite words. Both conditions are
    11realized by one finite deterministic parity word automaton with final
    12states for terminating words.
    13-/
    14
    15namespace Lax369799.AlgebraicBranchCondition
    16open RankedSystems (RankedSet)
    17open FiniteSyntacticAlgebra UnfoldAutomata
    18
    19axiom 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
    28end Lax369799.AlgebraicBranchCondition
    29
    Show Proof

    Discussion

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

    Loading discussion…