Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 5 — optimal solutions move by at most nΔ(A)∥b−b′∥∞n\Delta(A)\|b-b'\|_\inftynΔ(A)∥b−b′∥∞​ (LP) and nΔ(A)(∥b−b′∥∞+2)n\Delta(A)(\|b-b'\|_\infty+2)nΔ(A)(∥b−b′∥∞​+2) (IP)

Proved
CookSensitivity.ChvatalRank.rhs_sensitivity

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

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

Let AAA be an integral m×nm\times nm×n matrix and b,b′∈Qmb, b' \in \mathbb{Q}^mb,b′∈Qm, w∈Qnw\in\mathbb{Q}^nw∈Qn such that max⁡{wx:Ax≤b}\max\{wx : Ax\le b\}max{wx:Ax≤b} and max⁡{wx:Ax≤b′}\max\{wx : Ax\le b'\}max{wx:Ax≤b′} both have optimal solutions. 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 xˉ′\bar x'xˉ′ of max⁡{wx:Ax≤b′}\max\{wx : Ax\le b'\}max{wx:Ax≤b′} with
∥xˉ−xˉ′∥∞≤n Δ(A) ∥b−b′∥∞;\|\bar x - \bar x'\|_\infty \le n\,\Delta(A)\,\|b-b'\|_\infty;∥xˉ−xˉ′∥∞​≤nΔ(A)∥b−b′∥∞​;
  1. if Ax≤bAx \le bAx≤b and Ax≤b′Ax\le b'Ax≤b′ both have integral solutions, then 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 zˉ′\bar z'zˉ′ of max⁡{wx:Ax≤b′, x integral}\max\{wx : Ax\le b',\ x\text{ integral}\}max{wx:Ax≤b′, x integral} with
∥zˉ−zˉ′∥∞≤n Δ(A) (∥b−b′∥∞+2).\|\bar z - \bar z'\|_\infty \le n\,\Delta(A)\,(\|b-b'\|_\infty + 2).∥zˉ−zˉ′∥∞​≤nΔ(A)(∥b−b′∥∞​+2).

A change of the right-hand side therefore moves optimal solutions, and hence optimal values, by an amount affine in ∥b−b′∥∞\|b - b'\|_\infty∥b−b′∥∞​, sharpening a result of Blair and Jeroslow.

Formalization Note No hypothesis A≠0A\ne0A=0 is needed; for A=0A = 0A=0 both parts hold with xˉ′=xˉ\bar x' = \bar xxˉ′=xˉ, zˉ′=zˉ\bar z' = \bar zzˉ′=zˉ.

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

open Matrix

theorem rhs_sensitivity {m n : ℕ} (A : Matrix (Fin m) (Fin n) ℤ)
    (b b' : Fin m → ℚ) (w : Fin n → ℚ)
    (hmax : ∃ x, IsLPOptimal A b w x) (hmax' : ∃ x, IsLPOptimal A b' w x) :
    (∀ xbar, IsLPOptimal A b w xbar →
      ∃ xbar', IsLPOptimal A b' w xbar' ∧
        supNorm (xbar - xbar') ≤ (n : ℚ) * (maxSubdet A : ℚ) * supNorm (b - b')) ∧
    ((∃ x ∈ polyhedron A b, IsIntegral x) → (∃ x ∈ polyhedron A b', IsIntegral x) →
      ∀ zbar, IsIPOptimal A b w zbar →
        ∃ zbar', IsIPOptimal A b' w zbar' ∧
          supNorm (zbar - zbar') ≤ (n : ℚ) * (maxSubdet A : ℚ) * (supNorm (b - b') + 2)) := by sorry

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