AFTD Auto-Formalizing Theoretical Domains

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.
Verified
08 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 13
Used by 2

Lean source view module on GitHub

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)
See it in the graphDiscuss this resultChallenge it