AFTD Auto-Formalizing Theoretical Domains

GameTree.IsZeroSum.head

theoremverifiedformalizationimported Lean

The head child of a zero-sum node is zero-sum.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
theorem GameTree.IsZeroSum.head {m : Fin 2} {h : GameTree (Fin 2) ℚ}
    {t : List (GameTree (Fin 2) ℚ)} (hzs : IsZeroSum (Node m h t)) :
    IsZeroSum h
Formalizes
EconCSLib, `GameTree.IsZeroSum.head`
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 2
  • 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 4

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true in/-- The head child of a zero-sum node is zero-sum. -/theorem GameTree.IsZeroSum.head {m : Fin 2} {h : GameTree (Fin 2) ℚ}    {t : List (GameTree (Fin 2) ℚ)} (hzs : IsZeroSum (Node m h t)) :    IsZeroSum h := by  have hzs' : IsZeroSum h ∧ ∀ c ∈ t, IsZeroSum c := by    simpa [IsZeroSum] using hzs  exact hzs'.1
See it in the graphDiscuss this resultChallenge it