Song–Zhang v1: polynomial coefficients control the spectral gap
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 Section 5 of the version-pinned
Song & Zhang, 2026 . The argument starts from a first eigenfunction,
iterates a normalized inverse square root followed by differentiation, and bounds
the mass removed by centering. A combinatorial recovery inequality converts
polynomial testing into a bound on this loss. A convolution estimate absorbs all
normalization defects, uniformly in the number of generations and the terminal
polynomial degree. The only quantitative input beyond the profile in the statement
is the universal coefficient estimate Theorem 7.1 .
Let 0 < ε ≤ 1 0<\varepsilon\le1 0 < ε ≤ 1 , let ℓ : N → [ 1 , ∞ ) \ell:\mathbb N\to[1,\infty) ℓ : N → [ 1 , ∞ ) be nondecreasing,
and let R ≥ 2 40 ε − 2 R\ge2^{40}\varepsilon^{-2} R ≥ 2 40 ε − 2 . Let ν = e − W d x \nu=e^{-W}dx ν = e − W d x be centered, with
W W W smooth, a I ⪯ D 2 W ⪯ b 0 I aI\preceq D^2W\preceq b_0I a I ⪯ D 2 W ⪯ b 0 I for finite b 0 ≥ a > 0 b_0\ge a>0 b 0 ≥ a > 0 , and
Cov ( ν ) ⪯ I \operatorname{Cov}(\nu)\preceq I Cov ( ν ) ⪯ I . For the Appell polynomial determined by
D k P k [ T ] = k ! T D^kP_k[T]=k!T D k P k [ T ] = k ! T and E D j P k [ T ] = 0 \mathbb E D^jP_k[T]=0 E D j P k [ T ] = 0 for 0 ≤ j < k 0\le j<k 0 ≤ j < k , set
K k = sup ∥ T ∥ H S = 1 E P k [ T ] 2 K_k=\sup_{\|T\|_{\rm HS}=1}\mathbb E P_k[T]^2 K k = sup ∥ T ∥ HS = 1 E P k [ T ] 2 and c k = K k / k ! c_k=\sqrt{K_k}/k! c k = K k / k ! .
Suppose c k ≤ R k ℓ ( k ) k / ( k + 1 ) 2 c_k\le R^k\ell(k)^k/(k+1)^2 c k ≤ R k ℓ ( k ) k / ( k + 1 ) 2 for every k ≥ 1 k\ge1 k ≥ 1 .
Then every dyadic integer d ≥ 2 d\ge2 d ≥ 2 satisfies
C P ( ν ) ≤ 16 ( 1 + ε ) R 2 ℓ ( d ) 2 max { 1 , a − 1 / ( d + 1 ) } . C_P(\nu)\le16(1+\varepsilon)R^2\ell(d)^2
\max\{1,a^{-1/(d+1)}\}. C P ( ν ) ≤ 16 ( 1 + ε ) R 2 ℓ ( d ) 2 max { 1 , a − 1/ ( d + 1 ) } . This is the assertion Theorem 7.2 .
Analytic setup and normalized families ¶ The analytic preparation Lemma 7.1 , proved in
Lemma 120.3 , establishes the following facts for the present regular measure. The operator
H = − Δ + ∇ W ⋅ ∇ H=-\Delta+\nabla W\cdot\nabla H = − Δ + ∇ W ⋅ ∇ is the self-adjoint operator associated with
the closed gradient form, its kernel is the constants, and its first positive
eigenvalue λ = C P ( ν ) − 1 \lambda=C_P(\nu)^{-1} λ = C P ( ν ) − 1 is attained. Its form domain is the weighted
Sobolev space. On its operator domain,
∥ H g ∥ 2 2 = E ∥ D 2 g ∥ H S 2 + E ⟨ D 2 W ∇ g , ∇ g ⟩ . \|Hg\|_2^2=\mathbb E\|D^2g\|_{\rm HS}^2+
\mathbb E\langle D^2W\nabla g,\nabla g\rangle. ∥ H g ∥ 2 2 = E ∥ D 2 g ∥ HS 2 + E ⟨ D 2 W ∇ g , ∇ g ⟩ . In particular all second weak derivatives exist in L 2 L^2 L 2 and commute. Inverse
powers act on centered functions. For centered form-domain h h h ,
H − 1 / 2 h ∈ Dom ( H ) H^{-1/2}h\in\operatorname{Dom}(H) H − 1/2 h ∈ Dom ( H ) ,
∥ H H − 1 / 2 h ∥ 2 2 = ∥ H 1 / 2 h ∥ 2 2 \|H H^{-1/2}h\|_2^2=\|H^{1/2}h\|_2^2 ∥ H H − 1/2 h ∥ 2 2 = ∥ H 1/2 h ∥ 2 2 , and
∥ ∇ H − 1 / 2 h ∥ 2 2 = ∥ h ∥ 2 2 \|\nabla H^{-1/2}h\|_2^2=\|h\|_2^2 ∥∇ H − 1/2 h ∥ 2 2 = ∥ h ∥ 2 2 .
Polynomial tests belong to the form domain. These facts apply componentwise to
finite families, with summed squared norms.
Put P + h = h − E h P_+h=h-\mathbb Eh P + h = h − E h , D = P + ∇ H − 1 / 2 D=P_+\nabla H^{-1/2} D = P + ∇ H − 1/2 , and L h = E [ X h ] Lh=\mathbb E[Xh] L h = E [ X h ] .
Both D D D and L L L are contractions: for L L L use
E ( z ⋅ X ) 2 ≤ ∣ z ∣ 2 \mathbb E(z\cdot X)^2\le|z|^2 E ( z ⋅ X ) 2 ≤ ∣ z ∣ 2 and duality. Testing the form against x i x_i x i
gives E ∇ H − 1 / 2 h = L H 1 / 2 h \mathbb E\nabla H^{-1/2}h=LH^{1/2}h E ∇ H − 1/2 h = L H 1/2 h .
For a nonzero centered form-domain family u u u , define
v = ∥ u ∥ 2 2 , b = ∥ H − 1 / 2 u ∥ 2 2 , β = v / b , h = β H − 1 / 2 u , χ = ∥ H 1 / 2 u ∥ 2 2 − β v . v=\|u\|_2^2,\quad b=\|H^{-1/2}u\|_2^2,\quad
\beta=v/b,\quad h=\sqrt\beta H^{-1/2}u,\quad
\chi=\|H^{1/2}u\|_2^2-\beta v. v = ∥ u ∥ 2 2 , b = ∥ H − 1/2 u ∥ 2 2 , β = v / b , h = β H − 1/2 u , χ = ∥ H 1/2 u ∥ 2 2 − β v . The scalar β \beta β belongs to the entire family, not individual components.
Cauchy--Schwarz gives v 2 ≤ b ∥ H 1 / 2 u ∥ 2 2 v^2\le b\|H^{1/2}u\|_2^2 v 2 ≤ b ∥ H 1/2 u ∥ 2 2 , whence
λ ≤ β ≤ ∥ H 1 / 2 u ∥ 2 2 / v \lambda\le\beta\le\|H^{1/2}u\|_2^2/v λ ≤ β ≤ ∥ H 1/2 u ∥ 2 2 / v and χ ≥ 0 \chi\ge0 χ ≥ 0 .
Furthermore
∥ h ∥ 2 2 = v , H 1 / 2 h = β u , z : = H − 1 / 2 h − β − 1 / 2 u \|h\|_2^2=v,\qquad H^{1/2}h=\sqrt\beta u,
\qquad
z:=H^{-1/2}h-\beta^{-1/2}u ∥ h ∥ 2 2 = v , H 1/2 h = β u , z := H − 1/2 h − β − 1/2 u satisfies the exact identity
∥ ∇ z ∥ 2 2 = β b − 2 v + β − 1 ∥ H 1 / 2 u ∥ 2 2 = χ / β . \|\nabla z\|_2^2
=\beta b-2v+\beta^{-1}\|H^{1/2}u\|_2^2=\chi/\beta. ∥∇ z ∥ 2 2 = β b − 2 v + β − 1 ∥ H 1/2 u ∥ 2 2 = χ / β . This uses spectral calculus and the form identity; it does not commute a
spatial derivative with an inverse spectral power.
Start with a centered unit first eigenfunction F 0 F_0 F 0 . Set u j = D F j u^j=DF_j u j = D F j and
normalize u j u^j u j as above to obtain F j + 1 F_{j+1} F j + 1 , normalizer β j + 1 \beta_{j+1} β j + 1 ,
and defect χ j \chi_j χ j . Write
v j = ∥ F j ∥ 2 2 , e j = ∥ H 1 / 2 F j ∥ 2 2 , p j = ∥ L H 1 / 2 F j ∥ 2 , E j = e j − λ v j . v_j=\|F_j\|_2^2,\quad e_j=\|H^{1/2}F_j\|_2^2,\quad
p_j=\|LH^{1/2}F_j\|^2,\quad E_j=e_j-\lambda v_j. v j = ∥ F j ∥ 2 2 , e j = ∥ H 1/2 F j ∥ 2 2 , p j = ∥ L H 1/2 F j ∥ 2 , E j = e j − λ v j . The gradient before centering has norm squared v j v_j v j and mean norm squared
p j p_j p j . Bochner applied to H − 1 / 2 F j H^{-1/2}F_j H − 1/2 F j bounds its derivative energy by
e j − a v j e_j-av_j e j − a v j . Normalization removes exactly χ j \chi_j χ j . Thus
v j + 1 = v j − p j , e j + 1 ≤ e j − a v j − χ j , 0 ≤ E j + 1 ≤ E j + λ p j − a v j − χ j . (1) v_{j+1}=v_j-p_j,\qquad e_{j+1}\le e_j-av_j-\chi_j,
\qquad 0\le E_{j+1}\le E_j+\lambda p_j-av_j-\chi_j. \tag{1} v j + 1 = v j − p j , e j + 1 ≤ e j − a v j − χ j , 0 ≤ E j + 1 ≤ E j + λ p j − a v j − χ j . ( 1 ) In particular v j ≤ 1 v_j\le1 v j ≤ 1 , e j ≤ λ e_j\le\lambda e j ≤ λ , and p j ≤ min ( v j , e j ) ≤ λ p_j\le\min(v_j,e_j)\le\lambda p j ≤ min ( v j , e j ) ≤ λ .
At the first step, even if u 0 = 0 u^0=0 u 0 = 0 ,
λ ( 1 − p 0 ) ≤ ∥ H 1 / 2 u 0 ∥ 2 2 ≤ λ − a \lambda(1-p_0)\le\|H^{1/2}u^0\|_2^2\le\lambda-a λ ( 1 − p 0 ) ≤ ∥ H 1/2 u 0 ∥ 2 2 ≤ λ − a , so
a ≤ λ p 0 ≤ λ 2 a\le\lambda p_0\le\lambda^2 a ≤ λ p 0 ≤ λ 2 . The same inequalities hold with zero
successors after a vanishing family, but normalizers will only be used on the
nonvanishing stopped prefix constructed below. Each u j u^j u j is in the form domain
by Bochner; hence every operation on that prefix has the required domain.
Recovering a partially symmetric tensor ¶ Let S ∈ Sym s ( R n ) ⊗ Sym l ( R n ) S\in\operatorname{Sym}^s(\mathbb R^n)\otimes
\operatorname{Sym}^l(\mathbb R^n) S ∈ Sym s ( R n ) ⊗ Sym l ( R n ) , where s ≤ q ≤ l s\le q\le l s ≤ q ≤ l , and let P q \mathsf P_q P q
average permutations of the first q q q slots. Then
∥ P q S ∥ 2 ≥ ( q s ) − 1 ( s + l − q ) s ‾ l s ‾ ∥ S ∥ 2 . \|\mathsf P_qS\|^2\ge
\binom qs^{-1}\frac{(s+l-q)_{\underline s}}{l_{\underline s}}\|S\|^2. ∥ P q S ∥ 2 ≥ ( s q ) − 1 l s ( s + l − q ) s ∥ S ∥ 2 . If T T T is symmetric in its first s s s slots, S S S is its symmetrization in the
last l l l slots, and c c c is the reciprocal square root of the displayed
coefficient, then
∥ T ∥ ≤ c ∥ P q T ∥ + ( c + 1 ) ∥ T − S ∥ \|T\|\le c\|\mathsf P_qT\|+(c+1)\|T-S\| ∥ T ∥ ≤ c ∥ P q T ∥ + ( c + 1 ) ∥ T − S ∥ .
Finite direct sums over other slots are permitted.
Put N = s + l N=s+l N = s + l and let M k \mathcal M_k M k be the Euclidean space of functions on
k k k -subsets of { 1 , … , N } \{1,\ldots,N\} { 1 , … , N } . Let U k U_k U k sum over contained k k k -subsets,
and D k + 1 = U k ∗ D_{k+1}=U_k^* D k + 1 = U k ∗ . Counting the diagonal and off-diagonal entries gives
D k + 1 U k − U k − 1 D k = ( N − 2 k ) I D_{k+1}U_k-U_{k-1}D_k=(N-2k)I D k + 1 U k − U k − 1 D k = ( N − 2 k ) I . If D j v = 0 D_jv=0 D j v = 0 , induction gives
D U r v = r ( N − 2 j − r + 1 ) U r − 1 v , ∥ U r v ∥ 2 = r ! ( N − 2 j ) ! ( N − 2 j − r ) ! ∥ v ∥ 2 . DU^rv=r(N-2j-r+1)U^{r-1}v,
\qquad \|U^rv\|^2=r!\frac{(N-2j)!}{(N-2j-r)!}\|v\|^2. D U r v = r ( N − 2 j − r + 1 ) U r − 1 v , ∥ U r v ∥ 2 = r ! ( N − 2 j − r )! ( N − 2 j )! ∥ v ∥ 2 . For k < N / 2 k<N/2 k < N /2 , the commutator makes U k U_k U k injective and D k + 1 D_{k+1} D k + 1 surjective.
Since s ≤ N / 2 s\le N/2 s ≤ N /2 , successive orthogonal decompositions into ker D k \ker D_k ker D k and
ran U k − 1 \operatorname{ran}U_{k-1} ran U k − 1 give
M s = ⨁ j = 0 s U s − j ker D j \mathcal M_s=\bigoplus_{j=0}^s U^{s-j}\ker D_j M s = ⨁ j = 0 s U s − j ker D j .
The summands are orthogonal by repeatedly moving a lowering operator to the
other factor. The incidence map I q , s = U q − s / ( q − s ) ! I_{q,s}=U^{q-s}/(q-s)! I q , s = U q − s / ( q − s )! therefore has squared
singular values
( q − j s − j ) ( N − s − j q − s ) , 0 ≤ j ≤ s . \binom{q-j}{s-j}\binom{N-s-j}{q-s},\qquad 0\le j\le s. ( s − j q − j ) ( q − s N − s − j ) , 0 ≤ j ≤ s . Their successive ratios are
s − j q − j N − q − j N − s − j ≤ 1 \frac{s-j}{q-j}\frac{N-q-j}{N-s-j}\le1 q − j s − j N − s − j N − q − j ≤ 1 (the trivial case q = s q=s q = s gives
identity). Consequently
I q , s ∗ I q , s ⪰ ( N − 2 s q − s ) I I_{q,s}^*I_{q,s}\succeq\binom{N-2s}{q-s}I I q , s ∗ I q , s ⪰ ( q − s N − 2 s ) I .
For each s s s -subset A A A , move the first symmetric block of S S S to A A A , giving
S A S_A S A independently of internal orderings. For each q q q -subset B B B ,
∑ A ⊂ B S A \sum_{A\subset B}S_A ∑ A ⊂ B S A is ( q s ) \binom qs ( s q ) times an orthogonal permutation of
P q S \mathsf P_qS P q S . Apply the incidence bound to this tensor-valued list:
( N q ) ( q s ) 2 ∥ P q S ∥ 2 ≥ ( N − 2 s q − s ) ( N s ) ∥ S ∥ 2 . \binom Nq\binom qs^2\|\mathsf P_qS\|^2
\ge\binom{N-2s}{q-s}\binom Ns\|S\|^2. ( q N ) ( s q ) 2 ∥ P q S ∥ 2 ≥ ( q − s N − 2 s ) ( s N ) ∥ S ∥ 2 . Cancellation of factorials proves the claim. The robust version follows from
∥ T ∥ ≤ ∥ S ∥ + ∥ T − S ∥ \|T\|\le\|S\|+\|T-S\| ∥ T ∥ ≤ ∥ S ∥ + ∥ T − S ∥ and the contraction of P q \mathsf P_q P q .
We will also use, for an l l l -slot array Y Y Y and its adjacent transpositions s i s_i s i ,
∥ Y − Sym l Y ∥ ≤ l ∑ i = 1 l − 1 ∥ Y − s i Y ∥ . (2) \|Y-\operatorname{Sym}_lY\|\le l\sum_{i=1}^{l-1}\|Y-s_iY\|. \tag{2} ∥ Y − Sym l Y ∥ ≤ l i = 1 ∑ l − 1 ∥ Y − s i Y ∥. ( 2 ) Indeed insertion sort writes each permutation with each generator at most l l l
times. For a product of isometries, telescope I − U 1 ⋯ U m I-U_1\cdots U_m I − U 1 ⋯ U m as
∑ i = 1 m U 1 ⋯ U i − 1 ( I − U i ) \sum_{i=1}^mU_1\cdots U_{i-1}(I-U_i) ∑ i = 1 m U 1 ⋯ U i − 1 ( I − U i ) ; all differences are thereby applied to
the original array. Averaging the resulting bounds proves (2).
Polynomial tests, adjacent swaps, and the dyadic loss ¶ Let A k \mathcal A_k A k be the tensor-valued Appell polynomial, so
P k [ T ] = ⟨ A k , T ⟩ P_k[T]=\langle\mathcal A_k,T\rangle P k [ T ] = ⟨ A k , T ⟩ , and put Q k h = E [ A k h ] Q_kh=\mathbb E[\mathcal A_kh] Q k h = E [ A k h ] .
Duality gives ∥ Q k ∥ ≤ K k \|Q_k\|\le\sqrt{K_k} ∥ Q k ∥ ≤ K k . If P k + 1 \mathsf P_{k+1} P k + 1 symmetrizes the
k k k polynomial indices and the newest derivative index, then for j ≥ 1 j\ge1 j ≥ 1
( k + 1 ) P k + 1 Q k D F j = Q k + 1 H 1 / 2 F j = β j Q k + 1 u j − 1 . (3) (k+1)\mathsf P_{k+1}Q_kDF_j
=Q_{k+1}H^{1/2}F_j
=\sqrt{\beta_j}Q_{k+1}u^{j-1}. \tag{3} ( k + 1 ) P k + 1 Q k D F j = Q k + 1 H 1/2 F j = β j Q k + 1 u j − 1 . ( 3 ) To check this, pair against an arbitrary symmetric ( k + 1 ) (k+1) ( k + 1 ) -tensor, use
∇ P k + 1 = ( k + 1 ) P k \nabla P_{k+1}=(k+1)P_k ∇ P k + 1 = ( k + 1 ) P k with one free index, and test the form against
H − 1 / 2 F j H^{-1/2}F_j H − 1/2 F j . Centering contributes zero because E A k = 0 \mathbb E\mathcal A_k=0 E A k = 0 .
Suppose the normalizers in question satisfy β j ≤ b λ \beta_j\le b\lambda β j ≤ bλ , b ≥ 1 b\ge1 b ≥ 1 .
The normalization defect gives
u j + 1 = β j + 1 − 1 / 2 P + ∇ u j + P + ∇ z j , ∥ ∇ z j ∥ 2 2 = χ j / β j + 1 . u^{j+1}=\beta_{j+1}^{-1/2}P_+\nabla u^j+P_+\nabla z^j,
\qquad \|\nabla z^j\|_2^2=\chi_j/\beta_{j+1}. u j + 1 = β j + 1 − 1/2 P + ∇ u j + P + ∇ z j , ∥∇ z j ∥ 2 2 = χ j / β j + 1 . The first term is symmetric in its newest two indices: u j u^j u j is a centered
gradient and taking another weak derivative gives a Hessian. Thus the newest
swap has defect at most 2 χ j / λ 2\sqrt{\chi_j/\lambda} 2 χ j / λ . Each subsequent map
D β H − 1 / 2 D\sqrt{\beta}H^{-1/2} D β H − 1/2 has norm at most b \sqrt b b and commutes with
permutations of old indices. Its scalar is kept fixed at the value for the
original entire family, even when the map is applied to a difference.
Numbering derivative slots newest first, the swap of slots a , a + 1 a,a+1 a , a + 1 in u J u^J u J
was created at u J − a + 1 u^{J-a+1} u J − a + 1 and underwent exactly a − 1 a-1 a − 1 subsequent maps. Hence
∥ u J − s a u J ∥ 2 ≤ 2 b ( a − 1 ) / 2 χ J − a / λ . (4) \|u^J-s_au^J\|_2\le2b^{(a-1)/2}\sqrt{\chi_{J-a}/\lambda}. \tag{4} ∥ u J − s a u J ∥ 2 ≤ 2 b ( a − 1 ) /2 χ J − a / λ . ( 4 ) No old defect has been differentiated.
Fix an integer L ≥ 3 L\ge3 L ≥ 3 and put
B = 2 L / ( L − 2 ) , A = b B 2 , J = B 4 b L + 1 , m d = ( L + 1 ) d / 2 − 1. B=2\sqrt{L/(L-2)},\qquad A=bB^2,\qquad J=B^4b^{L+1},\qquad
m_d=(L+1)d/2-1. B = 2 L / ( L − 2 ) , A = b B 2 , J = B 4 b L + 1 , m d = ( L + 1 ) d /2 − 1. For j ≥ m d j\ge m_d j ≥ m d and dyadic d ≥ 2 d\ge2 d ≥ 2 , we claim
p j ≤ ( A λ ) d / 2 c d + ∑ k < d k dyadic t k ∑ a = 1 L k − 1 χ j − k − a , t k = 4 L k B J k / 2 c k λ ( k − 1 ) / 2 . (5) \sqrt{p_j}\le(A\lambda)^{d/2}c_d+
\sum_{\substack{k<d\\k\text{ dyadic}}}t_k
\sum_{a=1}^{Lk-1}\sqrt{\chi_{j-k-a}},
\quad
t_k=\frac{4Lk}{B}J^{k/2}c_k\lambda^{(k-1)/2}. \tag{5} p j ≤ ( A λ ) d /2 c d + k < d k dyadic ∑ t k a = 1 ∑ L k − 1 χ j − k − a , t k = B 4 L k J k /2 c k λ ( k − 1 ) /2 . ( 5 ) Here and below dyadic indices start at one. To prove (5), set
T k = Q k u j − k T_k=Q_ku^{j-k} T k = Q k u j − k at successive dyadic degrees. There are k k k symmetric
polynomial slots and j − k + 1 ≥ L k j-k+1\ge Lk j − k + 1 ≥ L k derivative slots for k < d k<d k < d .
Symmetrize the newest L k Lk L k derivative slots to obtain S k S_k S k . The block lemma
with ( s , l , q ) = ( k , L k , 2 k ) (s,l,q)=(k,Lk,2k) ( s , l , q ) = ( k , L k , 2 k ) has recovery constant
C k 2 = ( 2 k k ) ( L k ) k ‾ ( ( L − 1 ) k ) k ‾ ≤ 4 k ( L / ( L − 2 ) ) k = B 2 k . C_k^2=\binom{2k}k\frac{(Lk)_{\underline k}}{((L-1)k)_{\underline k}}
\le4^k(L/(L-2))^k=B^{2k}. C k 2 = ( k 2 k ) (( L − 1 ) k ) k ( L k ) k ≤ 4 k ( L / ( L − 2 ) ) k = B 2 k . Every denominator factor exceeds ( L − 2 ) k (L-2)k ( L − 2 ) k , which proves this bound.
Repeated application of (3), whose inner projections are absorbed by the outer
symmetrization, yields
∥ P 2 k T k ∥ ≤ ( b λ ) k / 2 k ! ( 2 k ) ! ∥ T 2 k ∥ . \|\mathsf P_{2k}T_k\|\le(b\lambda)^{k/2}\frac{k!}{(2k)!}\|T_{2k}\|. ∥ P 2 k T k ∥ ≤ ( bλ ) k /2 ( 2 k )! k ! ∥ T 2 k ∥. Equations (2), (4) and ∥ Q k ∥ ≤ K k \|Q_k\|\le\sqrt{K_k} ∥ Q k ∥ ≤ K k give
E k : = ∥ T k − S k ∥ ≤ 2 L k b L k / 2 K k / λ ∑ a = 1 L k − 1 χ j − k − a . E_k:=\|T_k-S_k\|
\le2Lk b^{Lk/2}\sqrt{K_k/\lambda}
\sum_{a=1}^{Lk-1}\sqrt{\chi_{j-k-a}}. E k := ∥ T k − S k ∥ ≤ 2 L k b L k /2 K k / λ a = 1 ∑ L k − 1 χ j − k − a . Thus
∥ T k ∥ ≤ B k ( b λ ) k / 2 k ! / ( 2 k ) ! ∥ T 2 k ∥ + 2 B k E k \|T_k\|\le B^k(b\lambda)^{k/2}k!/(2k)!\,\|T_{2k}\|+2B^kE_k ∥ T k ∥ ≤ B k ( bλ ) k /2 k ! / ( 2 k )! ∥ T 2 k ∥ + 2 B k E k .
The initial factor is p j = β j ∥ T 1 ∥ \sqrt{p_j}=\sqrt{\beta_j}\|T_1\| p j = β j ∥ T 1 ∥ .
The preceding dyadic degrees sum to k − 1 k-1 k − 1 , and the factorials telescope, so
the coefficient before stage k k k is at most
( b λ ) k / 2 B k − 1 / k ! . (b\lambda)^{k/2}B^{k-1}/k!. ( bλ ) k /2 B k − 1 / k ! . At the terminal stage ∥ T d ∥ ≤ K d \|T_d\|\le\sqrt{K_d} ∥ T d ∥ ≤ K d because ∥ u j − d ∥ 2 ≤ 1 \|u^{j-d}\|_2\le1 ∥ u j − d ∥ 2 ≤ 1 .
Its contribution is ( A λ ) d / 2 c d / B (A\lambda)^{d/2}c_d/B ( A λ ) d /2 c d / B . Multiplying the stage coefficient
by 2 B k E k 2B^kE_k 2 B k E k gives exactly t k t_k t k above. Every defect index is nonnegative:
j ≥ ( L + 1 ) k − 1 j\ge(L+1)k-1 j ≥ ( L + 1 ) k − 1 . This proves (5), including the boundary degree d = 2 d=2 d = 2 .
Set
C = 16 ( 1 + ε ) , L = ⌈ 64 / ε ⌉ + 2 , p ∗ = ε 64 ( L + 1 ) , b = ( 1 − p ∗ ) − 1 . C=16(1+\varepsilon),\quad L=\lceil64/\varepsilon\rceil+2,
\quad p_*={\varepsilon\over64(L+1)},\quad b=(1-p_*)^{-1}. C = 16 ( 1 + ε ) , L = ⌈ 64/ ε ⌉ + 2 , p ∗ = 64 ( L + 1 ) ε , b = ( 1 − p ∗ ) − 1 . Then L ≤ 67 / ε L\le67/\varepsilon L ≤ 67/ ε , p ∗ ≥ ε 2 / 4352 p_*\ge\varepsilon^2/4352 p ∗ ≥ ε 2 /4352 ,
L ≥ 66 L\ge66 L ≥ 66 , and p ∗ ≤ 1 / 4096 p_*\le1/4096 p ∗ ≤ 1/4096 . The definitions above imply
log ( J / 16 ) = 2 log ( L / ( L − 2 ) ) + ( L + 1 ) log ( 1 / ( 1 − p ∗ ) ) ≤ ε / 16 + ε / 32 = 3 ε / 32. \log(J/16)=2\log(L/(L-2))+(L+1)\log(1/(1-p_*))
\le\varepsilon/16+\varepsilon/32=3\varepsilon/32. log ( J /16 ) = 2 log ( L / ( L − 2 )) + ( L + 1 ) log ( 1/ ( 1 − p ∗ )) ≤ ε /16 + ε /32 = 3 ε /32. For 0 ≤ t ≤ 1 0\le t\le1 0 ≤ t ≤ 1 , convexity gives e 3 t / 32 ≤ 1 + t / 4 e^{3t/32}\le1+t/4 e 3 t /32 ≤ 1 + t /4
(for example e 3 / 32 ≤ ( 1 − 3 / 32 ) − 1 < 5 / 4 e^{3/32}\le(1-3/32)^{-1}<5/4 e 3/32 ≤ ( 1 − 3/32 ) − 1 < 5/4 ).
Thus q : = J / C ≤ 1 − 3 ε / 8 q:=J/C\le1-3\varepsilon/8 q := J / C ≤ 1 − 3 ε /8 , q ≤ 1 − 3 ε / 16 \sqrt q\le1-3\varepsilon/16 q ≤ 1 − 3 ε /16 ,
and A / C ≤ 1 / 3 A/C\le1/3 A / C ≤ 1/3 . The last estimate follows directly from
b ≤ 4096 / 4095 b\le4096/4095 b ≤ 4096/4095 , L / ( L − 2 ) ≤ 66 / 64 L/(L-2)\le66/64 L / ( L − 2 ) ≤ 66/64 , and C ≥ 16 C\ge16 C ≥ 16 .
Fix dyadic d ≥ 2 d\ge2 d ≥ 2 and assume first λ ≤ 1 / ( C R 2 ℓ ( d ) 2 ) \lambda\le1/(CR^2\ell(d)^2) λ ≤ 1/ ( C R 2 ℓ ( d ) 2 ) .
Write
P N = ∑ j < N p j , X N = ∑ j < N χ j , V N = ∑ j < N v j . P_N=\sum_{j<N}p_j,\quad X_N=\sum_{j<N}\chi_j,\quad
V_N=\sum_{j<N}v_j. P N = j < N ∑ p j , X N = j < N ∑ χ j , V N = j < N ∑ v j . Telescoping (1), with E 0 = 0 E_0=0 E 0 = 0 , gives
v N = 1 − P N , a V N + X N ≤ λ P N . (6) v_N=1-P_N,\qquad aV_N+X_N\le\lambda P_N. \tag{6} v N = 1 − P N , a V N + X N ≤ λ P N . ( 6 ) For each j ≥ L = m 2 j\ge L=m_2 j ≥ L = m 2 , use (5) at the largest dyadic D j ≤ d D_j\le d D j ≤ d satisfying
m D j ≤ j m_{D_j}\le j m D j ≤ j . Degree k < d k<d k < d is used for exactly ( L + 1 ) k / 2 (L+1)k/2 ( L + 1 ) k /2 generations;
a shortened prefix uses it no more often. The first L L L losses are at most
λ \lambda λ each. Introduce the single nonnegative lag kernel
w s = ∑ k < d k dyadic t k 1 { k + 1 ≤ s ≤ ( L + 1 ) k − 1 } , W ∗ = ∑ s w s . w_s=\sum_{\substack{k<d\\k\text{ dyadic}}}t_k
\mathbf1_{\{k+1\le s\le(L+1)k-1\}},\qquad W_*=\sum_s w_s. w s = k < d k dyadic ∑ t k 1 { k + 1 ≤ s ≤ ( L + 1 ) k − 1 } , W ∗ = s ∑ w s . With negative-index defects extended by zero,
∑ j < N ( ∑ s w s χ j − s ) 2 ≤ W ∗ ∑ s w s ∑ j < N χ j − s ≤ W ∗ 2 X N . \sum_{j<N}\Big(\sum_s w_s\sqrt{\chi_{j-s}}\Big)^2
\le W_*\sum_s w_s\sum_{j<N}\chi_{j-s}\le W_*^2X_N. j < N ∑ ( s ∑ w s χ j − s ) 2 ≤ W ∗ s ∑ w s j < N ∑ χ j − s ≤ W ∗ 2 X N . The first inequality is weighted Cauchy--Schwarz. Consequently, on any prefix
where the normalizer bound holds,
P N ≤ δ d + N B d λ d + 2 W ∗ 2 X N , (7) P_N\le\delta_d+NB_d\lambda^d+2W_*^2X_N, \tag{7} P N ≤ δ d + N B d λ d + 2 W ∗ 2 X N , ( 7 ) where
B d = 2 A d c d 2 , δ d = L λ + ( L + 1 ) ∑ 2 ≤ k < d k dyadic k ( A λ ) k c k 2 , B_d=2A^dc_d^2,\qquad
\delta_d=L\lambda+(L+1)\sum_{\substack{2\le k<d\\k\text{ dyadic}}}
k(A\lambda)^kc_k^2, B d = 2 A d c d 2 , δ d = L λ + ( L + 1 ) 2 ≤ k < d k dyadic ∑ k ( A λ ) k c k 2 , and
λ W ∗ ≤ C 0 ∑ k < d k dyadic k 2 c k ( J λ ) k / 2 , C 0 = 4 L 2 / B . (8) \sqrt\lambda W_*\le C_0\sum_{\substack{k<d\\k\text{ dyadic}}}
k^2c_k(J\lambda)^{k/2},\qquad C_0=4L^2/B. \tag{8} λ W ∗ ≤ C 0 k < d k dyadic ∑ k 2 c k ( J λ ) k /2 , C 0 = 4 L 2 / B . ( 8 ) This avoids any dependence on the number of overlapping lag intervals.
Here is the complete uniform bound on these quantities. The input
Theorem 7.1 , transported by the contraction
Cov ( ν ) 1 / 2 \operatorname{Cov}(\nu)^{1/2} Cov ( ν ) 1/2 from isotropic coordinates, gives
c k ≤ 3 2 k k ! c_k\le32^kk! c k ≤ 3 2 k k ! for every k k k . Let
k 0 = ⌈ 2 10 ε − 1 log ( 2 / ε ) ⌉ k_0=\lceil2^{10}\varepsilon^{-1}\log(2/\varepsilon)\rceil k 0 = ⌈ 2 10 ε − 1 log ( 2/ ε )⌉ .
The inequalities log ( 2 / t ) ≤ 2 / t \log(2/t)\le2/t log ( 2/ t ) ≤ 2/ t for 0 < t ≤ 1 0<t\le1 0 < t ≤ 1 and the ceiling bound imply
k 0 ≤ 2 12 ε − 2 k_0\le2^{12}\varepsilon^{-2} k 0 ≤ 2 12 ε − 2 ; also C 0 ≤ 2 14 ε − 2 C_0\le2^{14}\varepsilon^{-2} C 0 ≤ 2 14 ε − 2 and
R ≥ 64 k 0 R\ge64k_0 R ≥ 64 k 0 . Since J λ ≤ R − 2 J\lambda\le R^{-2} J λ ≤ R − 2 , for k ≤ k 0 k\le k_0 k ≤ k 0
C 0 ∑ k ≤ k 0 k 2 c k ( J λ ) k / 2 ≤ 32 C 0 R ∑ k ≥ 1 k 3 2 − k + 1 = 1664 C 0 R ≤ 2 − 15 . C_0\sum_{k\le k_0}k^2c_k(J\lambda)^{k/2}
\le{32C_0\over R}\sum_{k\ge1}k^3 2^{-k+1}
={1664C_0\over R}\le2^{-15}. C 0 k ≤ k 0 ∑ k 2 c k ( J λ ) k /2 ≤ R 32 C 0 k ≥ 1 ∑ k 3 2 − k + 1 = R 1664 C 0 ≤ 2 − 15 . Indeed ( 32 k / R ) k ≤ ( 32 k / R ) 2 − ( k − 1 ) (32k/R)^k\le(32k/R)2^{-(k-1)} ( 32 k / R ) k ≤ ( 32 k / R ) 2 − ( k − 1 ) and
∑ k ≥ 1 k 3 x k = x ( 1 + 4 x + x 2 ) / ( 1 − x ) 4 \sum_{k\ge1}k^3x^k=x(1+4x+x^2)/(1-x)^4 ∑ k ≥ 1 k 3 x k = x ( 1 + 4 x + x 2 ) / ( 1 − x ) 4 .
For k > k 0 k>k_0 k > k 0 occurring in (8), monotonicity of ℓ \ell ℓ gives
k 2 c k ( J λ ) k / 2 ≤ q k / 2 k^2c_k(J\lambda)^{k/2}\le q^{k/2} k 2 c k ( J λ ) k /2 ≤ q k /2 . Hence their contribution is at most
16 C 0 3 ε e − 3 ε k 0 / 16 ≤ 2 17 ε − 3 ( ε / 2 ) 192 < 1 / 8. {16C_0\over3\varepsilon}e^{-3\varepsilon k_0/16}
\le2^{17}\varepsilon^{-3}(\varepsilon/2)^{192}<1/8. 3 ε 16 C 0 e − 3 ε k 0 /16 ≤ 2 17 ε − 3 ( ε /2 ) 192 < 1/8. Therefore θ : = 2 λ W ∗ 2 ≤ 1 / 8 \theta:=2\lambda W_*^2\le1/8 θ := 2 λ W ∗ 2 ≤ 1/8 .
For the small-degree startup sum, A λ ≤ R − 2 A\lambda\le R^{-2} A λ ≤ R − 2 and
( 32 k / R ) 2 k ≤ ( 32 k / R ) 4 4 − k + 2 (32k/R)^{2k}\le(32k/R)^4 4^{-k+2} ( 32 k / R ) 2 k ≤ ( 32 k / R ) 4 4 − k + 2 give
∑ 2 ≤ k ≤ k 0 k ( A λ ) k c k 2 ≤ ( 32 / R ) 4 ∑ k ≥ 2 k 5 4 − k + 2 ≤ 2 36 / R 4 . \sum_{2\le k\le k_0}k(A\lambda)^kc_k^2
\le(32/R)^4\sum_{k\ge2}k^5 4^{-k+2}\le2^{36}/R^4. 2 ≤ k ≤ k 0 ∑ k ( A λ ) k c k 2 ≤ ( 32/ R ) 4 k ≥ 2 ∑ k 5 4 − k + 2 ≤ 2 36 / R 4 . For completeness the series bound here is exact: from
∑ k ≥ 1 k 5 x k = x ( 1 + 26 x + 66 x 2 + 26 x 3 + x 4 ) / ( 1 − x ) 6 \sum_{k\ge1}k^5x^k=x(1+26x+66x^2+26x^3+x^4)/(1-x)^6 ∑ k ≥ 1 k 5 x k = x ( 1 + 26 x + 66 x 2 + 26 x 3 + x 4 ) / ( 1 − x ) 6 ,
at x = 1 / 4 x=1/4 x = 1/4 the numerator factor 1 + 26 x + 66 x 2 + 26 x 3 + x 4 1+26x+66x^2+26x^3+x^4 1 + 26 x + 66 x 2 + 26 x 3 + x 4 is
less than 13 and ( 1 − x ) 6 > 1 / 8 (1-x)^6>1/8 ( 1 − x ) 6 > 1/8 . After multiplication by 16, even
without subtracting the k = 1 k=1 k = 1 term, the bound is 416 < 2 16 416<2^{16} 416 < 2 16 .
Using R ≥ 2 40 ε − 2 R\ge2^{40}\varepsilon^{-2} R ≥ 2 40 ε − 2 and p ∗ ≥ ε 2 / 4352 p_*\ge\varepsilon^2/4352 p ∗ ≥ ε 2 /4352 gives
L C R 2 + ( L + 1 ) 2 36 R 4 ≤ p ∗ / 32. {L\over CR^2}+{(L+1)2^{36}\over R^4}\le p_*/32. C R 2 L + R 4 ( L + 1 ) 2 36 ≤ p ∗ /32. For example the left side is bounded by
67 2 − 84 ε 3 + 68 2 − 124 ε 7 67\,2^{-84}\varepsilon^3+68\,2^{-124}\varepsilon^7 67 2 − 84 ε 3 + 68 2 − 124 ε 7 ;
comparison with ε 2 / ( 32 ⋅ 4352 ) \varepsilon^2/(32\cdot4352) ε 2 / ( 32 ⋅ 4352 ) proves the assertion.
For the large-degree startup terms,
( L + 1 ) ∑ k > k 0 k ( A / C ) k ( k + 1 ) 4 ≤ ( L + 1 ) 2 − k 0 ≤ 68 ε − 1 ( ε / 2 ) 100 ≤ p ∗ / 32. (L+1)\sum_{k>k_0}{k(A/C)^k\over(k+1)^4}
\le(L+1)2^{-k_0}
\le68\varepsilon^{-1}(\varepsilon/2)^{100}\le p_*/32. ( L + 1 ) k > k 0 ∑ ( k + 1 ) 4 k ( A / C ) k ≤ ( L + 1 ) 2 − k 0 ≤ 68 ε − 1 ( ε /2 ) 100 ≤ p ∗ /32. The first inequality follows by bounding the summands by 3 − k 3^{-k} 3 − k and summing;
the second uses 2 10 log 2 > 100 2^{10}\log2>100 2 10 log 2 > 100 and ε − 1 ≥ 1 \varepsilon^{-1}\ge1 ε − 1 ≥ 1 ;
the last reduces to 68 ⋅ 32 ⋅ 4352 < 2 100 68\cdot32\cdot4352<2^{100} 68 ⋅ 32 ⋅ 4352 < 2 100 and ε 97 ≤ 1 \varepsilon^{97}\le1 ε 97 ≤ 1 .
Thus
δ d ≤ p ∗ / 16 , λ ≤ p ∗ / 2 , R 2 ≥ 64 / ( p ∗ C ) . (9) \delta_d\le p_*/16,
\qquad \lambda\le p_*/2,\qquad R^2\ge64/(p_*C). \tag{9} δ d ≤ p ∗ /16 , λ ≤ p ∗ /2 , R 2 ≥ 64/ ( p ∗ C ) . ( 9 ) The last two inequalities follow from the same explicit parameter bounds.
Suppose, toward a contradiction, that a ≥ 32 B d λ d + 1 / p ∗ a\ge32B_d\lambda^{d+1}/p_* a ≥ 32 B d λ d + 1 / p ∗ ,
and let M = ⌈ λ / a ⌉ M=\lceil\lambda/a\rceil M = ⌈ λ / a ⌉ . Stop at the first N ≤ M N\le M N ≤ M with
P N > p ∗ / 2 P_N>p_*/2 P N > p ∗ /2 , if there is one. Through this possible exit,
P j ≤ p ∗ P_j\le p_* P j ≤ p ∗ , since each increment is at most λ ≤ p ∗ / 2 \lambda\le p_*/2 λ ≤ p ∗ /2 .
Consequently v j ≥ 1 − p ∗ v_j\ge1-p_* v j ≥ 1 − p ∗ and
β j = e j / v j ≤ b λ \beta_j=e_j/v_j\le b\lambda β j = e j / v j ≤ bλ for every normalizer required in (5).
The successor being normalized has squared norm v j − p j ≥ 1 − p ∗ − λ > 0 v_j-p_j\ge1-p_*-\lambda>0 v j − p j ≥ 1 − p ∗ − λ > 0 .
Induction constructs all families on the stopped prefix; hence this argument
justifies the normalizer bound before using (7), with no assumption of its
validity on a later, unstopped family.
Combining (6)--(9) gives
( 1 − θ ) P N ≤ δ d + N B d λ d (1-\theta)P_N\le\delta_d+NB_d\lambda^d ( 1 − θ ) P N ≤ δ d + N B d λ d .
For N ≤ M N\le M N ≤ M , the contradiction hypothesis and a ≤ λ 2 a\le\lambda^2 a ≤ λ 2 give
N B d λ d ≤ p ∗ 32 ( 1 + a / λ ) ≤ p ∗ 32 ( 1 + λ ) ≤ p ∗ / 16. NB_d\lambda^d\le{p_*\over32}(1+a/\lambda)
\le{p_*\over32}(1+\lambda)\le p_*/16. N B d λ d ≤ 32 p ∗ ( 1 + a / λ ) ≤ 32 p ∗ ( 1 + λ ) ≤ p ∗ /16. Thus P N ≤ p ∗ / 7 < p ∗ / 6 P_N\le p_*/7<p_*/6 P N ≤ p ∗ /7 < p ∗ /6 , ruling out a first exit. This holds through M M M .
But (6) then implies both
a V M ≥ ( 1 − p ∗ / 6 ) a M ≥ ( 1 − p ∗ / 6 ) λ , a V M ≤ λ P M < p ∗ λ / 6 , aV_M\ge(1-p_*/6)aM\ge(1-p_*/6)\lambda,
\qquad aV_M\le\lambda P_M<p_*\lambda/6, a V M ≥ ( 1 − p ∗ /6 ) a M ≥ ( 1 − p ∗ /6 ) λ , a V M ≤ λ P M < p ∗ λ /6 , a contradiction. We obtain
a λ − ( d + 1 ) < 64 p ∗ A d c d 2 ≤ 64 p ∗ A d R 2 d ℓ ( d ) 2 d ( d + 1 ) 4 ≤ ( C R 2 ℓ ( d ) 2 ) d + 1 . a\lambda^{-(d+1)}<{64\over p_*}A^dc_d^2
\le {64\over p_*}{A^dR^{2d}\ell(d)^{2d}\over(d+1)^4}
\le(CR^2\ell(d)^2)^{d+1}. a λ − ( d + 1 ) < p ∗ 64 A d c d 2 ≤ p ∗ 64 ( d + 1 ) 4 A d R 2 d ℓ ( d ) 2 d ≤ ( C R 2 ℓ ( d ) 2 ) d + 1 . The last inequality uses A < C A<C A < C , ℓ ( d ) ≥ 1 \ell(d)\ge1 ℓ ( d ) ≥ 1 and (9). Taking the
( d + 1 ) (d+1) ( d + 1 ) st root gives the asserted bound in the small-gap regime (indeed with
a − 1 / ( d + 1 ) a^{-1/(d+1)} a − 1/ ( d + 1 ) before inserting the maximum). If
λ > 1 / ( C R 2 ℓ ( d ) 2 ) \lambda>1/(CR^2\ell(d)^2) λ > 1/ ( C R 2 ℓ ( d ) 2 ) the asserted conclusion is immediate.
Fences respected. The proposed node has no bounded_by edges. The argument
proves a curvature-dependent general-test estimate, not CMH, a sharp third-moment
constant, or a universal-time occupation estimate. In particular it does not
invert any sufficient-condition implication in the brief. Its constants require
R ≥ 2 40 ε − 2 R\ge2^{40}\varepsilon^{-2} R ≥ 2 40 ε − 2 uniformly in the degree; retaining this threshold
is essential when the theorem is iterated with depth-dependent ε \varepsilon ε .
All polynomial assumptions are hypotheses of the displayed implication; the
universal small-degree estimate is an actual dependency, not an assumed open
antecedent. Independent review of this proof and that dependency is required.
Song, Z., & Zhang, X. (2026). An O(4\log^* n) Bound for the KLS Constant . https://arxiv.org/abs/2610.01447v1