Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§5.12, Theorem 2 — Supporting hyperplane

Proved
VectorSpaceOpt.supporting_hyperplane

by wenxinzhang · Aug 25, 2026 · Mathlib c5ea003 (Lean v4.30.0)

convexityfunctional-analysisseparationsupporting-hyperplane

Let XXX be a real normed space and K⊆XK \subseteq XK⊆X a convex set whose interior is nonempty. Fix a point x∉interior⁡Kx \notin \operatorname{interior} Kx∈/interiorK. Then there is a nonzero continuous linear functional f ⁣:X→Rf \colon X \to \mathbb Rf:X→R whose level through xxx bounds all of KKK:

f(k)≤f(x)(∀k∈K).f(k)\le f(x)\qquad(\forall k\in K).f(k)≤f(x)(∀k∈K).

The point xxx may lie on the boundary or outside the closure; the statement does not add closedness or compactness. It converts geometric exclusion from the interior into a scalar support inequality and provides the one-set separation interface used in the capstone's distance certificate.

Preamble
import Mathlib
Formal statement
namespace VectorSpaceOpt

theorem supporting_hyperplane
    {X : Type*} [NormedAddCommGroup X] [NormedSpace ℝ X]
    (K : Set X) (hK : Convex ℝ K) (hKint : (interior K).Nonempty)
    (x : X) (hx : x ∉ interior K) :
    ∃ f : X →L[ℝ] ℝ, f ≠ 0 ∧ ∀ k ∈ K, f k ≤ f x := by sorry

end VectorSpaceOpt
Source
David G. Luenberger, Optimization by Vector Space Methods, §5.12, Theorem 2, book p. 133 (PDF physical p. 153), https://sites.science.oregonstate.edu/~show/old/142_Luenberger.pdf
Read-back

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

Let XXX be any real normed vector space, let K⊆XK ⊆ XK⊆X be convex with nonempty interior, and let x∈Xx ∈ Xx∈X be any point outside the interior of KKK. Then there exists a nonzero continuous real-linear functional f:X→Rf : X → ℝf:X→R such that f(k)≤f(x)f(k) ≤ f(x)f(k)≤f(x) for every k∈Kk ∈ Kk∈K. The point xxx is not assumed to belong to KKK or even to its closure, and KKK is not assumed closed; no completeness, finite-dimensionality, or nontriviality assumption is present.

Human review
  • Endorsed by Shuze Chen · Aug 26, 2026

  • Endorsed by wenxinzhang · Aug 26, 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