Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Resolution theorem for polyhedra

Proved
LinearOptimization.polyhedron_resolution

by Shuze Chen · Aug 5, 2026 · Mathlib 0df444a (Lean v4.33.1)

conesconvexityextreme-pointspolyhedra

(Theorem 4.15, resolution theorem — GOAL) Let P={x∈Rn∣Ax≥b}P = \{x \in \mathbb{R}^n \mid Ax \ge b\}P={x∈Rn∣Ax≥b} be a nonempty polyhedron with at least one extreme point. Let x1,…,xkx^1, \dots, x^kx1,…,xk be the extreme points, and let w1,…,wrw^1, \dots, w^rw1,…,wr be a complete set of extreme rays of PPP. Let

Q={∑i=1kλixi+∑j=1rθjwj  |  λi≥0, θj≥0, ∑i=1kλi=1}.Q = \left\{\sum_{i=1}^{k} \lambda_i x^i + \sum_{j=1}^{r} \theta_j w^j \;\middle|\; \lambda_i \ge 0,\ \theta_j \ge 0,\ \sum_{i=1}^{k} \lambda_i = 1\right\}.Q={i=1∑k​λi​xi+j=1∑r​θj​wj​λi​≥0, θj​≥0, i=1∑k​λi​=1}.

Then, Q=PQ = PQ=P.

Preamble
import Mathlib.Analysis.Convex.Extreme
import Definitions.Def_LinearOptimization_RecessionCone
import Definitions.Def_LinearOptimization_FinitelyGeneratedSet


open Matrix

/-- **Bertsimas & Tsitsiklis, Theorem 4.15 (p. 179).** Resolution theorem: a nonempty
polyhedron `P = {x | Ax ≥ b}` with at least one extreme point equals the
finitely generated set built from its extreme points and any complete set
of its extreme rays. -/
Formal statement
theorem LinearOptimization.polyhedron_resolution {m n k r : ℕ}
    (A : Matrix (Fin m) (Fin n) ℝ) (b : Fin m → ℝ)
    (hne : (polyhedron A b).Nonempty)
    (x : Fin k → (Fin n → ℝ)) (hk : 0 < k)
    (hx : Set.extremePoints ℝ (polyhedron A b) = Set.range x)
    (w : Fin r → (Fin n → ℝ)) (hw : IsCompleteExtremeRaySet A w) :
    finitelyGeneratedSet x w = polyhedron A b := by
  sorry
Source
Bertsimas & Tsitsiklis, Introduction to Linear Optimization, Athena Scientific, 1997, Theorem 4.15, p. 179
Human review
  • Endorsed by Community (Bot) · Oct 29, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Shuze Chen · Oct 29, 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