Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 6 — a non-optimal integral solution has an improving integral solution within distance nΔ(A)n\Delta(A)nΔ(A)

Proved
CookSensitivity.ChvatalRank.improving_vector_small

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

integer-programmingp2o-batch-pfp1ap2o-gran-per-chapterp2o-plan-paperp2o-v1test-set

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 consider the integer program max⁡{wx:Ax≤b, x integral}\max\{wx : Ax\le b,\ x \text{ integral}\}max{wx:Ax≤b, x integral}. Then for each integral solution zzz of Ax≤bAx\le bAx≤b, either zzz is an optimal solution of the integer program, or there is an integral solution zˉ\bar zzˉ of Ax≤bAx \le bAx≤b with

∥z−zˉ∥∞≤n Δ(A)andwzˉ>wz.\|z-\bar z\|_\infty \le n\,\Delta(A) \quad\text{and}\quad w\bar z > wz.∥z−zˉ∥∞​≤nΔ(A)andwzˉ>wz.

Thus the integral vectors with entries at most nΔ(A)n\Delta(A)nΔ(A) in absolute value form a test set for every integer program with constraint matrix AAA (improving on Graver and on Blair–Jeroslow); this is the ingredient that bounds the coefficients in Theorem 7.

Formalization Note No assumption that the integer program has an optimum is made: www is arbitrary. The hypothesis A≠0A\neq0A=0 is added: for A=0A=0A=0, w≠0w \ne 0w=0 and b≥0b \ge 0b≥0, no zzz is optimal and no zˉ\bar zzˉ at distance 000 improves on zzz.

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

open Matrix

theorem improving_vector_small {m n : ℕ} (A : Matrix (Fin m) (Fin n) ℤ) (hA : A ≠ 0)
    (b : Fin m → ℚ) (w : Fin n → ℚ)
    (z : Fin n → ℚ) (hz : IsIntegral z) (hzP : z ∈ polyhedron A b) :
    IsIPOptimal A b w z ∨
      ∃ zbar, IsIntegral zbar ∧ zbar ∈ polyhedron A b ∧
        supNorm (z - zbar) ≤ (n : ℚ) * (maxSubdet A : ℚ) ∧ w ⬝ᵥ zbar > w ⬝ᵥ z := by sorry

end CookSensitivity.ChvatalRank
Source
Cook, Gerards, Schrijver, Tardos, Sensitivity theorems in integer linear programming, Math. Programming 34 (1986), p. 256, Theorem 6
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