Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

First Taylor Tensor Coordinate Formula

Proved
FunctionalInequalities.KLS.coordTensor_taylorTensor_one_apply_readable

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

functional-inequalitieskls-conjecturekls-modularkls-readablelog-concave

This statement identifies each coordinate of the first Taylor tensor for a centered probability measure.

Let n∈Nn\in\mathbb Nn∈N and let μ\muμ be a probability measure on EuclideanSpace⁡(R,Fin⁡n)\operatorname{EuclideanSpace}(\mathbb R,\operatorname{Fin} n)EuclideanSpace(R,Finn). Assume:

  1. For every r∈Rr\in\mathbb Rr∈R, the function x↦exp⁡(r∥x∥)x\mapsto\exp(r\|x\|)x↦exp(r∥x∥) is integrable with respect to μ\muμ.
  2. The identity map belongs to L2(μ)L^2(\mu)L2(μ).
  3. The mean of μ\muμ is zero, namely ∫x dμ=0\int x\,d\mu=0∫xdμ=0.
  4. The function f:EuclideanSpace⁡(R,Fin⁡n)→Rf:\operatorname{EuclideanSpace}(\mathbb R,\operatorname{Fin} n)\to\mathbb Rf:EuclideanSpace(R,Finn)→R belongs to L2(μ)L^2(\mu)L2(μ).

Then, for every index map i:Fin⁡1→Fin⁡ni:\operatorname{Fin}1\to\operatorname{Fin}ni:Fin1→Finn,

coordTensor⁡(e,taylorTensor⁡(μ,f,1))(i)=∫⟨ei(0),x⟩f(x) dμ(x),\operatorname{coordTensor}(e,\operatorname{taylorTensor}(\mu,f,1))(i) =\int \left\langle e_{i(0)},x\right\rangle f(x)\,d\mu(x),coordTensor(e,taylorTensor(μ,f,1))(i)=∫⟨ei(0)​,x⟩f(x)dμ(x),

where eee is the standard basis.

This is the degree-one coordinate identity used to control the linear Taylor component in the Poincaré reduction.

Formalization Note: The integral and the coordinate tensor are those of coordTensor and taylorTensor; the hypotheses explicitly provide exponential integrability, second-moment integrability, centering, and square integrability.

Original Lean declaration header

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

theorem coordTensor_taylorTensor_one_apply {n : ℕ} (μ : Measure (EuclideanSpace ℝ (Fin n)))
    [IsProbabilityMeasure μ] (hexp : ∀ r : ℝ, Integrable (fun x => Real.exp (r * ‖x‖)) μ)
    (hμ2 : MemLp (id : EuclideanSpace ℝ (Fin n) → EuclideanSpace ℝ (Fin n)) 2 μ)
    (hμ0 : ∫ x, x ∂μ = 0) {f : EuclideanSpace ℝ (Fin n) → ℝ} (hf : MemLp f 2 μ)
    (i : Fin 1 → Fin n) :
    coordTensor (EuclideanSpace.basisFun (Fin n) ℝ) (taylorTensor μ f 1) i =
      ∫ x, ⟪EuclideanSpace.basisFun (Fin n) ℝ (i 0), x⟫ * f x ∂μ

Module navigation

Module: KLS/BKL/Reduction.

Definition modules: Analysis/Tensor/Coefficients, Analysis/BakryEmery/Tilt/Basic.

Supporting theorems: taylorTensor_one_apply.

Next: Isotropic.norm_coordTensor_taylorTensor_one_le_of_entries.

Source excerpt, lines 24–30 · Frozen source 408915f.

Preamble
import Definitions.Def_KLSModular_FunctionalInequalities_KLS_BKL_Reduction

open MeasureTheory FunctionalInequalities.Analysis.BakryEmery FunctionalInequalities.Analysis.Tensor
open scoped RealInnerProductSpace
Formal statement

theorem FunctionalInequalities.KLS.coordTensor_taylorTensor_one_apply_readable {n : ℕ} (μ : Measure (EuclideanSpace ℝ (Fin n)))
    [IsProbabilityMeasure μ] (hexp : ∀ r : ℝ, Integrable (fun x => Real.exp (r * ‖x‖)) μ)
    (hμ2 : MemLp (id : EuclideanSpace ℝ (Fin n) → EuclideanSpace ℝ (Fin n)) 2 μ)
    (hμ0 : ∫ x, x ∂μ = 0) {f : EuclideanSpace ℝ (Fin n) → ℝ} (hf : MemLp f 2 μ)
    (i : Fin 1 → Fin n) :
    coordTensor (EuclideanSpace.basisFun (Fin n) ℝ) (taylorTensor μ f 1) i =
      ∫ x, ⟪EuclideanSpace.basisFun (Fin n) ℝ (i 0), x⟫ * f x ∂μ := by sorry
Source
Lean source: https://github.com/human-ai-mathematics/kls-lean/blob/408915f/formalization/FunctionalInequalities/KLS/BKL/Reduction.lean#L23-L45 (repository human-ai-mathematics/kls-lean, commit 408915f, module `FunctionalInequalities.KLS.BKL.Reduction`, declaration `FunctionalInequalities.KLS.coordTensor_taylorTensor_one_apply`; 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