AFTD Auto-Formalizing Theoretical Domains

FiniteImperfectGame.PureStrategy.actionAt

defimported Lean

The action prescribed at a concrete player-controlled state in an information set.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {N U : Type*} (G : FiniteImperfectGame N U) in
def FiniteImperfectGame.PureStrategy.actionAt {i : N} (σ : G.PureStrategy i) {s : G.State}
    {k : G.InfoSet} (hinfo : G.info s = some k) (hmover : G.mover s = some i) :
    G.Action s
Defined in
EconCSLib, `FiniteImperfectGame.PureStrategy.actionAt`
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 listed
Built on 2
  • FiniteImperfectGameFinite imperfect-information extensive game data. info s = none means the state is not in a strategic information set, typically because…
  • FiniteImperfectGame.PureStrategyA pure strategy chooses one abstract action for each player and information set. The action type is indexed by a representative state for…
Used by 1

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {N U : Type*} (G : FiniteImperfectGame N U) in
/-- The action prescribed at a concrete player-controlled state in an information set. -/
def FiniteImperfectGame.PureStrategy.actionAt {i : N} (σ : G.PureStrategy i) {s : G.State}
    {k : G.InfoSet} (hinfo : G.info s = some k) (hmover : G.mover s = some i) :
    G.Action s :=
  σ k s hinfo hmover
See it in the graphDiscuss this resultChallenge it