GameTree.value
defimported Lean
GameTree.value
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {N U : Type*} [TotalPreorder U] [DecidableLE U] in mutual def GameTree.value : GameTree N U → (N → U)
- Defined in
- EconCSLib, `GameTree.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.value← GameTree.value (EconCSLib/GameTheory/ExtensiveGame/BackwardInduction.lean:45): verbatimGameTree.valueList← GameTree.valueList (EconCSLib/GameTheory/ExtensiveGame/BackwardInduction.lean:53): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 3
- 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. *… - List.argMaxOnA chosen maximizer of
fon the non-empty listhead :: tail, computed by a left fold that keeps the running maximizer (ties keep…
- TotalPreorderA total preorder: a preorder where
- Used by 26
- GameTree.value_LeafGameTree.value_Leaf
- 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.value₀Minimax value for player 0 in a two-player zero-sum game. Under zero-sum, this fully determines both players' values (player 1's value…
- GameTree.value_NodeGameTree.value_Node
- GameTree.value₀_Node_eq_some_childAt any decision node, the backward-induction
value₀is realized by one of the node's children. - GameTree.value_zero_sumBackward induction preserves the zero-sum invariant: if every terminal payoff vector is zero-sum, then the selected backward-induction…
- 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.value₀_Node_one_le_childAt a zero-sum player-1 node,
value₀is no greater than thevalue₀of every child. Equivalently, player 1's local maximization of their… - GameTree.valueList_eq_map
valueList lis exactlyl.map value. Useful for rewriting. - GameTree.valueList_nilGameTree.valueList_nil
- GameTree.optStrategy_isSubgamePerfectOptimality of
optStrategy: for every subtreeg, every playeri, and everyi-variant deviationσ', the deviating outcome is… - GameTree.valueList_consGameTree.valueList_cons
- 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₀_LeafAt a zero-sum leaf,
value₀equals player 0's payoff and-value₀equals player 1's. - GameTree.value₀_Node_zero_ge_childAt a player-0 node,
value₀is at least thevalue₀of every child. - GameTree.value_Node_geKey optimality lemma: at a
Node m h t, the moverm's coordinate of the backward-induction value dominates every child'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₀_Node_zero_isMaxAt a player-0 node, some child realizes the node's
value₀, and that value is at least every child'svalue₀. - 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.value₀_Node_one_isMinAt a zero-sum player-1 node, some child realizes the node's
value₀, and that value is no greater than every child'svalue₀. - 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.value_one_eq_neg_value₀In a zero-sum game, player 1's backward-induction value is determined by player 0's value.
- GameTree.value_optStrategy_eqAt a node, the
optStrategypicks a child whose value equals the node's value. - GameTree.mem_valueList_iffMembership in
valueListvia membership in the source list. - 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.
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {N U : Type*} [TotalPreorder U] [DecidableLE U] in mutual def GameTree.value : GameTree N U → (N → U) | Leaf p => p | Node m h t => let hv := value h let tv := valueList t List.argMaxOn (fun v => v m) hv tv def GameTree.valueList : List (GameTree N U) → List (N → U) | [] => [] | x :: xs => value x :: valueList xs end