Abstract¶
The Kannan–Lovász–Simonovits (KLS) conjecture asked whether linear functions detect, up to a universal constant, the slowest mode of every log-concave measure; it is now a theorem, Conjecture 0.1, and this manuscript works through and compares its three proofs. Bizeul–Klartag–Lehec (BKL) bound cumulants of every order uniformly in the dimension and reach an arbitrary test function by suspension. The second version of Song–Zhang (SZ v2) refines one coefficient radius infinitely often, with losses whose product stays bounded. Balasubramanian–Kasiviswanathan (BK) bound all powers of an integration operator on compatible tensor fields at once and close an induction in the polynomial degree, with (Theorem 11.2). The manuscript also develops three alternative mechanisms for the Poincaré bound — a deterministic moment-Hessian inequality, the occupation of a fixed eigenfunction, and resampling along conditional lines — each aiming at something the proofs do not give, and keeps the localization of a fixed cut as an archive.
This overview is meant to be read on its own. It states the question and works its smallest cases by hand (Sections The question and Examples by hand), summarizes the literature (Section What was known), explains how KLS was proved (Section How KLS was proved), sets out the obstacles that other arguments meet (Section Obstacles for alternative arguments), gives the main results with the idea of each proof (Section The main results in short), and ends with three problems for someone who might take them up (Section Problems for someone who might take them up). How the manuscript is organized, and how its results are checked, is on the welcome page.
The question¶
The conjecture is a statement about expansion. A log-concave measure cannot be cut in two without paying for the cut, and KLS asserts that in the right normalization the price does not decay as the dimension grows. Equivalently, in its analytic form, the measure has a spectral gap bounded below independently of : no function of many variables can have large variance and small gradient energy at the same time. A dumbbell — two balls joined by a thin tube — is cheap to cut through its neck; convexity forbids necks, and the conjecture quantifies how completely.
The question came from the analysis of random walks that compute the volume of a convex body, whose mixing time is governed by the Cheeger constant Kannan et al., 1995.
The conjecture¶
Let be a log-concave probability measure on , that is, one with a density for a convex (possibly on a lower-dimensional affine subspace); the uniform measure on a convex body and every Gaussian are examples. Write for the Minkowski boundary measure of a Borel set , and define the Cheeger constant and its reciprocal, the inverse Cheeger scale,
The Poincaré constant is the least constant with
for every locally Lipschitz ; it is the inverse of the spectral gap of the diffusion naturally attached to .
For log-concave measures the Cheeger and reverse Cheeger (Buser–Ledoux) inequalities give the two-sided comparison
so with universal constants; the explicit constants are recorded in Klartag, 2023Milman, 2009. The lower bound is Cheeger’s inequality in the normalization used throughout.
A measure is isotropic if it is centered and its covariance is the identity.
Write
Thus Conjecture 0.1 is equivalently , up to the comparison (0.3).
Three formulations are used interchangeably below.
(a) Isotropic form. For isotropic (that is, and ),
(b) Affine form. For every log-concave ,
The reverse inequality is automatic: testing the Poincaré inequality on the linear function with a top eigenvector of gives and . So (0.7) says exactly this: up to a universal constant, linear functions already detect the slowest mode of every log-concave measure.
(c) Geometric form. The least-expanding arbitrary cut of a convex body is, up to a universal factor, no worse than the least-expanding hyperplane cut Kannan et al., 1995.
Applying Poincaré to in isotropic position gives
the implication “KLS thin shell” discussed in Section Solved neighbors that are not KLS. Thin shell controls one observable, , and on its own it did not lead to KLS.
Examples by hand¶
The ratio is at least 1, by testing linear functions as above; the conjecture says it is bounded. Here it is in the smallest cases.
The Gaussian. For the standard Gaussian, and linear functions are extremal: the ratio is exactly 1 in every dimension.
An interval. For the uniform measure on , . The slowest mode is , with and , so (Wirtinger’s inequality) and . The slowest mode is not linear, but a linear function is within a factor 1.22 of it.
The exponential. Let have density on , so . For with ,
Hence . This is the worst case on the line: every one-dimensional log-concave law has , the one-dimensional case of the Kannan–Lovász–Simonovits bound Kannan et al., 1995Cattiaux & Guillin, 2018, which Theorem 17.1 contains. The near-extremal functions leave at : the slowest mode of the exponential escapes to infinity.
Products. The Poincaré constant of a product is the largest Poincaré constant of its factors (tensorization), so a product of isotropic one-dimensional log-concave laws has in every dimension; Proposition 27.2 records the corresponding fact for the Cheeger constant. The cube and the product of exponentials are therefore harmless. The conjecture is about everything that is not a product: simplices, cones, balls of non-Euclidean norms, and log-concave measures with no symmetry at all.
No family of log-concave measures had been found with the ratio in (0.7) growing with ; the gap was entirely in the upper bound, which the three proofs make dimension-free.
What was known¶
This section records the quantitative history and the two neighboring conjectures settled before KLS, with why settling them did not settle KLS.
The quantitative history¶
Set
the suprema over isotropic log-concave measures on . The published bound used here is Klartag’s , or Klartag, 2023, stated as Theorem 26.2. Letwin’s first-version preprint (arXiv:2607.24164v1, 27 July 2026) gives and as Theorem 4.6. Song–Zhang’s first-version preprint (arXiv:2610.01447v1, 1 October 2026) gives as Theorem 7.5.
Exponents are given for and for side by side, precisely because of The convention.
| Date | Main development | ||
|---|---|---|---|
| 1995 | The localization lemma Kannan et al., 1995. | ||
| 1995–2011 | down to | — | Bobkov’s radial inequality fed by successively better thin-shell bounds; the last notable pre-localization record Guédon & Milman, 2011. |
| 2012/13 | Stochastic localization Eldan, 2013. | ||
| 2016; 2024 | Fixed Gaussian tilt and the stopping argument Lee & Vempala, 2018Lee & Vempala, 2024. | ||
| 2020/21 | same class | Iterated high-Schatten potentials and affine preconditioning Chen, 2021. | |
| 2022 | First polylogarithmic bound; heat flow, spectral projections, Klartag & Lehec, 2022. | ||
| 2022 | Two localization representations and spiked-spectrum estimates Jambulapati et al., 2022. | ||
| 2023 | Improved Lichnerowicz plus short-time covariance control Klartag, 2023. | ||
| July 2026, preprint | Theorem 4.6: quadratic Poincaré, , and the time-restricted spectral bridge Letwin, 2026. | ||
| 1 October 2026, preprint (v1) | Theorem 7.5: polynomial estimates fed into curvature estimates and back Song & Zhang, 2026. | ||
| 4 October 2026, preprint | BKL prove KLS through cumulants and suspension; Chapter Bizeul–Klartag–Lehec: cumulants and suspension Bizeul et al., 2026. | ||
| 4 October 2026, preprint (v2) | The second version of Song–Zhang proves KLS by repeated refinement with summable losses; Chapter Song–Zhang, second version: repeated refinement with summable losses Song & Zhang, 2026. | ||
| 6 October 2026, preprint | BK prove KLS through compatible integration and a direct Appell induction, with ; Chapter Balasubramanian–Kasiviswanathan: compatible integration Balasubramanian & Kasiviswanathan, 2026. |
Through Buser–Ledoux, BK’s Poincaré bound also gives an explicit Cheeger bound, (Corollary 11.3). The authors of all three proofs declare substantial use of AI tools in finding them; their statements are quoted on the welcome page.
Solved neighbors that are not KLS¶
The classical implication structure is
and the arguments resolving the two weaker conjectures did not supply a dimension-free proof of KLS.
Slicing. Bourgain’s slicing conjecture asks whether the isotropic constants are universally bounded. Guan proved and, in the process, obtained the stochastic-localization trace estimate that turned out to be decisive Guan, 2024. Klartag and Lehec combined that estimate with -ellipsoids and Shannon–Stam stability to prove , published in 2025 Klartag & Lehec, 2025; Bizeul subsequently gave an alternative proof through small-ball estimates Bizeul, 2025. Slicing controls determinant and volume information, not the bottom of the full spectrum.
Thin shell. For isotropic log-concave the thin-shell conjecture asks for , equivalently . Klartag and Lehec gave a proof via parallel couplings of exponential tilts, nonlinear filtering, optimal transport, estimates, and Guan-type covariance control Klartag & Lehec, 2025; Chapter Family 6: parallel coupling of exponential tilts describes the coupling and what it does not reach. A July 2026 first-version preprint of Chen and Klartag sharpens it to the optimal , with equality for products of centered exponentials, together with a sharp third-moment-tensor bound Chen & Klartag, 2026; both statements are recorded as Theorem 4.4 and Theorem 4.5.
Why the earlier comparison retained a loss. Eldan’s reverse estimate bounds the inverse Cheeger scale by a weighted average of thin-shell parameters Eldan, 2013,
Even with the harmonic sum contributes a , and (0.12) yields only , not . Radial concentration constrains one observable, ; KLS quantifies over every function and every measurable cut. The same asymmetry recurs, in sharper form, for Letwin’s preprint: it eliminates every quadratic witness, and the first eigenfunction of a general log-concave diffusion need not be quadratic.
How KLS was proved¶
Stochastic localization and the quadratic estimate control linear and quadratic functions; the first eigenfunction of a general log-concave measure is neither. Every argument below is a way to reach every test function. Two dimension-dependent conversions came first, both from Letwin’s quadratic estimate Theorem 25.1: Letwin’s own, through improved Lichnerowicz (Section Letwin: localization and improved Lichnerowicz), and the first version of Song–Zhang (SZ v1), through polynomials of every degree (Section Song–Zhang, first version: polynomial estimates and curvature). SZ v1 also isolated a spectral criterion whose exponential form is equivalent to KLS. BKL and SZ v2 close that criterion in two different ways (Sections Bizeul–Klartag–Lehec: cumulants and suspension and Song–Zhang, second version: summable losses); BK keep its polynomials but obtain the spectral gap from an integration calculus of their own (Section Balasubramanian–Kasiviswanathan: compatible integration).
Letwin: localization and improved Lichnerowicz¶
Letwin’s Theorem 4.6 combines four ingredients (Figure Figure 0.1). Stochastic localization observes through Gaussian noise of decreasing size and follows the conditional law , which is -strongly log-concave and is on average (Chapter Family 2: stochastic localization). The covariance process obeys an exact Riccati SDE whose noise is the third-moment tensor. Klartag’s improved Lichnerowicz inequality (Theorem 3.1) converts curvature into a spectral gap. The new input bounds directional third moments by the quadratic estimate (Proposition 26.1), through the moment-map and Stein-kernel mechanism of Chapter Family 4: moment maps, Monge–Ampère, and Stein kernels.
Figure 0.1:The architecture of Theorem 4.6. Boxed in color: the contribution of Letwin’s preprint, an input to the localization–Lichnerowicz pipeline rather than a replacement for it.
The bridge. Define the directional third-moment parameter
the supremum over isotropic log-concave on and . The localization–Lichnerowicz pipeline delivers
and Letwin’s turns (0.14) into Theorem 4.6.
Where its logarithm lives. Not in the moment-map calculation. To keep bounded along the path, one follows a smooth surrogate of the top eigenvalue, , which approximates it within a constant only if . Its Itô drift is then of order , covariance control survives until , and improved Lichnerowicz turns that time into . The logarithm is the entropy cost of replacing a matrix maximum by a soft maximum over directions (Remark 2.2; the computation is Section Where the surviving logarithm lives). Section The covariance spike, and why the direct repair fails explains why a better pathwise bound on cannot remove it.
Song–Zhang, first version: polynomial estimates and curvature¶
Song and Zhang keep the localization and the quadratic estimate, and replace improved Lichnerowicz by a conversion through polynomials of every degree (Chapter Song–Zhang, first version: polynomial estimates and curvature, Figure Figure 7.1). The polynomials are the Appell polynomials of the measure, adapted to its moments in each degree, and their growth is measured by coefficients ; for the standard Gaussian they are the Hermite polynomials and .
The spectral criterion. For a measure of curvature , bounds give , much better than the Bakry–Émery bound (Theorem 7.2). The proof follows a first eigenfunction through repeated centered gradients and inverse square roots of the diffusion operator. Curvature uses up energy at each step, while centering removes mass that the polynomial tests measure; if the gap were too small, too much mass would survive for the energy available. With the comparison is exact at the end point: KLS is equivalent to one exponential bound , uniform in the degree, the dimension and the measure (Proposition 7.1).
The iteration. Feeding the curvature profile back through localization improves the coefficient bounds, and the comparison can be run again. Each round replaces a logarithm by its logarithm: at depth the profile is , with the -fold iterated logarithm and (Theorem 7.3). Localizing an arbitrary isotropic log-concave measure to curvature transfers the profile to it (Theorem 7.4), and gives Theorem 7.5.
Where its loss lives. The comparison is paid again at every round, at a fixed factor 4 in , with admissibility thresholds that grow with the depth, while the depth must grow, very slowly, with (Section Feeding the curvature estimate back into the polynomials).
Bizeul–Klartag–Lehec: cumulants and suspension¶
The calibration on the line. The cumulants of a law are the Taylor coefficients of the logarithm of its Laplace transform. For the standard Gaussian that logarithm is : every cumulant beyond the second vanishes. For the centered exponential it is , so the -th cumulant is . A bound on cumulants of every order, uniform over log-concave laws, must therefore allow factorial growth.
The idea. BKL prove that this growth is the worst possible: for every isotropic log-concave , in every dimension, the cumulant tensor with one slot fixed satisfies , with every other entry summed and no factor of (Theorem 8.2). Along a stochastic localization whose noise is normalized by the current covariance, the -th cumulant has the -th as its noise; a static bound at order and an integrated bound at order are therefore proved together, starting from the third-moment estimate, with no KLS estimate. A cumulant bound concerns linear observables only, and suspension reaches an arbitrary : average over independent copies of the law and adjoin the average, smoothed, as one extra coordinate. The enlarged law is log-concave in dimension , and its mixed cumulants are the derivatives of the average of under exponential tilts (Proposition 8.2). Because the cumulant bound does not see the dimension, it applies to this law and gives the exponential coefficient bound Theorem 8.3 for every test function; the tilt-average criterion Theorem 8.1, the spectral criterion of SZ v1 in exponential form, turns it into KLS. The argument is Chapter Bizeul–Klartag–Lehec: cumulants and suspension.
Song–Zhang, second version: summable losses¶
The calibration in one line. A fixed cost per repetition gives a factor after repetitions, however slowly grows with ; this is the loss of SZ v1. Costs with have product at most , since . The arithmetic proves nothing by itself: each repetition must remain admissible at its starting depth, and its estimates must concern the same functions.
The idea. SZ v2 iterate not the Poincaré constant but one coefficient radius, , equal to 1 for the standard Gaussian (Definition 9.1); the conversion (Proposition 9.1) is then paid once, at the end, instead of at every round. Each refinement of the radius still passes through curvature profiles and localization, as in SZ v1, but the inverse-gradient iterates are now controlled in blocks that keep centering and symmetry information over many steps, so that a refinement with margin costs a factor rather than a fixed . With the margins above the multiplicative costs have a bounded product, and the starting depths, which grow as the margins shrink, are absorbed into an improving height profile at a summable additive cost (Proposition 9.4). For a fixed regular measure finitely many refinements suffice, and approximation gives Theorem 9.3. The four successive improvements are Chapter Song–Zhang, second version: repeated refinement with summable losses; the block estimates are Chapter Song–Zhang, second version: technical estimates.
Balasubramanian–Kasiviswanathan: compatible integration¶
The calibration on the line. For the standard Gaussian the Appell polynomials are the Hermite polynomials , , , …, and centered integration — taking the primitive of mean zero — sends to . The coefficients are therefore the norms of the successive powers of one integration operator applied to the constant 1. BK make these powers the object of the proof.
The idea. For a general law, BK integrate compatible symmetric tensor fields, those that can be integrated again, and bound all powers of the integration operator at once: a Hodge estimate whose curvature constant does not depend on the tensor rank (Lemma 11.2), an operator lemma that controls every power from finitely many polynomial observations with one common prefactor (Lemma 11.3), and a localization normalized by the covariance that transfers these bounds to the next Appell coefficient (Proposition 11.2). Started from Letwin’s quadratic estimate, this closes an induction giving (Theorem 11.1). For a fixed curved law, letting the number of observations tend to infinity gives , and approximation extends it to every log-concave law (Theorem 11.2): the spectral gap comes from the integration calculus itself. The argument is Chapter Balasubramanian–Kasiviswanathan: compatible integration.
The three proofs are compared step by step, with their shared inputs and reusable estimates, in Chapter The proofs of KLS compared.
Obstacles for alternative arguments¶
The questions of this section concern other arguments: a proof by a different mechanism — deterministic, or with a sharp constant — or a proof of a property that implies KLS, such as the moment-Hessian inequality or the occupation estimate of Section The main results in short. Three obstacles constrain any such attempt: a pattern that every classical family meets (Section Fixed and averaged, against adaptive and uniform), a counterexample to the most natural repair (Section The covariance spike, and why the direct repair fails), and a cheap test that any proposal should pass (Section The tensorization test).
Fixed and averaged, against adaptive and uniform¶
Needles control one-dimensional conditional laws; stochastic localization controls covariance and directional third moments; moment maps control fixed matrix energies; parallel coupling controls linear exponential tilts. Each estimate is fixed in advance or averaged, while a small spectral gap is carried by an object that the measure, or an extremal function, selects. The table of Section The six families side by side records, family by family, what is controlled and what is missing. The three proofs get past this through polynomial tests of every degree, which reach every function.
Two directions remain meaningful for a different proof:
Reach the exponential Appell criterion by another mechanism. The criterion Proposition 7.1 is the common end point; a further derivation must supply its own estimates, including control of centering losses.
Establish an adapted structural estimate. The moment map uses a Hessian field; the fixed eigenfunction follows the function selected by a small spectral gap; conditional fibers select directions from the measure; the fixed cut, kept as an archive, follows a potential bottleneck. What each would add is set out in Chapter Alternative mechanisms after KLS.
The six families side by side¶
Chapters Family 1: classical needle localization–Family 6: parallel coupling of exponential tilts survey six families of methods, from classical needles to the parallel coupling behind the thin-shell theorem. The table collects what each controls and the estimate it does not supply by itself.
| Family | What is controlled | The missing estimate | Section |
|---|---|---|---|
| Classical needles | One-dimensional conditional measures, sharply | A decomposition inheriting operator covariance: global isotropy is not inherited needle by needle | Family 1: classical needle localization |
| Stochastic localization | Short-time covariance and the directional third-moment estimate Proposition 26.1 | Control of along the whole path without the cost of a soft maximum; see Proposition 0.1 | Family 2: stochastic localization |
| Bochner, , heat flow | Coordinate and quadratic spectral mass of the first eigenspace | Uniform estimates for the derivatives of an arbitrary : trace, coordinate or averaged spectral information does not bound every slow mode | Family 3: Bochner, heat flow, and the H^{-1} calculus |
| Moment maps and Stein kernels | Fixed deterministic matrix energies ; and exactly on the line and on products, with the bound 4 on every log-concave Dirichlet law (The moment map: exact cases) | Control when the matrix or direction depends on or on , that is, the correlation of the random Stein kernel with an arbitrary . Even the linear sector is missing: does not follow from (Proposition 16.3) | Family 4: moment maps, Monge–Ampère, and Stein kernels |
| Transport (Caffarelli, Föllmer, entropic barrier) | Polylogarithmic averaged derivative bounds | A dimension-free expected operator derivative | Family 5: transport maps and the entropic barrier |
| Parallel coupling | Linear exponential tilts | Couplings for arbitrary functional perturbations | Family 6: parallel coupling of exponential tilts |
The covariance spike, and why the direct repair fails¶
The most natural repair is to bound better. It cannot work, because the statement it needs is false, and false for a measure that satisfies the conjecture.
This is due to Klartag and Lehec (Section 8.1 and Proposition 65 of Klartag & Lehec, 2025). The mechanism fits in a line. A centered exponential coordinate has a flat tail: conditionally on a large observation, the prior barely varies on the scale of the noise, so the posterior of that coordinate is essentially the Gaussian noise itself, of variance . One coordinate out of is that large with probability about , so as long as some coordinate is, and the top conditional eigenvalue is of order — while the product of exponentials has Poincaré constant 4.
The consequence is structural: uniform operator-norm control of the conditional covariance at every scale is false, even for a measure that satisfies KLS. An argument whose only use of the localization path is a pathwise bound on needs a statement that is false. A successful potential must exploit eigenvalue profiles, averaging, tensorization, or the particular extremizing function — not better pointwise bounds. The consequence also cuts the other way: rare spikes can be harmless, and a potential that charges the full largest eigenvalue whenever a spike occurs is overcharging.
The tensorization test¶
That gives a cheap and discriminating test, which any proposal should pass before it is developed.
Evaluate the proposed potential on a product of independent copies of a one-dimensional measure. A quantity that is not tensorization-aware will charge independent coordinates times for a phenomenon that costs .
A proposal that fails it is false at scale, and the failure is usually visible in a page. Chapter The fixed cut: product stress test applies it to the all-cut Carleson estimate of the fixed cut (Corollary 31.1, Conjecture 31.1); Proposition 29.1 below applies it to a weighted estimate.
The main results in short¶
The results fall into three groups: a deterministic inequality that implies KLS, and the families where it holds; two further mechanisms for the Poincaré bound, each through an object of its own; and, from the fixed-cut archive, the limits of following a single cut. Each paragraph gives the idea; the statements and their proofs are in the chapters cited.
A deterministic inequality, sharp on products and Dirichlet laws¶
These results use no stochastic localization. They start from the moment map of Cordero-Erausquin and Klartag Cordero-Erausquin & Klartag, 2015: a centered log-concave is the image of under for an essentially unique convex . Transported to , the Hessian is a Stein kernel: for every test function , and . It defines a generator , symmetric for , which for the standard Gaussian () is the Ornstein–Uhlenbeck operator. The canonical moment-Hessian constant of Definition 16.1 is the best constant in .
It implies the affine Poincaré inequality with no loss. Theorem 16.1 states for measures in the regular moment-map class, where is the Poincaré constant measured against . A universal bound would therefore prove KLS by a deterministic argument, with the constant 4, which is attained. The mechanism is one Cauchy–Schwarz. Given a centered , solve ; then
and the last factor is at most . Only the symmetry, the positivity and the Stein identity of are used, which is why the constant passes intact. The converse is less clear: a weighted Hodge decomposition (Corollary 16.1) splits the numerator of into a gradient part, which is exactly the affine Poincaré quotient, and a divergence-free part that vanishes on the line but not beyond. This decomposition concerns the moment-map Hessian. The Hodge estimate in BK’s proof concerns the potential of the measure and a different energy; no implication between the two is established here (Section Paragraph).
Where it holds. On the line exactly (Theorem 17.1), so the exponential has constant exactly 4; the constant of a product is the largest constant of its factors (Theorem 17.2). Beyond products, Theorem 17.3 gives for every log-concave Dirichlet law — the law of for independent with all , which includes the uniform measure on a simplex. Hence every such law, and every product, linear image or convolution of independent ones, has (Corollary 17.3). The proof lifts the simplex to the independent Gamma variables, where the generator is that of a product, and ends in a scalar minimization where is used (Chapter The moment map: exact cases). Dimension-free Poincaré bounds for simplices had been obtained earlier, qualitatively, by Kolesnikov and Milman Kolesnikov & Milman, 2016. The product case is also a warning: a product of centered exponentials has with no slack (Corollary 17.5), so a log-concave perturbation that raised the constant would refute the inequality. Conjecture 17.1 conjectures that none does to second order.
The linear test. Testing the moment-Hessian inequality on linear functions only gives its cheapest necessary condition, in isotropic position (Conjecture 16.1); this manuscript calls it the linear test, not to be confused with the bound obtained from linear functions in Section The conjecture. It is a third-moment problem: by Lemma 16.2, is , with , plus a remainder orthogonal to affine functions. An operator bound on therefore bounds directional third moments (Corollary 16.2), and the test is computed exactly on exponential cones (Proposition 17.2). Matrix inequalities over fixed matrices do not give it. Proposition 16.3 builds a random positive semidefinite matrix that satisfies every fixed-matrix energy bound of Theorem 4.2 and has ; the two quantities differ by a commutator. The countermodel is not a moment-map Hessian, so it does not refute Conjecture 16.1: it shows that a proof must use more of the moment-map structure, the fixed-versus-adaptive pattern of Section Fixed and averaged, against adaptive and uniform once more.
Two further mechanisms for the Poincaré bound¶
Following one eigenfunction: the fixed eigenfunction. Run stochastic localization on an isotropic log-concave and follow a first eigenfunction through and the tensor . The vector obeys an exact equation in which is a source and the covariance of the localized measure a damping, with no inequality spent. By Proposition 21.1, an occupation estimate bounding the accumulated source by the full damping plus a linear budget (Conjecture 21.1) implies KLS. The damping then cancels the source, Grönwall’s lemma shows that keeps half its variance up to a universal time, and the bound for the localized measure turns that into a spectral gap. The eigenfunction does not see covariance spikes in directions it does not use, which is why this approach is not ruled out by Proposition 0.1. One available implication, Proposition 21.2, assumes a small gap that no measure has: the published bound Theorem 26.2 already gives a larger one. What exists, and what is missing, is Section The initial layer: before and after a covariance exit.
Resampling along conditional lines: conditional fibers. For a direction , resample along the line through in direction from its conditional law, and divide the resulting variance of by the conditional variance of the line coordinate; averaging over an isotropic frame of directions gives a Dirichlet form . By Lemma 22.1, — the one-dimensional bound applied on each line — and linear functions carry exactly their Euclidean energy. A frame with a dimension-free gap for this form would therefore give KLS with constant , using only one-dimensional inequalities (Conjecture 22.1). The natural frame on the simplex, the root directions , fails: its gap is , witnessed by the indicator of a small cap at a vertex, which few root directions can move (Proposition 22.1). The simplex itself has a dimension-free Poincaré constant, so the frame, not the measure, is at fault. The failure is invisible at fixed polynomial degree, where every admissible frame has a positive floor (Lemma 22.3).
Following one cut: a ceiling and two counterexamples¶
The fixed cut, the oldest localization argument developed here and now kept as an archive, follows one cut of mass and tracks the excess of its boundary over the isoperimetric profile of the localized measure. Its results are limits and counterexamples, and they apply to any argument that follows a set.
The near-worst bootstrap. For a measure whose Cheeger constant is within a factor of the smallest in its dimension, Theorem 33.1 shows that the excess propagates along localization with one quantity as its only input, . Whitening a localized measure loses at most against the worst isotropic measure of the same dimension, and near-worstness charges every loss to . The published covariance estimates give (Corollary 33.1). By Proposition 33.1, the bound for all measures at a small universal time would by itself suffice for KLS: this measures how strong that one input would have to be.
Independent spectators break global covariance weights. The fixed-cut argument wanted a propagation estimate for the excess weighted by (Conjecture 29.2). Proposition 29.1 refutes it on a product of centered exponentials with a cylinder cut: add many independent exponential coordinates that the cut ignores. Their covariance spikes (Section The covariance spike, and why the direct repair fails) inflate the global weight while the cut does not notice them, so the estimate fails the tensorization test. Removing the weight does not help (Proposition 29.2): a surviving estimate must change its remainder, or assume the measure near-worst, as Theorem 33.1 does.
Problems for someone who might take them up¶
Three problems are presented here for a reader who wants to start. Each is stated precisely in its chapter, and none of the three has an answer in the literature that we are aware of. Each asks for something the proofs of KLS do not give: a sharp constant, an elementary one-dimensional mechanism, or a localization mechanism that ignores covariance spikes.
The sharp linear test of the moment-Hessian inequality, Conjecture 16.2. It asks whether for the Stein kernel of the moment map of every isotropic log-concave measure: the linear test of Section A deterministic inequality, sharp on products and Dirichlet laws, with its sharp constant. Why it matters: the constant 2 is attained by products of exponentials, and none of the three proofs gives a sharp constant. It is the operator form of the Chen–Klartag trace inequality (Theorem 4.3), and it contains the sharp directional third-moment bound (Corollary 16.2), where the preprint literature reaches (Proposition 26.1). What there is: products of centered exponentials attain it in every direction, and every exponential cone with attains it in its axis direction, whatever the base (Proposition 17.2). Every product-simplex cone satisfies it, with transverse equality exactly when the base is a single simplex and (Proposition 17.3); an interval counts as a one-dimensional simplex. Any argument must be tight on these, and by Proposition 16.3 no argument through fixed-matrix energies alone can succeed. Where to start: Section The linear test: the necessary linear-sector condition, and the spectral resolution of the linear test in Lemma 16.1.
A conditional-fiber frame, Conjecture 22.1. It asks whether every isotropic log-concave measure admits one frame of directions, chosen before the test function, for which the resampling form of Lemma 22.1 has a dimension-free gap. Why it matters: it would give an elementary mechanism for the Poincaré bound, with constant , resting only on one-dimensional log-concave inequalities and a choice of directions. What failed: the root frame of the simplex (Proposition 22.1). Where to start: the simplex is a self-contained test case whose Poincaré constant is dimension-free, so the question there bears only on the frame. Either find an isotropic frame with a dimension-free gap on the simplex, or show that none exists; by Lemma 22.3, a proof of the second must use test functions whose degree grows with the dimension. Section Why the simplex root frame fails gives a short complete argument and is the place to begin.
The occupation estimate for one eigenfunction, Conjecture 21.1. Why it matters: it would give a localization mechanism that ignores covariance spikes, since the tensor of one eigenfunction does not see spikes in directions the eigenfunction does not use; by Proposition 21.1 it implies KLS. What there is: the time-weighted budget Lemma 21.2 and the stopped source bound Lemma 21.3. Where to start: Section The initial layer: before and after a covariance exit. What is missing is control of the source after the covariance has left a bounded range, on a time interval of universal length; the two budgets above do not supply it.
From here, the reading paths of the welcome page lead on: to the map of the alternative mechanisms in Chapter Alternative mechanisms after KLS, to the entry chapter of one mechanism, or to how results are checked before one contributes.
- Kannan, R., Lovász, L., & Simonovits, M. (1995). Isoperimetric Problems for Convex Bodies and a Localization Lemma. Discrete & Computational Geometry, 13(3–4), 541–559. 10.1007/BF02574061
- Klartag, B. (2023). Logarithmic Bounds for Isoperimetry and Slices of Convex Sets. Ars Inveniendi Analytica, 2023(4), 1–17. 10.15781/jsjy-0b06
- Milman, E. (2009). On the Role of Convexity in Isoperimetry, Spectral Gap and Concentration. Inventiones Mathematicae, 177(1), 1–43. 10.1007/s00222-009-0175-9
- Cattiaux, P., & Guillin, A. (2018). On the Poincaré Constant of Log-Concave Measures.
- Guédon, O., & Milman, E. (2011). Interpolating Thin-Shell and Sharp Large-Deviation Estimates for Isotropic Log-Concave Measures.
- Eldan, R. (2013). Thin Shell Implies Spectral Gap up to Polylog via a Stochastic Localization Scheme. Geometric and Functional Analysis, 23(2), 532–569. 10.1007/s00039-013-0214-y
- Lee, Y. T., & Vempala, S. S. (2018). The Kannan–Lovász–Simonovits Conjecture. https://arxiv.org/abs/1807.03465
- Lee, Y. T., & Vempala, S. S. (2024). Eldan’s Stochastic Localization and the KLS Conjecture: Isoperimetry, Concentration and Mixing. Annals of Mathematics, 199(3), 1043–1092. 10.4007/annals.2024.199.3.2
- Chen, Y. (2021). An Almost Constant Lower Bound of the Isoperimetric Coefficient in the KLS Conjecture. Geometric and Functional Analysis, 31(1), 34–61. 10.1007/s00039-021-00558-4
- Klartag, B., & Lehec, J. (2022). Bourgain’s Slicing Problem and KLS Isoperimetry up to Polylog. Geometric and Functional Analysis, 32(5), 1134–1159. 10.1007/s00039-022-00612-9
- Jambulapati, A., Lee, Y. T., & Vempala, S. S. (2022). A Slightly Improved Bound for the KLS Constant.
- Letwin, B. (2026). The KLS Constant is O(\log1/4 n).
- Song, Z., & Zhang, X. (2026). An O(4\log^* n) Bound for the KLS Constant. https://arxiv.org/abs/2610.01447v1
- Bizeul, P., Klartag, B., & Lehec, J. (2026). Presenting a Proof of the Kannan–Lovasz–Simonovits Conjecture. https://arxiv.org/abs/2610.05474v1
- Song, Z., & Zhang, X. (2026). An O(1) Bound for the KLS Constant. https://arxiv.org/abs/2610.01447v2