Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Closedness of polyhedra

Proved
LinearOptimization.polyhedron_closed

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

convexitylinear-programmingpolyhedra

(Theorem 4.9) Every polyhedron is closed.

(A set S⊂RnS \subset \mathbb{R}^nS⊂Rn is called closed if it has the following property: if x1,x2,…x^1, x^2, \dotsx1,x2,… is a sequence of elements of SSS that converges to some x∈Rnx \in \mathbb{R}^nx∈Rn, then x∈Sx \in Sx∈S. Book proof: for P={x∈Rn∣Ax≥b}P = \{x \in \mathbb{R}^n \mid Ax \ge b\}P={x∈Rn∣Ax≥b} and xk→x∗x^k \to x^*xk→x∗ with Axk≥bAx^k \ge bAxk≥b, taking the limit gives Ax∗≥bAx^* \ge bAx∗≥b.)

Preamble
import Mathlib.Topology.MetricSpace.Basic
import Definitions.Def_Polyhedron


/-- **Bertsimas & Tsitsiklis, Theorem 4.9 (p. 169).** Every polyhedron `{x | Ax ≥ b}` is a
closed subset of `ℝⁿ`. -/
Formal statement
theorem LinearOptimization.polyhedron_closed {m n : ℕ} (A : Matrix (Fin m) (Fin n) ℝ)
    (b : Fin m → ℝ) :
    IsClosed (polyhedron A b) := by
  sorry
Source
Bertsimas & Tsitsiklis, Introduction to Linear Optimization, Athena Scientific, 1997, Theorem 4.9, p. 169

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