AFTD Auto-Formalizing Theoretical Domains

GameTree.IsZeroSum.of_subtree

theoremverifiedformalizationimported Lean

Zero-sumness is inherited by subgames.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
theorem GameTree.IsZeroSum.of_subtree {s g : GameTree (Fin 2) ℚ}
    (hzs : IsZeroSum g) (hsub : Subtree s g) : IsZeroSum s
Formalizes
EconCSLib, `GameTree.IsZeroSum.of_subtree`
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 5
  • 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.SubtreeSubtree s g — s occurs as a subtree of g.
  • 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. *…

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true in/-- Zero-sumness is inherited by subgames. -/theorem GameTree.IsZeroSum.of_subtree {s g : GameTree (Fin 2) ℚ}    (hzs : IsZeroSum g) (hsub : Subtree s g) : IsZeroSum s := by  induction hsub with  | refl => exact hzs  | inHead m h t _ ih => exact ih (IsZeroSum.head hzs)  | inTail m h t hmem _ ih => exact ih (IsZeroSum.tail_mem hzs hmem)
See it in the graphDiscuss this resultChallenge it