Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Compact Diffusion Pairing Identity

Proved
FunctionalInequalities.KLS.LogConcave.compact_pairing_identity_readable

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

functional-inequalitieskls-conjecturekls-modularkls-readablelog-concave

This theorem gives the integration-by-parts identity for a compactly supported diffusion test.

Let EEE be finite-dimensional with its real inner-product structure, let mmm be an additive Haar measure, let ν\nuν be a probability measure, and let U:E→RU:E\to\mathbb RU:E→R satisfy ν=m.tilted⁡(−U)\nu=m.\operatorname{tilted}(-U)ν=m.tilted(−U). Assume UUU and fff are C1C^1C1, while u:E→Ru:E\to\mathbb Ru:E→R is C∞C^\inftyC∞ and compactly supported. Then both functions

f(x) [−LUu(x)]and⟨∇f(x),∇u(x)⟩f(x)\,[-\mathcal L_Uu(x)] \quad\text{and}\quad \langle\nabla f(x),\nabla u(x)\ranglef(x)[−LU​u(x)]and⟨∇f(x),∇u(x)⟩

are integrable with respect to ν\nuν, and

∫Ef(x) [−LUu(x)] dν(x)=∫E⟨∇f(x),∇u(x)⟩ dν(x),\int_E f(x)\,[-\mathcal L_Uu(x)]\,d\nu(x) = \int_E \langle\nabla f(x),\nabla u(x)\rangle\,d\nu(x),∫E​f(x)[−LU​u(x)]dν(x)=∫E​⟨∇f(x),∇u(x)⟩dν(x),

where weightedLaplacian denotes LU\mathcal L_ULU​. The function fff need not be compactly supported.

Original Lean declaration header

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

theorem compact_pairing_identity
    {ν : ProbabilityMeasure E} (m : Measure E) [m.IsAddHaarMeasure]
    {U f u : E → ℝ} (hνU : (ν : Measure E) = m.tilted (-U))
    (hU : ContDiff ℝ 1 U) (hf : ContDiff ℝ 1 f)
    (hu : ContDiff ℝ ∞ u) (huc : HasCompactSupport u) :
    Integrable (fun x => f x * (-weightedLaplacian U u x)) (ν : Measure E) ∧
      Integrable (fun x => ⟪gradient f x, gradient u x⟫) (ν : Measure E) ∧
      (∫ x, f x * (-weightedLaplacian U u x) ∂(ν : Measure E)) =
        ∫ x, ⟪gradient f x, gradient u x⟫ ∂(ν : Measure E)

Module navigation

Module: KLS/LogConcave/BrascampLieb.

Definition modules: Analysis/BakryEmery/Laplacian.

Previous: inner_center_left_of_mean_zero.

Source excerpt, lines 105–113 · Frozen source 408915f.

Preamble
import Definitions.Def_KLSModular_FunctionalInequalities_KLS_LogConcave_BrascampLieb

open MeasureTheory Filter Topology Set InnerProductSpace
open FunctionalInequalities.Analysis.BakryEmery
open scoped ContDiff RealInnerProductSpace
variable {E : Type*} [NormedAddCommGroup E] [InnerProductSpace ℝ E]
  [CompleteSpace E] [FiniteDimensional ℝ E]
  [MeasurableSpace E] [BorelSpace E] [SecondCountableTopology E]
Formal statement

theorem FunctionalInequalities.KLS.LogConcave.compact_pairing_identity_readable
    {ν : ProbabilityMeasure E} (m : Measure E) [m.IsAddHaarMeasure]
    {U f u : E → ℝ} (hνU : (ν : Measure E) = m.tilted (-U))
    (hU : ContDiff ℝ 1 U) (hf : ContDiff ℝ 1 f)
    (hu : ContDiff ℝ ∞ u) (huc : HasCompactSupport u) :
    Integrable (fun x => f x * (-weightedLaplacian U u x)) (ν : Measure E) ∧
      Integrable (fun x => ⟪gradient f x, gradient u x⟫) (ν : Measure E) ∧
      (∫ x, f x * (-weightedLaplacian U u x) ∂(ν : Measure E)) =
        ∫ x, ⟪gradient f x, gradient u x⟫ ∂(ν : Measure E) := by sorry
Source
Lean source: https://github.com/human-ai-mathematics/kls-lean/blob/408915f/formalization/FunctionalInequalities/KLS/LogConcave/BrascampLieb.lean#L103-L143 (repository human-ai-mathematics/kls-lean, commit 408915f, module `FunctionalInequalities.KLS.LogConcave.BrascampLieb`, declaration `FunctionalInequalities.KLS.LogConcave.compact_pairing_identity`; 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