GameTree.size
defimported Lean
Structural size, used for well-founded recursion.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {N U : Type*} in def GameTree.size : GameTree N U → ℕ
- Defined in
- EconCSLib, `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.GameTree.size← GameTree.size (EconCSLib/GameTheory/ExtensiveGame/GameTree.lean:74): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 1
- GameTreeA finite extensive-form game of perfect information, without chance. *
Leaf payoff— a terminal state with a payoff vectorN → U. *…
- GameTreeA finite extensive-form game of perfect information, without chance. *
- Used by 6
- GameTree.size_mem_tail_ltAny tail child is structurally smaller.
- GameTree.size_posSize is always positive.
- GameTree.size_mem_children_ltAny child (head or in tail) is structurally smaller than the node.
- GameTree.size_head_ltThe head of a
Node's children is structurally smaller. - GameTree.strong_inductionStrong induction: to prove
motive g, it suffices to handleLeafand, for eachNode, to prove the motive given the motive for… - GameTree.outcomeThe outcome (terminal payoff vector) of playing strategy
σstarting from game treeg. Walks down the tree, usingσto pick a child…
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {N U : Type*} in /-- Structural size, used for well-founded recursion. -/ def GameTree.size : GameTree N U → ℕ | Leaf _ => 1 | Node _ h t => 1 + h.size + (t.map size).sum