Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§8.1, p. 138 — the linear programs (8.2) and (8.4) have the same optimum value

Proved
MatousekLP.ZeroSum.lp82_lp84_same_optimum

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. The linear programs (8.2) (maximize x0x_0x0​ subject to MTx−1x0≥0M^T\mathbf x - \mathbf 1x_0 \ge \mathbf 0MTx−1x0​≥0, ∑ixi=1\sum_i x_i = 1∑i​xi​=1, x≥0\mathbf x \ge \mathbf 0x≥0) and (8.4) (minimize y0y_0y0​ subject to My−1y0≤0M\mathbf y - \mathbf 1 y_0 \le \mathbf 0My−1y0​≤0, ∑jyj=1\sum_j y_j = 1∑j​yj​=1, y≥0\mathbf y \ge \mathbf 0y≥0) are dual to each other, and they have the same optimum value:

  1. (8.2) has an optimal solution;
  2. (8.4) has an optimal solution;
  3. for every optimal solution (x~0,x~)(\tilde x_0, \tilde{\mathbf x})(x~0​,x~) of (8.2) and every optimal solution (y~0,y~)(\tilde y_0, \tilde{\mathbf y})(y~​0​,y~​) of (8.4),
x~0=y~0.\tilde x_0 = \tilde y_0 .x~0​=y~​0​.

This is the point at which the duality theorem of linear programming enters the proof of the minimax theorem.

Formalization Note "Both programs have the same optimum value" is rendered as the existence of optimal solutions of both programs together with the equality of their objective values; no real supremum over a feasible set is used.

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

theorem lp82_lp84_same_optimum {m n : ℕ} (hm : 1 ≤ m) (hn : 1 ≤ n)
    (M : Matrix (Fin m) (Fin n) ℝ) :
    (∃ (x₀ : ℝ) (x : Fin m → ℝ), LP82Optimal M x₀ x) ∧
    (∃ (y₀ : ℝ) (y : Fin n → ℝ), LP84Optimal M y₀ y) ∧
    ∀ (x₀ : ℝ) (x : Fin m → ℝ) (y₀ : ℝ) (y : Fin n → ℝ),
      LP82Optimal M x₀ x → LP84Optimal M y₀ y → x₀ = y₀ := by sorry

end MatousekLP.ZeroSum
Source
Matoušek & Gärtner, Understanding and Using Linear Programming, Springer 2007, p. 138, §8.1, proof of Theorem 8.1.3 ("the two linear programs (8.2) and (8.4) are dual to each other … both programs have the same optimum value")
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