AFTD Auto-Formalizing Theoretical Domains

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.
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

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
See it in the graphDiscuss this resultChallenge it