Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 7.2.2 — the Goldman–Tucker system solves or refutes the LP

Proved
MatousekLP.InteriorPoint.goldman_tucker

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

dualityinterior-point-methodslinear-programmingp2o-batch-b23bp2o-gran-per-chapterp2o-plan-bookp2o-v1

Let AAA be a real m×nm\times nm×n matrix, b∈Rmb\in\mathbb{R}^mb∈Rm, c∈Rnc\in\mathbb{R}^nc∈Rn, and consider the linear program (7.7), maximize cTxc^{T}xcTx subject to Ax≤bAx\le bAx≤b, x≥0x\ge 0x≥0, with dual minimize bTyb^{T}ybTy subject to ATy≥cA^{T}y\ge cATy≥c, y≥0y\ge 0y≥0. The Goldman–Tucker system (GTS) is

Ax−τb≤0,−ATy+τc≤0,bTy−cTx≤0,x,y≥0, τ≥0,Ax-\tau b\le 0,\qquad -A^{T}y+\tau c\le 0,\qquad b^{T}y-c^{T}x\le 0,\qquad x,y\ge 0,\ \tau\ge 0,Ax−τb≤0,−ATy+τc≤0,bTy−cTx≤0,x,y≥0, τ≥0,

and ρ=ρ(x,y)=cTx−bTy\rho=\rho(x,y)=c^{T}x-b^{T}yρ=ρ(x,y)=cTx−bTy. Then:

  1. no solution (x,y,τ)(x,y,\tau)(x,y,τ) of (GTS) has both τ≠0\tau\neq 0τ=0 and ρ≠0\rho\neq 0ρ=0;
  2. exactly one of the following holds: (GTS) has a solution with τ>0\tau>0τ>0, or (GTS) has a solution with ρ>0\rho>0ρ>0;
  3. for every solution (x,y,τ)(x,y,\tau)(x,y,τ) of (GTS) with τ>0\tau>0τ>0, 1τx\frac1\tau xτ1​x is an optimal solution of (7.7) and 1τy\frac1\tau yτ1​y is an optimal solution of its dual;
  4. if (x,y,τ)(x,y,\tau)(x,y,τ) is a solution of (GTS) with ρ>0\rho>0ρ>0, then (7.7) is infeasible or unbounded.

The homogeneous system (GTS) thus encodes, in a single feasibility problem, both the optimal solutions of (7.7) and a certificate that no optimum exists.

Formalization Note Indices are Fin n and Fin m. Optimality of xxx (resp. yyy) is stated as feasibility together with cTx′≤cTxc^{T}x'\le c^{T}xcTx′≤cTx for all feasible x′x'x′ (resp. bTy≤bTy′b^{T}y\le b^{T}y'bTy≤bTy′ for all dual feasible y′y'y′); unboundedness means that for every real MMM some feasible xxx has cTx>Mc^{T}x>McTx>M. "Exactly one" is Xor.

Preamble
import Mathlib
import Definitions.Def_MatousekLP_InteriorPoint_SelfDual
Formal statement
namespace MatousekLP.InteriorPoint

open Matrix

/-- Lemma 7.2.2 (Matoušek & Gärtner, p. 126). For the linear program (7.7)
`maximize cᵀx subject to Ax ≤ b, x ≥ 0` and its Goldman–Tucker system (GTS), with
`ρ = cᵀx − bᵀy`:
1. no solution of (GTS) has both `τ` and `ρ` nonzero;
2. exactly one of the following occurs: (GTS) has a solution with `τ > 0`, or (GTS) has a
   solution with `ρ > 0`;
3. for every solution with `τ > 0`, `(1/τ)x` is an optimal solution of (7.7) and `(1/τ)y` is an
   optimal solution of its dual `minimize bᵀy subject to Aᵀy ≥ c, y ≥ 0`;
4. if (GTS) has a solution with `ρ > 0`, then (7.7) is infeasible or unbounded. -/
theorem goldman_tucker {m n : ℕ} (A : Matrix (Fin m) (Fin n) ℝ) (b : Fin m → ℝ)
    (c : Fin n → ℝ) :
    (∀ (x : Fin n → ℝ) (y : Fin m → ℝ) (τ : ℝ), IsGTSSolution A b c x y τ →
        τ = 0 ∨ gtsSlack b c x y = 0) ∧
    Xor (∃ (x : Fin n → ℝ) (y : Fin m → ℝ) (τ : ℝ), IsGTSSolution A b c x y τ ∧ 0 < τ)
      (∃ (x : Fin n → ℝ) (y : Fin m → ℝ) (τ : ℝ),
        IsGTSSolution A b c x y τ ∧ 0 < gtsSlack b c x y) ∧
    (∀ (x : Fin n → ℝ) (y : Fin m → ℝ) (τ : ℝ), IsGTSSolution A b c x y τ → 0 < τ →
        IsIneqOptimal A b c (τ⁻¹ • x) ∧ IsIneqDualOptimal A b c (τ⁻¹ • y)) ∧
    (∀ (x : Fin n → ℝ) (y : Fin m → ℝ) (τ : ℝ), IsGTSSolution A b c x y τ →
        0 < gtsSlack b c x y →
        (¬ ∃ x' : Fin n → ℝ, IsIneqFeasible A b x') ∨ IsIneqUnbounded A b c) := by sorry

end MatousekLP.InteriorPoint
Source
Matoušek & Gärtner, Understanding and Using Linear Programming, Springer 2007, §7.2, p. 126, Lemma 7.2.2 (with (7.7) and (GTS) p. 126)
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