GameTree.outcome
defimported Lean
The outcome (terminal payoff vector) of playing strategy σ starting from game tree g. Walks down the tree, using σ to pick a child at each Node, until a Leaf is reached.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open GameTree in variable {N U : Type*} [TotalPreorder U] in noncomputable def GameTree.outcome (σ : Strategy N U) : GameTree N U → (N → U)
- Defined in
- EconCSLib, `GameTree.outcome`
- 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← GameTree.outcome (EconCSLib/GameTheory/ExtensiveGame/GameTreeSPE.lean:73): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 10
- GameTree.size_mem_children_ltAny child (head or in tail) is structurally smaller than the node.
- GameTreeA finite extensive-form game of perfect information, without chance. *
Leaf payoff— a terminal state with a payoff vectorN → U. *… - GameTree.StrategyA pure strategy for the entire game tree: at every possible node context
(mover, head, tail), specify one child (bundled with its… - GameTree.sizeStructural size, used for well-founded recursion.
- GameTree.childrenThe full child list at a
Node, as a guaranteed non-empty list. - TotalPreorderA total preorder: a preorder where
≤is total (complete). This is weaker thanLinearOrder— it does NOT require antisymmetry or… - GameTree.value_LeafGameTree.value_Leaf
- GameTree.value_NodeGameTree.value_Node
- GameTree.valueList_nilGameTree.valueList_nil
- GameTree.valueList_consGameTree.valueList_cons
- Used by 17
- 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.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.outcome_zero_sumIn a zero-sum tree, the terminal outcome of any strategy is zero-sum: following any strategy ends at some leaf, and every leaf of a…
- GameTree.optStrategy_isSubgamePerfectOptimality of
optStrategy: for every subtreeg, every playeri, and everyi-variant deviationσ', the deviating outcome is… - GameTree.IsNashAt.toSubgamePerfectOn_of_hasOnlyRootSubgamesIf a tree has no proper subgames, root Nash equilibrium already implies subgame perfection on that tree. This is the pure finite-tree form…
- 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_NodeGameTree.outcome_Node
- GameTree.toStrategicGameThe strategic-form extraction of a finite perfect-information tree.
- GameTree.IsSubgamePerfectA strategy is subgame-perfect (SPE) if, at every subtree, no player can strictly improve their payoff by a unilateral deviation —…
- 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.IsNashEquilibriumNash equilibrium: no single player can improve their outcome at the root game by unilateral deviation. Weaker than
IsSubgamePerfect,… - GameTree.zermelo_determinacyZermelo's theorem (determinacy / saddle value). In a finite two-player zero-sum perfect-information game,
optStrategyis a saddle… - 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.
- 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 /-- The outcome (terminal payoff vector) of playing strategy `σ` starting from game tree `g`. Walks down the tree, using `σ` to pick a child at each `Node`, until a `Leaf` is reached. -/ noncomputable def GameTree.outcome (σ : Strategy N U) : GameTree N U → (N → U) | Leaf p => p | Node m h t => outcome σ (σ m h t).val termination_by g => g.size decreasing_by have hmem := (σ m h t).property exact size_mem_children_lt m h t (by simpa [children] using hmem)