GameTree.IsZeroSum
defimported Lean
A 2-player GameTree valued in ℚ is zero-sum if at every leaf the two players' payoffs sum to zero.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in def GameTree.IsZeroSum : GameTree (Fin 2) ℚ → Prop
- Defined in
- EconCSLib, `GameTree.IsZeroSum`
- 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.IsZeroSum← GameTree.IsZeroSum (EconCSLib/GameTheory/ExtensiveGame/Zermelo.lean:65): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 1
- GameTreeA finite extensive-form game of perfect information, without chance. *
Leaf payoff— a terminal state with a payoff vectorN → U. *…
- GameTreeA finite extensive-form game of perfect information, without chance. *
- Used by 17
- GameTree.value_zero_sumBackward induction preserves the zero-sum invariant: if every terminal payoff vector is zero-sum, then the selected backward-induction…
- GameTree.IsZeroSum.of_subtreeZero-sumness is inherited by subgames.
- 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.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.IsZeroSum.tail_memEvery tail child of a zero-sum node is zero-sum.
- SuperSymmetry.SU5.PotentialTerm.RParityThe R-parity of a term in the potential.
- GameTree.value₀_LeafAt a zero-sum leaf,
value₀equals player 0's payoff and-value₀equals player 1's. - GameTree.IsZeroSum.headThe head child of a zero-sum node is zero-sum.
- 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₀_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₀. - SuperSymmetry.SU5.FieldLabel.RParityThe R-Parity of a field, landing on
1if it is in the non-trivial representation and0otherwise. - GameTree.zermelo_determinacyZermelo's theorem (determinacy / saddle value). In a finite two-player zero-sum perfect-information game,
optStrategyis a saddle… - GameTree.IsZeroSum.child_memEvery child of a zero-sum node is zero-sum.
- 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.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 /-- A 2-player `GameTree` valued in `ℚ` is **zero-sum** if at every leaf the two players' payoffs sum to zero. -/ def GameTree.IsZeroSum : GameTree (Fin 2) ℚ → Prop | Leaf p => p 0 + p 1 = 0 | Node _ h t => IsZeroSum h ∧ ∀ c ∈ t, IsZeroSum c