Part of the first version of Song–Zhang, Chapter Song–Zhang, first version: polynomial estimates and curvature; the reading order is on the full proofs page.
Overview. This reconstructs the polynomial estimate of Song–Zhang, Song & Zhang, 2026, Sections 3–4, with the quadratic estimate Theorem 25.1 as its nonclassical input. All tensor norms sum over ordered indices. The proof constructs the localization globally, keeps the covariance–mean cross variation, and closes a finite induction in the polynomial degree. It also records the analytic foundations needed by the subsequent inverse-operator argument. No eigenfunction or inverse operator is passed through an approximation limit. The source version is arXiv:2610.01447v1.
Appell expansion identifies the derivative means that polynomial testing controls.
Quadratic variance controls every whitened third-moment noise coefficient.
A coupled tensor hierarchy controls the mean and fluctuating derivative energies.
Matrix strong convexity at a short terminal time closes the degree induction.
Cutoff and moment approximation remove all auxiliary regularity assumptions.
Statement and Appell coordinates¶
Formal differentiation followed by expectation gives for and . These conditions characterize : the top derivative fixes its homogeneous part, and descending through the degrees fixes each remaining homogeneous part. Applying the same descending argument to an arbitrary polynomial gives the exact identity
Consequently a bound implies the derivative-mean estimate with coefficients . This uses the triangle inequality in , with no orthogonality assertion. It applies to a polynomial valued in any finite-dimensional Hilbert space as well: first sum the scalar bounds in an orthonormal output basis, then apply the triangle inequality in the direct sum. Thus no output dimension is lost.
The quadratic input and global localization¶
For an isotropic log-concave vector set and . For every symmetric , Theorem 25.1 and Cauchy–Schwarz give
Duality on symmetric matrices gives . Full symmetry of the third moment gives . Therefore
The last inequality follows from . No estimate on the full third-tensor norm independent of dimension is used.
Tensor hierarchy with all cross terms¶
Fix a polynomial of degree , and put
The tensor slots here concern input derivatives; any additional output slots are contracted with their ordinary Euclidean metric.
Closing the polynomial induction¶
Analytic foundations for the curvature comparison¶
The following two lemmas record the precise analytic claims of Lemma 7.1. They are included here so that applying polynomial testing to inverse operators does not leave an implicit domain assumption.
Source mapping. The formal Appell identity is source Section 2.3. The global SDE, its logarithmic determinant, and the tensor hierarchy reconstruct source Lemmas 4.2 and 4.3; the coefficient induction reconstructs Theorem 4.1. The two analytic lemmas reconstruct Section 3, separating moment convergence for polynomials from weak scalar Poincaré stability. Standard finite-dimensional SDE existence, Itô calculus, interior elliptic regularity, Rellich compactness and spectral calculus are the classical tools used here. The only nonclassical mathematical dependency is Theorem 25.1.
Fences respected. The new nodes have no proposed bounded_by edges. The
projection-only ceiling Remark 25.4 is respected by using all tensor
slots. The two-tail boundary Remark 25.3 is untouched: the conclusion
is an intrinsic polynomial estimate, not a bound on an unwhitened cut source.
The occupation and bootstrap boundaries Remark 33.6,
Remark 33.5, and Remark 32.6 are untouched; no
universal-time occupation or moving-competitor estimate is claimed. Growing
factorials prevent treating this polynomial theorem alone as a dimension-free
Poincaré inequality. No comparison between members of the trace-upgrade cluster is
asserted. There are no open antecedents or unclosed mathematical steps claimed in
this dossier; its independent examination is a separate task.
- Song, Z., & Zhang, X. (2026). An O(4\log^* n) Bound for the KLS Constant. https://arxiv.org/abs/2610.01447v1
- Brascamp, H. J., & Lieb, E. H. (1976). On Extensions of the Brunn–Minkowski and Prékopa–Leindler Theorems, Including Inequalities for Log Concave Functions, and with an Application to the Diffusion Equation. Journal of Functional Analysis, 22(4), 366–389. 10.1016/0022-1236(76)90004-5
- Bakry, D., Gentil, I., & Ledoux, M. (2014). Analysis and Geometry of Markov Diffusion Operators (Vol. 348). Springer. 10.1007/978-3-319-00227-9