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

Winning regions and controlled predecessors

Lax369799.ParityWinningRegions · concepts/Lax369799/ParityWinningRegions.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 two positional winning regions of a finite parity game partition its vertices. A single strategy wins throughout each region. Since parity is unaffected by a finite prefix, the winning region is stable under the corresponding controlled predecessor operation.

    Concept map
    2 concepts
    100%
    Proven claimThis conceptRelated conceptA → B: B builds on ADescendants are omitted for concepts with more than 10 descendants.
    Evidence

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

    Lean source view on GitHub

    1import Lax369799.FiniteParityGames
    2
    3/-!
    4---
    5title: Winning regions and controlled predecessors
    6type: theorem
    7---
    8The two positional winning regions of a finite parity game partition its
    9vertices. A single strategy wins throughout each region. Since parity is
    10unaffected by a finite prefix, the winning region is stable under the
    11corresponding controlled predecessor operation.
    12-/
    13
    14namespace Lax369799.ParityWinningRegions
    15open FiniteParityGames
    16
    17def Winning {V : Type} (G : Game V) (player : Bool) (v : V) : Prop :=
    18 ∃ f, G.Legal player f ∧ G.WinsFrom player f v
    19
    20def Pre {V : Type} (G : Game V) (X : Set V) : Set V :=
    21 {v | (G.eve v → ∃ w, G.edge v w ∧ w ∈ X) ∧
    22 (¬ G.eve v → ∀ w, G.edge v w → w ∈ X)}
    23
    24axiom move {V : Type} (G : Game V) (player : Bool) (f : V → V) (v w : V)
    25 (hv : G.WinsFrom player f v) (he : G.edge v w)
    26 (hf : (G.eve v ↔ player = true) → w = f v) : G.WinsFrom player f w
    27
    28axiom disjoint {V : Type} (G : Game V) (v : V) :
    29 ¬ (Winning G true v ∧ Winning G false v)
    30
    31axiom uniform {V : Type} [Finite V] (G : Game V) (player : Bool) :
    32 ∃ f, G.Legal player f ∧ ∀ v, Winning G player v → G.WinsFrom player f v
    33
    34axiom complementary {V : Type} [Finite V] (G : Game V) (v : V) :
    35 Winning G false v ↔ ¬ Winning G true v
    36
    37axiom predecessor {V : Type} [Finite V] (G : Game V) (v : V) :
    38 Winning G true v ↔ v ∈ Pre G (Winning G true)
    39
    40end Lax369799.ParityWinningRegions
    41
    Show ProofShow ProofShow ProofShow ProofShow Proof

    Discussion

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

    Loading discussion…