GameTree.Subtree
inductiveimported Lean
Subtree s g — s occurs as a subtree of g.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {N U : Type*} in inductive GameTree.Subtree : GameTree N U → GameTree N U → Prop
- Defined in
- EconCSLib, `GameTree.Subtree`
- 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.Subtree← GameTree.Subtree (EconCSLib/GameTheory/ExtensiveGame/GameTree.lean:124): 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 11
- GameTree.IsSubgamePerfectOnRoot-scoped subgame perfection on the subtrees of a fixed root.
IsSubgamePerfect σis global over everyGameTree N U. This predicate… - GameTree.IsZeroSum.of_subtreeZero-sumness is inherited by subgames.
- GameTree.HasOnlyRootSubgamesA fixed
GameTreehas no proper subgames when every subtree is the root itself. This is the pure finite-tree analogue of having no… - GameTree.Subtree.child_memAny child (head or tail) is a subtree.
- GameTree.IsNashAt.toSubgamePerfectOn_of_hasOnlyRootSubgamesIf a tree has no proper subgames, root Nash equilibrium already implies subgame perfection on that tree. This is the pure finite-tree form…
- GameTree.Subtree.transThe subtree relation is transitive. In game-theoretic terms, a subgame of a subgame is also a subgame of the original game.
- GameTree.IsSubgamePerfect.toSubgamePerfectOnA global subgame-perfect equilibrium is subgame-perfect on every fixed root.
- GameTree.Subtree.tail_memAny tail member of a
Nodeis a subtree of the node. - GameTree.Subtree.selfEvery tree is a subtree of itself.
- GameTree.Subtree.headThe head of a
Nodeis a subtree of the node. - GameTree.isSubgamePerfectOn_iff_forall_subtree_isNashAtRoot-scoped subgame perfection is equivalent to Nash equilibrium at every subtree of the root. This is the pure finite-tree form of MSZ…
- GameTree.IsSubgamePerfectOnRoot-scoped subgame perfection on the subtrees of a fixed root.
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {N U : Type*} in /-- `Subtree s g` — `s` occurs as a subtree of `g`. -/ inductive GameTree.Subtree : GameTree N U → GameTree N U → Prop | refl (g : GameTree N U) : Subtree g g | inHead (s : GameTree N U) (m : N) (h : GameTree N U) (t : List (GameTree N U)) (hs : Subtree s h) : Subtree s (Node m h t) | inTail (s : GameTree N U) (m : N) (h : GameTree N U) (t : List (GameTree N U)) {c : GameTree N U} (hmem : c ∈ t) (hs : Subtree s c) : Subtree s (Node m h t)