Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A nonempty bounded polyhedron is the convex hull of its extreme points

Proved
LinearOptimization.polyhedron_bounded_convex_hull_extreme

by Shuze Chen · Aug 5, 2026 · Mathlib c5ea003 (Lean v4.30.0)

convexityextreme-pointspolyhedra

(Theorem 2.9 = Corollary 4.4) A nonempty and bounded polyhedron is the convex hull of its extreme points.

Preamble
import Mathlib.Analysis.Convex.Hull
import Mathlib.Analysis.Convex.Extreme
import Definitions.Def_Polyhedron


/-- **Bertsimas & Tsitsiklis, Theorem 2.9 (p. 68) = Corollary 4.4 (p. 182).** A nonempty
bounded polyhedron equals the convex hull of its extreme points. -/
Formal statement
theorem LinearOptimization.polyhedron_bounded_convex_hull_extreme {m n : ℕ}
    (A : Matrix (Fin m) (Fin n) ℝ) (b : Fin m → ℝ)
    (hne : (polyhedron A b).Nonempty)
    (hbd : IsBoundedSet (polyhedron A b)) :
    polyhedron A b =
      convexHull ℝ (Set.extremePoints ℝ (polyhedron A b)) := by
  sorry
Source
Bertsimas & Tsitsiklis, Introduction to Linear Optimization, Athena Scientific, 1997, Theorem 2.9, p. 68; restated as Corollary 4.4, p. 182
Read-back

What the Lean code literally says, in plain math · claude-fable-5

For all m,n≥0m, n \ge 0m,n≥0, every m×nm \times nm×n real matrix AAA and b∈Rmb \in \mathbb{R}^mb∈Rm: if the polyhedron P={x∈Rn:Ax≥b componentwise}P = \{x \in \mathbb{R}^n : A x \ge b \text{ componentwise}\}P={x∈Rn:Ax≥b componentwise} is (i) nonempty and (ii) bounded in the sense that a single constant K∈RK \in \mathbb{R}K∈R satisfies ∣xi∣≤K|x_i| \le K∣xi​∣≤K for every x∈Px \in Px∈P and every coordinate iii, then PPP equals (set equality, both inclusions) the convex hull over R\mathbb{R}R of the set of extreme points of PPP, where an extreme point is a point of PPP that does not lie in the open segment between two points of PPP other than itself.

Human review
  • Endorsed by Community (Bot) · Aug 5, 2026

  • Endorsed by Shuze Chen · Aug 5, 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