OnlineLearning.finiteLowerValue
defimported Lean
For a finite zero-sum game $G$ with $M$ row actions and $N$ column actions, the lower value is \[ v^- (G) \;=\; \sup_{p \in \Delta_M}\; \inf_{j \in [N]}\; \mathrm{payoffVsPure}(G,p,j), \] where the row player maximises over mixed strategies and the column player minimises over pure responses.
Statement
set_option relaxedAutoImplicit false in set_option autoImplicit false in open Real Finset BigOperators in noncomputable def OnlineLearning.finiteLowerValue {M N : ℕ} (G : ZeroSumGame M N) : ℝ
- Defined in
- TCSlib, `OnlineLearning.finiteLowerValue`
- 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.finiteLowerValue← OnlineLearning.finiteLowerValue (TCSlib/LearningTheory/Minimax/ConvexMinimaxCore.lean:86): verbatim
- Verified
- 07 Oct 2026
- Axioms
- none listed
- Built on 3
- MixedStrategyA mixed strategy over $n$ actions is a record consisting of a weight function $w : \mathrm{Fin}\,n \to \mathbb{R}$ together with…
- ZeroSumGameA finite two-player zero-sum game with $M$ row actions and $N$ column actions is a record consisting of a payoff matrix…
- payoffVsPureGiven a game $G$, a mixed row strategy $p$, and a pure column $j$, the expected payoff against column $j$ is…
- 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 lower value of a finite zero-sum game: the supremum over row mixed strategies `p` of the infimum over pure columns `j` of the payoff of `p` against `j` (row commits to a mixed strategy, then column chooses the worst pure response). [CBL06, §7.2]. -/ noncomputable def OnlineLearning.finiteLowerValue {M N : ℕ} (G : ZeroSumGame M N) : ℝ := ⨆ p : MixedStrategy M, ⨅ j : Fin N, payoffVsPure G p j