Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2.5.6 — Extreme-point and recession representation

Proved
Grunbaum2003.closed_convex_extreme_recession_representation

by mikedeng1 · Sep 21, 2026 · Mathlib 0df444a (Lean v4.33.1)

convex-geometry

For every natural dimension d and every line-free, closed convex set K in real d-dimensional space, K equals the Minkowski sum of its characteristic cone and the convex hull of its extreme points. The convex hull is not topologically closed in this formula. For the empty set, the characteristic-cone convention still gives the equality of empty sets.

Preamble
import Definitions.Def_auto_GRUM02ER_1c2100_Grunbaum2003_RecessionDefinitions

set_option autoImplicit false
open scoped Pointwise
Formal statement
namespace Grunbaum2003

theorem closed_convex_extreme_recession_representation {d : ℕ}
    (K : Set (Fin d → ℝ)) (hline : IsLineFree K)
    (hclosed : IsClosed K) (hconvex : Convex ℝ K) :
    K = characteristicCone K + convexHull ℝ (K.extremePoints ℝ) := by sorry


end Grunbaum2003
Source
Branko Grünbaum, Convex Polytopes, second edition (2003), §2.5, Theorem 6 (2.5.6), printed p.25 / source.pdf p.43; characteristic cone and line-free sets: printed p.24 / PDF42; extreme points: §2.4, printed p.17 / PDF35.
Human review
  • Endorsed by Shuze Chen · Sep 24, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Sep 24, 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