AFTD Auto-Formalizing Theoretical Domains

ExtensiveGame.extractTerminalGameTree

defimported Lean

Terminal states extract to one-leaf GameTrees.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {N U : Type*} (G : ExtensiveGame N U) in
def ExtensiveGame.extractTerminalGameTree (s : G.State) (_hs : G.isTerminal s) : GameTree N U
Defined in
EconCSLib, `ExtensiveGame.extractTerminalGameTree`
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…
  • ControlledGameA payoff-free controlled extensive-game skeleton. ControlledGame adds 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 vector N → U. *…
  • ExtensiveGameA state-payoff extensive game: a payoff-free controlled game together with a convenient endpoint-state payoff. * mover s = who controls…
Used by 2

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
/-- Terminal states extract to one-leaf `GameTree`s. -/
def ExtensiveGame.extractTerminalGameTree (s : G.State) (_hs : G.isTerminal s) : GameTree N U :=
  GameTree.Leaf (G.payoff s)
See it in the graphDiscuss this resultChallenge it