Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Dynkin Identity for the Cutoff Eldan Process

Proved
FunctionalInequalities.KLS.BKL.Localization.IsEldanCutoff.dynkin_modular

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

bkl2026functional-inequalitieskls-conjecturekls-modularlog-concave

This formalizes the Dynkin identity associated with Equation (67), p. 19, of Bizeul–Klartag–Lehec (arXiv:2610.05474v1), at the compact-support cutoff stage.

Let n∈Nn\in\mathbb Nn∈N, let μ\muμ be an isotropic probability measure on EuclideanSpace⁡(R,Fin⁡(n))\operatorname{EuclideanSpace}(\mathbb R,\operatorname{Fin}(n))EuclideanSpace(R,Fin(n)) with compact support, and let PPP be a probability measure on a measurable sample space Ω\OmegaΩ. Let WWW be an nnn-dimensional multidimensional Brownian motion whose coordinates are Brownian with respect to a filtration F\mathcal FF. Let γ\gammaγ be a cutoff on the parameter space and let pt(ω)p_t(\omega)pt​(ω) be an IsEldanCutoff process. Assume:

  1. The filtration is decreasing from time 000 toward nonpositive times: F0≤Ft\mathcal F_0\leq\mathcal F_tF0​≤Ft​ whenever t≤0t\leq 0t≤0.
  2. Every PPP-null measurable set is measurable with respect to F0\mathcal F_0F0​.
  3. The cutoff and process satisfy the stated cutoff Eldan process conditions.
  4. FFF is a C2C^2C2 function on the parameter space, and T≥0T\geq 0T≥0.

Then F(pT)F(p_T)F(pT​) is PPP-integrable and its expectation satisfies

∫ΩF(pT(ω)) dP(ω)−F(0)=∫Ω∫(0,T]γ(ps(ω))2 generator⁡(μ,hc,F)(ps(ω)) ds dP(ω).\int_\Omega F(p_T(\omega))\,dP(\omega)-F(0) = \int_\Omega\int_{(0,T]}\gamma(p_s(\omega))^2\,\operatorname{generator}(\mu,h_c,F)(p_s(\omega))\,ds\,dP(\omega).∫Ω​F(pT​(ω))dP(ω)−F(0)=∫Ω​∫(0,T]​γ(ps​(ω))2generator(μ,hc​,F)(ps​(ω))dsdP(ω).

This is a reusable expectation identity for twice continuously differentiable observables of the cutoff localization process.

Formalization Note. The integrals are Lebesgue integrals over (0,T](0,T](0,T] and PPP; the generator is the uncut generator, multiplied by the squared cutoff coefficient.

Superseded upload. This snapshot was replaced by FunctionalInequalities.KLS.BKL.Localization.IsEldanCutoff.dynkin_readable: open the readable replacement. The replacement preserves the frozen source and mathematical statement, with a compact declaration context. This historical node remains available for existing imports.

Preamble
import Definitions.Def_KLSModular_FunctionalInequalities_KLS_BKL_Localization_Process_Basic

noncomputable section
open MeasureTheory ProbabilityTheory Filter Topology
open scoped NNReal ENNReal RealInnerProductSpace
open FunctionalInequalities.Probability.Posterior FunctionalInequalities.Analysis
  FunctionalInequalities.Probability.Diffusion
section
namespace FunctionalInequalities
end FunctionalInequalities
open FunctionalInequalities
section
namespace FunctionalInequalities.KLS
end FunctionalInequalities.KLS
open FunctionalInequalities FunctionalInequalities.KLS
section
namespace FunctionalInequalities.KLS.BKL
end FunctionalInequalities.KLS.BKL
open FunctionalInequalities FunctionalInequalities.KLS FunctionalInequalities.KLS.BKL
section
namespace FunctionalInequalities.KLS.BKL.Localization
end FunctionalInequalities.KLS.BKL.Localization
open FunctionalInequalities FunctionalInequalities.KLS FunctionalInequalities.KLS.BKL FunctionalInequalities.KLS.BKL.Localization
open LevyStochCalc LevyStochCalc.Brownian LevyStochCalc.Brownian.Multidim LevyStochCalc.Brownian.Ito
variable {n : ℕ} (μ : ProbabilityMeasure (EuclideanSpace ℝ (Fin n)))
  (hc : IsCompact (μ : Measure (EuclideanSpace ℝ (Fin n))).support)
section Process
variable {μ hc} {Ω : Type*} [MeasurableSpace Ω] {P : Measure Ω} [IsProbabilityMeasure P]
  {W : MultidimBrownianMotion P n} {ℱ : Filtration ℝ ‹MeasurableSpace Ω›}
  {hW : ∀ k, IsBrownianFiltration (W.W k) ℱ} {γ : Param n → ℝ} {p : ℝ → Ω → Param n}
Formal statement

theorem FunctionalInequalities.KLS.BKL.Localization.IsEldanCutoff.dynkin_modular (hiso : KLS.Isotropic μ) (hγ : IsCutoff γ)
    (hℱ0 : ∀ t : ℝ, t ≤ 0 → ℱ 0 ≤ ℱ t)
    (hnull : ∀ s : Set Ω, MeasurableSet s → P s = 0 → MeasurableSet[ℱ 0] s)
    (h : IsEldanCutoff μ hc W ℱ hW γ p) {F : Param n → ℝ} (hF : ContDiff ℝ 2 F)
    {T : ℝ} (hT : 0 ≤ T) :
    Integrable (fun ω => F (p T ω)) P ∧
      ∫ ω, F (p T ω) ∂P - F 0 =
        ∫ ω, ∫ s in Set.Ioc (0 : ℝ) T, γ (p s ω) ^ 2 * generator μ hc F (p s ω) ∂volume ∂P := by sorry
Source
Source: Bizeul–Klartag–Lehec, Presenting a proof of the Kannan–Lovász–Simonovits conjecture (arXiv:2610.05474v1), Equation (67), p. 19 (unnumbered display) and the compact stage before it. Lean source: https://github.com/human-ai-mathematics/kls-lean/blob/408915f/formalization/FunctionalInequalities/KLS/BKL/Localization/Process/Basic.lean#L177-L217 (repository human-ai-mathematics/kls-lean, commit 408915f, module `FunctionalInequalities.KLS.BKL.Localization.Process.Basic`, declaration `FunctionalInequalities.KLS.BKL.Localization.IsEldanCutoff.dynkin`; 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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me