Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§8.1, p. 135 — β and α are attained minimum and maximum

Proved
MatousekLP.ZeroSum.minimum_attained

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 with m,n≥1m, n \ge 1m,n≥1, and let β\betaβ, α\alphaα be the worst-case payoff functions of the zero-sum game MMM. Then for every mixed strategy x\mathbf xx of Alice the value β(x)\beta(\mathbf x)β(x) is attained by some mixed strategy of Bob, and for every mixed strategy y\mathbf yy of Bob the value α(y)\alpha(\mathbf y)α(y) is attained by some mixed strategy of Alice:

β(x)=min⁡yxTMy,α(y)=max⁡xxTMy.\beta(\mathbf x) = \min_{\mathbf y} \mathbf x^T M \mathbf y, \qquad \alpha(\mathbf y) = \max_{\mathbf x} \mathbf x^T M \mathbf y .β(x)=ymin​xTMy,α(y)=xmax​xTMy.

Precisely: β(x)\beta(\mathbf x)β(x) is a lower bound of all values xTMy\mathbf x^T M \mathbf yxTMy over mixed y\mathbf yy and equals one of them, and symmetrically for α(y)\alpha(\mathbf y)α(y).

This is the book's remark that β\betaβ and α\alphaα are well-defined because the optimization is over compact sets (the simplices of mixed strategies).

Formalization Note β\betaβ and α\alphaα are defined as the real sInf / sSup of the image of the simplex; this theorem is what makes those definitions agree with the book's min⁡\minmin and max⁡\maxmax. The hypotheses m,n≥1m, n \ge 1m,n≥1 are the book's standing assumption; without them a simplex is empty.

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

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

end MatousekLP.ZeroSum
Source
Matoušek & Gärtner, Understanding and Using Linear Programming, Springer 2007, p. 135, §8.1 ("β and α are well-defined functions, since we are optimizing over compact sets")
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