GameTree.isSubgamePerfectOn_iff_forall_subtree_isNashAt
theoremverifiedformalizationimported Lean
Root-scoped subgame perfection is equivalent to Nash equilibrium at every subtree of the root. This is the pure finite-tree form of MSZ Definition 7.2.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open GameTree in variable {N U : Type*} [TotalPreorder U] in theorem GameTree.isSubgamePerfectOn_iff_forall_subtree_isNashAt {σ : Strategy N U} {g : GameTree N U} : IsSubgamePerfectOn σ g ↔ ∀ s : GameTree N U, Subtree s g → IsNashAt σ s
- Formalizes
- EconCSLib, `GameTree.isSubgamePerfectOn_iff_forall_subtree_isNashAt`
- 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.isSubgamePerfectOn_iff_forall_subtree_isNashAt← GameTree.isSubgamePerfectOn_iff_forall_subtree_isNashAt (EconCSLib/GameTheory/ExtensiveGame/GameTreeNE.lean:74): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 13
- 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.IsNashAtRoot-scoped Nash equilibrium predicate for a fixed
GameTreeroot. This is definitionally the existingIsNashEquilibrium, with the… - GameTree.outcome_NodeGameTree.outcome_Node
- TotalPreorderA total preorder: a preorder where
≤is total (complete). This is weaker thanLinearOrder— it does NOT require antisymmetry or… - GameTree.StrategyA pure strategy for the entire game tree: at every possible node context
(mover, head, tail), specify one child (bundled with its… - GameTreeA finite extensive-form game of perfect information, without chance. *
Leaf payoff— a terminal state with a payoff vectorN → U. *… - GameTree.Subtree
Subtree s g—soccurs as a subtree ofg. - 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.
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in open GameTree in variable {N U : Type*} [TotalPreorder U] in /-- Root-scoped subgame perfection is equivalent to Nash equilibrium at every subtree of the root. This is the pure finite-tree form of MSZ Definition 7.2. -/ theorem GameTree.isSubgamePerfectOn_iff_forall_subtree_isNashAt {σ : Strategy N U} {g : GameTree N U} : IsSubgamePerfectOn σ g ↔ ∀ s : GameTree N U, Subtree s g → IsNashAt σ s := Iff.rfl