What to retain. Balasubramanian and Kasiviswanathan (BK) bound every power of an integration operator on compatible symmetric tensor fields with one common prefactor, from finitely many polynomial observations. Localization transfers these bounds back to the next Appell coefficient, which closes an induction cd≤108d/(d+1)4 (Theorem 11.1); letting the number of observations tend to infinity gives CP≤1+2⋅1016 (Theorem 11.2).
This chapter works through the BK preprint Balasubramanian & Kasiviswanathan, 2026, arXiv v1 of 6 October 2026; the bibliography entry identifies the text read, and how the statements here were checked is explained on the welcome page. BK start, like the first version of Song–Zhang (SZ v1, Chapter Song–Zhang, first version: polynomial estimates and curvature), from the Appell normalization and Letwin’s quadratic variance bound. The exponential criterion Proposition 7.1 describes what they prove, but they obtain its coefficient hypothesis without any coefficient bound from the proofs of Bizeul–Klartag–Lehec (BKL) or of the second version of Song–Zhang (SZ v2), and reach the Poincaré constant through their integration estimate rather than through that criterion.
For the standard Gaussian on the line, centered integration sends x to (x2−1)/2, then to (x3−3x)/6, and in general Ad/d! to Ad+1/(d+1)!; the coefficients cd=1/d! are the norms of its successive powers applied to 1 (Section Balasubramanian–Kasiviswanathan: compatible integration).
For a general measure there are three separate difficulties. Weighted divergence need not preserve the tensor fields that can be integrated; the Hodge estimate controls the projection needed to restore this property. A bound for one integration repeated naively pays its loss at every step; the operator estimate instead retains one common factor for every power. Finally, polynomial norms change with the measure; covariance-normalized localization transfers the curved integration estimate back to the original law. The induction closes only if all three estimates have compatible constants. These are the successive parts of this chapter.
The coefficient convention agrees exactly with that of SZ v1. The supremum over covariance at most identity is useful because localization and subsequent linear changes of variables need not produce an isotropic law at every intermediate step.
The analytic construction starts with a smooth potential bounded above and below in Hessian. Approximation is needed both to enter this class and to return to nonsmooth log-concave laws. The following approximation result keeps covariance, curvature and fixed-degree polynomial norms together.
A vector field can be integrated to a scalar only if it is curl-free. At higher rank, the corresponding condition says that differentiating in any new slot produces a fully symmetric tensor. Subtracting a constant preserves this condition, so a centered primitive can be chosen at each stage. The derivative itself is left uncentered: its constant part carries the polynomial information that must not be discarded.
Take F=D2ψ on R2, with ψ smooth and compactly supported, and let Yi=∑j(−∂j+∂jV)Fij be its weighted divergence. At a point where D2V is diagonal with eigenvalues κ1,κ2, direct differentiation gives
Thus even a Hessian can acquire curl under weighted divergence. The Hodge projection estimate of the preprint bounds the squared norm of the discarded part by
The factor 2F122 is exactly the ordered-index norm of the mixed symmetric component. Its remaining weight is the harmonic mean, at least a when both curvatures are at least a. Equal curvatures produce no projection loss. The higher-rank estimate below retains this same lower bound without deterioration as more tensor slots are added.
The proof begins with weighted integration by parts, then subtracts the energy lost by projecting divergence onto compatible fields. The preceding harmonic-mean calculation illustrates the curvature left after subtraction. At general rank, symmetry must prevent a loss growing with the number of indices. Extending the estimate from compactly supported potentials to the adjoint domain is part of the assertion, not a formal consequence of the calculation on smooth fields. The inverse derivative then provides the integration operators used below.
The decomposition into constant and centered tensors separates the inverse derivative into L and J. Constants produce linear functions through L; repeated application of J produces normalized Appell polynomials. This is the abstract version of the Gaussian calculation above.
The identity for Hr−1 comes from this orthogonal decomposition. The Hodge lower bound, followed by inversion of positive operators, gives the inequality with ga. The Appell identity follows by differentiating their generating series and selecting the mean-zero primitive at every step. The remaining issue is operator theoretic: estimates on the special inputs Jj−1L must control Jk on arbitrary compatible fields.
The following operator lemma isolates that issue on any Hilbert space. Its crucial feature is that QD(B) does not depend on the power k.
The preprint uses the concavity and monotonicity of g(u)=u/(1+au) to compare successive operator powers. The observed terms Rj−1L control the boundary contributions, while the strict inequality aBD+1>γD2 absorbs the last one. Retaining the finite sum QD(B) avoids multiplying a separate prefactor for every integration. At D=2 the sum is empty and the prefactor is exactly one; this is also what makes a degree-two estimate sufficient to start the argument.
Substituting the coefficient majorant in QD gives a convergent sum bounded by two. This yields all powers with one factor two, rather than a factor 2q. The seed below uses only Letwin’s quadratic variance estimate Theorem 25.1: it gives c2≤2, hence ∥JL∥≤2. The D=2 operator estimate then gives the stated bound by taking B down to (2/a)1/3. No higher-degree coefficient estimate is needed to start.
Localization introduces curvature, but the polynomial and its law both move. BK use noise normalized by the inverse covariance. Letwin’s quadratic estimate controls the third moments in the covariance equation; tensor covariance bounds keep that control when several derivatives are contracted together. These estimates hold on the full ordered tensor spaces, so their use does not hide a dimension-dependent trace.
The covariance proof first stops the process where the covariance and its inverse are bounded, derives the tensor inequalities there, and then removes the stopping. The mixed-time bound is needed because the accumulated curvature integrates inverse covariances over earlier times. The estimate with Λt−1 is what allows that curvature to enter the later change of coordinates. Global existence and true martingales are included explicitly to justify the expectation identities.
The next assertion follows the polynomial adapted to the current law. Its lower-degree errors involve a convolution of previously bounded Appell coefficients. This is the induction’s error term.
Differentiating the normalized Appell generating function along the localization produces the evolution of its variance. Taking a square root allows the error terms to be bounded by products of lower-degree norms. Integrating the resulting differential inequality compares the original polynomial norm with its later norm. The latter is estimated by integrating q times from degree d−q under the now curved law.
The transfer uses time t=η/d2. Its curvature parameter δ=η2/d2 and the covariance tensor bound together account for the factor (1+η)q/2. The principal term contains an actual chain of q integration operators; replacing its norm by a product of separate one-step estimates would lose the common-factor advantage. The second term uses only degrees below d, so the estimate can close an induction.
Closing the induction and extracting the constant¶
The preprint chooses the summable majorant βd=R∗d/(d+1)4. Its convolution has enough decay to absorb the moving-polynomial error. A finite initial range is supplied by the quadratic seed; for larger degrees the integration length is q=⌊d/2⌋, of order d, and the observation degree is D=⌊d⌋, of order d. Both are below d. The strict margin in the operator bound leaves room for the transfer factors. The explicit choices in Appendix E of the preprint lead to the following value.
To extract a spectral gap, fix one regular law and its positive lower curvature a. Let the observation degree D tend to infinity in Corollary 11.1, with ρ=R∗. Then a−1/(D+1)→1, and the one-step estimate gives CP≤1+2R∗2. Only after this degree limit is taken does approximation pass the common scalar inequality to arbitrary log-concave laws. This order avoids requiring a common positive curvature for all laws.
The extension to a proper affine support is made within that support. For nonsmooth laws, the approximation statement must transfer the inequality to finite-energy locally Lipschitz functions as well as smooth tests; square integrability is part of the conclusion. The Cheeger consequence then uses the normalization already fixed in the introduction, with the factor π coming from its reverse comparison.
The new mechanism of BK is the combination of a rank-independent Hodge estimate, a common bound for every integration power, and reverse transfer. It is compared with BKL and SZ v2 in Chapter The proofs of KLS compared.
Balasubramanian, K., & Kasiviswanathan, S. (2026). A Dimension-Free Bound on the Poincaré Constant of Isotropic Log-Concave Measures. https://arxiv.org/abs/2610.07728v1