AFTD Auto-Formalizing Theoretical Domains

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

Lean source view module on GitHub

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