AFTD Auto-Formalizing Theoretical Domains

GameTree.IsZeroSum.child_mem

theoremverifiedformalizationimported Lean

Every child of a zero-sum node is zero-sum.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
theorem GameTree.IsZeroSum.child_mem {m : Fin 2} {h : GameTree (Fin 2) ℚ}
    {t : List (GameTree (Fin 2) ℚ)} {c : GameTree (Fin 2) ℚ}
    (hzs : IsZeroSum (Node m h t)) (hmem : c ∈ h :: t) :
    IsZeroSum c
Formalizes
EconCSLib, `GameTree.IsZeroSum.child_mem`
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 4
  • GameTree.IsZeroSum.tail_memEvery tail child of a zero-sum node is zero-sum.
  • GameTree.IsZeroSum.headThe head child of a zero-sum node is zero-sum.
  • GameTree.IsZeroSumA 2-player GameTree valued in ℚ is zero-sum if at every leaf the two players' payoffs sum to zero.
  • GameTreeA finite extensive-form game of perfect information, without chance. * Leaf payoff — a terminal state with a payoff vector N → U. *…
Used by 3
  • GameTree.value_zero_sumBackward induction preserves the zero-sum invariant: if every terminal payoff vector is zero-sum, then the selected backward-induction…
  • GameTree.value₀_Node_one_le_childAt a zero-sum player-1 node, value₀ is no greater than the value₀ 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…

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true in/-- Every child of a zero-sum node is zero-sum. -/theorem GameTree.IsZeroSum.child_mem {m : Fin 2} {h : GameTree (Fin 2) ℚ}    {t : List (GameTree (Fin 2) ℚ)} {c : GameTree (Fin 2) ℚ}    (hzs : IsZeroSum (Node m h t)) (hmem : c ∈ h :: t) :    IsZeroSum c := by  rcases List.mem_cons.mp hmem with rfl | hmem'  · exact IsZeroSum.head hzs  · exact IsZeroSum.tail_mem hzs hmem'
See it in the graphDiscuss this resultChallenge it