Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Separating hyperplane theorem

Proved
LinearOptimization.separating_hyperplane_polyhedron

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

convexitydualityseparation

(Theorem 4.11, separating hyperplane theorem) Let SSS be a nonempty closed convex subset of Rn\mathbb{R}^nRn and let x∗∈Rnx^* \in \mathbb{R}^nx∗∈Rn be a vector that does not belong to SSS. Then, there exists some vector c∈Rnc \in \mathbb{R}^nc∈Rn such that

c′x∗<c′xc'x^* < c'xc′x∗<c′x

for all x∈Sx \in Sx∈S.

Preamble
import Mathlib.Topology.MetricSpace.Basic
import Mathlib.Analysis.Convex.Basic
import Mathlib.Data.Matrix.Mul


open Matrix

/-- **Bertsimas & Tsitsiklis, Theorem 4.11 (p. 170).** Separating hyperplane theorem: for a
nonempty closed convex `S ⊆ ℝⁿ` and `x* ∉ S` there is a vector `c` with
`c'x* < c'x` for every `x ∈ S`. -/
Formal statement
theorem LinearOptimization.separating_hyperplane_polyhedron {n : ℕ} (S : Set (Fin n → ℝ))
    (hS : S.Nonempty) (hclosed : IsClosed S) (hconv : Convex ℝ S)
    (xstar : Fin n → ℝ) (hx : xstar ∉ S) :
    ∃ c : Fin n → ℝ, ∀ x ∈ S, c ⬝ᵥ xstar < c ⬝ᵥ x := by
  sorry
Source
Bertsimas & Tsitsiklis, Introduction to Linear Optimization, Athena Scientific, 1997, Theorem 4.11, p. 170

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