GameTree.IsZeroSum.tail_mem
theoremverifiedformalizationimported Lean
Every tail child of a zero-sum node is zero-sum.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in theorem GameTree.IsZeroSum.tail_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 ∈ t) : IsZeroSum c
- Formalizes
- EconCSLib, `GameTree.IsZeroSum.tail_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.GameTree.IsZeroSum.tail_mem← GameTree.IsZeroSum.tail_mem (EconCSLib/GameTheory/ExtensiveGame/Zermelo.lean:78): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 2
- GameTree.IsZeroSumA 2-player
GameTreevalued 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 vectorN → U. *…
- GameTree.IsZeroSumA 2-player
- Used by 2
- GameTree.IsZeroSum.of_subtreeZero-sumness is inherited by subgames.
- GameTree.IsZeroSum.child_memEvery child of a zero-sum node is zero-sum.
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
set_option autoImplicit true inset_option relaxedAutoImplicit true in/-- Every tail child of a zero-sum node is zero-sum. -/theorem GameTree.IsZeroSum.tail_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 ∈ t) : IsZeroSum c := by have hzs' : IsZeroSum h ∧ ∀ c ∈ t, IsZeroSum c := by simpa [IsZeroSum] using hzs exact hzs'.2 c hmem