Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§8.1, p. 137 — the dual of (8.1) has optimal value β(x)

Proved
MatousekLP.ZeroSum.dual81_value

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

linear-programminglp-dualityp2o-batch-b23bp2o-gran-per-chapterp2o-plan-bookp2o-v1zero-sum-games

Let MMM be a real m×nm \times nm×n payoff matrix, m,n≥1m, n \ge 1m,n≥1, and let x\mathbf xx be a mixed strategy of Alice. The value β(x)=min⁡yxTMy\beta(\mathbf x) = \min_{\mathbf y}\mathbf x^T M\mathbf yβ(x)=miny​xTMy is the optimal value of the linear program (8.1): minimize xTMy\mathbf x^T M \mathbf yxTMy subject to ∑j=1nyj=1\sum_{j=1}^n y_j = 1∑j=1n​yj​=1, y≥0\mathbf y \ge \mathbf 0y≥0. Its dual is the one-variable program

maximize x0subject toMTx−1x0≥0,\text{maximize } x_0 \quad\text{subject to}\quad M^T\mathbf x - \mathbf 1 x_0 \ge \mathbf 0 ,maximize x0​subject toMTx−1x0​≥0,

and its optimal value is again β(x)\beta(\mathbf x)β(x): the number β(x)\beta(\mathbf x)β(x) is feasible for this dual program, and every feasible x0x_0x0​ satisfies x0≤β(x)x_0 \le \beta(\mathbf x)x0​≤β(x).

This identity is what allows the maximization of the nonlinear function β\betaβ over Alice's mixed strategies to be written as the linear program (8.2).

Formalization Note "Optimal value" is stated as IsGreatest of the feasible set of the dual program, so the statement includes that the maximum is attained.

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

theorem dual81_value {m n : ℕ} (hm : 1 ≤ m) (hn : 1 ≤ n)
    (M : Matrix (Fin m) (Fin n) ℝ) (x : Fin m → ℝ) (hx : x ∈ stdSimplex ℝ (Fin m)) :
    IsGreatest {x₀ : ℝ | DualLP81Feasible M x x₀} (beta M x) := by sorry

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