AFTD Auto-Formalizing Theoretical Domains

ExtensiveGame.ExtractsGameTree.node_head_reachable

theoremverifiedformalizationimported Lean

At an extracted decision node, the head child is reached by one Arena transition and itself has an extracted subtree.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {N U : Type*} (G : ExtensiveGame N U) in
theorem ExtensiveGame.ExtractsGameTree.node_head_reachable {s : G.State} {i : N}
    {headTree : GameTree N U} {tailTrees : List (GameTree N U)}
    (h : ExtractsGameTree G s (GameTree.Node i headTree tailTrees)) :
    ∃ head : G.Action s,
      Arena.Reachable G.toArena s (G.next s head) ∧
        ExtractsGameTree G (G.next s head) headTree
Formalizes
EconCSLib, `ExtensiveGame.ExtractsGameTree.node_head_reachable`
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 — Lean reports it depends on no axioms
Built on 8
  • 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.
  • 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. *…
  • ExtensiveGame.ExtractsGameTreeExtensiveGame.ExtractsGameTree
  • ExtensiveGameA state-payoff extensive game: a payoff-free controlled game together with a convenient endpoint-state payoff. * mover s = who controls…
  • ExtensiveGame.ActionListCompleteA nonempty action list head :: tail contains every available action at state s. The list is an explicit finite enumeration supplied by…

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true invariable {N U : Type*} (G : ExtensiveGame N U) in/-- At an extracted decision node, the head child is reached by one Arena transition and itself has an extracted subtree. -/theorem ExtensiveGame.ExtractsGameTree.node_head_reachable {s : G.State} {i : N}    {headTree : GameTree N U} {tailTrees : List (GameTree N U)}    (h : ExtractsGameTree G s (GameTree.Node i headTree tailTrees)) :    ∃ head : G.Action s,      Arena.Reachable G.toArena s (G.next s head) ∧        ExtractsGameTree G (G.next s head) headTree := by  cases h with  | node s i head tail headTree tailTrees hm hcomplete hhead htail =>      exact ⟨head, Arena.Reachable.step head (Arena.Reachable.refl _), hhead⟩
See it in the graphDiscuss this resultChallenge it