Arena.Reachable
inductiveimported Lean
A state t is reachable from s if a finite legal path leads from s to t.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in inductive Arena.Reachable (A : Arena) : A.State → A.State → Prop
- Defined in
- EconCSLib, `Arena.Reachable`
- 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.Arena.Reachable← Arena.Reachable (EconCSLib/GameTheory/ExtensiveGame/Structural/Reachability.lean:25): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 1
- ArenaA game arena: the pure dynamics of an extensive-form game. States, actions, and transitions are stored without players, payoffs, or…
- Used by 18
- ExtensiveGame.reachableSubgameAt_nextExtensiveGame.reachableSubgameAt_next
- Arena.Reachable.transReachability is transitive.
- ExtensiveGame.BehaviorStrategy.restrictReachableSubgameRestrict a behavior strategy to the subtype subgame consisting only of states reachable from
root. - ControlledGame.IsReachableA state is reachable in a controlled game if it is reachable from its distinguished initial state.
- ExtensiveGame.reachableSubgameAt_action_fintypeExtensiveGame.reachableSubgameAt_action_fintype
- ExtensiveGame.reachableSubgameAt_moverExtensiveGame.reachableSubgameAt_mover
- ExtensiveGame.BehaviorStrategy.liftReachableSubgameLift a reachable-subgame behavior strategy to the original game, preserving the baseline strategy outside the reachable subgame.
- ControlledGame.isReachable_initThe initial state is reachable.
- Arena.Reachable.step'Taking one legal action extends a reachable path.
- ExtensiveGame.reachableSubgameAtThe subgame whose state space is restricted to states reachable from
root. The oldersubgameAtview changes only the initial state.… - ExtensiveGame.BehaviorProfile.restrictReachableSubgame_liftReachableSubgameExtensiveGame.BehaviorProfile.restrictReachableSubgame_liftReachableSubgame
- ExtensiveGame.ExtractsGameTree.node_head_reachableAt an extracted decision node, the head child is reached by one Arena transition and itself has an extracted subtree.
- ExtensiveGame.BehaviorStrategy.restrictReachableSubgame_liftReachableSubgameExtensiveGame.BehaviorStrategy.restrictReachableSubgame_liftReachableSubgame
- ExtensiveGame.reachableSubgameAt_isEmpty_decidableExtensiveGame.reachableSubgameAt_isEmpty_decidable
- ExtensiveGame.TreeShapedFromA weak tree-shapedness condition: any two paths from the root to the same state are equal as reachability proofs. This is intentionally…
- ExtensiveGame.reachableSubgameAt_initExtensiveGame.reachableSubgameAt_init
- ExtensiveGame.reachableSubgameAt_payoffExtensiveGame.reachableSubgameAt_payoff
- ExtensiveGame.BehaviorProfile.liftReachableSubgameLift a reachable-subgame behavior profile to the original game, preserving the baseline profile outside the reachable subgame.
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in /-- A state `t` is reachable from `s` if a finite legal path leads from `s` to `t`. -/ inductive Arena.Reachable (A : Arena) : A.State → A.State → Prop where | refl (s : A.State) : A.Reachable s s | step {s t : A.State} (a : A.Action s) (h : A.Reachable (A.next s a) t) : A.Reachable s t