GameTree.strong_induction
theoremverifiedformalizationimported Lean
Strong induction: to prove motive g, it suffices to handle Leaf and, for each Node, to prove the motive given the motive for every child (head or tail).
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open GameTree in variable {N U : Type*} in theorem GameTree.strong_induction {motive : GameTree N U → Prop} (base : ∀ p, motive (Leaf p)) (step : ∀ (m : N) (h : GameTree N U) (t : List (GameTree N U)), (∀ c ∈ h :: t, motive c) → motive (Node m h t)) (g : GameTree N U) : motive g
- Formalizes
- EconCSLib, `GameTree.strong_induction`
- 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.strong_induction← GameTree.strong_induction (EconCSLib/GameTheory/ExtensiveGame/GameTree.lean:171): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 6
- GameTree.size_mem_tail_ltAny tail child is structurally smaller.
- GameTree.size_posSize is always positive.
- GameTreeA finite extensive-form game of perfect information, without chance. *
Leaf payoff— a terminal state with a payoff vectorN → U. *… - GameTree.sizeStructural size, used for well-founded recursion.
- GameTree.size_head_ltThe head of a
Node's children is structurally smaller. - GameTree.childrenThe full child list at a
Node, as a guaranteed non-empty list.
- Used by 4
- GameTree.value_zero_sumBackward induction preserves the zero-sum invariant: if every terminal payoff vector is zero-sum, then the selected backward-induction…
- GameTree.outcome_zero_sumIn a zero-sum tree, the terminal outcome of any strategy is zero-sum: following any strategy ends at some leaf, and every leaf of a…
- GameTree.optStrategy_isSubgamePerfectOptimality of
optStrategy: for every subtreeg, every playeri, and everyi-variant deviationσ', the deviating outcome is… - GameTree.outcome_optStrategy_eq_valueKey lemma: the outcome of the backward-induction strategy equals the backward-induction value vector at every game tree. This is the…
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 inopen GameTree invariable {N U : Type*} in/-- **Strong induction**: to prove `motive g`, it suffices to handle `Leaf` and, for each `Node`, to prove the motive given the motive for every child (head or tail). -/theorem GameTree.strong_induction {motive : GameTree N U → Prop} (base : ∀ p, motive (Leaf p)) (step : ∀ (m : N) (h : GameTree N U) (t : List (GameTree N U)), (∀ c ∈ h :: t, motive c) → motive (Node m h t)) (g : GameTree N U) : motive g := by -- Well-founded recursion on `size`. suffices h : ∀ (n : ℕ) (g : GameTree N U), g.size ≤ n → motive g from h g.size g (Nat.le_refl _) intro n induction n with | zero => intro g hg exact absurd hg (Nat.not_le_of_lt (size_pos g)) | succ k ih => intro g hg cases g with | Leaf p => exact base p | Node m h t => apply step m h t intro c hmem apply ih c rcases List.mem_cons.mp hmem with rfl | hmem' · have := size_head_lt m c t omega · have := size_mem_tail_lt m h t hmem' omega