AFTD Auto-Formalizing Theoretical Domains

OnlineLearning.payoffVsPure_le_one

theoremverifiedimported Lean

Expected 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 in $[0,1]$, let $p$ be a mixed row strategy with weights $p_i$, and let $j$ be a fixed pure column action. Then the row player's expected payoff against column $j$ satisfies \[ \sum_i p_i \cdot A_{ij} \;\le\; 1. \]

Statement

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
open Real Finset BigOperators in
lemma OnlineLearning.payoffVsPure_le_one {M N : ℕ} (G : ZeroSumGame M N)
    (p : MixedStrategy M) (j : Fin N) :
    payoffVsPure G p j ≤ 1
Source
TCSlib, `OnlineLearning.payoffVsPure_le_one`
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.
Verified
07 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
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 1

Lean source view module on GitHub

set_option relaxedAutoImplicit false inset_option autoImplicit false inopen Real Finset BigOperators in/-- Expected payoff against a pure column is at most one because every payoff is at most one and the row mixed strategy has total mass one. -/lemma OnlineLearning.payoffVsPure_le_one {M N : ℕ} (G : ZeroSumGame M N)    (p : MixedStrategy M) (j : Fin N) :    payoffVsPure G p j ≤ 1 := by  calc payoffVsPure G p j      ≤ ∑ i : Fin M, p.weights i * 1 :=          Finset.sum_le_sum fun i _ =>            mul_le_mul_of_nonneg_left (G.payoff_le_one i j) (p.nonneg i)    _ = 1 := by simp [p.sum_one]
See it in the graphDiscuss this resultChallenge it