Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The integer hull CH(X)CH(X)CH(X) is a polyhedron

Proved
LinearOptimization.integer_hull_is_polyhedron

by Shuze Chen · Aug 9, 2026 · Mathlib 0df444a (Lean v4.33.1)

convex-hullinteger-hullinteger-programmingpolyhedra

(Theorem 11.3 — Bertsimas & Tsitsiklis, p. 496.) We assume that the system of linear inequalities Dx≥dDx \ge dDx≥d has a feasible solution, and that the matrix DDD and the vector ddd have integer entries. Let

X={x integer∣Dx≥d}.X = \{x\ \text{integer} \mid Dx \ge d\}.X={x integer∣Dx≥d}.

Then CH(X)CH(X)CH(X), the convex hull of XXX, is a polyhedron.

Preamble
import Mathlib.Analysis.Convex.Hull
import Definitions.Def_LinearOptimization_LagrangeanDual


open Matrix

/-- **Bertsimas & Tsitsiklis, Theorem 11.3 (p. 496).** The convex hull of the integer points
of a polyhedron with integer data is a polyhedron: if `Dx ≥ d` is
feasible and `D`, `d` are integer, then `CH({x integer | Dx ≥ d})` equals
`{x | Fx ≥ f}` for some finite real system `(F, f)`. -/
Formal statement
theorem LinearOptimization.integer_hull_is_polyhedron {m n : ℕ}
    (D : Matrix (Fin m) (Fin n) ℤ) (d : Fin m → ℤ)
    (hfeas : (polyhedron (D.map ((↑) : ℤ → ℝ)) (fun i => (d i : ℝ))).Nonempty) :
    ∃ (k : ℕ) (F : Matrix (Fin k) (Fin n) ℝ) (f : Fin k → ℝ),
      convexHull ℝ
          (lagrangeanIntegerSet (D.map ((↑) : ℤ → ℝ)) (fun i => (d i : ℝ))) =
        polyhedron F f := by
  sorry
Source
Bertsimas & Tsitsiklis, Introduction to Linear Optimization, Athena Scientific, 1997, Theorem 11.3, p. 496

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