Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§5.7, Theorem 1 — Closed subspace as its double annihilator

Proved
VectorSpaceOpt.closed_subspace_eq_preannihilator_annihilator

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

annihilatorclosed-subspacefunctional-analysisseparation

Let XXX be a real normed space and let MMM be a closed real linear subspace. Consider all continuous linear functionals on XXX that vanish on MMM. A point xxx is annihilated by every one of those functionals exactly when xxx already belongs to MMM:

{x∈X: ∀f, f∣M=0⇒f(x)=0}=M.\{x\in X:\ \forall f,\ f|_M=0\Rightarrow f(x)=0\}=M.{x∈X: ∀f, f∣M​=0⇒f(x)=0}=M.

This is the concrete preannihilator-of-annihilator identity, stated without introducing a separate dual-submodule definition. It shows that the continuous dual separates each point outside a closed subspace and provides a reusable closedness/separation principle for later duality statements and quotient-space characterizations.

Preamble
import Mathlib
Formal statement
namespace VectorSpaceOpt

theorem closed_subspace_eq_preannihilator_annihilator
    {X : Type*} [NormedAddCommGroup X] [NormedSpace ℝ X]
    (M : Submodule ℝ X) (hM : IsClosed (M : Set X)) :
    {x : X | ∀ f : X →L[ℝ] ℝ, (∀ m ∈ M, f m = 0) → f x = 0} = (M : Set X) := by sorry

end VectorSpaceOpt
Source
David G. Luenberger, Optimization by Vector Space Methods, §5.7, Theorem 1, book p. 118 (PDF physical p. 138), 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