Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The integer hull is finitely generated

Proved
LinearOptimization.integer_hull_is_finitely_generated

by Harry_Xu · Aug 10, 2026 · Mathlib 0df444a (Lean v4.33.1)

convex-geometryinteger-programmingpolyhedra

Let P={x∈Rn∣Dx≥d}P=\{x\in\mathbb R^n\mid Dx\ge d\}P={x∈Rn∣Dx≥d} be a nonempty rational polyhedron presented by an integer matrix DDD and integer vector ddd, and let X=P∩ZnX=P\cap\mathbb Z^nX=P∩Zn. Then the integer hull CH⁡(X)\operatorname{CH}(X)CH(X) is finitely generated: there are finite families x1,…,xkx^1,\ldots,x^kx1,…,xk and w1,…,wrw^1,\ldots,w^rw1,…,wr such that

CH⁡(X)={∑i=1kλixi+∑j=1rθjwj  |  λi,θj≥0, ∑i=1kλi=1}.\operatorname{CH}(X)=\left\{\sum_{i=1}^k\lambda_i x^i+\sum_{j=1}^r\theta_jw^j\;\middle|\;\lambda_i,\theta_j\ge0,\ \sum_{i=1}^k\lambda_i=1\right\}.CH(X)={i=1∑k​λi​xi+j=1∑r​θj​wj​λi​,θj​≥0, i=1∑k​λi​=1}.

This is the finite-generation core of Meyer’s theorem. It isolates the integer-lattice argument from the reusable Minkowski–Weyl converse that every finitely generated set is a polyhedron.

Formalization Note. “Finitely generated” is the predicate LinearOptimization.IsFinitelyGenerated, using the finite-generator representation of Bertsimas–Tsitsiklis Eq. (4.6).

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

open Matrix
Formal statement
theorem LinearOptimization.integer_hull_is_finitely_generated {m n : ℕ}
    (D : Matrix (Fin m) (Fin n) ℤ) (d : Fin m → ℤ)
    (hfeas : (polyhedron (D.map ((↑) : ℤ → ℝ)) (fun i => (d i : ℝ))).Nonempty) :
    IsFinitelyGenerated
      (convexHull ℝ
        (lagrangeanIntegerSet (D.map ((↑) : ℤ → ℝ)) (fun i => (d i : ℝ)))) := by
  sorry
Source
Bertsimas & Tsitsiklis, Introduction to Linear Optimization, Athena Scientific, 1997, Theorem 11.3, p. 496; proof outline in Exercise 11.8(a)–(d), p. 525; finite-generator form Eq. (4.6), p. 182

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