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

Computable bounds for the algebraic branch automaton

Lax369799.QuantitativeWordConditions · concepts/Lax369799/QuantitativeWordConditions.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 linked-pair automaton stores three elements of the unary monoid and two flags. Determinization and the finite-word evaluator give explicit state and priority bounds from the unary and nullary sort bounds.

    Concept map
    22 concepts; 4 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.QuantitativeDeterminization
    2import Lax369799.AlgebraicBranchCondition
    3
    4/-!
    5---
    6title: Computable bounds for the algebraic branch automaton
    7type: theorem
    8---
    9The linked-pair automaton stores three elements of the unary monoid and
    10two flags. Determinization and the finite-word evaluator give explicit
    11state and priority bounds from the unary and nullary sort bounds.
    12-/
    13
    14namespace Lax369799.QuantitativeWordConditions
    15
    16def buchiBound (u : ℕ) : ℕ := 4*(u+1)^3
    17
    18def stateBound (u z : ℕ) : ℕ :=
    19 QuantitativeDeterminization.stateBound (buchiBound u) * (z^z+z+1)
    20
    21def priorityBound (u : ℕ) : ℕ :=
    22 QuantitativeDeterminization.priorityBound (buchiBound u)
    23
    24open UnfoldAutomata
    25
    26axiom exists_condition {A : RankedSystems.RankedSet} (E : FiniteSyntacticAlgebra.Algebra A)
    27 (F : Set (A 0)) [Fintype (A 1)] [Fintype (A 0)]
    28 (u z : ℕ) (hu : Fintype.card (A 1) ≤ u) (hz : Fintype.card (A 0) ≤ z) :
    29 ∃ D : WordCondition (Fintype.card (A 1)) (Fintype.card (A 0)),
    30 (∀ w a,D.AcceptsFinite w a ↔ FiniteBranchWords.value E
    31 (w.map (Fintype.equivFin (A 1)).symm) ((Fintype.equivFin (A 0)).symm a) ∈ F) ∧
    32 (∀ w,D.AcceptsInfinite w ↔ AlgebraicOmegaWords.Accepts E F
    33 (fun n => (Fintype.equivFin (A 1)).symm (w n))) ∧
    34 D.states ≤ stateBound u z ∧ (∀ q,D.priority q ≤ priorityBound u)
    35
    36end Lax369799.QuantitativeWordConditions
    Show Proof

    Discussion

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

    Loading discussion…