GameTree.HasOnlyRootSubgames
defimported Lean
A fixed GameTree has no proper subgames when every subtree is the root itself. This is the pure finite-tree analogue of having no nontrivial subgames.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {N U : Type*} [TotalPreorder U] in def GameTree.HasOnlyRootSubgames (g : GameTree N U) : Prop
- Defined in
- EconCSLib, `GameTree.HasOnlyRootSubgames`
- 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.HasOnlyRootSubgames← GameTree.HasOnlyRootSubgames (EconCSLib/GameTheory/ExtensiveGame/GameTreeNE.lean:69): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 3
- TotalPreorderA total preorder: a preorder where
≤is total (complete). This is weaker thanLinearOrder— it does NOT require antisymmetry or… - GameTree.Subtree
Subtree s g—soccurs as a subtree ofg. - GameTreeA finite extensive-form game of perfect information, without chance. *
Leaf payoff— a terminal state with a payoff vectorN → U. *…
- TotalPreorderA total preorder: a preorder where
- Used by 1
- 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…
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {N U : Type*} [TotalPreorder U] in /-- A fixed `GameTree` has no proper subgames when every subtree is the root itself. This is the pure finite-tree analogue of having no nontrivial subgames. -/ def GameTree.HasOnlyRootSubgames (g : GameTree N U) : Prop := ∀ s : GameTree N U, Subtree s g → s = g