ZeroSumChance.GameTree.size
defimported Lean
Structural size of a game tree (used internally for well-founded reasoning).
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in def ZeroSumChance.GameTree.size : GameTree → ℕ
- Defined in
- EconCSLib, `ZeroSumChance.GameTree.size`
- 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← ZeroSumChance.GameTree.size (EconCSLib/GameTheory/ExtensiveGame/ZeroSumGameTreeWithChance.lean:102): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 3
- 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.GameTreeA finite binary game tree for a 2-player zero-sum game with Nature. *
- Used by 1
- ZeroSumChance.GameTree.size_posEvery game tree has positive size.
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in /-- Structural size of a game tree (used internally for well-founded reasoning). -/ def ZeroSumChance.GameTree.size : GameTree → ℕ | Leaf _ => 1 | Pnode _ L R => L.size + R.size | Nnode _ L R => L.size + R.size