GameTree.IsSubgamePerfectOn.toNashAt
theoremverifiedformalizationimported Lean
Root-scoped subgame perfection implies Nash equilibrium at the same root.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open GameTree in variable {N U : Type*} [TotalPreorder U] in theorem GameTree.IsSubgamePerfectOn.toNashAt {σ : Strategy N U} {g : GameTree N U} (hspe : IsSubgamePerfectOn σ g) : IsNashAt σ g
- Formalizes
- EconCSLib, `GameTree.IsSubgamePerfectOn.toNashAt`
- 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.toNashAt← GameTree.IsSubgamePerfectOn.toNashAt (EconCSLib/GameTheory/ExtensiveGame/GameTreeNE.lean:92): 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.IsNashAtRoot-scoped Nash equilibrium predicate for a fixed
GameTreeroot. This is definitionally the existingIsNashEquilibrium, with the… - GameTree.outcome_NodeGameTree.outcome_Node
- GameTree.IVariantTwo strategies are
i-variants if they agree on all nodes NOT owned byi. I.e.,σ'is obtained fromσby changing only playeri's… - 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.selfEvery tree is a subtree of itself.
- 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
- ExtensiveGame.ExtractsGameTree.spe_on_to_nash_atOn any extracted tree, root-scoped subgame perfection implies root Nash equilibrium through the ordinary
GameTreeequilibrium API.
- ExtensiveGame.ExtractsGameTree.spe_on_to_nash_atOn any extracted tree, root-scoped subgame perfection implies root Nash equilibrium through the ordinary
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 implies Nash equilibrium at the same root. -/ theorem GameTree.IsSubgamePerfectOn.toNashAt {σ : Strategy N U} {g : GameTree N U} (hspe : IsSubgamePerfectOn σ g) : IsNashAt σ g := fun i σ' hiv => hspe g (Subtree.self g) i σ' hiv