Affine Subtraction Preserves Epigraph Convexity
ProvedFunctionalInequalities.Analysis.convex_epigraph_affineSubtract_readablefunctional-inequalitieskls-conjecturekls-modularkls-readablelog-concave
This proves preservation of real epigraph convexity under affine subtraction.
Let be a real inner-product space, let , let , and let . Assume the real epigraph
is convex. Define affineSubtract by
Then its real epigraph is convex:
This is measure-free infrastructure for affine normalization of extended-real convex potentials.
Original Lean declaration header
Within namespace FunctionalInequalities.Analysis. Shown in its original module context. Proof omitted.
theorem convex_epigraph_affineSubtract (f : E → EReal) (a : E) (b : ℝ)
(hf : Convex ℝ {p : E × ℝ | f p.1 ≤ (p.2 : EReal)}) :
Convex ℝ {p : E × ℝ | affineSubtract f a b p.1 ≤ (p.2 : EReal)}
Module navigation
Module: Analysis/Convex/Affine.
Previous: legendre_affineSubtract · Next: exists_nonnegative_origin_zero_affine.
Source excerpt, lines 91–93 · Frozen source 408915f.
Preamble
import Definitions.Def_KLSModular_FunctionalInequalities_Analysis_Convex_Affine
variable {E : Type*} [NormedAddCommGroup E] [InnerProductSpace ℝ E]
Formal statement
theorem FunctionalInequalities.Analysis.convex_epigraph_affineSubtract_readable (f : E → EReal) (a : E) (b : ℝ)
(hf : Convex ℝ {p : E × ℝ | f p.1 ≤ (p.2 : EReal)}) :
Convex ℝ {p : E × ℝ | affineSubtract f a b p.1 ≤ (p.2 : EReal)} := by sorry
Source
Lean source: https://github.com/human-ai-mathematics/kls-lean/blob/408915f/formalization/FunctionalInequalities/Analysis/Convex/Affine.lean#L90-L121 (repository human-ai-mathematics/kls-lean, commit 408915f, module `FunctionalInequalities.Analysis.Convex.Affine`, declaration `FunctionalInequalities.Analysis.convex_epigraph_affineSubtract`; the repository is private at upload time).