Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Existence Of The Cutoff Eldan Localization Process

Proved
FunctionalInequalities.KLS.BKL.Localization.exists_isEldanCutoff_readable

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

bkl2026functional-inequalitieskls-conjecturekls-modularkls-readablelog-concave

This formalizes the existence assertion associated with Equation (67) of Bizeul–Klartag–Lehec (arXiv:2610.05474v1), locator Equation (67), p. 19. Let μ\muμ be a probability measure on EuclideanSpace⁡(R,Fin⁡(n))\operatorname{EuclideanSpace}(\mathbb R,\operatorname{Fin}(n))EuclideanSpace(R,Fin(n)) with compact support and assume that μ\muμ is isotropic. Let WWW be an nnn-dimensional Brownian motion on a probability space (Ω,P)(\Omega,P)(Ω,P), and let F\mathcal FF be a right-continuous filtration satisfying the stated ordering and null-set hypotheses. For a cutoff function γ\gammaγ satisfying IsCutoff γ, there exists a parameter process p:R→Ω→Param⁡(n)p:\mathbb R\to\Omega\to\operatorname{Param}(n)p:R→Ω→Param(n) satisfying IsEldanCutoff μ hc W ℱ hW γ p:

∃p,IsEldanCutoff⁡(μ,hc,W,F,hW,γ,p).\exists p,\quad \operatorname{IsEldanCutoff}(\mu,h_c,W,\mathcal F,h_W,\gamma,p).∃p,IsEldanCutoff(μ,hc​,W,F,hW​,γ,p).

The predicate records the cutoff localization dynamics, including the initial parameter and the associated process properties. The theorem is the existence component of the cutoff-stage construction.

Original Lean declaration header

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

theorem exists_isEldanCutoff (hiso : KLS.Isotropic μ)
    {Ω : Type*} [MeasurableSpace Ω] {P : Measure Ω} [IsProbabilityMeasure P]
    (W : MultidimBrownianMotion P n) (ℱ : Filtration ℝ ‹MeasurableSpace Ω›)
    [ℱ.IsRightContinuous] (hW : ∀ k, IsBrownianFiltration (W.W k) ℱ)
    (hℱ0 : ∀ t : ℝ, t ≤ 0 → ℱ 0 ≤ ℱ t)
    (hnull : ∀ s : Set Ω, MeasurableSet s → P s = 0 → MeasurableSet[ℱ 0] s)
    {γ : Param n → ℝ} (hγ : IsCutoff γ) :
    ∃ p : ℝ → Ω → Param n, IsEldanCutoff μ hc W ℱ hW γ p

Module navigation

Module: KLS/BKL/Localization/Process/Basic.

Definition modules: KLS/BKL/Localization/Coefficients, LevyStochCalc/Brownian/Filtered, LevyStochCalc/Brownian/Multidim, KLS/Isotropic.

Supporting theorems: cutoffCoefficients_admissible, exists_isDiffusion.

Next: IsEldanCutoff.continuous.

Source excerpt, lines 44–51 · Frozen source 408915f.

Preamble
import Definitions.Def_KLSModular_FunctionalInequalities_KLS_BKL_Localization_Process_Basic

open MeasureTheory ProbabilityTheory Filter Topology
open LevyStochCalc LevyStochCalc.Brownian LevyStochCalc.Brownian.Multidim LevyStochCalc.Brownian.Ito
variable {n : ℕ} (μ : MeasureTheory.ProbabilityMeasure (EuclideanSpace ℝ (Fin n)))
  (hc : IsCompact (μ : MeasureTheory.Measure (EuclideanSpace ℝ (Fin n))).support)
Formal statement

theorem FunctionalInequalities.KLS.BKL.Localization.exists_isEldanCutoff_readable (hiso : KLS.Isotropic μ)
    {Ω : Type*} [MeasurableSpace Ω] {P : Measure Ω} [IsProbabilityMeasure P]
    (W : MultidimBrownianMotion P n) (ℱ : Filtration ℝ ‹MeasurableSpace Ω›)
    [ℱ.IsRightContinuous] (hW : ∀ k, IsBrownianFiltration (W.W k) ℱ)
    (hℱ0 : ∀ t : ℝ, t ≤ 0 → ℱ 0 ≤ ℱ t)
    (hnull : ∀ s : Set Ω, MeasurableSet s → P s = 0 → MeasurableSet[ℱ 0] s)
    {γ : Param n → ℝ} (hγ : IsCutoff γ) :
    ∃ p : ℝ → Ω → Param n, IsEldanCutoff μ hc W ℱ hW γ 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#L42-L137 (repository human-ai-mathematics/kls-lean, commit 408915f, module `FunctionalInequalities.KLS.BKL.Localization.Process.Basic`, declaration `FunctionalInequalities.KLS.BKL.Localization.exists_isEldanCutoff`; 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