ExtensiveGame.isReachable_init
theoremverifiedformalizationimported Lean
The initial state is always reachable.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {N : Type*} {U : Type*} in theorem ExtensiveGame.isReachable_init (G : ExtensiveGame N U) : G.IsReachable G.init
- Formalizes
- EconCSLib, `ExtensiveGame.isReachable_init`
- Lean proof
- By 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.isReachable_init← ExtensiveGame.isReachable_init (EconCSLib/GameTheory/ExtensiveGame/Execution/Reachability.lean:42): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none — Lean reports it depends on no axioms
- Built on 4
- ControlledGame.isReachable_initThe initial state is reachable.
- ControlledGameA payoff-free controlled extensive-game skeleton.
ControlledGameadds only a distinguished initial state and a mover label to the pure… - ExtensiveGame.IsReachableA state is reachable in the game if it is reachable from
init. - 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 : Type*} {U : Type*} in /-- The initial state is always reachable. -/ theorem ExtensiveGame.isReachable_init (G : ExtensiveGame N U) : G.IsReachable G.init := ControlledGame.isReachable_init G.toControlledGame