AFTD Auto-Formalizing Theoretical Domains

ExtensiveGame.reachableSubgameAt

defimported Lean

The subgame whose state space is restricted to states reachable from root. The older subgameAt view changes only the initial state. This subtype version is useful when a proof needs to express that deviations are local to the subtree below root.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {N : Type*} {U : Type*} in
def ExtensiveGame.reachableSubgameAt (G : ExtensiveGame iota U) (root : G.State) :
    ExtensiveGame iota U
Defined in
EconCSLib, `ExtensiveGame.reachableSubgameAt`
Lean proof
By xbei, Lazyfill (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…
  • Arena.ReachableA state t is reachable from s if a finite legal path leads from s to t.
  • Arena.Reachable.step'Taking one legal action extends a reachable path.
  • ControlledGameA payoff-free controlled extensive-game skeleton. ControlledGame adds 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 12

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {N : Type*} {U : Type*} in
/-- The subgame whose state space is restricted to states reachable from `root`. The older `subgameAt` view changes only the initial state. This subtype version is useful when a proof needs to express that deviations are local to the subtree below `root`. -/
def ExtensiveGame.reachableSubgameAt (G : ExtensiveGame iota U) (root : G.State) :
    ExtensiveGame iota U where
  State := {s : G.State // Arena.Reachable G.toArena root s}
  Action := fun s => G.Action s.1
  next := fun s a => ⟨G.next s.1 a, s.2.step' a⟩
  init := ⟨root, Arena.Reachable.refl _⟩
  mover := fun s => G.mover s.1
  payoff := fun s i => G.payoff s.1 i
See it in the graphDiscuss this resultChallenge it