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

Positional determinacy of finite parity games

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

    A finite parity game admits positional winning strategies for both players on their winning regions. The arena is total. In this interface the greatest priority occurring infinitely often is even for Eve to win; reversing a bounded priority function converts this to the least-priority convention.

    Concept map
    1 concept
    100%
    Proven claimThis conceptDescendants 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 Mathlib.Data.Fintype.Basic
    2import Mathlib.Algebra.Group.Nat.Even
    3
    4/-!
    5---
    6title: Positional determinacy of finite parity games
    7type: theorem
    8---
    9A finite parity game admits positional winning strategies for both
    10players on their winning regions. The arena is total. In this interface
    11the greatest priority occurring infinitely often is even for Eve to win;
    12reversing a bounded priority function converts this to the least-priority
    13convention.
    14-/
    15
    16namespace Lax369799.FiniteParityGames
    17
    18structure Game (V : Type) where
    19 eve : V → Prop
    20 edge : V → V → Prop
    21 priority : V → ℕ
    22 total : ∀ v, ∃ w, edge v w
    23
    24def Game.IsPlay {V : Type} (G : Game V) (p : ℕ → V) : Prop :=
    25 ∀ n, G.edge (p n) (p (n + 1))
    26
    27def Game.EveWins {V : Type} (G : Game V) (p : ℕ → V) : Prop :=
    28 ∃ c, ((∀ N, ∃ n, N ≤ n ∧ G.priority (p n) = c) ∧
    29 (∀ b, c < b → ¬ ∀ N, ∃ n, N ≤ n ∧ G.priority (p n) = b)) ∧ Even c
    30
    31def Game.Legal {V : Type} (G : Game V) (eve : Bool) (f : V → V) : Prop :=
    32 ∀ v, (G.eve v ↔ eve = true) → G.edge v (f v)
    33
    34def Game.Consistent {V : Type} (G : Game V) (eve : Bool)
    35 (f : V → V) (p : ℕ → V) : Prop :=
    36 ∀ n, (G.eve (p n) ↔ eve = true) → p (n + 1) = f (p n)
    37
    38def Game.WinsFrom {V : Type} (G : Game V) (eve : Bool) (f : V → V) (v : V) : Prop :=
    39 ∀ p, G.IsPlay p → p 0 = v → G.Consistent eve f p → (G.EveWins p ↔ eve = true)
    40
    41axiom positional_determinacy {V : Type} [Finite V] (G : Game V) :
    42 ∃ f g : V → V, G.Legal true f ∧ G.Legal false g ∧
    43 ∀ v, G.WinsFrom true f v ∨ G.WinsFrom false g v
    44
    45end Lax369799.FiniteParityGames
    46
    Show Proof

    Discussion

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

    Loading discussion…