Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Approximate Symmetry of Poisson Iterates

Proved
FunctionalInequalities.KLS.LogConcave.PoissonIterate.normSq_grad0_iter_sub_symField_le_readable

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

bkl2026functional-inequalitieskls-conjecturekls-modularkls-readablelog-concave

This formalizes BKL Lemma 3.3, p. 12.

Let VVV be finite-dimensional, let ν=m.tilted(−U)\nu=m\mathbin{.}\mathrm{tilted}(-U)ν=m.tilted(−U) with UUU of temperate growth and all exponential moments, and assume CP(ν)≤CC_P(\nu)\le CCP​(ν)≤C with C>0C>0C>0. Let f∈D(A)f\in D(A)f∈D(A), where A=Tˉ†TˉA=\bar T^\dagger\bar TA=Tˉ†Tˉ. For natural numbers k,qk,qk,q and a real β\betaβ, assume:

  1. 2≤q≤k+12\le q\le k+12≤q≤k+1.
  2. For every jjj with k+1−q≤j<kk+1-q\le j<kk+1−q≤j<k, the iterate scale satisfies
0<αj,αj2≤βC.0<\alpha_j,\qquad \alpha_j^2\le\frac\beta C.0<αj​,αj2​≤Cβ​.

Then the centered gradient field of the kkkth iterate obeys

∥∇0hk+1−Sq∇0hk+1∥2≤4q4max⁡(1,β)qC∑j=k+1−qk−1χj,\|\nabla_0h_{k+1}-S_q\nabla_0h_{k+1}\|^2 \le4q^4\max(1,\beta)^qC \sum_{j=k+1-q}^{k-1}\chi_j,∥∇0​hk+1​−Sq​∇0​hk+1​∥2≤4q4max(1,β)qCj=k+1−q∑k−1​χj​,

where SqS_qSq​ symmetrizes the first qqq positions and χj\chi_jχj​ is the defect of the corresponding iterate.

This is the main approximate-symmetry estimate used in the Taylor recursion.

Original Lean declaration header

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

theorem normSq_grad0_iter_sub_symField_le (hCpos : 0 < C)
    {f : Lp ℝ 2 (ν : Measure V)} (hf : f ∈ (adjointComp T̄).domain) {β : ℝ} (k q : ℕ)
    (hq : 2 ≤ q) (hqk : q ≤ k + 1)
    (hα : ∀ j, k + 1 - q ≤ j → j < k →
      0 < scale T̄ (iter T̄ f j) ∧ scale T̄ (iter T̄ f j) ^ 2 ≤ β / C) :
    normSq (grad0 T̄ (iter T̄ f k) - symField q (grad0 T̄ (iter T̄ f k))) ≤
      4 * (q : ℝ) ^ 4 * max 1 β ^ q * C *
        ∑ j ∈ Finset.Ico (k + 1 - q) k, defect T̄ (iter T̄ f j)

Module navigation

Module: KLS/BKL/PoissonIterate/Symmetry.

Definition modules: KLS/BKL/PoissonIterate/Basic, KLS/LogConcave/WeightedGradient/Closure, Analysis/Semigroup/AdjointComp, Probability/LogConcave, Poincare/LocalSlope/Basic.

Selected supporting theorems: exists_symm_normSq_grad0_step_sub_le, grad0_step_sub_permField_succ, normSq_sub_symField_le, centered_adjointComp_bounds, existsUnique_centered_adjointComp_eq.

Previous: grad0_step_sub_permField_succ.

Source excerpt, lines 349–356 · Frozen source 408915f.

Preamble
import Definitions.Def_KLSModular_FunctionalInequalities_KLS_BKL_PoissonIterate_Symmetry

open MeasureTheory Finset
open FunctionalInequalities.Analysis.Semigroup
variable {V : Type*} [NormedAddCommGroup V] [InnerProductSpace ℝ V] [CompleteSpace V]
  [MeasurableSpace V] [BorelSpace V] [SecondCountableTopology V] [FiniteDimensional ℝ V]
  {ν : MeasureTheory.ProbabilityMeasure V} (m : MeasureTheory.Measure V) [m.IsAddHaarMeasure] (hν : FunctionalInequalities.KLS.LogConcave ν)
  (hi : (interior (ν : MeasureTheory.Measure V).support).Nonempty) {U : V → ℝ}
  (hνU : (ν : MeasureTheory.Measure V) = m.tilted (-U)) (hUt : U.HasTemperateGrowth)
  (hexp : ∀ r : ℝ, MeasureTheory.Integrable (fun x => Real.exp (r * ‖x‖)) (ν : MeasureTheory.Measure V))
  {C : NNReal} (hC : FunctionalInequalities.Poincare.LocalSlope.Intrinsic.constant ν ≤ (C : ENNReal))
local notation "T̄" => hν.closedWeightedOperator m (ContinuousLinearMap.id ℝ V) hi
include hνU hUt hexp hC
Formal statement

theorem FunctionalInequalities.KLS.LogConcave.PoissonIterate.normSq_grad0_iter_sub_symField_le_readable (hCpos : 0 < C)
    {f : Lp ℝ 2 (ν : Measure V)} (hf : f ∈ (adjointComp T̄).domain) {β : ℝ} (k q : ℕ)
    (hq : 2 ≤ q) (hqk : q ≤ k + 1)
    (hα : ∀ j, k + 1 - q ≤ j → j < k →
      0 < scale T̄ (iter T̄ f j) ∧ scale T̄ (iter T̄ f j) ^ 2 ≤ β / C) :
    normSq (grad0 T̄ (iter T̄ f k) - symField q (grad0 T̄ (iter T̄ f k))) ≤
      4 * (q : ℝ) ^ 4 * max 1 β ^ q * C *
        ∑ j ∈ Finset.Ico (k + 1 - q) k, defect T̄ (iter T̄ f j) := by sorry
Source
Source: Bizeul–Klartag–Lehec, Presenting a proof of the Kannan–Lovász–Simonovits conjecture (arXiv:2610.05474v1), Lemma 3.3, p. 12. Lean source: https://github.com/human-ai-mathematics/kls-lean/blob/408915f/formalization/FunctionalInequalities/KLS/BKL/PoissonIterate/Symmetry.lean#L345-L373 (repository human-ai-mathematics/kls-lean, commit 408915f, module `FunctionalInequalities.KLS.BKL.PoissonIterate.Symmetry`, declaration `FunctionalInequalities.KLS.LogConcave.PoissonIterate.normSq_grad0_iter_sub_symField_le`; 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