Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 1 — LP and IP optima lie within ℓ∞\ell_\inftyℓ∞​-distance nΔ(A)n\Delta(A)nΔ(A) of each other

Proved
CookSensitivity.ChvatalRank.lp_ip_proximity

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

integer-programmingp2o-batch-pfp1ap2o-gran-per-chapterp2o-plan-paperp2o-v1proximitysensitivity

Let AAA be a nonzero integral m×nm\times nm×n matrix, b∈Qmb \in \mathbb{Q}^mb∈Qm, w∈Qnw \in \mathbb{Q}^nw∈Qn, and let Δ(A)\Delta(A)Δ(A) be the largest absolute value of a subdeterminant of AAA. Suppose Ax≤bAx \le bAx≤b has an integral solution and max⁡{wx:Ax≤b}\max\{wx : Ax \le b\}max{wx:Ax≤b} exists. Then

  1. for each optimal solution xˉ\bar xxˉ of max⁡{wx:Ax≤b}\max\{wx : Ax\le b\}max{wx:Ax≤b} there is an optimal solution z∗z^*z∗ of max⁡{wx:Ax≤b, x integral}\max\{wx : Ax \le b,\ x \text{ integral}\}max{wx:Ax≤b, x integral} with
∥xˉ−z∗∥∞≤n Δ(A);\|\bar x - z^*\|_\infty \le n\,\Delta(A);∥xˉ−z∗∥∞​≤nΔ(A);
  1. for each optimal solution zˉ\bar zzˉ of max⁡{wx:Ax≤b, x integral}\max\{wx : Ax \le b,\ x \text{ integral}\}max{wx:Ax≤b, x integral} there is an optimal solution x∗x^*x∗ of max⁡{wx:Ax≤b}\max\{wx : Ax\le b\}max{wx:Ax≤b} with ∥zˉ−x∗∥∞≤n Δ(A)\|\bar z - x^*\|_\infty \le n\,\Delta(A)∥zˉ−x∗∥∞​≤nΔ(A).

In particular the integer program has an optimal solution. The bound depends only on the number of variables and on AAA, not on bbb or www; it is the basis of every other proximity and sensitivity result of the paper.

Formalization Note The hypothesis A≠0A \ne 0A=0 is added. For A=0A = 0A=0 one has Δ(A)=0\Delta(A) = 0Δ(A)=0, and with w=0w = 0w=0, b≥0b \ge 0b≥0 and a non-integral xˉ\bar xxˉ part 1 would ask for an integral point at distance 000, which is false; the paper's proof assumes it implicitly (cf. "we may assume A≠0A \neq 0A=0", p. 257).

Preamble
import Mathlib
import Definitions.Def_CookSensitivity_ChvatalRank_maxSubdet
import Definitions.Def_CookSensitivity_ChvatalRank_IntegerProgram
Formal statement
namespace CookSensitivity.ChvatalRank

open Matrix

theorem lp_ip_proximity {m n : ℕ} (A : Matrix (Fin m) (Fin n) ℤ) (hA : A ≠ 0)
    (b : Fin m → ℚ) (w : Fin n → ℚ)
    (hint : ∃ x ∈ polyhedron A b, IsIntegral x)
    (hmax : ∃ x, IsLPOptimal A b w x) :
    (∀ xbar, IsLPOptimal A b w xbar →
      ∃ zstar, IsIPOptimal A b w zstar ∧
        supNorm (xbar - zstar) ≤ (n : ℚ) * (maxSubdet A : ℚ)) ∧
    (∀ zbar, IsIPOptimal A b w zbar →
      ∃ xstar, IsLPOptimal A b w xstar ∧
        supNorm (zbar - xstar) ≤ (n : ℚ) * (maxSubdet A : ℚ)) := by sorry

end CookSensitivity.ChvatalRank
Source
Cook, Gerards, Schrijver, Tardos, Sensitivity theorems in integer linear programming, Math. Programming 34 (1986), p. 252, Theorem 1
Human review
  • Endorsed by Shuze Chen · Oct 4, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 4, 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