ExtensiveGame.TreeShapedFrom
defimported Lean
A weak tree-shapedness condition: any two paths from the root to the same state are equal as reachability proofs. This is intentionally proof-valued. Concrete finite extraction modules may replace it with a computable predecessor/history representation.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {N U : Type*} (G : ExtensiveGame N U) in def ExtensiveGame.TreeShapedFrom (root : G.State) : Prop
- Defined in
- EconCSLib, `ExtensiveGame.TreeShapedFrom`
- 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.TreeShapedFrom← ExtensiveGame.TreeShapedFrom (EconCSLib/GameTheory/ExtensiveGame/FiniteArenaExtraction.lean:46): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 4
- ArenaA game arena: the pure dynamics of an extensive-form game. States, actions, and transitions are stored without players, payoffs, or…
- Arena.ReachableA state
tis reachable fromsif a finite legal path leads fromstot. - 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 1
- ExtensiveGame.FiniteExtractableAssumptions under which an Arena-style game can be extracted to a finite no-chance
GameTree. The actual recursive extraction is…
- ExtensiveGame.FiniteExtractableAssumptions under which an Arena-style game can be extracted to a finite no-chance
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 weak tree-shapedness condition: any two paths from the root to the same state are equal as reachability proofs. This is intentionally proof-valued. Concrete finite extraction modules may replace it with a computable predecessor/history representation. -/ def ExtensiveGame.TreeShapedFrom (root : G.State) : Prop := ∀ s : G.State, Subsingleton (Arena.Reachable G.toArena root s)