GameTree.outcome_optStrategy_zero_sum
theoremverifiedformalizationimported Lean
The terminal outcome reached by the backward-induction strategy is zero-sum whenever the game tree is zero-sum.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in theorem GameTree.outcome_optStrategy_zero_sum (g : GameTree (Fin 2) ℚ) (hzs : IsZeroSum g) : outcome (optStrategy : Strategy (Fin 2) ℚ) g 0 + outcome (optStrategy : Strategy (Fin 2) ℚ) g 1 = 0
- Formalizes
- EconCSLib, `GameTree.outcome_optStrategy_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_optStrategy_zero_sum← GameTree.outcome_optStrategy_zero_sum (EconCSLib/GameTheory/ExtensiveGame/Zermelo.lean:244): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 12
- GameTree.outcome_LeafGameTree.outcome_Leaf
- 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.outcome_NodeGameTree.outcome_Node
- 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.outcomeThe outcome (terminal payoff vector) of playing strategy
σstarting from game treeg. Walks down the tree, usingσto pick a child… - 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. - LinearOrder.toTotalPreorderEvery
LinearOrderis aTotalPreorder. - GameTree.value_LeafGameTree.value_Leaf
- GameTree.value_NodeGameTree.value_Node
- GameTree.valueList_nilGameTree.valueList_nil
- GameTree.valueList_consGameTree.valueList_cons
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in /-- The terminal outcome reached by the backward-induction strategy is zero-sum whenever the game tree is zero-sum. -/ theorem GameTree.outcome_optStrategy_zero_sum (g : GameTree (Fin 2) ℚ) (hzs : IsZeroSum g) : outcome (optStrategy : Strategy (Fin 2) ℚ) g 0 + outcome (optStrategy : Strategy (Fin 2) ℚ) g 1 = 0 := outcome_zero_sum optStrategy g hzs