GameTree.Kuhn_exists_SPE_on
theoremverifiedformalizationimported Lean
Kuhn's theorem, root-scoped SPE form: every finite perfect-information game without chance has a pure strategy that is subgame-perfect on that root.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open GameTree in variable {N U : Type*} [TotalPreorder U] in theorem GameTree.Kuhn_exists_SPE_on [DecidableLE U] (g : GameTree N U) : ∃ σ : Strategy N U, IsSubgamePerfectOn σ g
- Formalizes
- EconCSLib, `GameTree.Kuhn_exists_SPE_on`
- 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.Kuhn_exists_SPE_on← GameTree.Kuhn_exists_SPE_on (EconCSLib/GameTheory/ExtensiveGame/GameTreeNE.lean:118): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 14
- GameTree.IsSubgamePerfectOnRoot-scoped subgame perfection on the subtrees of a fixed root.
IsSubgamePerfect σis global over everyGameTree N U. This predicate… - GameTree.outcome_LeafGameTree.outcome_Leaf
- GameTree.outcome_NodeGameTree.outcome_Node
- GameTree.IsSubgamePerfectA strategy is subgame-perfect (SPE) if, at every subtree, no player can strictly improve their payoff by a unilateral deviation —…
- GameTree.IsSubgamePerfect.toSubgamePerfectOnA global subgame-perfect equilibrium is subgame-perfect on every fixed root.
- GameTree.Kuhn_exists_SPEKuhn's theorem (existence form): every finite perfect-information game without chance admits a subgame-perfect equilibrium. The…
- TotalPreorderA total preorder: a preorder where
≤is total (complete). This is weaker thanLinearOrder— it does NOT require antisymmetry or… - 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… - GameTree.childrenThe full child list at a
Node, as a guaranteed non-empty list. - GameTree.value_LeafGameTree.value_Leaf
- GameTree.value_NodeGameTree.value_Node
- GameTree.valueList_nilGameTree.valueList_nil
- GameTree.valueList_consGameTree.valueList_cons
- GameTree.IsSubgamePerfectOnRoot-scoped subgame perfection on the subtrees of a fixed root.
- Used by 1
- GameTree.zermelo_exists_pure_SPEPure root-scoped subgame-perfect existence for a finite two-player game on
ℚ: theFin 2/ℚinstance ofKuhn_exists_SPE_on.…
- GameTree.zermelo_exists_pure_SPEPure root-scoped subgame-perfect existence for a finite two-player game on
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
set_option autoImplicit true inset_option relaxedAutoImplicit true inopen GameTree invariable {N U : Type*} [TotalPreorder U] in/-- **Kuhn's theorem, root-scoped SPE form**: every finite perfect-information game without chance has a pure strategy that is subgame-perfect on that root. -/theorem GameTree.Kuhn_exists_SPE_on [DecidableLE U] (g : GameTree N U) : ∃ σ : Strategy N U, IsSubgamePerfectOn σ g := by obtain ⟨σ, hspe⟩ := Kuhn_exists_SPE (N := N) (U := U) exact ⟨σ, hspe.toSubgamePerfectOn g⟩