Put Q k h = E [ A k h ] Q_kh=\mathbb E[\mathcal A_kh] Q k h = E [ A k h ] . Its norm is k ! c k k!c_k k ! c k .
The testing identity proved in Proposition 9.1 gives
P k Q 1 w j = Q k w j − k + 1 k ! z ( k − 1 ) / 2 . (B3) \mathsf P_kQ_1w_j=
\frac{Q_kw_{j-k+1}}{k!z^{(k-1)/2}}. \tag{B3} P k Q 1 w j = k ! z ( k − 1 ) /2 Q k w j − k + 1 . ( B3 ) The first k k k slots are the coordinate slot and the k − 1 k-1 k − 1 newest
derivative slots. Each fresh adjacent swap in the remaining family has
norm at most 2 D i / z 2\sqrt{D_i/z} 2 D i / z by the operator primitive. After h − 1 h-1 h − 1
further steps its norm is multiplied by at most E E E under the assumed
global bound. In the local version it is multiplied by
( R / z ) ( h − 1 ) / 2 (R/z)^{(h-1)/2} ( R / z ) ( h − 1 ) /2 . These componentwise operators commute with all
permutations of older slots.
Sorting a permutation of N N N slots by adjacent swaps uses each adjacent
position at most N N N times. To see this, insert the letters successively
into their required positions; a given boundary is crossed by at most
the number of letters. Telescoping the orthogonal products and averaging
therefore bounds the distance to the symmetric subspace by N N N times
the sum of the adjacent errors. Apply this with N = 3 k N=3k N = 3 k to the next
3 k 3k 3 k slots after the first symmetric block. It yields
∥ ( I − S k ) P k Q 1 w j ∥ ≤ 6 k E c k z − k / 2 ∑ h = 1 3 k − 1 D j − k + 1 − h . \|(I-\mathsf S_k)\mathsf P_kQ_1w_j\|
\le6kE c_kz^{-k/2}
\sum_{h=1}^{3k-1}\sqrt{D_{j-k+1-h}}. ∥ ( I − S k ) P k Q 1 w j ∥ ≤ 6 k E c k z − k /2 h = 1 ∑ 3 k − 1 D j − k + 1 − h . For k < d k<d k < d and j ≥ 2 d − 1 j\ge2d-1 j ≥ 2 d − 1 , the smallest index is
j − 4 k + 2 ≥ 1 j-4k+2\ge1 j − 4 k + 2 ≥ 1 , so every fresh swap used is a genuine derivative swap.
The terminal projection in (B3) has norm at most
c d z − ( d − 1 ) / 2 b j − d + 1 c_dz^{-(d-1)/2}\sqrt{b_{j-d+1}} c d z − ( d − 1 ) /2 b j − d + 1 .
Cauchy–Schwarz over fewer than 3 k 3k 3 k defects and
Lemma 10.1 prove (B1). In the local version the longest
propagation has at most 3 k − 2 3k-2 3 k − 2 steps and R / z ≥ 1 R/z\ge1 R / z ≥ 1 ; replacing its squared norm by
( R / z ) 3 k − 2 (R/z)^{3k-2} ( R / z ) 3 k − 2 gives the stated variant.
The polynomial-envelope variant charges at most
E 2 ( 3 k ) 2 α E^2(3k)^{2\alpha} E 2 ( 3 k ) 2 α for that entire propagation, by the same argument.
For (B2), define T j = β j Q 1 u j − 1 T_j=\sqrt{\beta_j}Q_1u^{j-1} T j = β j Q 1 u j − 1 for j ≥ 1 j\ge1 j ≥ 1 ;
its squared norm is p j p_j p j . Repeated testing gives
P k T j = ∏ i = 0 k − 1 β j − i k ! Q k u j − k . \mathsf P_kT_j=
\frac{\prod_{i=0}^{k-1}\sqrt{\beta_{j-i}}}{k!}Q_ku^{j-k}. P k T j = k ! ∏ i = 0 k − 1 β j − i Q k u j − k . Since ∥ u j − k ∥ ≤ 1 \|u^{j-k}\|\le1 ∥ u j − k ∥ ≤ 1 , the terminal squared norm is at most
B ∗ k c k 2 B_*^kc_k^2 B ∗ k c k 2 . For completeness the inverse-normalization defect is
z i = B 1 / 2 F i + 1 − β i + 1 − 1 / 2 u i , ∥ ∇ z i ∥ 2 = χ i / β i + 1 . z^i=B^{1/2}F_{i+1}-\beta_{i+1}^{-1/2}u^i,
\qquad \|\nabla z^i\|^2=\chi_i/\beta_{i+1}. z i = B 1/2 F i + 1 − β i + 1 − 1/2 u i , ∥∇ z i ∥ 2 = χ i / β i + 1 . This follows by expanding its Dirichlet square and using
F i + 1 = β i + 1 B 1 / 2 u i F_{i+1}=\sqrt{\beta_{i+1}}B^{1/2}u^i F i + 1 = β i + 1 B 1/2 u i .
Thus
u i + 1 = β i + 1 − 1 / 2 P + ∇ u i + P + ∇ z i u^{i+1}=\beta_{i+1}^{-1/2}P_+\nabla u^i+P_+\nabla z^i u i + 1 = β i + 1 − 1/2 P + ∇ u i + P + ∇ z i .
The first term has symmetric newest slots and the second contributes
a swap of norm at most 2 χ i / λ 2\sqrt{\chi_i/\lambda} 2 χ i / λ .
Propagating an old swap uses the scalars of the original entire family,
not freshly chosen normalizers: the next h − 1 h-1 h − 1 maps have norm at most
E h α t ∗ ( h − 1 ) / 2 Eh^\alpha t_*^{(h-1)/2} E h α t ∗ ( h − 1 ) /2 . The same sorting argument gives
∥ ( I − S k ) P k T j ∥ ≤ 6 k E B ∗ k / 2 c k λ − 1 / 2 ∑ h = 1 3 k − 1 h α t ∗ ( h − 1 ) / 2 χ j − k − h . \|(I-\mathsf S_k)\mathsf P_kT_j\|
\le6kE B_*^{k/2}c_k\lambda^{-1/2}
\sum_{h=1}^{3k-1}h^\alpha t_*^{(h-1)/2}
\sqrt{\chi_{j-k-h}}. ∥ ( I − S k ) P k T j ∥ ≤ 6 k E B ∗ k /2 c k λ − 1/2 h = 1 ∑ 3 k − 1 h α t ∗ ( h − 1 ) /2 χ j − k − h . The sum’s convolution kernel has total mass at most
3 k ( 3 k + 1 ) α t ∗ 3 k / 2 3k(3k+1)^\alpha t_*^{3k/2} 3 k ( 3 k + 1 ) α t ∗ 3 k /2 . Weighted Cauchy–Schwarz and summation
over j j j bound its squared convolution by the square of that mass times
the sum of the source χ \chi χ ’s. Multiplication by the joint-frame weight
C F k 2 C_Fk^2 C F k 2 and ( 3 k + 1 ) 2 α ≤ 16 k 2 (3k+1)^{2\alpha}\le16k^2 ( 3 k + 1 ) 2 α ≤ 16 k 2 gives the stated θ \theta θ .
Every source index is at most N − 3 N-3 N − 3 in a prefix j < N j<N j < N .
Keep p 0 , … , p J − 1 p_0,\ldots,p_{J-1} p 0 , … , p J − 1 exactly. Subsequently use the largest
available dyadic degree, capped at d d d ; degree k k k is available when
j ≥ 2 k − 1 j\ge2k-1 j ≥ 2 k − 1 . Each nonterminal degree is used at most 2 k 2k 2 k times.
Their coherent terms sum to the second part of Δ \Delta Δ , while the
terminal coherent terms sum to at most N τ N\tau N τ . This proves (B2).