GameTree.value_zero_sum
theoremverifiedformalizationimported Lean
Backward induction preserves the zero-sum invariant: if every terminal payoff vector is zero-sum, then the selected backward-induction value vector is zero-sum as well.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in theorem GameTree.value_zero_sum (g : GameTree (Fin 2) ℚ) (hzs : IsZeroSum g) : (value g) 0 + (value g) 1 = 0
- Formalizes
- EconCSLib, `GameTree.value_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.value_zero_sum← GameTree.value_zero_sum (EconCSLib/GameTheory/ExtensiveGame/Zermelo.lean:143): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 14
- 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… - 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.valueGameTree.value
- LinearOrder.toTotalPreorderEvery
LinearOrderis aTotalPreorder. - 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.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 1
- GameTree.value_one_eq_neg_value₀In a zero-sum game, player 1's backward-induction value is determined by player 0's value.
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/-- Backward induction preserves the zero-sum invariant: if every terminal payoff vector is zero-sum, then the selected backward-induction value vector is zero-sum as well. -/theorem GameTree.value_zero_sum (g : GameTree (Fin 2) ℚ) (hzs : IsZeroSum g) : (value g) 0 + (value g) 1 = 0 := by revert hzs induction g using GameTree.strong_induction with | base p => intro hzs simpa [IsZeroSum] using hzs | step m h t ih => intro hzs obtain ⟨c, hmem, hvalue⟩ := value_Node_eq_some_child_value m h t rw [hvalue] exact ih c hmem (IsZeroSum.child_mem hzs hmem)