Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 8.1.3 — minimax theorem for zero-sum games

Proved
MatousekLP.ZeroSum.minimax_theorem

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

game-theoryminimaxnash-equilibriump2o-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 between Alice (m≥1m \ge 1m≥1 pure strategies) and Bob (n≥1n \ge 1n≥1 pure strategies), 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, the optima being over mixed strategies. Then:

  1. Alice has a worst-case optimal mixed strategy x~\tilde{\mathbf x}x~, i.e. β(x~)=max⁡xβ(x)\beta(\tilde{\mathbf x}) = \max_{\mathbf x}\beta(\mathbf x)β(x~)=maxx​β(x);
  2. Bob has a worst-case optimal mixed strategy y~\tilde{\mathbf y}y~​, i.e. α(y~)=min⁡yα(y)\alpha(\tilde{\mathbf y}) = \min_{\mathbf y}\alpha(\mathbf y)α(y~​)=miny​α(y);
  3. if x~\tilde{\mathbf x}x~ is any worst-case optimal mixed strategy of Alice and y~\tilde{\mathbf y}y~​ any worst-case optimal mixed strategy of Bob, then (x~,y~)(\tilde{\mathbf x}, \tilde{\mathbf y})(x~,y~​) is a mixed Nash equilibrium;
  4. there is a real number vvv such that for all worst-case optimal mixed strategies x~\tilde{\mathbf x}x~ of Alice and y~\tilde{\mathbf y}y~​ of Bob
β(x~)=x~TMy~=α(y~)=v.\beta(\tilde{\mathbf x}) = \tilde{\mathbf x}^T M \tilde{\mathbf y} = \alpha(\tilde{\mathbf y}) = v .β(x~)=x~TMy~​=α(y~​)=v.

The number vvv is the value of the game. The theorem says that "prepare for the worst" is an optimal policy in a zero-sum game: against a worst-case optimal strategy of the opponent, no player can do better than the value.

Formalization Note The book's clause that worst-case optimal strategies "can be efficiently computed by linear programming" is algorithmic and is not part of the formal statement. Clause 4 expresses "the number β(x~)=x~TMy~=α(y~)\beta(\tilde{\mathbf x}) = \tilde{\mathbf x}^T M \tilde{\mathbf y} = \alpha(\tilde{\mathbf y})β(x~)=x~TMy~​=α(y~​) is the same for all possible worst-case optimal mixed strategies" as a single vvv chosen before the strategies. The hypotheses m,n≥1m, n \ge 1m,n≥1 are the book's standing assumption of §8.1.

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

theorem minimax_theorem {m n : ℕ} (hm : 1 ≤ m) (hn : 1 ≤ n)
    (M : Matrix (Fin m) (Fin n) ℝ) :
    (∃ xt : Fin m → ℝ, IsWorstCaseOptimalAlice M xt) ∧
    (∃ yt : Fin n → ℝ, IsWorstCaseOptimalBob M yt) ∧
    (∀ (xt : Fin m → ℝ) (yt : Fin n → ℝ), IsWorstCaseOptimalAlice M xt →
      IsWorstCaseOptimalBob M yt → IsMixedNash M xt yt) ∧
    ∃ v : ℝ, ∀ (xt : Fin m → ℝ) (yt : Fin n → ℝ), IsWorstCaseOptimalAlice M xt →
      IsWorstCaseOptimalBob M yt →
        beta M xt = v ∧ payoff M xt yt = v ∧ alpha M yt = v := by sorry

end MatousekLP.ZeroSum
Source
Matoušek & Gärtner, Understanding and Using Linear Programming, Springer 2007, p. 136, Theorem 8.1.3 (Minimax theorem for zero-sum games)
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