Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lagrangean dual equals the LP over the convex hull of XXX

Proved
LinearOptimization.lagrangean_dual_eq_lp_over_hull

by Shuze Chen · Aug 9, 2026 · Mathlib c5ea003 (Lean v4.30.0)

convex-hulldualityinteger-programminglagrangean-duality

(Theorem 11.4, GOAL — Bertsimas & Tsitsiklis, p. 496, the central result of Section 11.4.) In the setting of Section 11.4 (integer program (11.5): minimize c′xc'xc′x subject to Ax≥bAx \ge bAx≥b, Dx≥dDx \ge dDx≥d, xxx integer, with AAA, DDD, bbb, ccc, ddd of integer entries; X={x integer∣Dx≥d}X = \{x\ \text{integer} \mid Dx \ge d\}X={x integer∣Dx≥d}; Z(p)=min⁡x∈X(c′x+p′(b−Ax))Z(p) = \min_{x \in X}(c'x + p'(b - Ax))Z(p)=minx∈X​(c′x+p′(b−Ax)) for p≥0p \ge 0p≥0; ZD=max⁡p≥0Z(p)Z_D = \max_{p \ge 0} Z(p)ZD​=maxp≥0​Z(p)):

the optimal value ZDZ_DZD​ of the Lagrangean dual is equal to the optimal cost of the following linear programming problem (11.9):

minimizec′xsubject toAx≥bx∈CH(X),\begin{aligned}\text{minimize}\quad & c'x\\ \text{subject to}\quad & Ax \ge b\\ & x \in CH(X),\end{aligned}minimizesubject to​c′xAx≥bx∈CH(X),​

where CH(X)CH(X)CH(X) is the convex hull of the set XXX.

Preamble
import Mathlib.Analysis.Convex.Hull
import Definitions.Def_LinearOptimization_IntegerProgram
import Definitions.Def_LinearOptimization_LagrangeanDual


open Matrix

/-- **Bertsimas & Tsitsiklis, Theorem 11.4 (p. 496).** The Lagrangean dual equals the linear
program over the convex hull of `X`:
`Z_D = min {c'x | Ax ≥ b, x ∈ CH(X)}` (as `EReal` values), provided
`X = ∅` or the right-hand LP is feasible. -/
Formal statement
theorem LinearOptimization.lagrangean_dual_eq_lp_over_hull {m₁ m₂ n : ℕ}
    (A : Matrix (Fin m₁) (Fin n) ℤ) (b : Fin m₁ → ℤ) (c : Fin n → ℤ)
    (D : Matrix (Fin m₂) (Fin n) ℤ) (d : Fin m₂ → ℤ)
    (hguard :
      lagrangeanIntegerSet (D.map ((↑) : ℤ → ℝ)) (fun i => (d i : ℝ)) = ∅ ∨
      {x : Fin n → ℝ | (fun i => (b i : ℝ)) ≤ (A.map ((↑) : ℤ → ℝ)).mulVec x ∧
        x ∈ convexHull ℝ (lagrangeanIntegerSet (D.map ((↑) : ℤ → ℝ))
          (fun i => (d i : ℝ)))}.Nonempty) :
    lagrangeanDualValue (A.map ((↑) : ℤ → ℝ)) (fun i => (b i : ℝ))
        (fun j => (c j : ℝ))
        (lagrangeanIntegerSet (D.map ((↑) : ℤ → ℝ)) (fun i => (d i : ℝ))) =
      lpValue (fun j => (c j : ℝ))
        {x : Fin n → ℝ |
          (fun i => (b i : ℝ)) ≤ (A.map ((↑) : ℤ → ℝ)).mulVec x ∧
          x ∈ convexHull ℝ (lagrangeanIntegerSet (D.map ((↑) : ℤ → ℝ))
            (fun i => (d i : ℝ)))} := by
  sorry
Source
Bertsimas & Tsitsiklis, Introduction to Linear Optimization, Athena Scientific, 1997, Theorem 11.4, p. 496
Read-back

What the Lean code literally says, in plain math · claude-fable-5

Fix integer data AAA (m1×nm_1\times nm1​×n), bbb, ccc, DDD (m2×nm_2\times nm2​×n), ddd, cast to R\mathbb{R}R. Let X={x∈Rn:Dx≥d, x integer-valued}X=\{x\in\mathbb{R}^n : Dx\ge d,\ x\ \text{integer-valued}\}X={x∈Rn:Dx≥d, x integer-valued} and let H={x:b≤Ax and x∈conv(X)}H=\{x : b\le Ax\ \text{and}\ x\in\mathrm{conv}(X)\}H={x:b≤Ax and x∈conv(X)}, the points of the convex hull of XXX that also satisfy the coupling constraints Ax≥bAx\ge bAx≥b. Guard hypothesis (a disjunction): either X=∅X=\emptysetX=∅, or HHH is nonempty. Conclusion: the extended-real equality

sup⁡p≥0 inf⁡x∈X(c⋅x+p⋅(b−Ax)) = inf⁡x∈H c⋅x,\sup_{p\ge0}\ \inf_{x\in X}\big(c\cdot x+p\cdot(b-Ax)\big)\ =\ \inf_{x\in H}\ c\cdot x,p≥0sup​ x∈Xinf​(c⋅x+p⋅(b−Ax)) = x∈Hinf​ c⋅x,

i.e. the Lagrangean dual value (dualizing Ax≥bAx\ge bAx≥b over the integer set XXX with componentwise-nonnegative multipliers p∈Rm1p\in\mathbb{R}^{m_1}p∈Rm1​) equals the value of the linear program minimizing c⋅xc\cdot xc⋅x over HHH. Degenerate reading: when X=∅X=\emptysetX=∅, every inner infimum is +∞+\infty+∞, so the left side is +∞+\infty+∞, and H⊆conv(∅)=∅H\subseteq\mathrm{conv}(\emptyset)=\emptysetH⊆conv(∅)=∅ makes the right side +∞+\infty+∞ as well. The guard excludes only the case "X≠∅X\ne\emptysetX=∅ but H=∅H=\emptysetH=∅"; both sides may be −∞-\infty−∞. Equality is asserted, not just an inequality.

Human review
  • Endorsed by Community (Bot) · Aug 9, 2026

  • Endorsed by Shuze Chen · Aug 9, 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