ExtensiveGame.ActionListComplete
defimported Lean
A nonempty action list head :: tail contains every available action at state s. The list is an explicit finite enumeration supplied by the concrete game.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {N U : Type*} (G : ExtensiveGame N U) in def ExtensiveGame.ActionListComplete (s : G.State) (head : G.Action s) (tail : List (G.Action s)) : Prop
- Defined in
- EconCSLib, `ExtensiveGame.ActionListComplete`
- 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.ActionListComplete← ExtensiveGame.ActionListComplete (EconCSLib/GameTheory/ExtensiveGame/FiniteArenaExtraction.lean:61): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 3
- 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… - ExtensiveGameA state-payoff extensive game: a payoff-free controlled game together with a convenient endpoint-state payoff. *
mover s= who controls…
- Used by 3
- 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.ExtractsGameTreeExtensiveGame.ExtractsGameTree
- ExtensiveGame.ExtractsGameTree.leaf_payoffIf an Arena state extracts to a leaf, the leaf payoff is exactly the Arena payoff at that state.
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 /-- A nonempty action list `head :: tail` contains every available action at state `s`. The list is an explicit finite enumeration supplied by the concrete game. -/ def ExtensiveGame.ActionListComplete (s : G.State) (head : G.Action s) (tail : List (G.Action s)) : Prop := ∀ a : G.Action s, a ∈ head :: tail /- Relational extraction of an Arena-style no-chance extensive game state to a finite `GameTree`. The relation is intentionally assumption-explicit: each decision node supplies a complete nonempty action enumeration, a player owner, and extracted child trees for exactly that action list. -/