OnlineLearning.mixedStrategyNonempty
instanceimported Lean
The mixed-strategy space is nonempty whenever the underlying action set is nonempty.
Statement
set_option relaxedAutoImplicit false in set_option autoImplicit false in open Real Finset BigOperators in noncomputable instance OnlineLearning.mixedStrategyNonempty (n : ℕ) [NeZero n] : Nonempty (MixedStrategy n)
- Defined in
- TCSlib, `OnlineLearning.mixedStrategyNonempty`
- Lean proof
- By Karim Abdel Sadek, Mark Bedaywi, from github.com/Shilun-Allan-Li/tcslib at
c8a02591b1e5(Copyright (c) 2026 Karim Abdel Sadek and Mark Bedaywi. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.25.0.OnlineLearning.mixedStrategyNonempty← OnlineLearning.mixedStrategyNonempty (TCSlib/LearningTheory/Minimax/ConvexMinimaxCore.lean:79): verbatim
- Verified
- 07 Oct 2026
- Axioms
- none listed
- Built on 2
- MixedStrategyA mixed strategy over $n$ actions is a record consisting of a weight function $w : \mathrm{Fin}\,n \to \mathbb{R}$ together with…
- OnlineLearning.arbitraryMixedStrategyA concrete mixed strategy used only to prove that the type of mixed strategies is nonempty. It puts all mass on one arbitrary action.
- Used by 2
- OnlineLearning.finite_minimax_valueMinimax theorem for finite zero-sum games. Let $G$ be a finite two-player zero-sum game with $M$ row actions and $N$ column actions, whose…
- OnlineLearning.finiteLowerValue_le_upperValueWeak duality for finite zero-sum games. Let $G$ be a finite two-player zero-sum game with $M \geq 1$ row actions and $N \geq 1$ column…
Lean source view module on GitHub
set_option relaxedAutoImplicit false in set_option autoImplicit false in open Real Finset BigOperators in /-- The mixed-strategy space is nonempty whenever the underlying action set is nonempty. -/ noncomputable instance OnlineLearning.mixedStrategyNonempty (n : ℕ) [NeZero n] : Nonempty (MixedStrategy n) := ⟨arbitraryMixedStrategy n⟩