AFTD Auto-Formalizing Theoretical Domains

GameTree.zermelo_exists_pure_SPE

theoremverifiedformalizationimported Lean

Pure root-scoped subgame-perfect existence for a finite two-player game on ℚ: the Fin 2 / ℚ instance of Kuhn_exists_SPE_on. Zero-sum is not needed for existence; see zermelo_determinacy for the zero-sum refinement.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
theorem GameTree.zermelo_exists_pure_SPE (g : GameTree (Fin 2) ℚ) :
    ∃ σ : Strategy (Fin 2) ℚ, IsSubgamePerfectOn σ g
Formalizes
EconCSLib, `GameTree.zermelo_exists_pure_SPE`
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 11

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
/-- Pure root-scoped subgame-perfect existence for a finite two-player game on `ℚ`: the `Fin 2` / `ℚ` instance of `Kuhn_exists_SPE_on`. Zero-sum is **not** needed for existence; see `zermelo_determinacy` for the zero-sum refinement. -/
theorem GameTree.zermelo_exists_pure_SPE (g : GameTree (Fin 2) ℚ) :
    ∃ σ : Strategy (Fin 2) ℚ, IsSubgamePerfectOn σ g :=
  Kuhn_exists_SPE_on g
See it in the graphDiscuss this resultChallenge it