Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Pointwise Convex Potential Bound By Its Integral

Proved
FunctionalInequalities.Probability.exists_pos_le_mul_lintegral_toReal_of_convex_epigraph_readable

by Lazyfill · Oct 26, 2026 · Mathlib 0df444a (Lean v4.33.1)

corderoklartag2015functional-inequalitieskls-conjecturekls-modularkls-readablelog-concave

Let EEE be finite-dimensional with a real inner product and Borel measurable structure. Let μ\muμ be a finite measure and let x0x_0x0​ belong to the interior of the convex hull of supp⁡(μ)\operatorname{supp}(\mu)supp(μ). Then there exists C∈RC\in\mathbb RC∈R with C>0C>0C>0 such that, for every ϕ:E→R‾\phi:E\to\overline{\mathbb R}ϕ:E→R satisfying:

  1. ϕ(x)≥0\phi(x)\ge0ϕ(x)≥0 for every xxx.
  2. Its real epigraph is convex.
  3. x↦ϕ(x).toENNReal⁡x\mapsto\phi(x).\operatorname{toENNReal}x↦ϕ(x).toENNReal is a.e. measurable with respect to μ\muμ.
  4. Its lower integral is finite:
∫−ϕ(x).toENNReal⁡ dμ≠+∞.\int^- \phi(x).\operatorname{toENNReal}\,d\mu\ne+\infty.∫−ϕ(x).toENNRealdμ=+∞.

one has

ϕ(x0)≤(C(∫−ϕ(x).toENNReal⁡ dμ).toReal⁡:R).\phi(x_0)\le\left(C\left(\int^- \phi(x).\operatorname{toENNReal}\,d\mu\right).\operatorname{toReal}:\mathbb R\right).ϕ(x0​)≤(C(∫−ϕ(x).toENNRealdμ).toReal:R).

The constant is selected from μ\muμ and x0x_0x0​ before the potential ϕ\phiϕ; this is the principal point-control estimate reused in the coercivity arguments.

Formalization Note The integral is an ENNReal lower integral, and .toReal converts it to R\mathbb RR before the product is coerced back to the extended reals.

Original Lean declaration header

Within namespace FunctionalInequalities.Probability. Shown in its original module context. Proof omitted.

theorem exists_pos_le_mul_lintegral_toReal_of_convex_epigraph [MeasurableSpace E] [FiniteDimensional ℝ E] [BorelSpace E]
    (μ : Measure E) [IsFiniteMeasure μ] (x₀ : E) :
    x₀ ∈ interior (convexHull ℝ μ.support) →
      ∃ C : ℝ, 0 < C ∧ ∀ φ : E → EReal,
        (∀ x, 0 ≤ φ x) → Convex ℝ {p : E × ℝ | φ p.1 ≤ (p.2 : EReal)} →
        AEMeasurable (fun x => (φ x).toENNReal) μ →
        (∫⁻ x, (φ x).toENNReal ∂μ) ≠ ⊤ →
          φ x₀ ≤ ((C * (∫⁻ x, (φ x).toENNReal ∂μ).toReal : ℝ) : EReal)

Module navigation

Module: Probability/ConvexSupport.

Supporting theorems: exists_pos_le_measure_halfspace_of_mem_interior_convexHull_support_of_isFiniteMeasure, mem_interior_setOf_ne_top_of_lintegral_ne_top, strict_sublevel_convex_and_interior.

Previous: strict_sublevel_convex_and_interior · Next: zero_mem_interior_convexHull_support_of_integral_eq_zero.

Source excerpt, lines 654–661 · Frozen source 408915f.

Literature

This formalizes Lemma 16 of Cordero–Erausquin–Klartag, Moment measures (arXiv:1304.0630v1), cited as “Pointwise bound by the integral.”

Preamble
import Definitions.Def_KLSModular_FunctionalInequalities_Probability_ConvexSupport

open MeasureTheory
variable {E : Type*}
variable [NormedAddCommGroup E] [InnerProductSpace ℝ E]
Formal statement

theorem FunctionalInequalities.Probability.exists_pos_le_mul_lintegral_toReal_of_convex_epigraph_readable [MeasurableSpace E] [FiniteDimensional ℝ E] [BorelSpace E]
    (μ : Measure E) [IsFiniteMeasure μ] (x₀ : E) :
    x₀ ∈ interior (convexHull ℝ μ.support) →
      ∃ C : ℝ, 0 < C ∧ ∀ φ : E → EReal,
        (∀ x, 0 ≤ φ x) → Convex ℝ {p : E × ℝ | φ p.1 ≤ (p.2 : EReal)} →
        AEMeasurable (fun x => (φ x).toENNReal) μ →
        (∫⁻ x, (φ x).toENNReal ∂μ) ≠ ⊤ →
          φ x₀ ≤ ((C * (∫⁻ x, (φ x).toENNReal ∂μ).toReal : ℝ) : EReal) := by sorry
Source
Source: Cordero-Erausquin–Klartag, Moment measures (arXiv:1304.0630v1), Lemma 16. Lean source: https://github.com/human-ai-mathematics/kls-lean/blob/408915f/formalization/FunctionalInequalities/Probability/ConvexSupport.lean#L651-L690 (repository human-ai-mathematics/kls-lean, commit 408915f, module `FunctionalInequalities.Probability.ConvexSupport`, declaration `FunctionalInequalities.Probability.exists_pos_le_mul_lintegral_toReal_of_convex_epigraph`; the repository is private at upload time).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

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, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me