Convexity of the Real Legendre Epigraph
ProvedFunctionalInequalities.Analysis.convex_epigraph_legendre_readablefunctional-inequalitieskls-conjecturekls-modularkls-readablelog-concave
This proves convexity of the real epigraph of the Legendre transform.
Let be a real inner-product space and let be arbitrary, with EReal allowing the values . Define the Legendre transform by legendre. Then
is convex.
The statement is measure-free and applies without convexity, properness, or finiteness assumptions on . It is basic infrastructure for later properties of conjugates and biconjugates.
Original Lean declaration header
Within namespace FunctionalInequalities.Analysis. Shown in its original module context. Proof omitted.
theorem convex_epigraph_legendre (φ : E → EReal) :
Convex ℝ {p : E × ℝ | legendre φ p.1 ≤ (p.2 : EReal)}
Module navigation
Module: Analysis/Convex/Legendre.
Next: legendre_ne_bot_iff.
Source excerpt, lines 151–152 · Frozen source 408915f.
Preamble
import Definitions.Def_KLSModular_FunctionalInequalities_Analysis_Convex_Legendre
variable {E : Type*} [NormedAddCommGroup E] [InnerProductSpace ℝ E]
Formal statement
theorem FunctionalInequalities.Analysis.convex_epigraph_legendre_readable (φ : E → EReal) :
Convex ℝ {p : E × ℝ | legendre φ p.1 ≤ (p.2 : EReal)} := by sorry
Source
Lean source: https://github.com/human-ai-mathematics/kls-lean/blob/408915f/formalization/FunctionalInequalities/Analysis/Convex/Legendre.lean#L149-L178 (repository human-ai-mathematics/kls-lean, commit 408915f, module `FunctionalInequalities.Analysis.Convex.Legendre`, declaration `FunctionalInequalities.Analysis.convex_epigraph_legendre`; the repository is private at upload time).