AFTD Auto-Formalizing Theoretical Domains

ExtensiveGame.BehaviorStrategy.IsCompletelyMixed

defimported Lean

A behavior strategy is completely mixed if every available action at every state controlled by the player receives positive probability. This is the state-based behavior-strategy part of MSZ Definition 7.6. The later imperfect-information layer can identify states inside the same information set; this predicate is already the local full-support condition used by the current Arena-based behavior-strategy API.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {iota U : Type*} in
def ExtensiveGame.BehaviorStrategy.IsCompletelyMixed {G : ExtensiveGame iota U}
    [(s : G.State) -> Fintype (G.Action s)] {i : iota}
    (beta : G.BehaviorStrategy i) : Prop
Defined in
EconCSLib, `ExtensiveGame.BehaviorStrategy.IsCompletelyMixed`
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.
Verified
08 Oct 2026
Axioms
none listed
Built on 9
Used by 2

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {iota U : Type*} in
/-- A behavior strategy is completely mixed if every available action at every state controlled by the player receives positive probability. This is the state-based behavior-strategy part of MSZ Definition 7.6. The later imperfect-information layer can identify states inside the same information set; this predicate is already the local full-support condition used by the current Arena-based behavior-strategy API. -/
def ExtensiveGame.BehaviorStrategy.IsCompletelyMixed {G : ExtensiveGame iota U}
    [(s : G.State) -> Fintype (G.Action s)] {i : iota}
    (beta : G.BehaviorStrategy i) : Prop :=
  forall (s : G.State) (h : G.mover s = some i)
    (hnonterminal : ¬ G.isTerminal s) (a : G.Action s),
    0 < (beta s h hnonterminal).val a
See it in the graphDiscuss this resultChallenge it