§5.12, Theorem 2 — Supporting hyperplane
ProvedVectorSpaceOpt.supporting_hyperplaneconvexityfunctional-analysisseparationsupporting-hyperplane
Let be a real normed space and a convex set whose interior is nonempty. Fix a point . Then there is a nonzero continuous linear functional whose level through bounds all of :
The point 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 VectorSpaceOptSource
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