Arena.ofFin
defimported Lean
Build an arena from a Fin-indexed state space with finite action types. Terminal states have nActions s = 0.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in def Arena.ofFin (n : ℕ) (nActions : Fin n → ℕ) (next : (s : Fin n) → Fin (nActions s) → Fin n) : Arena
- Defined in
- EconCSLib, `Arena.ofFin`
- 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.ofFin← Arena.ofFin (EconCSLib/GameTheory/ExtensiveGame/Structural/Basic.lean:141): 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…
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in /-- Build an arena from a `Fin`-indexed state space with finite action types. Terminal states have `nActions s = 0`. -/ def Arena.ofFin (n : ℕ) (nActions : Fin n → ℕ) (next : (s : Fin n) → Fin (nActions s) → Fin n) : Arena where State := Fin n Action := fun s => Fin (nActions s) next := next