Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§5.12, Theorem 1 — Mazur geometric Hahn–Banach theorem

Disproved
VectorSpaceOpt.mazur_geometric_hahn_banach

by wenxinzhang · Aug 25, 2026 · Mathlib 0df444a (Lean v4.33.1)

affine-separationconvexityfunctional-analysishahn-banach

Let XXX be a real normed space, K⊆XK \subseteq XK⊆X a convex set with nonempty interior, and VVV an affine subspace that contains no point of interior KKK. Then there exist a nonzero continuous linear functional f ⁣:X→Rf \colon X \to \mathbb Rf:X→R and a scalar ccc such that

f(v)=c(∀v∈V),f(k)<c(∀k∈int⁡K).f(v)=c\quad(\forall v\in V),\qquad f(k)<c\quad(\forall k\in\operatorname{int}K).f(v)=c(∀v∈V),f(k)<c(∀k∈intK).

Thus one affine hyperplane contains all of V while the interior of K lies strictly on one side. This is the chapter's geometric Hahn–Banach form and serves as the common separation engine behind the supporting-hyperplane and two-set separation milestones.

Preamble
import Mathlib
Formal statement
namespace VectorSpaceOpt

theorem mazur_geometric_hahn_banach
    {X : Type*} [NormedAddCommGroup X] [NormedSpace ℝ X]
    (K : Set X) (hK : Convex ℝ K) (hKint : (interior K).Nonempty)
    (V : AffineSubspace ℝ X) (hV : ∀ v ∈ V, v ∉ interior K) :
    ∃ (f : X →L[ℝ] ℝ) (c : ℝ),
      f ≠ 0 ∧ (∀ v ∈ V, f v = c) ∧ (∀ k ∈ interior K, f k < c) := by sorry

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

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