AFTD Auto-Formalizing Theoretical Domains

GameTree.zermelo_determinacy

theoremverifiedformalizationimported Lean

Zermelo's theorem (determinacy / saddle value). In a finite two-player zero-sum perfect-information game, optStrategy is a saddle point with value value₀ g: * playing optStrategy, player 0 *secures* at least value₀ g against every opponent play (1-variant); * playing optStrategy, player 1 *holds* player 0 to at most value₀ g against every opponent play (0-variant). Hence the game is determined and value₀ g is its value, attained by the pure backward-induction strategy on both sides.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
theorem GameTree.zermelo_determinacy (g : GameTree (Fin 2) ℚ) (hzs : IsZeroSum g) :
    (∀ σ' : Strategy (Fin 2) ℚ, IVariant (1 : Fin 2) optStrategy σ' →
        value₀ g ≤ outcome σ' g 0) ∧
    (∀ σ' : Strategy (Fin 2) ℚ, IVariant (0 : Fin 2) optStrategy σ' →
        outcome σ' g 0 ≤ value₀ g)
Formalizes
EconCSLib, `GameTree.zermelo_determinacy`
Lean proof
By xbei (from the file's git history), from github.com/gametheoryinlean/EconCSLib at 1a88f809b538 (Copyright (c) 2026 EconCSLib contributors. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.30.0.
Verified
08 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 16

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
/-- **Zermelo's theorem (determinacy / saddle value).** In a finite two-player zero-sum perfect-information game, `optStrategy` is a saddle point with value `value₀ g`: * playing `optStrategy`, player 0 *secures* at least `value₀ g` against every opponent play (`1`-variant); * playing `optStrategy`, player 1 *holds* player 0 to at most `value₀ g` against every opponent play (`0`-variant). Hence the game is determined and `value₀ g` is its value, attained by the pure backward-induction strategy on both sides. -/
theorem GameTree.zermelo_determinacy (g : GameTree (Fin 2) ℚ) (hzs : IsZeroSum g) :
    (∀ σ' : Strategy (Fin 2) ℚ, IVariant (1 : Fin 2) optStrategy σ' →
        value₀ g ≤ outcome σ' g 0) ∧
    (∀ σ' : Strategy (Fin 2) ℚ, IVariant (0 : Fin 2) optStrategy σ' →
        outcome σ' g 0 ≤ value₀ g) :=
  ⟨fun _ hiv => value₀_le_outcome_of_iVariant_one g hzs hiv,
   fun _ hiv => outcome_le_value₀_of_iVariant_zero g hiv⟩
See it in the graphDiscuss this resultChallenge it