GameTree.outcome_optStrategy_eq_value
theoremverifiedformalizationimported Lean
Key lemma: the outcome of the backward-induction strategy equals the backward-induction value vector at every game tree. This is the bridge between value (defined via argmax) and outcome (defined via tree traversal).
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open GameTree in variable {N U : Type*} [TotalPreorder U] in theorem GameTree.outcome_optStrategy_eq_value [DecidableLE U] (g : GameTree N U) : outcome (optStrategy : Strategy N U) g = value g
- Formalizes
- EconCSLib, `GameTree.outcome_optStrategy_eq_value`
- 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.outcome_optStrategy_eq_value← GameTree.outcome_optStrategy_eq_value (EconCSLib/GameTheory/ExtensiveGame/GameTreeSPE.lean:140): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 15
- GameTree.outcome_LeafGameTree.outcome_Leaf
- GameTree.outcome_NodeGameTree.outcome_Node
- GameTree.strong_inductionStrong induction: to prove
motive g, it suffices to handleLeafand, for eachNode, to prove the motive given the motive for… - GameTree.optStrategyThe canonical backward-induction strategy: at each node, pick a child whose backward-induction value equals the node's value (i.e., a…
- GameTree.outcomeThe outcome (terminal payoff vector) of playing strategy
σstarting from game treeg. Walks down the tree, usingσto pick a child… - GameTree.value_optStrategy_eqAt a node, the
optStrategypicks a child whose value equals the node's value. - 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.valueGameTree.value
- GameTree.StrategyA pure strategy for the entire game tree: at every possible node context
(mover, head, tail), specify one child (bundled with its… - GameTree.value_LeafGameTree.value_Leaf
- GameTree.childrenThe full child list at a
Node, as a guaranteed non-empty list. - GameTree.value_NodeGameTree.value_Node
- GameTree.valueList_nilGameTree.valueList_nil
- GameTree.valueList_consGameTree.valueList_cons
- Used by 5
- GameTree.optStrategy_isSubgamePerfectOptimality of
optStrategy: for every subtreeg, every playeri, and everyi-variant deviationσ', the deviating outcome is… - GameTree.outcome_le_value₀_of_iVariant_zeroPlayer 1's security. If player 1 plays
optStrategy(soσ'is a0-variant, leaving player 1's choices fixed), then player 0's… - GameTree.value₀_le_outcome_of_iVariant_onePlayer 0's security. If player 0 plays
optStrategy(so the deviating profileσ'is a1-variant, leaving player 0's choices… - GameTree.value₀_eq_optStrategy_outcomeThe backward-induction strategy realizes
value₀for player 0. - GameTree.outcome_optStrategy_one_eq_neg_value₀In a zero-sum game, the backward-induction outcome for player 1 is the negative of player 0's backward-induction value.
- GameTree.optStrategy_isSubgamePerfectOptimality of
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/-- **Key lemma**: the outcome of the backward-induction strategy equals the backward-induction value vector at every game tree. This is the bridge between `value` (defined via argmax) and `outcome` (defined via tree traversal). -/theorem GameTree.outcome_optStrategy_eq_value [DecidableLE U] (g : GameTree N U) : outcome (optStrategy : Strategy N U) g = value g := by induction g using GameTree.strong_induction with | base p => simp [outcome_Leaf, value_Leaf] | step m h t ih => -- outcome optStrategy (Node m h t) = outcome optStrategy (optStrategy m h t).val -- By IH on the chosen child: = value (optStrategy m h t).val -- By value_optStrategy_eq: = value (Node m h t) rw [outcome_Node] have hmem : (optStrategy m h t).val ∈ h :: t := (optStrategy m h t).property rw [ih _ hmem] exact value_optStrategy_eq m h t