OnlineLearning.finiteLowerValue_bddAbove
theoremverifiedimported Lean
Row player's guaranteed payoffs are bounded above. Let $G$ be a finite two-player zero-sum game with $M$ row actions and $N \ge 1$ column actions, whose payoff matrix $(A_{ij})$ satisfies $0 \le A_{ij} \le 1$ for all $i,j$. For a mixed row strategy $p = (p_i)$ over the $M$ rows, let $L(p) = \inf_{j} \sum_i p_i A_{ij}$ be the least expected payoff against a pure column, taken over all $N$ columns. Then the set $\{\, L(p) : p \text{ is a mixed strategy over the rows} \,\}$ is bounded above.
Statement
set_option relaxedAutoImplicit false in set_option autoImplicit false in open Real Finset BigOperators in lemma OnlineLearning.finiteLowerValue_bddAbove {M N : ℕ} [NeZero N] (G : ZeroSumGame M N) : BddAbove (Set.range fun p : MixedStrategy M => ⨅ j : Fin N, payoffVsPure G p j)
- Source
- TCSlib, `OnlineLearning.finiteLowerValue_bddAbove`
- 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_bddAbove← OnlineLearning.finiteLowerValue_bddAbove (TCSlib/LearningTheory/Minimax/ConvexMinimaxCore.lean:132): verbatim
- Verified
- 07 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 5
- 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…
- OnlineLearning.payoffVsPure_nonnegNonnegativity of the mixed payoff against a pure column. Let $G$ be a finite two-player zero-sum game with $M$ row actions and $N$ column…
- OnlineLearning.payoffVsPure_le_oneExpected payoff against a pure column is at most one. Let $G$ be a finite two-player zero-sum game whose payoff matrix $A$ has every entry…
- payoffVsPureGiven a game $G$, a mixed row strategy $p$, and a pure column $j$, the expected payoff against column $j$ is…
- Used by 1
- 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…
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
set_option relaxedAutoImplicit false inset_option autoImplicit false inopen Real Finset BigOperators in/-- The set of row-guaranteed finite-game payoffs is bounded above by one. -/lemma OnlineLearning.finiteLowerValue_bddAbove {M N : ℕ} [NeZero N] (G : ZeroSumGame M N) : BddAbove (Set.range fun p : MixedStrategy M => ⨅ j : Fin N, payoffVsPure G p j) := by refine ⟨1, ?_⟩ rintro _ ⟨p, rfl⟩ have hbdd : BddBelow (Set.range (payoffVsPure G p)) := ⟨0, by rintro _ ⟨j, rfl⟩; exact payoffVsPure_nonneg G p j⟩ exact (ciInf_le hbdd (Classical.choice inferInstance)).trans (payoffVsPure_le_one G p _)