OnlineLearning.pureVsPayoff_nonneg
theoremverifiedimported Lean
Nonnegativity of a pure row's expected payoff. Let $G$ be a finite two-player zero-sum game with $M$ row actions and $N$ column actions, whose payoff matrix $A$ has entries satisfying $0 \le A_{ij} \le 1$. Fix a pure row action $i$ and a mixed column strategy $q$, so its weights $q_j$ are non-negative and sum to $1$. Then the expected payoff of row $i$ against $q$ is non-negative: \[ \sum_{j} A_{ij}\, q_j \;\ge\; 0. \]
Statement
set_option relaxedAutoImplicit false in set_option autoImplicit false in open Real Finset BigOperators in lemma OnlineLearning.pureVsPayoff_nonneg {M N : ℕ} (G : ZeroSumGame M N) (i : Fin M) (q : MixedStrategy N) : 0 ≤ pureVsPayoff G i q
- Source
- TCSlib, `OnlineLearning.pureVsPayoff_nonneg`
- 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.pureVsPayoff_nonneg← OnlineLearning.pureVsPayoff_nonneg (TCSlib/LearningTheory/Minimax/ConvexMinimaxCore.lean:115): verbatim
- Verified
- 07 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 3
- pureVsPayoffGiven a game $G$, a pure row $i$, and a mixed column strategy $q$, the expected payoff of row $i$ against $q$ is…
- 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…
- Used by 1
- OnlineLearning.finiteUpperValue_bddBelowLower boundedness of the row-supremum values. Let $G$ be a finite two-player zero-sum game with $M \ge 1$ row actions and $N$ column…
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/-- Expected payoff of a pure row against a mixed column is nonnegative. -/lemma OnlineLearning.pureVsPayoff_nonneg {M N : ℕ} (G : ZeroSumGame M N) (i : Fin M) (q : MixedStrategy N) : 0 ≤ pureVsPayoff G i q := by exact Finset.sum_nonneg fun j _ => mul_nonneg (G.payoff_nonneg i j) (q.nonneg j)