ExtensiveGame.ExtractsGameTree
inductiveimported Lean
ExtensiveGame.ExtractsGameTree
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {N U : Type*} (G : ExtensiveGame N U) in mutual inductive ExtensiveGame.ExtractsGameTree : G.State → GameTree N U → Prop
- Defined in
- EconCSLib, `ExtensiveGame.ExtractsGameTree`
- 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.ExtensiveGame.ExtractsGameTree← ExtensiveGame.ExtractsGameTree (EconCSLib/GameTheory/ExtensiveGame/FiniteArenaExtraction.lean:72): verbatimExtensiveGame.ExtractsGameTreeList← ExtensiveGame.ExtractsGameTreeList (EconCSLib/GameTheory/ExtensiveGame/FiniteArenaExtraction.lean:83): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 6
- ArenaA game arena: the pure dynamics of an extensive-form game. States, actions, and transitions are stored without players, payoffs, or…
- ControlledGameA payoff-free controlled extensive-game skeleton.
ControlledGameadds only a distinguished initial state and a mover label to the pure… - ExtensiveGame.isTerminalA state is terminal.
- GameTreeA finite extensive-form game of perfect information, without chance. *
Leaf payoff— a terminal state with a payoff vectorN → U. *… - ExtensiveGameA state-payoff extensive game: a payoff-free controlled game together with a convenient endpoint-state payoff. *
mover s= who controls… - ExtensiveGame.ActionListCompleteA nonempty action list
head :: tailcontains every available action at states. The list is an explicit finite enumeration supplied by…
- Used by 4
- ExtensiveGame.ExtractsGameTree.spe_on_to_nash_atOn any extracted tree, root-scoped subgame perfection implies root Nash equilibrium through the ordinary
GameTreeequilibrium API. - ExtensiveGame.extractTerminal_extractsThe certified terminal-state extractor satisfies the relational extraction interface.
- ExtensiveGame.ExtractsGameTree.node_head_reachableAt an extracted decision node, the head child is reached by one Arena transition and itself has an extracted subtree.
- ExtensiveGame.ExtractsGameTree.leaf_payoffIf an Arena state extracts to a leaf, the leaf payoff is exactly the Arena payoff at that state.
- ExtensiveGame.ExtractsGameTree.spe_on_to_nash_atOn any extracted tree, root-scoped subgame perfection implies root Nash equilibrium through the ordinary
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {N U : Type*} (G : ExtensiveGame N U) in mutual inductive ExtensiveGame.ExtractsGameTree : G.State → GameTree N U → Prop where | leaf (s : G.State) (hs : G.isTerminal s) : ExtractsGameTree s (GameTree.Leaf (G.payoff s)) | node (s : G.State) (i : N) (head : G.Action s) (tail : List (G.Action s)) (headTree : GameTree N U) (tailTrees : List (GameTree N U)) (hm : G.mover s = some i) (hcomplete : G.ActionListComplete s head tail) (hhead : ExtractsGameTree (G.next s head) headTree) (htail : ExtractsGameTreeList s tail tailTrees) : ExtractsGameTree s (GameTree.Node i headTree tailTrees) inductive ExtensiveGame.ExtractsGameTreeList : (s : G.State) → List (G.Action s) → List (GameTree N U) → Prop where | nil (s : G.State) : ExtractsGameTreeList s [] [] | cons (s : G.State) (head : G.Action s) (tail : List (G.Action s)) (headTree : GameTree N U) (tailTrees : List (GameTree N U)) (hhead : ExtractsGameTree (G.next s head) headTree) (htail : ExtractsGameTreeList s tail tailTrees) : ExtractsGameTreeList s (head :: tail) (headTree :: tailTrees) end