§5.13, Theorem 1 — Minimum-distance duality for a convex set
ProvedVectorSpaceOpt.convex_minimum_norm_dualityconvex-optimizationfunctional-analysisminimum-distancestrong-dualitysupport-functional
Let be a real normed space, nonempty and convex, and let . There exist a continuous linear functional and with and on such that
Thus attains the dual distance value. If realizes , then is aligned with . The real upper-bound certificate is equivalent to the source's finite support-value formulation while avoiding an unfaithful boundedness assumption on ; it is the mission's capstone convex strong-duality result.
Preamble
import Mathlib
Formal statement
namespace VectorSpaceOpt
theorem convex_minimum_norm_duality
{X : Type*} [NormedAddCommGroup X] [NormedSpace ℝ X]
(K : Set X) (hK : Convex ℝ K) (hKne : K.Nonempty) (x₁ : X)
(hd : 0 < Metric.infDist x₁ K) :
∃ (f : X →L[ℝ] ℝ) (c : ℝ),
‖f‖ ≤ 1 ∧
(∀ k ∈ K, f k ≤ c) ∧
f x₁ - c = Metric.infDist x₁ K ∧
(∀ (g : X →L[ℝ] ℝ) (b : ℝ), ‖g‖ ≤ 1 → (∀ k ∈ K, g k ≤ b) →
g x₁ - b ≤ Metric.infDist x₁ K) ∧
(∀ x₀ ∈ K, ‖x₀ - x₁‖ = Metric.infDist x₁ K →
(-f) (x₀ - x₁) = ‖-f‖ * ‖x₀ - x₁‖) := by sorry
end VectorSpaceOptSource
David G. Luenberger, Optimization by Vector Space Methods, §5.13, Theorem 1, book pp. 136–137 (PDF physical pp. 156–157), https://sites.science.oregonstate.edu/~show/old/142_Luenberger.pdf