Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Integral Bounds From An Eventual Functional Lower Bound

Proved
FunctionalInequalities.Probability.MomentMeasure.exists_integral_bound_of_eventual_functional_lower_readable

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

functional-inequalitieskls-conjecturekls-modularkls-readablelog-concave

This is the normalized-sequence integral-control statement corresponding to estimate (62) in the coercivity framework.

Let EEE be finite-dimensional with additive Haar measure dxdxdx, and let μ\muμ be a probability measure satisfying:

  1. Every linear subspace with full μ\muμ-measure equals EEE.
  2. The identity map is μ\muμ-integrable.
  3. ∫x dμ(x)=0\int x\,d\mu(x)=0∫xdμ(x)=0.

Let ϕj:E→R‾\phi_j:E\to\overline{\mathbb R}ϕj​:E→R be a sequence such that every ϕj≥0\phi_j\ge0ϕj​≥0, ϕj(0)=0\phi_j(0)=0ϕj​(0)=0, ConvexPotential (φ j), and PotentialIntegrable (φ j) μ. If, for some b∈Rb\in\mathbb Rb∈R, eventually in jjj,

b≤variationalFunctional⁡(dx,μ,ϕj),b\le\operatorname{variationalFunctional}(dx,\mu,\phi_j),b≤variationalFunctional(dx,μ,ϕj​),

then there exists B≥0B\ge0B≥0 such that

∫E(ϕj(x)).toReal⁡ dμ(x)≤Bfor every j,\int_E(\phi_j(x)).\operatorname{toReal}\,d\mu(x)\le B\quad\text{for every }j,∫E​(ϕj​(x)).toRealdμ(x)≤Bfor every j,

and

sup⁡j∫E−(ϕj(x)).toENNReal⁡ dμ(x)≠+∞.\sup_j\int^-_E(\phi_j(x)).\operatorname{toENNReal}\,d\mu(x)\ne+\infty.jsup​∫E−​(ϕj​(x)).toENNRealdμ(x)=+∞.

The bound includes the finite initial segment of the sequence.

Original Lean declaration header

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

theorem exists_integral_bound_of_eventual_functional_lower
    (dx μ : Measure E) [dx.IsAddHaarMeasure] [IsProbabilityMeasure μ]
    (hsub : ∀ V : Submodule ℝ E, μ (V : Set E)ᶜ = 0 → V = ⊤)
    (hint : Integrable (fun x : E => x) μ) (hbar : ∫ x, x ∂μ = 0)
    (φ : ℕ → E → EReal) (hnn : ∀ j x, 0 ≤ φ j x) (hφ0 : ∀ j, φ j 0 = 0)
    (hconv : ∀ j, ConvexPotential (φ j)) (hφ : ∀ j, PotentialIntegrable (φ j) μ)
    (b : ℝ) (hlower : ∀ᶠ j in atTop, (b : EReal) ≤ variationalFunctional dx μ (φ j)) :
    ∃ B : ℝ, 0 ≤ B ∧ (∀ j, (∫ x, (φ j x).toReal ∂μ) ≤ B) ∧
      (⨆ j, ∫⁻ x, (φ j x).toENNReal ∂μ) ≠ ⊤

Module navigation

Module: Probability/MomentMeasure/Coercivity.

Definition modules: Probability/MomentMeasure/Basic, Analysis/Convex/Legendre.

Supporting theorems: exists_bound_of_log_lower, exists_coercivity_of_centered_probability.

Previous: exists_bound_of_log_lower · Next: real_coercivity_le_uniform.

Source excerpt, lines 246–254 · Frozen source 408915f.

Preamble
import Definitions.Def_KLSModular_FunctionalInequalities_Probability_MomentMeasure_Coercivity

open FunctionalInequalities.Analysis
open MeasureTheory Filter Set
variable {E : Type*}
variable [NormedAddCommGroup E] [InnerProductSpace ℝ E] [FiniteDimensional ℝ E] [MeasurableSpace E]
variable [BorelSpace E]
Formal statement

theorem FunctionalInequalities.Probability.MomentMeasure.exists_integral_bound_of_eventual_functional_lower_readable
    (dx μ : Measure E) [dx.IsAddHaarMeasure] [IsProbabilityMeasure μ]
    (hsub : ∀ V : Submodule ℝ E, μ (V : Set E)ᶜ = 0 → V = ⊤)
    (hint : Integrable (fun x : E => x) μ) (hbar : ∫ x, x ∂μ = 0)
    (φ : ℕ → E → EReal) (hnn : ∀ j x, 0 ≤ φ j x) (hφ0 : ∀ j, φ j 0 = 0)
    (hconv : ∀ j, ConvexPotential (φ j)) (hφ : ∀ j, PotentialIntegrable (φ j) μ)
    (b : ℝ) (hlower : ∀ᶠ j in atTop, (b : EReal) ≤ variationalFunctional dx μ (φ j)) :
    ∃ B : ℝ, 0 ≤ B ∧ (∀ j, (∫ x, (φ j x).toReal ∂μ) ≤ B) ∧
      (⨆ j, ∫⁻ x, (φ j x).toENNReal ∂μ) ≠ ⊤ := by sorry
Source
Lean source: https://github.com/human-ai-mathematics/kls-lean/blob/408915f/formalization/FunctionalInequalities/Probability/MomentMeasure/Coercivity.lean#L243-L270 (repository human-ai-mathematics/kls-lean, commit 408915f, module `FunctionalInequalities.Probability.MomentMeasure.Coercivity`, declaration `FunctionalInequalities.Probability.MomentMeasure.exists_integral_bound_of_eventual_functional_lower`; 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