Leindler's sharp real-line inequality for bounded compactly supported inputs
ProvedConvexOptimization.leindler_supremal_integral_real_line_compact_boundedconvexanalysisconvexoptimizationlog-concavitymeasure-theory
Let . Let be measurable functions with compact support, and suppose they admit finite bounds such that and for every . Define
Then
This finite, compactly supported form isolates the classical analytic core of the one-dimensional Prékopa–Leindler inequality and is suitable for a level-set and one-dimensional Brunn–Minkowski proof.
Formalization Note The bounds are nonnegative real numbers coerced into the extended nonnegative reals. The supremal envelope is integrated using the lower Lebesgue integral, so no separate Borel-measurability hypothesis on that envelope is imposed.
Preamble
import Mathlib open scoped RealInnerProductSpace ENNReal open MeasureTheory
Formal statement
theorem ConvexOptimization.leindler_supremal_integral_real_line_compact_bounded
(l : ℝ) (hl0 : 0 < l) (hl1 : l < 1)
(f g : ℝ → ℝ≥0∞)
(hf : Measurable f) (hg : Measurable g)
(hfc : HasCompactSupport f) (hgc : HasCompactSupport g)
(Bf Bg : NNReal)
(hfB : ∀ x, f x ≤ (Bf : ENNReal))
(hgB : ∀ x, g x ≤ (Bg : ENNReal)) :
(∫⁻ x, f x) ^ (1 - l) * (∫⁻ x, g x) ^ l ≤
∫⁻ z, sSup {q : ℝ≥0∞ | ∃ x y : ℝ,
(1 - l) • x + l • y = z ∧
q = f x ^ (1 - l) * g y ^ l} := by
sorry
Source
András Prékopa, On logarithmic concave measures and functions, Acta Scientiarum Mathematicarum 34 (1973), 335–343, https://rutcor.rutgers.edu/Prekopa/pdf/SCIENT2.pdf, §2, p. 337, equation (2.2), specialized to k = 2 with weights 1−λ and λ, functions f₁=f^(1−λ), f₂=g^λ, and bounded compactly supported inputs.