A Worked Example of the Proof of KLS Conjecture
This worked example accompanies “A Dimension-Free Bound on the Poincaré Constant of Isotropic Log-Concave Measures”, by Krishnakumar Balasubramanian and Shiva Kasiviswanathan.
Here, we consider a two-dimensional example that makes the ingredients of the paper’s argument concrete. We work through its calculations below and identify the general results we use from the paper by name and number. This companion illustrates the proposed argument; it does not independently verify the paper’s general theorems.
The Poincaré inequality compares the variance of a function with the average squared size of its gradient:
The left side measures how much a function fluctuates. The right side measures how much it changes locally. Recovering a centered function from its gradient is therefore exactly the operation we need to control. The gradient determines the function up to an additive constant, which the mean-zero condition fixes. For a centered function, variance is the average of its square, so the Poincaré inequality asks us to bound that average by a constant times the average squared gradient. The challenge is to control this recovery for every admissible gradient, starting from estimates for polynomials.
The Radial Exponential Family
Let have a radial exponential law, whose density depends only on distance from the origin. Keep the scale parameter visible for now:
In polar coordinates, the angle is uniform and independent of the radius . The radius has density . Integration by parts, starting with , gives, for integers and ,
The case verifies normalization. Symmetry gives zero mean and zero cross-covariance. The angular average of is , so, writing for the identity operator (here a two-by-two matrix),
Thus puts the law in isotropic position. We use that value from now on unless a scale is displayed explicitly.
Radial Density and Covariance
The plotted curve is the density of the radius, including the polar-coordinate Jacobian. Moving the scale parameter changes both the peak and the covariance.
Analytic formulas: radial density , covariance . The article uses , which makes the covariance .
Isotropy does not mean independence. Here the angular averages of and are and , respectively. Hence
The common radius couples the coordinates. There is also a geometric obstruction: with , the potential satisfies, away from the origin,
Its radial eigenvalue is zero. A curvature bound of the form , with , is therefore unavailable for the original law. This is why the later localization step has a job to do.
Compatibility Projection and Its Energy Cost
A vector field can be a gradient only if . On the plane this is the familiar compatibility condition. For a symmetric matrix field , the corresponding Hessian conditions are
At higher ranks, compatibility again says that exchanging the new derivative index with any tensor index changes nothing. These are the fields on which repeated integration makes sense.
To calculate with a smooth potential, temporarily replace by
Writing , differentiation gives
Its radial and tangential eigenvalues are and . Thus
All norms in the next calculation use the smooth density proportional to . In a weighted space, the adjoint of differentiation is . Even a constant Hessian can lose compatibility under this adjoint:
Curl of Weighted Divergence
For the mixed Hessian input, the weighted divergence is . Its curl is positive near the vertical axis and negative near the horizontal axis.
The color range is symmetric, from −1.667 to the corresponding positive value, and rescales with ε. This picture illustrates the analytic curl identity; it does not compute the Hodge projection.
The correction is an orthogonal projection in , rather than a pointwise alteration of the arrows. If projects onto compatible vector fields, weighted Hodge theory represents the discarded part as
The Weighted Hodge Laplacian and Compatibility Projection
For a test function , integration by parts in the two terms defining yields
Taking its curl and collecting the terms gives
For the regularized law, , so the closed quadratic form gives an invertible positive operator. Put . Then , while for every compatible in the form domain. Closing these identities gives the displayed orthogonal projection. Finally,
This calculation is on vector fields and two-forms. The manuscript's higher-rank comparison requires its additional constrained tensor argument.
The point of the comparison is to show that the projection leaves enough energy. In the manuscript's rank-two calculation, choose at each point an orthonormal basis in which has eigenvalues . The curl term is . The inverse-Hodge estimate bounds the energy lost by
The unprojected mixed-component energy has weight . Subtracting the possible loss gives exactly
The factor is the squared norm of the mixed symmetric component: both ordered entries are counted. The surviving curvature is its harmonic mean. Unequal curvatures create curl, but the correction does not erase the lower curvature bound.
Lemma 3.1 extends the curvature bound to every tensor rank. It applies to regular laws: centered laws with a smooth potential whose Hessian is bounded above and below by positive multiples of the identity. If , write for differentiation on centered compatible rank- fields. For every in the domain of its adjoint, the lemma gives
The lower curvature bound survives unchanged as the number of tensor indices grows. This uniformity is what lets the next step control arbitrarily long integration chains.
Centered Integration and Appell Polynomials
For a compatible field , its centered primitive is . The manuscript separates two kinds of inputs. The operator integrates a constant tensor of rank ; integrates a compatible field of that rank whose mean is already zero. Both return centered fields of rank . For a centered law, their defining identities are
The constant-input chain along the first coordinate is completely explicit. Successive integrations and centering give
For example, an antiderivative of is . Its mean is , so centering adds . This is why the final constant differs from the Gaussian one.
These are normalized Appell polynomials. We use the paper’s Appell tensors and scalar contractions, with the normalized shorthand
Coefficient comparison after differentiation and expectation gives and for . Thus
The rightmost operator acts first. The distinct matters: a nonzero constant tensor is not a centered input for .
The Radial Appell Generating Function
Rotational invariance implies that has the same law as for real . The polar moments give
Here , with value one at . Odd moments vanish. The binomial series therefore gives
The Appell generating function is . Only finitely many moments are needed at any fixed degree; the manuscript also uses this identity formally, without needing analytic convergence.
The Mixed Quartic Integration Chain
Use both coordinates by taking
Its mean is . Its first two derivatives are
The cross derivatives of both equal ; the matrix identities are and . Compatibility is visible entry by entry.
Constant-Tensor Integration
Successive Integration of a Constant Tensor
Start with the unit symmetric rank-four tensor whose six permutations each have entry .
A constant input: the first operation must be .
After one integration, the nonzero components of are
together with their permutations. Each has mean zero by reflection symmetry. The squared field norm is .
After two integrations, the field is , where :
Every entry is centered. Both off-diagonal entries are included in the squared norm, which is .
After three integrations, the field is the centered gradient
Its curl vanishes because its two mixed derivatives agree.
After four integrations, the scalar output is
The denominator is , because and .
The means vanish at every nonconstant stage. No coordinatewise choice of unrelated primitives is made.
Derivative Norms and Poincaré Test Quotients
The additional moments needed are and . They follow from the same polar moment formula. Expanding gives
Division by gives the displayed norms. A single test function yields a lower bound on the best Poincaré constant; these checks do not yet give an upper bound for all functions.
The draft's coefficient is the supremum over unit leading tensors:
Even at degree two, one direction does not attain this supremum. For a symmetric matrix , . The fourth moments yield
Since , equality at gives . In contrast, the directional polynomial has squared norm one.
The Degree-Two Appell Coefficient Norm
Write . Odd-coordinate moments vanish, so
Subtract the squared mean and divide by four:
This is the claimed tensor-norm formula.
Uniform Bounds for Integration Powers
Appell norms observe integration chains that start at constant tensors. A general compatible input can depend on position in any square-integrable way. Curvature connects these special observations to the full integration operator.
The paper bundles all tensor ranks into one Hilbert space, so that a single operator lowers rank and supplies the constant-input primitives. The inverse comparison in §4.2, based on Lemma 3.1, gives the following inequality. Appendix B supplies the operator-domain details.
The function acts on the operator’s spectral values, just as a function of a symmetric matrix acts on its eigenvalues. Its denominator records the contribution of curvature. The uniform power lemma, Lemma 5.1, uses this comparison and finitely many constant-input bounds to control every power of .
For a regular centered law with covariance at most , curvature at least , and
Corollary 5.2 states, simultaneously for every ,
The factor two is paid once for the whole chain. Applying a one-integration bound repeatedly would instead introduce , which is not the estimate used in the induction.
The Curvature Penalty
Degree Dependence of the Curvature Penalty
Hold fixed and change the known polynomial cutoff.
This is , a direct evaluation of the bound. The dimension stays two; counts polynomial degrees.
There is still a circular-looking issue: the polynomial estimates needed by this result are themselves unknown at high degree. Localization and reverse transfer turn that circle into an induction, using only smaller degrees to establish the next one.
Covariance-Normalized Stochastic Localization
Localization reweights a law by a linear tilt and a Gaussian factor. For our radial example, the tilted density is proportional to
The linear term moves the region carrying most of the mass; the quadratic term adds curvature. The paper proves its stochastic estimates first for bounded-support isotropic laws. For this example, it conditions on a large disk, rescales to restore isotropy, and then passes to the limit. The expandable calculation below describes that approximation.
For the bounded-support process, denotes expectation under the current random law, or posterior. Let , , and let be planar Brownian motion. The parameters obey
Consequently , and the posterior has curvature at least for . For a nonsmooth potential, this means that subtracting the corresponding quadratic leaves a convex function; it does not require a pointwise Hessian at the origin. The original radial symmetry generally disappears along a path, so neither nor can be replaced by a scalar multiple of the identity.
Gaussian Tilting and Appell Recentering
Explore the posterior density proportional to , with and . It remains symmetric under .
Gold: mean and covariance ellipse. The ellipse is not a probability contour. Density brightness uses a nonlinear scale for legibility.
With and , the centered mixed Appell polynomial is
Numerical illustration: moments use Simpson quadrature of the one-dimensional Gaussian scale-mixture formula (800 intervals in log scale). These controls select deterministic posterior parameters; they do not simulate an adapted stochastic localization path or verify a theorem.
Gaussian Scale Mixtures and Posterior Moments
The radial law is a Gaussian scale mixture: take with Gamma shape and rate , then . Multiplying the two densities leaves a constant times
To check the integral identity, put . For , substitute into ; this gives . Integrating in , with , gives . The normalized mixture therefore has exactly our radial density.
A deterministic tilt by changes the conditional Gaussian to
Completing its quadratic exponent shows that the updated scale density is proportional to
Normalize this density to . Then and . In the explorer and , so, writing and , the needed conditional moments are
Integrating these scalar expressions gives the displayed covariance and cumulants. The browser evaluates the integrals numerically; the identities above specify the exact quantities being approximated.
Compact-Support Approximation and Isotropic Normalization
The manuscript first proves its stochastic estimates for compactly supported isotropic laws. For this example, condition on and divide by , where
The resulting law is isotropic and has density proportional to on the disk of radius . It is log-concave because the potential and support are convex. As , ; dominated convergence gives every fixed moment of the original radial law. Appell coefficients at degree use only moments through , so the coefficient inequalities pass to this limit. The untruncated family shown in the explorer makes the same tilt geometry visible.
For the bounded-support process, the special drift in makes the normalized density a martingale:
For a fixed test function, this gives . In particular, the mean moves and the covariance fluctuates according to
The third moments vanish initially by symmetry, but generally become nonzero after tilting. The paper uses Letwin's quadratic variance inequality, stated in §2.3, to control them. That input leads to the mixed covariance bound needed later:
This is the mixed covariance estimate from §6.1. The expectation here is over the localization path; instead means integration under its current random law. The ordered tensor slots keep the matrix factors in their proper places without requiring them to commute.
Appell Polynomials Under Localization
Our original mixed quartic used and . After localization, those moments change. Keeping the same polynomial would break the mean-zero constraints required by the integration chain.
Keep the leading tensor fixed, but replace all lower coefficients with the Appell coefficients of the current law. Write . With covariance entries , third central moments , and
the moving mixed quartic is
At time zero, , the third moments are zero, and . This recovers .
Centering Constraints for the Moving Quartic
Taking the expectation of the displayed quartic gives
Its first derivatives are
They have zero mean because , and . Its Hessian is
whose mean is zero entry by entry. The nonzero third derivatives are and , with their permutations, so their means also vanish. The fourth derivative is the same constant tensor at all times. Commuting spatial derivatives retains compatibility throughout.
These identities preserve the integration constraints, but they do not say that the polynomial's variance is a martingale. Its coefficients are changing too. Lemma 6.2 estimates that additional effect.
Put and . If bounds degree coefficients of every isotropic log-concave law for , set
The moving variance estimate in Lemma 6.2 gives
The error uses only smaller degrees. For the quartic, . For degree two it is zero.
Reverse Coefficient Transfer
The integration bound requires covariance at most and curvature at least , where . First consider a smooth posterior whose Hessian also has a finite upper bound. Write for its covariance and for a positive curvature lower bound. One change of coordinates arranges both conditions:
Here is the posterior mean. Since , . Also implies , so the potential in the new coordinates has Hessian at least .
Let bound the norm of centered integrations uniformly over regular laws with these two properties. Set and . A degree- Appell polynomial can be recovered in these coordinates whenever :
The endpoint is excluded because is a nonzero constant, whereas requires a centered input. Returning to the original coordinates by the chain rule gives
The paper extends this polynomial inequality to nonsmooth posteriors by regular approximation, preserving the covariance and curvature bounds while the required moments converge. This is the step that permits its use for the tilted radial example.
For the moving quartic, two integrations recover it from the centered Hessian displayed above. This illustrates a permitted terminal estimate; the draft's actual induction chooses one derivative at small degrees, including degree four.
Differentiation lowers the polynomial degree. For , the degree- coefficient bound gives
There is no extra factorial cost: differentiation contributes , and the lower-degree norm contributes . Multiplication leaves . Apply this componentwise to the remaining symmetric polynomial slots and sum the squared component bounds.
At time , take , so . The mixed covariance estimate from §6.1 then bounds the path average:
Choose , , with . Insert this estimate into Lemma 6.2 and divide by . Since and for , the result is
This is Proposition 7.1. The star means a supremum over all dimensions and all centered log-concave laws with covariance at most . The supremum over laws is essential: the posteriors generated by our initially radial law need not be radial. Estimates for the initial radial density alone cannot supply the induction hypotheses.
Uniform Coefficient Induction
We now use bounds at smaller degrees to establish the same kind of bound at the next degree. The induction target has a fixed exponential growth rate:
The paper takes and proves in every degree. Here controls coefficient growth; it is unrelated to the support radius used in approximation. Covariance supplies the base case, . The polynomial factor supplies the slack that will close the induction.
Up to degree , one integration suffices, using the quadratic seed in Corollary 5.3. For larger degrees, use about half the derivatives, , and coefficient bounds only through . Lemma 5.1 then allows a scalar integration rate slightly below :
The smaller rate is possible because squaring the degree- coefficient bound produces the factor , of order . The curvature threshold costs only a factor of order . This leaves room in the power lemma’s strict hypothesis to choose . Its prefactor is paid once for the whole chain, so the small gain at each integration accumulates:
When this bound is inserted into reverse transfer, the powers of cancel. The remaining decay outweighs the localization cost and the bounded ratio of polynomial weights. A convolution estimate for those weights also controls the drift term, which involves only smaller degrees.
Parameter Choices and Induction Estimates
These are the choices in Appendix E; in both rows .
| Degree Range | Integrations and Inputs | Localization Parameter |
|---|---|---|
| ; quadratic seed (Corollary 5.3) | ||
| , |
The weight convolution has constant :
Taking the smaller-degree bounds to be gives
Degrees up to the cutoff. Here . Corollary 5.3 supplies
Also and . Substituting into reverse transfer gives
Degrees above the cutoff. Here . Put and apply Lemma 5.1 directly with . Its strict condition is
Indeed, and . The common prefactor satisfies
With the resulting , the principal term in reverse transfer, divided by , is at most
The normalized drift term is at most . The two terms sum to less than one, giving the induction step.
Theorem 8.1 is the result of this induction: coefficients at every degree share one fixed exponential growth bound. Localization has supplied curvature temporarily, while keeping the transfer error in degrees already controlled. The final step uses the availability of all degrees to remove the curvature dependence.
Curvature Removal and the Poincaré Bound
Fix a regular centered law with covariance at most and lower curvature . Theorem 8.1 gives the hypotheses of Corollary 5.2 at every cutoff , with . For one integration,
Here we write as shorthand for the squared norm of centered integration across all tensor ranks. In particular, it controls the recovery of a scalar function whose gradient has mean zero. Let while holding the law fixed. The curvature factor tends to one, giving . This is a limit in polynomial degree.
It remains to restore the linear part of a function. For centered , set , . Then , , and
Apply the triangle inequality, then Cauchy–Schwarz to the two terms:
For our radial example, the smooth law with potential has covariance , where . Divide its random vector by to make it isotropic. Its lower curvature becomes . Apply the preceding bound, first let , and only then let .
Stability Under Regular Approximation
The unnormalized densities satisfy and converge pointwise to it. The majorant and all of its polynomial multiples are integrable. Dominated convergence therefore gives convergence of normalization, covariance and every fixed moment. For smooth compactly supported , the variance and gradient integral under the covariance-normalized laws converge to their counterparts under . Passing to the limit preserves the same constant. The approximation argument of §9 and Appendix F then extends the inequality to locally Lipschitz functions with finite gradient energy, as in Theorem 1.1.
Resulting Poincaré Bound
Explicit Poincaré Bound for the Radial Family
This is the paper’s Appendix G value, , applied to our example. The paper seeks a bound uniform across laws and dimensions; it does not optimize this constant.
For the full radial family, scaling gives
The worked example exposes each role: compatibility allows integration; the Hodge estimate controls the cost of enforcing it; Appell polynomials record constant-input chains; the power lemma controls arbitrary chains; localization adds curvature; the moving coefficients preserve centering; reverse transfer closes the degree induction. Only after all degrees are available can the curvature dependence disappear.
Sharp Constant and Purpose of the Example
For this particular isotropic radial law, the optimal Poincaré constant is exactly
More generally, . This exact value comes from separating radial and angular modes, as detailed below. In the isotropic case, equality is attained by .
Why the Sharp Constant Is 3/2
The reciprocal of the Poincaré constant is the smallest nonzero spectral value of the weighted Laplacian. For an angular Fourier mode , its radial part acts in the space with weight as
The positive radial function satisfies . Integration by parts gives the ground-state identity
This proves the same lower bound for every mode with , since their angular term is larger. For the radial mode, let with weighted adjoint . Then and have the same nonzero spectrum. These identities use the closed energy operators; the integration-by-parts identity first holds away from the origin and extends by approximation. Thus every nonconstant mode has spectral value at least .
The function is centered, has finite variance and gradient energy, and attains this value. Consequently , which becomes when .
The purpose of this worked example is to illustrate the proof ideas and how the steps of the paper fit together. The general argument above provides a universal bound; the sharp constant uses additional structure specific to this radial family.