GameTree.zermelo_exists_pure_NE
theoremverifiedformalizationimported Lean
Pure root Nash existence for a finite two-player game on ℚ: the Fin 2 / ℚ instance of Kuhn_exists_NE. Zero-sum is not needed.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in theorem GameTree.zermelo_exists_pure_NE (g : GameTree (Fin 2) ℚ) : ∃ σ : Strategy (Fin 2) ℚ, GameTree.IsNashEquilibrium σ g
- Formalizes
- EconCSLib, `GameTree.zermelo_exists_pure_NE`
- 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.GameTree.zermelo_exists_pure_NE← GameTree.zermelo_exists_pure_NE (EconCSLib/GameTheory/ExtensiveGame/Zermelo.lean:120): adapted
What was changed in
GameTree.zermelo_exists_pure_NE--- EconCSLib/GameTheory/ExtensiveGame/Zermelo.lean:120 (GameTree.zermelo_exists_pure_NE) +++ as compiled here @@ -1,5 +1,5 @@ -/-- Pure root Nash existence for a finite two-player game on `ℚ`: the `Fin 2` / - `ℚ` instance of `Kuhn_exists_NE`. Zero-sum is **not** needed. -/ -theorem zermelo_exists_pure_NE (g : GameTree (Fin 2) ℚ) : - ∃ σ : Strategy (Fin 2) ℚ, IsNashEquilibrium σ g := +set_option autoImplicit true in +set_option relaxedAutoImplicit true in +theorem GameTree.zermelo_exists_pure_NE (g : GameTree (Fin 2) ℚ) : + ∃ σ : Strategy (Fin 2) ℚ, GameTree.IsNashEquilibrium σ g := Kuhn_exists_NE g
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 11
- GameTree.outcome_LeafGameTree.outcome_Leaf
- GameTree.Kuhn_exists_NEKuhn's theorem, NE form: every finite perfect-information game without chance has a pure-strategy Nash equilibrium.
- GameTree.outcome_NodeGameTree.outcome_Node
- GameTree.IsNashEquilibriumNash equilibrium: no single player can improve their outcome at the root game by unilateral deviation. Weaker than
IsSubgamePerfect,… - GameTreeA finite extensive-form game of perfect information, without chance. *
Leaf payoff— a terminal state with a payoff vectorN → U. *… - GameTree.StrategyA pure strategy for the entire game tree: at every possible node context
(mover, head, tail), specify one child (bundled with its… - LinearOrder.toTotalPreorderEvery
LinearOrderis aTotalPreorder. - GameTree.value_LeafGameTree.value_Leaf
- GameTree.value_NodeGameTree.value_Node
- GameTree.valueList_nilGameTree.valueList_nil
- GameTree.valueList_consGameTree.valueList_cons
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in /-- Pure root Nash existence for a finite two-player game on `ℚ`: the `Fin 2` / `ℚ` instance of `Kuhn_exists_NE`. Zero-sum is **not** needed. -/ theorem GameTree.zermelo_exists_pure_NE (g : GameTree (Fin 2) ℚ) : ∃ σ : Strategy (Fin 2) ℚ, GameTree.IsNashEquilibrium σ g := Kuhn_exists_NE g