AFTD Auto-Formalizing Theoretical Domains

ExtensiveGame.BehaviorProfile.IsCompletelyMixed.actionProb_pos

theoremverifiedformalizationimported Lean

At player-controlled states, a completely mixed behavior profile gives positive probability to every available action.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {iota U : Type*} in
theorem ExtensiveGame.BehaviorProfile.IsCompletelyMixed.actionProb_pos {G : ExtensiveGame iota U}
    [(s : G.State) -> Fintype (G.Action s)] {beta : G.BehaviorProfile}
    (hbeta : IsCompletelyMixed beta) {s : G.State} {i : iota}
    (hm : G.mover s = some i) (a : G.Action s) :
    0 < beta.actionProb s a
Formalizes
EconCSLib, `ExtensiveGame.BehaviorProfile.IsCompletelyMixed.actionProb_pos`
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
Classical.choiceQuot.soundpropext
Built on 11

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true invariable {iota U : Type*} in/-- At player-controlled states, a completely mixed behavior profile gives positive probability to every available action. -/theorem ExtensiveGame.BehaviorProfile.IsCompletelyMixed.actionProb_pos {G : ExtensiveGame iota U}    [(s : G.State) -> Fintype (G.Action s)] {beta : G.BehaviorProfile}    (hbeta : IsCompletelyMixed beta) {s : G.State} {i : iota}    (hm : G.mover s = some i) (a : G.Action s) :    0 < beta.actionProb s a := by  unfold actionProb  split  · rename_i j hs    exact hbeta j s hs (fun hterminal => hterminal.false a) a  · rename_i hs    rw [hm] at hs    cases hs
See it in the graphDiscuss this resultChallenge it