Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Cumulant Bound On The Suspension Joint Space

Proved
FunctionalInequalities.KLS.LogConcave.Suspension.cumulantBound_jointSpace_readable

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

bkl2026functional-inequalitieskls-conjecturekls-modularkls-readablelog-concave

This formalizes the joint-space adapter used in Proposition 7.1 of Bizeul–Klartag–Lehec (arXiv:2610.05474v1), p. 28.

Let N,n,d∈NN,n,d\in\mathbb NN,n,d∈N and b∈Rb\in\mathbb Rb∈R. Assume CumulantBound d b, and let ν\nuν be an isotropic log-concave probability measure on

JointSpace⁡(N,n)=EuclideanSpace⁡ R (Option⁡(Fin⁡N×Fin⁡n)).\operatorname{JointSpace}(N,n)=\operatorname{EuclideanSpace}\,\mathbb R\,(\operatorname{Option}(\operatorname{Fin}N\times\operatorname{Fin}n)).JointSpace(N,n)=EuclideanSpaceR(Option(FinN×Finn)).

For every uuu in this joint space, the coordinate cumulants satisfy

∑Jκd+1ν(u,eJ1,…,eJd)2≤b∥u∥2,\sum_J\kappa_{d+1}^\nu\bigl(u,e_{J_1},\ldots,e_{J_d}\bigr)^2 \le b\|u\|^2,J∑​κd+1ν​(u,eJ1​​,…,eJd​​)2≤b∥u∥2,

where the sum ranges over functions J:Fin⁡d→Option⁡(Fin⁡N×Fin⁡n)J:\operatorname{Fin}d\to\operatorname{Option}(\operatorname{Fin}N\times\operatorname{Fin}n)J:Find→Option(FinN×Finn) and the eJie_{J_i}eJi​​ are the corresponding coordinate basis vectors.

The declaration transports a cumulant bound through the coordinate equivalence between the joint space and a standard Euclidean space. It is a technical reuse lemma for suspension arguments.

Original Lean declaration header

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

theorem cumulantBound_jointSpace {N n d : ℕ} {b : ℝ} (hb : CumulantBound d b)
    {ν : ProbabilityMeasure (JointSpace N n)} (hiso : KLS.Isotropic ν) (hlc : KLS.LogConcave ν)
    (u : JointSpace N n) :
    ∑ J : Fin d → Option (Fin N × Fin n),
      cumulant (ν : Measure (JointSpace N n)) (d + 1)
        (Fin.cons u fun k => EuclideanSpace.basisFun _ ℝ (J k)) ^ 2 ≤ b * ‖u‖ ^ 2

Module navigation

Module: KLS/BKL/Suspension/Law.

Definition modules: Probability/LogConcave, KLS/Isotropic, Analysis/BakryEmery/Cumulant/Basic.

Supporting theorems: cumulant_map_linearIsometryEquiv, Isotropic.map_linearIsometryEquiv.

Previous: logConcave_jointLaw_of_eq_tilted.

Source excerpt, lines 281–286 · Frozen source 408915f.

Preamble
import Definitions.Def_KLSModular_FunctionalInequalities_KLS_BKL_Suspension_Law

open MeasureTheory
open FunctionalInequalities.Analysis.BakryEmery
Formal statement

theorem FunctionalInequalities.KLS.LogConcave.Suspension.cumulantBound_jointSpace_readable {N n d : ℕ} {b : ℝ} (hb : CumulantBound d b)
    {ν : ProbabilityMeasure (JointSpace N n)} (hiso : KLS.Isotropic ν) (hlc : KLS.LogConcave ν)
    (u : JointSpace N n) :
    ∑ J : Fin d → Option (Fin N × Fin n),
      cumulant (ν : Measure (JointSpace N n)) (d + 1)
        (Fin.cons u fun k => EuclideanSpace.basisFun _ ℝ (J k)) ^ 2 ≤ b * ‖u‖ ^ 2 := by sorry
Source
Source: Bizeul–Klartag–Lehec, Presenting a proof of the Kannan–Lovász–Simonovits conjecture (arXiv:2610.05474v1), Proposition 7.1, p. 28. Lean source: https://github.com/human-ai-mathematics/kls-lean/blob/408915f/formalization/FunctionalInequalities/KLS/BKL/Suspension/Law.lean#L276-L308 (repository human-ai-mathematics/kls-lean, commit 408915f, module `FunctionalInequalities.KLS.BKL.Suspension.Law`, declaration `FunctionalInequalities.KLS.LogConcave.Suspension.cumulantBound_jointSpace`; 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