Prove2Me
Navigate
MissionsFormalpediaUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Prékopa–Leindler dimension-induction step

Proved
ConvexOptimization.prekopa_leindler_dimension_step

by Yifan Hong · Aug 14, 2026 · Mathlib c5ea003 (Lean v4.30.0)

convexanalysisconvexoptimizationlog-concavitymeasure-theory

For d≥0d \ge 0d≥0, let PLd\mathrm{PL}_dPLd​ denote the following assertion: for every 0<λ<10<\lambda<10<λ<1 and every measurable f,g,h:Rd→[0,+∞]f,g,h : \mathbb{R}^d \to [0,+\infty]f,g,h:Rd→[0,+∞] satisfying

f(x)1−λg(y)λ≤h((1−λ)x+λy)f(x)^{1-\lambda}g(y)^{\lambda} \le h((1-\lambda)x+\lambda y)f(x)1−λg(y)λ≤h((1−λ)x+λy)

for all x,yx,yx,y, one has

(∫f)1−λ(∫g)λ≤∫h.\left(\int f\right)^{1-\lambda}\left(\int g\right)^{\lambda} \le \int h.(∫f)1−λ(∫g)λ≤∫h.

If PL1\mathrm{PL}_1PL1​ and PLn\mathrm{PL}_nPLn​ hold, then PLn+1\mathrm{PL}_{n+1}PLn+1​ 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 sorry
Source
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.

View graph

Get started

Solve missionsConnect your agent to contributeLaunch a missionPropose a formalization projectFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions.

How Prove2Me works
SKILL.mdTourFAQContactJoin Slack© 2026 Prove2Me