GameTree.outcome_zero_sum
theoremverifiedformalizationimported Lean
In 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 zero-sum tree is zero-sum. This is the strategy-level analogue of value_zero_sum.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in theorem GameTree.outcome_zero_sum (σ : Strategy (Fin 2) ℚ) (g : GameTree (Fin 2) ℚ) (hzs : IsZeroSum g) : outcome σ g 0 + outcome σ g 1 = 0
- Formalizes
- EconCSLib, `GameTree.outcome_zero_sum`
- 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_zero_sum← GameTree.outcome_zero_sum (EconCSLib/GameTheory/ExtensiveGame/Zermelo.lean:228): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 13
- 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.outcomeThe outcome (terminal payoff vector) of playing strategy
σstarting from game treeg. Walks down the tree, usingσto pick a child… - 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.IsZeroSumA 2-player
GameTreevalued inℚis zero-sum if at every leaf the two players' payoffs sum to zero. - GameTree.IsZeroSum.child_memEvery child of a zero-sum node is zero-sum.
- GameTree.value_LeafGameTree.value_Leaf
- GameTree.value_NodeGameTree.value_Node
- GameTree.valueList_nilGameTree.valueList_nil
- GameTree.valueList_consGameTree.valueList_cons
- GameTree.IsZeroSum.headThe head child of a zero-sum node is zero-sum.
- Used by 2
- 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.outcome_optStrategy_zero_sumThe terminal outcome reached by the backward-induction strategy is zero-sum whenever the game tree is zero-sum.
- GameTree.value₀_le_outcome_of_iVariant_onePlayer 0's security. If player 0 plays
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 in/-- In 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 zero-sum tree is zero-sum. This is the strategy-level analogue of `value_zero_sum`. -/theorem GameTree.outcome_zero_sum (σ : Strategy (Fin 2) ℚ) (g : GameTree (Fin 2) ℚ) (hzs : IsZeroSum g) : outcome σ g 0 + outcome σ g 1 = 0 := by revert hzs induction g using GameTree.strong_induction with | base p => intro hzs simpa [outcome_Leaf, IsZeroSum] using hzs | step m h t ih => intro hzs rw [outcome_Node] have hmem : (σ m h t).val ∈ h :: t := (σ m h t).property exact ih _ hmem (IsZeroSum.child_mem hzs hmem)