Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Convex hull of discrete ray generators

Proved
LinearOptimization.convexHull_natGenerated_eq_finitelyGeneratedSet

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

convex-geometryinteger-programminglinear-optimization

Let x1,…,xk∈Rnx^1,\ldots,x^k\in\mathbb{R}^nx1,…,xk∈Rn be finitely many base points and let w1,…,wr∈Rnw^1,\ldots,w^r\in\mathbb{R}^nw1,…,wr∈Rn be finitely many directions. Define the discrete generated set by choosing one base point and nonnegative integer multiples of the directions. Then its convex hull is exactly the finitely generated polyhedron obtained by allowing a convex combination of the base points and arbitrary nonnegative real multiples of the directions:

conv⁡{xi+∑j=1rqjwj:i∈{1,…,k}, qj∈Z≥0}={∑i=1kλixi+∑j=1rθjwj:λ,θ≥0, ∑iλi=1}.\operatorname{conv}\left\{x^i+\sum_{j=1}^r q_jw^j:i\in\{1,\ldots,k\},\ q_j\in\mathbb{Z}_{\ge 0}\right\}=\left\{\sum_{i=1}^k\lambda_i x^i+\sum_{j=1}^r\theta_jw^j:\lambda,\theta\ge0,\ \sum_i\lambda_i=1\right\}.conv{xi+j=1∑r​qj​wj:i∈{1,…,k}, qj​∈Z≥0​}={i=1∑k​λi​xi+j=1∑r​θj​wj:λ,θ≥0, i∑​λi​=1}.

This is the purely convex-geometric bridge used after the integer monoid has been finitely generated.

Preamble
import Mathlib.Analysis.Convex.Combination
import Mathlib.Algebra.Order.Floor.Ring
import Definitions.Def_LinearOptimization_FinitelyGeneratedSet
import Theorems.Thm_LinearOptimization_finitely_generated_is_polyhedron
Formal statement
theorem LinearOptimization.convexHull_natGenerated_eq_finitelyGeneratedSet {n k r : ℕ}
    (x : Fin k → (Fin n → ℝ)) (w : Fin r → (Fin n → ℝ)) :
    convexHull ℝ
        {y | ∃ (i : Fin k) (q : Fin r → ℕ),
          y = x i + ∑ j, (q j : ℝ) • w j} =
      finitelyGeneratedSet x w := by sorry
Source
Bertsimas and Tsitsiklis, Introduction to Linear Optimization (Athena Scientific, 1997), Exercise 11.8(c)-(d), p. 525; purely formal convexification bridge for the finite integer-generator representation in 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