ExtensiveGame.reachableSubgameAt_init
theoremverifiedformalizationimported Lean
ExtensiveGame.reachableSubgameAt_init
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {N : Type*} {U : Type*} in @[simp] theorem ExtensiveGame.reachableSubgameAt_init (G : ExtensiveGame iota U) (root : G.State) : (G.reachableSubgameAt root).init = ⟨root, Arena.Reachable.refl _⟩
- Formalizes
- EconCSLib, `ExtensiveGame.reachableSubgameAt_init`
- 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.ExtensiveGame.reachableSubgameAt_init← ExtensiveGame.reachableSubgameAt_init (EconCSLib/GameTheory/ExtensiveGame/Subgame.lean:60): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none — Lean reports it depends on no axioms
- 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
tis reachable fromsif a finite legal path leads fromstot. - ExtensiveGame.reachableSubgameAtThe subgame whose state space is restricted to states reachable from
root. The oldersubgameAtview changes only the initial state.… - 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 2
- ExtensiveGame.BehaviorProfile.deviate_sameExtensiveGame.BehaviorProfile.deviate_same
- ExtensiveGame.ExtractsGameTree.spe_on_to_nash_atOn any extracted tree, root-scoped subgame perfection implies root Nash equilibrium through the ordinary
GameTreeequilibrium API.
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {N : Type*} {U : Type*} in @[simp] theorem ExtensiveGame.reachableSubgameAt_init (G : ExtensiveGame iota U) (root : G.State) : (G.reachableSubgameAt root).init = ⟨root, Arena.Reachable.refl _⟩ := rfl