Convexity of the finite restricted conjugate
ProvedVectorSpaceOpt.restrictedConvexConjugate_convexcontinuous-dualconvex-analysisconvex-conjugatesupremum
Let be a nonempty subset of a real normed space and let . Define to consist of those continuous linear functionals for which is bounded above. Then
No convexity hypothesis on is needed for this assertion: the conjugate is a supremum of affine functions of . The explicit boundedness predicate makes the statement faithful to the finite conjugate domain in §7.10. This milestone provides a reusable convex dual objective and its natural domain before any closedness or duality qualification is imposed.
Preamble
import Definitions.Def_VectorSpaceOpt_restrictedConvexConjugate
Formal statement
namespace VectorSpaceOpt
/-- Luenberger, Chapter 7, §7.10, Proposition 1. -/
theorem restrictedConvexConjugate_convex
{X : Type*} [NormedAddCommGroup X] [NormedSpace ℝ X]
(C : Set X) (f : X → ℝ) (hC : C.Nonempty) :
Convex ℝ {ℓ : X →L[ℝ] ℝ |
BddAbove ((fun x : X ↦ ℓ x - f x) '' C)} ∧
ConvexOn ℝ
{ℓ : X →L[ℝ] ℝ |
BddAbove ((fun x : X ↦ ℓ x - f x) '' C)}
(restrictedConvexConjugate C f) := by sorry
end VectorSpaceOptSource
David G. Luenberger, Optimization by Vector Space Methods, Wiley, 1969, public scan https://sites.science.oregonstate.edu/~show/old/142_Luenberger.pdf, Chapter 7, §7.10, Proposition 1, printed p. 196; physical PDF p. 216.