Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Translated Gaussian Directional Integration by Parts

Proved
FunctionalInequalities.KLS.LogConcave.GaussianSmoothing.gaussianLaw_translated_directional_identity_of_bounded_lipschitz_test_readable

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

functional-inequalitieskls-conjecturekls-modularkls-readablelog-concave

This statement gives the translated form of Gaussian integration by parts.

Let n∈Nn\in\mathbb Nn∈N, let h:Rn→Rh:\mathbb R^n\to\mathbb Rh:Rn→R be C1C^1C1 and globally Lipschitz, and suppose ∥h(x)∥≤C\|h(x)\|\le C∥h(x)∥≤C for every xxx. For a,v∈Rna,v\in\mathbb R^na,v∈Rn and s>0s>0s>0, both functions z↦⟨z,v⟩h(a+z)z\mapsto\langle z,v\rangle h(a+z)z↦⟨z,v⟩h(a+z) and z↦Dvh(a+z)z\mapsto D_vh(a+z)z↦Dv​h(a+z) are integrable with respect to gaussianLaw s, and

∫⟨z,v⟩h(a+z) dγs(z)=(2s)−1∫Dvh(a+z) dγs(z).\int \langle z,v\rangle h(a+z)\,d\gamma_s(z) = (2s)^{-1}\int D_vh(a+z)\,d\gamma_s(z).∫⟨z,v⟩h(a+z)dγs​(z)=(2s)−1∫Dv​h(a+z)dγs​(z).

The result is a reusable translated-noise identity for product-coupling arguments.

Original Lean declaration header

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

theorem gaussianLaw_translated_directional_identity_of_bounded_lipschitz_test {n : ℕ}
    {h : EuclideanSpace ℝ (Fin n) → ℝ} {Lh : NNReal}
    (hh : ContDiff ℝ 1 h) (hhLip : LipschitzWith Lh h)
    (C : ℝ) (hbound : ∀ x, ‖h x‖ ≤ C)
    (a v : EuclideanSpace ℝ (Fin n)) {s : ℝ} (hs : 0 < s) :
    Integrable (fun z => ⟪z,v⟫ * h (a+z)) (gaussianLaw s) ∧
    Integrable (fun z => fderiv ℝ h (a+z) v) (gaussianLaw s) ∧
    (∫ z, ⟪z,v⟫ * h (a+z) ∂(gaussianLaw s)) =
      (2*s)⁻¹ * ∫ z, fderiv ℝ h (a+z) v ∂(gaussianLaw s)

Module navigation

Module: KLS/LogConcave/Density/GaussianSmoothing/Moments.

Definition modules: KLS/LogConcave/Density/GaussianSmoothing/Basic.

Supporting theorems: gaussianLaw_directional_identity_of_bounded_lipschitz_test.

Previous: gaussianLaw_directional_identity_of_bounded_lipschitz_test.

Source excerpt, lines 545–553 · Frozen source 408915f.

Preamble
import Definitions.Def_KLSModular_FunctionalInequalities_KLS_LogConcave_Density_GaussianSmoothing_Moments

open MeasureTheory
open scoped ContDiff RealInnerProductSpace
Formal statement
theorem FunctionalInequalities.KLS.LogConcave.GaussianSmoothing.gaussianLaw_translated_directional_identity_of_bounded_lipschitz_test_readable {n : ℕ}
    {h : EuclideanSpace ℝ (Fin n) → ℝ} {Lh : NNReal}
    (hh : ContDiff ℝ 1 h) (hhLip : LipschitzWith Lh h)
    (C : ℝ) (hbound : ∀ x, ‖h x‖ ≤ C)
    (a v : EuclideanSpace ℝ (Fin n)) {s : ℝ} (hs : 0 < s) :
    Integrable (fun z => ⟪z,v⟫ * h (a+z)) (gaussianLaw s) ∧
    Integrable (fun z => fderiv ℝ h (a+z) v) (gaussianLaw s) ∧
    (∫ z, ⟪z,v⟫ * h (a+z) ∂(gaussianLaw s)) =
      (2*s)⁻¹ * ∫ z, fderiv ℝ h (a+z) v ∂(gaussianLaw s) := by sorry
Source
Lean source: https://github.com/human-ai-mathematics/kls-lean/blob/408915f/formalization/FunctionalInequalities/KLS/LogConcave/Density/GaussianSmoothing/Moments.lean#L545-L565 (repository human-ai-mathematics/kls-lean, commit 408915f, module `FunctionalInequalities.KLS.LogConcave.Density.GaussianSmoothing.Moments`, declaration `FunctionalInequalities.KLS.LogConcave.GaussianSmoothing.gaussianLaw_translated_directional_identity_of_bounded_lipschitz_test`; 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