Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§8.1, p. 137 — max_x min_y xᵀMy = min_y max_x xᵀMy

Proved
MatousekLP.ZeroSum.minimax_equality

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

game-theoryminimaxp2o-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 with m,n≥1m, n \ge 1m,n≥1. Then

max⁡xmin⁡yxTMy=min⁡ymax⁡xxTMy,\max_{\mathbf x}\min_{\mathbf y}\mathbf x^T M \mathbf y = \min_{\mathbf y}\max_{\mathbf x}\mathbf x^T M \mathbf y ,xmax​ymin​xTMy=ymin​xmax​xTMy,

where x\mathbf xx ranges over the mixed strategies of Alice and y\mathbf yy over those of Bob. Both outer optima are attained: there is a number vvv that is the largest value of β(x)=min⁡yxTMy\beta(\mathbf x) = \min_{\mathbf y}\mathbf x^T M\mathbf yβ(x)=miny​xTMy over mixed x\mathbf xx and the smallest value of α(y)=max⁡xxTMy\alpha(\mathbf y) = \max_{\mathbf x}\mathbf x^T M\mathbf yα(y)=maxx​xTMy over mixed y\mathbf yy.

This equality is what gives the minimax theorem its name.

Formalization Note Stated as: there is vvv that is the greatest element of {β(x)}\{\beta(\mathbf x)\}{β(x)} and the least element of {α(y)}\{\alpha(\mathbf y)\}{α(y)}, over mixed strategies.

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

theorem minimax_equality {m n : ℕ} (hm : 1 ≤ m) (hn : 1 ≤ n)
    (M : Matrix (Fin m) (Fin n) ℝ) :
    ∃ v : ℝ, IsGreatest (beta M '' stdSimplex ℝ (Fin m)) v ∧
      IsLeast (alpha M '' stdSimplex ℝ (Fin n)) v := by sorry

end MatousekLP.ZeroSum
Source
Matoušek & Gärtner, Understanding and Using Linear Programming, Springer 2007, p. 137, §8.1 (display after Theorem 8.1.3)
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).

  • Endorsed by iris · Oct 31, 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