GameTree.optStrategy
defimported Lean
The canonical backward-induction strategy: at each node, pick a child whose backward-induction value equals the node's value (i.e., a child attaining the argmax for the mover). Noncomputable — uses classical choice via value_Node_eq_some_child_value.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open GameTree in variable {N U : Type*} [TotalPreorder U] in noncomputable def GameTree.optStrategy [DecidableLE U] : Strategy N U
- Defined in
- EconCSLib, `GameTree.optStrategy`
- 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.optStrategy← GameTree.optStrategy (EconCSLib/GameTheory/ExtensiveGame/GameTreeSPE.lean:101): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 12
- GameTree.outcome_LeafGameTree.outcome_Leaf
- GameTree.outcome_NodeGameTree.outcome_Node
- 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.value_Node_eq_some_child_valueThe value at a node is itself the value of some child (the argmax). Specifically,
argMaxOn ... ∈ value h :: valueList t, so it equals… - 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
- Used by 11
- GameTree.value₀_eq_outcome_and_zeroSumPackaging lemma: the backward-induction strategy realizes player 0's value, and the value vector is zero-sum. This is *not* the minimax…
- 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.outcome_optStrategy_eq_valueKey lemma: the outcome of the backward-induction strategy equals the backward-induction value vector at every game tree. This is the…
- 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.zermelo_determinacyZermelo's theorem (determinacy / saddle value). In a finite two-player zero-sum perfect-information game,
optStrategyis a saddle… - GameTree.value_optStrategy_eqAt a node, the
optStrategypicks a child whose value equals the node's value. - GameTree.Kuhn_exists_SPEKuhn's theorem (existence form): every finite perfect-information game without chance admits a subgame-perfect equilibrium. The…
- 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.outcome_optStrategy_zero_sumThe terminal outcome reached by the backward-induction strategy is zero-sum whenever the game tree is zero-sum.
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 /-- The canonical backward-induction strategy: at each node, pick a child whose backward-induction value equals the node's value (i.e., a child attaining the argmax for the mover). Noncomputable — uses classical choice via `value_Node_eq_some_child_value`. -/ noncomputable def GameTree.optStrategy [DecidableLE U] : Strategy N U := fun m h t => ⟨(value_Node_eq_some_child_value m h t).choose, (value_Node_eq_some_child_value m h t).choose_spec.1⟩