Prékopa–Leindler dimension-induction step
ProvedConvexOptimization.prekopa_leindler_dimension_stepconvexanalysisconvexoptimizationlog-concavitymeasure-theory
For , let denote the following assertion: for every and every measurable satisfying
for all , one has
If and hold, then holds.
Preamble
import Mathlib open scoped RealInnerProductSpace ENNReal open MeasureTheory
Formal statement
theorem ConvexOptimization.prekopa_leindler_dimension_step {n : ℕ}
(h_one :
∀ (l : ℝ) (_hl0 : 0 < l) (_hl1 : l < 1)
(f g h : EuclideanSpace ℝ (Fin 1) → ℝ≥0∞),
Measurable f → Measurable g → Measurable h →
(∀ x y : EuclideanSpace ℝ (Fin 1),
f x ^ (1 - l) * g y ^ l ≤ h ((1 - l) • x + l • y)) →
(∫⁻ x, f x) ^ (1 - l) * (∫⁻ x, g x) ^ l ≤ ∫⁻ x, h x)
(h_n :
∀ (l : ℝ) (_hl0 : 0 < l) (_hl1 : l < 1)
(f g h : EuclideanSpace ℝ (Fin n) → ℝ≥0∞),
Measurable f → Measurable g → Measurable h →
(∀ x y : EuclideanSpace ℝ (Fin n),
f x ^ (1 - l) * g y ^ l ≤ h ((1 - l) • x + l • y)) →
(∫⁻ x, f x) ^ (1 - l) * (∫⁻ x, g x) ^ l ≤ ∫⁻ x, h x)
(l : ℝ) (hl0 : 0 < l) (hl1 : l < 1)
(f g h : EuclideanSpace ℝ (Fin (n + 1)) → ℝ≥0∞)
(hf : Measurable f) (hg : Measurable g) (hh : Measurable h)
(hple : ∀ x y : EuclideanSpace ℝ (Fin (n + 1)),
f x ^ (1 - l) * g y ^ l ≤ h ((1 - l) • x + l • y)) :
(∫⁻ x, f x) ^ (1 - l) * (∫⁻ x, g x) ^ l ≤ ∫⁻ x, h x := by sorrySource
Richard J. Gardner, The Brunn-Minkowski Inequality: A Survey with Proofs, https://faculty.gardner.wwu.edu/gorizia12.pdf, induction in Theorem 4.2 (pp. 8-9); András Prékopa, Logarithmic concave measures with applications to stochastic programming, https://rutcor.rutgers.edu/Prekopa/pdf/SCIENT2.pdf, Theorem 3.