§5.8, Theorem 1 — Minimum-distance duality for a subspace
ProvedVectorSpaceOpt.minimum_distance_dualityannihilatorfunctional-analysisminimum-distanceoptimizationstrong-duality
Let be a real normed space, any real linear subspace, and . Write . There exists a continuous linear functional with and such that
Hence attains the dual maximum and certifies the primal infimum without closedness or attainment assumptions. If is an actual best approximant, the same witness also satisfies . The theorem is the mission's capstone strong-duality certificate and generalizes Hilbert projection geometry to arbitrary normed spaces.
Preamble
import Mathlib
Formal statement
namespace VectorSpaceOpt
theorem minimum_distance_duality
{X : Type*} [NormedAddCommGroup X] [NormedSpace ℝ X]
(M : Submodule ℝ X) (x : X) :
∃ f : X →L[ℝ] ℝ,
‖f‖ ≤ 1 ∧
(∀ m ∈ M, f m = 0) ∧
f x = Metric.infDist x (M : Set X) ∧
(∀ g : X →L[ℝ] ℝ, ‖g‖ ≤ 1 → (∀ m ∈ M, g m = 0) →
g x ≤ Metric.infDist x (M : Set X)) ∧
(∀ m₀ ∈ M, (∀ m ∈ M, ‖x - m₀‖ ≤ ‖x - m‖) →
f (x - m₀) = ‖f‖ * ‖x - m₀‖) := by sorry
end VectorSpaceOptSource
David G. Luenberger, Optimization by Vector Space Methods, §5.8, Theorem 1, book pp. 119–120 (PDF physical pp. 139–140), https://sites.science.oregonstate.edu/~show/old/142_Luenberger.pdf