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

Nested fixed-point equations for finite parity games

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

    At depth zero every position is stopped and tested by its controlled predecessor condition. Increasing the depth binds the next priority by a greatest fixed point for even priorities and a least fixed point for odd priorities. Once the depth exceeds every priority, these nested equations define precisely Eve's positional winning region. The free boundary valuation is then immaterial.

    Concept map
    4 concepts
    100%
    Proven claimThis 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.ParityFixedPoints
    2
    3/-!
    4---
    5title: Nested fixed-point equations for finite parity games
    6type: theorem
    7---
    8At depth zero every position is stopped and tested by its controlled
    9predecessor condition. Increasing the depth binds the next priority by a
    10greatest fixed point for even priorities and a least fixed point for odd
    11priorities. Once the depth exceeds every priority, these nested equations
    12define precisely Eve's positional winning region. The free boundary
    13valuation is then immaterial.
    14-/
    15namespace Lax369799.ParityGameEquations
    16open FiniteParityGames ParityWinningRegions ParityFixedPoints
    17attribute [local instance] Classical.propDecidable
    18
    19noncomputable def cut {V : Type} (G : Game V) (n : ℕ) (ρ : ℕ → Set V) : Game V :=
    20 stop G {v | n ≤ G.priority v} {v | v ∈ pre G true (ρ (G.priority v))}
    21
    22noncomputable def solve {V : Type} (G : Game V) : ℕ → (ℕ → Set V) → Set V
    23 | 0, ρ => {v | v ∈ pre G true (ρ (G.priority v))}
    24 | n + 1, ρ => if Even n then
    25 sSup {X : Set V | X ⊆ solve G n (Function.update ρ n X)}
    26 else sInf {X : Set V | Set.Subset (solve G n (Function.update ρ n X)) X}
    27
    28axiom solve_cut {V : Type} [Finite V] (G : Game V) (n : ℕ) (ρ : ℕ → Set V) :
    29 (Winning (cut G n ρ) true : Set V) = solve G n ρ
    30
    31axiom winning {V : Type} [Finite V] (G : Game V) (n : ℕ)
    32 (hn : ∀ v, G.priority v < n) (ρ : ℕ → Set V) :
    33 (Winning G true : Set V) = solve G n ρ
    34
    35end Lax369799.ParityGameEquations
    36
    Show ProofShow Proof

    Discussion

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

    Loading discussion…