The convex hull of finitely many vectors is a polyhedron
ProvedLinearOptimization.convex_hull_finite_is_polyhedron(Corollary 2.6) The convex hull of a finite number of vectors is a polyhedron.
(Proof route: the convex hull
of is the image of the polyhedron under the linear mapping .)
import Mathlib.Analysis.Convex.Hull import Definitions.Def_Polyhedron /-- **Bertsimas & Tsitsiklis, Corollary 2.6 (p. 74).** The convex hull of finitely many vectors in `ℝⁿ` admits a general-form polyhedral presentation. -/
theorem LinearOptimization.convex_hull_finite_is_polyhedron {n k : ℕ}
(v : Fin k → (Fin n → ℝ)) :
∃ (m' : ℕ) (A' : Matrix (Fin m') (Fin n) ℝ) (b' : Fin m' → ℝ),
convexHull ℝ (Set.range v) = polyhedron A' b' := by
sorry
Read-back
What the Lean code literally says, in plain math · claude-fable-5
For all natural numbers and every family of points , the theorem asserts the existence of a natural number , a real matrix , and such that the convex hull (over , in Mathlib's sense: the smallest convex superset) of the set equals the polyhedron . In words: the convex hull of finitely many points is a ""-form polyhedron. Edge case included: gives the convex hull of the empty set, namely , which must then be expressed as for some infeasible system; also for the claim is about subsets of the one-point space . No bound on is asserted.
Confirmed by the mission captain (proposal self-audit).