Convexity is equivalent to convexity of the restricted epigraph
ProvedVectorSpaceOpt.convexOn_iff_convex_restrictedEpigraphconvex-analysisconvex-functionepigraphgeometry
Let be a real vector space, let , and let . Then is convex on if and only if its restricted epigraph is convex:
Here ConvexOn includes convexity of , and the pair order is rather than the scalar-first order printed in the book. This theorem makes the geometric object used by separation arguments explicit and reusable. It is the exact epigraph criterion that connects the elementary convexity section to conjugate and biconjugate constructions. Closedness can later be imposed on this same geometric set.
Preamble
import Mathlib
Formal statement
namespace VectorSpaceOpt
/-- Luenberger, Chapter 7, §7.8, Proposition 2. -/
theorem convexOn_iff_convex_restrictedEpigraph
{X : Type*} [AddCommGroup X] [Module ℝ X]
(C : Set X) (f : X → ℝ) :
ConvexOn ℝ C f ↔
Convex ℝ {p : X × ℝ | p.1 ∈ C ∧ f p.1 ≤ p.2} := 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.8, Proposition 2, printed p. 192; physical PDF p. 212.