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

Combining finite and infinite branch conditions

Lax369799.CombinedWordCondition · concepts/Lax369799/CombinedWordCondition.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 finite-word evaluator can be combined with any parity condition on infinite words. The product reads both components in parallel, uses the parity component's priorities, and tests the evaluator's final state on terminating words.

    Concept map
    11 concepts; 8 descendants hidden
    100%
    Proven claimDefinitionThis conceptRelated conceptA → B: B builds on A
    Evidence

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

    Lean source view on GitHub

    1import Lax369799.FiniteBranchWords
    2import Lax369799.UnfoldAutomata
    3import Mathlib.Data.Fintype.Prod
    4
    5/-!
    6---
    7title: Combining finite and infinite branch conditions
    8type: theorem
    9---
    10The finite-word evaluator can be combined with any parity condition on
    11infinite words. The product reads both components in parallel, uses the
    12parity component's priorities, and tests the evaluator's final state on
    13terminating words.
    14-/
    15namespace Lax369799.CombinedWordCondition
    16open UnfoldAutomata FiniteBranchWords
    17
    18noncomputable def combine {u z : ℕ} (D : WordCondition u z)
    19 (f : Fin u → Fin z → Fin z) (F : Set (Fin z)) : WordCondition u z := by
    20 classical
    21 let Q := Fin D.states × State (Fin z)
    22 let e := Fintype.equivFin Q
    23 exact {
    24 states := Fintype.card Q
    25 initial := e (D.initial, (machine f F).start)
    26 step := fun q a => e (D.step (e.symm q).1 a, (machine f F).step (e.symm q).2 a)
    27 priority := fun q => D.priority (e.symm q).1
    28 final := {q | (e.symm q).2 ∈ (machine f F).accept} }
    29
    30axiom finite_iff {u z : ℕ} (D : WordCondition u z)
    31 (f : Fin u → Fin z → Fin z) (F : Set (Fin z))
    32 (w : List (Fin u)) (a : Fin z) :
    33 (combine D f F).AcceptsFinite w a ↔ w.foldr f a ∈ F
    34
    35axiom infinite_iff {u z : ℕ} (D : WordCondition u z)
    36 (f : Fin u → Fin z → Fin z) (F : Set (Fin z))
    37 (w : ℕ → Fin u) :
    38 (combine D f F).AcceptsInfinite w ↔ D.AcceptsInfinite w
    39
    40end Lax369799.CombinedWordCondition
    41
    Show ProofShow Proof

    Discussion

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

    Loading discussion…