Skip to article frontmatterSkip to article content
Site not loading correctly?

This may be due to an incorrect BASE_URL configuration. See the MyST Documentation for reference.

BK: covariance-normalized localization and moving Appell variance

Part of the Balasubramanian–Kasiviswanathan proof, Chapter Balasubramanian–Kasiviswanathan: compatible integration; the reading order is on the full proofs page.

Overview. We reconstruct Sections 6 and Appendix D of Balasubramanian & Kasiviswanathan, 2026 at commit 4837c33649ba2271f43c9684e9350ecbdd725f95. Quadratic variance bounds control third moments, prevent finite-time explosion, and control ordered products of covariance matrices. A finite formal-series calculation then compares the Appell variance before and after localization.

Dependencies. The only inequality input is Theorem 25.1. The Appell normalization Definition 11.1 is stated explicitly below. Standard finite-dimensional Itô calculus and local existence for smooth SDE coefficients are used. No KLS, BKL, SZ v2, or all-degree coefficient estimate is an input.

For any law with all moments define Pdμ[T]=⟨T,Adμ⟩P_d^\mu[T]=\langle T,\mathcal A_d^\mu\rangle by the formal identity

ez⋅xEμez⋅X=∑d≥0⟨Adμ(x),z⊗d⟩d!,cd(μ)=1d!sup⁡∥T∥=1∥Pdμ[T]∥2.\frac{e^{z\cdot x}}{E_\mu e^{z\cdot X}} =\sum_{d\ge0}\frac{\langle\mathcal A_d^\mu(x),z^{\otimes d}\rangle}{d!}, \qquad c_d(\mu)=\frac1{d!}\sup_{\|T\|=1}\|P_d^\mu[T]\|_2.

All tensors use the ordered-index Hilbert--Schmidt norm. In particular, DvPd[T]=dPd−1[T(v,⋅)]D_vP_d[T]=dP_{d-1}[T(v,\cdot)], and all expected derivatives of order less than dd vanish. If X=m+BYX=m+BY, coefficient comparison gives PdL(X)[T](m+By)=PdL(Y)[(BT)⊗dT](y)P_d^{\mathcal L(X)}[T](m+By)=P_d^{\mathcal L(Y)}[(B^T)^{\otimes d}T](y).

Fences respected. These new nodes have no assigned bounded_by edges. The brief’s projection ceiling is avoided by a full tensor estimate, not projection estimates. No adaptive cut, scalar covariance ceiling, uniform all-degree bound, sharp gate-zero claim, or open antecedent is used. Compact support is used only here; its later removal belongs to reverse transfer.

Reviewer handoff. Check the two-slot Loewner inequality on the full tensor space, the log-determinant continuation argument, mixed-time conditioning, the k=dk=d Bessel endpoint, and the moment-polynomial justification of expectation. The lower-degree bounds in the second theorem are quantified antecedents, not asserted uniform coefficient theorems. The covariance and moving-variance statements use the inputs specified above; their certifications are recorded separately.

References
  1. Balasubramanian, K., & Kasiviswanathan, S. (2026). A Dimension-Free Bound on the Poincaré Constant of Isotropic Log-Concave Measures. https://arxiv.org/abs/2610.07728v1