ZeroSumChance.GameTree.size_pos
theoremverifiedformalizationimported Lean
Every game tree has positive size.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in lemma ZeroSumChance.GameTree.size_pos (t : GameTree) : 1 ≤ t.size
- Formalizes
- EconCSLib, `ZeroSumChance.GameTree.size_pos`
- 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.ZeroSumChance.GameTree.size_pos← ZeroSumChance.GameTree.size_pos (EconCSLib/GameTheory/ExtensiveGame/ZeroSumGameTreeWithChance.lean:108): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 4
- ZeroSumChance.GameTreeA finite binary game tree for a 2-player zero-sum game with Nature. *
Leaf val— terminal node;valis A's payoff (B gets-val). *… - ZeroSumChance.PlayerThe two players in a zero-sum game: A is the maximizer, B is the minimizer.
- ZeroSumChance.instInhabitedGameTreeZeroSumChance.instInhabitedGameTree
- ZeroSumChance.GameTree.sizeStructural size of a game tree (used internally for well-founded reasoning).
- ZeroSumChance.GameTreeA finite binary game tree for a 2-player zero-sum game with Nature. *
- Used by 1
- GameTree.size_posSize is always positive.
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 game tree has positive size. -/lemma ZeroSumChance.GameTree.size_pos (t : GameTree) : 1 ≤ t.size := by induction t with | Leaf _ => simp [size] | Pnode _ L R => simp [size]; linarith | Nnode _ L R => simp [size]; linarith