AFTD Auto-Formalizing Theoretical Domains

ExtensiveGame.FiniteExtractable

structureimported Lean

Assumptions under which an Arena-style game can be extracted to a finite no-chance GameTree. The actual recursive extraction is intentionally not bundled here; users provide a finite unfolding depth or well-founded child enumeration appropriate for their concrete game.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {N U : Type*} (G : ExtensiveGame N U) in
structure ExtensiveGame.FiniteExtractable : Prop
Defined in
EconCSLib, `ExtensiveGame.FiniteExtractable`
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.
Verified
08 Oct 2026
Axioms
none listed
Built on 5
  • ArenaA game arena: the pure dynamics of an extensive-form game. States, actions, and transitions are stored without players, payoffs, or…
  • ExtensiveGame.NoChanceNo chance nodes: every nonterminal state has a strategic mover.
  • ControlledGameA payoff-free controlled extensive-game skeleton. ControlledGame adds only a distinguished initial state and a mover label to the pure…
  • ExtensiveGame.TreeShapedFromA weak tree-shapedness condition: any two paths from the root to the same state are equal as reachability proofs. This is intentionally…
  • ExtensiveGameA state-payoff extensive game: a payoff-free controlled game together with a convenient endpoint-state payoff. * mover s = who controls…

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
/-- Assumptions under which an Arena-style game can be extracted to a finite no-chance `GameTree`. The actual recursive extraction is intentionally not bundled here; users provide a finite unfolding depth or well-founded child enumeration appropriate for their concrete game. -/
structure ExtensiveGame.FiniteExtractable : Prop where
  state_finite : Nonempty (Fintype G.State)
  no_chance : G.NoChance
  tree_shaped : G.TreeShapedFrom G.init
See it in the graphDiscuss this resultChallenge it