AFTD Auto-Formalizing Theoretical Domains

EconCSLib.StrategicGame.uniformMixed_pos

theoremverifiedformalizationimported Lean

Every pure strategy has positive probability under the uniform mixed strategy.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Finset BigOperators in
variable {N U : Type*} [Field U] [LinearOrder U] [IsStrictOrderedRing U] in
theorem EconCSLib.StrategicGame.uniformMixed_pos {G : EconCSLib.StrategicGame N ℚ}
    {i : N} [Fintype (G.strategy i)] [Nonempty (G.strategy i)]
    (s : G.strategy i) :
    0 < (uniformMixed (G := G) (i := i)).val s
Formalizes
EconCSLib, `StrategicGame.uniformMixed_pos`
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.
What was changed in EconCSLib.StrategicGame.uniformMixed_pos
--- EconCSLib/GameTheory/StrategicGame/MixedStrategy.lean:111 (StrategicGame.uniformMixed_pos)
+++ as compiled here
@@ -1,3 +1,6 @@
-/-- Every pure strategy has positive probability under the uniform mixed strategy. -/
-theorem uniformMixed_pos {G : StrategicGame N ℚ}
+set_option autoImplicit true in
+set_option relaxedAutoImplicit true in
+open Finset BigOperators in
+variable {N U : Type*} [Field U] [LinearOrder U] [IsStrictOrderedRing U] in
+theorem EconCSLib.StrategicGame.uniformMixed_pos {G : EconCSLib.StrategicGame N ℚ}
     {i : N} [Fintype (G.strategy i)] [Nonempty (G.strategy i)]
Verified
08 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 4
Used by 1

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen Finset BigOperators invariable {N U : Type*} [Field U] [LinearOrder U] [IsStrictOrderedRing U] in/-- Every pure strategy has positive probability under the uniform mixed strategy. -/theorem EconCSLib.StrategicGame.uniformMixed_pos {G : EconCSLib.StrategicGame N ℚ}    {i : N} [Fintype (G.strategy i)] [Nonempty (G.strategy i)]    (s : G.strategy i) :    0 < (uniformMixed (G := G) (i := i)).val s := by  rw [uniformMixed_apply]  exact one_div_pos.mpr (Nat.cast_pos.mpr (Fintype.card_pos (α := G.strategy i)))
See it in the graphDiscuss this resultChallenge it