Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 8.1.2(i) — β(x) ≤ xᵀMy ≤ α(y), hence max β ≤ min α

Proved
MatousekLP.ZeroSum.weak_minimax

by mikedeng1 · Oct 3, 2026 · Mathlib 0df444a (Lean v4.33.1)

game-theoryp2o-batch-b23bp2o-gran-per-chapterp2o-plan-bookp2o-v1zero-sum-games

Let MMM be a real m×nm \times nm×n payoff matrix of a zero-sum game, m,n≥1m, n \ge 1m,n≥1, and let β(x)=min⁡yxTMy\beta(\mathbf x) = \min_{\mathbf y}\mathbf x^T M\mathbf yβ(x)=miny​xTMy and α(y)=max⁡xxTMy\alpha(\mathbf y) = \max_{\mathbf x}\mathbf x^T M \mathbf yα(y)=maxx​xTMy. Then

  1. β(x)≤α(y)\beta(\mathbf x) \le \alpha(\mathbf y)β(x)≤α(y) for all mixed strategies x\mathbf xx of Alice and y\mathbf yy of Bob, that is, max⁡xβ(x)≤min⁡yα(y)\max_{\mathbf x}\beta(\mathbf x) \le \min_{\mathbf y}\alpha(\mathbf y)maxx​β(x)≤miny​α(y);
  2. for every two mixed strategies x\mathbf xx and y\mathbf yy,
β(x)≤xTMy≤α(y).\beta(\mathbf x) \le \mathbf x^T M \mathbf y \le \alpha(\mathbf y).β(x)≤xTMy≤α(y).

This is the game-theoretic analogue of weak LP duality; the minimax theorem upgrades part 1 to an equality.

Formalization Note The book's max⁡xβ(x)≤min⁡yα(y)\max_{\mathbf x}\beta(\mathbf x) \le \min_{\mathbf y}\alpha(\mathbf y)maxx​β(x)≤miny​α(y) is stated as β(x)≤α(y)\beta(\mathbf x) \le \alpha(\mathbf y)β(x)≤α(y) for all mixed x,y\mathbf x, \mathbf yx,y, which is equivalent and does not presuppose that the maximum and minimum exist.

Preamble
import Mathlib
import Definitions.Def_MatousekLP_ZeroSum_Game
Formal statement
namespace MatousekLP.ZeroSum

theorem weak_minimax {m n : ℕ} (hm : 1 ≤ m) (hn : 1 ≤ n) (M : Matrix (Fin m) (Fin n) ℝ) :
    (∀ x ∈ stdSimplex ℝ (Fin m), ∀ y ∈ stdSimplex ℝ (Fin n), beta M x ≤ alpha M y) ∧
    (∀ x ∈ stdSimplex ℝ (Fin m), ∀ y ∈ stdSimplex ℝ (Fin n),
      beta M x ≤ payoff M x y ∧ payoff M x y ≤ alpha M y) := by sorry

end MatousekLP.ZeroSum
Source
Matoušek & Gärtner, Understanding and Using Linear Programming, Springer 2007, p. 135, Lemma 8.1.2(i)
Human review
  • Endorsed by Shuze Chen · Oct 5, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 5, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me