Fenchel–Young inequality
ProvedConvexOptimization.fenchel_youngFenchel's inequality (also called the Fenchel–Young inequality).
For let be its Fenchel conjugate, with values in . Then for all ,
The inequality holds for every function — no convexity, continuity or measurability is needed — since it is nothing but the definition of the supremum applied at the point . Equality holds exactly when is a subgradient of at , which is how the inequality is used to characterize the solutions of dual pairs of problems.
Specialized to on , whose conjugate is with , it becomes Young's inequality , and hence — after integration — Hölder's inequality.
Formalization Note The inequality is stated in EReal, adding the real value (coerced) to the EReal-valued conjugate, so the case needs no separate treatment. Source: B&V §3.3.1, p. 94.
import Mathlib import Definitions.Def_fenchelConjugate open scoped RealInnerProductSpace ENNReal open MeasureTheory
theorem ConvexOptimization.fenchel_young {n : ℕ} (f : EuclideanSpace ℝ (Fin n) → ℝ)
(x y : EuclideanSpace ℝ (Fin n)) :
((⟪x, y⟫ : ℝ) : EReal) ≤ (f x : EReal) + fenchelConjugate f y := by
sorry