Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 8 (printed “Theorem 9”) — a lattice-free polyhedron vanishes after n2n2n3n^{2n}2^{n^3}n2n2n3 Chvátal closures

Proved
CookSensitivity.ChvatalRank.chvatalIter_eq_empty_of_no_integer_point

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

chvatal-rankcutting-planesinteger-programmingp2o-batch-pfp1ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let P⊆QnP\subseteq\mathbb{Q}^nP⊆Qn be a rational polyhedron containing no integral vector, P∩Zn=∅P \cap \mathbb{Z}^n = \emptysetP∩Zn=∅. Then the n2n2n3n^{2n}2^{n^3}n2n2n3-th Chvátal closure of PPP is empty:

P(n2n2n3)=∅.P^{(n^{2n}2^{n^3})} = \emptyset.P(n2n2n3)=∅.

The result is due to Cook, Coullard and Turán; it bounds the Chvátal rank of lattice-free polyhedra by a function of the dimension alone, and is used in the proofs of Corollary 9 and Theorem 10.

Formalization Note The page prints this result as "Theorem 9"; it is the paper's Theorem 8 (the proofs of Corollary 9 and Theorem 10 cite it as Theorem 8). "Polyhedron" is IsPolyhedron (finitely many rational inequalities); the iteration count is n ^ (2 * n) * 2 ^ (n ^ 3) in ℕ.

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

open Matrix

theorem chvatalIter_eq_empty_of_no_integer_point {n : ℕ} (P : Set (Fin n → ℚ))
    (hP : IsPolyhedron P) (hPZ : ∀ x ∈ P, ¬ IsIntegral x) :
    chvatalIter (n ^ (2 * n) * 2 ^ (n ^ 3)) P = ∅ := by sorry

end CookSensitivity.ChvatalRank
Source
Cook, Gerards, Schrijver, Tardos, Sensitivity theorems in integer linear programming, Math. Programming 34 (1986), p. 259, Theorem 9 [sic; cited as Theorem 8 on p. 260]
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