Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 2 — the LP–IP optimal value gap is at most nΔ(A)∥w∥1n\Delta(A)\|w\|_1nΔ(A)∥w∥1​

Proved
CookSensitivity.ChvatalRank.lp_ip_value_gap

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

integer-programmingintegrality-gapp2o-batch-pfp1ap2o-gran-per-chapterp2o-plan-paperp2o-v1proximity

Let AAA be an integral m×nm \times nm×n matrix, b∈Qmb\in\mathbb{Q}^mb∈Qm and w∈Qnw \in \mathbb{Q}^nw∈Qn such that Ax≤bAx\le bAx≤b has an integral solution and max⁡{wx:Ax≤b}\max\{wx : Ax \le b\}max{wx:Ax≤b} exists, attained at xˉ\bar xxˉ. Then max⁡{wx:Ax≤b, x integral}\max\{wx : Ax\le b,\ x \text{ integral}\}max{wx:Ax≤b, x integral} is attained at some zˉ\bar zzˉ, and

max⁡{wx:Ax≤b}−max⁡{wx:Ax≤b, x integral}=wxˉ−wzˉ≤n Δ(A) ∥w∥1.(4)\max\{wx : Ax \le b\} - \max\{wx : Ax\le b,\ x\text{ integral}\} = w\bar x - w\bar z \le n\,\Delta(A)\,\|w\|_1. \tag{4}max{wx:Ax≤b}−max{wx:Ax≤b, x integral}=wxˉ−wzˉ≤nΔ(A)∥w∥1​.(4)

This sharpens results of Blair and Jeroslow on the integrality gap and is the estimate (16) used in the proof of the Chvátal rank bound.

Formalization Note Existence of the integer optimum is part of the conclusion. No hypothesis A≠0A \neq 0A=0 is needed: for A=0A = 0A=0 the LP maximum exists only if w=0w = 0w=0.

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_value_gap {m n : ℕ} (A : Matrix (Fin m) (Fin n) ℤ)
    (b : Fin m → ℚ) (w : Fin n → ℚ)
    (hint : ∃ x ∈ polyhedron A b, IsIntegral x)
    (xbar : Fin n → ℚ) (hxbar : IsLPOptimal A b w xbar) :
    ∃ zbar, IsIPOptimal A b w zbar ∧
      w ⬝ᵥ xbar - w ⬝ᵥ zbar ≤ (n : ℚ) * (maxSubdet A : ℚ) * l1Norm w := by sorry

end CookSensitivity.ChvatalRank
Source
Cook, Gerards, Schrijver, Tardos, Sensitivity theorems in integer linear programming, Math. Programming 34 (1986), p. 253, Corollary 2, eq. (4)
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