Contents

Shifted primes in arithmetic progressions to large moduli with linear sieve remainder weights

Ruiyi Zhang Independent Researcher, Columbia, Maryland, USA
Abstract.

Let NN be a sufficiently large even integer, and fix B>0B>0 and 0<ε≤10−40<\varepsilon\leq 10^{-4}. Take Iwaniec’s upper or lower linear-sieve remainder weights. We estimate a signed sum of prime-counting discrepancies on N/(log⁡N)B<p<(1−ε)⁢NN/(\log N)^{B}<p<(1-\varepsilon)N. Fix 0<u≤1/5000<u\leq 1/500 and a sieve exponent 1/2<θ<(5−7/32−3⁢u)/81/2<\theta<(5-7/32-3u)/8. Choose 0<σ≤min⁡{10−10,((5−7/32−3⁢u)/8−θ)/200,u/(2⁢θ)}0<\sigma\leq\min\{10^{-10},((5-7/32-3u)/8-\theta)/200,\sqrt{u/(2\theta)}\}. Then the complete modulus support lies below N(5−7/32−3⁢u)/8N^{(5-7/32-3u)/8}. For every fixed saving exponent A>0A>0, the error is O⁢(N⁢(log⁡N)−A)O(N(\log N)^{-A}). For each of the two signs ν∈{+,−}\nu\in\{+,-\}, the result holds uniformly for integers a∈[N,N⁢log⁡N/3]a\in[N,N\log N/3] satisfying (a,q)=1(a,q)=1 for every modulus qq in the support of the corresponding coefficient wNνw_{N}^{\nu}. Call these shifts admissible; they form a subset of the interval that includes a=Na=N. When u=1/500u=1/500 and θ=19101/32000−10−4\theta=19101/32000-10^{-4}, the ratio log⁡D/log⁡z\log D/\log z is 298.403125298.403125. The proof keeps the smooth-divisor and prime-tuple factors of the linear-sieve weights. It combines dispersion with a Heath–Brown decomposition. The boundary, Type-I and Type-II terms are estimated separately.

Key words and phrases:
shifted primes, linear sieve, level of distribution, dispersion method, Kloosterman sums, primes in arithmetic progressions
2020 Mathematics Subject Classification:
Primary 11N13; Secondary 11N36, 11L05, 11P32

1. Introduction

The Bombieri–Vinogradov theorem [2, 3] gives level 1/21/2 for primes in arithmetic progressions on average. Related early weighted work includes Fouvry–Iwaniec [19, 20]. Consider weighted sums with a fixed residue. Bombieri–Friedlander–Iwaniec reached level 4/74/7 with well-factorable weights [6, Theorem 10]. With a fixed residue, Maynard [7, Theorems 1.1–1.2] proved level 3/53/5 for triply well-factorable weights and level 7/127/12 for the upper linear-sieve weights. Parts I–III address fixed residue classes, well-factorable estimates, and uniform residue classes, respectively [21, 7, 22]. Lichtman [1, Theorem 1.7, (1.6)] obtained level 66/10766/107 for triply well-factorable weights with a fixed residue. For such weights he also obtained level 153/256−δ153/256-\delta, uniformly over residues |a|<N1+δ|a|<N^{1+\delta} for each fixed δ>0\delta>0 [1, Theorem 1.7, (1.7)]. His Proposition 6.6 treats Iwaniec’s modified upper and lower linear-sieve weights. There the largest prime factors are restricted to prescribed short intervals. Its admissible level is ϑ≤ϑ⁢(t1)−δ\vartheta\leq\boldsymbol{\vartheta}(t_{1})-\delta with ϑ⁢(t1)\boldsymbol{\vartheta}(t_{1}) defined in [1, (6.2)]. Take at least three prescribed factors and t1t_{1} below the threshold in that proposition. Then the level becomes ϑ≤ϑ⁢(t1,t2,t3)−δ\vartheta\leq\boldsymbol{\vartheta}(t_{1},t_{2},t_{3})-\delta, with the function of [1, (6.4)] and fixed δ>0\delta>0. The error constant in that proposition depends on the fixed residue aa [1, Proposition 6.6]. Lichtman’s modified linear-sieve weights reach level 10/1710/17 [25].

Pascadi [8, Theorem 1.3] gives levels approaching 5/85/8 for triply well-factorable weights, with a fixed residue. For suitable upper linear-sieve weights his levels approach 3/53/5. Pascadi’s Theorem 5.4 also treats both signs of the restricted well-factorable linear-sieve weights and refines Proposition 6.6 [8, Theorem 5.4]. His Lemma 5.6 records a correction to a small error in Section 6 of [1] [8, Lemma 5.6].

Here z=Nuz=N^{u} with u≤1/500u\leq 1/500 and θ>1/2\theta>1/2, so s=θ/u>250s=\theta/u>250, in the fundamental-lemma range. The cited linear-sieve levels use sifting ranges with s≈1s\approx 1–22 and are not directly comparable.

The congruence p≡a(modq)p\equiv a\pmod{q} says that qq divides the shifted prime a−pa-p. So the sums below count shifted primes a−pa-p in the class 0 modulo qq. The modulus coefficients are Iwaniec’s explicit lower and upper remainder weights [10, Theorem 4]. We retain their smooth-divisor factors, prime-tuple factors, and distinctness conditions. We estimate the complete signed sum for the admissible shifts in the stated interval. Theorem 1.2 covers the fixed parameters u,θ,A,B,εu,\theta,A,B,\varepsilon below. Its support exponent tends to 153/256153/256 as u↓0u\downarrow 0. This numerical endpoint matches Lichtman’s moving-residue level for triply well-factorable weights [1, Theorem 1.7, (1.7)]; the residue ranges differ. At u=1/500u=1/500 the exponent is smaller. The coefficient family here is the full remainder in [10, Theorem 4]. It includes the smooth-only term and the distinctness masks. Lichtman’s Proposition 6.6 estimates restricted factor-pattern components of different modified sieve weights. Its implied constant depends on the fixed residue. Here uniformity is only over the support-coprime shifts specified below, an admissible subset of [N,N⁢log⁡N/3][N,N\log N/3] that includes a=Na=N; no uniformity over the full interval is asserted.

The local statement uses the hypotheses of Section 3. Let BB be a Heath–Brown box at scale XX. Write wB⁢(n)w_{B}(n) for its finite source coefficient and CB⁢(q)C_{B}(q) for its modulus coefficient. Set

ΔB⁢(q;a)=∑nwB⁢(n)⁢(𝟏n≡a⁢(q)−𝟏(n,q)=1φ⁢(q)).\Delta_{B}(q;a)=\sum_{n}w_{B}(n)\left(\mathbf{1}_{n\equiv a\,(q)}-\frac{% \mathbf{1}_{(n,q)=1}}{\varphi(q)}\right).

In Section 3, wBw_{B} is written as a sum over the variables of BB; this is the same discrepancy.

Proposition (Dispersion for a source box).

Fix 0<σ≤10−100<\sigma\leq 10^{-10} and constants Kscale>0K_{\rm scale}>0 and Cbox>0C_{\rm box}>0. Here KscaleK_{\rm scale} bounds the logarithmic difference between the prime scale XX and NN. The source boxes have relative width (log⁡X)−Cbox(\log X)^{-C_{\rm box}}. Let NN be sufficiently large and even, N/(log⁡N)Kscale≤X≤NN/(\log N)^{K_{\rm scale}}\leq X\leq N, and put L=log⁡XL=\log X and A0=X1+σ/20A_{0}=X^{1+\sigma/20}. Let aa be a positive integer with a≤X⁢(log⁡N)Kscale≤A0a\leq X(\log N)^{K_{\rm scale}}\leq A_{0}. Suppose every supported modulus is coprime to 2⁢a2a. Suppose BB and CBC_{B} satisfy (H1)–(H5) of Section 3. These include the support condition q≤Xϑ0q\leq X^{\vartheta_{0}}, where

ηL=10−4,ϑ0=1910132000−ηL=0.59680625,ℓ0=53412−ηL2,cσ=ℓ0⁢σ24>0.\eta_{L}=10^{-4},\quad\vartheta_{0}=\frac{19101}{32000}-\eta_{L}=0.59680625,% \quad\ell_{0}=\frac{53}{412}-\frac{\eta_{L}}{2},\quad c_{\sigma}=\frac{\ell_{0% }\sigma^{2}}{4}>0.

For each fixed A′>0A^{\prime}>0 there is a finite C=C⁢(σ,Kscale,Cbox,A′,𝒞src)C=C(\sigma,K_{\rm scale},C_{\rm box},A^{\prime},\mathcal{C}_{\rm src}) such that

(1.1) |∑q≤Xϑ0CB⁢(q)⁢ΔB⁢(q;a)|≪σ,Kscale,Cbox,A′,𝒞srcX⁢L−A′+X1−cσ⁢LC.\left|\sum_{q\leq X^{\vartheta_{0}}}C_{B}(q)\Delta_{B}(q;a)\right|\ll_{\sigma,% K_{\rm scale},C_{\rm box},A^{\prime},\mathcal{C}_{\rm src}}XL^{-A^{\prime}}+X^% {1-c_{\sigma}}L^{C}.

Here 𝒞src\mathcal{C}_{\rm src} denotes the fixed uniform constants in (H1)–(H5). The estimate is uniform in BB, NN, and all aa as above. The implied constant and the threshold for NN are ineffective.

Theorem 3.1 in Section 3 is the abstract dispersion estimate under the support and packing hypotheses in (H3). Theorem 3.2 is the dispersion engine used for Theorem 1.2. It allows support up to X0.6X^{0.6}.

Theorem 1.1 (Signed shifted-prime mean value at u=1/500u=1/500).

Fix A,B>0A,B>0, 0<ε≤10−40<\varepsilon\leq 10^{-4}, and

12<θ<Θ∗:=1910132000.\frac{1}{2}<\theta<\Theta_{*}:=\frac{19101}{32000}.

Set

u=1500,ηΘ=Θ∗−θ,0<σ≤min⁡{10−10,ηΘ200,11000⁢θ},τ=σ9,D=Nθ,z=N1/500,Y=Dσ2,Kscale=B+1,\begin{gathered}u=\frac{1}{500},\qquad\eta_{\Theta}=\Theta_{*}-\theta,\qquad 0% <\sigma\leq\min\left\{10^{-10},\frac{\eta_{\Theta}}{200},\sqrt{\frac{1}{1000% \theta}}\right\},\\ \tau=\sigma^{9},\quad D=N^{\theta},\quad z=N^{1/500},\quad Y=D^{\sigma^{2}},% \quad K_{\rm scale}=B+1,\end{gathered}

and choose an integer Cbox≥⌈2⁢A+32⌉C_{\rm box}\geq\lceil 2A+32\rceil; constants may depend on this choice, as in Theorem 1.2. Let NN be sufficiently large and even. For either sign ν∈{+,−}\nu\in\{+,-\}, let wNν⁢(q)w_{N}^{\nu}(q) be the complete Iwaniec remainder coefficient of formula (W) in Section 5. Its prime set is 𝒫N={p⁢ prime:p∤2⁢N}\mathcal{P}_{N}=\{p\text{ prime}:p\nmid 2N\}, with the grid and distinctness conditions there. Let aa be an integer with N≤a≤N⁢log⁡N/3N\leq a\leq N\log N/3 and (a,q)=1(a,q)=1 for every q∈supp⁡wNνq\in\operatorname{supp}w_{N}^{\nu}. Call these shifts admissible; they form a subset of the interval that includes a=Na=N. Put IN=(N/(log⁡N)B,(1−ε)⁢N)I_{N}=(N/(\log N)^{B},(1-\varepsilon)N). Let πIN\pi_{I_{N}} count its primes, and πIN⁢(q,a)\pi_{I_{N}}(q,a) those congruent to aa modulo qq. Then

supp⁡wNν⊆{q<D1+σ+τ:(q,2⁢N)=1},D1+σ+τ<NΘ∗,|wNν⁢(q)|≪σ,θ1,\operatorname{supp}w_{N}^{\nu}\subseteq\{q<D^{1+\sigma+\tau}:(q,2N)=1\},\qquad D% ^{1+\sigma+\tau}<N^{\Theta_{*}},\qquad|w_{N}^{\nu}(q)|\ll_{\sigma,\theta}1,

and

|∑qwNν⁢(q)⁢{πIN⁢(q,a)−πINφ⁢(q)}|≪σ,A,θ,B,ε,CboxN⁢(log⁡N)−A.\left|\sum_{q}w_{N}^{\nu}(q)\left\{\pi_{I_{N}}(q,a)-\frac{\pi_{I_{N}}}{\varphi% (q)}\right\}\right|\ll_{\sigma,A,\theta,B,\varepsilon,C_{\rm box}}N(\log N)^{-% A}.

The sum covers the complete support of formula (W). For the admissible choice θ=19101/32000−10−4\theta=19101/32000-10^{-4}, the sieve ratio log⁡D/log⁡z=500⁢θ\log D/\log z=500\theta equals 298.403125298.403125. The implied constant and the threshold for NN are ineffective.

Remark (parameter conventions). In Theorem 1.1 one takes Aagg=AA_{\rm agg}=A and Cbox≥⌈2⁢A+32⌉C_{\rm box}\geq\lceil 2A+32\rceil. The shifted choice Aagg=A+3A_{\rm agg}=A+3 and the corresponding Cbox≥⌈2⁢A+38⌉C_{\rm box}\geq\lceil 2A+38\rceil occur only in the auxiliary source-wide estimate (3.95), which is not used in the proofs of Theorems 1.1–1.2 or Corollary 1.3, nor in Section 5.

Theorem 1.2 (Signed shifted-prime mean value).

Fix A>0A>0, B>0B>0, 0<ε≤10−40<\varepsilon\leq 10^{-4}, 0<u≤1/5000<u\leq 1/500, and

12<θ<Θ⁢(u):=5−7/32−3⁢u8.\frac{1}{2}<\theta<\Theta(u):=\frac{5-7/32-3u}{8}.

Put

ηΘ=Θ⁢(u)−θ,0<σ≤min⁡{10−10,ηΘ/200,u/(2⁢θ)},τ=σ9,D=Nθ,z=Nu,Y=Dσ2.\begin{gathered}\eta_{\Theta}=\Theta(u)-\theta,\\ 0<\sigma\leq\min\{10^{-10},\eta_{\Theta}/200,\sqrt{u/(2\theta)}\},\\ \tau=\sigma^{9},\quad D=N^{\theta},\quad z=N^{u},\quad Y=D^{\sigma^{2}}.\end{gathered}

Set Kscale=B+1K_{\rm scale}=B+1. Choose an integer box-width exponent

Cbox≥⌈2⁢A+32⌉.C_{\rm box}\geq\lceil 2A+32\rceil.

The implied constant and the threshold for NN below may also depend on the chosen CboxC_{\rm box}. For the canonical choice Cbox=⌈2⁢A+32⌉C_{\rm box}=\lceil 2A+32\rceil this is a dependence on AA alone. Equivalently Cbox≥2⁢(A+cR)C_{\rm box}\geq 2(A+c_{R}), with the boundary exponent cR=16c_{R}=16 of (3.24) and (B.19). This also gives the logarithm-freezing condition Cbox≥A+18C_{\rm box}\geq A+18 from (B.18). Let NN be sufficiently large and even. For each sign ν∈{+,−}\nu\in\{+,-\}, let wNν⁢(q)w_{N}^{\nu}(q) be the complete Iwaniec remainder coefficient defined by formula (W) in Section 5. Its prime set is 𝒫N={p⁢ prime:p∤2⁢N}\mathcal{P}_{N}=\{p\text{ prime}:p\nmid 2N\}, with the grid and distinctness conditions specified there. Let aa be any integer satisfying

N≤a≤N⁢log⁡N/3,(a,q)=1for every ⁢q∈supp⁡wNν.N\leq a\leq N\log N/3,\qquad(a,q)=1\quad\text{for every }q\in\operatorname{% supp}w_{N}^{\nu}.

Call these shifts admissible; they form a subset of the interval that includes a=Na=N. Put

IN=(N(log⁡N)B,(1−ε)⁢N).I_{N}=\left(\frac{N}{(\log N)^{B}},(1-\varepsilon)N\right).

Write πIN\pi_{I_{N}} for the number of primes in INI_{N}. Write πIN⁢(q,a)\pi_{I_{N}}(q,a) for the number of these primes with p≡a(modq)p\equiv a\pmod{q}. For every fixed σ\sigma in the displayed range, these coefficients satisfy

supp⁡wNν⊆{q<D1+σ+τ:(q,2⁢N)=1},D1+σ+τ<NΘ⁢(u),|wNν⁢(q)|≪σ,u,θ1,\begin{gathered}\operatorname{supp}w_{N}^{\nu}\subseteq\{q<D^{1+\sigma+\tau}:(% q,2N)=1\},\\ D^{1+\sigma+\tau}<N^{\Theta(u)},\qquad|w_{N}^{\nu}(q)|\ll_{\sigma,u,\theta}1,% \end{gathered}

and

(1.2) |∑qwNν⁢(q)⁢{πIN⁢(q,a)−πINφ⁢(q)}|≪σ,A,u,θ,B,ε,CboxN⁢(log⁡N)−A.\left|\sum_{q}w_{N}^{\nu}(q)\left\{\pi_{I_{N}}(q,a)-\frac{\pi_{I_{N}}}{\varphi% (q)}\right\}\right|\ll_{\sigma,A,u,\theta,B,\varepsilon,C_{\rm box}}N(\log N)^% {-A}.

The sum includes the entire support of formula (W). The sieve ratio is log⁡D/log⁡z=θ/u\log D/\log z=\theta/u. The condition on σ\sigma gives Y=Dσ2=Nθ⁢σ2≤Nu/2<zY=D^{\sigma^{2}}=N^{\theta\sigma^{2}}\leq N^{u/2}<z, as required for the rough-factor bounds. The implied constant and the threshold for NN are ineffective. The proof uses the Siegel–Walfisz theorem.

Proof of Theorem 1.1.

Apply Theorem 1.2 with u=1/500u=1/500. Then Θ⁢(u)=19101/32000\Theta(u)=19101/32000, and its condition on σ\sigma becomes the displayed condition above. All the support, coefficient, and discrepancy bounds specialize as stated. The numerical sieve ratio follows from log⁡D/log⁡z=θ/u\log D/\log z=\theta/u. At θ=19101/32000−10−4\theta=19101/32000-10^{-4} the proof uses Theorem 3.2 through Theorem 1.2. That theorem allows support up to X0.6X^{0.6}. It does not use the introductory proposition. At θ=ϑ0\theta=\vartheta_{0} the support bound D1+σ+τD^{1+\sigma+\tau} of (W) exceeds Xϑ0X^{\vartheta_{0}}. ∎

In Theorem 1.2, D=NθD=N^{\theta} and D1+σ+τ<NΘ⁢(u)D^{1+\sigma+\tau}<N^{\Theta(u)} by the choice of σ\sigma. The introductory source-box estimate has the fixed local level ϑ0=19101/32000−10−4\vartheta_{0}=19101/32000-10^{-4}. It assumes its support hypothesis. The packing ceiling for Theorem 1.2 is Θ⁢(u)\Theta(u). The latter applies the X0.6X^{0.6} dispersion theorem 3.2 together with the source estimates below. Here Θ⁢(u)<153/256<0.6\Theta(u)<153/256<0.6. Fix B>0B>0. Each source shell has X>N/(2⁢(log⁡N)B)X>N/(2(\log N)^{B}). So, for sufficiently large NN,

NΘ⁢(u)≤(N2⁢(log⁡N)B)0.6<X0.6.N^{\Theta(u)}\leq\left(\frac{N}{2(\log N)^{B}}\right)^{0.6}<X^{0.6}.

Thus the full support of Iwaniec’s remainder weights lies in the range of Theorem 3.2. Section 4 proves the modulus packing. Appendix B estimates the Heath–Brown, boundary, and other source terms. Section 5 assembles these estimates.

Corollary 1.3 (Logarithmic-integral comparator).

Under the hypotheses of Theorem 1.2, for each ν∈{+,−}\nu\in\{+,-\},

|∑qwNν⁢(q)⁢{πIN⁢(q,a)−Li⁡((1−ε)⁢N)−Li⁡(N/(log⁡N)B)φ⁢(q)}|\displaystyle\left|\sum_{q}w_{N}^{\nu}(q)\left\{\pi_{I_{N}}(q,a)-\frac{\begin{% subarray}{c}\operatorname{Li}((1-\varepsilon)N)\\ {}-\operatorname{Li}(N/(\log N)^{B})\end{subarray}}{\varphi(q)}\right\}\right|
≪σ,A,u,θ,B,ε,CboxN⁢(log⁡N)−A.\displaystyle\ll_{\sigma,A,u,\theta,B,\varepsilon,C_{\rm box}}N(\log N)^{-A}.

The implied constant and the threshold for NN are ineffective.

The proof uses the spectral large sieves of Deshouillers and Iwaniec [5]. It uses the Kim–Sarnak exponent 7/647/64 [13]. It also uses Deligne’s bound for holomorphic coefficients [14]. Section 2 states these inputs. The dispersion argument and its application are in Sections 3–5.

2. Classical inputs and Theorem 2.8

Put e⁢(t)=exp⁡(2⁢π⁢i⁢t)e(t)=\exp(2\pi it). Write n∼Nn\sim N for N<n≤2⁢NN<n\leq 2N. Unspecified arithmetic indices are positive integers. Norms of sequences are counting-measure ℓ2\ell^{2} norms. A star denotes reduced residue classes in residue sums. In character sums it denotes primitive characters. These two uses are distinguished explicitly below. Constants are uniform within each sequence family. Put

(2.1) θKS=732.\theta_{\mathrm{KS}}=\frac{7}{32}.

Thus θKS=2⋅7/64\theta_{\mathrm{KS}}=2\cdot 7/64, where 7/647/64 is the unramified Ramanujan exponent. This symbol is distinct from the level parameter θ\theta and the exceptional parameters ϑj\vartheta_{j}.

2.1. Spectral normalization and large sieves

The spectral large sieves are due to Deshouillers and Iwaniec [5].

Let q≥1q\geq 1. Use Petersson-orthonormal bases at level Γ0⁢(q)\Gamma_{0}(q). The measure is d⁢x⁢d⁢y/y2dx\,dy/y^{2}. Take σ∞=I\sigma_{\infty}=I. For a Maass cusp form,

(2.2) uj⁢(z)=∑n≠0ρj⁢∞⁢(n)⁢y⁢Ki⁢κj⁢(2⁢π⁢|n|⁢y)⁢e⁢(n⁢x),λj=14+κj2.u_{j}(z)=\sum_{n\neq 0}\rho_{j\infty}(n)\sqrt{y}\,K_{i\kappa_{j}}(2\pi|n|y)e(% nx),\qquad\lambda_{j}=\tfrac{1}{4}+\kappa_{j}^{2}.

This is the Fourier expansion of [5, (1.15)], as printed there. It has no factor 2⁢|n|2\sqrt{|n|}; that factor enters only through the dictionary (2.11). For a holomorphic form ff of even weight k≥2k\geq 2, write

(2.3) f⁢(z)=∑n≥1ψf⁢(∞,n)⁢e⁢(n⁢z).f(z)=\sum_{n\geq 1}\psi_{f}(\infty,n)e(nz).

The Eisenstein coefficients φ𝔠⁢∞⁢n⁢(s)\varphi_{\mathfrak{c}\infty n}(s) have the normalization of [5, (1.17)]. Their relation to the Whittaker coefficients ρDr\rho^{\rm Dr} of Drappeau, whose full dictionary is (2.11) in §2.2 below, is

(2.4) ρ𝔠⁢∞Dr⁢(n,t)=π1/2+i⁢t⁢|n|i⁢t−1/2Γ⁢(1/2+i⁢t)⁢φ𝔠⁢∞⁢n⁢(1/2+i⁢t).\rho^{\rm Dr}_{\mathfrak{c}\infty}(n,t)=\frac{\pi^{1/2+it}|n|^{it-1/2}}{\Gamma% (1/2+it)}\varphi_{\mathfrak{c}\infty n}(1/2+it).

Let 𝔠\mathfrak{c} run over inequivalent cusps. Use width-one scaling matrices. The continuous-spectrum measure in the DI large sieve is plain d⁢tdt.

Theorem 2.1 (consequence of [5, Theorem 2]). Let ϵ>0\epsilon>0, q≥1q\geq 1, K≥1K\geq 1 and N≥12N\geq\tfrac{1}{2}. Let an∈ℂa_{n}\in\mathbb{C} be supported on N<n≤2⁢NN<n\leq 2N. Then each of

(2.5) H⁢(K,a)=∑2≤k≤Kk∈even(k−1)!(4⁢π)k−1⁢∑f∈ℬk⁢(q)|∑n∼Nan⁢n−(k−1)/2⁢ψf⁢(∞,n)|2,M⁢(K,a)=∑|κj|≤K1cosh⁡(π⁢κj)⁢|∑n∼Nan⁢ρj⁢∞⁢(n)|2,E⁢(K,a)=∑𝔠∫−KK|∑n∼Nan⁢ni⁢t⁢φ𝔠⁢∞⁢n⁢(1/2+i⁢t)|2⁢𝑑t\begin{split}H(K,a)&=\sum_{\begin{subarray}{c}2\leq k\leq K\\ k\in{\rm even}\end{subarray}}\frac{(k-1)!}{(4\pi)^{k-1}}\sum_{f\in\mathcal{B}_% {k}(q)}\left|\sum_{n\sim N}a_{n}n^{-(k-1)/2}\psi_{f}(\infty,n)\right|^{2},\\ M(K,a)&=\sum_{|\kappa_{j}|\leq K}\frac{1}{\cosh(\pi\kappa_{j})}\left|\sum_{n% \sim N}a_{n}\rho_{j\infty}(n)\right|^{2},\\ E(K,a)&=\sum_{\mathfrak{c}}\int_{-K}^{K}\left|\sum_{n\sim N}a_{n}n^{it}\varphi% _{\mathfrak{c}\infty n}(1/2+it)\right|^{2}dt\end{split}

is at most

(2.6) Cϵ⁢(K2+N1+ϵq)⁢∑n∼N|an|2,C_{\epsilon}\left(K^{2}+\frac{N^{1+\epsilon}}{q}\right)\sum_{n\sim N}|a_{n}|^{% 2},

uniformly in q,K,N,aq,K,N,a. By [5, Theorem 2, (1.28)–(1.30)], each expression is bounded by Cϵ⁢{K2+μ⁢(𝔞)⁢N1+ϵ}⁢‖aN‖22C_{\epsilon}\{K^{2}+\mu(\mathfrak{a})N^{1+\epsilon}\}\|a_{N}\|_{2}^{2}, with the constant depending only on ϵ\epsilon. At 𝔞=∞\mathfrak{a}=\infty, μ⁢(∞)=1/q\mu(\infty)=1/q, giving (2.6); the source includes the endpoint N≥12N\geq\tfrac{1}{2}. The third line of (2.5) has no factor 1/cosh⁡(π⁢t)1/\cosh(\pi t). The cusp transport for Theorem 2.8 is in §2.7.3.

For an exceptional eigenvalue 0<λj<140<\lambda_{j}<\tfrac{1}{4}, choose i⁢κj>0i\kappa_{j}>0, and put

(2.7) ϑj=2⁢i⁢κj=2⁢14−λj.\vartheta_{j}=2i\kappa_{j}=2\sqrt{\tfrac{1}{4}-\lambda_{j}}.

Theorem 2.2 ([5, Theorem 5], the specialization used here). Let ϵ>0\epsilon>0, q≥1q\geq 1, N≥12N\geq\tfrac{1}{2} and Y≥1Y\geq 1. Let an∈ℂa_{n}\in\mathbb{C} be supported on n∼Nn\sim N. Then

(2.8) ∑j⁢exceptionalYϑj⁢|∑n∼Nan⁢ρj⁢∞⁢(n)|2≪ϵ(1+N⁢Yq)⁢(1+N1+ϵq)⁢‖a‖22.\sum_{j\ {\rm exceptional}}Y^{\vartheta_{j}}\left|\sum_{n\sim N}a_{n}\rho_{j% \infty}(n)\right|^{2}\ll_{\epsilon}\left(1+\sqrt{\frac{NY}{q}}\right)\left(1+% \sqrt{\frac{N^{1+\epsilon}}{q}}\right)\|a\|_{2}^{2}.

This is [5, Theorem 5]. It uses the notation of Theorem 2, so N≥12N\geq\tfrac{1}{2} is allowed. The implied constant depends on ϵ\epsilon alone.

Theorem 2.3 (from [5, proof of Theorem 7, (8.17)]). Let ϵ>0\epsilon>0. Let ana_{n} be the characteristic sequence of an integer interval I⊂(N,2⁢N]I\subset(N,2N]. Then, for some cϵc_{\epsilon} and uniformly in Q,N,Y≥1Q,N,Y\geq 1 and II,

(2.9) ∑2≤q≤Q∑j⁢exceptional(q)Yϑj⁢|∑n∼Nan⁢ρj⁢∞⁢(n)|2≤cϵ⁢(Q⁢N)ϵ⁢(Q+N+N⁢Y)⁢N.\sum_{2\leq q\leq Q}\ \sum_{j\ {\rm exceptional}}^{(q)}Y^{\vartheta_{j}}\Bigl{% |}\sum_{n\sim N}a_{n}\rho_{j\infty}(n)\Bigr{|}^{2}\leq c_{\epsilon}(QN)^{% \epsilon}\bigl{(}Q+N+\sqrt{NY}\bigr{)}N.

The range starts at q=2q=2 because Theorem 2.8 uses level q=r⁢sq=rs with r>R≥1r>R\geq 1, so q≥2q\geq 2 there.

Proof. By [5, (8.17) and (8.4)],

∑Q0<q≤16⁢Q0∑excYϑj⁢|∑N<n≤2⁢Nan⁢ρj⁢∞⁢(n)|2\displaystyle\sum_{Q_{0}<q\leq 16Q_{0}}\sum_{\rm exc}Y^{\vartheta_{j}}\left|% \sum_{N<n\leq 2N}a_{n}\rho_{j\infty}(n)\right|^{2}
≤cϵ′DI⁢(Q0⁢N)5⁢ϵ′⁢(Q0+N+N⁢Y)⁢N\displaystyle\qquad\leq c^{\rm DI}_{\epsilon^{\prime}}(Q_{0}N)^{5\epsilon^{% \prime}}(Q_{0}+N+\sqrt{NY})N

for Q0≥1Q_{0}\geq 1. In [5] the interval is printed as [N,N1][N,N_{1}], N≤N1≤2⁢NN\leq N_{1}\leq 2N. The sum runs over N<n≤2⁢NN<n\leq 2N, so ana_{n} is the characteristic sequence of the initial interval (N,N1]∩ℤ(N,N_{1}]\cap\mathbb{Z}. The source estimate (8.17) is uniform for Q0,N,Y≥1Q_{0},N,Y\geq 1 and every real N1∈[N,2⁢N]N_{1}\in[N,2N]; its final statement imposes no relation between YY and Q0,NQ_{0},N. In the proof, the induction first treats 1≤N≤Q01\leq N\leq Q_{0} at Y∗=Q02−2⁢ϵ′/NY_{*}=Q_{0}^{2-2\epsilon^{\prime}}/N, while (8.18) handles the remaining large-NN range, and the final comparison extends the result to every Y≥1Y\geq 1. We write all intervals in this half-open form.

(i) qq-blocks. Let IQ=max⁡{i≥0:16−i⁢Q≥1}I_{Q}=\max\{i\geq 0:16^{-i}Q\geq 1\}. The blocks (16−i⁢Q,161−i⁢Q](16^{-i}Q,16^{1-i}Q], 1≤i≤IQ1\leq i\leq I_{Q}, together with (1,16](1,16], cover 2≤q≤Q2\leq q\leq Q. There are at most 2+log16⁡Q2+\log_{16}Q of them. Every summand is nonnegative. So each block may be enlarged to its full DI range. Each block has Q0≤QQ_{0}\leq Q.

(ii) Intervals. Write I=(u,v]∩ℤI=(u,v]\cap\mathbb{Z} with N≤u≤v≤2⁢NN\leq u\leq v\leq 2N. Then 𝟏I=𝟏(N,v]−𝟏(N,u]\mathbf{1}_{I}=\mathbf{1}_{(N,v]}-\mathbf{1}_{(N,u]}, both initial intervals in DI’s sense, and |A−B|2≤2⁢|A|2+2⁢|B|2|A-B|^{2}\leq 2|A|^{2}+2|B|^{2}. This costs a factor 4.

Hence the left side of (2.9) is at most 4⁢cϵ′DI⁢(2+log16⁡Q)⁢(Q⁢N)5⁢ϵ′⁢(Q+N+N⁢Y)⁢N4c^{\rm DI}_{\epsilon^{\prime}}(2+\log_{16}Q)(QN)^{5\epsilon^{\prime}}(Q+N+% \sqrt{NY})N. Take ϵ′=ϵ/10\epsilon^{\prime}=\epsilon/10 and cϵ:=4⁢cϵ/10DI⁢supQ≥1(2+log16⁡Q)⁢Q−ϵ/2<∞c_{\epsilon}:=4c^{\rm DI}_{\epsilon/10}\sup_{Q\geq 1}(2+\log_{16}Q)Q^{-% \epsilon/2}<\infty. □\square

The interval hypothesis is the one in [5, (8.17)], and the induction closes in the proof of Theorem 7. Theorem 2.3 comes from this step of that proof. [5, Theorem 7] treats an=1a_{n}=1 on n≤Nn\leq N. Theorem 2.3 needs N≥1N\geq 1. The one-integer block N=12N=\tfrac{1}{2} is treated in §2.7.5.

2.2. Hecke exponents and the adopted trace normalization

Kim–Sarnak input. The bound 7/647/64 at an unramified place is [13, Appendix 2, Proposition 2]; the Satake normalization is stated in [13, p. 175]. Independently, the archimedean input λj≥975/4096\lambda_{j}\geq 975/4096 is the lower bound in [13, Appendix 2]; it is not a consequence of the finite-place estimate below. Let ff be a weight-zero Maass newform of congruence level. Each exceptional parameter of ff satisfies 0≤i⁢κ≤7/640\leq i\kappa\leq 7/64. For a prime pp not dividing the level,

(2.10) |αp|,|βp|≤p7/64,|λf⁢(pν)|≤(ν+1)⁢p7⁢ν/64(ν≥0).|\alpha_{p}|,|\beta_{p}|\leq p^{7/64},\qquad|\lambda_{f}(p^{\nu})|\leq(\nu+1)p% ^{7\nu/64}\quad(\nu\geq 0).

Thus the preceding archimedean input gives ϑj≤θKS\vartheta_{j}\leq\theta_{\mathrm{KS}}, equivalently λj≥975/4096\lambda_{j}\geq 975/4096 by (2.7). At the finite places, (2.10) gives |λf⁢(k)|≤τ⁢(k)⁢kθKS/2|\lambda_{f}(k)|\leq\tau(k)k^{\theta_{\mathrm{KS}}/2} for kk coprime to the level. We use these bounds for newforms of level dividing qq. These newforms diagonalize the unramified Hecke operators on the full level-qq space. For holomorphic newforms we use Deligne’s |λf⁢(k)|≤τ⁢(k)|\lambda_{f}(k)|\leq\tau(k), again for kk coprime to the level. Both factorizations use primes coprime to the level.

Deligne input. The holomorphic bound is [14, Théorème 8.2]. Both inputs enter at primes coprime to the level, through the prime-power recurrences and multiplicativity above.

Bruggeman and Kuznetsov independently introduced the relevant trace formulas; see [5, p. 220] and their original papers [27, 26]. For the normalization and formulas used here, see [9, (4.7), (4.9)–(4.19), Lemma 4.5], in the PLMS version. The coefficient dictionary is

(2.11) ρf⁢𝔞Dr⁢(n)\displaystyle\rho^{\rm Dr}_{f\mathfrak{a}}(n) =ρf⁢𝔞DI⁢(n)2⁢|n|\displaystyle=\frac{\rho^{\rm DI}_{f\mathfrak{a}}(n)}{2\sqrt{|n|}} (Maass),\displaystyle\hbox{(Maass)},
ρf⁢𝔞Dr⁢(n)\displaystyle\rho^{\rm Dr}_{f\mathfrak{a}}(n) =(4⁢π⁢n)−k/2⁢ψf⁢(𝔞,n)\displaystyle=(4\pi n)^{-k/2}\psi_{f}(\mathfrak{a},n) (holomorphic),\displaystyle\hbox{(holomorphic)},

with (2.4) for Eisenstein series. The Maass identity follows from W0,i⁢t⁢(4⁢π⁢|n|⁢y)=2⁢|n|⁢y⁢Ki⁢t⁢(2⁢π⁢|n|⁢y)W_{0,it}(4\pi|n|y)=2\sqrt{|n|y}K_{it}(2\pi|n|y).

For ϕ∈Cc∞⁢((0,∞))\phi\in C_{c}^{\infty}((0,\infty)), define the DI transforms

(2.12) ϕ^⁢(t)=πsinh⁡π⁢t⁢∫0∞J2⁢i⁢t⁢(x)−J−2⁢i⁢t⁢(x)2⁢i⁢ϕ⁢(x)⁢d⁢xx,ϕˇ⁢(t)=4π⁢cosh⁡π⁢t⁢∫0∞K2⁢i⁢t⁢(x)⁢ϕ⁢(x)⁢d⁢xx,ϕ~⁢(k−1)=∫0∞Jk−1⁢(x)⁢ϕ⁢(x)⁢d⁢xx.\begin{split}\widehat{\phi}(t)&=\frac{\pi}{\sinh\pi t}\int_{0}^{\infty}\frac{J% _{2it}(x)-J_{-2it}(x)}{2i}\phi(x)\frac{dx}{x},\\ \check{\phi}(t)&=\frac{4}{\pi}\cosh\pi t\int_{0}^{\infty}K_{2it}(x)\phi(x)% \frac{dx}{x},\\ \widetilde{\phi}(k-1)&=\int_{0}^{\infty}J_{k-1}(x)\phi(x)\frac{dx}{x}.\end{split}

Values at removable singularities are limits. In Drappeau’s notation the corresponding transforms are −4⁢ϕ^-4\widehat{\phi}, 2⁢π⁢ϕˇ2\pi\check{\phi}, and 4⁢ik⁢ϕ~⁢(k−1)4i^{k}\widetilde{\phi}(k-1).

Theorem 2.8 and Section 3 use the following identity. Let q=r⁢sq=rs, (r,s)=1(r,s)=1, and r>1r>1; take

(2.13) σ1/s=(r0s⁢r1/r),𝒞⁢(∞,1/s)={γ=c⁢s⁢r:c≥1,(c,r)=1}.\sigma_{1/s}=\begin{pmatrix}\sqrt{r}&0\\ s\sqrt{r}&1/\sqrt{r}\end{pmatrix},\qquad\mathcal{C}(\infty,1/s)=\{\gamma=cs% \sqrt{r}:c\geq 1,(c,r)=1\}.

The scaling matrix and admissible moduli in (2.13) are also given in [5, (1.6) and (2.4)] and [9, Lemma 4.3]. Since r>1r>1, the cusps ∞\infty and 1/s1/s are inequivalent. Hence the same-sign identity has no diagonal term. If a matrix in Γ0⁢(r⁢s)\Gamma_{0}(rs) maps ∞\infty to the reduced fraction 1/s1/s, its lower-left entry is ±s\pm s. Then r⁢s∣srs\mid s, so r=1r=1. Every application here has r>R≥1r>R\geq 1. For m,n≥1m,n\geq 1, put 𝒦±⁢(m,n)=∑γ∈𝒞γ−1⁢S∞,1/s⁢(m,±n;γ)⁢ϕ⁢(4⁢π⁢m⁢n/γ)\mathcal{K}_{\pm}(m,n)=\sum_{\gamma\in\mathcal{C}}\gamma^{-1}S_{\infty,1/s}(m,% \pm n;\gamma)\phi(4\pi\sqrt{mn}/\gamma). In the DI coefficients, Drappeau’s formulas read

(2.14) 𝒦+⁢(m,n)=1π⁢∑k≥2k⁢evenik⁢(k−1)!⁢(4⁢π⁢m⁢n)1−k⁢ϕ~⁢(k−1)⁢∑fψf⁢(∞,m)¯⁢ψf⁢(1/s,n)−∑jϕ^⁢(κj)cosh⁡π⁢κj⁢ρj⁢∞⁢(m)¯⁢ρj,1/s⁢(n)−1π⁢∑𝔠∫ℝϕ^⁢(t)⁢(n/m)i⁢t⁢φ𝔠⁢∞⁢m⁢(1/2+i⁢t)¯⁢φ𝔠,1/s,n⁢(1/2+i⁢t)⁢𝑑t,𝒦−⁢(m,n)=π2⁢∑jϕˇ⁢(κj)cosh⁡π⁢κj⁢ρj⁢∞⁢(m)¯⁢ρj,1/s⁢(−n)+12⁢∑𝔠∫ℝϕˇ⁢(t)⁢(n/m)i⁢t⁢φ𝔠⁢∞⁢m⁢(1/2+i⁢t)¯⁢φ𝔠,1/s,−n⁢(1/2+i⁢t)⁢𝑑t.\begin{split}\mathcal{K}_{+}(m,n)&=\frac{1}{\pi}\sum_{\begin{subarray}{c}k\geq 2% \\ k\ {\rm even}\end{subarray}}i^{k}(k-1)!(4\pi\sqrt{mn})^{1-k}\widetilde{\phi}(k% -1)\sum_{f}\overline{\psi_{f}(\infty,m)}\psi_{f}(1/s,n)\\ &\quad-\sum_{j}\frac{\widehat{\phi}(\kappa_{j})}{\cosh\pi\kappa_{j}}\overline{% \rho_{j\infty}(m)}\rho_{j,1/s}(n)\\ &\quad-\frac{1}{\pi}\sum_{\mathfrak{c}}\int_{\mathbb{R}}\widehat{\phi}(t)(n/m)% ^{it}\overline{\varphi_{\mathfrak{c}\infty m}(1/2+it)}\varphi_{\mathfrak{c},1/% s,n}(1/2+it)\,dt,\\[5.69054pt] \mathcal{K}_{-}(m,n)&=\frac{\pi}{2}\sum_{j}\frac{\check{\phi}(\kappa_{j})}{% \cosh\pi\kappa_{j}}\overline{\rho_{j\infty}(m)}\rho_{j,1/s}(-n)\\ &\quad+\frac{1}{2}\sum_{\mathfrak{c}}\int_{\mathbb{R}}\check{\phi}(t)(n/m)^{it% }\overline{\varphi_{\mathfrak{c}\infty m}(1/2+it)}\varphi_{\mathfrak{c},1/s,-n% }(1/2+it)\,dt.\end{split}

The proof uses only the identities (2.7.T16)–(2.7.T18), derived in §2.7.2. The continuous integrals carry plain d⁢tdt. Let αm,βn\alpha_{m},\beta_{n} be finite sequences. Multiply (2.14) by αm⁢βn\alpha_{m}\beta_{n}, sum in (m,n)(m,n), then take spectral absolute values and apply Cauchy–Schwarz. The first functional is L1⁢(u)=∑mαm¯⁢ρu⁢∞⁢(m)L_{1}(u)=\sum_{m}\overline{\alpha_{m}}\rho_{u\infty}(m). The spectral product is L1⁢(u)¯⁢∑nβn⁢ρu,1/s⁢(±n)\overline{L_{1}(u)}\sum_{n}\beta_{n}\rho_{u,1/s}(\pm n).

2.3. BFI and the classical progression estimates

For a finitely supported sequence ff, define

(2.15) Δf⁢(q,a)=∑n≡a⁢(q)f⁢(n)−1φ⁢(q)⁢∑(n,q)=1f⁢(n),(a,q)=1.\Delta_{f}(q,a)=\sum_{n\equiv a\ (q)}f(n)-\frac{1}{\varphi(q)}\sum_{(n,q)=1}f(% n),\qquad(a,q)=1.

The notation of [6, (1.1)] writes Δf⁢(x;q,a)\Delta_{f}(x;q,a) for (2.15) with both sums cut at n≤xn\leq x.

The progression estimates are from Bombieri, Friedlander and Iwaniec [6]. We use [6, (A2), Theorem 0(a), and proof of Theorem 0(a)].

BFI hypothesis (A2) [6, (A2)]. Fix Bβ>0B_{\beta}>0 for the sequence family. Let β\beta be in the family, with support parameter N≥2N\geq 2. For every d,k≥1d,k\geq 1 and integer ℓ≠0\ell\neq 0 with (ℓ,k)=1(\ell,k)=1, and for every A>0A>0, there is CAC_{A} with

(2.16) |∑n≡ℓ⁢(k)(n,d)=1βn−1φ⁢(k)⁢∑(n,d⁢k)=1βn|≤CA⁢‖β‖2⁢N1/2⁢τ⁢(d)Bβ⁢(log⁡(2⁢N))−A.\left|\sum_{\begin{subarray}{c}n\equiv\ell\ (k)\\ (n,d)=1\end{subarray}}\beta_{n}-\frac{1}{\varphi(k)}\sum_{(n,dk)=1}\beta_{n}% \right|\leq C_{A}\|\beta\|_{2}N^{1/2}\tau(d)^{B_{\beta}}(\log(2N))^{-A}.

The CAC_{A} are independent of N,d,k,ℓN,d,k,\ell and of β\beta in the family. As in [6], dd and kk run over all positive integers. If ‖β‖22≥N⁢(log⁡2⁢N)−B′\|\beta\|_{2}^{2}\geq N(\log 2N)^{-B^{\prime}} for a fixed B′B^{\prime}, then a bound CA⁢N⁢τ⁢(d)Bβ⁢(log⁡2⁢N)−(A+B′/2)C_{A}N\tau(d)^{B_{\beta}}(\log 2N)^{-(A+B^{\prime}/2)} implies (2.16), after adjusting the constant.

Theorem 2.4 ([6, Theorem 0(a), (2.2)]). Let βn\beta_{n} be supported on n≤Nn\leq N, N≥2N\geq 2, and satisfy (2.16). For every A>0A>0, there is B1>0B_{1}>0 such that, uniformly for Q≤N⁢(log⁡N)−B1Q\leq N(\log N)^{-B_{1}},

(2.17) ∑q≤Q∑amodq(a,q)=1|Δβ⁢(q,a)|2≪‖β‖22⁢N⁢(log⁡N)−A.\sum_{q\leq Q}\ \sum_{\begin{subarray}{c}a\bmod q\\ (a,q)=1\end{subarray}}|\Delta_{\beta}(q,a)|^{2}\ll\|\beta\|_{2}^{2}N(\log N)^{% -A}.

The constants depend on A,BβA,B_{\beta} and the constants in (2.16). For a sequence on N<n≤2⁢NN<n\leq 2N, replace NN by 2⁢N2N in (2.17).

[6, Theorem 0(b)] is not used; its discrepancy has the cutoff n≤xn\leq x of [6, (1.1)], while (2.15) is a full-support discrepancy. The switched bilinear form uses the full-support bound (3.49), proved from (3.25), (3.48) and Theorem 2.4.

That bound uses [6, (1.6)]. Let ch∈ℂc_{h}\in\mathbb{C} be supported on 1≤h≤H1\leq h\leq H. The large sieve gives

(2.19) ∑q≤Q∑χmodqprimitive|∑hch⁢χ⁢(h)|2≪(Q2+H)⁢‖c‖22.\sum_{q\leq Q}\sum_{\chi\bmod q}^{\rm primitive}\left|\sum_{h}c_{h}\chi(h)% \right|^{2}\ll(Q^{2}+H)\|c\|_{2}^{2}.

We use this initial-interval form with HH the upper support bound.

Bombieri–Vinogradov input. Write ψ⁢(y;q,a)=∑n≤y,n≡a⁢(q)Λ⁢(n)\psi(y;q,a)=\sum_{n\leq y,n\equiv a\ (q)}\Lambda(n). For every A>0A>0 there is B=B⁢(A)>0B=B(A)>0 such that, for y≥3y\geq 3 and Q≤y1/2⁢(log⁡y)−BQ\leq y^{1/2}(\log y)^{-B},

(2.20) ∑q≤Qmax(a,q)=1⁡|ψ⁢(y;q,a)−yφ⁢(q)|≪Ay⁢(log⁡y)−A.\sum_{q\leq Q}\max_{(a,q)=1}\left|\psi(y;q,a)-\frac{y}{\varphi(q)}\right|\ll_{% A}y(\log y)^{-A}.

This is BFI’s formulation of the Bombieri–Vinogradov theorem [6, (1.4)]; compare the original results [2, 3]. The maximum allows the varying reduced residue a=Nmodqa=N\bmod q. We apply (2.20) at each endpoint separately, with its own level inequality. Thus (2.20) is used at fixed yy only.

Siegel–Walfisz input. We use the power-log form of [17, Corollary 5.29]. Remove prime powers and sum by parts. Let C>0C>0 and A>0A>0 be fixed. For y≥3y\geq 3, q≤(log⁡y)Cq\leq(\log y)^{C} and (a,q)=1(a,q)=1,

(2.21) π⁢(y;q,a)=Li⁡(y)φ⁢(q)+OA,C⁢(y⁢(log⁡y)−A).\pi(y;q,a)=\frac{\operatorname{Li}(y)}{\varphi(q)}+O_{A,C}\bigl{(}y(\log y)^{-% A}\bigr{)}.

The constant is uniform in reduced aa and is ineffective. Subtraction at two comparable endpoints keeps any fixed logarithmic saving. We use (2.21) with this power-log error. Three further forms need their own proofs. The first saves a power of the interval length. The second keeps the tensor and coprimality structure of the structured sequences. The third is localized to one dyadic box of the Heath–Brown decomposition. Section 3 proves the short-interval estimates and those for its structured sequences.

2.4. The linear sieve and its structured remainder

Let 𝒜\mathcal{A} be a finite integer sequence with nonnegative multiplicities. Let 𝒫\mathcal{P} be a prime set. Put

(2.22) P⁢(z)=∏p<zp∈𝒫p,S⁢(𝒜,𝒫,z)=∑a∈𝒜1(a,P⁢(z))=1,|𝒜d|=ω⁢(d)d⁢X+r⁢(𝒜,d).P(z)=\prod_{\begin{subarray}{c}p<z\\ p\in\mathcal{P}\end{subarray}}p,\quad S(\mathcal{A},\mathcal{P},z)=\sum_{a\in% \mathcal{A}}1_{(a,P(z))=1},\quad|\mathcal{A}_{d}|=\frac{\omega(d)}{d}X+r(% \mathcal{A},d).

Here X>0X>0 and ω\omega is multiplicative. Require 0<ω⁢(p)<p0<\omega(p)<p for p∈𝒫p\in\mathcal{P}. Set ω⁢(p)=0\omega(p)=0 for excluded primes. Set V⁢(z)=∏p<z,p∈𝒫(1−ω⁢(p)/p)V(z)=\prod_{p<z,p\in\mathcal{P}}(1-\omega(p)/p). Use the continuous linear-sieve solutions

(2.23) s⁢F⁢(s)=2⁢eγ(0<s≤3),s⁢f⁢(s)=0(0<s≤2),(s⁢F⁢(s))′=f⁢(s−1)(s>3),(s⁢f⁢(s))′=F⁢(s−1)(s>2).\begin{gathered}sF(s)=2e^{\gamma}\quad(0<s\leq 3),\qquad sf(s)=0\quad(0<s\leq 2% ),\\ (sF(s))^{\prime}=f(s-1)\quad(s>3),\qquad(sf(s))^{\prime}=F(s-1)\quad(s>2).\end% {gathered}

On s≥1s\geq 1, FF decreases to 1. Also ff increases to 1, with f=0f=0 through s=2s=2. In particular F⁢(1)=2⁢eγF(1)=2e^{\gamma}. We use this endpoint when the level is at least the sifting limit.

Let KM≥2K_{\mathrm{M}}\geq 2 be one fixed absolute constant such that, for all z>w≥2z>w\geq 2,

∏w≤p<z(1−1p)−1≤log⁡zlog⁡w⁢(1+KMlog⁡w).\prod_{w\leq p<z}\left(1-\frac{1}{p}\right)^{-1}\leq\frac{\log z}{\log w}\left% (1+\frac{K_{\mathrm{M}}}{\log w}\right).

Such a constant exists by Mertens’ product estimate, after increasing it to cover bounded ww.

Theorem 2.5 ([11, Theorem 1], dimension one). Suppose, for some fixed K≥2K\geq 2 and every z>w≥2z>w\geq 2,

(2.24) ∏w≤p<zp∈𝒫(1−ω⁢(p)/p)−1≤log⁡zlog⁡w⁢(1+Klog⁡w).\prod_{\begin{subarray}{c}w\leq p<z\\ p\in\mathcal{P}\end{subarray}}(1-\omega(p)/p)^{-1}\leq\frac{\log z}{\log w}% \left(1+\frac{K}{\log w}\right).

Let y≥z≥2y\geq z\geq 2 and s=log⁡y/log⁡zs=\log y/\log z. Then

(2.25) S⁢(𝒜,𝒫,z)≤X⁢V⁢(z)⁢{F⁢(s)+eK⁢Q1⁢(s)⁢(log⁡y)−1/3}+∑d<yd∣P⁢(z)|r⁢(𝒜,d)|,S⁢(𝒜,𝒫,z)≥X⁢V⁢(z)⁢{f⁢(s)−eK⁢Q1⁢(s)⁢(log⁡y)−1/3}−∑d<yd∣P⁢(z)|r⁢(𝒜,d)|,\begin{split}S(\mathcal{A},\mathcal{P},z)&\leq XV(z)\{F(s)+e^{\sqrt{K}}Q_{1}(s% )(\log y)^{-1/3}\}+\sum_{\begin{subarray}{c}d<y\\ d\mid P(z)\end{subarray}}|r(\mathcal{A},d)|,\\ S(\mathcal{A},\mathcal{P},z)&\geq XV(z)\{f(s)-e^{\sqrt{K}}Q_{1}(s)(\log y)^{-1% /3}\}-\sum_{\begin{subarray}{c}d<y\\ d\mid P(z)\end{subarray}}|r(\mathcal{A},d)|,\end{split}

where, for s≥1s\geq 1,

(2.26) Q1⁢(s)≤exp⁡{−s⁢log⁡s+s⁢log⁡log⁡(3⁢s)+O⁢(s)}.Q_{1}(s)\leq\exp\{-s\log s+s\log\log(3s)+O(s)\}.

See [11]. The hypotheses are (1.1)–(1.3), and Theorem 1 is (1.4)–(1.6). The dimension-one constants β=2\beta=2 and A=2⁢eγA=2e^{\gamma} appear in [11, p. 176]; the source states B=0B=0 in [11, p. 173]. For s≤2s\leq 2 the lower main function in (2.25) vanishes. Hence its lower main term is nonpositive.

For the later prime set 𝒫N={p:p∤2⁢N}\mathcal{P}_{N}=\{p:p\nmid 2N\}, take the multiplicative function with ω⁢(p)=1\omega(p)=1 on 𝒫N\mathcal{P}_{N}, ω⁢(p)=0\omega(p)=0 off it, and ω⁢(pa)=0\omega(p^{a})=0 for a≥2a\geq 2. Its product in (2.24) is over a subset of all primes in [w,z)[w,z), so (2.24) holds uniformly in NN with the fixed value K=KMK=K_{\mathrm{M}}. The same data satisfy (2.27) with Lω=2L_{\omega}=2. Thus, whenever (2.25) is specialized to this set, its factor is eKMe^{\sqrt{K_{\mathrm{M}}}}. This is fixed; combining it with (2.26) changes only the absolute constant in the O⁢(s)O(s) term there. This ω\omega is a nominal sieve density: by Theorem 2.6 the constructed coefficients are independent of 𝒜\mathcal{A}, XX, and ω\omega.

The structured remainder is from [10, Theorem 4].

Assume (2.24) and nonnegativity of ω\omega on prime powers. Fix Lω>1L_{\omega}>1. Assume, for all z>w≥2z>w\geq 2,

(2.27) ∑w≤p<zp∈𝒫∑a≥2ω⁢(pa)pa≤Lωlog⁡(3⁢w).\sum_{\begin{subarray}{c}w\leq p<z\\ p\in\mathcal{P}\end{subarray}}\sum_{a\geq 2}\frac{\omega(p^{a})}{p^{a}}\leq% \frac{L_{\omega}}{\log(3w)}.

These are [10, (1)–(2)] in dimension one, with L=LωL=L_{\omega}.

Fix 0<ϵs<1/30<\epsilon_{s}<1/3 and D≥2D\geq 2. Put δs=ϵs9\delta_{s}=\epsilon_{s}^{9} and

(2.28) 𝒢⁢(D)={Dϵs2⁢(1+δs)n:n≥0}.\mathcal{G}(D)=\{D^{\epsilon_{s}^{2}(1+\delta_{s})^{n}}:n\geq 0\}.

Let ℋ⁢(D)\mathcal{H}(D) consist of tuples 𝐃=(D1,…,Dρ)\mathbf{D}=(D_{1},\ldots,D_{\rho}) from this grid with Dρ≤⋯≤D1<D1/2D_{\rho}\leq\cdots\leq D_{1}<D^{1/2}. Define

(2.29) 𝒟+⁢(D)={𝐃∈ℋ⁢(D):D1⁢⋯⁢D2⁢l⁢D2⁢l+13<D(0≤l≤(ρ−1)/2)},𝒟−⁢(D)={𝐃∈ℋ⁢(D):D1⁢⋯⁢D2⁢l−1⁢D2⁢l3<D(1≤l≤ρ/2)}.\begin{split}\mathcal{D}^{+}(D)&=\{\mathbf{D}\in\mathcal{H}(D):D_{1}\cdots D_{% 2l}D_{2l+1}^{3}<D\quad(0\leq l\leq(\rho-1)/2)\},\\ \mathcal{D}^{-}(D)&=\{\mathbf{D}\in\mathcal{H}(D):D_{1}\cdots D_{2l-1}D_{2l}^{% 3}<D\quad(1\leq l\leq\rho/2)\}.\end{split}

[10, Theorem 4] gives |𝒟+|,|𝒟−|<exp⁡(8⁢ϵs−3)|\mathcal{D}^{+}|,|\mathcal{D}^{-}|<\exp(8\epsilon_{s}^{-3}). This bound follows the definitions of 𝒟+\mathcal{D}^{+} and 𝒟−\mathcal{D}^{-}. The grid is built from the relative level of each application.

Theorem 2.6 (from [10, Theorem 4], with R=1R=1). Assume (2.22), (2.24), (2.27), with the parameters above. Then there are coefficients ϕd±\phi_{d}^{\pm} and λd±⁢(𝐃)\lambda_{d}^{\pm}(\mathbf{D}) of modulus at most 1. They are independent of 𝒜,X,ω\mathcal{A},X,\omega. They satisfy

(2.30) S⁢(𝒜,𝒫,z)\displaystyle S(\mathcal{A},\mathcal{P},z) ≤X⁢V⁢(z)⁢(F⁢(s)+Es)+R1++R+\displaystyle\leq XV(z)(F(s)+E_{s})+R_{1}^{+}+R^{+} (2≤z≤D),\displaystyle(2\leq z\leq D),
S⁢(𝒜,𝒫,z)\displaystyle S(\mathcal{A},\mathcal{P},z) ≥X⁢V⁢(z)⁢(f⁢(s)−Es)−R1−−R−\displaystyle\geq XV(z)(f(s)-E_{s})-R_{1}^{-}-R^{-} (2≤z≤D1/2),\displaystyle(2\leq z\leq D^{1/2}),

where s=log⁡D/log⁡zs=\log D/\log z and

(2.31) Es≪ϵs+ϵs−8⁢eK+Lω⁢(log⁡D)−1/3,E_{s}\ll\epsilon_{s}+\epsilon_{s}^{-8}e^{K+L_{\omega}}(\log D)^{-1/3},

with an absolute implied constant. [10, Theorem 4] contains eK+Le^{K+L}. For the coefficient construction used here, the prime set and multiplicative function just specified give K=KMK=K_{\mathrm{M}} and Lω=2L_{\omega}=2. Hence (2.31) has the fixed factor eKM+2e^{K_{\mathrm{M}}+2}; it is retained in the formula and may be absorbed into the implied constant. The prime-power dependence comes from its (2), namely (2.27). In its estimate (31), put u=Dϵs2u=D^{\epsilon_{s}^{2}}. Then

U=∑u≤p<zp∈𝒫∑a≥2ω⁢(pa)pa≤Lω,∏u≤p<zp∈𝒫{(1−ω⁢(p)p)⁢∑a≥0ω⁢(pa)pa}≤eU.U=\sum_{\begin{subarray}{c}u\leq p<z\\ p\in\mathcal{P}\end{subarray}}\sum_{a\geq 2}\frac{\omega(p^{a})}{p^{a}}\leq L_% {\omega},\qquad\prod_{\begin{subarray}{c}u\leq p<z\\ p\in\mathcal{P}\end{subarray}}\left\{\left(1-\frac{\omega(p)}{p}\right)\sum_{a% \geq 0}\frac{\omega(p^{a})}{p^{a}}\right\}\leq e^{U}.

For the first bound use max⁡{2,u}\max\{2,u\} in (2.27). An empty prime interval contributes zero. The second bound follows factor by factor. Thus eU≤eLωe^{U}\leq e^{L_{\omega}} bounds the extra prime-power factors in the nonsquarefree terms. Formula (2.31) keeps the factor eK+Lωe^{K+L_{\omega}} of the source. The signed remainders are

(2.32) R1ν=∑d<Dϵsd∣P⁢(Dϵs2)ϕdν⁢r⁢(𝒜,d),R_{1}^{\nu}=\sum_{\begin{subarray}{c}d<D^{\epsilon_{s}}\\ d\mid P(D^{\epsilon_{s}^{2}})\end{subarray}}\phi_{d}^{\nu}r(\mathcal{A},d),
(2.33) Rν=∑𝐃∈𝒟ν⁢(D)∑d<Dϵsd∣P⁢(Dϵs2)λdν⁢(𝐃)⁢∑Di≤pi<Di1+δspi∣P⁢(z)pi≠pj⁢((i,j)∈I⁢(𝐃))r⁢(𝒜,d⁢p1⁢⋯⁢pρ).R^{\nu}=\sum_{\mathbf{D}\in\mathcal{D}^{\nu}(D)}\sum_{\begin{subarray}{c}d<D^{% \epsilon_{s}}\\ d\mid P(D^{\epsilon_{s}^{2}})\end{subarray}}\lambda_{d}^{\nu}(\mathbf{D})\sum_% {\begin{subarray}{c}D_{i}\leq p_{i}<D_{i}^{1+\delta_{s}}\\ p_{i}\mid P(z)\\ p_{i}\neq p_{j}\ ((i,j)\in I(\mathbf{D}))\end{subarray}}r(\mathcal{A},dp_{1}% \cdots p_{\rho}).

The sets I⁢(𝐃)I(\mathbf{D}) impose distinctness on equal-label tail positions. Unequal grid intervals are disjoint. Coefficients may be zero on unused tuples. They depend only on 𝒫,D,z,ϵs,𝐃\mathcal{P},D,z,\epsilon_{s},\mathbf{D} and the distinctness conditions. In particular they are independent of 𝒜,X,ω\mathcal{A},X,\omega. They may change with the level or the cutoff.

[10, Theorem 4] holds for general R≥1R\geq 1, 0<ϵs<3−R0<\epsilon_{s}<3^{-R}, with the respective ranges in (2.30). Its preceding combinatorial identities give S≤WR+S\leq W_{R}^{+} and S≥WR−S\geq W_{R}^{-}. The coefficients come from [10, (23)–(25), (26), and Lemma 4]; these formulas also show their independence of the sequence.

Relative-level grid. Choose 0<σ≤10−100<\sigma\leq 10^{-10} first, and put τ=σ9\tau=\sigma^{9}. For any level Lc≥2L_{c}\geq 2, substitute

(2.33a) ϵs=σ,D=Lc,δs=ϵs9=σ9=τ.\epsilon_{s}=\sigma,\qquad D=L_{c},\qquad\delta_{s}=\epsilon_{s}^{9}=\sigma^{9% }=\tau.

Then, term for term,

(2.33b) 𝒢⁢(D)={Lcσ2⁢(1+τ)n:n≥0},Dϵs2=Lcσ2,Dϵs=Lcσ.\mathcal{G}(D)=\{L_{c}^{\sigma^{2}(1+\tau)^{n}}:n\geq 0\},\qquad D^{\epsilon_{% s}^{2}}=L_{c}^{\sigma^{2}},\qquad D^{\epsilon_{s}}=L_{c}^{\sigma}.

Thus the labels, half-open prime intervals, smooth-prime cutoff, and smooth-divisor support agree term by term with (2.32)–(2.33). These are the Iwaniec parameters at level LcL_{c}, and the tuple conditions (2.29) are unchanged. With this τ\tau, Theorem 2.6 applies as stated. In the application to (W), Section 5 takes Lc=D=NθL_{c}=D=N^{\theta}, so the grid there is exactly the global grid in Theorem 1.2. The coefficients are the values supplied by Iwaniec’s construction for (𝒫,Lc,σ,𝐃)(\mathcal{P},L_{c},\sigma,\mathbf{D}) at the cutoff zz of the application, here z=Nuz=N^{u}. The cutoff also restricts the prime variables in (2.33). The proof uses only the bound |⋅|≤1|\cdot|\leq 1 and the support of these coefficients. It never compares coefficient values at different cutoffs.

[10, Lemma 3] gives (F,f)(F,f) with error O⁢(eK−s⁢(log⁡D)−1/3)O(e^{\sqrt{K}-s}(\log D)^{-1/3}). In its use here the sieve constant is K=KMK=K_{\mathrm{M}}, fixed independently of N,D,zN,D,z. Therefore eKMe^{\sqrt{K_{\mathrm{M}}}} is absorbed into the implied constant, and the error is O⁢(e−s⁢(log⁡D)−1/3)O(e^{-s}(\log D)^{-1/3}) with that fixed constant. Likewise, in the profile (2.26), this multiplier changes only its absolute O⁢(s)O(s) constant. The lemma cites [11, Lemmas 18 and 20]. Theorem 4 includes the closed endpoints z=Dz=D and z=D1/2z=D^{1/2} of (2.30), although [11, Lemma 20] has strict inequalities.

2.5. The fundamental lemma, Weil bound, and Heath–Brown identity

Fundamental lemma (cf. [6, Lemma 4]; the prime-support condition is explicit in [18, Lemma 5]). Let D≥2D\geq 2, s≥3s\geq 3 and z=D1/sz=D^{1/s}. Let P⁢(z)P(z) be the product of all primes below zz. There are λd±\lambda_{d}^{\pm}, supported on d≤Dd\leq D, d∣P⁢(z)d\mid P(z), with λ1±=1\lambda_{1}^{\pm}=1, |λd±|≤1|\lambda_{d}^{\pm}|\leq 1 and

(λ−∗1)⁢(n)=(λ+∗1)⁢(n)=1if ⁢(n,P⁢(z))=1,(\lambda^{-}*1)(n)=(\lambda^{+}*1)(n)=1\quad\text{if }(n,P(z))=1,
(λ−∗1)⁢(n)≤0≤(λ+∗1)⁢(n)otherwise,(\lambda^{-}*1)(n)\leq 0\leq(\lambda^{+}*1)(n)\quad\text{otherwise},
(2.34) ∑d≤Dλd±d\displaystyle\sum_{d\leq D}\frac{\lambda_{d}^{\pm}}{d} =∏p<z(1−1/p)\displaystyle=\prod_{p<z}(1-1/p)
×{1+O⁢(e−s)}.\displaystyle\quad{}\times\{1+O(e^{-s})\}.

The support d∣P⁢(z)d\mid P(z) means that every supported dd is squarefree and uses only primes below zz. In (2.34), this makes (λ±∗1)⁢(n)=∑d∣(n,P⁢(z))λd±(\lambda^{\pm}*1)(n)=\sum_{d\mid(n,P(z))}\lambda_{d}^{\pm} a sum over exactly the sieving divisors: if (n,P⁢(z))=1(n,P(z))=1, only d=1d=1 contributes, and otherwise FI78’s divisor-sum signs apply to g=(n,P⁢(z))g=(n,P(z)). The support is also used in the remainder sum in (2.25). The explicit Bonferroni weights in (3.102)–(3.104) use the same support to sieve only primes in 𝒫\mathcal{P} below zz and to obtain the stated divisor count. For the AA37 weights in (W), the corresponding condition d∣PN⁢(Y)d\mid P_{N}(Y) separates the smooth divisor, whose primes are below YY, from tail primes pi≥Di≥Yp_{i}\geq D_{i}\geq Y. This is used in the unique recovery of dd in the proof of the slot identity (4.13) and in Appendix B, Lemma B.1.

The error O⁢(e−s)O(e^{-s}) suffices below. Removing the primes of an auxiliary modulus changes the local Euler product and needs its own argument. The rough-integer estimates below use explicit Brun–Bonferroni weights; see also [30]. The Iwaniec endpoint s=1s=1 follows from Theorem 2.6.

Weil input. For every c≥1c\geq 1 and u,v∈ℤu,v\in\mathbb{Z}, define

S⁢(u,v;c)=∑xmodc,(x,c)=1e⁢((u⁢x+v⁢x¯)/c).S(u,v;c)=\sum_{x\bmod c,(x,c)=1}e((ux+v\bar{x})/c).

The required bound is

(2.35) |S⁢(u,v;c)|≤τ⁢(c)⁢(u,v,c)1/2⁢c1/2.|S(u,v;c)|\leq\tau(c)(u,v,c)^{1/2}c^{1/2}.

This is the Weil–Estermann bound with full gcd. Its gcd factor covers nonprimitive indices; see [17, Corollary 11.12]. In (2.14), (2.35) serves for absolute convergence. Each quantitative application keeps the gcd and modulus factors in its sums. For prime moduli this is Weil’s bound; prime powers use Estermann’s bound, and the general modulus follows by the Chinese remainder theorem.

Lemma 2.7 (the exact Heath–Brown identity used here). Let X≥2X\geq 2, K≥1K\geq 1 be an integer, and let z≥1z\geq 1 satisfy zK>Xz^{K}>X. Then for every integer 1≤n≤X1\leq n\leq X,

(2.36) Λ⁢(n)=∑j=1K(−1)j−1⁢(Kj)⁢∑m1⁢⋯⁢mj⁢n1⁢⋯⁢nj=nmi≤zμ⁢(m1)⁢⋯⁢μ⁢(mj)⁢log⁡n1.\Lambda(n)=\sum_{j=1}^{K}(-1)^{j-1}\binom{K}{j}\sum_{\begin{subarray}{c}m_{1}% \cdots m_{j}n_{1}\cdots n_{j}=n\\ m_{i}\leq z\end{subarray}}\mu(m_{1})\cdots\mu(m_{j})\log n_{1}.

The identity is [12, Lemma 1, (6)].

Equation (2.36) is algebraic. For ℜ⁡s>1\Re s>1, set Mz⁢(s)=∑m≤zμ⁢(m)⁢m−sM_{z}(s)=\sum_{m\leq z}\mu(m)m^{-s}, Y⁢(s)=ζ⁢(s)⁢Mz⁢(s)Y(s)=\zeta(s)M_{z}(s). The coefficients of Y−1Y-1 vanish at indices 1≤n≤z1\leq n\leq z. The polynomial identity 1−(1−Y)K=∑j=1K(−1)j−1⁢(Kj)⁢Yj1-(1-Y)^{K}=\sum_{j=1}^{K}(-1)^{j-1}\binom{K}{j}Y^{j} gives

(2.37) −ζ′ζ=∑j=1K(−1)j−1⁢(Kj)⁢(−ζ′)⁢ζj−1⁢Mzj+(−ζ′ζ)⁢(1−Y)K.-\frac{\zeta^{\prime}}{\zeta}=\sum_{j=1}^{K}(-1)^{j-1}\binom{K}{j}(-\zeta^{% \prime})\zeta^{j-1}M_{z}^{j}+\left(-\frac{\zeta^{\prime}}{\zeta}\right)(1-Y)^{% K}.

Each nonzero factor from Y−1Y-1 has index >z>z. Hence the last term has no coefficient of index n≤Xn\leq X. Coefficient extraction proves (2.36). For the order-three decomposition on n≤2⁢Xmn\leq 2X_{m}, take K=3K=3, z=2⁢Xm1/3z=2X_{m}^{1/3}. Then z3=8⁢Xm>2⁢Xmz^{3}=8X_{m}>2X_{m}. The Möbius variables have support mi≤2⁢Xm1/3m_{i}\leq 2X_{m}^{1/3}. Dyadic restrictions are imposed after this identity. Coefficient extraction preserves both product constraints and prime ordering.

2.6. Theorem 2.8

Theorem 2.8 belongs to the line of incomplete-Kloosterman estimates of [5, Theorem 12] and [9, Theorem 2.1]; Drappeau states that his theorem extends DI82 Theorem 12. The closest refined quintilinear estimate is [1, Theorem 1.8, (1.8)–(1.9)]. Lichtman identifies [23, 24] as antecedents for the exceptional-spectrum and residue-dependence refinements. The statements are not identical: the hypotheses (2.38)–(2.40) and bound (2.42) are the variant proved here from (2.14) in §2.7. Section 3 uses the full bound (2.42) in (3.14)–(3.15).

Theorem 2.8. Let C,D,N,R,S≥1C,D,N,R,S\geq 1, A≥1A\geq 1, and 0<ϵ0<1/1000<\epsilon_{0}<1/100. Let bn,r,s∈ℂb_{n,r,s}\in\mathbb{C} be supported on

(2.38) 0<n≤N,R<r≤2⁢R,S<s≤2⁢S.0<n\leq N,\qquad R<r\leq 2R,\qquad S<s\leq 2S.

Let g:ℝ>05⟶ℂg:\mathbb{R}_{>0}^{5}\longrightarrow\mathbb{C} be smooth, supported in

(C,2⁢C]×(D,2⁢D]×ℝ>03.(C,2C]\times(D,2D]\times\mathbb{R}_{>0}^{3}.

For each multi-index ν=(ν1,…,ν5)∈ℤ≥05\nu=(\nu_{1},\ldots,\nu_{5})\in\mathbb{Z}_{\geq 0}^{5}, assume

(2.39) |∂νg⁢(c,d,n,r,s)|≤Gν⁢(c−ν1⁢d−ν2⁢n−ν3⁢r−ν4⁢s−ν5)1−ϵ0.|\partial^{\nu}g(c,d,n,r,s)|\leq G_{\nu}\bigl{(}c^{-\nu_{1}}d^{-\nu_{2}}n^{-% \nu_{3}}r^{-\nu_{4}}s^{-\nu_{5}}\bigr{)}^{1-\epsilon_{0}}.

The GνG_{\nu} are uniform in the family. Let a∈ℤa\in\mathbb{Z} satisfy 0<|a|≤A0<|a|\leq A, and require

(2.40) bn,r,s=0unless ⁢(a,r⁢s)=1.b_{n,r,s}=0\quad\text{unless }(a,rs)=1.

Set 𝒳=2+A⁢C⁢D⁢N⁢R⁢S\mathcal{X}=2+ACDNRS. For every ϵ>0\epsilon>0,

(2.41) |∑(r,s)=1∑0<n≤Nbn,r,s⁢∑c,d≥1(r⁢d,s⁢c)=1g⁢(c,d,n,r,s)⁢e⁢(a⁢n⁢r⁢d¯s⁢c)|≪ϵ,ϵ0,{Gν}𝒳ϵ+18⁢ϵ0⁢J∗⁢(a),\begin{split}&\left|\sum_{(r,s)=1}\sum_{0<n\leq N}b_{n,r,s}\sum_{\begin{% subarray}{c}c,d\geq 1\\ (rd,sc)=1\end{subarray}}g(c,d,n,r,s)e\!\left(\frac{an\overline{rd}}{sc}\right)% \right|\\ &\qquad\ll_{\epsilon,\epsilon_{0},\{G_{\nu}\}}\mathcal{X}^{\epsilon+18\epsilon% _{0}}J_{*}(a),\end{split}

where the inverse is modulo s⁢csc, and

(2.42) J∗⁢(a)2=\displaystyle J_{*}(a)^{2}={} ∑n′′∣a∞n′′≤2⁢NAθKS⁢(n′′)θKS\displaystyle\sum_{\begin{subarray}{c}n^{\prime\prime}\mid a^{\infty}\\ n^{\prime\prime}\leq 2N\end{subarray}}A^{\theta_{\mathrm{KS}}}(n^{\prime\prime% })^{\theta_{\mathrm{KS}}}
×[C⁢S⁢(Nn′′+R⁢S)⁢(C+D⁢R)+|a|⁢N⁢R⁢S]⁢‖b~⁢(n′′)‖22\displaystyle\quad\times\Bigl{[}CS\Bigl{(}\frac{N}{n^{\prime\prime}}+RS\Bigr{)% }(C+DR)+|a|NRS\Bigr{]}\|\widetilde{b}(n^{\prime\prime})\|_{2}^{2}
+[CS(CDR)2⁢θKS(N+RS)1−θKS\displaystyle+\Bigl{[}CS(CD\sqrt{R})^{2\theta_{\mathrm{KS}}}(N+RS)^{1-\theta_{% \mathrm{KS}}}
×(C+DR)1−2⁢θKS+D2NR]∥b∥22.\displaystyle\qquad\times(C+DR)^{1-2\theta_{\mathrm{KS}}}+D^{2}NR\Bigr{]}\|b\|% _{2}^{2}.

Here n′′∣a∞n^{\prime\prime}\mid a^{\infty} if each prime factor of n′′n^{\prime\prime} divides aa. This includes n′′=1n^{\prime\prime}=1. Also

(2.43) ‖b‖22=∑n,r,s|bn,r,s|2,‖b~⁢(n′′)‖22=∑n′,r,s(n′,a)=1|bn′⁢n′′,r,s|2,\|b\|_{2}^{2}=\sum_{n,r,s}|b_{n,r,s}|^{2},\qquad\|\widetilde{b}(n^{\prime% \prime})\|_{2}^{2}=\sum_{\begin{subarray}{c}n^{\prime},r,s\\ (n^{\prime},a)=1\end{subarray}}|b_{n^{\prime}n^{\prime\prime},r,s}|^{2},

with bb extended by zero outside (2.38). When a=±1a=\pm 1, only n′′=1n^{\prime\prime}=1 occurs in (2.42). The implied constant depends only on the displayed parameters and the seminorm bounds GνG_{\nu}. It is uniform in (a,A,C,D,N,R,S,b)(a,A,C,D,N,R,S,b).

For (r,s)=1(r,s)=1, the condition (r⁢d,s⁢c)=1(rd,sc)=1 means (c,r)=1(c,r)=1 and (d,s⁢c)=1(d,sc)=1. Pairs with (c,s)>1(c,s)>1 are included, as are both signs of aa. The sequences and weights may be complex.

2.7. Proof of Theorem 2.8

The proof uses the large-sieve bounds above, the Hecke bounds of Kim–Sarnak and Deligne, and the trace formula (2.14). We derive the opposite-sign trace formula below.

In this subsection C,D,NT,RT,ST,AC,D,N_{T},R_{T},S_{T},A are the parameters of Theorem 2.8. Write R,S,N1R,S,N_{1} for RT,ST,NTR_{T},S_{T},N_{T}; Section 3 uses R,SR,S for other scales. Put

(2.7.T1) 𝒳=2+A⁢C⁢D⁢N1⁢R⁢S,Aa=|aT|,q=r⁢s,\displaystyle\mathcal{X}=2+ACDN_{1}RS,\quad A_{a}=|a_{T}|,\quad q=rs,
(r,s)=1,θKS=7/32,ϑj=2⁢i⁢κj∈(0,θKS]\displaystyle\quad(r,s)=1,\quad\theta_{\mathrm{KS}}=7/32,\quad\vartheta_{j}=2i% \kappa_{j}\in(0,\theta_{\mathrm{KS}}]

on an exceptional eigenspace. All norms below use counting measure. Spectral bases are Petersson-orthonormal.

2.7.1. Completion and separation

Fix n,r,s,cn,r,s,c, put k=s⁢ck=sc, and define g^c⁢(ξ)=∫g⁢(c,t,n,r,s)⁢e⁢(−ξ⁢t)⁢𝑑t\widehat{g}_{c}(\xi)=\int g(c,t,n,r,s)e(-\xi t)\,dt. Group dd in reduced classes modulo kk and apply Poisson summation. This gives the exact identity

(2.7.T2) ∑(d,k)=1g⁢(c,d,n,r,s)⁢e⁢(aT⁢n⁢r⁢d¯/k)=k−1⁢∑h∈ℤg^c⁢(h/k)⁢S⁢(h⁢r¯,aT⁢n;k).\sum_{(d,k)=1}g(c,d,n,r,s)e(a_{T}n\overline{rd}/k)=k^{-1}\sum_{h\in\mathbb{Z}}% \widehat{g}_{c}(h/k)S(h\bar{r},a_{T}n;k).

The zero frequency is bounded using |ck⁢(aT⁢n)|≤(aT⁢n,s)⁢(aT⁢n,c)|c_{k}(a_{T}n)|\leq(a_{T}n,s)(a_{T}n,c). Since ∑c≤2⁢C(u,c)≤2⁢C⁢τ⁢(u)\sum_{c\leq 2C}(u,c)\leq 2C\tau(u) and ∑s≤2⁢S(u,s)2≤4⁢S2⁢τ⁢(u)\sum_{s\leq 2S}(u,s)^{2}\leq 4S^{2}\tau(u), Cauchy–Schwarz gives its absolute contribution

(2.7.T3) ≪ϵ𝒳ϵ⁢D⁢(N1⁢R)1/2⁢‖b‖2.\ll_{\epsilon}\mathcal{X}^{\epsilon}D(N_{1}R)^{1/2}\|b\|_{2}.

This is the fourth term of (2.42).

Choose a small auxiliary exponent ϵ1>0\epsilon_{1}>0. Set

(2.7.T4) H=4⁢S⁢C⁢Dϵ0−1⁢𝒳ϵ1,ϵ2=ϵ1+ϵ0.H=4SCD^{\epsilon_{0}-1}\mathcal{X}^{\epsilon_{1}},\qquad\epsilon_{2}=\epsilon_% {1}+\epsilon_{0}.

Integrate by parts in dd. Use (2.39) in dd on d∈(D,2⁢D]d\in(D,2D]. For every ξ≠0\xi\neq 0 and j≥0j\geq 0, this gives |g^c⁢(ξ)|≪jD⁢(|ξ|⁢D1−ϵ0)−j|\widehat{g}_{c}(\xi)|\ll_{j}D(|\xi|D^{1-\epsilon_{0}})^{-j}. Every h≠0h\neq 0 has |h|/k≥|h|/(4⁢S⁢C)|h|/k\geq|h|/(4SC), because k=s⁢c≤4⁢S⁢Ck=sc\leq 4SC. By (2.7.T4) this gives (|h|/k)⁢D1−ϵ0≥(|h|/H)⁢𝒳ϵ1(|h|/k)D^{1-\epsilon_{0}}\geq(|h|/H)\mathcal{X}^{\epsilon_{1}}. Hence, for every hh with |h|>H|h|>H,

(2.7.T5) |g^c⁢(h/k)|≪jD⁢𝒳−j⁢ϵ1⁢(H/|h|)j.|\widehat{g}_{c}(h/k)|\ll_{j}D\,\mathcal{X}^{-j\epsilon_{1}}(H/|h|)^{j}.

For j≥2j\geq 2 and every H>0H>0, ∑|h|>H(H/|h|)j≤2+2⁢H\sum_{|h|>H}(H/|h|)^{j}\leq 2+2H. If H<1H<1, the sum runs over all h≠0h\neq 0 and is at most 2⁢ζ⁢(2)⁢H2≤2+2⁢H2\zeta(2)H^{2}\leq 2+2H. If H≥1H\geq 1 it is at most 2⁢(1+H/(j−1))2(1+H/(j-1)). With |S⁢(h⁢r¯,aT⁢n;k)|≤k|S(h\bar{r},a_{T}n;k)|\leq k, the tail |h|>H|h|>H of (2.7.T2) is ≪j(1+H)⁢D⁢𝒳−j⁢ϵ1\ll_{j}(1+H)D\mathcal{X}^{-j\epsilon_{1}} for each (c,n,r,s)(c,n,r,s). Summing against |bn,r,s||b_{n,r,s}| over c≤2⁢Cc\leq 2C gives ≪j𝒳7−j⁢ϵ1⁢‖b‖2\ll_{j}\mathcal{X}^{7-j\epsilon_{1}}\|b\|_{2}, using ∑|b|≤(N1⁢R⁢S)1/2⁢‖b‖2\sum|b|\leq(N_{1}RS)^{1/2}\|b\|_{2}, C,D,N1,R,S≤𝒳C,D,N_{1},R,S\leq\mathcal{X} and 1+H≤5⁢𝒳1+ϵ11+H\leq 5\mathcal{X}^{1+\epsilon_{1}}. Taking j>20/ϵ1j>20/\epsilon_{1} makes it smaller than (2.7.T3). If H<1H<1, the retained range 1≤|h|≤⌊H⌋1\leq|h|\leq\lfloor H\rfloor is empty. Every nonzero frequency lies in this tail, including h=±1h=\pm 1. Thus (2.7.T2) contains only the zero frequency and this tail. Equation (2.7.T3) completes this case.

For 1≤|h|≤⌊H⌋1\leq|h|\leq\lfloor H\rfloor, write h=ςh⁢mh=\varsigma_{h}m and ς=ςh⁢sgn⁡(aT)\varsigma=\varsigma_{h}\operatorname{sgn}(a_{T}), with signs ςh,ς∈{±1}\varsigma_{h},\varsigma\in\{\pm 1\}. The identity S⁢(−u,v;k)=S⁢(u,−v;k)S(-u,v;k)=S(u,-v;k) makes the second Kloosterman argument ς⁢Aa⁢n\varsigma A_{a}n. Partition the integers mm into

(2.7.T6) ℐj=(Mj,min⁡(2⁢Mj,⌊H⌋)]∩ℤ,Mj=2j/2.\mathcal{I}_{j}=(M_{j},\min(2M_{j},\lfloor H\rfloor)]\cap\mathbb{Z},\qquad M_{% j}=2^{j}/2.

Thus the first nonempty block is exactly {1}\{1\}, with M=1/2M=1/2. Partition nn into (N′,2⁢N′](N^{\prime},2N^{\prime}], N′≥1/2N^{\prime}\geq 1/2. Shortened final blocks remain integer intervals. There are O⁢(log2⁡𝒳)O(\log^{2}\mathcal{X}) pairs of blocks; each restricted coefficient norm is bounded by the original norm. For the current block define

b♭⁢(n′′)n′,r,s=bn′⁢n′′,r,s⁢ 1{N′<n′⁢n′′≤2⁢N′}⁢ 1{(n′,aT)=1}.b^{\flat}(n^{\prime\prime})_{n^{\prime},r,s}=b_{n^{\prime}n^{\prime\prime},r,s% }\,1_{\{N^{\prime}<n^{\prime}n^{\prime\prime}\leq 2N^{\prime}\}}\,1_{\{(n^{% \prime},a_{T})=1\}}.

The slice satisfies ‖b♭⁢(n′′)‖2≤‖b~⁢(n′′)‖2\|b^{\flat}(n^{\prime\prime})\|_{2}\leq\|\widetilde{b}(n^{\prime\prime})\|_{2}. Restrict bb to the current block. By support, b♭⁢(n′′)=b~⁢(n′′)b^{\flat}(n^{\prime\prime})=\widetilde{b}(n^{\prime\prime}) term by term. Thus the block estimate is exactly (2.42)–(2.43).

For one block write

(2.7.T7) g^c⁢(ςh⁢m/(s⁢c))s⁢c\displaystyle\frac{\widehat{g}_{c}(\varsigma_{h}m/(sc))}{sc} =DS⁢C⁢W0⁢(c,m,n,r,s),\displaystyle=\frac{D}{SC}W_{0}(c,m,n,r,s),
γ\displaystyle\gamma =c⁢s⁢r,W1=W0⁢γ/(C⁢S⁢R).\displaystyle=cs\sqrt{r},\qquad W_{1}=W_{0}\gamma/(CS\sqrt{R}).

Differentiate under the integral and use (2.7.T4). Then

(2.7.T8) |∂νW1|≪ν𝒳|ν|⁢ϵ2⁢c−ν1⁢m−ν2⁢n−ν3⁢r−ν4⁢s−ν5.|\partial^{\nu}W_{1}|\ll_{\nu}\mathcal{X}^{|\nu|\epsilon_{2}}c^{-\nu_{1}}m^{-% \nu_{2}}n^{-\nu_{3}}r^{-\nu_{4}}s^{-\nu_{5}}.

The block sum is D⁢RD\sqrt{R} times a sum with weight γ−1⁢W1⁢S⁢(m⁢r¯,ς⁢Aa⁢n;s⁢c)\gamma^{-1}W_{1}S(m\bar{r},\varsigma A_{a}n;sc). Put

(2.7.T9) Z=4⁢π⁢Aa⁢M⁢N′C⁢S⁢R,x=4⁢π⁢Aa⁢m⁢nc⁢s⁢r.Z=\frac{4\pi\sqrt{A_{a}MN^{\prime}}}{CS\sqrt{R}},\qquad x=\frac{4\pi\sqrt{A_{a% }mn}}{cs\sqrt{r}}.

Invert c=4⁢π⁢Aa⁢m⁢n/(x⁢s⁢r)c=4\pi\sqrt{A_{a}mn}/(xs\sqrt{r}) and multiply by fixed smooth cutoffs in m,n,r,sm,n,r,s, each equal to 1 on that variable’s range (y,2⁢y](y,2y] (y=M,N′,R,Sy=M,N^{\prime},R,S) and supported in [y/2,3⁢y][y/2,3y]. Since x/Z=(m/M)⁢(n/N′)⁢(R/r)⁢(C/c)⁢(S/s)x/Z=\sqrt{(m/M)(n/N^{\prime})(R/r)}\,(C/c)(S/s) and C<c≤2⁢CC<c\leq 2C, the resulting smooth function F⁢(x,m,n,r,s)F(x,m,n,r,s) is supported on 1/(12⁢3)≤x/Z≤6⁢21/(12\sqrt{3})\leq x/Z\leq 6\sqrt{2}, hence on Z/21≤x≤9⁢ZZ/21\leq x\leq 9Z. Mellin inversion in its four log coordinates gives

(2.7.T10) W1=(2⁢π)−4⁢∫ℝ4ϕ𝐭⁢(x)⁢mi⁢t1⁢ni⁢t2⁢ri⁢t3⁢si⁢t4⁢𝑑𝐭,W_{1}=(2\pi)^{-4}\int_{\mathbb{R}^{4}}\phi_{\mathbf{t}}(x)m^{it_{1}}n^{it_{2}}% r^{it_{3}}s^{it_{4}}\,d\mathbf{t},
(2.7.T11) maxj≤5supx|xjϕ𝐭(j)(x)|≪𝒳17⁢ϵ2∏ν=14(1+|tν|)−3=:𝔅(𝐭).\max_{j\leq 5}\sup_{x}|x^{j}\phi_{\mathbf{t}}^{(j)}(x)|\ll\mathcal{X}^{17% \epsilon_{2}}\prod_{\nu=1}^{4}(1+|t_{\nu}|)^{-3}=:\mathfrak{B}(\mathbf{t}).

For (2.7.T11), integrate three times by parts in each Mellin variable. There are four variables. Allow five xx-derivatives. This uses at most 17 derivatives in (2.7.T8). The chain rule uses ∂xc=−c/x,∂mc=c/(2⁢m),∂nc=c/(2⁢n)\partial_{x}c=-c/x,\partial_{m}c=c/(2m),\partial_{n}c=c/(2n), ∂rc=−c/(2⁢r),∂sc=−c/s\partial_{r}c=-c/(2r),\partial_{s}c=-c/s. Thus (2.7.T10) and all ensuing integral interchanges are absolutely convergent. For fixed 𝐭\mathbf{t} set αm=mi⁢t1⁢1ℐj⁢(m)\alpha_{m}=m^{it_{1}}1_{\mathcal{I}_{j}}(m) and βn,r,s=bn,r,s⁢ni⁢t2⁢ri⁢t3⁢si⁢t4\beta_{n,r,s}=b_{n,r,s}n^{it_{2}}r^{it_{3}}s^{it_{4}}. Estimate the following sum.

(2.7.T12) ℒ𝐭=∑r,s,m,nαm⁢βn,r,s⁢∑(c,r)=1γ−1⁢ϕ𝐭⁢(4⁢π⁢m⁢Aa⁢n/γ)⁢S⁢(m⁢r¯,ς⁢Aa⁢n;s⁢c).\mathcal{L}_{\mathbf{t}}=\sum_{r,s,m,n}\alpha_{m}\beta_{n,r,s}\sum_{(c,r)=1}% \gamma^{-1}\phi_{\mathbf{t}}(4\pi\sqrt{mA_{a}n}/\gamma)S(m\bar{r},\varsigma A_% {a}n;sc).

2.7.2. The cusp pair, both signs, and transform bounds

Use σ∞=I\sigma_{\infty}=I and

(2.7.T13) σ1/s=(r0s⁢r1/r).\sigma_{1/s}=\begin{pmatrix}\sqrt{r}&0\\ s\sqrt{r}&1/\sqrt{r}\end{pmatrix}.

Multiply (abr⁢s⁢c0d)\begin{pmatrix}a&b\\ rsc_{0}&d\end{pmatrix} by (2.7.T13). With c=r⁢c0+dc=rc_{0}+d, the positive cusp moduli are γ=c⁢s⁢r\gamma=cs\sqrt{r}, (c,r)=1(c,r)=1, as in (2.13). Conversely choose d≡c⁢(r)d\equiv c\ (r), (d,s⁢c)=1(d,sc)=1, and c0=(c−d)/rc_{0}=(c-d)/r; this supplies every allowed modulus. Double cosets correspond to the reduced residues modulo s⁢csc. Insert their top and bottom entries in the cusp Kloosterman definition. This gives

(2.7.T14) S∞,1/s⁢(m,ν;γ)=e⁢(ν⁢s¯/r)⁢S⁢(m⁢r¯,ν;s⁢c),ν≠0.S_{\infty,1/s}(m,\nu;\gamma)=e(\nu\bar{s}/r)S(m\bar{r},\nu;sc),\qquad\nu\neq 0.

The numerator modulo rr is ν⁢c\nu c. Modulo s⁢csc it is m⁢r¯⁢u+ν⁢u¯m\bar{r}\,u+\nu\bar{u}, with u=r⁢d¯u=r\bar{d}. This proves (2.7.T14) for either sign and for complex Fourier coefficients.

We use the trace formula in DI’s coefficient normalization, with the transforms ϕ^,ϕˇ,ϕ~\widehat{\phi},\check{\phi},\widetilde{\phi} of (2.12). Let m,ν>0m,\nu>0 and r>R≥1r>R\geq 1. Use the same-sign Drappeau formula of Section 2. Apply the exact dictionary below.

(2.7.T15) ρu,𝔞Dr⁢(n)=ρu,𝔞DI⁢(n)2⁢|n|,ρ𝔠⁢𝔞Dr⁢(n,t)=π1/2+i⁢t⁢|n|i⁢t−1/2Γ⁢(1/2+i⁢t)⁢φ𝔠⁢𝔞⁢n⁢(1/2+i⁢t).\rho^{\rm Dr}_{u,\mathfrak{a}}(n)=\frac{\rho^{\rm DI}_{u,\mathfrak{a}}(n)}{2% \sqrt{|n|}},\quad\rho^{\rm Dr}_{\mathfrak{c}\mathfrak{a}}(n,t)=\frac{\pi^{1/2+% it}|n|^{it-1/2}}{\Gamma(1/2+it)}\varphi_{\mathfrak{c}\mathfrak{a}n}(1/2+it).

The holomorphic dictionary is ρf,𝔞Dr⁢(n)=(4⁢π⁢n)−ℓ/2⁢ψf⁢(𝔞,n)\rho^{\rm Dr}_{f,\mathfrak{a}}(n)=(4\pi n)^{-\ell/2}\psi_{f}(\mathfrak{a},n). For signs +,−+,-, the Maass weights are as follows.

(2.7.T16) h+⁢(κ)=−ϕ^⁢(κ)/cosh⁡π⁢κ,h−⁢(κ)=π2⁢ϕˇ⁢(κ)/cosh⁡π⁢κ;h_{+}(\kappa)=-\widehat{\phi}(\kappa)/\cosh\pi\kappa,\quad h_{-}(\kappa)=\frac% {\pi}{2}\check{\phi}(\kappa)/\cosh\pi\kappa;

For measure d⁢tdt, the continuous weights are as follows.

(2.7.T17) e+⁢(t)=−ϕ^⁢(t)/π,e−⁢(t)=ϕˇ⁢(t)/2.e_{+}(t)=-\widehat{\phi}(t)/\pi,\qquad e_{-}(t)=\check{\phi}(t)/2.

Only sign ++ has a holomorphic coefficient. It is

(2.7.T18) iℓ⁢(ℓ−1)!π⁢(4⁢π)ℓ−1⁢ϕ~⁢(ℓ−1).\frac{i^{\ell}(\ell-1)!}{\pi(4\pi)^{\ell-1}}\,\widetilde{\phi}(\ell-1).

There is no 1/cosh⁡(π⁢t)1/\cosh(\pi t) in (2.7.T17).

For the opposite sign the normalization follows from the following derivation. Take a width-one scaling matrix σ𝔞\sigma_{\mathfrak{a}}. Let Γ𝔞\Gamma_{\mathfrak{a}} stabilize 𝔞\mathfrak{a} in Γ=Γ0⁢(q)\Gamma=\Gamma_{0}(q), including −I-I. Then σ𝔞−1⁢Γ𝔞⁢σ𝔞={±Tk:k∈ℤ}\sigma_{\mathfrak{a}}^{-1}\Gamma_{\mathfrak{a}}\sigma_{\mathfrak{a}}=\{\pm T^{% k}:k\in\mathbb{Z}\}. Define, for m>0m>0,

U𝔞⁢m⁢(z,s)=∑δ∈Γ𝔞\Γ(ℑ⁡σ𝔞−1⁢δ⁢z)s⁢e⁢(m⁢σ𝔞−1⁢δ⁢z),⟨F,G⟩=∫Γ\ℍF⁢(z)⁢G⁢(z)¯⁢d⁢x⁢d⁢yy2.U_{\mathfrak{a}m}(z,s)=\sum_{\delta\in\Gamma_{\mathfrak{a}}\backslash\Gamma}(% \Im\sigma_{\mathfrak{a}}^{-1}\delta z)^{s}e(m\sigma_{\mathfrak{a}}^{-1}\delta z% ),\qquad\langle F,G\rangle=\int_{\Gamma\backslash\mathbb{H}}F(z)\overline{G(z)% }\,\frac{dx\,dy}{y^{2}}.

Each coset enters once, with weight one. The series and unfolding converge absolutely for ℜ⁡s>1\Re s>1. Unfold the first series and decompose the second into cusp double cosets of positive lower-left entry γ\gamma. Translation in the real variable leaves the Kloosterman factor S𝔞⁢𝔟⁢(m,−ν;γ)S_{\mathfrak{a}\mathfrak{b}}(m,-\nu;\gamma), with the cusp convention of (2.7.T14). Explicitly, a matrix σ𝔟−1⁢δ⁢σ𝔞=(abγd)\sigma_{\mathfrak{b}}^{-1}\delta\sigma_{\mathfrak{a}}=(\begin{smallmatrix}a&b% \\ \gamma&d\end{smallmatrix}) gives phase e⁢((ν⁢a−m⁢d)/γ)e((\nu a-md)/\gamma); its negative inverse has entries (−d,b;γ,−a)(-d,b;\gamma,-a), giving the same phase in S𝔞⁢𝔟⁢(m,−ν;γ)S_{\mathfrak{a}\mathfrak{b}}(m,-\nu;\gamma). The remaining integral is

Iγ=γ−2⁢s2⁢∫ℍys1+s2−2⁢|z|−2⁢s2⁢exp⁡(2⁢π⁢i⁢{m⁢z−ν/(γ2⁢z)})⁢𝑑x⁢𝑑y.I_{\gamma}=\gamma^{-2s_{2}}\int_{\mathbb{H}}y^{s_{1}+s_{2}-2}|z|^{-2s_{2}}\exp% \!\left(2\pi i\{mz-\nu/(\gamma^{2}z)\}\right)dx\,dy.

The zero-lower-left coset, if present for equivalent cusps, vanishes by the integral of e⁢((m+ν)⁢x)e((m+\nu)x) over [0,1][0,1]. Put s−=s1−s2s_{-}=s_{1}-s_{2}, s+=s1+s2s_{+}=s_{1}+s_{2}, z=i⁢ϱ⁢ei⁢αz=i\varrho e^{i\alpha}, −π/2<α<π/2-\pi/2<\alpha<\pi/2, and ϱ=(ν/m/γ)⁢eu\varrho=(\sqrt{\nu/m}/\gamma)e^{u}. Then

Iγ=γ−s+⁢(ν/m)s−/2⁢∫−π/2π/2coss+−2⁡α⁢∫ℝes−⁢u⁢e−(4⁢π⁢m⁢ν/γ)⁢cosh⁡(u+i⁢α)⁢𝑑u⁢𝑑α.I_{\gamma}=\gamma^{-s_{+}}(\nu/m)^{s_{-}/2}\int_{-\pi/2}^{\pi/2}\cos^{s_{+}-2}% \alpha\int_{\mathbb{R}}e^{s_{-}u}e^{-(4\pi\sqrt{m\nu}/\gamma)\cosh(u+i\alpha)}% du\,d\alpha.

For each interior α\alpha, shift u+i⁢αu+i\alpha to the real line. The vertical sides vanish exponentially, and the inner integral is 2⁢e−i⁢s−⁢α⁢Ks−⁢(4⁢π⁢m⁢ν/γ)2e^{-is_{-}\alpha}K_{s_{-}}(4\pi\sqrt{m\nu}/\gamma). Let ℜ⁡si>1\Re s_{i}>1. At either angular endpoint the radial growth is of order cos−|ℜ⁡s−|⁡α\cos^{-|\Re s_{-}|}\alpha. For ℜ⁡s−=0\Re s_{-}=0, a logarithm may also occur. The remaining exponent is ℜ⁡s+−2−|ℜ⁡s−|=2⁢min⁡ℜ⁡si−2>0\Re s_{+}-2-|\Re s_{-}|=2\min\Re s_{i}-2>0. Hence the original absolute integral is finite. Hence Fubini and the endpoint limits are legitimate. Applying (2.7.T20) gives the following identity for ℜ⁡s1,ℜ⁡s2>1\Re s_{1},\Re s_{2}>1:

(2.7.T19) ⟨U𝔞⁢m⁢(s1),U𝔟⁢ν⁢(s2)¯⟩=\displaystyle\langle U_{\mathfrak{a}m}(s_{1}),\overline{U_{\mathfrak{b}\nu}(s_% {2})}\rangle={} π⁢23−s1−s2⁢Γ⁢(s1+s2−1)Γ⁢(s1)⁢Γ⁢(s2)⁢(ν/m)(s1−s2)/2\displaystyle\pi 2^{3-s_{1}-s_{2}}\frac{\Gamma(s_{1}+s_{2}-1)}{\Gamma(s_{1})% \Gamma(s_{2})}(\nu/m)^{(s_{1}-s_{2})/2}
×∑γγ−s1−s2S𝔞⁢𝔟(m,−ν;γ)Ks1−s2(4πm⁢ν/γ).\displaystyle\times\sum_{\gamma}\gamma^{-s_{1}-s_{2}}S_{\mathfrak{a}\mathfrak{% b}}(m,-\nu;\gamma)K_{s_{1}-s_{2}}(4\pi\sqrt{m\nu}/\gamma).

The polar substitution and contour shift above give the factor 2⁢Ks1−s22K_{s_{1}-s_{2}}. The remaining angular integral is

(2.7.T20) ∫−π/2π/2coss1+s2−2⁡α⁢e−i⁢(s1−s2)⁢α⁢d⁢α=π⁢22−s1−s2⁢Γ⁢(s1+s2−1)Γ⁢(s1)⁢Γ⁢(s2).\int_{-\pi/2}^{\pi/2}\cos^{s_{1}+s_{2}-2}\alpha\,e^{-i(s_{1}-s_{2})\alpha}\,d% \alpha=\pi 2^{2-s_{1}-s_{2}}\frac{\Gamma(s_{1}+s_{2}-1)}{\Gamma(s_{1})\Gamma(s% _{2})}.

For an independent normalization, unfold once and use (2.2). This gives

⟨U𝔞⁢m⁢(s),uj⟩=ρj⁢𝔞⁢(m)¯⁢π⁢(4⁢π⁢m)1/2−sΓ⁢(s)⁢Γ⁢(s−12−i⁢κj)⁢Γ⁢(s−12+i⁢κj).\langle U_{\mathfrak{a}m}(s),u_{j}\rangle=\overline{\rho_{j\mathfrak{a}}(m)}% \frac{\sqrt{\pi}(4\pi m)^{1/2-s}}{\Gamma(s)}\Gamma(s-\tfrac{1}{2}-i\kappa_{j})% \Gamma(s-\tfrac{1}{2}+i\kappa_{j}).

This is the integral of ys−3/2⁢e−2⁢π⁢m⁢y⁢Ki⁢κj⁢(2⁢π⁢m⁢y)y^{s-3/2}e^{-2\pi my}K_{i\kappa_{j}}(2\pi my). Use the standard integral representation of KK and a beta integral. The second factor ⟨uj,U𝔟⁢ν⁢(s2)¯⟩\langle u_{j},\overline{U_{\mathfrak{b}\nu}(s_{2})}\rangle is the same expression with ρj⁢𝔟⁢(−ν)\rho_{j\mathfrak{b}}(-\nu), ν,s2\nu,s_{2} in place of ρj⁢𝔞⁢(m)¯\overline{\rho_{j\mathfrak{a}}(m)}, m,sm,s. There is no conjugation of s2s_{2} in this bilinear pairing. Multiplication gives exactly (2.7.T21). Applying the same unfolding to the Eisenstein expansion (2.4), with its standard Parseval measure, gives (2.7.T22). Thus Parseval gives the spectral side with

(2.7.T21) P\displaystyle P =π⁢m1/2−s1⁢ν1/2−s2⁢(4⁢π)1−s1−s2Γ⁢(s1)⁢Γ⁢(s2),\displaystyle=\frac{\pi m^{1/2-s_{1}}\nu^{1/2-s_{2}}(4\pi)^{1-s_{1}-s_{2}}}{% \Gamma(s_{1})\Gamma(s_{2})},
Λ⁢(s1,s2;t)\displaystyle\Lambda(s_{1},s_{2};t) =∏j=12Γ⁢(sj−12−i⁢t)⁢Γ⁢(sj−12+i⁢t).\displaystyle=\prod_{j=1}^{2}\Gamma(s_{j}-\tfrac{1}{2}-it)\Gamma(s_{j}-\tfrac{% 1}{2}+it).

Its Maass summand is P⁢ρj⁢𝔞⁢(m)¯⁢ρj⁢𝔟⁢(−ν)⁢Λ⁢(s1,s2;κj)P\overline{\rho_{j\mathfrak{a}}(m)}\rho_{j\mathfrak{b}}(-\nu)\Lambda(s_{1},s_{% 2};\kappa_{j}). Its continuous integral is

(2.7.T22) P⁢∑𝔠∫(ν/m)i⁢t⁢φ𝔠⁢𝔞⁢m⁢(1/2+i⁢t)¯⁢φ𝔠⁢𝔟,−ν⁢(1/2+i⁢t)×Λ⁢(s1,s2;t)⁢|Γ⁢(1/2+i⁢t)|−2⁢d⁢t.\begin{split}&P\sum_{\mathfrak{c}}\int(\nu/m)^{it}\overline{\varphi_{\mathfrak% {c}\mathfrak{a}m}(1/2+it)}\varphi_{\mathfrak{c}\mathfrak{b},-\nu}(1/2+it)\\ &\qquad\times\Lambda(s_{1},s_{2};t)|\Gamma(1/2+it)|^{-2}\,dt.\end{split}

The factor at the second cusp has index −ν-\nu. It arises because the second Eisenstein parameter in Parseval is conjugated: E⁢(z,1/2+i⁢t)¯=E⁢(z,1/2−i⁢t)\overline{E(z,1/2+it)}=E(z,1/2-it). So the continuous product pairs a conjugated coefficient at 1/2+i⁢t1/2+it with an unconjugated one at 1/2+i⁢t1/2+it.

For the unscaled Eisenstein series the continuous Parseval measure is d⁢t/(4⁢π)dt/(4\pi). Its coefficient of y⁢Ki⁢t⁢(2⁢π⁢|n|⁢y)⁢e⁢(n⁢x)\sqrt{y}K_{it}(2\pi|n|y)e(nx) is

b(𝔠,𝔞)⁢(n,t)=2⁢π1/2+i⁢t⁢|n|i⁢t⁢φ𝔠,𝔞,n⁢(1/2+i⁢t)Γ⁢(1/2+i⁢t).b_{(\mathfrak{c},\mathfrak{a})}(n,t)=2\pi^{1/2+it}|n|^{it}\ \frac{\varphi_{% \mathfrak{c},\mathfrak{a},n}(1/2+it)}{\Gamma(1/2+it)}.

Hence (4⁢π)−1⁢b(𝔠,𝔞)⁢(m,t)¯⁢b(𝔠,𝔟)⁢(−ν,t)(4\pi)^{-1}\overline{b_{(\mathfrak{c},\mathfrak{a})}(m,t)}b_{(\mathfrak{c},% \mathfrak{b})}(-\nu,t) equals

(ν/m)i⁢t⁢φ𝔠,𝔞,m⁢(1/2+i⁢t)¯⁢φ𝔠,𝔟,−ν⁢(1/2+i⁢t)⁢|Γ⁢(1/2+i⁢t)|−2.(\nu/m)^{it}\overline{\varphi_{\mathfrak{c},\mathfrak{a},m}(1/2+it)}\varphi_{% \mathfrak{c},\mathfrak{b},-\nu}(1/2+it)|\Gamma(1/2+it)|^{-2}.

The coefficient product contributes 4⁢π4\pi, canceling the Parseval denominator. Thus (2.7.T22) has plain d⁢tdt and no hyperbolic-cosine denominator. The second φ\varphi is unconjugated at the same tt.

Write σi=ℜ⁡si>1\sigma_{i}=\Re s_{i}>1, δ=|σ1−σ2|\delta=|\sigma_{1}-\sigma_{2}|, σ∗=min⁡(σ1,σ2)\sigma_{*}=\min(\sigma_{1},\sigma_{2}), and x=4⁢π⁢m⁢ν/γx=4\pi\sqrt{m\nu}/\gamma, with fixed m,ν≥1m,\nu\geq 1. Replace both Poincaré summands by their moduli. For one double coset with positive lower-left entry, the absolute integral is

(2.7.T23) ≪σ1,σ2,m,νγ−σ1−σ2⁢(1+γδ+log⁡(2+γ)).\ll_{\sigma_{1},\sigma_{2},m,\nu}\gamma^{-\sigma_{1}-\sigma_{2}}\bigl{(}1+% \gamma^{\delta}+\log(2+\gamma)\bigr{)}.

The radial integral is a fixed positive factor times Kδ⁢(x⁢cos⁡α)K_{\delta}(x\cos\alpha). For δ>0\delta>0, its small-argument bound is Oδ⁢((x⁢cos⁡α)−δ)O_{\delta}((x\cos\alpha)^{-\delta}); for δ=0\delta=0, it is O⁢(1+|log⁡(x⁢cos⁡α)|)O(1+|\log(x\cos\alpha)|). The angular weight is cosσ1+σ2−2⁡α\cos^{\sigma_{1}+\sigma_{2}-2}\alpha. Thus the power endpoint has exponent 2⁢σ∗−2>02\sigma_{*}-2>0, while the logarithmic endpoint is integrable and contributes O⁢(1+log⁡(2+γ))O(1+\log(2+\gamma)) after angular integration. The implied constant depends on the fixed spectral parameters and on m,νm,\nu, and is uniform in γ\gamma.

Consequently the controlling absolute-sum majorant is

(2.7.T24) ∑γN𝔞⁢𝔟⁢(γ)⁢γ−2⁢σ∗⁢(1+log⁡(2+γ))<∞.\sum_{\gamma}N_{\mathfrak{a}\mathfrak{b}}(\gamma)\gamma^{-2\sigma_{*}}\bigl{(}% 1+\log(2+\gamma)\bigr{)}<\infty.

For the cusp pair (∞,1/s)(\infty,1/s), (2.7.T14) gives γ=c⁢s⁢r\gamma=cs\sqrt{r}, (c,r)=1(c,r)=1, and N⁢(γ)=φ⁢(s⁢c)≤s⁢cN(\gamma)=\varphi(sc)\leq sc. The sum is bounded by a constant times ∑c≥1c1−2⁢σ∗⁢(1+log⁡(2+c))\sum_{c\geq 1}c^{1-2\sigma_{*}}(1+\log(2+c)), which converges because σ∗>1\sigma_{*}>1. For a general fixed cusp pair, the cited cumulative count ∑γ≤TN𝔞⁢𝔟⁢(γ)≪𝔞,𝔟T2\sum_{\gamma\leq T}N_{\mathfrak{a}\mathfrak{b}}(\gamma)\ll_{\mathfrak{a},% \mathfrak{b}}T^{2} and dyadic decomposition bound the tail by ∑k≥0(1+k)⁢2−2⁢(σ∗−1)⁢k<∞\sum_{k\geq 0}(1+k)2^{-2(\sigma_{*}-1)k}<\infty. Any bounded initial range is finite.

The logarithm in (2.7.T23) is attained: for σ1=σ2=2\sigma_{1}=\sigma_{2}=2, m=ν=1m=\nu=1 and the admissible moduli γ=2⁢c\gamma=\sqrt{2}c, cc odd, the absolute cell integral is π⁢γ−4⁢log⁡γ+O⁢(γ−4)\pi\gamma^{-4}\log\gamma+O(\gamma^{-4}). The summable majorant (2.7.T24) supplies the uniform step beyond the fixed-γ\gamma angular endpoint estimate.

Both sides continue to the connected domain ℜ⁡si>3/4,|ℜ⁡(s1−s2)|<1/2\Re s_{i}>3/4,\ |\Re(s_{1}-s_{2})|<1/2. For the geometric side, Weil’s bound and Kμ⁢(x)≪x−|ℜ⁡μ|⁢(1+|log⁡x|)K_{\mu}(x)\ll x^{-|\Re\mu|}(1+|\log x|) give locally uniform absolute convergence. For the spectral side, apply Stirling and DI’s positive large sieves. These give locally uniform absolute convergence. Since i⁢κj≤7/64i\kappa_{j}\leq 7/64, the exceptional gamma factors have no poles here. Equality therefore holds at s1=1+i⁢u,s2=1−i⁢us_{1}=1+iu,s_{2}=1-iu. With

(2.7.T25) ℋ⁢(t,u)=cosh⁡π⁢tcosh⁡π⁢(t−u)⁢cosh⁡π⁢(t+u),\mathcal{H}(t,u)=\frac{\cosh\pi t}{\cosh\pi(t-u)\cosh\pi(t+u)},

this gives

(2.7.T26) ∑γ4⁢π⁢m⁢νγ2⁢S⁢(m,−ν;γ)⁢K2⁢i⁢u⁢(4⁢π⁢m⁢ν/γ)\displaystyle\sum_{\gamma}\frac{4\pi\sqrt{m\nu}}{\gamma^{2}}S(m,-\nu;\gamma)K_% {2iu}(4\pi\sqrt{m\nu}/\gamma)
=π22⁢∑jρ¯j⁢(m)⁢ρj⁢(−ν)⁢ℋ⁢(κj,u)cosh⁡π⁢κj+π2⁢∑𝔠∫E𝔠⁢(t)⁢ℋ⁢(t,u)⁢𝑑t,\displaystyle\qquad=\frac{\pi^{2}}{2}\sum_{j}\frac{\bar{\rho}_{j}(m)\rho_{j}(-% \nu)\mathcal{H}(\kappa_{j},u)}{\cosh\pi\kappa_{j}}+\frac{\pi}{2}\sum_{% \mathfrak{c}}\int E_{\mathfrak{c}}(t)\mathcal{H}(t,u)\,dt,

where

E𝔠(t):=(ν/m)i⁢tφ𝔠⁢𝔞⁢m⁢(1/2+i⁢t)¯φ𝔠⁢𝔟,−ν(1/2+it).E_{\mathfrak{c}}(t):=(\nu/m)^{it}\overline{\varphi_{\mathfrak{c}\mathfrak{a}m}% (1/2+it)}\varphi_{\mathfrak{c}\mathfrak{b},-\nu}(1/2+it).

The factor |Γ⁢(1/2+i⁢t)|−2|\Gamma(1/2+it)|^{-2} of (2.7.T22) is part of the spectral kernel; E𝔠E_{\mathfrak{c}} excludes it. The constant eigenfunction contributes 0 to the sum over jj: its Fourier coefficients vanish at the nonzero frequencies mm and −ν-\nu.

To integrate (2.7.T26) against a test function, set

(2.7.T27) ℛ⁢(u)=∫0∞K2⁢i⁢u⁢(x)⁢ϕ⁢(x)⁢x−2⁢𝑑x,k⁢(u)=4π2⁢u⁢sinh⁡(2⁢π⁢u)⁢ℛ⁢(u).\mathcal{R}(u)=\int_{0}^{\infty}K_{2iu}(x)\phi(x)x^{-2}\,dx,\qquad k(u)=\frac{% 4}{\pi^{2}}u\sinh(2\pi u)\mathcal{R}(u).

Kontorovich–Lebedev inversion gives ∫ℝk⁢(u)⁢K2⁢i⁢u⁢(x)⁢𝑑u=ϕ⁢(x)/x\int_{\mathbb{R}}k(u)K_{2iu}(x)\,du=\phi(x)/x; see [29, §10.43(v), (10.43.30)–(10.43.31)]. Use the following kernel identity.

(2.7.T28) ∫ℝu⁢sinh⁡(2⁢π⁢u)⁢ℋ⁢(t,u)⁢K2⁢i⁢u⁢(x)⁢𝑑u=cosh⁡(π⁢t)⁢x⁢K2⁢i⁢t⁢(x).\int_{\mathbb{R}}u\sinh(2\pi u)\mathcal{H}(t,u)K_{2iu}(x)\,du=\cosh(\pi t)xK_{% 2it}(x).

For |ℜ⁡μ|+|ℜ⁡ν|<1|\Re\mu|+|\Re\nu|<1, the absolutely convergent product integral is

(2.7.T29) ∫0∞Kμ⁢(x)⁢Kν⁢(x)⁢𝑑x=π24⁢cos⁡(π⁢(μ+ν)/2)⁢cos⁡(π⁢(μ−ν)/2).\int_{0}^{\infty}K_{\mu}(x)K_{\nu}(x)\,dx=\frac{\pi^{2}}{4\cos(\pi(\mu+\nu)/2)% \cos(\pi(\mu-\nu)/2)}.

Use the Bessel product representation Kμ⁢Kν⁢(x)=2⁢∫0∞Kμ+ν⁢(2⁢x⁢cosh⁡v)⁢cosh⁡((μ−ν)⁢v)⁢𝑑vK_{\mu}K_{\nu}(x)=2\int_{0}^{\infty}K_{\mu+\nu}(2x\cosh v)\cosh((\mu-\nu)v)\,dv. Integrate in xx. For |ℜ⁡b|<1|\Re b|<1, use ∫0∞cosh⁡(b⁢v)/cosh⁡v⁢d⁢v=(π/2)⁢sec⁡(π⁢b/2)\int_{0}^{\infty}\cosh(bv)/\cosh v\,dv=(\pi/2)\sec(\pi b/2). The latter follows by expanding 1/cosh⁡v1/\cosh v and the partial fractions of secant. In the subsequent KL application, (μ,ν)=(2⁢i⁢t,2⁢i⁢u)(\mu,\nu)=(2it,2iu) with u∈ℝu\in\mathbb{R}; here t∈ℝt\in\mathbb{R} on the regular and continuous spectrum, while an exceptional parameter satisfies |ℑ⁡t|≤7/64|\Im t|\leq 7/64. Thus |ℜ⁡μ|+|ℜ⁡ν|≤7/32<1|\Re\mu|+|\Re\nu|\leq 7/32<1 and |ℜ⁡(μ−ν)|<1|\Re(\mu-\nu)|<1. Apply KL inversion to x⁢K2⁢i⁢t⁢(x)xK_{2it}(x), whose KL transform is, by (2.7.T29), (π2/4)⁢ℋ⁢(t,u)/cosh⁡π⁢t(\pi^{2}/4)\mathcal{H}(t,u)/\cosh\pi t. This proves (2.7.T28).

All interchanges here are justified as follows. Split the integral representation of Ki⁢vK_{iv} at sinh⁡U=max⁡(1,1/x)\sinh U=\max(1,1/x). Integrate by parts on its tail. This gives

(2.7.T30) |Ki⁢v⁢(x)|≪e−π⁢|v|/2⁢(1+|v|+log⁡(2+1/x)).|K_{iv}(x)|\ll e^{-\pi|v|/2}(1+|v|+\log(2+1/x)).

Apply the self-adjoint operator (x⁢∂x)2−x2(x\partial_{x})^{2}-x^{2} repeatedly to ϕ⁢(x)/x\phi(x)/x. Then ℛ⁢(u)≪ϕ,je−π⁢|u|⁢(1+|u|)1−2⁢j\mathcal{R}(u)\ll_{\phi,j}e^{-\pi|u|}(1+|u|)^{1-2j}. On real tt, |ℋ⁢(t,u)|≤4⁢cosh⁡(π⁢t)⁢e−2⁢π⁢max⁡{|t|,|u|}|\mathcal{H}(t,u)|\leq 4\cosh(\pi t)e^{-2\pi\max\{|t|,|u|\}}; exceptional parameters give an exponentially decaying function of uu as well. DI’s positive quadratic estimates imply convergence after the remaining (1+|t|)−4(1+|t|)^{-4} bound. The geometric side is absolutely summable by Weil. These bounds justify Fubini on both sides of (2.7.T26). Equations (2.7.T27)–(2.7.T28) now give exactly (2.7.T16)–(2.7.T17) for sign −-. For sign ++, let r>R≥1r>R\geq 1. Insert (2.7.T15) in the classical same-sign formula. This gives the minus signs in (2.7.T16)–(2.7.T17) and the coefficient (2.7.T18). These are the normalizations of Section 2, (2.14).

Let ϕ\phi be supported in [Z/21,9⁢Z][Z/21,9Z]. With 𝔅=maxj≤5⁢supxj⁢|ϕ(j)⁢(x)|\mathfrak{B}=\max_{j\leq 5}\sup x^{j}|\phi^{(j)}(x)|, the transform bounds are

(2.7.T31) |ϕ^⁢(t)|+|ϕˇ⁢(t)|≪𝔅⁢(1+|log⁡Z|)⁢(1+Z)−1⁢min⁡{1,((1+Z)/|t|)3}(t∈ℝ),|\widehat{\phi}(t)|+|\check{\phi}(t)|\ll\mathfrak{B}(1+|\log Z|)(1+Z)^{-1}\min% \{1,((1+Z)/|t|)^{3}\}\quad(t\in\mathbb{R}),
(2.7.T32) |ϕ^⁢(i⁢ν)|+|ϕˇ⁢(i⁢ν)|≪𝔅⁢(1+|log⁡Z|)⁢(1+Z−2⁢ν)/(1+Z),0<ν≤1/4,|\widehat{\phi}(i\nu)|+|\check{\phi}(i\nu)|\ll\mathfrak{B}(1+|\log Z|)(1+Z^{-{% 2\nu}})/(1+Z),\quad 0<\nu\leq 1/4,

and the same bound as (2.7.T31) for ϕ~⁢(ℓ)\widetilde{\phi}(\ell) with |t||t| replaced by ℓ\ell. To prove them, put Φ⁢(y)=∫cos⁡(x⁢y)⁢ϕ⁢(x)⁢𝑑x/x\Phi(y)=\int\cos(xy)\phi(x)\,dx/x and Φc⁢(y)=∫e−i⁢x⁢y⁢ϕ⁢(x)⁢𝑑x/x\Phi_{c}(y)=\int e^{-ixy}\phi(x)\,dx/x. Five integrations by parts give |Φ(j)⁢(y)|+|Φc(j)⁢(y)|≪𝔅⁢Zj⁢min⁡(1,(Z⁢|y|)−5)|\Phi^{(j)}(y)|+|\Phi_{c}^{(j)}(y)|\ll\mathfrak{B}Z^{j}\min(1,(Z|y|)^{-5}), j≤3j\leq 3. The exact Bessel representations are

ϕˇ⁢(t)\displaystyle\check{\phi}(t) =4π⁢∫0∞cos⁡(2⁢t⁢u)⁢Φ⁢(sinh⁡u)⁢𝑑u,\displaystyle=\frac{4}{\pi}\int_{0}^{\infty}\cos(2tu)\Phi(\sinh u)\,du,
ϕ^⁢(t)\displaystyle\widehat{\phi}(t) =−2⁢∫0∞cos⁡(2⁢t⁢u)⁢Φ⁢(cosh⁡u)⁢𝑑u,\displaystyle=-2\int_{0}^{\infty}\cos(2tu)\Phi(\cosh u)\,du,
ϕ~⁢(ℓ)\displaystyle\widetilde{\phi}(\ell) =12⁢π⁢∫−ππei⁢ℓ⁢u⁢Φc⁢(sin⁡u)⁢𝑑u.\displaystyle=\frac{1}{2\pi}\int_{-\pi}^{\pi}e^{i\ell u}\Phi_{c}(\sin u)\,du.

Their absolute bounds follow by splitting at sinh⁡u=1/Z\sinh u=1/Z; three integrations by parts give the cubic decay. The periodic holomorphic integral has no boundary terms. Replacing cosine by cosh⁡(2⁢ν⁢u)\cosh(2\nu u) and splitting at the same point gives (2.7.T32). Truncate the oscillatory representations first. For real tt, the tails are O⁢((1+|t|)/(x⁢sinh⁡U))O((1+|t|)/(x\sinh U)). For t=i⁢νt=i\nu, they are O⁢((1+ν)⁢e2⁢ν⁢U/(x⁢sinh⁡U))O((1+\nu)e^{2\nu U}/(x\sinh U)). Since 2⁢ν≤1/22\nu\leq 1/2, these tails tend to zero and justify the interchanges.

2.7.3. Cusp transport and all Hecke factors

Choose integers w,yw,y with r⁢w−s⁢y=1rw-sy=1, and let

(2.7.T33) W=r−1/2⁢(ryr⁢sr⁢w).W=r^{-1/2}\begin{pmatrix}r&y\\ rs&rw\end{pmatrix}.

Then σ1/s−1⁢W=(1y/r01)\sigma_{1/s}^{-1}W=\begin{pmatrix}1&y/r\\ 0&1\end{pmatrix}, with y/r≡−s¯/r⁢(1)y/r\equiv-\bar{s}/r(1). Also W⁢Γ0⁢(r⁢s)⁢W−1=Γ0⁢(r⁢s)W\Gamma_{0}(rs)W^{-1}=\Gamma_{0}(rs). Here is an integer computation of the latter fact. For A=r−1/2⁢(r⁢αβr⁢s⁢γr⁢δ)A=r^{-1/2}\begin{pmatrix}r\alpha&\beta\\ rs\gamma&r\delta\end{pmatrix}, r⁢α⁢δ−s⁢β⁢γ=1r\alpha\delta-s\beta\gamma=1, conjugating (abr⁢s⁢cd)\begin{pmatrix}a&b\\ rsc&d\end{pmatrix} gives entries

(2.7.T34) (a⁢α⁢δ⁢r−α⁢b⁢γ⁢r⁢s+β⁢c⁢δ⁢r⁢s−β⁢d⁢γ⁢s−a⁢α⁢β+α2⁢b⁢r+α⁢β⁢d−β2⁢c⁢sr⁢s⁢(a⁢δ⁢γ−b⁢γ2⁢s+c⁢δ2⁢r−d⁢δ⁢γ)−a⁢β⁢γ⁢s+α⁢b⁢γ⁢r⁢s+α⁢d⁢δ⁢r−β⁢c⁢δ⁢r⁢s).\begin{pmatrix}a\alpha\delta r-\alpha b\gamma rs+\beta c\delta rs-\beta d% \gamma s&-a\alpha\beta+\alpha^{2}br+\alpha\beta d-\beta^{2}cs\\ rs(a\delta\gamma-b\gamma^{2}s+c\delta^{2}r-d\delta\gamma)&-a\beta\gamma s+% \alpha b\gamma rs+\alpha d\delta r-\beta c\delta rs\end{pmatrix}.

Both W=A⁢(1,y,1,w)W=A(1,y,1,w) and W−1=A⁢(w,−y,−1,1)W^{-1}=A(w,-y,-1,1) have this form, proving both inclusions. Thus composition by WW is unitary, commutes with the Laplacian, and preserves each eigenspace. The weight-ℓ\ell slash action has the same properties.

Comparison of Fourier series after the translation y/ry/r gives

(2.7.T35) ρF,1/s⁢(ν)=e⁢(ν⁢s¯/r)⁢cF∘W⁢(ν),ψF⁢(1/s,ν)=e⁢(ν⁢s¯/r)⁢ψF|ℓ⁢W⁢(∞,ν).\rho_{F,1/s}(\nu)=e(\nu\bar{s}/r)c_{F\circ W}(\nu),\quad\psi_{F}(1/s,\nu)=e(% \nu\bar{s}/r)\psi_{F|_{\ell}W}(\infty,\nu).

For Eisenstein series, substitute W⁢γ⁢W−1W\gamma W^{-1} in the defining coset series for ℜ⁡z>1\Re z>1. It gives E𝔠⁢(W⁢z,u)=EW−1⁢𝔠⁢(z,u)E_{\mathfrak{c}}(Wz,u)=E_{W^{-1}\mathfrak{c}}(z,u), using W−1⁢σ𝔠W^{-1}\sigma_{\mathfrak{c}} as a width-one scaling matrix. Changing the source-cusp representative or translating its scaling matrix does not change the Fourier coefficient at the fixed observation cusp ∞\infty. Meromorphic continuation therefore gives

(2.7.T36) φ𝔠,1/s,ν⁢(u)=e⁢(ν⁢s¯/r)⁢φW−1⁢𝔠,∞,ν⁢(u).\varphi_{\mathfrak{c},1/s,\nu}(u)=e(\nu\bar{s}/r)\varphi_{W^{-1}\mathfrak{c},% \infty,\nu}(u).

In (2.7.T12), (2.7.T14) contributes e⁢(−ς⁢Aa⁢n⁢s¯/r)e(-\varsigma A_{a}n\bar{s}/r). Equations (2.7.T35)–(2.7.T36) cancel this phase exactly for both signs, in every spectrum.

For (k,q)=1(k,q)=1, define the normalized Hecke operator below.

(2.7.T37) Tk⁢F⁢(z)=k−1/2⁢∑a⁢d=k∑bmoddF⁢((a⁢z+b)/d).T_{k}F(z)=k^{-1/2}\sum_{ad=k}\sum_{b\bmod d}F((az+b)/d).

Sum each Fourier term, of index ν′\nu^{\prime}, over bb. This forces d∣ν′d\mid\nu^{\prime}, and the term moves to index ν=a⁢ν′/d\nu=a\nu^{\prime}/d. The coefficient at ν≠0\nu\neq 0 is

(2.7.T38) cTk⁢F⁢(ν)=∑a∣(k,ν)cF⁢(k⁢ν/a2).c_{T_{k}F}(\nu)=\sum_{a\mid(k,\nu)}c_{F}(k\nu/a^{2}).

The prefactor is 1 because, in the normalization (2.2) of [5, (1.15)], the factor y\sqrt{y} contributes a/d\sqrt{a/d}, and k−1/2⁢d⁢a/d=1k^{-1/2}d\sqrt{a/d}=1. For weight ℓ\ell, use Tk=k(ℓ−1)/2⁢∑a⁢d=kd−ℓ⁢∑b(⋅)T_{k}=k^{(\ell-1)/2}\sum_{ad=k}d^{-\ell}\sum_{b}(\cdot); the normalized coefficients aF⁢(ν)=ν−(ℓ−1)/2⁢ψF⁢(∞,ν)a_{F}(\nu)=\nu^{-(\ell-1)/2}\psi_{F}(\infty,\nu) satisfy the same identity at coprime (k,ν)(k,\nu).

Split n=n′⁢n′′n=n^{\prime}n^{\prime\prime}, n′′∣aT∞n^{\prime\prime}\mid a_{T}^{\infty}, (n′,aT)=1(n^{\prime},a_{T})=1, and put k=Aa⁢n′′k=A_{a}n^{\prime\prime}. Then (k,q)=(k,n′)=1(k,q)=(k,n^{\prime})=1. The number of pieces is

(2.7.T39) 𝒟≤(2⁢N1)ϵ⁢∏p∣aT(1−p−ϵ)−1≪ϵ𝒳2⁢ϵ,τ⁢(k)2≪ϵ𝒳ϵ.\mathcal{D}\leq(2N_{1})^{\epsilon}\prod_{p\mid a_{T}}(1-p^{-\epsilon})^{-1}\ll% _{\epsilon}\mathcal{X}^{2\epsilon},\quad\tau(k)^{2}\ll_{\epsilon}\mathcal{X}^{% \epsilon}.

The product bound is uniform in aTa_{T}. Choose pϵp_{\epsilon} so that (1−p−ϵ)−1≤pϵ(1-p^{-\epsilon})^{-1}\leq p^{\epsilon} for p>pϵp>p_{\epsilon}. The smaller primes contribute a constant depending only on ϵ\epsilon. The remaining product is at most |aT|ϵ|a_{T}|^{\epsilon}. On a Maass eigenspace VV, the transported n′′n^{\prime\prime}-functional is Y∘Tk∘WY\circ T_{k}\circ W, where Y⁢(v)=∑n′βn′⁢n′′⁢cv⁢(ς⁢n′)Y(v)=\sum_{n^{\prime}}\beta_{n^{\prime}n^{\prime\prime}}c_{v}(\varsigma n^{% \prime}). By Riesz representation and unitarity,

(2.7.T40) ∑uj∈V|ℓ2,n′′⁢(uj)|2≤τ⁢(k)2⁢kθKS⁢∑uj∈V|Y⁢(uj)|2.\sum_{u_{j}\in V}|\ell_{2,n^{\prime\prime}}(u_{j})|^{2}\leq\tau(k)^{2}k^{% \theta_{\mathrm{KS}}}\sum_{u_{j}\in V}|Y(u_{j})|^{2}.

The self-adjoint unramified TkT_{k} diagonalizes on the full level space. By Kim–Sarnak its norm is at most τ⁢(k)⁢kθKS/2\tau(k)k^{\theta_{\mathrm{KS}}/2}. For holomorphic forms replace kθKSk^{\theta_{\mathrm{KS}}} by 1, by Deligne. For negative index, cv⁢(−n′)=cv¯⁢(n′)¯c_{v}(-n^{\prime})=\overline{c_{\bar{v}}(n^{\prime})}. Conjugation permutes an orthonormal basis. Hence the positive-index quadratic bound holds with conjugated coefficients. The argument allows complex coefficients and any orthonormal basis of each eigenspace.

The continuous spectrum requires its own proof. Represent a cusp by u/wu/w, w∣qw\mid q, put w′=(w,q/w)w^{\prime}=(w,q/w). The orbit conditions in [5, Lemma 3.6, (3.9)–(3.11)] (c1,d1)=1,(c1,q)=w,c1⁢d1≡u⁢w(modw⁢w′)(c_{1},d_{1})=1,(c_{1},q)=w,c_{1}d_{1}\equiv uw\pmod{ww^{\prime}}, with c1=w⁢γc_{1}=w\gamma, give exactly

(2.7.T41) φu/w,∞,n⁢(z)\displaystyle\varphi_{u/w,\infty,n}(z) =(w′/(w⁢q))z⁢∑γ≥1,(γ,q/w)=1γ−2⁢z\displaystyle=(w^{\prime}/(wq))^{z}\sum_{\gamma\geq 1,(\gamma,q/w)=1}\gamma^{-% 2z}
∑d1modγ⁢w(d1,γ⁢w)=1,γ⁢d1≡u⁢(w′)e⁢(−n⁢d1/(γ⁢w)).\displaystyle\qquad\sum_{\begin{subarray}{c}d_{1}\bmod\gamma w\\ (d_{1},\gamma w)=1,\ \gamma d_{1}\equiv u(w^{\prime})\end{subarray}}e(-nd_{1}/% (\gamma w)).

For a character χmodw′\chi\bmod w^{\prime}, let 𝒱χ⁢(n;z)=∑umodw′∗χ⁢(u)⁢φu/w,∞,n⁢(z)\mathcal{V}_{\chi}(n;z)=\sum_{u\bmod w^{\prime}}^{*}\chi(u)\varphi_{u/w,\infty% ,n}(z). For (k,q)=(k,n′)=1(k,q)=(k,n^{\prime})=1, either sign of n′n^{\prime}, the identity is

(2.7.T42) 𝒱χ⁢(k⁢n′;z)=χ¯⁢(k)⁢(∑d∣kχ2⁢(d)⁢d1−2⁢z)⁢𝒱χ⁢(n′;z).\mathcal{V}_{\chi}(kn^{\prime};z)=\bar{\chi}(k)\left(\sum_{d\mid k}\chi^{2}(d)% d^{1-2z}\right)\mathcal{V}_{\chi}(n^{\prime};z).

To prove it, sum (2.7.T41) over uu. Write c1=c1′⁢c1′′c_{1}=c_{1}^{\prime}c_{1}^{\prime\prime}, where c1′′c_{1}^{\prime\prime} is supported on primes of qq and (c1′,q)=1(c_{1}^{\prime},q)=1. CRT factors the inner sum as χ⁢(c1′)⁢Gχ⁢(−n;c1′′)⁢cc1′⁢(n)\chi(c_{1}^{\prime})G_{\chi}(-n;c_{1}^{\prime\prime})c_{c_{1}^{\prime}}(n). The outer character supplies another χ⁢(c1′)\chi(c_{1}^{\prime}). Replacing the Gauss-sum variable by k¯⁢d1\bar{k}d_{1} gives χ¯⁢(k)\bar{\chi}(k) on c1′′c_{1}^{\prime\prime}. The other factor is

L(q)⁢(2⁢z,χ2)−1⁢∑d∣|n|,(d,q)=1χ2⁢(d)⁢d1−2⁢z,L^{(q)}(2z,\chi^{2})^{-1}\sum_{d\mid|n|,(d,q)=1}\chi^{2}(d)d^{1-2z},

by cc1′⁢(n)=∑d∣(c1′,n)d⁢μ⁢(c1′/d)c_{c_{1}^{\prime}}(n)=\sum_{d\mid(c_{1}^{\prime},n)}d\mu(c_{1}^{\prime}/d); this divisor sum factors at k⁢n′kn^{\prime}. All manipulations converge absolutely for ℜ⁡z>1\Re z>1. Both sides are meromorphic Fourier coefficients, so (2.7.T42) holds meromorphically, hence at z=1/2+i⁢tz=1/2+it outside a discrete set. There are finitely many cusp characters. Orthogonality in umodw′u\bmod w^{\prime} gives

(2.7.T43) ∑𝔠|∑n′vn′⁢|k⁢n′|i⁢t⁢φ𝔠,∞,k⁢n′⁢(1/2+i⁢t)|2≤τ⁢(k)2⁢∑𝔠|∑n′vn′⁢|n′|i⁢t⁢φ𝔠,∞,n′⁢(1/2+i⁢t)|2.\begin{split}&\sum_{\mathfrak{c}}\left|\sum_{n^{\prime}}v_{n^{\prime}}|kn^{% \prime}|^{it}\varphi_{\mathfrak{c},\infty,kn^{\prime}}(1/2+it)\right|^{2}\\ &\qquad\leq\tau(k)^{2}\sum_{\mathfrak{c}}\left|\sum_{n^{\prime}}v_{n^{\prime}}% |n^{\prime}|^{it}\varphi_{\mathfrak{c},\infty,n^{\prime}}(1/2+it)\right|^{2}.% \end{split}

Here the character eigenvalue is χ¯⁢(k)⁢∑d∣kχ2⁢(d)⁢(k/d2)i⁢t\bar{\chi}(k)\sum_{d\mid k}\chi^{2}(d)(k/d^{2})^{it}, of modulus at most τ⁢(k)\tau(k). Transport (2.7.T36) permutes the complete cusp set. For negative indices, φ𝔠⁢∞,−n′⁢(1/2+i⁢t)=φ𝔠⁢∞,n′⁢(1/2−i⁢t)¯\varphi_{\mathfrak{c}\infty,-n^{\prime}}(1/2+it)=\overline{\varphi_{\mathfrak{% c}\infty,n^{\prime}}(1/2-it)}. Changing tt to −t-t and conjugating coefficients converts each symmetric integration window to DI’s positive-index continuous quadratic form. The discrete exceptional set is null for the d⁢tdt-integral.

2.7.4. Regular, continuous, and holomorphic estimates

Put QT=R⁢SQ_{T}=RS, Ln′′=N′/n′′≥1/2L_{n^{\prime\prime}}=N^{\prime}/n^{\prime\prime}\geq 1/2. Include |t|<1|t|<1 among the spectral windows KK. By (2.7.T31), the undivided transform satisfies the following bound.

(2.7.T44) 𝔥⁢(K)≪𝔅⁢(𝐭)⁢𝒳o⁢(1)⁢(1+Z)−1⁢min⁡{1,((1+Z)/K)3}.\mathfrak{h}(K)\ll\mathfrak{B}(\mathbf{t})\mathcal{X}^{o(1)}(1+Z)^{-1}\min\{1,% ((1+Z)/K)^{3}\}.

For Maass forms use the positive DI weights 1/cosh⁡π⁢κj1/\cosh\pi\kappa_{j}. For holomorphic forms use the positive weights (ℓ−1)!/(4⁢π)ℓ−1(\ell-1)!/(4\pi)^{\ell-1}. These weights are split equally between the two Cauchy–Schwarz factors. For the continuous spectrum use plain d⁢tdt. Take the supremum of eς⁢(t)e_{\varsigma}(t) outside the positive quadratic form. By (2.7.T17), |eς|≤|Φς|/2|e_{\varsigma}|\leq|\Phi_{\varsigma}|/2, with Φ+=ϕ^,Φ−=ϕˇ\Phi_{+}=\widehat{\phi},\Phi_{-}=\check{\phi}. Thus every norm uses a positive measure.

[5, Theorem 2] at ∞\infty gives the mm-side

(2.7.T45) ∑q≍QTτ⁢(q)⁢(K2+M1+ϵ/q)⁢M≪𝒳3⁢ϵ⁢(QT⁢K2+M)⁢M.\sum_{q\asymp Q_{T}}\tau(q)(K^{2}+M^{1+\epsilon}/q)M\ll\mathcal{X}^{3\epsilon}% (Q_{T}K^{2}+M)M.

For the nn-side, Cauchy–Schwarz over n′′n^{\prime\prime} costs 𝒟\mathcal{D}. Apply (2.7.T40) or (2.7.T43). Then use [5, Theorem 2] at scale Ln′′L_{n^{\prime\prime}}. The bound is

(2.7.T46) ≪𝒟⁢∑n′′τ⁢(k)2⁢kθKS⁢(K2+Ln′′1+ϵ/QT)⁢‖b♭⁢(n′′)‖22.\ll\mathcal{D}\sum_{n^{\prime\prime}}\tau(k)^{2}k^{\theta_{\mathrm{KS}}}(K^{2}% +L_{n^{\prime\prime}}^{1+\epsilon}/Q_{T})\|b^{\flat}(n^{\prime\prime})\|_{2}^{% 2}.

On continuous and holomorphic parts (2.7.T46) holds with kθKSk^{\theta_{\mathrm{KS}}} replaced by 1. [5, Theorem 2] allows the endpoint M=1/2M=1/2 in (2.7.T45).

Use K2+U≤((1+Z)2+U)max(1,K/(1+Z))2K^{2}+U\leq((1+Z)^{2}+U)\max(1,K/(1+Z))^{2}. The sum over dyadic KK of the latter factor times the cubic decay in (2.7.T44) is O⁢(1+log⁡(2+Z))O(1+\log(2+Z)). The cubic decay also absorbs a factor KϵK^{\epsilon}: with it the sum is O⁢((1+Z)ϵ⁢log⁡(2+Z))O((1+Z)^{\epsilon}\log(2+Z)). Thus the bound (2.6) in the form (K2+N/q)⁢(K⁢N)ϵ(K^{2}+N/q)(KN)^{\epsilon} gives the same estimate. Cauchy–Schwarz and (2.7.T39) therefore yield

(2.7.T47) |ℒ𝐭reg|≪\displaystyle|\mathcal{L}_{\mathbf{t}}^{\rm reg}|\ll{} 𝒳4⁢ϵ⁢𝔅⁢(𝐭)⁢(1+Z)−1⁢[(QT⁢(1+Z)2+M)⁢M]1/2\displaystyle\mathcal{X}^{4\epsilon}\mathfrak{B}(\mathbf{t})(1+Z)^{-1}[(Q_{T}(% 1+Z)^{2}+M)M]^{1/2}
×[∑n′′(Aa⁢n′′)θKS⁢((1+Z)2+Ln′′/QT)⁢‖b♭⁢(n′′)‖22]1/2.\displaystyle\times\left[\sum_{n^{\prime\prime}}(A_{a}n^{\prime\prime})^{% \theta_{\mathrm{KS}}}((1+Z)^{2}+L_{n^{\prime\prime}}/Q_{T})\|b^{\flat}(n^{% \prime\prime})\|_{2}^{2}\right]^{1/2}.

The same calculation with plain d⁢tdt proves (2.7.T47) for the continuous part. It uses the symmetry shown after (2.7.T43). The same cubic summation proves absolute convergence of its integral, justifying the window partition. Thus the continuous part uses the measure d⁢tdt throughout.

2.7.5. Exceptional spectrum and the one-integer block

Write L=Ln′′L=L_{n^{\prime\prime}}, Ξ=1/Z\Xi=1/Z, Ω=1+QT/L\Omega=1+Q_{T}/L. Since 0<ϑj≤θKS0<\vartheta_{j}\leq\theta_{\mathrm{KS}},

(2.7.T48) 1+Ξϑj≤2⁢(1+Ξ/Ω)ϑj⁢Ωϑj/2.1+\Xi^{\vartheta_{j}}\leq 2(1+\Xi/\sqrt{\Omega})^{\vartheta_{j}}\Omega^{% \vartheta_{j}/2}.

Fix n′′n^{\prime\prime}. Apply Cauchy–Schwarz, assigning Y=(1+Ξ/Ω)2Y=(1+\Xi/\sqrt{\Omega})^{2} to the mm-side and Ω\Omega to the nn-side. With ℓ2,n′′\ell_{2,n^{\prime\prime}} as in (2.7.T40), the two exceptional quadratic forms are

ℳn′′\displaystyle\mathcal{M}_{n^{\prime\prime}} =∑r,s∑exc(r⁢s)Yϑj⁢|∑mαm⁢ρj⁢∞⁢(m)|2,\displaystyle=\sum_{r,s}\sum_{\rm exc}^{(rs)}Y^{\vartheta_{j}}\Bigl{|}\sum_{m}% \alpha_{m}\rho_{j\infty}(m)\Bigr{|}^{2},
𝒩n′′\displaystyle\mathcal{N}_{n^{\prime\prime}} =∑r,s∑exc(r⁢s)Ωϑj⁢|ℓ2,n′′⁢(uj)|2,\displaystyle=\sum_{r,s}\sum_{\rm exc}^{(rs)}\Omega^{\vartheta_{j}}|\ell_{2,n^% {\prime\prime}}(u_{j})|^{2},

with r,sr,s over the support of bb. Let L≥1/2L\geq 1/2. Apply (2.7.T40) and Theorem 2.2 at level r⁢s>QTrs>Q_{T}, length LL and Y=ΩY=\Omega. Since L⁢Ω/(r⁢s)≤1+L/QTL\Omega/(rs)\leq 1+L/Q_{T}, the factor in (2.8) is ≪max(1,L)ϵ(1+L/QT)\ll\max(1,L)^{\epsilon}(1+L/Q_{T}). Summing over r,sr,s gives

(2.7.T49) 𝒩n′′≪𝒳2⁢ϵ⁢(Aa⁢n′′)θKS⁢(1+L/QT)⁢‖b♭⁢(n′′)‖22.\mathcal{N}_{n^{\prime\prime}}\ll\mathcal{X}^{2\epsilon}(A_{a}n^{\prime\prime}% )^{\theta_{\mathrm{KS}}}(1+L/Q_{T})\|b^{\flat}(n^{\prime\prime})\|_{2}^{2}.

Put Q′=4⁢QTQ^{\prime}=4Q_{T}, Y0⁢(M)=(Q′+M)2/MY_{0}(M)=(Q^{\prime}+M)^{2}/M, and

(2.7.T50) Zn′′=C2⁢S2⁢R(QT+M)2⁢(L+QT).Z_{n^{\prime\prime}}=\frac{C^{2}S^{2}R}{(Q_{T}+M)^{2}(L+Q_{T})}.

The identity Ξ2/Ω=(16⁢π2⁢Aa⁢n′′)−1⁢C2⁢S2⁢R/[M⁢(L+QT)]\Xi^{2}/\Omega=(16\pi^{2}A_{a}n^{\prime\prime})^{-1}C^{2}S^{2}R/[M(L+Q_{T})] gives

(2.7.T51) max(1,Y/Y0(M))θKS≤1+(Aan′′)−θKSZn′′θKS.\max(1,Y/Y_{0}(M))^{\theta_{\mathrm{KS}}}\leq 1+(A_{a}n^{\prime\prime})^{-% \theta_{\mathrm{KS}}}Z_{n^{\prime\prime}}^{\theta_{\mathrm{KS}}}.

Let M≥1M\geq 1. Then (2.9) applies to every integer interval inside (M,2⁢M](M,2M]. Use the positive Hilbert space with weights YϑjY^{\vartheta_{j}}. Apply Abel summation to mi⁢t1m^{it_{1}}. The norm is at most 1+|t1|⁢log⁡21+|t_{1}|\log 2 times the maximum interval norm. Take the maximum after the norm. It remains outside the spectral sum. Apply (2.9) at Y0⁢(M)Y_{0}(M). Then use monotonicity

(2.7.T52) Yϑj≤max(1,Y/Y0)θKSY0ϑj,Y^{\vartheta_{j}}\leq\max(1,Y/Y_{0})^{\theta_{\mathrm{KS}}}Y_{0}^{\vartheta_{j% }},

For fixed qq, the coefficient αm\alpha_{m} is independent of the factorization q=r⁢sq=rs. Put w⁢(q)=#⁢{(r,s)⁢ in the current support:r⁢s=q}w(q)=\#\{(r,s)\text{ in the current support}:rs=q\} and Δ=max2≤q≤Q′⁡w⁢(q)\Delta=\max_{2\leq q\leq Q^{\prime}}w(q), and let ω0⁢(q)\omega_{0}(q) count the distinct prime factors of qq. Since (r,s)=1(r,s)=1, w⁢(q)≤2ω0⁢(q)≤τ⁢(q)≪ηqηw(q)\leq 2^{\omega_{0}(q)}\leq\tau(q)\ll_{\eta}q^{\eta}. In the Hilbert space over all levels 2≤q≤Q′2\leq q\leq Q^{\prime} and their exceptional forms, vector-valued Abel summation gives ℳn′′1/2≤Δ1/2⁢(1+|t1|⁢log⁡2)⁢supI⊂(M,2⁢M]FY⁢(I)1/2\mathcal{M}_{n^{\prime\prime}}^{1/2}\leq\Delta^{1/2}(1+|t_{1}|\log 2)\sup_{I% \subset(M,2M]}F_{Y}(I)^{1/2}, where FY⁢(I)=∑2≤q≤Q′∑exc(q)Yϑj⁢|∑m∈Iρj⁢∞⁢(m)|2F_{Y}(I)=\sum_{2\leq q\leq Q^{\prime}}\sum_{\rm exc}^{(q)}Y^{\vartheta_{j}}|% \sum_{m\in I}\rho_{j\infty}(m)|^{2} and II ranges over integer intervals. Thus the supremum is outside the whole quadratic form. Apply (2.9) with exponent η=ϵ/2\eta=\epsilon/2 at Y0⁢(M)Y_{0}(M). By (2.7.T4), M≤H≤4⁢𝒳2M\leq H\leq 4\mathcal{X}^{2} when ϵ1≤1\epsilon_{1}\leq 1; also Q′=4⁢QT≤4⁢𝒳Q^{\prime}=4Q_{T}\leq 4\mathcal{X}. Consequently Δ⁢(Q′⁢M)η≪ϵ𝒳2⁢ϵ\Delta(Q^{\prime}M)^{\eta}\ll_{\epsilon}\mathcal{X}^{2\epsilon}. Together with (2.7.T51)–(2.7.T52), this is absorbed in 𝒳3⁢ϵ\mathcal{X}^{3\epsilon} and gives

(2.7.T53) ℳn′′≪𝒳3⁢ϵ⁢(1+t12)⁢[1+(Aa⁢n′′)−θKS⁢Zn′′θKS]⁢(QT+M)⁢M.\mathcal{M}_{n^{\prime\prime}}\ll\mathcal{X}^{3\epsilon}(1+t_{1}^{2})[1+(A_{a}% n^{\prime\prime})^{-\theta_{\mathrm{KS}}}Z_{n^{\prime\prime}}^{\theta_{\mathrm% {KS}}}](Q_{T}+M)M.

[5, (8.17)] excludes M=1/2M=1/2. We prove that endpoint here. Let p⁢(q)p(q) be the least prime not dividing qq. Every smaller prime divides qq. The classical Chebyshev lower bound Θ⁢(x):=∑ℓ≤xlog⁡ℓ≫x\Theta(x):=\sum_{\ell\leq x}\log\ell\gg x for x≥2x\geq 2 (see [17]) gives

(2.7.T54) p⁢(q)≪1+log⁡q.p(q)\ll 1+\log q.

Here Θ⁢(p⁢(q)−1)≤log⁡q\Theta(p(q)-1)\leq\log q, because the product of all smaller primes divides qq; the case p⁢(q)=2p(q)=2 is immediate. The implied constant in (2.7.T54) is absolute and independent of aTa_{T}.

On an exceptional eigenspace VV, let vv represent u↦cu⁢(1)u\mapsto c_{u}(1). Self-adjointness and (2.7.T38) show that Tp⁢v,Tp2⁢vT_{p}v,T_{p^{2}}v represent cu⁢(p),cu⁢(p2)c_{u}(p),c_{u}(p^{2}). The Hecke identity Tp2=Tp2+IT_{p}^{2}=T_{p^{2}}+I, with ‖Tp‖≤2⁢pθKS/2\|T_{p}\|\leq 2p^{\theta_{\mathrm{KS}}/2}, gives

(2.7.T55) ∑uj∈V|cuj⁢(1)|2≤8⁢pθKS⁢∑uj∈V|cuj⁢(p)|2+2⁢∑uj∈V|cuj⁢(p2)|2.\sum_{u_{j}\in V}|c_{u_{j}}(1)|^{2}\leq 8p^{\theta_{\mathrm{KS}}}\sum_{u_{j}% \in V}|c_{u_{j}}(p)|^{2}+2\sum_{u_{j}\in V}|c_{u_{j}}(p^{2})|^{2}.

Multiply by YϑjY^{\vartheta_{j}}, which is constant on VV. Group levels by p⁢(q)≤P:=C0⁢(1+log⁡(4⁢QT))p(q)\leq P:=C_{0}(1+\log(4Q_{T})), where C0C_{0} is an absolute constant supplied by (2.7.T54). Positivity permits enlarging each group to all 2≤q≤Q′2\leq q\leq Q^{\prime}. For k=p,p2k=p,p^{2}, the singleton {k}\{k\} is an integer interval in (k/2,k](k/2,k], with k/2≥1k/2\geq 1, so (2.9) applies at N=k/2N=k/2. In DI’s terms, subtract the initial intervals (k/2,k](k/2,k] and (k/2,k−1](k/2,k-1]. The resulting factor 4 is included in cϵc_{\epsilon}.

For the endpoint, the same factorization count multiplies the level-qq quadratic form by at most τ⁢(q)\tau(q). The following bound holds for any positive exponent. In its use in (2.7.T57), take η=min⁡(ϵ/2,1/4)\eta=\min(\epsilon/2,1/4) and use τ⁢(q)≪ϵQTϵ/2\tau(q)\ll_{\epsilon}Q_{T}^{\epsilon/2} for QT<q≤4⁢QTQ_{T}<q\leq 4Q_{T}. This keeps their combined loss within the displayed ϵ\epsilon-power after adjustment of its constant. At Yk=(Q′+k/2)2/(k/2)Y_{k}=(Q^{\prime}+k/2)^{2}/(k/2) it gives

(2.7.T56) ∑2≤q≤Q′∑exc(q)Yϑj|cuj(k)|2≪ϵ(Q′k)ϵ(Q′+k/2)kmax(1,Y/Yk)θKS.\sum_{2\leq q\leq Q^{\prime}}\sum_{\rm exc}^{(q)}Y^{\vartheta_{j}}|c_{u_{j}}(k% )|^{2}\ll_{\epsilon}(Q^{\prime}k)^{\epsilon}(Q^{\prime}+k/2)k\max(1,Y/Y_{k})^{% \theta_{\mathrm{KS}}}.

Since Y0⁢(1/2)/Yk=k⁢(Q′+1/2)2/(Q′+k/2)2≤k≤9⁢k/4Y_{0}(1/2)/Y_{k}=k(Q^{\prime}+1/2)^{2}/(Q^{\prime}+k/2)^{2}\leq k\leq 9k/4, insert (2.7.T56), with its exponent taken as η\eta, in (2.7.T55). Sum over the at most PP possible primes:

(2.7.T57) ∑QT<q≤4⁢QTτ⁢(q)⁢∑exc(q)Yϑj⁢|cuj⁢(1)|2\displaystyle\sum_{Q_{T}<q\leq 4Q_{T}}\tau(q)\sum_{\rm exc}^{(q)}Y^{\vartheta_% {j}}|c_{u_{j}}(1)|^{2}
≪ϵQTϵP6(QT+12)12max(1,Y/Y0(1/2))θKS,\displaystyle\qquad\ll_{\epsilon}Q_{T}^{\epsilon}P^{6}(Q_{T}+\tfrac{1}{2})% \tfrac{1}{2}\,\max(1,Y/Y_{0}(1/2))^{\theta_{\mathrm{KS}}},

for 0<ϵ≤1/40<\epsilon\leq 1/4, with the implied constant including the divisor bound and the change from ϵ\epsilon to η\eta. Before simplification, the sum is at most a constant times

cϵ⁢(9/4)θKS⁢Q′⁣1+ϵ⁢∑p≤P(8⁢p2+2⁢θKS+ϵ+2⁢p4+2⁢θKS+2⁢ϵ);c_{\epsilon}(9/4)^{\theta_{\mathrm{KS}}}Q^{\prime 1+\epsilon}\sum_{p\leq P}(8p% ^{2+2\theta_{\mathrm{KS}}+\epsilon}+2p^{4+2\theta_{\mathrm{KS}}+2\epsilon});

this is ≪ϵQT1+ϵ⁢P6\ll_{\epsilon}Q_{T}^{1+\epsilon}P^{6}, because 5+2⁢θKS+2⁢ϵ≤65+2\theta_{\mathrm{KS}}+2\epsilon\leq 6. The loss P6P^{6} is logarithmic and uniform in aTa_{T}. In particular P6≪ϵ𝒳ϵP^{6}\ll_{\epsilon}\mathcal{X}^{\epsilon}; together with the factorization loss already included in (2.7.T57), this fits the 𝒳3⁢ϵ\mathcal{X}^{3\epsilon} allowance of (2.7.T53). Together with (2.7.T51), this proves (2.7.T53) also for M=1/2M=1/2. Since α1=1\alpha_{1}=1, Abel summation costs nothing here.

Apply the triangle inequality over n′′n^{\prime\prime} before Cauchy–Schwarz. Then (2.7.T49), (2.7.T53), and (2.7.T32) give

(2.7.T58) |ℒ𝐭exc|≪\displaystyle|\mathcal{L}_{\mathbf{t}}^{\rm exc}|\ll{} 𝒳6⁢ϵ⁢𝔅⁢(𝐭)⁢(1+|t1|)⁢(1+Z)−1⁢M⁢(QT+M)\displaystyle\mathcal{X}^{6\epsilon}\mathfrak{B}(\mathbf{t})(1+|t_{1}|)(1+Z)^{% -1}\sqrt{M(Q_{T}+M)}
×∑n′′[(Aan′′)θKS/2+Zn′′θKS/2]((L+QT)/QT)1/2∥b♭(n′′)∥2.\displaystyle\times\sum_{n^{\prime\prime}}\big{[}(A_{a}n^{\prime\prime})^{% \theta_{\mathrm{KS}}/2}+Z_{n^{\prime\prime}}^{\theta_{\mathrm{KS}}/2}\big{]}((% L+Q_{T})/Q_{T})^{1/2}\|b^{\flat}(n^{\prime\prime})\|_{2}.

There is no exceptional continuous or holomorphic spectrum.

2.7.6. The four terms and completion of the proof

Put

(2.7.T59) 𝔗=Aa⁢M⁢N′/(C2⁢S),M0=C⁢S/D,ϖ=4⁢𝒳ϵ2.\mathfrak{T}=A_{a}MN^{\prime}/(C^{2}S),\quad M_{0}=CS/D,\quad\varpi=4\mathcal{% X}^{\epsilon_{2}}.

The quantity 𝔗\mathfrak{T} is unrelated to the cell endpoint TT of Section 3. Then M≤ϖ⁢M0M\leq\varpi M_{0}, Z2⁢QT=16⁢π2⁢𝔗Z^{2}Q_{T}=16\pi^{2}\mathfrak{T}, so (1+Z)−2⁢QT−1≍(QT+𝔗)−1(1+Z)^{-2}Q_{T}^{-1}\asymp(Q_{T}+\mathfrak{T})^{-1}. Square (2.7.T47) and multiply by D2⁢RD^{2}R. Apart from the stated auxiliary powers, sum the following over n′′n^{\prime\prime}.

(2.7.T60) (Aa⁢n′′)θKS⁢D2⁢R⁢M⁢(M+QT+𝔗)⁢(L+QT+𝔗)QT+𝔗⁢‖b♭⁢(n′′)‖22.(A_{a}n^{\prime\prime})^{\theta_{\mathrm{KS}}}D^{2}R\frac{M(M+Q_{T}+\mathfrak{% T})(L+Q_{T}+\mathfrak{T})}{Q_{T}+\mathfrak{T}}\|b^{\flat}(n^{\prime\prime})\|_% {2}^{2}.

The first, noncancelling branch of (2.7.T58) has the same bound. Termwise, use

(2.7.T61) (QT+M)⁢(L+QT)/QT≤[QT⁢(1+Z)2+M]⁢[(1+Z)2+L/QT].(Q_{T}+M)(L+Q_{T})/Q_{T}\leq[Q_{T}(1+Z)^{2}+M][(1+Z)^{2}+L/Q_{T}].

To obtain (2.42), use the following identity.

(2.7.T62) QT⁢(M+QT+𝔗)⁢(L+QT+𝔗)QT+𝔗=(L+QT)⁢(M+QT)+QT⁢𝔗−L⁢M⁢𝔗QT+𝔗.\frac{Q_{T}(M+Q_{T}+\mathfrak{T})(L+Q_{T}+\mathfrak{T})}{Q_{T}+\mathfrak{T}}=(% L+Q_{T})(M+Q_{T})+Q_{T}\mathfrak{T}-\frac{LM\mathfrak{T}}{Q_{T}+\mathfrak{T}}.

Multiply (2.7.T62) by M/QTM/Q_{T}, then drop the last (nonpositive) term:

M⁢(M+QT+𝔗)⁢(L+QT+𝔗)QT+𝔗≤M⁢(L+QT)⁢(M+QT)QT+M⁢𝔗.\frac{M(M+Q_{T}+\mathfrak{T})(L+Q_{T}+\mathfrak{T})}{Q_{T}+\mathfrak{T}}\leq% \frac{M(L+Q_{T})(M+Q_{T})}{Q_{T}}+M\mathfrak{T}.

Since D2⁢M/S≤ϖ⁢C⁢DD^{2}M/S\leq\varpi CD and M+QT≤ϖ⁢S⁢(C+D⁢R)/DM+Q_{T}\leq\varpi S(C+DR)/D, it follows that

(2.7.T63) D2⁢R⁢M⁢(M+QT+𝔗)⁢(L+QT+𝔗)QT+𝔗\displaystyle D^{2}R\frac{M(M+Q_{T}+\mathfrak{T})(L+Q_{T}+\mathfrak{T})}{Q_{T}% +\mathfrak{T}}
≤ϖ2⁢{C⁢S⁢(L+R⁢S)⁢(C+D⁢R)+Aa⁢N′⁢R⁢S}.\displaystyle\qquad\leq\varpi^{2}\{CS(L+RS)(C+DR)+A_{a}N^{\prime}RS\}.

The last term follows from D2⁢R⁢M⁢𝔗=Aa⁢N′⁢R⁢S⁢(D⁢M/(C⁢S))2D^{2}RM\mathfrak{T}=A_{a}N^{\prime}RS(DM/(CS))^{2}. Using L≤N1/n′′L\leq N_{1}/n^{\prime\prime}, N′≤N1N^{\prime}\leq N_{1}, Aa≤AA_{a}\leq A proves the first two terms of (2.42), with AθKS⁢(n′′)θKSA^{\theta_{\mathrm{KS}}}(n^{\prime\prime})^{\theta_{\mathrm{KS}}} kept explicit.

For the cancelling branch of (2.7.T58), use

(2.7.T64) Zn′′θKS⁢(L+QT)≤(C2⁢S2⁢R)θKS⁢(QT+M)−2⁢θKS⁢(N1+QT)1−θKS,Z_{n^{\prime\prime}}^{\theta_{\mathrm{KS}}}(L+Q_{T})\leq(C^{2}S^{2}R)^{\theta_% {\mathrm{KS}}}(Q_{T}+M)^{-2\theta_{\mathrm{KS}}}(N_{1}+Q_{T})^{1-\theta_{% \mathrm{KS}}},

and ∑n′′‖b♭⁢(n′′)‖2≤𝒟1/2⁢‖b‖2\sum_{n^{\prime\prime}}\|b^{\flat}(n^{\prime\prime})\|_{2}\leq\mathcal{D}^{1/2% }\|b\|_{2}. Since M↦M⁢(QT+M)1−2⁢θKSM\mapsto M(Q_{T}+M)^{1-2\theta_{\mathrm{KS}}} is increasing, substitute M0M_{0}, paying at most ϖ2−2⁢θKS\varpi^{2-2\theta_{\mathrm{KS}}}. The resulting identity is

(2.7.T65) D2⁢R⁢M0⁢(QT+M0)1−2⁢θKS⁢(C2⁢S2⁢R)θKS⁢(N1+QT)1−θKSQT\displaystyle\frac{D^{2}RM_{0}(Q_{T}+M_{0})^{1-2\theta_{\mathrm{KS}}}(C^{2}S^{% 2}R)^{\theta_{\mathrm{KS}}}(N_{1}+Q_{T})^{1-\theta_{\mathrm{KS}}}}{Q_{T}}
=C⁢S⁢(C⁢D⁢R)2⁢θKS⁢(N1+R⁢S)1−θKS⁢(C+D⁢R)1−2⁢θKS.\displaystyle\qquad=CS(CD\sqrt{R})^{2\theta_{\mathrm{KS}}}(N_{1}+RS)^{1-\theta% _{\mathrm{KS}}}(C+DR)^{1-2\theta_{\mathrm{KS}}}.

This is the third term of (2.42). The fourth was (2.7.T3). The truncated tail is smaller than it.

To account for all losses, reconstruct the block sum as D⁢R⁢(2⁢π)−4⁢∫ℒ𝐭⁢𝑑𝐭D\sqrt{R}(2\pi)^{-4}\int\mathcal{L}_{\mathbf{t}}\,d\mathbf{t}. Equation (2.7.T11) gives ∫𝔅⁢(𝐭)⁢(1+|t1|)⁢𝑑𝐭≪𝒳17⁢ϵ2\int\mathfrak{B}(\mathbf{t})(1+|t_{1}|)\,d\mathbf{t}\ll\mathcal{X}^{17\epsilon% _{2}}. The amplitude’s ϖ\varpi loss in (2.7.T63) is at most 𝒳ϵ2\mathcal{X}^{\epsilon_{2}} after taking its square root. The log partitions and divisor factors cost 𝒳O⁢(ϵ1)\mathcal{X}^{O(\epsilon_{1})}. This includes the DI small ϵ\epsilon losses, 𝒟\mathcal{D}, and the one-integer P6P^{6} loss. The bound is uniform in aTa_{T}. Consequently the final loss is

(2.7.T66) 𝒳O⁢(ϵ1)+18⁢ϵ0.\mathcal{X}^{O(\epsilon_{1})+18\epsilon_{0}}.

Choose the freely available ϵ1\epsilon_{1} small enough relative to the requested ϵ\epsilon. Equations (2.7.T63), (2.7.T65), and (2.7.T3) then prove (2.41)–(2.43), with loss 𝒳ϵ+18⁢ϵ0\mathcal{X}^{\epsilon+18\epsilon_{0}}, for both signs and including the M=1/2M=1/2 block. This proves Theorem 2.8 in the form used in Section 3, (3.14)–(3.15).

3. Dispersion for abstract sources

This section proves a local implication for an abstract source. It uses Linnik’s dispersion method [28]. The second-dispersion setup has close precedents in Maynard [7] and Lichtman [1, §5]; the proof below tracks its own coefficient masks, restoration terms, and moving residue. The local hypotheses are (H1)–(H5). The source-wide estimate (H6) and the box-family coefficient bound (H7) are used only in the global summation in Section 3.10. Each application verifies the required conditions for its own measures. The geometric and source partition results appear below. Theorem 2.8 is stated in Section 2, (2.38)–(2.43), and derived from the classical inputs in §2.7. We keep its full moving-frequency bracket. The local estimate has three terms. The restoration error EGRE_{\rm GR} is bounded apart from the spectral term.

3.1. Notation and source hypotheses

Local notation. Put L=log⁡XL=\log X; §3.10 writes log⁡N\log N explicitly. TT is the lower endpoint of the selected Type-II cell, as in Lemma B.3 for the prime source. Here ϑsp=7/32\vartheta_{\rm sp}=7/32. The zero-mode functional is 𝒵⁢(V)\mathcal{Z}(V) of (3.31); ZZ is the scale of zz. BB is a Heath–Brown box. DD and CC are the scales of bb and cc in (3.62), as in Theorem 2.8. Bz,yB_{z,y} is the count (3.70). SS is the scale of γ2\gamma_{2}. SBPSDTS_{B}^{\rm PSDT} denotes the signed box sum in (3.12). Type I-1 and I-2 denote boxes with one and two large variables (§3.11). Since log⁡X=log⁡N+O⁢(log⁡log⁡N)\log X=\log N+O(\log\log N), fixed powers of log⁡X\log X and log⁡N\log N are comparable. ITI_{T} is the selected integer interval of a Type-II cell; INI_{N} is reserved for the source interval of Theorem 1.2. Some letters have local meanings, fixed at each use. The letter CC is a fixed logarithmic exponent in (3.13), (3.92) and similar bounds, and the scale of cc from (3.62) on. Similarly, ε\varepsilon is the source cut of Theorem 1.2, ϵ\epsilon is a small fixed exponent, and εy∈{±1}\varepsilon_{y}\in\{\pm 1\} is a sign. The letter YY is a summation length in (3.16)–(3.19) and (3.35). It is the auxiliary scale H∗⁢S⁢FH_{*}SF in the spectral step near (3.70). In Theorem 1.2 it is the smooth-prime cutoff Dσ2D^{\sigma^{2}}. 𝒯\mathcal{T} is the tuple set of §3; it is unrelated to TT.

Let NN be a sufficiently large even integer and let aa be a positive integer. Fix 0<Kscale<∞0<K_{\rm scale}<\infty and

0<σ≤10−10,τ=σ9,δ=30⁢σ,ϑsp=7/32,η=σ/1000,0<\sigma\leq 10^{-10},\quad\tau=\sigma^{9},\quad\delta=30\sigma,\quad\vartheta% _{\rm sp}=7/32,\quad\eta=\sigma/1000,
(3.1) ηL=10−4,ℓ0=53412−ηL2=2648972060000,cσ=ℓ0⁢σ2/4.\eta_{L}=10^{-4},\qquad\ell_{0}=\frac{53}{412}-\frac{\eta_{L}}{2}=\frac{264897% }{2060000},\qquad c_{\sigma}=\ell_{0}\sigma^{2}/4.

The local product scale is N/(log⁡N)Kscale≤X≤NN/(\log N)^{K_{\rm scale}}\leq X\leq N. All implied constants in this section may depend on the fixed KscaleK_{\rm scale} and the fixed source bounds. They may also depend on the parameters displayed at the point of use. Put

(3.2) L=log⁡X,z0=X1/(log⁡log⁡X)3,u0=Nℓ0⁢σ2,p0=min⁡{p⁢ prime:p∤2⁢a⁢N}.\begin{gathered}L=\log X,\quad z_{0}=X^{1/(\log\log X)^{3}},\quad u_{0}=N^{% \ell_{0}\sigma^{2}},\\ p_{0}=\min\{p\text{ prime}:p\nmid 2aN\}.\end{gathered}

In particular, N/u0=N1−ℓ0⁢σ2N/u_{0}=N^{1-\ell_{0}\sigma^{2}}.

Thus p0≥3p_{0}\geq 3 and p0∤a⁢Np_{0}\nmid aN. Every prime below p0p_{0} divides 2⁢a⁢N2aN. Chebyshev’s bound ∑p<p0log⁡p≫p0\sum_{p<p_{0}}\log p\gg p_{0} gives p0≪log⁡(2⁢a⁢N)p_{0}\ll\log(2aN). By C4 below, a≤X⁢(log⁡N)Kscalea\leq X(\log N)^{K_{\rm scale}}, so p0≪log⁡N<z0≤u0p_{0}\ll\log N<z_{0}\leq u_{0} eventually. Write

(3.3) 𝒮t⁢(q;a)=1t≡a⁢(q)−1(t,q)=1φ⁢(q).\mathcal{S}_{t}(q;a)=1_{t\equiv a\ (q)}-\frac{1_{(t,q)=1}}{\varphi(q)}.

A Class-II box consists of the following data. These are source hypotheses.

C1. Exact unrestricted coefficient. Fix a source term, a prefix cell, a sign of the well-factorable remainder in Iwaniec’s theorem [10, Theorem 4], and a tail-label vector bb. Its coefficient is exactly

(3.4) Cb⁢(q)=∑d,(pj)λd⁢1q=d⁢∏j∈Jpj,|λd|≤1,C_{b}(q)=\sum_{d,(p_{j})}\lambda_{d}1_{q=d\prod_{j\in J}p_{j}},\qquad|\lambda_% {d}|\leq 1,

where each pjp_{j} ranges independently over its fixed prime set and pj≥uLp_{j}\geq u_{L}. Here uL≥u0u_{L}\geq u_{0} is the source’s lower cutoff for labelled tail primes, and P⁢(uL;N)=∏p<uL,p∤2⁢NpP(u_{L};N)=\prod_{p<u_{L},\,p\nmid 2N}p. The variable d∣P⁢(uL;N)d\mid P(u_{L};N) is squarefree with the cap of that theorem. The full modulus is at most X0.6X^{0.6}. Every supported full modulus is prime to 2⁢N2N. Selectors are constant on the block. Exact identities remove the equal-tail, prefix-diagonal, natural-comparator, cut, and selector-transfer corrections. Each is a separate contribution outside (3.4).

C2. Exact factors. There is a labelled partition J=J1⊔J2⊔J3J=J_{1}\sqcup J_{2}\sqcup J_{3}, with dd attached to J1J_{1}, such that

(3.5) Cb=Cslot⁢(γ1∗γ2∗γ3),Cslot=∏i=13|Ji|!=Oσ⁢(1),|γi|≤1.C_{b}=C_{\rm slot}(\gamma_{1}*\gamma_{2}*\gamma_{3}),\qquad C_{\rm slot}=\prod% _{i=1}^{3}|J_{i}|!=O_{\sigma}(1),\qquad|\gamma_{i}|\leq 1.

The last two factors are u0u_{0}-rough. If Js=∅J_{s}=\varnothing for s=2,3s=2,3, then γs⁢(m)=𝟏m=1\gamma_{s}(m)=\mathbf{1}_{m=1}. The factor γ1\gamma_{1} always contains the smooth-divisor sum of Iwaniec’s theorem. If J1=∅J_{1}=\varnothing, then γ1⁢(m)=∑dλd⁢𝟏m=d\gamma_{1}(m)=\sum_{d}\lambda_{d}\mathbf{1}_{m=d}. Equality (3.5) holds on all supported moduli, with repeated-prime multiplicities. The source’s labelled-tuple map proves it. It covers moduli with repeated primes as well as squarefree ones.

C3. Packing. Localize dyadically the first factor γ1\gamma_{1} at ≍Q\asymp Q, γ3\gamma_{3} at ≍R\asymp R, and γ2\gamma_{2} at ≍S\asymp S. Here TT is the lower endpoint of the selected Type-II cell; NIN_{I} is its integer length. Enlarge the sufficiently-large threshold for NN to absorb fixed dyadic constants. Then

(3.6) Q<T⁢X−29⁢σ,Q⁢R⁢S<MI⁢X−89⁢σ,NI≥Q⁢Xσ/3,MI≥X1/2.Q<TX^{-29\sigma},\qquad QRS<M_{I}X^{-89\sigma},\qquad N_{I}\geq QX^{\sigma/3},% \quad M_{I}\geq X^{1/2}.

Here QQ is the scale of the first factor γ1\gamma_{1} (the outer slot scale, written QslotQ_{\rm slot} in Appendix B). It is not the scale of the full modulus qq of (3.4), which is Q⁢R⁢SQRS. Thus (3.6) gives the first inequality in (3.7). We list the four spectral packing inequalities together.

Q<T⁢X−σ,T2⁢R2⁢S<X1−8⁢σ,A0ϑsp⁢T⁢Q⁢R2⁢S5<X2−15⁢σ,Q<TX^{-\sigma},\quad T^{2}R^{2}S<X^{1-8\sigma},\quad A_{0}^{\vartheta_{\rm sp}% }TQR^{2}S^{5}<X^{2-15\sigma},
(3.7) (T⁢R/S)2⁢ϑsp⁢T⁢Q⁢R2⁢S5<X2−15⁢σ,A0=X1+σ/20.(TR/S)^{2\vartheta_{\rm sp}}TQR^{2}S^{5}<X^{2-15\sigma},\qquad A_{0}=X^{1+% \sigma/20}.

Each application must verify the stated packing and interval conditions for its own source. Appendix B does so for the prime source in Theorem 1.2.

Removed squareful and other restricted terms. A source may remove forbidden tails, forbidden prefixes or retained allowed repeats. Their contributions are bounded separately. One admissible bound is Oσ⁢(N1−ℓ0⁢σ2⁢L4)O_{\sigma}(N^{1-\ell_{0}\sigma^{2}}L^{4}), after all source-label and representation multiplicities. Theorem 3.2 concerns the unrestricted coefficient (3.4). The removed terms need their own estimates.

The prime source in Theorem 1.2 is 𝟏ℙ⁢(n)⁢𝟏N/(log⁡N)B<n<(1−ε)⁢N\mathbf{1}_{\mathbb{P}}(n)\mathbf{1}_{N/(\log N)^{B}<n<(1-\varepsilon)N}. Appendix B verifies its coefficient, interval, cutoff, support, and boundary conditions. The hypotheses above also state the local estimate for any other source that satisfies them.

Apply the finite HB expansion below. Then split into disjoint short product boxes of relative width L−CboxL^{-C_{\rm box}}. Boundary boxes contribute separately. On each interior Class-II box select an HB variable in the window. Maximize its lower-endpoint exponent ei=logN⁡Vie_{i}=\log_{N}V_{i}. Break ties by the fixed variable index, as in the classification in Appendix B. Call it nn, and the product of the other variables mm.

In (3.8), allow a roughness cutoff ζ≥z0\zeta\geq z_{0}, where z0=z0⁢(X)z_{0}=z_{0}(X) is the baseline in (3.2). All estimates below are uniform in ζ\zeta. Upper bounds use only P−⁢(n)≥z0P^{-}(n)\geq z_{0}. The SW proof (3.25) for the selected factor uses the cutoff ζ\zeta. It remains uniform under stronger roughness.

(3.8) αn∈{μ⁢(n),1,log⁡nL}⁢1P−⁢(n)≥ζ⁢1IT⁢(n),|αn|≤1,|βm|≪τ23⁢(m).\alpha_{n}\in\left\{\mu(n),1,\frac{\log n}{L}\right\}1_{P^{-}(n)\geq\zeta}1_{I% _{T}}(n),\quad|\alpha_{n}|\leq 1,\qquad|\beta_{m}|\ll\tau_{23}(m).

The fixed HB binomial coefficients and tags may be kept as exterior scalars. IT⊂(T,2⁢T]I_{T}\subset(T,2T] has length NI≍T⁢L−CboxN_{I}\asymp TL^{-C_{\rm box}}. The mm-interval is majorized by

(3.9) ψI⁢(m)=ϕ0⁢((m−m0)/MI),MI≍(X/T)⁢L−Cbox,\psi_{I}(m)=\phi_{0}((m-m_{0})/M_{I}),\qquad M_{I}\asymp(X/T)L^{-C_{\rm box}},

Fix ϕ0∈Cc∞⁢([−1,1])\phi_{0}\in C_{c}^{\infty}([-1,1]), with 0≤ϕ0≤10\leq\phi_{0}\leq 1 and ϕ0=1\phi_{0}=1 on [−1/2,1/2][-1/2,1/2]. It is independent of NN, XX, the source and the box. It is also independent of all shell and tuple variables. For every j≥0j\geq 0, the seminorms ‖ϕ0(j)‖1\|\phi_{0}^{(j)}\|_{1} and ‖ϕ0(j)‖∞\|\phi_{0}^{(j)}\|_{\infty} are fixed constants. The support of ψI⁢(m)=ϕ0⁢((m−m0)/MI)\psi_{I}(m)=\phi_{0}((m-m_{0})/M_{I}) lies in the doubled interval. The majorant depends on the box only through m0m_{0} and MIM_{I}. On that entire support the cut geometry gives

(3.10) 1≤|m⁢n−a|≤X3.1\leq|mn-a|\leq X^{3}.

C4. Moving frequency. All original moduli are prime to aa, and 0<a≤X⁢(log⁡N)Kscale≤A00<a\leq X(\log N)^{K_{\rm scale}}\leq A_{0}. This is the moving frequency in the spectral theorem. It may vary with NN.

C5. Window. The source selection gives

(3.11) N60⁢σ≤T≤N1/3+14⁢σ,X60⁢σ≤T≤X1/3+15⁢σ.N^{60\sigma}\leq T\leq N^{1/3+14\sigma},\qquad X^{60\sigma}\leq T\leq X^{1/3+1% 5\sigma}.

The second assertion follows from the first and log⁡(N/X)/log⁡N=o⁢(1)\log(N/X)/\log N=o(1), with N0N_{0} chosen after fixed σ\sigma. Claim P (nonresonance): the doubled support satisfies (3.10). The source assumptions for the non-II extension are in §3.11.

3.2. Statement and theorem inputs

Length hypothesis for the selected integer interval (LEN). Uniformly over the selected boxes, the interval has length NI≍T⁢L−CboxN_{I}\asymp TL^{-C_{\rm box}} and satisfies NI≥(2⁢T)1−2−126N_{I}\geq(2T)^{1-2^{-126}}. The integer interval used in (3.17) has this same length, with the endpoint convention specified by the source. Lemma B.3, (B.22)–(B.27), proves this for the prime source. Each application proves it for its own source.

For the coefficient of one Heath–Brown box define

(3.12) ΔB⁢(q;a)=∑𝐯∈Bw⁢(𝐯)⁢𝒮∏vi⁢(q;a),SBPSDT=∑qCB⁢(q)⁢ΔB⁢(q;a).\Delta_{B}(q;a)=\sum_{\mathbf{v}\in B}w(\mathbf{v})\mathcal{S}_{\prod v_{i}}(q% ;a),\qquad S_{B}^{\rm PSDT}=\sum_{q}C_{B}(q)\Delta_{B}(q;a).

3.3. An abstract dispersion estimate

The local argument is source-independent. We state it before the verification for specific sources. Let ℬ\mathcal{B} be a finite family of dyadic boxes at scale XX, and let aa be a moving frequency. For B∈ℬB\in\mathcal{B} write CB⁢(q)C_{B}(q) for its signed modulus coefficient. Define ΔB⁢(q;a)\Delta_{B}(q;a) by (3.12).

The following hypotheses define the class used in this paper.

(H1) Exact coefficient:

On every box, CB⁢(q)C_{B}(q) has the exact form (3.4), with its fixed labelled prime sets, squarefree smooth-divisor variable dd, and repeated-prime multiplicities. Every supported modulus is coprime to 2⁢a2a.

(H2) Three-factor decomposition:

The labelled variables split into three groups satisfying (3.5). The last two factors are u0u_{0}-rough, as in C2. The identity holds on all supported moduli, including repeated-prime multiplicities.

(H3) Geometric packing and box data:

After dyadic localization, the scales Q,R,SQ,R,S and the test scale TT satisfy (3.6)–(3.7). On each box, the Heath–Brown coefficients factor as αn⁢βm\alpha_{n}\beta_{m} with (3.8). The smooth majorant has the form (3.9). Its center satisfies |m0|≤Cctr⁢X/T|m_{0}|\leq C_{\rm ctr}X/T, where CctrC_{\rm ctr} is a fixed source-class constant, uniform over all boxes, shells, tuple variables, and permitted N,X,aN,X,a. Its full doubled support satisfies (3.10). The selected integer interval satisfies LEN, including its strong length bound and integer endpoint convention. For this abstract dispersion estimate, assume modulus support in q≤Xϑ0q\leq X^{\vartheta_{0}}, with ϑ0\vartheta_{0} as in (3.12a).

(H4) Moving frequency:

The frequency is the positive integer aa, with NN even, 0<a≤X⁢(log⁡N)Kscale≤A00<a\leq X(\log N)^{K_{\rm scale}}\leq A_{0}, and all original moduli are coprime to aa.

(H5) Selected window:

The tested scale obeys (3.11), with all parameters fixed after σ>0\sigma>0 is fixed.

(H6) Source-wide remainders and boundary:

Let a source supply a logarithm-freezing estimate and boundary estimate for the full box family. After summing over all source labels, shells, boxes, and representation multiplicities, these estimates must give

Elog≪N⁢(log⁡N)clog−Cbox,Ebdry≪N⁢(log⁡N)cR−Cbox/2,E_{\rm log}\ll N(\log N)^{c_{\log}-C_{\rm box}},\qquad E_{\rm bdry}\ll N(\log N% )^{c_{R}-C_{\rm box}/2},

with fixed clogc_{\log} and cRc_{R}. This condition is used in the global summation, not in the local theorems below.

(H7) Box-family coefficient bound:

The finite box family ℬ={Bj}\mathcal{B}=\{B_{j}\} carries outer coefficients cjc_{j}, coming from the source labels and the Heath–Brown identity. At fixed σ\sigma they satisfy (3.91): ∑j|cj|≤Cσ,Cbox,𝒞src⁢(log⁡N)K0\sum_{j}|c_{j}|\leq C_{\sigma,C_{\rm box},\mathcal{C}_{\rm src}}(\log N)^{K_{0}} with a fixed K0≤24⁢Cbox+26K_{0}\leq 24C_{\rm box}+26. This condition is used only for the aggregate bound (3.92), not for the per-box estimates.

Write 𝒞src\mathcal{C}_{\rm src} for the fixed source constants in (H1)–(H5), such as CslotC_{\rm slot}, CctrC_{\rm ctr} and the implied constants in (3.8)–(3.11).

The Siegel–Walfisz bound (3.25) for the selected factor follows in §3.4 from the classical theorem [17, Corollary 5.29]. BFI [6] and Theorem 2.8, proved from classical inputs in §2.7, are theorem inputs, not source hypotheses. The source-wide boundary bound (3.24) is hypothesis (H6). It is used in the source estimates, not in the per-box theorem (3.13).

Put

(3.12a) Θ0=1910132000,ϑ0=Θ0−ηL>12.\Theta_{0}=\frac{19101}{32000},\qquad\vartheta_{0}=\Theta_{0}-\eta_{L}>\frac{1% }{2}.

The number Θ0\Theta_{0} is the small-atom empty-prefix packing level of Proposition 4.2 in §4. The exponent ϑ0\vartheta_{0} is a support convention in the abstract dispersion estimate. The actual support level comes from the packing inequalities (3.6)–(3.7) after all Iwaniec factors are restored. In Theorem 1.2, (B.2)–(B.4) give q<NeQq<N^{e_{Q}} with eQ<Θ⁢(u)≤Θ⁢(0)=153/256<0.6e_{Q}<\Theta(u)\leq\Theta(0)=153/256<0.6; hence q≤X0.6q\leq X^{0.6} on every source shell for sufficiently large NN. The fixed exponent ϑ0\vartheta_{0} belongs to the abstract support hypothesis of the introductory source-box estimate. The variable ceiling Θ⁢(u)=(5−7/32−3⁢u)/8\Theta(u)=(5-7/32-3u)/8 in Theorem 1.2 controls the Iwaniec coefficient family as uu varies. At u=1/500u=1/500, Θ⁢(u)=19101/32000=Θ0\Theta(u)=19101/32000=\Theta_{0}, whereas ϑ0=Θ0−10−4\vartheta_{0}=\Theta_{0}-10^{-4}. The introductory estimate applies to its stated abstract support class; the Iwaniec result at this endpoint uses the X0.6X^{0.6} theorem below. Theorem 3.1 is the abstract dispersion estimate under the support and packing hypotheses in (H3), including the stronger support q≤Xϑ0q\leq X^{\vartheta_{0}}. Theorem 3.2 is the dispersion engine used for the actual source support. Theorem 1.2 in the application uses that engine together with the source estimates of Appendix B. At u=1/500u=1/500 it gives the limiting ceiling Θ⁢(1/500)\Theta(1/500) for this specified signed mean value.

Theorem 3.1 (Dispersion estimate under the (H3) packing hypotheses).

(a) Assume (H1)–(H5). Then, for every fixed A′>0A^{\prime}>0 and every box BB,

(3.12b) |∑q≤Xϑ0CB⁢(q)⁢ΔB⁢(q;a)|≪σ,Kscale,Cbox,A′,𝒞srcX⁢L−A′+X1−cσ⁢LC,\left|\sum_{q\leq X^{\vartheta_{0}}}C_{B}(q)\Delta_{B}(q;a)\right|\ll_{\sigma,% K_{\rm scale},C_{\rm box},A^{\prime},\mathcal{C}_{\rm src}}XL^{-A^{\prime}}+X^% {1-c_{\sigma}}L^{C},

where cσ=ℓ0⁢σ2/4>0c_{\sigma}=\ell_{0}\sigma^{2}/4>0 and C=C⁢(σ,Cbox,A′,Kscale,𝒞src)C=C(\sigma,C_{\rm box},A^{\prime},K_{\rm scale},\mathcal{C}_{\rm src}) is the exponent of (3.13). The implied constant and the threshold for XX are uniform in the box, the even integer NN, and all moving frequencies aa permitted by (H1)–(H5). They may depend on the fixed source bounds and on σ\sigma. They are ineffective, since the proof uses the Siegel–Walfisz theorem in (3.25). Under (H3) every supported modulus satisfies q≤Xϑ0q\leq X^{\vartheta_{0}}, so the truncation in (3.12b) is vacuous and its left side is |SBPSDT||S_{B}^{\rm PSDT}|.

(b) Assume in addition (H7). Fix A>0A>0 and take A′=A+24⁢Cbox+31A^{\prime}=A+24C_{\rm box}+31 in (a). Then the weighted sum EII=∑j|cj|⁢|SBjPSDT|E_{\rm II}=\sum_{j}|c_{j}||S_{B_{j}}^{\rm PSDT}| over the box family satisfies (3.92), that is, EII≪σ,A,Cbox,Kscale,𝒞srcN⁢(log⁡N)−AE_{\rm II}\ll_{\sigma,A,C_{\rm box},K_{\rm scale},\mathcal{C}_{\rm src}}N(\log N% )^{-A}. This bound is uniform in the scales XX of the boxes. For N/(log⁡N)Kscale≤X≤NN/(\log N)^{K_{\rm scale}}\leq X\leq N one has log⁡X≥log⁡N−Kscale⁢log⁡log⁡N≥12⁢log⁡N\log X\geq\log N-K_{\rm scale}\log\log N\geq\tfrac{1}{2}\log N for large NN, so X⁢(log⁡X)−A′≤2A′⁢N⁢(log⁡N)−A′X(\log X)^{-A^{\prime}}\leq 2^{A^{\prime}}N(\log N)^{-A^{\prime}} and X1−cσ⁢(log⁡X)C≤N1−cσ⁢(log⁡N)CX^{1-c_{\sigma}}(\log X)^{C}\leq N^{1-c_{\sigma}}(\log N)^{C}. Part (b) holds for any fixed Cbox>0C_{\rm box}>0. The condition Cbox≥⌈2⁢A+32⌉C_{\rm box}\geq\lceil 2A+32\rceil of Theorem 1.2 serves only the source-wide errors of (H6).

Under the support hypothesis in (H3), the theorem gives arbitrary logarithmic saving for these signed sums through q≤Xϑ0=X0.59680625q\leq X^{\vartheta_{0}}=X^{0.59680625}, where ϑ0>1/2\vartheta_{0}>1/2.

Proof.

The support bound assumed in (H3) makes the sum in (3.12b) the full sum SBPSDTS_{B}^{\rm PSDT} of (3.12). Hypotheses (H1)–(H5) imply those of Theorem 3.2. Hence Theorem 3.2 applies to BB and gives (3.13), which is (3.12b). This proves (a). Part (b) follows from (a) and (H7) by the summation (3.92) in §3.10. ∎

Theorem 3.2 (Dispersion theorem).

Assume (H1)–(H5), where in (H3) the support bound q≤Xϑ0q\leq X^{\vartheta_{0}} may be relaxed to q≤X0.6q\leq X^{0.6}. Thus each box satisfies (3.8)–(3.10) and LEN. Then, for each fixed A′>0A^{\prime}>0,

(3.13) |SBPSDT|≪σ,Kscale,Cbox,A′,𝒞srcX⁢L−A′+X1−cσ⁢LC.|S_{B}^{\rm PSDT}|\ll_{\sigma,K_{\rm scale},C_{\rm box},A^{\prime},\mathcal{C}% _{\rm src}}XL^{-A^{\prime}}+X^{1-c_{\sigma}}L^{C}.

Here C=C⁢(σ,Cbox,A′,Kscale,𝒞src)C=C(\sigma,C_{\rm box},A^{\prime},K_{\rm scale},\mathcal{C}_{\rm src}). It multiplies only power-saving terms. It enters only the final choice of N0N_{0}. The exponent CC is fixed after the proof parameters. It is uniform in the box, each class in the random partition, the residue, and the moving shift. Constants and N0N_{0} may depend on the fixed σ\sigma. All bounds are for fixed σ>0\sigma>0 as N→∞N\to\infty. The implied constants and the threshold N0N_{0} are ineffective, since the proof uses the Siegel–Walfisz theorem in (3.25). The estimate (3.13) is per box and does not use (H6) or (H7). If (H7) also holds and A′=A+24⁢Cbox+31A^{\prime}=A+24C_{\rm box}+31, then the weighted sum over the box family satisfies (3.92).

Hypotheses (H1)–(H5) give the coefficient, factor identity, packing, box, frequency and window conditions, including LEN and the integer endpoint convention. BFI [6, Theorem 0(a)] supplies (3.48), Theorem 2.8 of §2.7 supplies (3.14)–(3.15), and (3.25) supplies SW. The source-wide condition (H6) enters the source error terms, including (B.29) in the proof of Theorem 1.2 and the auxiliary bound (3.95). It is not used in the per-box Theorem 3.2. The box-family bound (H7) enters only (3.92). The spectral part gives a term X1−1.725⁢σ⁢LCX^{1-1.725\sigma}L^{C} (§3.9). It is absorbed in X1−cσ⁢LCX^{1-c_{\sigma}}L^{C}, since cσ<σ/2<1.725⁢σc_{\sigma}<\sigma/2<1.725\sigma.

The dependencies have the following order:

source identities, box geometry and source estimates⟹(H1)⁢–⁢(H7),Section 2 and (3.25)⟹BFI, Theorem 2.8 and SW,(H1)–(H5)+theorem inputs⟹(3.13),(3.13)+(H7)⟹(3.92).\begin{gathered}\text{source identities, box geometry and source estimates}\ % \Longrightarrow\ (\mathrm{H1})\text{--}(\mathrm{H7}),\\ \text{Section 2 and (3.25)}\ \Longrightarrow\ \text{BFI, Theorem 2.8 and SW},% \\ \text{(H1)--(H5)}+\text{theorem inputs}\ \Longrightarrow\ (3.13),\\ (3.13)+(\mathrm{H7})\ \Longrightarrow\ (3.92).\end{gathered}

The hypotheses are stated independently of any particular source. Appendix B verifies them for Theorem 1.2. Source comparison and the estimates for removed squareful terms are separate steps. Aggregate logarithm-freezing estimates enter in §3.10. Theorem 3.2 uses (H1)–(H5) and the stated theorem inputs.

The inputs are the following theorems, printed in Section 2. The Siegel–Walfisz theorem (SW) [17, Corollary 5.29] gives prime distribution in reduced progressions to moduli at most a fixed power of the logarithm. [6, Theorem 0(a), (2.2)], with [6, (A2)], gives the BDH quadratic estimate. It applies to sequences satisfying its norm-normalized SW condition. On the domain (r⁢d,s⁢c)=1(rd,sc)=1, Theorem 2.8 gives

(3.14) |∑(r,s)=1∑0<n≤NTbn,r,s⁢∑c,d:(r⁢d,s⁢c)=1g⁢(c,d,n,r,s)⁢e⁢(aT⁢n⁢r⁢d¯s⁢c)|\displaystyle\left|\sum_{(r,s)=1}\sum_{0<n\leq N_{T}}b_{n,r,s}\sum_{c,d:(rd,sc% )=1}g(c,d,n,r,s)e\left(\frac{a_{T}n\overline{rd}}{sc}\right)\right|
≪(2+AT⁢C⁢D⁢NT⁢RT⁢ST)ϵ+18⁢ϵ0⁢J∗⁢(aT).\displaystyle\qquad\ll(2+A_{T}CDN_{T}R_{T}S_{T})^{\epsilon+18\epsilon_{0}}J_{*% }(a_{T}).

Here 0<|aT|≤AT0<|a_{T}|\leq A_{T}, where ATA_{T} is the frequency bound AA of Theorem 2.8, and b=0b=0 unless (aT,r⁢s)=1(a_{T},rs)=1. The positive scales meet the endpoint conditions of Section 2. The bracket is

(3.15) J∗2=\displaystyle J_{*}^{2}={} ∑n′′∣aT∞ATϑsp(n′′)ϑsp[CST(NT/n′′+RTST)(C+DRT)\displaystyle\sum_{n^{\prime\prime}\mid a_{T}^{\infty}}A_{T}^{\vartheta_{\rm sp% }}(n^{\prime\prime})^{\vartheta_{\rm sp}}\bigl{[}CS_{T}(N_{T}/n^{\prime\prime}% +R_{T}S_{T})(C+DR_{T})
+|aT|NTRTST]∥b♭(n′′)∥22\displaystyle\qquad+|a_{T}|N_{T}R_{T}S_{T}\bigr{]}\|b^{\flat}(n^{\prime\prime}% )\|_{2}^{2}
+[CST(CDRT)2⁢ϑsp(NT+RTST)1−ϑsp\displaystyle+\bigl{[}CS_{T}(CD\sqrt{R_{T}})^{2\vartheta_{\rm sp}}(N_{T}+R_{T}% S_{T})^{1-\vartheta_{\rm sp}}
×(C+DRT)1−2⁢ϑsp+D2NTRT]∥b∥22.\displaystyle\qquad\times(C+DR_{T})^{1-2\vartheta_{\rm sp}}+D^{2}N_{T}R_{T}% \bigr{]}\|b\|_{2}^{2}.

Here b♭⁢(n′′)b^{\flat}(n^{\prime\prime}) is the dyadic-block slice of b~⁢(n′′)\tilde{b}(n^{\prime\prime}) with (n′,a)=1(n^{\prime},a)=1. The slice satisfies ‖b♭⁢(n′′)‖2≤‖b~⁢(n′′)‖2\|b^{\flat}(n^{\prime\prime})\|_{2}\leq\|\tilde{b}(n^{\prime\prime})\|_{2}. Since bb is supported on the present dyadic block, b♭⁢(n′′)=b~⁢(n′′)b^{\flat}(n^{\prime\prime})=\tilde{b}(n^{\prime\prime}) term by term. Hence (3.15) is exactly (2.42)–(2.43).

The smooth derivatives in (3.14) obey the variable-based hypothesis (2.39), with the exponent 1−ϵ01-\epsilon_{0} displayed there: each derivative is scaled by the corresponding positive argument c,d,n,r,sc,d,n,r,s itself. In particular, the initial interval 0<n≤NT0<n\leq N_{T} is not treated as a dyadic block of scale NTN_{T}. Theorem 2.8 is used in the form of Section 2, (2.38)–(2.43). It is proved in §2.7. Its spectral identity, including the continuous spectral measure, is exactly (2.14). The I-2 estimate (Lemma 3.5) also uses the composite-modulus Weil–Estermann bound [15, 16] in §3.11.

The sum in (3.13) is a signed modulus sum; triangle inequalities over source labels and boxes are applied outside it.

3.4. Elementary preparation, moments, and SW

Divisor moments. For integers K,k≥1K,k\geq 1,

(3.16) τ⁢(n)K≤τ2K⁢(n),∑n≤Yτk⁢(n)n≤(1+log⁡Y)k.\tau(n)^{K}\leq\tau_{2^{K}}(n),\qquad\sum_{n\leq Y}\frac{\tau_{k}(n)}{n}\leq(1% +\log Y)^{k}.

At pvp^{v}, the first inequality is (v+1)K≤(v+2K−1v)(v+1)^{K}\leq\binom{v+2^{K}-1}{v}. The ratio of successive right/left quotients is at least 1. This holds since (1+t)K≤1+(2K−1)⁢t(1+t)^{K}\leq 1+(2^{K}-1)t for 0≤t≤10\leq t\leq 1, by convexity. The second inequality follows by summing over the kk factors. Also τj⁢(n)≤τ⁢(n)j−1\tau_{j}(n)\leq\tau(n)^{j-1}.

Suppose Y1−1/k≤H≤YY^{1-1/k}\leq H\leq Y. Select a largest factor in a kk-factorization. Then

(3.17) ∑Y<n≤Y+Hτk⁢(n)≤k⁢∑d≤(2⁢Y)1−1/kτk−1⁢(d)⁢(H/d+1)≤3⁢k⁢H⁢(1+log⁡(2⁢Y))k−1.\sum_{Y<n\leq Y+H}\tau_{k}(n)\leq k\sum_{d\leq(2Y)^{1-1/k}}\tau_{k-1}(d)(H/d+1% )\leq 3kH(1+\log(2Y))^{k-1}.

Let 1≤u≤Y1\leq u\leq Y and 0<ϖ≤10<\varpi\leq 1. Split off prime factors larger than Yϖ/2Y^{\varpi/2}. Greedily group the rest into factors at most YϖY^{\varpi}. There are at most ⌊2/ϖ⌋+1\lfloor 2/\varpi\rfloor+1 groups. The large-prime part has at most 2/ϖ2/\varpi prime factors with multiplicity. Hence

(3.18) τ⁢(u)K≤22⁢K/ϖ⁢∑d∣u,d≤Yϖτ⁢(d)K⁢(⌊2/ϖ⌋+1).\tau(u)^{K}\leq 2^{2K/\varpi}\sum_{d\mid u,\ d\leq Y^{\varpi}}\tau(d)^{K(% \lfloor 2/\varpi\rfloor+1)}.

For u=|m⁢n−a|≤X3u=|mn-a|\leq X^{3}, take Y=X3,ϖ=1/12Y=X^{3},\varpi=1/12. Put h=(d,n)h=(d,n). If h∤ah\nmid a, the congruence d∣m⁢n−ad\mid mn-a has no solutions. Otherwise it has at most |J|⁢h/d+1|J|h/d+1 solutions on JJ. Sum (3.18) and apply (3.16). For |J|≤3⁢MI|J|\leq 3M_{I} this gives

(3.19) ∑m∈Jτ⁢(|m⁢n−a|)K≤224⁢K⁢(1+log⁡X)225⁢K⁢{3⁢MI⁢τ⁢(n)25⁢K+1+X1/4}.\sum_{m\in J}\tau(|mn-a|)^{K}\leq 2^{24K}(1+\log X)^{2^{25K}}\{3M_{I}\tau(n)^{% 25K+1}+X^{1/4}\}.

Write I^M\widehat{I}_{M} for the integer support of ψI\psi_{I}; it is contained in an interval of length at most 3⁢MI3M_{I}. Sum (3.19) with K=5K=5 over n∈ITn\in I_{T}. The nn-sum of τ⁢(n)126≤τ2126⁢(n)\tau(n)^{126}\leq\tau_{2^{126}}(n) is bounded by (3.17) and LEN. Since MI≥X1/2M_{I}\geq X^{1/2}, the term NI⁢X1/4N_{I}X^{1/4} is absorbed by MI⁢NIM_{I}N_{I}. Thus

(3.20) ∑n∈IT∑m∈I^Mτ⁢(|m⁢n−a|)5≪MI⁢NI⁢Lc1,c1=2125+2126+2.\sum_{n\in I_{T}}\sum_{m\in\widehat{I}_{M}}\tau(|mn-a|)^{5}\ll M_{I}N_{I}L^{c_% {1}},\qquad c_{1}=2^{125}+2^{126}+2.

Here c1c_{1} is an upper bound; the exponent 2125+2126−12^{125}+2^{126}-1 already suffices.

For the prime source, Lemma B.3 takes TT as the lower endpoint of the selected cell. Under threshold (B.24), it proves (B.27), namely NI≥(2⁢T)1−2−126N_{I}\geq(2T)^{1-2^{-126}}. In (3.17) take Y′=⌊T⌋Y^{\prime}=\lfloor T\rfloor and H′=NIH^{\prime}=N_{I}. The integers in IT=(T,rX⁢T]I_{T}=(T,r_{X}T] of (B.22) are exactly (Y′,Y′+NI](Y^{\prime},Y^{\prime}+N_{I}]. The stated bound implies H′≥(2⁢Y′)1−2−126H^{\prime}\geq(2Y^{\prime})^{1-2^{-126}}. The mesh uses the lower endpoint of the dyadic shell, which is a different scale. For the product source, LEN gives the lower length and the integer-interval convention. Thus (3.17) applies to τ2126\tau_{2^{126}}, after increasing N0⁢(σ)N_{0}(\sigma) for each fixed σ>0\sigma>0. The same argument with ϖ=κ/6\varpi=\kappa/6 treats intervals of length at least XκX^{\kappa}. It gives ∑m|βm|2≪MI⁢Lc\sum_{m}|\beta_{m}|^{2}\ll M_{I}L^{c} by elementary means; Shiu’s estimate [4] would also suffice.

Finite Heath–Brown identity [12]. For U≥1U\geq 1 and n≤U3n\leq U^{3},

(3.21) Λ⁢(n)=∑j=13(−1)j−1⁢(3j)⁢∑n=m1⁢⋯⁢mj⁢n1⁢⋯⁢nj,mi≤Uμ⁢(m1)⁢⋯⁢μ⁢(mj)⁢log⁡n1.\Lambda(n)=\sum_{j=1}^{3}(-1)^{j-1}\binom{3}{j}\sum_{n=m_{1}\cdots m_{j}n_{1}% \cdots n_{j},\ m_{i}\leq U}\mu(m_{1})\cdots\mu(m_{j})\log n_{1}.

For the proof put M⁢(s)=∑m≤Uμ⁢(m)⁢m−sM(s)=\sum_{m\leq U}\mu(m)m^{-s}. The series 1−ζ⁢M1-\zeta M has no coefficients of index at most UU. Hence −(ζ′/ζ)⁢(1−ζ⁢M)3-(\zeta^{\prime}/\zeta)(1-\zeta M)^{3} has none of index at most U3U^{3}. Expand the cube and use −(ζ′/ζ)⁢ζj=(−ζ′)⁢ζj−1-(\zeta^{\prime}/\zeta)\zeta^{j}=(-\zeta^{\prime})\zeta^{j-1}. Let XX be the dyadic shell of the tested coordinate, and t∈(X,2⁢X]t\in(X,2X]. Take U=2⁢X1/3U=2X^{1/3}. Then (3.21) applies, since t≤2⁢X<U3=8⁢Xt\leq 2X<U^{3}=8X. For the product source use Ui=2⁢Xi1/3U_{i}=2X_{i}^{1/3} for the shell XiX_{i} of each coordinate. There are at most 24 variables. Roughness factors exactly over the product. The identity

(3.22) 1ℙ⁢(t)=Λ⁢(t)log⁡t−∑k≥2,t=pk1k1_{\mathbb{P}}(t)=\frac{\Lambda(t)}{\log t}-\sum_{k\geq 2,\ t=p^{k}}\frac{1}{k}

has its proper-prime-power error bounded at source level in §3.10.

Logarithms and boundaries. On one short box replace each 1/log⁡p1/\log p by its value at the box reference point. The pointwise error is O⁢(L−Cbox−2)O(L^{-C_{\rm box}-2}) per coordinate. To sum the discrepancy absolutely, use

(3.23) ∑q|Cb⁢(q)|⁢|𝒮t⁢(q;a)|≪στ⁢(|t−a|)+L,t≠a.\sum_{q}|C_{b}(q)|\,|\mathcal{S}_{t}(q;a)|\ll_{\sigma}\tau(|t-a|)+L,\qquad t% \neq a.

The first term counts divisors of t−at-a. The second uses ∑q≤X0.61/φ⁢(q)≪L\sum_{q\leq X^{0.6}}1/\varphi(q)\ll L. The unrestricted labelled coefficient is Oσ⁢(1)O_{\sigma}(1). The number of prime labels is fixed, and the small-prime part is disjoint from them. For the prime source, the pointwise majorant in Appendix B gives (3.23) with Fa⁢(n)=d⁢(a−n)+2⁢(1+L)F_{a}(n)=d(a-n)+2(1+L). The source-wide logarithm-freezing estimate is (B.18): |ELOG|≪σN⁢L18−Cbox|E_{\rm LOG}|\ll_{\sigma}NL^{18-C_{\rm box}}. It is summed over tuples, each lying in one box, so its box-count factor is 1. Here the logarithm is LN=log⁡NL_{N}=\log N, and its divisor-moment input is (B.17). The box width is expressed in LX=log⁡XL_{X}=\log X. Fixed powers of LXL_{X} and LNL_{N} are comparable. For the product source, the corresponding aggregate bound is a source condition stated in §3.10.

Write LN=log⁡NL_{N}=\log N. Consider the source cuts, the HB caps, and the monomial ordering and radial cuts of the product source. On each dyadic source shell, each boundary region has relative width O⁢(LN−Cbox)O(L_{N}^{-C_{\rm box}}) in an active coordinate. Counting that coordinate first and summing the geometric shell scales gives a total of O⁢(N⁢LN5−Cbox+N6/7⁢LN5)O(NL_{N}^{5-C_{\rm box}}+N^{6/7}L_{N}^{5}) boundary indices, including the fixed divisor multiplicity. An active coordinate can be chosen among the positive-power factors, so the integer endpoint terms have a fixed power saving. For the prime source, Cauchy–Schwarz with this count and the source-wide second moment in (B.17) gives

(3.24) Ebdry≪N⁢(log⁡N)cR−Cbox/2.E_{\rm bdry}\ll N(\log N)^{c_{R}-C_{\rm box}/2}.

For the prime source in Theorem 1.2, (3.24) holds with cR=16c_{R}=16 by the global estimate (B.19) in Appendix B. This verifies (H6) for that source.

The prime-source estimate is invoked under Theorem 1.2, whose residue range supplies a≥Na\geq N. This lower bound is compatible with the local upper bound: a≤N⁢log⁡N/3≤(2/3)⁢X⁢(log⁡N)B+1a\leq N\log N/3\leq(2/3)X(\log N)^{B+1} when X>N/(2⁢(log⁡N)B)X>N/(2(\log N)^{B}). The prime-source cut and a≥Na\geq N give |m⁢n−a|≥ε⁢N/2|mn-a|\geq\varepsilon N/2 on the doubled support. Thus resonant boxes are empty and (3.10) holds.

SW for the selected factor. For every ASW>0A_{\rm SW}>0, subinterval I⊂ITI\subset I_{T}, integer d≥1d\geq 1, and reduced class lmodkl\bmod k,

(3.25) ∑n∈I,n≡l⁢(k),(n,d)=1αn−1φ⁢(k)⁢∑n∈I,(n,d⁢k)=1αn≪ASWT⁢τ⁢(d)⁢L−ASW.\sum_{n\in I,\ n\equiv l(k),\ (n,d)=1}\alpha_{n}-\frac{1}{\varphi(k)}\sum_{n% \in I,\ (n,dk)=1}\alpha_{n}\ll_{A_{\rm SW}}T\tau(d)L^{-A_{\rm SW}}.

Here and below the interval indicator is used only once. Let k>LKk>L^{K}. After KK is chosen large, the trivial bound is O⁢(T/k+1+T/φ⁢(k))≪T⁢L−ASWO(T/k+1+T/\varphi(k))\ll TL^{-A_{\rm SW}}. The elementary bound φ⁢(k)≫k/log⁡log⁡(k+2)\varphi(k)\gg k/\log\log(k+2), or φ⁢(k)≫k1/2\varphi(k)\gg k^{1/2}, suffices. Let k≤LKk\leq L^{K} and put y1=exp⁡(L2/3)y_{1}=\exp(L^{2/3}). For sufficiently large XX, z0>y1z_{0}>y_{1}, so no selected integer has largest prime below y1y_{1}. Integers divisible by p2p^{2}, p≥y1p\geq y_{1}, contribute O⁢(T/y1)O(T/y_{1}). Every other integer has a unique form n=P⁢mn=Pm, with P>P+⁢(m)P>P^{+}(m), P≥y1P\geq y_{1}, and m≤2⁢T/y1m\leq 2T/y_{1}. For fixed mm, its coefficient is μ⁢(m)⁢μ⁢(P)=−μ⁢(m)\mu(m)\mu(P)=-\mu(m), 11, or log⁡(P⁢m)/L\log(Pm)/L. The last has bounded variation on the allowed prime interval. If (m,d⁢k)>1(m,dk)>1, both relevant counts vanish, or the coprimality with dd removes the term. Otherwise P≡l⁢m¯⁢(k)P\equiv l\bar{m}(k). Apply prime SW and partial summation, uniformly at endpoints P≥y1P\geq y_{1}. The endpoint errors sum to OASW⁢(T⁢L−ASW)O_{A_{\rm SW}}(TL^{-A_{\rm SW}}), since log⁡y1=L2/3\log y_{1}=L^{2/3} and ∑m≤2⁢T/y11/m≪L\sum_{m\leq 2T/y_{1}}1/m\ll L. Excluding P∣d⁢kP\mid dk costs at most O⁢((ω⁢(d)+ω⁢(k))⁢T/y1)≪ASWT⁢τ⁢(d)⁢L−ASWO((\omega(d)+\omega(k))T/y_{1})\ll_{A_{\rm SW}}T\tau(d)L^{-A_{\rm SW}}. Endpoint subtraction handles arbitrary II. This proves (3.25). All errors are absolute, of size O⁢(T⁢L−ASW)O(TL^{-A_{\rm SW}}). Only the classical Siegel–Walfisz theorem is used for primes. The proof is uniform for every ζ≥z0\zeta\geq z_{0}. A nonzero selected coefficient has all prime factors at least ζ\zeta. Raise the lower endpoint of the sum over the largest prime variable. Its SW bound is unchanged. If ζ>2⁢T\zeta>2T, the coefficient is zero.

3.5. First dispersion with restoration before CRT

Work first with the normalized convolution in (3.5). Split all three factors dyadically. Apply the triangle inequality before squaring. There are O⁢(L3)O(L^{3}) triples, including the outer factor. For one triple put

(3.26) λr=∑r3⁢r2=rγ3⁢(r3)⁢γ2⁢(r2),r3≍R,r2≍S.\lambda_{r}=\sum_{r_{3}r_{2}=r}\gamma_{3}(r_{3})\gamma_{2}(r_{2}),\quad r_{3}% \asymp R,\ r_{2}\asymp S.

Since rr is u0u_{0}-rough and at most X0.6X^{0.6}, |λr|≤τ⁢(r)=Oσ⁢(1)|\lambda_{r}|\leq\tau(r)=O_{\sigma}(1). The arbitrary small-prime factor of C1 remains in the outer qq, as the only smooth divisor. Let ψ0\psi_{0} be a smooth nonnegative bump, equal to 1 on [1,2][1,2], supported on [1/2,5/2][1/2,5/2]. Cauchy–Schwarz in (q,m)(q,m) gives

(3.27) |S|2≪Q⁢MI⁢Lc⁢S′,\displaystyle|S|^{2}\ll QM_{I}L^{c}S^{\prime},\quad
S′=∑qψ0⁢(q/Q)⁢1(q,a)=1⁢∑mψI⁢(m)⁢|∑rλr⁢∑nαn⁢𝒮m⁢n⁢(q⁢r;a)|2.\displaystyle S^{\prime}=\sum_{q}\psi_{0}(q/Q)1_{(q,a)=1}\sum_{m}\psi_{I}(m)% \left|\sum_{r}\lambda_{r}\sum_{n}\alpha_{n}\mathcal{S}_{mn}(qr;a)\right|^{2}.

Write t=(q,r1,r2,n1,n2)t=(q,r_{1},r_{2},n_{1},n_{2}), ki=m⁢ni−ak_{i}=mn_{i}-a, and

(3.28) c⁢(t)=ψ0⁢(q/Q)⁢1(q,a)=1⁢λr1⁢λ¯r2⁢αn1⁢α¯n2,ω⁢(t)=1(n1,q⁢r1)=(n2,q⁢r2)=1.c(t)=\psi_{0}(q/Q)1_{(q,a)=1}\lambda_{r_{1}}\bar{\lambda}_{r_{2}}\alpha_{n_{1}% }\bar{\alpha}_{n_{2}},\quad\omega(t)=1_{(n_{1},qr_{1})=(n_{2},qr_{2})=1}.

Expanding the square gives S′=S1−2⁢ℜ⁡S2+S3S^{\prime}=S_{1}-2\Re S_{2}+S_{3}, where

(3.29) S3\displaystyle S_{3} =∑tc⁢(t)⁢∑mψI⁢(m)⁢1q⁢r1∣k1⁢1q⁢r2∣k2,\displaystyle=\sum_{t}c(t)\sum_{m}\psi_{I}(m)1_{qr_{1}\mid k_{1}}1_{qr_{2}\mid k% _{2}},
S2\displaystyle S_{2} =∑tc⁢(t)⁢∑mψI⁢(m)⁢1q⁢r1∣k1⁢1(m⁢n2,q⁢r2)=1/φ⁢(q⁢r2),\displaystyle=\sum_{t}c(t)\sum_{m}\psi_{I}(m)1_{qr_{1}\mid k_{1}}1_{(mn_{2},qr% _{2})=1}/\varphi(qr_{2}),
S1\displaystyle S_{1} =∑tc⁢(t)⁢∑mψI⁢(m)⁢1(m⁢n1,q⁢r1)=1⁢1(m⁢n2,q⁢r2)=1/(φ⁢(q⁢r1)⁢φ⁢(q⁢r2)).\displaystyle=\sum_{t}c(t)\sum_{m}\psi_{I}(m)1_{(mn_{1},qr_{1})=1}1_{(mn_{2},% qr_{2})=1}/(\varphi(qr_{1})\varphi(qr_{2})).

Let 𝒯\mathcal{T} be the tuple set. Let 𝔅\mathfrak{B} be its union of cross-copy gcd failures

(3.30) (n1,n2)>1,(r1,r2)>1,(n1,r2)>1,(n2,r1)>1,(q,r1⁢r2)>1,(n_{1},n_{2})>1,\ (r_{1},r_{2})>1,\ (n_{1},r_{2})>1,\ (n_{2},r_{1})>1,\ (q,r_{% 1}r_{2})>1,

and let 𝔇={|n1−n2|<T⁢L−CM}\mathfrak{D}=\{|n_{1}-n_{2}|<TL^{-C_{M}}\}. Set 𝔊′=𝒯∖(𝔅∪𝔇)\mathfrak{G}^{\prime}=\mathcal{T}\setminus(\mathfrak{B}\cup\mathfrak{D}). On every tuple subset VV define the formal sums

(3.31) M⁢T⁢(V)\displaystyle MT(V) =∑t∈Vc⁢(t)⁢ω⁢(t)⁢MI⁢ϕ^0⁢(0)q⁢r1⁢r2⁢φ⁢(q),\displaystyle=\sum_{t\in V}c(t)\omega(t)\frac{M_{I}\widehat{\phi}_{0}(0)}{qr_{% 1}r_{2}\varphi(q)},
𝒵⁢(V)\displaystyle\mathcal{Z}(V) =∑t∈Vc⁢(t)⁢ω⁢(t)⁢1n1≡n2⁢(q)⁢MI⁢ϕ^0⁢(0)q⁢r1⁢r2.\displaystyle=\sum_{t\in V}c(t)\omega(t)1_{n_{1}\equiv n_{2}(q)}\frac{M_{I}% \widehat{\phi}_{0}(0)}{qr_{1}r_{2}}.

Restoration lemma. Choose AE,CΣ,CMA_{E},C_{\Sigma},C_{M} in the order of §3.10. Then

(3.32) S′=MI⁢E2∗+𝒵⁢(𝒯)−M⁢T⁢(𝒯)+O⁢(EGR),S^{\prime}=M_{I}E_{2}^{*}+\mathcal{Z}(\mathcal{T})-MT(\mathcal{T})+O(E_{\rm GR% }),
(3.33) EGR≪\displaystyle E_{\rm GR}\ll{} L3⁢CΣ+c⁢MI⁢NI⁢(NIz0⁢Q+1)+Cϵ⁢Xϵ⁢MI⁢NI⁢(NIu0⁢Q+1)\displaystyle L^{3C_{\Sigma}+c}M_{I}N_{I}\left(\frac{N_{I}}{z_{0}Q}+1\right)+C% _{\epsilon}X^{\epsilon}M_{I}N_{I}\left(\frac{N_{I}}{u_{0}Q}+1\right)
+MI⁢NI2Q⁢LAE.\displaystyle+\frac{M_{I}N_{I}^{2}}{QL^{A_{E}}}.

We first prove the positive estimates needed for CRT. For SiS_{i}, let Υi⁢(V)\Upsilon_{i}(V) be the positive majorant. It replaces c⁢(t)c(t) by |c⁢(t)||c(t)| and deletes coprimalities. Retain the two congruences for Υ3\Upsilon_{3}, one for Υ2\Upsilon_{2}. Let |M⁢T|⁢(V),|𝒵|⁢(V)|MT|(V),|\mathcal{Z}|(V) be the positive versions of (3.31). We write Υexc\Upsilon_{\rm exc} for the positive contribution of (S3)(S_{3}) from the complement of Σ∗\Sigma^{*} defined in (3.37).

The total-variation progression estimate is

(3.34) |∑m≡b⁢(k)f⁢(m)−k−1⁢∫f|≤V⁢(f).\left|\sum_{m\equiv b(k)}f(m)-k^{-1}\int f\right|\leq V(f).

Compare f⁢(b+j⁢k)f(b+jk) to its cell average on [b+j⁢k,b+(j+1)⁢k][b+jk,b+(j+1)k]. Bound the difference by the cell variation, and sum. Möbius expansion of the coprimality then gives ∑(m,k)=1ψI=(φ⁢(k)/k)⁢MI⁢ϕ^0⁢(0)+O⁢(τ⁢(k))\sum_{(m,k)=1}\psi_{I}=(\varphi(k)/k)M_{I}\widehat{\phi}_{0}(0)+O(\tau(k)).

From n/φ⁢(n)=∑d∣nμ2⁢(d)/φ⁢(d)n/\varphi(n)=\sum_{d\mid n}\mu^{2}(d)/\varphi(d) we get

∑r≤Y1φ⁢(r)≪log⁡(2⁢Y),∑r≤Y,p∣r1φ⁢(r)≪log⁡(2⁢Y)p−1,\sum_{r\leq Y}\frac{1}{\varphi(r)}\ll\log(2Y),\quad\sum_{r\leq Y,p\mid r}\frac% {1}{\varphi(r)}\ll\frac{\log(2Y)}{p-1},
(3.35) ∑q≍Q1φ⁢(q)2≪L2/Q,∑q≍Q,p∣q1φ⁢(q)2≪L2/(p⁢Q).\sum_{q\asymp Q}\frac{1}{\varphi(q)^{2}}\ll L^{2}/Q,\qquad\sum_{q\asymp Q,p% \mid q}\frac{1}{\varphi(q)^{2}}\ll L^{2}/(pQ).

For Υ1,Υ2,|M⁢T|\Upsilon_{1},\Upsilon_{2},|MT| the weight is bounded by Oσ⁢(MI/(φ⁢(q)2⁢φ⁢(r1)⁢φ⁢(r2)))O_{\sigma}(M_{I}/(\varphi(q)^{2}\varphi(r_{1})\varphi(r_{2}))), since q⁢r1≪Q⁢R⁢S<MIqr_{1}\ll QRS<M_{I}. For |𝒵||\mathcal{Z}| it is Oσ⁢(MI/(q⁢r1⁢r2))⁢1n1≡n2⁢(q)⁢ω⁢(t)O_{\sigma}(M_{I}/(qr_{1}r_{2}))1_{n_{1}\equiv n_{2}(q)}\omega(t). These two shapes prove

(3.36) Υ1⁢(𝔅)+Υ2⁢(𝔅)+|M⁢T|⁢(𝔅)+|𝒵|⁢(𝔅)≪Lc⁢MI⁢NI⁢(NIz0⁢Q+1).\Upsilon_{1}(\mathfrak{B})+\Upsilon_{2}(\mathfrak{B})+|MT|(\mathfrak{B})+|% \mathcal{Z}|(\mathfrak{B})\ll L^{c}M_{I}N_{I}\left(\frac{N_{I}}{z_{0}Q}+1% \right).

For the first failure of (3.30), fix n1n_{1}. Choose one of its at most LL primes p≥z0p\geq z_{0}. Count n2n_{2} in multiples of pp. The first shape gives NI/z0+1N_{I}/z_{0}+1. For the weight of |𝒵||\mathcal{Z}|, (n1,q)=1(n_{1},q)=1. So the extra congruence gives a class modulo p⁢qpq, with NI/(p⁢q)+1N_{I}/(pq)+1 choices. For a common prime p≥u0p\geq u_{0} of r1,r2r_{1},r_{2}, fix r1r_{1}. Sum the pp-divisible r2r_{2} weight using (3.35). For p∣(n1,r2)p\mid(n_{1},r_{2}), fix n1n_{1} and do the same weighted r2r_{2} sum. For p∣(n2,r1)p\mid(n_{2},r_{1}), fix r1r_{1}. Then count n2n_{2} in multiples of pp, or modulo p⁢qpq for the weight of |𝒵||\mathcal{Z}|. For p∣(q,ri)p\mid(q,r_{i}), use the last estimate of (3.35). This covers all five failures, and u0≥z0u_{0}\geq z_{0} gives (3.36).

Split the unrestricted (t,m)(t,m)-sum at

(3.37) Σ∗={τ⁢(|k1|)⁢τ⁢(|k2|)<LCΣ}.\Sigma^{*}=\{\tau(|k_{1}|)\tau(|k_{2}|)<L^{C_{\Sigma}}\}.

The complement is estimated on all tuples, coprime or not. Put u=τ⁢(|k1|)u=\tau(|k_{1}|) and v=τ⁢(|k2|)v=\tau(|k_{2}|). The exceptional indicator is at most u⁢v⁢L−CΣuvL^{-C_{\Sigma}}. The two divisor choices ri∣kir_{i}\mid k_{i} cost at most u⁢vuv. There are also at most uu choices for q∣k1q\mid k_{1}. The resulting weight is u3⁢v2u^{3}v^{2}, of degree five. To keep the progression restriction while counting, split into u≥vu\geq v and v>uv>u. On the first part u3⁢v2≤u5u^{3}v^{2}\leq u^{5}. For each fixed (m,n1)(m,n_{1}), sum over the at most uu divisors qq first. The condition q∣k1q\mid k_{1} and (q,a)=1(q,a)=1 implies (m,q)=1(m,q)=1. Thus q∣k2q\mid k_{2} forces n2≡n1(modq)n_{2}\equiv n_{1}\pmod{q}. There are at most 4⁢NI/Q4N_{I}/Q such n2n_{2}, by (3.6). This bounds the first part by L−CΣ⁢(4⁢NI/Q)⁢∑u5L^{-C_{\Sigma}}(4N_{I}/Q)\sum u^{5}. Exchanging the two copies (n1,r1)↔(n2,r2)(n_{1},r_{1})\leftrightarrow(n_{2},r_{2}) gives the same bound for the second part. Consequently

(3.38) Υexc≪L−CΣ⁢NIQ⁢∑n∈IT,m∈I^Mτ⁢(|m⁢n−a|)5≪MI⁢NI2Q⁢Lc1−CΣ.\Upsilon_{\rm exc}\ll L^{-C_{\Sigma}}\frac{N_{I}}{Q}\sum_{n\in I_{T},m\in% \widehat{I}_{M}}\tau(|mn-a|)^{5}\ll\frac{M_{I}N_{I}^{2}}{Q}L^{c_{1}-C_{\Sigma}}.

The factor 44 from 4⁢NI/Q4N_{I}/Q and the factor 22 from the two parts are absorbed in the implied constant.

For a modulus-related failure, fix (m,n1)(m,n_{1}). The number of (q,r1)(q,r_{1}) with q⁢r1∣k1≠0qr_{1}\mid k_{1}\neq 0 is τ3⁢(|k1|)≤τ⁢(|k1|)2≪ϵXϵ/3\tau_{3}(|k_{1}|)\leq\tau(|k_{1}|)^{2}\ll_{\epsilon}X^{\epsilon/3}. A common prime p≥u0p\geq u_{0} comes from r1r_{1}, n1n_{1}, or qq. It forces n2n_{2} into one class modulo p⁢qpq. For p∣r1,r2p\mid r_{1},r_{2} use p∤mp\nmid m. For p∣n1,r2p\mid n_{1},r_{2} use m⁢n2≡a⁢(p)mn_{2}\equiv a(p). For p∣n2,r1p\mid n_{2},r_{1} use n2≡0⁢(p)n_{2}\equiv 0(p). If p∣q,r2p\mid q,r_{2}, then p⁢q⁢∣q⁢r2∣⁢k2pq\mid qr_{2}\mid k_{2} gives the class directly. If p∣q,r1p\mid q,r_{1} only, exchange the copies. There are O⁢(L)O(L) candidate primes and O⁢(NI/(u0⁢Q)+1)O(N_{I}/(u_{0}Q)+1) choices in each class. There are at most τ⁢(|k2|)\tau(|k_{2}|) remaining choices of r2r_{2}. Hence

(3.39) Υ3⁢(𝔅modulus)≪ϵXϵ⁢MI⁢NI⁢(NI/(u0⁢Q)+1).\Upsilon_{3}(\mathfrak{B}_{\rm modulus})\ll_{\epsilon}X^{\epsilon}M_{I}N_{I}(N% _{I}/(u_{0}Q)+1).

For (n1,n2)>1(n_{1},n_{2})>1 on Σ∗\Sigma^{*}, there are at most L2⁢CΣL^{2C_{\Sigma}} pairs (q,r1)(q,r_{1}). There are at most LL primes p∣n1p\mid n_{1}, p≥z0p\geq z_{0}. There are at most 2⁢NI/(z0⁢Q)+12N_{I}/(z_{0}Q)+1 choices for n2n_{2}. There are at most LCΣL^{C_{\Sigma}} choices for r2r_{2}. Thus

(3.40) Υ3⁢(𝔅n∩Σ∗)≪L3⁢CΣ+1⁢MI⁢NI⁢(NI/(z0⁢Q)+1).\Upsilon_{3}(\mathfrak{B}_{n}\cap\Sigma^{*})\ll L^{3C_{\Sigma}+1}M_{I}N_{I}(N_% {I}/(z_{0}Q)+1).

On the near-diagonal the same count replaces NI/z0N_{I}/z_{0} by T⁢L−CMTL^{-C_{M}}. The density shapes and (3.35) give the same or smaller bound. Therefore

(3.41) Υ3⁢(𝔇∩Σ∗)+Υ1⁢(𝔇)+Υ2⁢(𝔇)+|M⁢T|⁢(𝔇)+|𝒵|⁢(𝔇)\displaystyle\Upsilon_{3}(\mathfrak{D}\cap\Sigma^{*})+\Upsilon_{1}(\mathfrak{D% })+\Upsilon_{2}(\mathfrak{D})+|MT|(\mathfrak{D})+|\mathcal{Z}|(\mathfrak{D})
≪L3⁢CΣ+c⁢MI⁢NI⁢(T⁢L−CM/Q+1).\displaystyle\qquad\ll L^{3C_{\Sigma}+c}M_{I}N_{I}(TL^{-C_{M}}/Q+1).

Use the common constants from §3.10: CΣ=AE+2⁢c∗+3C_{\Sigma}=A_{E}+2c_{*}+3 and CM=5⁢CΣ+AE+Cbox+c∗+3C_{M}=5C_{\Sigma}+A_{E}+C_{\rm box}+c_{*}+3. They satisfy CΣ>AE+c1+2C_{\Sigma}>A_{E}+c_{1}+2 and CM>3⁢CΣ+Cbox+AE+cC_{M}>3C_{\Sigma}+C_{\rm box}+A_{E}+c. To check this, divide by the last term of (3.33). After this division, the right side of (3.41) is at most

L3⁢CΣ+c+AE⁢(T⁢L−CMNI+QNI)≪L3⁢CΣ+c+AE+Cbox−CM+L3⁢CΣ+c+AE⁢X−σ/3=o⁢(1).L^{3C_{\Sigma}+c+A_{E}}\left(\frac{TL^{-C_{M}}}{N_{I}}+\frac{Q}{N_{I}}\right)% \ll L^{3C_{\Sigma}+c+A_{E}+C_{\rm box}-C_{M}}+L^{3C_{\Sigma}+c+A_{E}}X^{-% \sigma/3}=o(1).

Here LEN supplies T/NI≪LCboxT/N_{I}\ll L^{C_{\rm box}}, while (3.6) supplies Q/NI≤X−σ/3Q/N_{I}\leq X^{-\sigma/3}. The chosen CMC_{M} makes the first logarithmic exponent negative; the second term tends to zero for fixed σ\sigma. The same target absorbs (3.38), since CΣ>AE+c1+2C_{\Sigma}>A_{E}+c_{1}+2. This removes bad tuples and the near-diagonal from all of S1,S2,S3,Z,M⁢TS_{1},S_{2},S_{3},Z,MT before their main terms are compared.

Now use CRT on 𝔊′\mathfrak{G}^{\prime}. Let Q1=q⁢r1,Q2=q⁢r2,g=(r1,r2)Q_{1}=qr_{1},Q_{2}=qr_{2},g=(r_{1},r_{2}). The two congruences have one class modulo [Q1,Q2]=q⁢r1⁢r2/g[Q_{1},Q_{2}]=qr_{1}r_{2}/g precisely when (n1,Q1)=(n2,Q2)=1(n_{1},Q_{1})=(n_{2},Q_{2})=1 and n1≡n2⁢(q⁢g)n_{1}\equiv n_{2}(qg). To see this, equate a⁢n¯1a\bar{n}_{1} and a⁢n¯2a\bar{n}_{2} modulo (Q1,Q2)=q⁢g(Q_{1},Q_{2})=qg. On 𝔊′\mathfrak{G}^{\prime}, g=1g=1 and q,r1,r2q,r_{1},r_{2} are pairwise coprime.

Fixed cutoff. On the smoothed support put

(3.42) k⁢(t)=q⁢r1⁢r2≤K∗=40⁢Q⁢R2⁢S2,H2=Q⁢R2⁢S2⁢Xη/MI,H∗=40⁢H2.k(t)=qr_{1}r_{2}\leq K_{*}=40QR^{2}S^{2},\quad H_{2}=QR^{2}S^{2}X^{\eta}/M_{I}% ,\quad H_{*}=40H_{2}.

These are fixed for the entire shell triple. Poisson gives exactly

(3.43) E2∗=\displaystyle E_{2}^{*}={} ∑t∈𝔊′c⁢(t)⁢ω⁢(t)⁢1n1≡n2⁢(q)k⁢(t)\displaystyle\sum_{t\in\mathfrak{G}^{\prime}}\frac{c(t)\omega(t)1_{n_{1}\equiv n% _{2}(q)}}{k(t)}
×∑1≤|h|≤H∗ϕ^0(hMI/k(t))e(h(b(t)−m0)/k(t)),\displaystyle\times\sum_{1\leq|h|\leq H_{*}}\widehat{\phi}_{0}(hM_{I}/k(t))e(h% (b(t)-m_{0})/k(t)),
S3⁢(𝔊′)=\displaystyle S_{3}(\mathfrak{G}^{\prime})={} 𝒵⁢(𝔊′)+MI⁢E2∗+O⁢(X−90).\displaystyle\mathcal{Z}(\mathfrak{G}^{\prime})+M_{I}E_{2}^{*}+O(X^{-90}).

Put λ=MI/k⁢(t)\lambda=M_{I}/k(t). This is the Poisson prefactor of one progression sum. In (3.43) it appears as the factor MIM_{I} in front of E2∗E_{2}^{*} and the factor 1/k⁢(t)1/k(t) inside E2∗E_{2}^{*}. Integration by parts gives |ϕ^0⁢(u)|≤Cj⁢|u|−j|\widehat{\phi}_{0}(u)|\leq C_{j}|u|^{-j}.

Here one may take Cj=(2⁢π)−j⁢‖ϕ0(j)‖1C_{j}=(2\pi)^{-j}\|\phi_{0}^{(j)}\|_{1}. It is independent of the box and the tuple. The integer j=⌈104/η⌉+1j=\lceil 104/\eta\rceil+1 is fixed once σ\sigma is fixed. Choose X0X_{0} after these seminorms and all fixed coefficient parameters. So the tail bound is uniform over the whole box family. If H∗<1H_{*}<1, then λ>Xη\lambda>X^{\eta}, since λ⁢H∗≥Xη\lambda H_{*}\geq X^{\eta}.

The tail of one progression sum is at most Cj′⁢(λ⁢H∗)1−jC^{\prime}_{j}(\lambda H_{*})^{1-j} if H∗≥1H_{*}\geq 1, and at most Cj′⁢λ1−jC^{\prime}_{j}\lambda^{1-j} otherwise. In either case it is O⁢(X−η⁢(j−1))O(X^{-\eta(j-1)}), since λ⁢H∗≥Xη\lambda H_{*}\geq X^{\eta}. Take j=⌈104/η⌉+1j=\lceil 104/\eta\rceil+1. After increasing X0X_{0}, the weighted tail per tuple is at most X−103X^{-103}. There are at most X5X^{5} tuples. This proves (3.43). The cap (3.42) is the same for all tuples. So it survives the Mellin separation of the inner variable below.

On 𝔊′\mathfrak{G}^{\prime}, (3.34) gives

(3.44) S1⁢(𝔊′)=M⁢T⁢(𝔊′)+O⁢(NI2⁢Lc/Q).S_{1}(\mathfrak{G}^{\prime})=MT(\mathfrak{G}^{\prime})+O(N_{I}^{2}L^{c}/Q).

For S2S_{2}, retain (m,r2)=1(m,r_{2})=1. Möbius expansion over e∣r2e\mid r_{2} gives one class modulo q⁢r1⁢eqr_{1}e, so

(3.45) ∑mψI⁢(m)⁢1m⁢n1≡a⁢(q⁢r1)⁢1(m,r2)=1=MI⁢ϕ^0⁢(0)⁢φ⁢(r2)q⁢r1⁢r2+O⁢(τ⁢(r2)).\sum_{m}\psi_{I}(m)1_{mn_{1}\equiv a(qr_{1})}1_{(m,r_{2})=1}=\frac{M_{I}% \widehat{\phi}_{0}(0)\varphi(r_{2})}{qr_{1}r_{2}}+O(\tau(r_{2})).

Divide by φ⁢(q⁢r2)=φ⁢(q)⁢φ⁢(r2)\varphi(qr_{2})=\varphi(q)\varphi(r_{2}). The main term is again M⁢TMT. The summed error is O⁢(R⁢S⁢NI2⁢Lc)O(RSN_{I}^{2}L^{c}). It is absorbed using Q⁢R⁢S<MI⁢X−89⁢σQRS<M_{I}X^{-89\sigma}. Exchanging the two copies shows that M⁢T⁢(𝔊′)MT(\mathfrak{G}^{\prime}) is real. Complete 𝒵\mathcal{Z} and M⁢TMT formally to 𝒯\mathcal{T}, with errors bounded by (3.36), (3.41). This proves (3.32). CRT and the zero-mode identity are used on 𝔊′\mathfrak{G}^{\prime} only.

3.6. Main-term cancellation and the full GR error

Put αn(r)=αn⁢1(n,r)=1\alpha^{(r)}_{n}=\alpha_{n}1_{(n,r)=1} and

(3.46) Δ⁢(ξ;q,b)=∑n≡b⁢(q)ξn−φ⁢(q)−1⁢∑(n,q)=1ξn.\Delta(\xi;q,b)=\sum_{n\equiv b(q)}\xi_{n}-\varphi(q)^{-1}\sum_{(n,q)=1}\xi_{n}.

Expanding the product of these two centered counts gives exactly

(3.47) 𝒵⁢(𝒯)−M⁢T⁢(𝒯)=\displaystyle\mathcal{Z}(\mathcal{T})-MT(\mathcal{T})={} ∑q,r1,r2ψ0⁢(q/Q)⁢1(q,a)=1⁢λr1⁢λ¯r2⁢MI⁢ϕ^0⁢(0)q⁢r1⁢r2\displaystyle\sum_{q,r_{1},r_{2}}\frac{\psi_{0}(q/Q)1_{(q,a)=1}\lambda_{r_{1}}% \bar{\lambda}_{r_{2}}M_{I}\widehat{\phi}_{0}(0)}{qr_{1}r_{2}}
∑bmodq∗Δ⁢(α(r1);q,b)⁢Δ⁢(α(r2);q,b)¯.\displaystyle\qquad\sum_{b\bmod q}^{*}\Delta(\alpha^{(r_{1})};q,b)\overline{% \Delta(\alpha^{(r_{2})};q,b)}.

For the norm-normalized condition [6, (A2)], apply (3.25) to d⁢rdr, with τ⁢(d⁢r)≤τ⁢(d)⁢Oσ⁢(1)\tau(dr)\leq\tau(d)O_{\sigma}(1). If ‖α(r)‖22≤NI⁢L−A3−1\|\alpha^{(r)}\|_{2}^{2}\leq N_{I}L^{-A_{3}-1}, the elementary estimate

(3.48) ∑q≤3⁢Q∑b∗|Δ⁢(α(r);q,b)|2≪(T⁢log⁡(3⁢Q)+3⁢Q)⁢‖α(r)‖22≪NI⁢T⁢L−A3\sum_{q\leq 3Q}\sum_{b}^{*}|\Delta(\alpha^{(r)};q,b)|^{2}\ll(T\log(3Q)+3Q)\|% \alpha^{(r)}\|_{2}^{2}\ll N_{I}TL^{-A_{3}}

suffices, since log⁡(3⁢Q)≤L\log(3Q)\leq L is absorbed by the factor L−1L^{-1}. If ‖α(r)‖22>NI⁢L−A3−1\|\alpha^{(r)}\|_{2}^{2}>N_{I}L^{-A_{3}-1}, then ‖α(r)‖2⁢(2⁢T)1/2≫T⁢L−(Cbox+A3+1)/2\|\alpha^{(r)}\|_{2}(2T)^{1/2}\gg TL^{-(C_{\rm box}+A_{3}+1)/2}. Then (3.25) with exponent ABFI+(Cbox+A3+1)/2A_{\rm BFI}+(C_{\rm box}+A_{3}+1)/2 implies [6, (A2)]. The condition Q<T⁢X−29⁢σQ<TX^{-29\sigma} implies the condition 3⁢Q≤T⁢(log⁡T)−B13Q\leq T(\log T)^{-B_{1}} of [6, Theorem 0(a)] eventually, which then gives (3.48) in this case too. Apply |u⁢v|≤(|u|2+|v|2)/2|uv|\leq(|u|^{2}+|v|^{2})/2 in (3.47), and sum the reciprocal rir_{i} weights. This gives

(3.49) |𝒵⁢(𝒯)−M⁢T⁢(𝒯)|≪MI⁢NI2⁢LCbox+2−A3/Q.|\mathcal{Z}(\mathcal{T})-MT(\mathcal{T})|\ll M_{I}N_{I}^{2}L^{C_{\rm box}+2-A% _{3}}/Q.

Take A3=AE+Cbox+2A_{3}=A_{E}+C_{\rm box}+2. Increase it by a fixed constant to absorb any endpoint logarithm. Combine (3.27), (3.32), (3.33), (3.49), with ϵ=ℓ0⁢σ2/8\epsilon=\ell_{0}\sigma^{2}/8. For a requested local precision A′>0A^{\prime}>0, set Awork=A′+4A_{\rm work}=A^{\prime}+4 before choosing AE,CΣ,CMA_{E},C_{\Sigma},C_{M} as in §3.10. The resulting restoration contributions to |S||S| are at most

(3.50) X⁢L−Awork+X⁢LC⁢z0−1/2+X⁢LC⁢(Q/NI)1/2+X⁢Xϵ/2⁢LC⁢{u0−1/2+(Q/NI)1/2}.XL^{-A_{\rm work}}+XL^{C}z_{0}^{-1/2}+XL^{C}(Q/N_{I})^{1/2}+XX^{\epsilon/2}L^{% C}\{u_{0}^{-1/2}+(Q/N_{I})^{1/2}\}.

Both terms in braces are kept. Their power savings are at least 7⁢ℓ0⁢σ2/167\ell_{0}\sigma^{2}/16 and σ/6−ℓ0⁢σ2/16\sigma/6-\ell_{0}\sigma^{2}/16, respectively. Each exceeds cσc_{\sigma}, and z0−1/2z_{0}^{-1/2} beats every logarithm. More explicitly, for fixed AworkA_{\rm work} and sufficiently large XX, X⁢LC⁢z0−1/2≪X⁢L−AworkXL^{C}z_{0}^{-1/2}\ll XL^{-A_{\rm work}}, because z0−1/2=X−1/(2⁢(log⁡log⁡X)3)z_{0}^{-1/2}=X^{-1/(2(\log\log X)^{3})} beats every fixed logarithm. Thus this term joins the first term in (3.51), rather than the fixed-power-saving term. The separate term X⁢LC⁢(Q/NI)1/2XL^{C}(Q/N_{I})^{1/2} in (3.50) has saving σ/6>cσ\sigma/6>c_{\sigma}, by NI≥Q⁢Xσ/3N_{I}\geq QX^{\sigma/3} in (3.6), and is therefore absorbed in the displayed power-saving term. Increase X0X_{0} after the fixed exponents. This gives

(3.51) |S|≪X⁢L−Awork+MI⁢Q1/2⁢Lc⁢|E2∗|1/2+X1−cσ⁢LC.|S|\ll XL^{-A_{\rm work}}+M_{I}Q^{1/2}L^{c}|E_{2}^{*}|^{1/2}+X^{1-c_{\sigma}}L% ^{C}.

This completes the first dispersion. A later saving for E2∗E_{2}^{*} changes only the middle term.

3.7. Reciprocity, the complete mask, and the second square

Split the combined products again as ri←ri⁢sir_{i}\leftarrow r_{i}s_{i}, where ri≍R,si≍Sr_{i}\asymp R,s_{i}\asymp S. The remaining support is

(q,r1⁢s1⁢r2⁢s2)=(r1⁢s1,r2⁢s2)=(n1,n2)=1,(q,r_{1}s_{1}r_{2}s_{2})=(r_{1}s_{1},r_{2}s_{2})=(n_{1},n_{2})=1,
(3.52) (n1,r2⁢s2)=(n2,r1⁢s1)=1,(ni,q⁢ri⁢si)=1,|n1−n2|≥T⁢L−CM.(n_{1},r_{2}s_{2})=(n_{2},r_{1}s_{1})=1,\quad(n_{i},qr_{i}s_{i})=1,\quad|n_{1}% -n_{2}|\geq TL^{-C_{M}}.

Solving the two CRT congruences and using u¯/v+v¯/u≡1/(u⁢v)(mod1)\bar{u}/v+\bar{v}/u\equiv 1/(uv)\pmod{1} for (u,v)=1(u,v)=1 gives

(3.53) a⁢h⁢n1⁢r2⁢s2¯q⁢r1⁢s1+a⁢h⁢n2⁢q⁢r1⁢s1¯r2⁢s2≡a⁢h⁢(n1−n2)⁢n2⁢q⁢r1⁢s1¯n1⁢r2⁢s2+a⁢hq⁢r1⁢s1⁢r2⁢s2⁢n1(mod1).\frac{ah\overline{n_{1}r_{2}s_{2}}}{qr_{1}s_{1}}+\frac{ah\overline{n_{2}qr_{1}% s_{1}}}{r_{2}s_{2}}\equiv\frac{ah(n_{1}-n_{2})\overline{n_{2}qr_{1}s_{1}}}{n_{% 1}r_{2}s_{2}}+\frac{ah}{qr_{1}s_{1}r_{2}s_{2}n_{1}}\pmod{1}.

All inverses exist by (3.52). Put f=(n1−n2)/q≠0f=(n_{1}-n_{2})/q\neq 0. Then the outer tuple ω=(f,n1,n2,r1,r2,s2)\omega=(f,n_{1},n_{2},r_{1},r_{2},s_{2}) determines q=(n1−n2)/fq=(n_{1}-n_{2})/f. The modular phase becomes

(3.54) e⁢(a⁢h⁢f⁢n2⁢r1⁢s1¯n1⁢r2⁢s2).e\left(\frac{ahf\overline{n_{2}r_{1}s_{1}}}{n_{1}r_{2}s_{2}}\right).

Split f≠0f\neq 0 by sign and dyadic intervals f∈ςf⁢(F,2⁢F]f\in\varsigma_{f}(F,2F], starting at F=1/2F=1/2. Split h≠0h\neq 0 by sign and intervals H0<|h|≤min⁡(2⁢H0,H∗)H_{0}<|h|\leq\min(2H_{0},H_{*}), starting at H0=1/2H_{0}=1/2. These disjoint intervals include f,h=±1f,h=\pm 1 exactly once. Write ςf,ςh∈{±1}\varsigma_{f},\varsigma_{h}\in\{\pm 1\} for the signs of ff and hh. The cap on the last, shortened hh-block depends on hh alone. Always F≪T/QF\ll T/Q.

The nonmodular factor is exactly

(3.55) ϕ^0⁢(h⁢MIq⁢r1⁢s1⁢r2⁢s2)⁢e⁢[hq⁢r1⁢s1⁢r2⁢s2⁢(an1−m0)].\widehat{\phi}_{0}\left(\frac{hM_{I}}{qr_{1}s_{1}r_{2}s_{2}}\right)e\left[% \frac{h}{qr_{1}s_{1}r_{2}s_{2}}\left(\frac{a}{n_{1}}-m_{0}\right)\right].

Its dependence on (h,s1)(h,s_{1}) is only through |h|/s1|h|/s_{1}. For v=|h|⁢S/(H0⁢s1)∈[1/2,2]v=|h|S/(H_{0}s_{1})\in[1/2,2], choose a fixed smooth cutoff. It equals 1 there and is supported in (1/4,4)(1/4,4). Rewrite (3.55):

(3.56) WY⁢(ω)⁢(v)=w⁢(v)⁢ϕ^0⁢(Y2⁢v)⁢e⁢(Y1⁢v),Y1=ςh⁢H0⁢(a/n1−m0)S⁢q⁢r1⁢r2⁢s2,Y2=ςh⁢H0⁢MIS⁢q⁢r1⁢r2⁢s2.\begin{gathered}W_{Y(\omega)}(v)=w(v)\widehat{\phi}_{0}(Y_{2}v)e(Y_{1}v),\\ Y_{1}=\frac{\varsigma_{h}H_{0}(a/n_{1}-m_{0})}{Sqr_{1}r_{2}s_{2}},\qquad Y_{2}% =\frac{\varsigma_{h}H_{0}M_{I}}{Sqr_{1}r_{2}s_{2}}.\end{gathered}

Since H0≤H∗=40⁢H2H_{0}\leq H_{*}=40H_{2},

(3.57) |Y1|+|Y2|≪(1+a/X)LCboxXη≪LCbox+KscaleXη=:Losc.|Y_{1}|+|Y_{2}|\ll(1+a/X)L^{C_{\rm box}}X^{\eta}\ll L^{C_{\rm box}+K_{\rm scale% }}X^{\eta}=:L_{\rm osc}.

Mellin inversion separates the ratio. Put m⁢(t)=supω|W~Y⁢(ω)⁢(i⁢t)|m(t)=\sup_{\omega}|\widetilde{W}_{Y(\omega)}(it)|. The zeroth and second logarithmic derivative estimates give

(3.58) m⁢(t)≪min⁡{1,Losc2/(1+|t|)2},∫ℝm⁢(t)⁢𝑑t≪Losc.m(t)\ll\min\{1,L_{\rm osc}^{2}/(1+|t|)^{2}\},\qquad\int_{\mathbb{R}}m(t)\,dt% \ll L_{\rm osc}.

If m⁢(t)>0m(t)>0, divide the outer coefficient by m⁢(t)m(t). The norm bounds below are for this normalized coefficient. The factor m⁢(t)m(t) is restored before the tt-integration. If m⁢(t)=0m(t)=0, the integrand is zero. So the integrable decay of mm is kept.

The full inner coprimality mask is

(3.59) (s1,a⁢c)=1,(s1,Jω)=1,c=n1⁢r2⁢s2,Jω=q⁢n2.(s_{1},ac)=1,\qquad(s_{1},J_{\omega})=1,\quad c=n_{1}r_{2}s_{2},\quad J_{% \omega}=qn_{2}.

The second condition combines (s1,q)=1(s_{1},q)=1 and (s1,n2)=1(s_{1},n_{2})=1. To separate the second, split 𝒫X=[u0,X3]∩ℙ\mathcal{P}_{X}=[u_{0},X^{3}]\cap\mathbb{P} at random. Each prime goes independently and uniformly into one of two classes Bχ,RχB_{\chi},R_{\chi}. For an integer mm, let 𝒫X⁢(m)={p∈𝒫X:p∣m}\mathcal{P}_{X}(m)=\{p\in\mathcal{P}_{X}:p\mid m\} and νX⁢(m)=|𝒫X⁢(m)|\nu_{X}(m)=|\mathcal{P}_{X}(m)|. If all prime factors of ss lie in 𝒫X\mathcal{P}_{X}, then exactly

(3.60) 1(s,J)=1=𝔼χ⁢[2νX⁢(s)+νX⁢(J)⁢1𝒫X⁢(s)⊆Bχ⁢1𝒫X⁢(J)⊆Rχ].1_{(s,J)=1}=\mathbb{E}_{\chi}[2^{\nu_{X}(s)+\nu_{X}(J)}1_{\mathcal{P}_{X}(s)% \subseteq B_{\chi}}1_{\mathcal{P}_{X}(J)\subseteq R_{\chi}}].

A common prime makes the event impossible. Otherwise the event has probability 2−νX⁢(s)−νX⁢(J)2^{-\nu_{X}(s)-\nu_{X}(J)}. Every prime of a supported s1s_{1} lies in 𝒫X\mathcal{P}_{X}. So (s1,Jω)=1(s_{1},J_{\omega})=1 depends only on the primes of JωJ_{\omega} in 𝒫X\mathcal{P}_{X}. Since s1≤X0.6s_{1}\leq X^{0.6} and Jω≤X0.94J_{\omega}\leq X^{0.94}, one may take

(3.61) Ks=⌈0.6/(ℓ0⁢σ2)⌉,KJ=⌈1/(ℓ0⁢σ2)⌉.K_{s}=\lceil 0.6/(\ell_{0}\sigma^{2})\rceil,\qquad K_{J}=\lceil 1/(\ell_{0}% \sigma^{2})\rceil.

Replace the inner coefficient by λsχ=λs⁢2νX⁢(s)−Ks⁢1𝒫X⁢(s)⊆Bχ\lambda_{s}^{\chi}=\lambda_{s}2^{\nu_{X}(s)-K_{s}}1_{\mathcal{P}_{X}(s)% \subseteq B_{\chi}} and each outer representation coefficient by Aωχ=Aω⁢2νX⁢(Jω)−KJ⁢1𝒫X⁢(Jω)⊆RχA_{\omega}^{\chi}=A_{\omega}2^{\nu_{X}(J_{\omega})-K_{J}}1_{\mathcal{P}_{X}(J_% {\omega})\subseteq R_{\chi}}. Both multipliers have modulus at most 1. The original sum is 2Ks+KJ⁢𝔼χ⁢Wχ2^{K_{s}+K_{J}}\mathbb{E}_{\chi}W_{\chi}. This factor is Oσ⁢(1)O_{\sigma}(1), and 𝔼χ\mathbb{E}_{\chi} is an average. Fix χ\chi before aggregating representations. The partition acts on λs\lambda_{s} and AωA_{\omega} only, so (3.25) for αn\alpha_{n} holds for each χ\chi.

Set b=n2⁢r1,c=n1⁢r2⁢s2b=n_{2}r_{1},c=n_{1}r_{2}s_{2}, and

(3.62) I⁢(b,c,f)=∑s≍S,(s,a⁢c)=1∑hλs,t′⁢ηh,t⁢e⁢(a⁢h⁢f⁢b⁢s¯/c),I(b,c,f)=\sum_{s\asymp S,(s,ac)=1}\sum_{h}\lambda^{\prime}_{s,t}\eta_{h,t}e(% ahf\overline{bs}/c),

where λs,t′=(S/s)⁢λsχ⁢(s/S)i⁢t\lambda^{\prime}_{s,t}=(S/s)\lambda_{s}^{\chi}(s/S)^{it}, and ηh,t=(|h|/H0)−i⁢t⁢1|h|≤H∗\eta_{h,t}=(|h|/H_{0})^{-it}1_{|h|\leq H_{*}} on the chosen signed block. Both are 1-bounded. Dyadically localize b≍D,c≍Cb\asymp D,c\asymp C. The outer support has (b,c)=(b,p0)=1(b,c)=(b,p_{0})=1. So the nonnegative majorant

(3.63) ρ=ψ0⁢(b/D)⁢ψ0⁢(c/C)⁢1(b,c)=(b,p0)=1⁢1f∈ςf⁢(F,2⁢F]\rho=\psi_{0}(b/D)\psi_{0}(c/C)1_{(b,c)=(b,p_{0})=1}1_{f\in\varsigma_{f}(F,2F]}

equals 1 on it. Cauchy–Schwarz now gives

(3.64) |Wχ,t|≤(∑b,c,f|Ab,c,fχ|2)1/2⁢W41/2,W4=∑b,c,fρ⁢|I|2.|W_{\chi,t}|\leq\left(\sum_{b,c,f}|A_{b,c,f}^{\chi}|^{2}\right)^{1/2}W_{4}^{1/% 2},\quad W_{4}=\sum_{b,c,f}\rho|I|^{2}.

Fix (b,c,f)(b,c,f). Factor b=n2⁢r1,c=n1⁢r2⁢s2b=n_{2}r_{1},c=n_{1}r_{2}s_{2}; then qq is determined. So there are at most τ⁢(b)⁢τ3⁢(c)\tau(b)\tau_{3}(c) outer representations. For fixed n1,n2n_{1},n_{2} the permitted q∣n1−n2q\mid n_{1}-n_{2} have divisor multiplicity. So there are O⁢(T2⁢R2⁢S)⁢Xo⁢(1)O(T^{2}R^{2}S)X^{o(1)} representations in total. A normalized representation coefficient has modulus Oσ⁢((Q⁢R2⁢S2)−1)O_{\sigma}((QR^{2}S^{2})^{-1}). Summing over representations with Cauchy–Schwarz,

(3.65) (∑|Aχ|2)1/2≪Xo⁢(1)⁢TQ⁢R⁢S3/2.\left(\sum|A^{\chi}|^{2}\right)^{1/2}\ll X^{o(1)}\frac{T}{QRS^{3/2}}.

This bound holds for the coefficients AχA^{\chi} of each class χ\chi.

Expanding |I|2|I|^{2}, put

(3.66) z=s⁢s′,k=h1⁢s′−h2⁢s,y=f⁢k.z=ss^{\prime},\quad k=h_{1}s^{\prime}-h_{2}s,\quad y=fk.

The terms with k=0k=0 have at most Xo⁢(1)⁢H∗⁢SX^{o(1)}H_{*}S choices of (s,s′,h1,h2)(s,s^{\prime},h_{1},h_{2}). To see this, write (s,s′)=g⁢(u,v)(s,s^{\prime})=g(u,v), (u,v)=1(u,v)=1, and (h1,h2)=j⁢(u,v)(h_{1},h_{2})=j(u,v). Sum (g,j)(g,j) over their ranges. Thus

(3.67) |Wk=0|≪Xo⁢(1)⁢H∗⁢S⁢D⁢F⁢C≪(T2⁢R2⁢S3)⁢X−8⁢σ+η+o⁢(1),|W_{k=0}|\ll X^{o(1)}H_{*}SDFC\ll(T^{2}R^{2}S^{3})X^{-8\sigma+\eta+o(1)},

where the final inequality is T2⁢R2⁢S<X1−8⁢σT^{2}R^{2}S<X^{1-8\sigma}. For k≠0k\neq 0, split y=εy⁢my=\varepsilon_{y}m, m>0m>0, and zz into Z∈{S2,2⁢S2}Z\in\{S^{2},2S^{2}\}. The coefficient independent of (b,c)(b,c) is

(3.68) βz,mχ,εy=\displaystyle\beta^{\chi,\varepsilon_{y}}_{z,m}={} 1(z,a⁢p0)=1⁢∑s⁢s′=zλs,t′⁢λ¯s′,t′⁢∑f∈ςf⁢(F,2⁢F],hi⁢in⁢blockf⁢(h1⁢s′−h2⁢s)=εy⁢mηh1,t⁢η¯h2,t.\displaystyle 1_{(z,ap_{0})=1}\sum_{ss^{\prime}=z}\lambda^{\prime}_{s,t}\bar{% \lambda}^{\prime}_{s^{\prime},t}\sum_{\begin{subarray}{c}f\in\varsigma_{f}(F,2% F],\ h_{i}\ {\rm in\ block}\\ f(h_{1}s^{\prime}-h_{2}s)=\varepsilon_{y}m\end{subarray}}\eta_{h_{1},t}\bar{% \eta}_{h_{2},t}.

Put Y:=H∗⁢S⁢FY:=H_{*}SF. By (3.70), |y|≤8⁢F⁢H∗⁢S|y|\leq 8FH_{*}S. So the coefficient is supported on 1≤m≤8⁢Y1\leq m\leq 8Y. The off-diagonal sum is exactly

(3.69) ∑z,mβz,mχ,εy⁢∑b,c:(b,c)=(b,p0)=(z,c)=1ψ0⁢(b/D)⁢ψ0⁢(c/C)⁢e⁢(εy⁢a⁢m⁢z⁢b¯/c).\sum_{z,m}\beta_{z,m}^{\chi,\varepsilon_{y}}\sum_{b,c:(b,c)=(b,p_{0})=(z,c)=1}% \psi_{0}(b/D)\psi_{0}(c/C)e(\varepsilon_{y}am\overline{zb}/c).

3.8. The W-prime norm, with endpoints

For S≥1S\geq 1, 1≤H≤S1\leq H\leq S, F≥1/2F\geq 1/2, and a≠0a\neq 0, let

(3.70) Bz,y=#{\displaystyle B_{z,y}=\#\{ si∈(S,2⁢S],(s1⁢s2,a)=1,\displaystyle s_{i}\in(S,2S],\ (s_{1}s_{2},a)=1,
1≤|hi|≤H,f∈(F,2F]:\displaystyle 1\leq|h_{i}|\leq H,\ f\in(F,2F]:
s1s2=z,f(h1s2−h2s1)=y≠0}.\displaystyle s_{1}s_{2}=z,\ f(h_{1}s_{2}-h_{2}s_{1})=y\neq 0\}.

For every nonzero integer vv, define its aa-supported part by va=∏p∣apvp⁢(|v|)v_{a}=\prod_{p\mid a}p^{v_{p}(|v|)}. In particular ya=∏p∣apvp⁢(|y|)y_{a}=\prod_{p\mid a}p^{v_{p}(|y|)}. Set

(3.71) 𝒯0=max⁡τ⁢(z)⁢τ⁢(|y|),P0=∏p∣a(1−pϑsp−1)−1,P1=P02,P2=∏p∣a(1−pϑsp−1/2)−1,\begin{gathered}\mathcal{T}_{0}=\max\tau(z)\tau(|y|),\qquad P_{0}=\prod_{p\mid a% }(1-p^{\vartheta_{\rm sp}-1})^{-1},\\ P_{1}=P_{0}^{2},\qquad P_{2}=\prod_{p\mid a}(1-p^{\vartheta_{\rm sp}-1/2})^{-1% },\end{gathered}

where the maximum is over z≤4⁢S2,0<|y|≤8⁢F⁢H⁢Sz\leq 4S^{2},0<|y|\leq 8FHS. Then

(3.72) ∑z,y≠0Bz,y2⁢(ya)ϑsp≤𝒯0⁢ 2⁢F⁢P0⁢H2⁢S2⁢[16⁢P1+64⁢(8+log⁡(2⁢S))⁢P0+32⁢P2].\sum_{z,y\neq 0}B_{z,y}^{2}(y_{a})^{\vartheta_{\rm sp}}\leq\mathcal{T}_{0}\,2% FP_{0}H^{2}S^{2}[16P_{1}+64(8+\log(2S))P_{0}+32P_{2}].

Proof. For fixed s=(s1,s2)s=(s_{1},s_{2}), let Ns⁢(k)=#⁢{h:1≤|hi|≤H,h1⁢s2−h2⁢s1=k}N_{s}(k)=\#\{h:1\leq|h_{i}|\leq H,h_{1}s_{2}-h_{2}s_{1}=k\}. Each (z,y)(z,y) has at most τ⁢(z)⁢τ⁢(|y|)\tau(z)\tau(|y|) choices of (s,f)(s,f). Therefore Cauchy–Schwarz and (f⁢k)a=fa⁢ka(fk)_{a}=f_{a}k_{a} reduce the left side to

(3.73) 𝒯0⁢(∑f≤2⁢Ffaϑsp)⁢Q0,Q0=∑s∑k≠0kaϑsp⁢Ns⁢(k)2,∑f≤2⁢Ffaϑsp≤2⁢F⁢P0.\mathcal{T}_{0}\left(\sum_{f\leq 2F}f_{a}^{\vartheta_{\rm sp}}\right)Q_{0},% \qquad Q_{0}=\sum_{s}\sum_{k\neq 0}k_{a}^{\vartheta_{\rm sp}}N_{s}(k)^{2},% \quad\sum_{f\leq 2F}f_{a}^{\vartheta_{\rm sp}}\leq 2FP_{0}.

For the last inequality, majorize faϑspf_{a}^{\vartheta_{\rm sp}} by ∑d∣a∞,d∣fdϑsp\sum_{d\mid a^{\infty},d\mid f}d^{\vartheta_{\rm sp}}. Then sum ⌊2⁢F/d⌋≤2⁢F/d\lfloor 2F/d\rfloor\leq 2F/d. It holds for every F>0F>0.

Put g=(s1,s2)g=(s_{1},s_{2}), s=g⁢(u,v)s=g(u,v), S′=S/gS^{\prime}=S/g. A fibre of h1⁢s2−h2⁢s1h_{1}s_{2}-h_{2}s_{1} has at most 1+2⁢H/S′1+2H/S^{\prime} points. It has at most one when S′≥2⁢HS^{\prime}\geq 2H. Expand

(3.74) kaϑsp=∑d∣a∞,d∣kφϑsp⁢(d),φϑsp⁢(pj)=pj⁢ϑsp⁢(1−p−ϑsp),0≤φϑsp⁢(d)≤dϑsp.k_{a}^{\vartheta_{\rm sp}}=\sum_{d\mid a^{\infty},d\mid k}\varphi_{\vartheta_{% \rm sp}}(d),\quad\varphi_{\vartheta_{\rm sp}}(p^{j})=p^{j\vartheta_{\rm sp}}(1% -p^{-\vartheta_{\rm sp}}),\quad 0\leq\varphi_{\vartheta_{\rm sp}}(d)\leq d^{% \vartheta_{\rm sp}}.

Here φϑsp\varphi_{\vartheta_{\rm sp}} is multiplicative with φϑsp⁢(1)=1\varphi_{\vartheta_{\rm sp}}(1)=1; the prime-power formula is for j≥1j\geq 1.

If Ad⁢(s)A_{d}(s) counts h∈[−H,H]2h\in[-H,H]^{2} with k≠0,d∣kk\neq 0,d\mid k, then

(3.75) Q0≤∑d∣a∞,d≤4⁢H⁢Sdϑsp⁢[∑sAd⁢(s)+∑s:S′<2⁢H2⁢HS′⁢Ad⁢(s)].Q_{0}\leq\sum_{d\mid a^{\infty},d\leq 4HS}d^{\vartheta_{\rm sp}}\left[\sum_{s}% A_{d}(s)+\sum_{s:S^{\prime}<2H}\frac{2H}{S^{\prime}}A_{d}(s)\right].

For the first sum write h=e⁢wh=ew, ww primitive, ‖w‖∞=j≤H\|w\|_{\infty}=j\leq H. There are at most 8⁢j8j choices of ww, and e≤H/je\leq H/j. The congruence is de∣w1⁢s2−w2⁢s1d_{e}\mid w_{1}s_{2}-w_{2}s_{1}, de=d/(d,e)d_{e}=d/(d,e). Since (s1⁢s2,de)=1(s_{1}s_{2},d_{e})=1, a contributing primitive vector has (w1,de)=1(w_{1},d_{e})=1. The case w1=0w_{1}=0 forces de=1d_{e}=1. There are at most 2⁢S2S choices for s1s_{1}, then S/de+1S/d_{e}+1 for s2s_{2}. By ∑e≤E(d,e)≤τ⁢(d)⁢E\sum_{e\leq E}(d,e)\leq\tau(d)E, this proves

(3.76) ∑sAd⁢(s)≤16⁢τ⁢(d)⁢H2⁢S2/d+16⁢H2⁢S.\sum_{s}A_{d}(s)\leq 16\tau(d)H^{2}S^{2}/d+16H^{2}S.

For the second sum (d,g)=1(d,g)=1. At most 8⁢H⁢S′/d8HS^{\prime}/d nonzero levels of h1⁢v−h2⁢uh_{1}v-h_{2}u are divisible by dd. Each has at most 4⁢H/S′4H/S^{\prime} points. Thus Ad⁢(s)≤32⁢H2/dA_{d}(s)\leq 32H^{2}/d. For each gg, sum the at most (S/g+1)2(S/g+1)^{2} pairs. Use the exact inequality

(3.77) ∑g≤2⁢S(S/g+1)2S/g=∑g≤2⁢S(S/g+2+g/S)≤S⁢(8+log⁡(2⁢S)).\sum_{g\leq 2S}\frac{(S/g+1)^{2}}{S/g}=\sum_{g\leq 2S}(S/g+2+g/S)\leq S(8+\log% (2S)).

So before the dd-sum, the second term of (3.75) is at most 64⁢(8+log⁡(2⁢S))⁢H3⁢S/d≤64⁢(8+log⁡(2⁢S))⁢H2⁢S2/d64(8+\log(2S))H^{3}S/d\leq 64(8+\log(2S))H^{2}S^{2}/d, using H≤SH\leq S. Finally

(3.78) ∑d∣a∞τ⁢(d)⁢dϑsp−1\displaystyle\sum_{d\mid a^{\infty}}\tau(d)d^{\vartheta_{\rm sp}-1} =P1,\displaystyle=P_{1},
∑d∣a∞dϑsp−1\displaystyle\sum_{d\mid a^{\infty}}d^{\vartheta_{\rm sp}-1} =P0,\displaystyle=P_{0},
∑d≤4⁢H⁢S,d∣a∞dϑsp\displaystyle\sum_{d\leq 4HS,d\mid a^{\infty}}d^{\vartheta_{\rm sp}} ≤(4⁢H⁢S)1/2⁢P2.\displaystyle\leq(4HS)^{1/2}P_{2}.

The last contribution of (3.76) is at most 32⁢H2⁢S2⁢P232H^{2}S^{2}P_{2}, since H≤SH\leq S. This proves (3.72), also for real nonintegral (S,H)(S,H).

Uniformly for |a|≤X2|a|\leq X^{2}, elementary prime ordering gives

(3.79) P0,P1,P2≤exp⁡(C⁢(log⁡X)23/32)=Xo⁢(1),𝒯0≤exp⁡(C⁢log⁡X/log⁡log⁡X)=Xo⁢(1).\begin{gathered}P_{0},P_{1},P_{2}\leq\exp(C(\log X)^{23/32})=X^{o(1)},\\ \mathcal{T}_{0}\leq\exp(C\log X/\log\log X)=X^{o(1)}.\end{gathered}

For α∈{1−ϑsp,1/2−ϑsp}\alpha\in\{1-\vartheta_{\rm sp},1/2-\vartheta_{\rm sp}\} we have ∑p∣ap−α≤∑j≤ω⁢(a)j−α≪(log⁡X)1−α\sum_{p\mid a}p^{-\alpha}\leq\sum_{j\leq\omega(a)}j^{-\alpha}\ll(\log X)^{1-\alpha}. The bound for the products then follows from −log⁡(1−v)≪v-\log(1-v)\ll v. The divisor bound is elementary.

To apply (3.72) to (3.68), use the cap H=min⁡(2⁢H0,H∗)H=\min(2H_{0},H_{*}). Empty blocks have zero coefficient. Increase X0X_{0} in (3.6)–(3.7). Then

(3.80) H2/S≪X−9⁢σ+η⁢LCbox,H∗≤S.H_{2}/S\ll X^{-9\sigma+\eta}L^{C_{\rm box}},\qquad H_{*}\leq S.

The strict power margin in (3.6)–(3.7) absorbs the fixed logarithmic factor and the factor 40. For S=1/2S=1/2 this gives H∗=40⁢H2≪X−9⁢σ+η⁢LCbox→0H_{*}=40H_{2}\ll X^{-9\sigma+\eta}L^{C_{\rm box}}\to 0. If the middle factor is supported at s=1∈(1/2,1]s=1\in(1/2,1], set S=1/2S=1/2. Then H∗<1H_{*}<1, every nonzero-frequency block is empty, and E2∗=0E_{2}^{*}=0. Thus Theorem 2.8 is needed only for S≥1S\geq 1; in that case a nonempty block has H≥1H\geq 1. Each summand of (3.68) has modulus at most 1, so |βz,m|≤Bz,εy⁢ςf⁢m|\beta_{z,m}|\leq B_{z,\varepsilon_{y}\varsigma_{f}m}. Since p0∤ap_{0}\nmid a, (p0⁢m)a=ma(p_{0}m)_{a}=m_{a} exactly. Thus

(3.81) ∑n′′∣a∞(n′′)ϑsp⁢‖β♭⁢(n′′)‖22≪Xo⁢(1)⁢(H∗⁢S)2⁢F,‖β‖22≪Xo⁢(1)⁢(H∗⁢S)2⁢F.\sum_{n^{\prime\prime}\mid a^{\infty}}(n^{\prime\prime})^{\vartheta_{\rm sp}}% \|\beta^{\flat}(n^{\prime\prime})\|_{2}^{2}\ll X^{o(1)}(H_{*}S)^{2}F,\qquad\|% \beta\|_{2}^{2}\ll X^{o(1)}(H_{*}S)^{2}F.

The second estimate is the same proof with ϑsp=0\vartheta_{\rm sp}=0. Here S≥1S\geq 1, as (3.72) requires; the case S=1/2S=1/2 was treated above. If γ1\gamma_{1} is supported at 11, take q=1,Q=1q=1,Q=1. If γ3\gamma_{3} is supported at 11, it is a fixed coordinate. If the full modulus is 1, the discrepancy is identically zero.

3.9. Application of Theorem 2.8 and the spectral budget

For nonzero (3.69), set

(3.82) rT=z≍Z,sT=p0,RT=Z,ST=p0/2,\displaystyle r_{T}=z\asymp Z,\ s_{T}=p_{0},\ R_{T}=Z,\ S_{T}=p_{0}/2,\quad
dT=b,cT=c,nT=p0⁢m,NT=8⁢p0⁢Y,aT=εy⁢a.\displaystyle d_{T}=b,\ c_{T}=c,\ n_{T}=p_{0}m,\ N_{T}=8p_{0}Y,\quad a_{T}=% \varepsilon_{y}a.

Let the Theorem 2.8 coefficient equal βz,m\beta_{z,m} at these indices and zero elsewhere. The support conditions give exactly

(3.83) (zb,p0c)=1⇔(b,c)=(z,c)=(z,p0)=(b,p0)=1,(aT,zp0)=1.(zb,p_{0}c)=1\iff(b,c)=(z,c)=(z,p_{0})=(b,p_{0})=1,\qquad(a_{T},zp_{0})=1.

Here (z,c)=1(z,c)=1 comes from (s,a⁢c)=(s′,a⁢c)=1(s,ac)=(s^{\prime},ac)=1. The p0p_{0} conditions on (b,z)(b,z) come from their roughness. The smoothed variable cc may be divisible by p0p_{0}. Reducing the inverse modulo cc gives the exact phase identity

(3.84) e⁢(aT⁢(p0⁢m)⁢z⁢b¯p0⁢cp0⁢c)=e⁢(εy⁢a⁢m⁢z⁢b¯cc).e\left(\frac{a_{T}(p_{0}m)\overline{zb}_{p_{0}c}}{p_{0}c}\right)=e\left(\frac{% \varepsilon_{y}am\overline{zb}_{c}}{c}\right).

We make the dyadic support of the smooth weight explicit. Choose a fixed smooth step χ\chi. It is zero on (−∞,0](-\infty,0] and one on [1,∞)[1,\infty). Split

(3.85) ψ0,1⁢(v)\displaystyle\psi_{0,1}(v) =ψ0⁢(v)⁢[1−χ⁢((v−0.8)/0.1)],\displaystyle=\psi_{0}(v)[1-\chi((v-0.8)/0.1)],
ψ0,2⁢(v)\displaystyle\psi_{0,2}(v) =ψ0⁢(v)⁢χ⁢((v−0.8)/0.1)⁢[1−χ⁢((v−1.4)/0.2)],\displaystyle=\psi_{0}(v)\chi((v-0.8)/0.1)[1-\chi((v-1.4)/0.2)],
ψ0,3⁢(v)\displaystyle\psi_{0,3}(v) =ψ0⁢(v)⁢χ⁢((v−1.4)/0.2).\displaystyle=\psi_{0}(v)\chi((v-1.4)/0.2).

They sum to ψ0\psi_{0}. They lie in the strict dyadic windows (0.45,0.90](0.45,0.90], (0.80,1.60](0.80,1.60], (1.40,2.80](1.40,2.80]. Expanding the (b,c)(b,c) bumps gives nine weights. Multiply by fixed smooth cutoffs equal to 1 on the supported nT,z,p0n_{T},z,p_{0} indices. At the lower nTn_{T} endpoint use a cutoff zero below 1/21/2 and one above 1. Its derivatives are Oν⁢(nT−ν)O_{\nu}(n_{T}^{-\nu}). Each weight satisfies the Theorem 2.8 derivative conditions with ϵ0=σ/2000>0\epsilon_{0}=\sigma/2000>0. Take ϵ=σ/100\epsilon=\sigma/100, AT=A0A_{T}=A_{0}. Thus (3.14), exactly as stated, applies to (3.69).

We bound the four terms of its bracket. Put

(3.86) V=T4⁢R4⁢S6,D∗=T⁢R,C∗=T⁢R⁢S,Z≍S2,Y≪Xo⁢(1)+η⁢T2⁢R2⁢S3/X.\begin{gathered}V=T^{4}R^{4}S^{6},\quad D_{*}=TR,\quad C_{*}=TRS,\\ Z\asymp S^{2},\quad Y\ll X^{o(1)+\eta}T^{2}R^{2}S^{3}/X.\end{gathered}

Since ϑsp<1/2\vartheta_{\rm sp}<1/2, all powers of (D,C)(D,C) in (3.15) are nonnegative. First replace them monotonically by D∗,C∗D_{*},C_{*}. Then C∗≤D∗⁢ZC_{*}\leq D_{*}Z, and Y≪Z⁢X−8⁢σ+η+o⁢(1)Y\ll ZX^{-8\sigma+\eta+o(1)}. Apply (3.81). Suppress only uniform Xo⁢(1)X^{o(1)} and p0p_{0}-powers. This gives

(3.87) bracket term/Vupper bound1KA=A0ϑsp⁢T⁢Q⁢R2⁢S5/X22(A0/X)⁢KA3KR=(T⁢R/S)2⁢ϑsp⁢T⁢Q⁢R2⁢S5/X24(T⁢Q⁢R2⁢S5/X2)⁢(T2⁢R2/X).\begin{array}[]{c|c}\text{bracket term}/V&\text{upper bound}\\ \hline\cr 1&K_{A}=A_{0}^{\vartheta_{\rm sp}}TQR^{2}S^{5}/X^{2}\\ 2&(A_{0}/X)K_{A}\\ 3&K_{R}=(TR/S)^{2\vartheta_{\rm sp}}TQR^{2}S^{5}/X^{2}\\ 4&(TQR^{2}S^{5}/X^{2})(T^{2}R^{2}/X).\end{array}

We check the regular third term directly. Up to p0p_{0}-powers, its bracket before the coefficient norm is

(3.88) C⁢(C⁢D⁢Z)2⁢ϑsp⁢Z1−ϑsp⁢(D⁢Z)1−2⁢ϑsp\displaystyle C(CD\sqrt{Z})^{2\vartheta_{\rm sp}}Z^{1-\vartheta_{\rm sp}}(DZ)^% {1-2\vartheta_{\rm sp}} =C⁢D⁢Z2⁢(C/Z)2⁢ϑsp\displaystyle=CDZ^{2}(C/Z)^{2\vartheta_{\rm sp}}
≤T2⁢R2⁢S5⁢(T⁢R/S)2⁢ϑsp.\displaystyle\leq T^{2}R^{2}S^{5}(TR/S)^{2\vartheta_{\rm sp}}.

The factor here is C/ZC/Z; the factor C/(S⁢Z)C/(SZ) would lose S2⁢ϑspS^{2\vartheta_{\rm sp}}. The bound C≤D⁢ZC\leq DZ is applied after passing to the envelopes. The first term is at most A0ϑsp⁢C⁢D⁢Z2A_{0}^{\vartheta_{\rm sp}}CDZ^{2} times the weighted norm. The second uses A0⁢Y⁢ZA_{0}YZ. The fourth uses D2⁢Y⁢ZD^{2}YZ. Substitute (H∗⁢S)2⁢F≪Xo⁢(1)+2⁢η⁢Q⁢T3⁢R4⁢S6/X2(H_{*}S)^{2}F\ll X^{o(1)+2\eta}QT^{3}R^{4}S^{6}/X^{2}. This proves the other lines of (3.87).

The four packing inequalities (3.7) bound the exponents in (3.87) by −15⁢σ,−(15−1/20)⁢σ,−15⁢σ,−23⁢σ-15\sigma,-(15-1/20)\sigma,-15\sigma,-23\sigma. The cutoff contributes at most 3⁢η3\eta to J∗2/VJ_{*}^{2}/V. The product in (3.14) is eventually at most X10.01X^{10.01}. This follows from A0<X1.01,T<X0.34,R,S<X0.6A_{0}<X^{1.01},T<X^{0.34},R,S<X^{0.6} and the sharper YY bound. The bounds on RR and SS use only R⁢S≤X0.6RS\leq X^{0.6}. This comes from the full-modulus support q≤X0.6q\leq X^{0.6} in (H3), since the full modulus has scale Q⁢R⁢SQRS; dyadic constants are absorbed after enlarging X0X_{0}. So the smoothness prefactor costs at most 0.19019⁢σ0.19019\sigma in the exponent.

Before the cutoff loss, the exponents relative to V1/2V^{1/2} (from the square-root row on, relative to V1/4V^{1/4}), in units of σ\sigma, are

(3.89) J∗−299/40=−7.475Theorem 2.8 prefactor+0.19019Wk≠0−7.28481Wk=0−8square root in (3.64)−3.642405Mellin integral+0.075combined fixed subpolynomial factors+0.11cutoff ⁢Xη⁢ after both roots+0.00075.\begin{array}[]{c|r}J_{*}&-299/40=-7.475\\ \text{Theorem 2.8 prefactor}&+0.19019\\ W_{k\neq 0}&-7.28481\\ W_{k=0}&-8\\ \text{square root in (3.64)}&-3.642405\\ \text{Mellin integral}&+0.075\\ \text{combined fixed subpolynomial factors}&+0.11\\ \text{cutoff }X^{\eta}\text{ after both roots}&+0.00075.\end{array}

The Mellin allowance follows from (3.57). Any fixed logarithmic power is eventually at most X0.074⁢σX^{0.074\sigma}. The remaining subpolynomial factors are the finitely many (h,f,D,C,Z)(h,f,D,C,Z) localizations, the divisor representation counts in (3.65), (3.71), the prime products (3.79), and powers of p0≪Lp_{0}\ll L. Their product is uniformly Xo⁢(1)X^{o(1)}. So it is at most X0.11⁢σX^{0.11\sigma} after choosing X0X_{0}. The multiplier from the random partition is a fixed σ\sigma-dependent constant. By (3.58), (3.64), (3.65), (3.89),

(3.90) |E2∗|≪LC⁢T2Q⁢X−3.45⁢σ,|E_{2}^{*}|\ll L^{C}\frac{T^{2}}{Q}X^{-3.45\sigma},

since −3.642405+0.075+0.11+0.00075=−3.456655<−3.45-3.642405+0.075+0.11+0.00075=-3.456655<-3.45. For S=1/2S=1/2, E2∗=0E_{2}^{*}=0 (see above). Inserting (3.90) in (3.51) gives a spectral contribution MI⁢T⁢X−1.725⁢σ⁢LC≪X1−1.725⁢σ⁢LCM_{I}TX^{-1.725\sigma}L^{C}\ll X^{1-1.725\sigma}L^{C}, since MI⁢T≪XM_{I}T\ll X. As cσ<σ/2<1.725⁢σc_{\sigma}<\sigma/2<1.725\sigma, it is absorbed in X1−cσ⁢LCX^{1-c_{\sigma}}L^{C}.

For a target A′A^{\prime}, use Awork=A′+4A_{\rm work}=A^{\prime}+4 on every shell triple, uniformly before summing. The triangle inequality over O⁢(L3)O(L^{3}) triples costs the logarithm of the outer modulus and the two logarithms of the other factors. Finally restore the factor CslotC_{\rm slot} of (3.5). It is Oσ⁢(1)O_{\sigma}(1). Equations (3.51), (3.90) prove Theorem 3.2.

3.10. Global summation, prime powers, and normalization

At fixed σ\sigma, assume (H7): the box family has the source and Heath–Brown coefficient bound

(3.91) ∑j|cj|≤Cσ,Cbox,𝒞src⁢(log⁡N)K0,K0≤24⁢Cbox+26.\sum_{j}|c_{j}|\leq C_{\sigma,C_{\rm box},\mathcal{C}_{\rm src}}(\log N)^{K_{0% }},\qquad K_{0}\leq 24C_{\rm box}+26.

Source-wide error bounds. Assume the source’s aggregate logarithm-freezing bound and the boundary bound (3.24). With the exponents clogc_{\log} and cRc_{R} of (H6), a sufficient pair of raw bounds is

Elog≪σN⁢(log⁡N)clog−Cbox,Ebdry≪σN⁢(log⁡N)cR−Cbox/2.E_{\rm log}\ll_{\sigma}N(\log N)^{c_{\log}-C_{\rm box}},\qquad E_{\rm bdry}\ll% _{\sigma}N(\log N)^{c_{R}-C_{\rm box}/2}.

They include all source labels and representation multiplicities. These bounds are separate from the interior-box hypotheses (H1)–(H5). The source-wide estimates enter through (B.29) for the prime source and through the auxiliary bound (3.95). They are not hypotheses of Theorem 3.2.

The source labels and prefix cells are Oσ⁢(1)O_{\sigma}(1). There are at most 24 HB variables. Hence there are O⁢(L24)O(L^{24}) dyadic tuples, and each dyadic tuple contains O⁢(L24⁢Cbox)O(L^{24C_{\rm box}}) short boxes. The product shells number O⁢(log⁡log⁡N)≤O⁢(L)O(\log\log N)\leq O(L). The total count is Oσ⁢(L24⁢Cbox+25)O_{\sigma}(L^{24C_{\rm box}+25}). Since the coefficients are Oσ⁢(1)O_{\sigma}(1), (3.91) holds with K0=24⁢Cbox+26K_{0}=24C_{\rm box}+26; the count exponent is smaller. The three factor localizations are inside (3.13). The count includes every partition.

Choose parameters in the following order. Fix σ\sigma and the source combinatorics. For Theorem 1.2, through (3.92) and (B.29), use the requested exponent Aagg=AA_{\rm agg}=A and choose Cbox≥⌈2⁢A+32⌉C_{\rm box}\geq\lceil 2A+32\rceil; then set A′=A+24⁢Cbox+31A^{\prime}=A+24C_{\rm box}+31 and Awork=A′+4A_{\rm work}=A^{\prime}+4. This is the parameter convention used in Theorem 1.2 and Theorem 1.1.

For the stronger source-wide bookkeeping in (3.95), which is outside Theorem 3.2, fix a separate final exponent A>0A>0 and put Aagg=A+3A_{\rm agg}=A+3. Choose the box width Cbox=Cbox⁢(Aagg)C_{\rm box}=C_{\rm box}(A_{\rm agg}) with

Cbox⁢(Aagg)≥max⁡{2⁢(Aagg+cR),Aagg+clog},C_{\rm box}(A_{\rm agg})\geq\max\{2(A_{\rm agg}+c_{R}),\ A_{\rm agg}+c_{\log}\},

so that the boundary and logarithm-freezing errors are O⁢(N⁢(log⁡N)−Aagg)O(N(\log N)^{-A_{\rm agg}}). For the Iwaniec source, cR=16c_{R}=16 by (B.19) and the logarithm-freezing exponent is clog=18c_{\log}=18 by (B.18); since Aagg+18<2⁢Aagg+32A_{\rm agg}+18<2A_{\rm agg}+32, the condition is the integer choice Cbox⁢(Aagg)≥⌈2⁢Aagg+32⌉=⌈2⁢A+38⌉C_{\rm box}(A_{\rm agg})\geq\lceil 2A_{\rm agg}+32\rceil=\lceil 2A+38\rceil. Set A′=Aagg+24⁢Cbox+31A^{\prime}=A_{\rm agg}+24C_{\rm box}+31 and Awork=A′+4A_{\rm work}=A^{\prime}+4. The value of A′A^{\prime} is K0+Aagg+5K_{0}+A_{\rm agg}+5 at the maximal count K0=24⁢Cbox+26K_{0}=24C_{\rm box}+26 in (3.91). Let c∗c_{*} dominate c1c_{1} and every preliminary logarithmic loss denoted by cc. This includes the fixed loss in (3.41) and the endpoint losses before BFI. It is chosen before AE,CΣ,CMA_{E},C_{\Sigma},C_{M}. Use the same c∗c_{*} for every source and every application below. Choose

AE\displaystyle A_{E} ≥2⁢Awork+2⁢Cbox+c∗,\displaystyle\geq 2A_{\rm work}+2C_{\rm box}+c_{*},
CΣ\displaystyle C_{\Sigma} =AE+2⁢c∗+3,\displaystyle=A_{E}+2c_{*}+3,
CM\displaystyle C_{M} =5⁢CΣ+AE+Cbox+c∗+3.\displaystyle=5C_{\Sigma}+A_{E}+C_{\rm box}+c_{*}+3.

Then choose A3A_{3} and the required BFI/SW exponents. Later power-saving logarithmic losses may depend on CΣ,CMC_{\Sigma},C_{M}. The constant c∗c_{*} is defined before them. Choose N0N_{0} last. It is ineffective, as are the implied constants, because the Siegel–Walfisz theorem is ineffective.

The source may choose a larger width. Its fixed width is selected before the analytic precisions, with the same displayed formulas.

By (3.13), (H7) in the form (3.91), and N/(log⁡N)Kscale≤X≤NN/(\log N)^{K_{\rm scale}}\leq X\leq N,

(3.92) EII:=∑j|cj|⁢|SjPSDT|\displaystyle E_{\rm II}:=\sum_{j}|c_{j}||S_{j}^{\rm PSDT}| ≪N⁢(log⁡N)K0−A′+N1−cσ⁢(log⁡N)K0+C\displaystyle\ll N(\log N)^{K_{0}-A^{\prime}}+N^{1-c_{\sigma}}(\log N)^{K_{0}+C}
≪σ,A,Cbox,Kscale,𝒞srcN⁢(log⁡N)−A.\displaystyle\ll_{\sigma,A,C_{\rm box},K_{\rm scale},\mathcal{C}_{\rm src}}N(% \log N)^{-A}.

Every positive fixed power saving beats every fixed logarithm once N0N_{0} is chosen. The spectral term X1−1.725⁢σ⁢LCX^{1-1.725\sigma}L^{C} is already absorbed in (3.13), since cσ<σ/2c_{\sigma}<\sigma/2.

Source prime powers. For the direct source the correction in (3.22) has O⁢(N1/2⁢(log⁡N)C)O(N^{1/2}(\log N)^{C}) integers before discrepancy weights. For the product source assume at most four tested coordinates, each at least NαN^{\alpha}, α=100/1149\alpha=100/1149, and product e<Ne<N. A proper power coordinate has reciprocal mass

(3.93) ∑Nα≤pk≤N,k≥2p−k≪N−α/2+(log⁡N)⁢N−2⁢α/3≪N−α/2.\sum_{N^{\alpha}\leq p^{k}\leq N,\ k\geq 2}p^{-k}\ll N^{-\alpha/2}+(\log N)N^{% -2\alpha/3}\ll N^{-\alpha/2}.

For k=2k=2 compare with the tail of ∑n−2\sum n^{-2}. For k≥3k\geq 3 sum the integer kk-power tail. There are O⁢(log⁡N)O(\log N) possible exponents. Fix one coordinate at tt. For 1≤r≤41\leq r\leq 4, the remaining positive coordinates have at most (N/t)⁢(1+log⁡N)max⁡(r−2,0)(N/t)(1+\log N)^{\max(r-2,0)} possibilities. For r=1r=1 no coordinate remains, and the single admissible completion is bounded by N/tN/t. For r=2r=2 the remaining coordinate is counted directly. For r≥3r\geq 3 the reciprocal-sum argument gives the displayed logarithmic power. Take a union bound over the at most four possible power coordinates. For the product discrepancy write ee for the tested product. Theorem 1.2 supplies N≤a≤N⁢log⁡N/3N\leq a\leq N\log N/3. On the product support, e<N≤a≪N⁢log⁡Ne<N\leq a\ll N\log N, so 1≤|a−e|≪N⁢log⁡N1\leq|a-e|\ll N\log N. Use (3.23) and τ⁢(|a−e|)≪ϵNϵ\tau(|a-e|)\ll_{\epsilon}N^{\epsilon} with ϵ=α/4\epsilon=\alpha/4. Then the whole source-level correction obeys

(3.94) ER⁢0≪N1−α/4⁢(log⁡N)C=N1−25/1149⁢(log⁡N)C≪AN⁢(log⁡N)−A.E_{R0}\ll N^{1-\alpha/4}(\log N)^{C}=N^{1-25/1149}(\log N)^{C}\ll_{A}N(\log N)% ^{-A}.

This bound precedes the Heath–Brown subdivision, so its box multiplicity is 1. For a product, the bound uses the coordinate floor NαN^{\alpha} assumed immediately before (3.93). Thus (3.94) applies to every such product source.

The bounds (H6), the logarithm-freezing estimate, (3.92) (which uses (H7)), and (3.94), with the fixed choices above, give

(3.95) EII+Ebdry+Elog+ER⁢0≪σ,A,Cbox,Kscale,𝒞srcN⁢(log⁡N)−A−3=o⁢(UC),\displaystyle E_{\rm II}+E_{\rm bdry}+E_{\rm log}+E_{R0}\ll_{\sigma,A,C_{\rm box% },K_{\rm scale},\mathcal{C}_{\rm src}}N(\log N)^{-A-3}=o(U_{C}),
UC=C⁢(N)⁢N/(log⁡N)2,C⁢(N)≥c>0.\displaystyle U_{C}=C(N)N/(\log N)^{2},\quad C(N)\geq c>0.

The ratio is Oσ,A,Cbox,Kscale,𝒞src⁢((log⁡N)−A−1)O_{\sigma,A,C_{\rm box},K_{\rm scale},\mathcal{C}_{\rm src}}((\log N)^{-A-1}).

For each source family, its exact source identities give the finite sum to which these bounds apply. The restoration, BFI, partition, Poisson and Theorem 2.8 errors enter once, inside EIIE_{\rm II}.

For any normalization Wnorm≫N/(log⁡N)2W_{\rm norm}\gg N/(\log N)^{2}, (3.92) reads explicitly

(3.96) ∑j|cj|⁢|SjPSDT|Wnorm\displaystyle\frac{\sum_{j}|c_{j}||S_{j}^{\rm PSDT}|}{W_{\rm norm}} ≪(log⁡N)K0+2−A′\displaystyle\ll(\log N)^{K_{0}+2-A^{\prime}}
+N−cσ⁢(log⁡N)K0+C+2=o⁢(1).\displaystyle\quad+N^{-c_{\sigma}}(\log N)^{K_{0}+C+2}=o(1).

Consider the original direct prime source, before HB. Its mass is not yet replaced by a logarithmic-integral (Li) mass. Its exact prime mass XA=∑pAD⁢(p)X_{A}=\sum_{p}A_{D}(p) satisfies

(3.97) ∑(p,q)=1AD⁢(p)=XA\sum_{(p,q)=1}A_{D}(p)=X_{A}

because p>N/(log⁡N)B>qp>N/(\log N)^{B}>q for q<NeQq<N^{e_{Q}} and sufficiently large NN. Thus the formal and natural comparators coincide on that original source. This holds for the source itself, before the split into signed HB terms. If a Li mass XLiX_{\rm Li} is substituted, the exact difference is (XA−XLi)/φ⁢(q)(X_{A}-X_{\rm Li})/\varphi(q). Its weighted sum enters once, in the main-term mass contribution, outside the natural-comparator correction. For the composite product source, (3.97) may fail.

3.11. The complete non-II cover

These results are separate from Theorem 3.2. The source-to-box identity comes from the source itself. For a direct shell [X,2⁢X)[X,2X), assume the following source conditions (SH1)–(SH5).

  • (SH1)

    The coefficient γ⁢(q)\gamma(q) is independent of tested variables, (q,2⁢N)=1(q,2N)=1, |γ⁢(q)|≤Cσ|\gamma(q)|\leq C_{\sigma}, q≤NeQq\leq N^{e_{Q}}, eQ<153/256e_{Q}<153/256, and (a,q)=1(a,q)=1 on its support.

  • (SH2)

    All tested restrictions are constant on each nonboundary box. Smooth factor weights have sup|w|+V⁢(w)≪1\sup|w|+V(w)\ll 1.

  • (SH3)

    All HB factors are rough at the threshold z∗=z0⁢(X)z^{*}=z_{0}(X) or z0⁢(N)z_{0}(N).

  • (SH4)

    The discrepancy is exactly (3.3).

  • (SH5)

    The assignment priority is proper prime powers, boundary boxes, Type II, Type I-1, then Type I-2.

Put ω=log⁡(N/X)/log⁡N\omega=\log(N/X)/\log N and κ=30⁢log⁡2/log⁡N\kappa=30\log 2/\log N. Increase N0N_{0} until ω,κ≤σ/202\omega,\kappa\leq\sigma/202. Let ViV_{i} be the lower HB scales, and ei=log⁡Vi/log⁡Ne_{i}=\log V_{i}/\log N. Then (3.21) implies

(3.98) 1−ω−κ<∑iei<1+κ,ei≤1/3+κon Möbius variables.1-\omega-\kappa<\sum_{i}e_{i}<1+\kappa,\qquad e_{i}\leq 1/3+\kappa\quad\text{% on Möbius variables}.

There are at most six variables. Call a variable small below 60⁢σ60\sigma, and large above 1/3+14⁢σ1/3+14\sigma. Suppose no variable is in the II window. Since 360⁢σ<1−ω−κ360\sigma<1-\omega-\kappa, some variable is large. Since 1+42⁢σ>1+κ1+42\sigma>1+\kappa, at most two are large. Möbius variables are never large. Thus there are exactly one or two large smooth variables. For a window variable,

(3.99) logX⁡(2⁢V)≤(1/3+14⁢σ+κ)/(1−ω)≤1/3+15⁢σ,\log_{X}(2V)\leq(1/3+14\sigma+\kappa)/(1-\omega)\leq 1/3+15\sigma,

which proves the shell-local window transfer. For one large variable,

(3.100) e∗−eQ−(1−ω)/10≥0.9−153/256−0.9⁢ω−κ−300⁢σ>0.3023;e_{*}-e_{Q}-(1-\omega)/10\geq 0.9-153/256-0.9\omega-\kappa-300\sigma>0.3023;

hence its scale V≥q⁢X1/10V\geq qX^{1/10}. With two large variables, N1≥N2≥X1/3N_{1}\geq N_{2}\geq X^{1/3}. The at most four other factors are small. Their product mm is split dyadically, m≍Mm\asymp M, with

(3.101) M≤X2.401⋅10−8,N1⁢N2⁢M≤230⁢X,q<X0.5977.M\leq X^{2.401\cdot 10^{-8}},\qquad N_{1}N_{2}M\leq 2^{30}X,\qquad q<X^{0.5977}.

These follow from (240⁢σ+κ)/(1−ω)<2.401⋅10−8(240\sigma+\kappa)/(1-\omega)<2.401\cdot 10^{-8}, which uses σ≤10−10\sigma\leq 10^{-10}, and eQ/(1−ω)<0.5977e_{Q}/(1-\omega)<0.5977. Consider a product source with three or four coordinates at least N100/1149N^{100/1149}. Its smallest coordinate has exponent between 100/1149100/1149 and (1+κ)/3(1+\kappa)/3. It has at most six HB factors. One of them has exponent exceeding (100/1149−κ)/6>60⁢σ(100/1149-\kappa)/6>60\sigma. Each is below 1/3+14⁢σ1/3+14\sigma. Thus, after proper prime powers and boundary boxes are removed, all its boxes are of type II.

Elementary sieve sandwich. For a finite prime set 𝒫\mathcal{P} below zz, let P=∏p∈𝒫pP=\prod_{p\in\mathcal{P}}p, E=∑p∈𝒫1/pE=\sum_{p\in\mathcal{P}}1/p, and

(3.102) λd(J)=μ⁢(d)⁢1d∣P,ω⁢(d)≤J.\lambda_{d}^{(J)}=\mu(d)1_{d\mid P,\ \omega(d)\leq J}.

Let r=ω⁢((n,P))r=\omega((n,P)). For r≥1r\geq 1, Pascal’s identity gives ∑j≤J(−1)j⁢(rj)=(−1)J⁢(r−1J)\sum_{j\leq J}(-1)^{j}\binom{r}{j}=(-1)^{J}\binom{r-1}{J}. The sum is 1 for r=0r=0. Hence

(3.103) Ψ−⁢(n):=∑d∣nλd(2⁢k−1)≤1(n,P)=1≤Ψ+⁢(n):=∑d∣nλd(2⁢k),Ψ+≥0,Ψ+−Ψ−=(r2⁢k)≥0.\begin{gathered}\Psi^{-}(n):=\sum_{d\mid n}\lambda_{d}^{(2k-1)}\leq 1_{(n,P)=1% }\leq\Psi^{+}(n):=\sum_{d\mid n}\lambda_{d}^{(2k)},\\ \Psi^{+}\geq 0,\qquad\Psi^{+}-\Psi^{-}=\binom{r}{2k}\geq 0.\end{gathered}

The weights are 1-bounded and supported on d≤z2⁢kd\leq z^{2k}. Also ∑d∣P,ω⁢(d)=j1/d≤Ej/j!\sum_{d\mid P,\omega(d)=j}1/d\leq E^{j}/j!. Let s=log⁡D/log⁡z≫(log⁡log⁡X)3s=\log D/\log z\gg(\log\log X)^{3}, and choose 2⁢k=2⁢⌊s/2⌋2k=2\lfloor s/2\rfloor. Mertens’ bound E≤log⁡log⁡z+O⁢(1)E\leq\log\log z+O(1), with s≫(log⁡log⁡X)3s\gg(\log\log X)^{3}, gives 2⁢k≥s−2≥e2⁢E2k\geq s-2\geq e^{2}E for large XX. With Stirling,

(3.104) E2⁢k/(2⁢k)!≤(e⁢E/(2⁢k))2⁢k≤e2−s≪AL−A.E^{2k}/(2k)!\leq(eE/(2k))^{2k}\leq e^{2-s}\ll_{A}L^{-A}.

It is the sieve approximation used in I-1 and I-2.

Lemma 3.3 (Type I, one large variable (I-1)).

Assume (SH1)–(SH5). Consider a box with one large variable. Let the complementary coefficient satisfy |αm|≪τ⁢(m)B0|\alpha_{m}|\ll\tau(m)^{B_{0}}. Uniformly for every integer residue aa coprime to each supported qq,

(3.105) ∑q|γ⁢(q)|⁢|∑mαm⁢∑v∈I,P−⁢(v)≥z∗w⁢(v)⁢𝒮m⁢v⁢(q;a)|≪σ,A,B0X⁢L−A.\sum_{q}|\gamma(q)|\left|\sum_{m}\alpha_{m}\sum_{v\in I,\ P^{-}(v)\geq z^{*}}w% (v)\mathcal{S}_{mv}(q;a)\right|\ll_{\sigma,A,B_{0}}XL^{-A}.
Proof.

If (m,q)>1(m,q)>1, the summand vanishes. Otherwise put b=a⁢m¯⁢(q)b=a\bar{m}(q). The progression and the reduced comparator contain only integers prime to qq. Apply (3.102)–(3.104) to the qq-dependent set 𝒫q={p<z∗:p∤q}\mathcal{P}_{q}=\{p<z^{*}:p\nmid q\}, with D=X1/20D=X^{1/20}. For every d∣Pqd\mid P_{q}, (d,q)=1(d,q)=1, and

#⁢{v≤t:v≡b⁢(q),d∣v}=t/(d⁢q)+O⁢(1),\#\{v\leq t:v\equiv b(q),d\mid v\}=t/(dq)+O(1),
(3.106) #⁢{v≤t:(v,q)=1,d∣v}=(φ⁢(q)/q)⁢(t/d)+O⁢(τ⁢(q)).\#\{v\leq t:(v,q)=1,d\mid v\}=(\varphi(q)/q)(t/d)+O(\tau(q)).

After comparator normalization, the upper and lower sandwiches have the same main term. Their gap gives discrepancy ≪(t/q)⁢e2−s+2⁢D⁢τ⁢(q)\ll(t/q)e^{2-s}+2D\tau(q), where s≥(log⁡log⁡X)3/40s\geq(\log\log X)^{3}/40. Endpoint subtraction and partial summation cost O⁢(sup|w|+V⁢(w))O(\sup|w|+V(w)). By (3.100), D⁢τ⁢(q)≪(V/q)⁢X−1/20+o⁢(1)D\tau(q)\ll(V/q)X^{-1/20+o(1)}. Thus the inner discrepancy is OA⁢(V/(q⁢LA))O_{A}(V/(qL^{A})). Sum with ∑m|αm|≪M⁢LC\sum_{m}|\alpha_{m}|\ll ML^{C}, M⁢V≍XMV\asymp X, and ∑q1/q≪L\sum_{q}1/q\ll L. Then request a larger AA. This proves (3.105). The sieve weights use the prime set 𝒫q\mathcal{P}_{q}. ∎

Lemma 3.4 (Completed hyperbola).

Let cmodqc\bmod q be a unit. For integer intervals J1,J2J_{1},J_{2}, put

(3.107) 𝒟=#⁢{(u,v)∈J1×J2:u⁢v≡c⁢(q)}−#⁢J1∗⁢#⁢J2∗φ⁢(q).\mathcal{D}=\#\{(u,v)\in J_{1}\times J_{2}:uv\equiv c(q)\}-\frac{\#J_{1}^{*}\#% J_{2}^{*}}{\varphi(q)}.

The full-modulus Kloosterman-sum bound [17, Corollary 11.12],

(3.108) |S⁢(h,k;q)|≤τ⁢(q)⁢q1/2⁢(h,k,q)1/2,|S(h,k;q)|\leq\tau(q)q^{1/2}(h,k,q)^{1/2},

implies, uniformly in interval lengths and positions,

(3.109) |𝒟|≪τ⁢(q)⁢q1/2⁢log2⁡(2⁢q)+τ⁢(q)2⁢log2⁡(2⁢q)/φ⁢(q).|\mathcal{D}|\ll\tau(q)q^{1/2}\log^{2}(2q)+\tau(q)^{2}\log^{2}(2q)/\varphi(q).
Proof.

Put

Fi⁢(h)=∑u∈Jie⁢(h⁢u/q).F_{i}(h)=\sum_{u\in J_{i}}e(hu/q).

Additive completion then gives

𝒟=q−2⁢∑h,kF1⁢(−h)⁢F2⁢(−k)⁢(S⁢(h,k⁢c;q)−cq⁢(h)⁢cq⁢(k)φ⁢(q)).\mathcal{D}=q^{-2}\sum_{h,k}F_{1}(-h)F_{2}(-k)\left(S(h,kc;q)-\frac{c_{q}(h)c_% {q}(k)}{\varphi(q)}\right).

The bracket vanishes if h=0h=0 or k=0k=0, so complete periods cancel. For 0<h<q0<h<q, |Fi⁢(h)|≤q/(2⁢min⁡(h,q−h))|F_{i}(h)|\leq q/(2\min(h,q-h)), and

(3.110) ∑0<h⁢<q,d∣⁢h|Fi⁢(h)|≪(q/d)⁢log⁡(2⁢q).\sum_{0<h<q,d\mid h}|F_{i}(h)|\ll(q/d)\log(2q).

Use (h,k,q)1/2≤∑d∣(h,k,q)d1/2(h,k,q)^{1/2}\leq\sum_{d\mid(h,k,q)}d^{1/2} in (3.108) and sum ∑d−3/2\sum d^{-3/2}. For the principal part use |cq⁢(h)|≤(h,q)=∑d∣(h,q)φ⁢(d)|c_{q}(h)|\leq(h,q)=\sum_{d\mid(h,q)}\varphi(d), so its one-variable weighted sum is O⁢(q⁢τ⁢(q)⁢log⁡(2⁢q))O(q\tau(q)\log(2q)). This proves (3.109). Modulo 1 the discrepancy is zero. ∎

Lemma 3.5 (Type I, two large variables (I-2)).

Assume (SH1)–(SH5) and (3.101). Consider two large smooth variables with nonnegative weights w1,w2w_{1},w_{2}. Let |αm|≪τ⁢(m)B0|\alpha_{m}|\ll\tau(m)^{B_{0}}. Uniformly for every integer residue aa coprime to each supported qq,

(3.111) ∑q≍Q|γ⁢(q)|⁢|∑mαm⁢∑ni∈Ii,P−⁢(ni)≥z∗w1⁢(n1)⁢w2⁢(n2)⁢𝒮m⁢n1⁢n2⁢(q;a)|\displaystyle\sum_{q\asymp Q}|\gamma(q)|\Bigl{|}\sum_{m}\alpha_{m}\sum_{n_{i}% \in I_{i},\ P^{-}(n_{i})\geq z^{*}}w_{1}(n_{1})w_{2}(n_{2})\mathcal{S}_{mn_{1}% n_{2}}(q;a)\Bigr{|}
≪AX⁢L−A.\displaystyle\qquad\ll_{A}XL^{-A}.

The smooth factor weights in the prime-source application of Appendix B are nonnegative. For a general real weight, write w=(w+c)−cw=(w+c)-c, with c=sup|w|c=\sup|w|, and apply the lemma to the nonnegative pieces.

Proof of Lemma 3.5.

Again restrict to (m,q)=1(m,q)=1. Let C⁢(F⁢G)C(FG) and Mq⁢(F⁢G)M_{q}(FG) be the positive congruence and comparator functionals with the positive weights w1,w2w_{1},w_{2}. Put Δ=C−Mq\Delta=C-M_{q}. Apply (3.103) to all primes below z∗z^{*}, with Df=XϵI/2D_{f}=X^{\epsilon_{I}/2}, ϵI=δ/4=7.5⁢σ\epsilon_{I}=\delta/4=7.5\sigma. Include the Brun–Bonferroni threshold for this smaller level in N0N_{0}. For every fixed logarithmic exponent AsvA_{\rm sv}, put

sf=log⁡Dflog⁡z∗,E=∑p<z∗1p,J=2⁢⌊sf/2⌋,s_{f}=\frac{\log D_{f}}{\log z^{*}},\qquad E=\sum_{p<z^{*}}\frac{1}{p},\qquad J% =2\lfloor s_{f}/2\rfloor,

and require J≥max⁡{2,e2⁢E,Asv⁢log⁡L}J\geq\max\{2,e^{2}E,A_{\rm sv}\log L\}. At fixed σ>0\sigma>0 this holds eventually, since sf≍σ⁢(log⁡log⁡N)3s_{f}\asymp\sigma(\log\log N)^{3} and E=O⁢(log⁡log⁡N)E=O(\log\log N). Hence (z∗)J≤Df(z^{*})^{J}\leq D_{f}, J−1≥1J-1\geq 1, and

EJJ!≤(e⁢EJ)J≤L−Asv.\frac{E^{J}}{J!}\leq\left(\frac{eE}{J}\right)^{J}\leq L^{-A_{\rm sv}}.

Choose AsvA_{\rm sv} after the fixed logarithmic losses in (3.115). So the same final choice of N0N_{0} covers the use of (3.103)–(3.104) in I-2. Write Ri=1P−⁢(ni)≥z∗R_{i}=1_{P^{-}(n_{i})\geq z^{*}}, Gi=Ψi+−Ψi−≥0G_{i}=\Psi_{i}^{+}-\Psi_{i}^{-}\geq 0. Since 0≤Ri≤Ψi+0\leq R_{i}\leq\Psi_{i}^{+},

(3.112) Ψ1+⁢Ψ2+−G1⁢Ψ2+−Ψ1+⁢G2≤R1⁢R2≤Ψ1+⁢Ψ2+.\Psi_{1}^{+}\Psi_{2}^{+}-G_{1}\Psi_{2}^{+}-\Psi_{1}^{+}G_{2}\leq R_{1}R_{2}% \leq\Psi_{1}^{+}\Psi_{2}^{+}.

Since C,MqC,M_{q} are positive,

(3.113) |Δ⁢(R1⁢R2)|≤\displaystyle|\Delta(R_{1}R_{2})|\leq{} |Δ⁢(Ψ1+⁢Ψ2+)|+|Δ⁢(G1⁢Ψ2+)|+|Δ⁢(Ψ1+⁢G2)|\displaystyle|\Delta(\Psi_{1}^{+}\Psi_{2}^{+})|+|\Delta(G_{1}\Psi_{2}^{+})|+|% \Delta(\Psi_{1}^{+}G_{2})|
+Mq⁢(G1⁢Ψ2+)+Mq⁢(Ψ1+⁢G2).\displaystyle+M_{q}(G_{1}\Psi_{2}^{+})+M_{q}(\Psi_{1}^{+}G_{2}).

The lower weights Ψi−\Psi_{i}^{-} may be negative. The bound (3.113) contains only the nonnegative Ψi+,Gi\Psi_{i}^{+},G_{i}. Expand the first three terms over di≤Dfd_{i}\leq D_{f}. Their coefficients are bounded by 1. Terms with (m⁢d1⁢d2,q)>1(md_{1}d_{2},q)>1 vanish. Otherwise put c≡a⁢m⁢d1⁢d2¯(modq)c\equiv a\overline{md_{1}d_{2}}\pmod{q}. This is a unit, and ui=ni/diu_{i}=n_{i}/d_{i} lies on the modular hyperbola u1⁢u2≡c(modq)u_{1}u_{2}\equiv c\pmod{q}. Two-variable partial summation and (3.109) give a total ≪ϵDf2⁢q1/2⁢Xϵ\ll_{\epsilon}D_{f}^{2}q^{1/2}X^{\epsilon}.

For the two main gaps, positivity lets us drop the restriction (n1⁢n2,q)=1(n_{1}n_{2},q)=1. Full-integer progression counts and (3.104) give

(3.114) ∑n∈IiGi⁢(n)⁢wi⁢(n)≪AsvNi⁢L−Asv+Df,∑n∈IiΨi+⁢(n)⁢wi⁢(n)≪Ni+Df.\sum_{n\in I_{i}}G_{i}(n)w_{i}(n)\ll_{A_{\rm sv}}N_{i}L^{-A_{\rm sv}}+D_{f},% \quad\sum_{n\in I_{i}}\Psi_{i}^{+}(n)w_{i}(n)\ll N_{i}+D_{f}.

The progression counts range over all integers. Summing over (m,q)(m,q) now gives

(3.115) ≪M⁢Df2⁢Q3/2⁢Xϵ⁢LC+X⁢LC−Asv+M⁢Df⁢(N1+N2)⁢LC+M⁢Df2⁢LC.\ll MD_{f}^{2}Q^{3/2}X^{\epsilon}L^{C}+XL^{C-A_{\rm sv}}+MD_{f}(N_{1}+N_{2})L^% {C}+MD_{f}^{2}L^{C}.

By (3.101), the first exponent is less than 2.401⋅10−8+7.5⋅10−10+1.5⁢(0.5977)+ϵ<0.8972.401\cdot 10^{-8}+7.5\cdot 10^{-10}+1.5(0.5977)+\epsilon<0.897 for a sufficiently small fixed ϵ>0\epsilon>0. Also M⁢(N1+N2)≤231⁢X/N2≪X2/3M(N_{1}+N_{2})\leq 2^{31}X/N_{2}\ll X^{2/3}. So the exponents of the last gap terms are less than 0.668. Choose AsvA_{\rm sv} after the fixed log losses. This proves (3.111). Squareful moduli are covered by (3.108). ∎

Finally there are Oσ⁢(LK)O_{\sigma}(L^{K}) non-II direct boxes and shell pieces for a fixed KK. Request (3.105), (3.111) with exponents larger than K+A+5K+A+5. Their sum is then O⁢(N⁢L−A)O(NL^{-A}); in particular, divided by N/(log⁡N)2N/(\log N)^{2} it tends to zero. For the prime source these are the exponents Ai=KI+A+5A_{i}=K_{I}+A+5 of Appendix B. The I-1 and I-2 boxes are disjoint parts of the non-II contribution. Under its coordinate hypotheses, the product source has none. Their contributions lie outside EIIE_{\rm II}.

For the prime source, Section 4 supplies the packing construction and Proposition B.4 in Appendix B gives the prime-source estimate.

4. Three-slot packing for Iwaniec’s remainder coefficients

This section proves a general packing theorem. It then verifies the hypotheses for the remainder coefficients of Iwaniec’s linear sieve [10, Theorem 4]. The packing and coefficient identities provide the modulus factorization used in the prime-discrepancy estimates below. The functions below specialize Lichtman’s optimization [1, Proposition 6.1, (6.2), (6.4)] to spectral exponent 7/327/32 and moving-residue exponent 11. We prove the labelled-atom statement here; its two-bin step is related to the corrected argument in Pascadi’s Lemma 5.6 [8].

4.1. A combinatorial packing theorem

Put

H¯=153256,μ=25128,ϑ=732.\overline{H}=\frac{153}{256},\qquad\mu=\frac{25}{128},\qquad\vartheta=\frac{7}% {32}.

Here ϑ\vartheta is the fixed spectral exponent 2⁢θRP2\theta_{\rm RP}. Later in this section θ\theta denotes the sieve level. For x≥0x\geq 0, define

v⁢(x)=min⁡{1+x2,32−34⁢x39,5764−32⁢x}.v(x)=\min\left\{\frac{1+x}{2},\frac{32-34x}{39},\frac{57}{64}-\frac{3}{2}x% \right\}.

For real xx and y≥0y\geq 0, put ψ⁢(x,y)=x⁢𝟏x≥y\psi(x,y)=x\mathbf{1}_{x\geq y}. Also put

w⁢(a,b,c)=ψ⁢(min⁡{132−68⁢c214,153−96⁢c256,1−2⁢b},1+a2).w(a,b,c)=\psi\left(\min\left\{\frac{132-68c}{214},\frac{153-96c}{256},1-2b% \right\},\frac{1+a}{2}\right).

For an ordered triple a≥b≥c≥0a\geq b\geq c\geq 0, set

H(a,b,c)=max{v⁢(a),v⁢(b),v⁢(a+b),v⁢(a+b+c),w⁢(a,b,c),w⁢(a,c,b),ψ(v(a+c),a+2b+c),ψ(v(b+c),2a+b+c)},\begin{split}H(a,b,c)=\max\{&v(a),v(b),v(a+b),v(a+b+c),w(a,b,c),w(a,c,b),\\ &\psi(v(a+c),a+2b+c),\psi(v(b+c),2a+b+c)\},\end{split}

Define H~⁢(a,b,c)=H⁢(a,b,c)\widetilde{H}(a,b,c)=H(a,b,c) if a≤μa\leq\mu. If a>μa>\mu, put H~⁢(a,b,c)=v⁢(a)\widetilde{H}(a,b,c)=v(a). For a finite non-increasing list e1≥⋯≥em≥0e_{1}\geq\cdots\geq e_{m}\geq 0, let e¯i=ei\bar{e}_{i}=e_{i} for i≤mi\leq m and e¯i=0\bar{e}_{i}=0 for i>mi>m. Repeated values are distinct labelled atoms. The empty list is allowed.

A list f1≥⋯≥fm≥0f_{1}\geq\cdots\geq f_{m}\geq 0 satisfies WF⁢(y)\mathrm{WF}(y) if

(4.1) f1+⋯+fj−1+2⁢fj≤y(1≤j≤m).f_{1}+\cdots+f_{j-1}+2f_{j}\leq y\qquad(1\leq j\leq m).

Write

b−=2⁢h−1,bA=32−39⁢h34,bB=2−ϑ−2⁢h3,b+=min⁡(bA,bB).b_{-}=2h-1,\qquad b_{A}=\frac{32-39h}{34},\qquad b_{B}=\frac{2-\vartheta-2h}{3% },\qquad b_{+}=\min(b_{A},b_{B}).

Theorem 4.1 (three-slot packing). Let 0<δ≤3⋅10−90<\delta\leq 3\cdot 10^{-9}, 1/2≤h≤H¯1/2\leq h\leq\overline{H}, d∗=h−2⁢δd_{*}=h-2\delta, and δ≤g≤1/3−δ/2\delta\leq g\leq 1/3-\delta/2. Suppose the labelled list e1≥⋯≥em≥0e_{1}\geq\cdots\geq e_{m}\geq 0 satisfies

(4.2) WF⁢(d∗)andh≤H~⁢(e¯1,e¯2,e¯3).\mathrm{WF}(d_{*})\quad\hbox{and}\quad h\leq\widetilde{H}(\bar{e}_{1},\bar{e}_% {2},\bar{e}_{3}).

Then the deterministic rule ℛ\mathcal{R} below partitions the labels into J1⊔J2⊔J3J_{1}\sqcup J_{2}\sqcup J_{3}. If Σs=∑i∈Jsei\Sigma_{s}=\sum_{i\in J_{s}}e_{i}, then

(4.3) Σ1\displaystyle\Sigma_{1} ≤g,\displaystyle\leq g,
2⁢g+Σ2+2⁢Σ3\displaystyle 2g+\Sigma_{2}+2\Sigma_{3} ≤1−4⁢δ,\displaystyle\leq 1-4\delta,
ϑ+g+Σ1+5⁢Σ2+2⁢Σ3\displaystyle\vartheta+g+\Sigma_{1}+5\Sigma_{2}+2\Sigma_{3} ≤2−4⁢δ,\displaystyle\leq 2-4\delta,
(1+2⁢ϑ)⁢g+Σ1+(5−2⁢ϑ)⁢Σ2+(2+2⁢ϑ)⁢Σ3\displaystyle(1+2\vartheta)g+\Sigma_{1}+(5-2\vartheta)\Sigma_{2}+(2+2\vartheta% )\Sigma_{3} ≤2−4⁢(1+ϑ)⁢δ.\displaystyle\leq 2-4(1+\vartheta)\delta.

The output depends only on the labelled list and on h,δ,gh,\delta,g.

Lemma 4.2. For x≥0x\geq 0, v⁢(x)=min⁡{(1+x)/2,57/64−3⁢x/2}v(x)=\min\{(1+x)/2,57/64-3x/2\}. Thus vv is concave, v≤H¯v\leq\overline{H}, and H~≤H¯\widetilde{H}\leq\overline{H}.

Proof. Consider the middle affine function in the definition of vv. Its difference with (1+x)/2(1+x)/2 is (25−107⁢x)/78(25-107x)/78, which is nonnegative for x≤25/107x\leq 25/107. Its difference with 57/64−3⁢x/257/64-3x/2 is (1568⁢x−175)/2496(1568x-175)/2496, nonnegative for x≥175/1568x\geq 175/1568. As 175/1568<25/107175/1568<25/107, it is never the strict minimum of all three. The minimum of the remaining two affine functions is concave and has maximum (1+μ)/2=H¯(1+\mu)/2=\overline{H}. Each ww is zero or at most (153−96⁢c)/256≤H¯(153-96c)/256\leq\overline{H}. Every ψ\psi branch is zero or a value of vv. This proves both upper bounds. □\square

Lemma 4.3. For 1/2≤h≤H¯1/2\leq h\leq\overline{H} and 0<δ≤3⋅10−90<\delta\leq 3\cdot 10^{-9}:

  1. (1)

    h≤v⁢(b)h\leq v(b) for b≥0b\geq 0 exactly when b−≤b≤b+b_{-}\leq b\leq b_{+}.

  2. (2)

    b+=bBb_{+}=b_{B}, and bA>bBb_{A}>b_{B}.

  3. (3)

    b+−b−=(153−256⁢h)/96≥0b_{+}-b_{-}=(153-256h)/96\geq 0 and b+−μ=(153/128−2⁢h)/3≥0b_{+}-\mu=(153/128-2h)/3\geq 0.

  4. (4)

    d∗−b+−2⁢b−≥3/256−2⁢δ>0d_{*}-b_{+}-2b_{-}\geq 3/256-2\delta>0 and d∗−3⁢b−≥3/256−2⁢δ>0d_{*}-3b_{-}\geq 3/256-2\delta>0.

  5. (5)

    ϑ+2⁢(d∗+2⁢δ)+3⁢bB=2\vartheta+2(d_{*}+2\delta)+3b_{B}=2 and (2+2⁢ϑ)⁢(d∗+2⁢δ)+(3−4⁢ϑ)⁢bA=2(2+2\vartheta)(d_{*}+2\delta)+(3-4\vartheta)b_{A}=2.

Proof. The three affine branches of vv give b≥2⁢h−1b\geq 2h-1, b≤bAb\leq b_{A}, and b≤bBb\leq b_{B}. These are closed inequalities. The difference bA−bB=(567/16−49⁢h)/102b_{A}-b_{B}=(567/16-49h)/102 decreases with hh and at h=H¯h=\overline{H} is 525/8704>0525/8704>0, proving (2). The formulas in (3) and the first bound in (4) follow by expansion. Their minima occur at h=H¯h=\overline{H}. For the second bound in (4), use d∗−b−=1−h−2⁢δd_{*}-b_{-}=1-h-2\delta and 3−5⁢H¯=3/2563-5\overline{H}=3/256. For (5), use 2+2⁢ϑ=39/162+2\vartheta=39/16, 3−4⁢ϑ=17/83-4\vartheta=17/8, and (3−4⁢ϑ)⁢bA=2−39⁢h/16(3-4\vartheta)b_{A}=2-39h/16. Finally 3/256>6⋅10−9≥2⁢δ3/256>6\cdot 10^{-9}\geq 2\delta. □\square

Lemma 4.4. If h>0h>0 and w⁢(x,y,z)≥hw(x,y,z)\geq h, then z≤b+−b−z\leq b_{+}-b_{-}.

Proof. Since h>0h>0, the activation in ψ\psi is on. Hence (132−68⁢z)/214≥h(132-68z)/214\geq h and (153−96⁢z)/256≥h(153-96z)/256\geq h. These give z≤bA−b−z\leq b_{A}-b_{-} and z≤bB−b−z\leq b_{B}-b_{-}, respectively. □\square

Lemma 4.5 (two bins). Let c1,c3≥0c_{1},c_{3}\geq 0 and initial loads u0≤c1u_{0}\leq c_{1}, w0≤c3w_{0}\leq c_{3}. Suppose a finite list f1,…,fk≥0f_{1},\ldots,f_{k}\geq 0 satisfies

(4.4) u0+w0+∑i<jfi+2⁢fj≤c1+c3(1≤j≤k).u_{0}+w_{0}+\sum_{i<j}f_{i}+2f_{j}\leq c_{1}+c_{3}\qquad(1\leq j\leq k).

Process the atoms in order. Place each in bin 1 if it fits, and otherwise in bin 3 if it fits. Every atom is placed, and the final loads are at most c1,c3c_{1},c_{3}.

Proof. Suppose fjf_{j} is the first atom fitting neither bin. Then the current loads U,WU,W satisfy U+W=u0+w0+∑i<jfiU+W=u_{0}+w_{0}+\sum_{i<j}f_{i}, U+fj>c1U+f_{j}>c_{1}, and W+fj>c3W+f_{j}>c_{3}. Adding the last two inequalities contradicts (4.4). □\square

The rule permits zero atoms and repeated values. Its three cases are:

  1. (1)

    If g+b+≥d∗g+b_{+}\geq d_{*}, apply Lemma 4.1 to the whole list. Use bin caps g,d∗−gg,d_{*}-g for slots 1 and 2, and leave slot 3 empty.

  2. (2)

    If g+b+<d∗g+b_{+}<d_{*}, test in order K={1},{1,2},{1,2,3},{1,3},{2,3}K=\{1\},\{1,2\},\{1,2,3\},\{1,3\},\{2,3\}. Put K′=K∩{1,…,m}K^{\prime}=K\cap\{1,\ldots,m\} and b=∑i∈K′eib=\sum_{i\in K^{\prime}}e_{i}. Call KK legal if b−≤b≤b+b_{-}\leq b\leq b_{+} and the remaining atoms, in their original order, satisfy WF⁢(d∗−b)\mathrm{WF}(d_{*}-b). For the first legal KK, place K′K^{\prime} in slot 2. Apply Lemma 4.1 to the rest in slots 1 and 3, with caps g,d∗−g−bg,d_{*}-g-b.

  3. (3)

    If no KK is legal, use caps g,b−,d∗−g−b−g,b_{-},d_{*}-g-b_{-} for slots 1, 2, 3. Put atom 1 in slot 2 if it exists. Process subsequent atoms in order, placing each in the first slot in which it fits. Put the first atom fitting no slot in slot 2. Call the resulting slot-2 load bb. Apply Lemma 4.1 to the remaining atoms in slots 1 and 3, with caps g,d∗−g−bg,d_{*}-g-b.

Proof of Theorem 4.1. Write ℛ\mathcal{R} for the rule just defined. Since h≥1/2h\geq 1/2, b−≥0b_{-}\geq 0; also d∗=h−2⁢δ≥1/2−6⋅10−9>1/3≥gd_{*}=h-2\delta\geq 1/2-6\cdot 10^{-9}>1/3\geq g. It is enough to prove one of the following envelopes:

(Eglob):g≥d∗−b+,Σ1≤g,Σ2≤d∗−g,Σ3=0;(Ecrit⁢(b)):b−≤b≤b+,Σ1≤g,Σ2≤b,Σ3≤d∗−g−b.\begin{split}(E_{\rm glob}):&\quad g\geq d_{*}-b_{+},\quad\Sigma_{1}\leq g,% \quad\Sigma_{2}\leq d_{*}-g,\quad\Sigma_{3}=0;\\ (E_{\rm crit}(b)):&\quad b_{-}\leq b\leq b_{+},\quad\Sigma_{1}\leq g,\quad% \Sigma_{2}\leq b,\quad\Sigma_{3}\leq d_{*}-g-b.\end{split}

The second, third, and fourth left sides in (4.3) have nonnegative load coefficients. Under Ecrit⁢(b)E_{\rm crit}(b), Lemma 4.1(5) gives

2⁢g+Σ2+2⁢Σ3\displaystyle 2g+\Sigma_{2}+2\Sigma_{3} ≤2⁢d∗−b≤2⁢d∗−b−=1−4⁢δ,\displaystyle\leq 2d_{*}-b\leq 2d_{*}-b_{-}=1-4\delta,
ϑ+g+Σ1+5⁢Σ2+2⁢Σ3\displaystyle\vartheta+g+\Sigma_{1}+5\Sigma_{2}+2\Sigma_{3} ≤ϑ+2⁢d∗+3⁢b≤ϑ+2⁢d∗+3⁢bB=2−4⁢δ.\displaystyle\leq\vartheta+2d_{*}+3b\leq\vartheta+2d_{*}+3b_{B}=2-4\delta.

For the fourth load, similarly,

(1+2⁢ϑ)⁢g+Σ1+(5−2⁢ϑ)⁢Σ2+(2+2⁢ϑ)⁢Σ3\displaystyle(1+2\vartheta)g+\Sigma_{1}+(5-2\vartheta)\Sigma_{2}+(2+2\vartheta% )\Sigma_{3}
≤(2+2⁢ϑ)⁢d∗+(3−4⁢ϑ)⁢b\displaystyle\qquad\leq(2+2\vartheta)d_{*}+(3-4\vartheta)b
≤(2+2⁢ϑ)⁢d∗+(3−4⁢ϑ)⁢bA\displaystyle\qquad\leq(2+2\vartheta)d_{*}+(3-4\vartheta)b_{A}
=2−4⁢(1+ϑ)⁢δ.\displaystyle\qquad=2-4(1+\vartheta)\delta.

Here 3−4⁢ϑ=17/8>03-4\vartheta=17/8>0. Under EglobE_{\rm glob}, use g≥d∗−b+g\geq d_{*}-b_{+} in the two expressions whose coefficient of gg is negative. This gives

2⁢g+Σ2\displaystyle 2g+\Sigma_{2} ≤g+d∗≤13−δ2+H¯−2⁢δ=715768−52⁢δ≤1−4⁢δ,\displaystyle\leq g+d_{*}\leq\tfrac{1}{3}-\tfrac{\delta}{2}+\overline{H}-2% \delta=\tfrac{715}{768}-\tfrac{5}{2}\delta\leq 1-4\delta,
ϑ+2⁢g+5⁢Σ2\displaystyle\vartheta+2g+5\Sigma_{2} ≤ϑ+5⁢d∗−3⁢g≤ϑ+2⁢d∗+3⁢b+=2−4⁢δ,\displaystyle\leq\vartheta+5d_{*}-3g\leq\vartheta+2d_{*}+3b_{+}=2-4\delta,
(2+2⁢ϑ)⁢g+(5−2⁢ϑ)⁢Σ2\displaystyle(2+2\vartheta)g+(5-2\vartheta)\Sigma_{2} ≤(5−2⁢ϑ)⁢d∗−(3−4⁢ϑ)⁢g\displaystyle\leq(5-2\vartheta)d_{*}-(3-4\vartheta)g
≤(2+2⁢ϑ)⁢d∗+(3−4⁢ϑ)⁢b+≤2−4⁢(1+ϑ)⁢δ.\displaystyle\leq(2+2\vartheta)d_{*}+(3-4\vartheta)b_{+}\leq 2-4(1+\vartheta)\delta.

The first line uses 1−715/768=53/768>3⁢δ/21-715/768=53/768>3\delta/2. In both envelopes Σ1≤g\Sigma_{1}\leq g, proving the first inequality of (4.3). Equality at the case boundary belongs to case 1; all displayed endpoint inequalities are weak.

Consider case 1. The clause WF⁢(d∗)\mathrm{WF}(d_{*}) of (4.2) is exactly the hypothesis (4.4) for the whole list. Here u0=w0=0u_{0}=w_{0}=0 and the total cap is d∗d_{*}. Lemma 4.1 gives EglobE_{\rm glob}. Now suppose g+b+<d∗g+b_{+}<d_{*}. If a tested set KK is legal, the remaining list satisfies (4.4) with total cap d∗−bd_{*}-b. Lemma 4.1 then gives Ecrit⁢(b)E_{\rm crit}(b).

We verify the rule when no tested set is legal. Two deletion facts will be used. First let K′K^{\prime} be a leading set {1,…,k}\{1,\ldots,k\}. Subtract b=∑i≤keib=\sum_{i\leq k}e_{i} from every later inequality in WF⁢(d∗)\mathrm{WF}(d_{*}). This proves WF⁢(d∗−b)\mathrm{WF}(d_{*}-b) for the remaining list. Next let K′K^{\prime} be {1,3}\{1,3\}, {2,3}\{2,3\}, or, when m=2m=2, the truncation {2}\{2\} of K={2,3}K=\{2,3\}. Let b−≤b≤b+b_{-}\leq b\leq b_{+}. The only unselected atom among the first three has index i0=2i_{0}=2 or 11. If it is below b−b_{-}, it is first in the remaining list, and

2⁢ei0+b<2⁢b−+b+≤d∗2e_{i_{0}}+b<2b_{-}+b_{+}\leq d_{*}

by Lemma 4.1(4). When m=2m=2 this is the whole remaining list. Now take a remaining rank at least four. Its original prefix sum contains both selected atoms. Subtracting bb proves the reduced mask. Thus the nonconsecutive set is legal whenever these conditions hold.

Assume now that no tested set is legal. First, e¯1≤μ\bar{e}_{1}\leq\mu. Otherwise the definition of H~\widetilde{H} and (4.2) give h≤v⁢(e1)h\leq v(e_{1}). Then b−≤e1≤b+b_{-}\leq e_{1}\leq b_{+} by Lemma 4.1(1), and {1}\{1\} is legal. The same lemma and b+≥μb_{+}\geq\mu show e¯1<b−\bar{e}_{1}<b_{-}; otherwise {1}\{1\} is legal. Hence every padded coordinate is below b−b_{-}. Since e¯1≤μ\bar{e}_{1}\leq\mu, the branch condition gives H~=H\widetilde{H}=H. A branch in its maximum is at least hh. Neither v⁢(e¯1)v(\bar{e}_{1}) nor v⁢(e¯2)v(\bar{e}_{2}) can be that branch. Each would put the corresponding coordinate at least b−b_{-}. A branch v⁢(e¯1+e¯2)v(\bar{e}_{1}+\bar{e}_{2}) or v⁢(e¯1+e¯2+e¯3)v(\bar{e}_{1}+\bar{e}_{2}+\bar{e}_{3}) would make a leading set legal. If

ψ⁢(v⁢(e¯1+e¯3),e¯1+2⁢e¯2+e¯3)≥h,\psi(v(\bar{e}_{1}+\bar{e}_{3}),\bar{e}_{1}+2\bar{e}_{2}+\bar{e}_{3})\geq h,

then v⁢(e¯1+e¯3)≥hv(\bar{e}_{1}+\bar{e}_{3})\geq h, and b=e¯1+e¯3∈[b−,b+]b=\bar{e}_{1}+\bar{e}_{3}\in[b_{-},b_{+}]. The only unselected atom among the first three is e2<b−e_{2}<b_{-}. So the deletion fact makes {1,3}\{1,3\} legal, a contradiction. The other ψ\psi branch similarly makes {2,3}\{2,3\} legal. Therefore either w⁢(e¯1,e¯2,e¯3)≥hw(\bar{e}_{1},\bar{e}_{2},\bar{e}_{3})\geq h or w⁢(e¯1,e¯3,e¯2)≥hw(\bar{e}_{1},\bar{e}_{3},\bar{e}_{2})\geq h. Lemma 4.1 gives, respectively,

(4.5) e¯3≤b+−b−,ore¯2≤b+−b−.\bar{e}_{3}\leq b_{+}-b_{-},\qquad\hbox{or}\qquad\bar{e}_{2}\leq b_{+}-b_{-}.

In case 3, the slot-3 cap is

d∗−g−b−=1−h−g−2⁢δ≥1−H¯−13−32⁢δ=53768−32⁢δ>0.d_{*}-g-b_{-}=1-h-g-2\delta\geq 1-\overline{H}-\frac{1}{3}-\frac{3}{2}\delta=% \frac{53}{768}-\frac{3}{2}\delta>0.

Thus all three caps are nonnegative. Atom 1 fits slot 2 because e1<b−e_{1}<b_{-}. In the first ww case, atom 2 cannot be a stopping atom. Slots 1 and 3 are empty. If e2e_{2} fit neither, then 2⁢e2>d∗−b−≥2⁢b−2e_{2}>d_{*}-b_{-}\geq 2b_{-} by Lemma 4.1(4), contrary to e2<b−e_{2}<b_{-}. Thus any stopping atom has index j≥3j\geq 3 and ej≤e3≤b+−b−e_{j}\leq e_{3}\leq b_{+}-b_{-}. In the second ww case, a stopping atom has j≥2j\geq 2 and ej≤e2≤b+−b−e_{j}\leq e_{2}\leq b_{+}-b_{-}. If there is no stop, the final loads are bounded by (g,b−,d∗−g−b−)(g,b_{-},d_{*}-g-b_{-}). This is Ecrit⁢(b−)E_{\rm crit}(b_{-}), also when m=0m=0.

If the stop is at jj, let (u0,v0,w0)(u_{0},v_{0},w_{0}) be the loads before eje_{j}. After placing eje_{j} in slot 2, its load b=v0+ejb=v_{0}+e_{j} satisfies

b−<b≤b−+(b+−b−)=b+.b_{-}<b\leq b_{-}+(b_{+}-b_{-})=b_{+}.

The lower bound holds because eje_{j} did not fit slot 2. The upper bound follows from (4.5). The jj-th inequality in WF⁢(d∗)\mathrm{WF}(d_{*}) gives u0+w0+ej≤d∗−bu_{0}+w_{0}+e_{j}\leq d_{*}-b. Since eje_{j} did not fit slot 1, u0+ej>gu_{0}+e_{j}>g, so w0<d∗−g−bw_{0}<d_{*}-g-b. For every later rank, the original mask is exactly the two-bin condition with total cap d∗−bd_{*}-b. Lemma 4.1 completes the assignment and gives Ecrit⁢(b)E_{\rm crit}(b). The rule processes every atom once and has fixed tie priorities, so it is well defined. All cases imply (4.3). □\square

4.2. A local ceiling and a small-atom criterion

In this subsection write θRP\theta_{\rm RP} for the exponent in the unramified Ramanujan bound and ϑRP=2⁢θRP\vartheta_{\rm RP}=2\theta_{\rm RP}. The Kim–Sarnak bound [13] gives θRP=7/64\theta_{\rm RP}=7/64 and ϑRP=7/32=ϑ\vartheta_{\rm RP}=7/32=\vartheta.

Proposition 4.6 (local ceiling and small-atom packing). Suppose 0≤ϑRP≤7/320\leq\vartheta_{\rm RP}\leq 7/32, that is 0≤θRP≤7/640\leq\theta_{\rm RP}\leq 7/64, and 0≤t≤1/30\leq t\leq 1/3. Let x,y,z3≥0x,y,z_{3}\geq 0 satisfy the zero-loss local slot constraints

x−t\displaystyle x-t ≤0,\displaystyle\leq 0, 2⁢t+y+2⁢z3\displaystyle 2t+y+2z_{3} ≤1,\displaystyle\leq 1,
ϑRP+t+x+5⁢y+2⁢z3\displaystyle\vartheta_{\rm RP}+t+x+5y+2z_{3} ≤2,\displaystyle\leq 2, (1+2⁢ϑRP)⁢t+x+(5−2⁢ϑRP)⁢y+(2+2⁢ϑRP)⁢z3\displaystyle(1+2\vartheta_{\rm RP})t+x+(5-2\vartheta_{\rm RP})y+(2+2\vartheta% _{\rm RP})z_{3} ≤2,\displaystyle\leq 2,

and x+y+z3≤1−tx+y+z_{3}\leq 1-t. Then their maximum total load is

HϑRP=5−ϑRP8=5−2⁢θRP8.H_{\vartheta_{\rm RP}}=\frac{5-\vartheta_{\rm RP}}{8}=\frac{5-2\theta_{\rm RP}% }{8}.

For fixed tt, equality holds precisely at x=tx=t, y=(1−ϑRP)/4y=(1-\vartheta_{\rm RP})/4, z3=(3+ϑRP)/8−tz_{3}=(3+\vartheta_{\rm RP})/8-t.

Suppose instead that 0≤ej≤u0\leq e_{j}\leq u with u≥0u\geq 0. Let the non-increasing labelled atoms obey WF⁢(h−2⁢δ)\mathrm{WF}(h-2\delta), with

12≤h≤Hsmall⁢(ϑRP,u):=5−ϑRP−3⁢u8,0<δ≤1100,0≤g≤13.\frac{1}{2}\leq h\leq H_{\rm small}(\vartheta_{\rm RP},u):=\frac{5-\vartheta_{% \rm RP}-3u}{8},\qquad 0<\delta\leq\frac{1}{100},\qquad 0\leq g\leq\frac{1}{3}.

Then they admit a three-slot partition with the four load inequalities (4.3). Here ϑRP\vartheta_{\rm RP} replaces ϑ\vartheta. In particular, Hsmall⁢(7/32,1/500)=19101/32000H_{\rm small}(7/32,1/500)=19101/32000 and H7/32=153/256H_{7/32}=153/256.

Proof. Seven times x−t≤0x-t\leq 0, three times 2⁢t+y+2⁢z3≤12t+y+2z_{3}\leq 1, and once ϑRP+t+x+5⁢y+2⁢z3≤2\vartheta_{\rm RP}+t+x+5y+2z_{3}\leq 2 give 8⁢(x+y+z3)+ϑRP≤58(x+y+z_{3})+\vartheta_{\rm RP}\leq 5. Equality forces equality in these three constraints, giving the stated point. Conversely, that point has y≥25/128y\geq 25/128, z3≥1/24z_{3}\geq 1/24, and total load plus tt at most 23/2423/24. Substitution in the fourth constraint gives 2−3⁢ϑRP⁢(1−ϑRP)/4≤22-3\vartheta_{\rm RP}(1-\vartheta_{\rm RP})/4\leq 2, proving the maximum and its equality cases.

For the small-atom assertion put

d\displaystyle d =h−2⁢δ,\displaystyle=h-2\delta, b−\displaystyle b_{-} =2⁢h−1,\displaystyle=2h-1, bB\displaystyle b_{B} =2−ϑRP−2⁢h3,\displaystyle=\frac{2-\vartheta_{\rm RP}-2h}{3},
bA\displaystyle b_{A} =2−(2+2⁢ϑRP)⁢h3−4⁢ϑRP,\displaystyle=\frac{2-(2+2\vartheta_{\rm RP})h}{3-4\vartheta_{\rm RP}}, b+\displaystyle b_{+} =min⁡(bA,bB).\displaystyle=\min(b_{A},b_{B}).

The denominators are positive, and direct subtraction gives

bB−b−=5−ϑRP−8⁢h3,bA−b−=5−4⁢ϑRP−(8−6⁢ϑRP)⁢h3−4⁢ϑRP.b_{B}-b_{-}=\frac{5-\vartheta_{\rm RP}-8h}{3},\qquad b_{A}-b_{-}=\frac{5-4% \vartheta_{\rm RP}-(8-6\vartheta_{\rm RP})h}{3-4\vartheta_{\rm RP}}.

Hence u≤b+−b−u\leq b_{+}-b_{-} is equivalent to

h≤5−ϑRP−3⁢u8,h≤5−4⁢ϑRP−(3−4⁢ϑRP)⁢u8−6⁢ϑRP.h\leq\frac{5-\vartheta_{\rm RP}-3u}{8},\qquad h\leq\frac{5-4\vartheta_{\rm RP}% -(3-4\vartheta_{\rm RP})u}{8-6\vartheta_{\rm RP}}.

The second upper bound exceeds the first by [6⁢ϑRP⁢(1−ϑRP)+14⁢ϑRP⁢u]/[8⁢(8−6⁢ϑRP)]≥0[6\vartheta_{\rm RP}(1-\vartheta_{\rm RP})+14\vartheta_{\rm RP}u]/[8(8-6% \vartheta_{\rm RP})]\geq 0. So the assumed bound on hh gives u≤b+−b−u\leq b_{+}-b_{-}. Start with capacities (g,b−,d−g−b−)(g,b_{-},d-g-b_{-}). They are nonnegative, since the last is at least 1−5/8−1/3−2⁢δ≥1/24−1/50>01-5/8-1/3-2\delta\geq 1/24-1/50>0. Place atoms in order in the first slot in which they fit. If all fit, take b=b−b=b_{-}. Otherwise, put the first failed atom eje_{j} in slot 2. Let bb be the new slot-2 load. Its failure there and ej≤ue_{j}\leq u give b−<b≤b−+u≤b+b_{-}<b\leq b_{-}+u\leq b_{+}. Let (U,V,W)(U,V,W) be the previous loads. Then WF⁢(d)\mathrm{WF}(d) gives U+W+ej≤d−bU+W+e_{j}\leq d-b. Failure in slot 1 gives W<d−g−bW<d-g-b. For each later atom, subtract the fixed slot-2 load bb from its original WF⁢(d)\mathrm{WF}(d) inequality. Lemma 4.1 places the remaining atoms in slots 1 and 3 with capacities g,d−g−bg,d-g-b. Both cases reach

Σ1≤g,Σ2≤b,Σ3≤d−g−b,b−≤b≤b+.\Sigma_{1}\leq g,\qquad\Sigma_{2}\leq b,\qquad\Sigma_{3}\leq d-g-b,\qquad b_{-% }\leq b\leq b_{+}.

The last three left sides of (4.3), with ϑRP\vartheta_{\rm RP} in place of ϑ\vartheta, are at most

2⁢d−b−=1−4⁢δ,ϑRP+2⁢d+3⁢bB=2−4⁢δ,(2+2⁢ϑRP)⁢d+(3−4⁢ϑRP)⁢bA=2−4⁢(1+ϑRP)⁢δ,\begin{gathered}2d-b_{-}=1-4\delta,\qquad\vartheta_{\rm RP}+2d+3b_{B}=2-4% \delta,\\ (2+2\vartheta_{\rm RP})d+(3-4\vartheta_{\rm RP})b_{A}=2-4(1+\vartheta_{\rm RP}% )\delta,\end{gathered}

respectively. This proves the partition claim. □\square

These are a relaxed local spectral ceiling and a sufficient uniform small-atom packing criterion. The actual local inequalities have positive losses, so the relaxed ceiling is a supremum. For example, take the losses 29⁢σ29\sigma, 8⁢σ8\sigma, and 15⁢σ15\sigma in the first three slot constraints. They give

x+y+z3≤HϑRP−242⁢σ8−ϑRP⁢σ160x+y+z_{3}\leq H_{\vartheta_{\rm RP}}-\frac{242\sigma}{8}-\frac{\vartheta_{\rm RP% }\sigma}{160}

when the moving-frequency factor is XϑRP⁢(1+σ/20)X^{\vartheta_{\rm RP}(1+\sigma/20)}. The small-atom bound also needs strict room in an actual source. If h=ρ⁢θ+2⁢δ≤Hsmall⁢(ϑRP,u)h=\rho\theta+2\delta\leq H_{\rm small}(\vartheta_{\rm RP},u) and δ>0\delta>0, then θ<Hsmall⁢(ϑRP,u)\theta<H_{\rm small}(\vartheta_{\rm RP},u). The next subsection applies this criterion to the structured coefficient family of Iwaniec’s construction.

4.3. Endpoint geometry for Iwaniec’s coefficients

Fix the parameters in Theorem 1.2 and put

(4.6) τ=σ9,ρ=1+τ,Θ⁢(u)=Hsmall⁢(ϑ,u)=5−ϑ−3⁢u8,ηΘ=Θ⁢(u)−θ,δ=30⁢σ,d∗=ρ⁢θ,h=d∗+2⁢δ.\begin{gathered}\tau=\sigma^{9},\qquad\rho=1+\tau,\qquad\Theta(u)=H_{\rm small% }(\vartheta,u)=\frac{5-\vartheta-3u}{8},\\ \eta_{\Theta}=\Theta(u)-\theta,\\ \delta=30\sigma,\qquad d_{*}=\rho\theta,\qquad h=d_{*}+2\delta.\end{gathered}

Proposition 4.2 gives the sufficient packing threshold Θ⁢(u)\Theta(u). The relaxed local ceiling is Hϑ=153/256H_{\vartheta}=153/256. The fixed support exponent for these coefficients is Θ⁢(u)\Theta(u), and Θ⁢(u)<Hϑ\Theta(u)<H_{\vartheta} because u>0u>0. The margin ηΘ=Θ⁢(u)−θ\eta_{\Theta}=\Theta(u)-\theta leaves room for the smooth divisor and tail-prime ranges. Since the theorem also imposes Dσ2≤zD^{\sigma^{2}}\leq z, every nonempty tail has the required roughness floor. Lemma 4.3 verifies ρ⁢θ+60⁢σ<Θ⁢(u)\rho\theta+60\sigma<\Theta(u) and the hypotheses of Theorem 4.1. Let D=NθD=N^{\theta}, z=Nuz=N^{u}, and Y=Dσ2Y=D^{\sigma^{2}}. Write 𝒫N={p⁢ prime:p∤2⁢N}\mathcal{P}_{N}=\{p\text{ prime}:p\nmid 2N\} and PN⁢(Y)=∏p<Y,p∈𝒫NpP_{N}(Y)=\prod_{p<Y,\ p\in\mathcal{P}_{N}}p. Fix an Iwaniec sign. Write 𝒟ν⁢(D)\mathcal{D}^{\nu}(D) for its finite family of nonempty label vectors 𝐃=(D1,…,Dk)\mathbf{D}=(D_{1},\ldots,D_{k}). They have Dk≤⋯≤D1<D1/2D_{k}\leq\cdots\leq D_{1}<D^{1/2}, grid coordinates in {Dσ2⁢ρj:j≥0}\{D^{\sigma^{2}\rho^{j}}:j\geq 0\}, and the cubic conditions

(4.7) ν=+:D1⁢⋯⁢D2⁢j⁢D2⁢j+13<D(2⁢j+1≤k),ν=−:D1⁢⋯⁢D2⁢j−1⁢D2⁢j3<D(2⁢j≤k).\begin{array}[]{ll}\nu=+:&D_{1}\cdots D_{2j}D_{2j+1}^{3}<D\quad(2j+1\leq k),\\ \nu=-:&D_{1}\cdots D_{2j-1}D_{2j}^{3}<D\quad(2j\leq k).\end{array}

The prime labels in a vector range over Dj≤pj<min⁡(Djρ,z)D_{j}\leq p_{j}<\min(D_{j}^{\rho},z), with pj∤2⁢Np_{j}\nmid 2N. A vector with an empty coordinate interval contributes zero and may be omitted.

Lemma 4.7 (Iwaniec coefficient packing). For every contributing vector and every ξ∈[60⁢σ,1/3+14⁢σ]\xi\in[60\sigma,1/3+14\sigma], let ej=logN⁡min⁡(Djρ,z)e_{j}=\log_{N}\min(D_{j}^{\rho},z), sorted in non-increasing order. Then WF⁢(d∗)\mathrm{WF}(d_{*}) holds and

(4.8) h≤H~⁢(e¯1,e¯2,e¯3).h\leq\widetilde{H}(\bar{e}_{1},\bar{e}_{2},\bar{e}_{3}).

Consequently Theorem 4.1 partitions the tail labels into three slots. Assign the Iwaniec smooth divisor dA⁢A<Dσd_{AA}<D^{\sigma} to slot 1. Let Q,S,RQ,S,R be the resulting lower dyadic slot scales. Then

(4.9) logN⁡Q\displaystyle\log_{N}Q ≤ξ−(1+7271256)⁢σ,\displaystyle\leq\xi-\left(1+\frac{7271}{256}\right)\sigma,
logN⁡(T2⁢S⁢R2)\displaystyle\log_{N}(T^{2}SR^{2}) ≤1−60⁢σ,\displaystyle\leq 1-60\sigma,
logN⁡(Amaxϑ⁢T⁢Q⁢S5⁢R2)\displaystyle\log_{N}(A_{\max}^{\vartheta}TQS^{5}R^{2}) ≤2−(15+952211280)⁢σ,\displaystyle\leq 2-\left(15+\frac{95221}{1280}\right)\sigma,
logN⁡((T⁢R/S)2⁢ϑ⁢T⁢Q⁢S5⁢R2)\displaystyle\log_{N}\left((TR/S)^{2\vartheta}TQS^{5}R^{2}\right) ≤2−(15+22407256)⁢σ,\displaystyle\leq 2-\left(15+\frac{22407}{256}\right)\sigma,

where T=NξT=N^{\xi} and Amax=X1+σ/20A_{\max}=X^{1+\sigma/20} for X≤NX\leq N.

Proof. Put sj=logN⁡Djs_{j}=\log_{N}D_{j}. The grid lower bound gives sj≥σ2⁢θs_{j}\geq\sigma^{2}\theta. The cubic conditions in (4.7) imply ∑i<jsi+2⁢sj<θ\sum_{i<j}s_{i}+2s_{j}<\theta for every rank jj. At a cubic rank this follows by dropping one nonnegative copy of sjs_{j}. At an intermediate rank,

∑i<jsi+2⁢sj=∑i<j−1si+sj−1+2⁢sj≤∑i<j−1si+3⁢sj−1<θ,\sum_{i<j}s_{i}+2s_{j}=\sum_{i<j-1}s_{i}+s_{j-1}+2s_{j}\leq\sum_{i<j-1}s_{i}+3% s_{j-1}<\theta,

using sj−1≥sjs_{j-1}\geq s_{j} and the cubic condition at rank j−1j-1. For the first rank in the minus case use 2⁢s1<θ2s_{1}<\theta, which follows from D1<D1/2D_{1}<D^{1/2}. Thus ∑i<jei+2⁢ej≤ρ⁢(∑i<jsi+2⁢sj)<ρ⁢θ=d∗\sum_{i<j}e_{i}+2e_{j}\leq\rho(\sum_{i<j}s_{i}+2s_{j})<\rho\theta=d_{*}. Also ej≤ue_{j}\leq u, so e¯1≤u<μ\bar{e}_{1}\leq u<\mu. For this range, the branch w⁢(e¯1,e¯2,e¯3)w(\bar{e}_{1},\bar{e}_{2},\bar{e}_{3}) is active. Its activation threshold is at most (1+u)/2≤0.501(1+u)/2\leq 0.501, while

min⁡{132−68⁢u214,153−96⁢u256,1−2⁢u}=153−96⁢u256=Hsmall⁢(ϑ,u)=Θ⁢(u).\min\left\{\frac{132-68u}{214},\frac{153-96u}{256},1-2u\right\}=\frac{153-96u}% {256}=H_{\rm small}(\vartheta,u)=\Theta(u).

Each branch in the minimum decreases with its argument, and e¯2,e¯3≤u\bar{e}_{2},\bar{e}_{3}\leq u. Take 0≤u≤1/5000\leq u\leq 1/500. Each other affine branch minus (153−96⁢u)/256(153-96u)/256 is nonnegative at both endpoints. Hence it is nonnegative on the whole interval. In particular, the minimum defining w⁢(e¯1,e¯2,e¯3)w(\bar{e}_{1},\bar{e}_{2},\bar{e}_{3}) is at least Θ⁢(u)>0.501\Theta(u)>0.501, so its activation condition holds. Thus H~≥Θ⁢(u)\widetilde{H}\geq\Theta(u). Next, τ⁢θ+60⁢σ<ηΘ\tau\theta+60\sigma<\eta_{\Theta}, because 60⁢σ≤0.3⁢ηΘ60\sigma\leq 0.3\eta_{\Theta} and τ⁢θ<0.6⁢σ9≤0.6⁢σ<0.7⁢ηΘ\tau\theta<0.6\sigma^{9}\leq 0.6\sigma<0.7\eta_{\Theta}. Therefore

12<h=ρ⁢θ+60⁢σ=Θ⁢(u)−ηΘ+τ⁢θ+60⁢σ<Θ⁢(u)<H¯.\frac{1}{2}<h=\rho\theta+60\sigma=\Theta(u)-\eta_{\Theta}+\tau\theta+60\sigma<% \Theta(u)<\overline{H}.

Also 0<δ≤3⋅10−90<\delta\leq 3\cdot 10^{-9}. The range for ξ\xi gives g=ξ−δ∈[δ,1/3−δ/2]g=\xi-\delta\in[\delta,1/3-\delta/2]. Theorem 4.1 applies.

The smooth-only term is the empty-list case. Here H~⁢(0,0,0)=H⁢(0,0,0)=H¯\widetilde{H}(0,0,0)=H(0,0,0)=\overline{H}, since the ww branch equals min⁡{132/214,153/256,1}=H¯\min\{132/214,153/256,1\}=\overline{H} and its activation threshold is 1/21/2. Thus Theorem 4.1 applies to the empty list as well. The smooth divisor remains in slot 1, and slots 2 and 3 are units.

For the scale bounds, the slot-1 smooth divisor contributes at most σ⁢θ<σ⁢H¯\sigma\theta<\sigma\overline{H} to the logarithmic load. The other slot loads are bounded by Σ2,Σ3\Sigma_{2},\Sigma_{3}. Thus

logN⁡Q\displaystyle\log_{N}Q ≤Σ1+σ⁢H¯,\displaystyle\leq\Sigma_{1}+\sigma\overline{H}, logN⁡S\displaystyle\log_{N}S ≤Σ2,\displaystyle\leq\Sigma_{2}, logN⁡R\displaystyle\log_{N}R ≤Σ3,\displaystyle\leq\Sigma_{3},
logN⁡T\displaystyle\log_{N}T =ξ=g+δ,\displaystyle=\xi=g+\delta, logN⁡Amax\displaystyle\log_{N}A_{\max} ≤1+σ/20.\displaystyle\leq 1+\sigma/20.

The first line of (4.3) gives

logN⁡Q−ξ≤−(30−H¯)⁢σ=−(1+7271256)⁢σ.\log_{N}Q-\xi\leq-(30-\overline{H})\sigma=-\left(1+\frac{7271}{256}\right)\sigma.

The second gives

logN⁡(T2⁢S⁢R2)≤1−2⁢δ=1−60⁢σ.\log_{N}(T^{2}SR^{2})\leq 1-2\delta=1-60\sigma.

For the third scale, (4.3) gives

logN⁡(Amaxϑ⁢T⁢Q⁢S5⁢R2)≤2−3⁢δ+(ϑ20+H¯)⁢σ=2−(15+952211280)⁢σ.\log_{N}(A_{\max}^{\vartheta}TQS^{5}R^{2})\leq 2-3\delta+\left(\frac{\vartheta% }{20}+\overline{H}\right)\sigma=2-\left(15+\frac{95221}{1280}\right)\sigma.

For the fourth, it gives

logN⁡((T⁢R/S)2⁢ϑ⁢T⁢Q⁢S5⁢R2)≤2−(3+2⁢ϑ)⁢δ+H¯⁢σ=2−(15+22407256)⁢σ.\log_{N}((TR/S)^{2\vartheta}TQS^{5}R^{2})\leq 2-(3+2\vartheta)\delta+\overline% {H}\sigma=2-\left(15+\frac{22407}{256}\right)\sigma.

The exact constants in (4.9) hold for the lower scales. We round each of the three aggregate slot scales Q,R,SQ,R,S once, to a dyadic representative within a factor two. Each monomial below has total degree at most 88 in Q,R,SQ,R,S. So rounding multiplies it by at most 282^{8}. Individual prime labels are not rounded. This adds at most 8⁢log⁡2/log⁡N8\log 2/\log N to its base-NN exponent. Fix σ>0\sigma>0. For sufficiently large NN, each positive margin absorbs this cost. The tightest margin, for Q<T⁢X−29⁢σQ<TX^{-29\sigma}, is 103⁢σ/256−8⁢log⁡2/log⁡N>0103\sigma/256-8\log 2/\log N>0. □\square

For fixed B>0B>0 and N/(2⁢(log⁡N)B)≤X≤NN/(2(\log N)^{B})\leq X\leq N, put ω=logN⁡(N/X)\omega=\log_{N}(N/X). Then ω≤(B⁢log⁡log⁡N+log⁡2)/log⁡N\omega\leq(B\log\log N+\log 2)/\log N, so eventually logX⁡N=(1−ω)−1<1+0.01⁢σ\log_{X}N=(1-\omega)^{-1}<1+0.01\sigma. The first exponent in (4.9), after dividing by TT, is negative. So conversion from base NN to base XX improves that relative inequality. Each other exponent is at most 22; conversion costs at most 0.02⁢σ0.02\sigma. The displayed margins absorb this cost.

For every contributing vector, the last-rank mask gives ∑jsj<θ\sum_{j}s_{j}<\theta. Since each sj≥σ2⁢θs_{j}\geq\sigma^{2}\theta, it also gives k<σ−2k<\sigma^{-2}. Thus ∏jDj<D\prod_{j}D_{j}<D, and pj<Djρp_{j}<D_{j}^{\rho} gives

d⁢∏jpj<Dσ⁢Dρ=D1+σ+τ=N(1+σ+τ)⁢θ<NΘ⁢(u),d\prod_{j}p_{j}<D^{\sigma}D^{\rho}=D^{1+\sigma+\tau}=N^{(1+\sigma+\tau)\theta}% <N^{\Theta(u)},

where (σ+τ)⁢θ<ηΘ(\sigma+\tau)\theta<\eta_{\Theta}. All prime factors avoid 2⁢N2N. Thus the full coefficient is supported on q<NΘ⁢(u)q<N^{\Theta(u)} with (q,2⁢N)=1(q,2N)=1. Its coefficients are Oσ⁢(1)O_{\sigma}(1). The YY-smooth part of a supported modulus determines dd. The remaining labelled prime assignments number at most k!k!, and k<σ−2k<\sigma^{-2}. For each sign the Iwaniec family has fewer than e8⁢σ−3e^{8\sigma^{-3}} vectors. So the sum over vectors keeps a bound depending only on σ\sigma. The smooth-only term satisfies the same support and coefficient bounds.

The cubic-to-quadratic implication just proved is uniform in the vector length. We record the two bounds obtained above:

(4.10) k<σ−2,∑j=1ksj<θ.k<\sigma^{-2},\qquad\sum_{j=1}^{k}s_{j}<\theta.

These bounds also control the coefficient regrouping below.

4.4. Three-slot coefficient identity

Fix a sign ν\nu and a vector 𝐃\mathbf{D}. The set of equal-label pairs in the Iwaniec grid is I⁢(𝐃)={(i,j):1≤i<j≤k,Di=Dj}I(\mathbf{D})=\{(i,j):1\leq i<j\leq k,\ D_{i}=D_{j}\}. Distinct grid labels have disjoint half-open prime intervals [Di,min⁡(Diρ,z))[D_{i},\min(D_{i}^{\rho},z)). Adjacent grid values differ by the power ρ\rho. Thus repeated primes can occur only in I⁢(𝐃)I(\mathbf{D}). Define

K𝐃⁢(𝐩)=∏(i,j)∈I⁢(𝐃)(1−𝟏pi=pj).K_{\mathbf{D}}(\mathbf{p})=\prod_{(i,j)\in I(\mathbf{D})}(1-\mathbf{1}_{p_{i}=% p_{j}}).

For the Iwaniec coefficients λdν⁢(𝐃)\lambda_{d}^{\nu}(\mathbf{D}), define the unrestricted coefficient

(4.11) C𝐃full⁢(q)=∑d<Dσd∣PN⁢(Y)λdν⁢(𝐃)⁢∑Dj≤pj<min⁡(Djρ,z)pj∤2⁢N𝟏q=d⁢∏j=1kpj.C_{\mathbf{D}}^{\rm full}(q)=\sum_{\begin{subarray}{c}d<D^{\sigma}\\ d\mid P_{N}(Y)\end{subarray}}\lambda_{d}^{\nu}(\mathbf{D})\sum_{\begin{% subarray}{c}D_{j}\leq p_{j}<\min(D_{j}^{\rho},z)\\ p_{j}\nmid 2N\end{subarray}}\mathbf{1}_{q=d\prod_{j=1}^{k}p_{j}}.

The masked coefficient C𝐃maskC_{\mathbf{D}}^{\rm mask} is defined by inserting K𝐃⁢(𝐩)K_{\mathbf{D}}(\mathbf{p}) in the inner sum. The coefficient of the smooth-only term, the sole empty-tail term in the Iwaniec formula, is C∅⁢(q)=∑d⁢<Dσ,d∣⁢PN⁢(Y)ϕdν⁢𝟏q=dC_{\emptyset}(q)=\sum_{d<D^{\sigma},d\mid P_{N}(Y)}\phi_{d}^{\nu}\mathbf{1}_{q% =d}. Thus the full signed coefficient is

(4.12) wNν⁢(q)=C∅⁢(q)+∑𝐃∈𝒟ν⁢(D)C𝐃mask⁢(q).w_{N}^{\nu}(q)=C_{\emptyset}(q)+\sum_{\mathbf{D}\in\mathcal{D}^{\nu}(D)}C_{% \mathbf{D}}^{\rm mask}(q).

Lemma 4.8 (slot factorization and collision support). Fix ξ\xi in the range of Lemma 4.3 and let J1⊔J2⊔J3J_{1}\sqcup J_{2}\sqcup J_{3} be its packing partition. All dd and pjp_{j} sums below use the ranges in (4.11). Define

γ1⁢(m)\displaystyle\gamma_{1}(m) =1|J1|!⁢∑d,(pj)j∈J1λdν⁢(𝐃)⁢𝟏m=d⁢∏j∈J1pj,\displaystyle=\frac{1}{|J_{1}|!}\sum_{d,(p_{j})_{j\in J_{1}}}\lambda_{d}^{\nu}% (\mathbf{D})\mathbf{1}_{m=d\prod_{j\in J_{1}}p_{j}},
γs⁢(m)\displaystyle\gamma_{s}(m) =1|Js|!⁢∑(pj)j∈Js𝟏m=∏j∈Jspj,s=2,3.\displaystyle=\frac{1}{|J_{s}|!}\sum_{(p_{j})_{j\in J_{s}}}\mathbf{1}_{m=\prod% _{j\in J_{s}}p_{j}},\qquad s=2,3.

For s=2,3s=2,3 set γs=𝟏m=1\gamma_{s}=\mathbf{1}_{m=1} when JsJ_{s} is empty; γ1\gamma_{1} always retains the smooth-divisor sum. Then

(4.13) C𝐃full⁢(q)=Cslot⁢(γ1∗γ2∗γ3)⁢(q),Cslot=|J1|!⁢|J2|!⁢|J3|!,C_{\mathbf{D}}^{\rm full}(q)=C_{\rm slot}(\gamma_{1}*\gamma_{2}*\gamma_{3})(q)% ,\qquad C_{\rm slot}=|J_{1}|!|J_{2}|!|J_{3}|!,

and |γs⁢(m)|≤1|\gamma_{s}(m)|\leq 1. Consider the full Iwaniec family. The difference between the masked and unrestricted coefficients has pointwise size Oσ⁢(1)O_{\sigma}(1). It is supported on moduli divisible by p2p^{2} for some prime p≥Yp\geq Y.

Proof. A labelled tuple (d,(pj)j≤k)(d,(p_{j})_{j\leq k}) splits uniquely into its three slot tuples. Multiplying the three normalized finite sum definitions by CslotC_{\rm slot} therefore gives (4.13). This regroups a finite sum and allows repeated primes. Fix a product mm. Its prime factors below YY determine dd uniquely: d∣PN⁢(Y)d\mid P_{N}(Y), and every tail prime is at least Dj≥YD_{j}\geq Y. Once dd is fixed, the labelled prime assignments within a slot number at most |Js|!|J_{s}|!. The Iwaniec bounds |λdν⁢(𝐃)|≤1|\lambda_{d}^{\nu}(\mathbf{D})|\leq 1 give |γs⁢(m)|≤1|\gamma_{s}(m)|\leq 1; the same argument applies to γ1\gamma_{1}. The smooth-only term has the corresponding bound from |ϕdν|≤1|\phi_{d}^{\nu}|\leq 1. Since k<σ−2k<\sigma^{-2}, the scalar Cslot=|J1|!⁢|J2|!⁢|J3|!C_{\rm slot}=|J_{1}|!|J_{2}|!|J_{3}|! is Oσ⁢(1)O_{\sigma}(1).

Suppose the distinctness mask removes a tuple. Then some selected pair has pi=pj≥Yp_{i}=p_{j}\geq Y, and its modulus is divisible by pi2p_{i}^{2}. For fixed σ\sigma, (4.10) bounds the number of labels. The Iwaniec family has fewer than e8⁢σ−3e^{8\sigma^{-3}} vectors for each sign. The number of labelled assignments to a fixed modulus is at most k!k!. Hence the aggregate coefficient difference is Oσ⁢(1)O_{\sigma}(1).

The prime-source cost of this collision support is estimated in (B.5)–(B.6). □\square

The smooth-only term C∅C_{\emptyset} is already a one-slot coefficient. Take J1=J2=J3=∅J_{1}=J_{2}=J_{3}=\emptyset, put γ1⁢(m)=∑d⁢<Dσ,d∣⁢PN⁢(Y)ϕdν⁢𝟏m=d\gamma_{1}(m)=\sum_{d<D^{\sigma},d\mid P_{N}(Y)}\phi_{d}^{\nu}\mathbf{1}_{m=d}, and γ2=γ3=𝟏m=1\gamma_{2}=\gamma_{3}=\mathbf{1}_{m=1}. Its coefficient identity and pointwise bound follow directly. The full coefficient wNνw_{N}^{\nu} in (4.12) is the sum of this term and the vector terms above. Every partition is fixed before the prime realizations are summed.

This section proves the packing inequalities and the slot identity for the unrestricted coefficient. It also gives the collision support needed in Appendix B. The prime-source estimate is proved there.

5. Application to Iwaniec’s remainder weights

The source is the prime interval IN=(N/(log⁡N)B,(1−ε)⁢N)I_{N}=(N/(\log N)^{B},(1-\varepsilon)N) from Theorem 1.2. The residue satisfies N≤a≤N⁢log⁡N/3N\leq a\leq N\log N/3 and is coprime to every supported modulus. The saving is (log⁡N)−A(\log N)^{-A} for each fixed A>0A>0.

5.1. Iwaniec’s remainder coefficients

All parameters are those in Theorem 1.2; in particular s=log⁡D/log⁡z=θ/us=\log D/\log z=\theta/u. Let N>2N>2 be even. Let 𝒫N\mathcal{P}_{N} be the set of primes not dividing 2⁢N2N, and write

PN⁢(t)=∏p<tp∈𝒫Np.P_{N}(t)=\prod_{\begin{subarray}{c}p<t\\ p\in\mathcal{P}_{N}\end{subarray}}p.

Use the grid 𝒢⁢(D)\mathcal{G}(D) in (2.28). The admissible vector sets 𝒟ν⁢(D)\mathcal{D}^{\nu}(D) are those in (2.29). The parameter substitution is (2.33a)–(2.33b), with ϵs=σ\epsilon_{s}=\sigma and δs=τ\delta_{s}=\tau. The distinctness set is I⁢(𝐃)={(i,j):1≤i<j≤k,Di=Dj}I(\mathbf{D})=\{(i,j):1\leq i<j\leq k,\ D_{i}=D_{j}\}, the equal-label tail-position pairs. For a vector 𝐩=(p1,…,pk)\mathbf{p}=(p_{1},\ldots,p_{k}) define

K𝐃⁢(𝐩)=∏(i,j)∈I⁢(𝐃)(1−𝟏pi=pj).K_{\mathbf{D}}(\mathbf{p})=\prod_{(i,j)\in I(\mathbf{D})}(1-\mathbf{1}_{p_{i}=% p_{j}}).

Let ϕdν\phi_{d}^{\nu} and λdν⁢(𝐃)\lambda_{d}^{\nu}(\mathbf{D}) be the coefficients of Iwaniec [10, Theorem 4]. Take R=1R=1 and parameters (𝒫N,D,z,σ)(\mathcal{P}_{N},D,z,\sigma) at the cutoff z=Nuz=N^{u}. The proof uses only their bound |⋅|≤1|\cdot|\leq 1 and their support. It never compares coefficient values at different cutoffs. The labelled-tail cutoff of C1 in Section 3, used in (H1), is uL=Y=Dσ2u_{L}=Y=D^{\sigma^{2}}. Since θ>1/2>ℓ0\theta>1/2>\ell_{0}, this satisfies uL=Nθ⁢σ2≥Nℓ0⁢σ2=u0u_{L}=N^{\theta\sigma^{2}}\geq N^{\ell_{0}\sigma^{2}}=u_{0}. The smooth divisor has d<Dσd<D^{\sigma} and d∣PN⁢(Y)d\mid P_{N}(Y). Every tail interval starts at Di≥YD_{i}\geq Y. The exact structured remainder coefficients are

(W) wNν⁢(q)=∑d<Dσd∣PN⁢(Y)ϕdν⁢𝟏q=d+∑𝐃∈𝒟ν⁢(D)∑d<Dσd∣PN⁢(Y)λdν⁢(𝐃)⁢∑pi∈𝒫NDi≤pi<min⁡(Di1+τ,z)K𝐃⁢(𝐩)⁢ 1q=d⁢p1⁢⋯⁢pk.\begin{split}w_{N}^{\nu}(q)={}&\sum_{\begin{subarray}{c}d<D^{\sigma}\\ d\mid P_{N}(Y)\end{subarray}}\phi_{d}^{\nu}\mathbf{1}_{q=d}\\ &+\sum_{\mathbf{D}\in\mathcal{D}^{\nu}(D)}\sum_{\begin{subarray}{c}d<D^{\sigma% }\\ d\mid P_{N}(Y)\end{subarray}}\lambda_{d}^{\nu}(\mathbf{D})\sum_{\begin{% subarray}{c}p_{i}\in\mathcal{P}_{N}\\ D_{i}\leq p_{i}<\min(D_{i}^{1+\tau},z)\end{subarray}}K_{\mathbf{D}}(\mathbf{p}% )\,\mathbf{1}_{q=dp_{1}\cdots p_{k}}.\end{split}

In particular, ν∈{+,−}\nu\in\{+,-\} selects one of the two signed remainders. Each is the full remainder, not an arbitrary well-factorable sequence. Formula (W) includes the smooth-only term. Every prime-tuple term keeps its smooth divisor. The smooth-only term retains its divisor when there is no tail. The estimate below applies separately to either signed remainder. When the directed lower-sieve inequality of Iwaniec [10, Theorem 4] is used, it takes ν=−\nu=-.

5.2. Proof of the interior signed mean value

Proof of Theorem 1.2.

The support and coefficient bounds in the theorem are proved in (B.2), using Iwaniec’s cubic label conditions for every vector in (W). In particular, with eQ=(1+σ+τ)⁢θe_{Q}=(1+\sigma+\tau)\theta,

q<D1+σ+τ=NeQ<NΘ⁢(u),(q,2⁢N)=1,q<D^{1+\sigma+\tau}=N^{e_{Q}}<N^{\Theta(u)},\qquad(q,2N)=1,

including the smooth-only term. The choice σ≤(Θ⁢(u)−θ)/200\sigma\leq(\Theta(u)-\theta)/200 gives the strict second inequality. Take the source μD=𝟏ℙ⁢𝟏IN\mu_{D}=\mathbf{1}_{\mathbb{P}}\mathbf{1}_{I_{N}} of (B.1). By (B.3), p>qp>q for every source prime pp and every supported modulus qq. The coprimality (a,q)=1(a,q)=1 is assumed. So the natural comparator in (B.1) is exactly πIN/φ⁢(q)\pi_{I_{N}}/\varphi(q), and

ΔD⁢(q;a)=πIN⁢(q,a)−πINφ⁢(q).\Delta_{D}(q;a)=\pi_{I_{N}}(q,a)-\frac{\pi_{I_{N}}}{\varphi(q)}.

Before applying the dispersion theorem, (B.5)–(B.6) replace wNνw_{N}^{\nu} by w^Nν⁢(q)=𝟏(q,a)=1⁢w~Nν⁢(q)\widehat{w}_{N}^{\nu}(q)=\mathbf{1}_{(q,a)=1}\widetilde{w}_{N}^{\nu}(q), where w~Nν\widetilde{w}_{N}^{\nu} has the distinctness masks removed. By the hypothesis on the support of wNνw_{N}^{\nu}, the difference wNν−w^Nνw_{N}^{\nu}-\widehat{w}_{N}^{\nu} is a collision contribution. By (B.5), its complete signed discrepancy is Oσ⁢(N⁢log⁡N/Y)O_{\sigma}(N\log N/Y). The coprimality projection 𝟏(q,a)=1\mathbf{1}_{(q,a)=1} factors across the three slots in (4.13), as shown after (B.6); this includes the smooth-only term. Thus the retained coefficient has the exact slot form (3.5). All its moduli are coprime to aa. Appendix B extends the support envelope q<NeQq<N^{e_{Q}} of (B.2) to w~Nν\widetilde{w}_{N}^{\nu} and w^Nν\widehat{w}_{N}^{\nu}. For each source scale X>N/(2⁢(log⁡N)B)X>N/(2(\log N)^{B}), (B.3) then places this entire retained support below X0.6X^{0.6}. The residue bound gives a/X<(2/3)⁢(log⁡N)B+1a/X<(2/3)(\log N)^{B+1}. Hence C4 holds with Kscale=B+1K_{\rm scale}=B+1. This includes a≤X1+σ/20a\leq X^{1+\sigma/20} for large NN. On the doubled complementary support, (B.28) gives a−m⁢n≥ε⁢N/2a-mn\geq\varepsilon N/2. It uses a≥Na\geq N and the upper source cut. Since a≪N⁢log⁡Na\ll N\log N and m⁢n≪Nmn\ll N there, also |m⁢n−a|≤X3|mn-a|\leq X^{3} for large NN. These are both parts of the nonresonance condition (3.10).

After the collision projection, the prime-power contribution is (B.8). The logarithm-freezing error is (B.18). The source-boundary error is (B.19). Lemma B.3 proves the selected-interval lengths and integer endpoint convention in (B.22)–(B.27). Lemma 4.3 supplies the slot inequalities, while (B.20)–(B.21) classify every retained box. The internal Type-I and Type-II bounds, including the box and arithmetic costs, give (B.31). The integer choice Cbox≥⌈2⁢A+32⌉C_{\rm box}\geq\lceil 2A+32\rceil makes the logarithm-freezing and boundary errors in (B.18)–(B.19) O⁢(N⁢(log⁡N)−A)O(N(\log N)^{-A}). The aggregate exponent Aagg=AA_{\rm agg}=A here is the theorem convention; the separate Aagg=A+3A_{\rm agg}=A+3 bookkeeping used for (3.95) requires Cbox≥⌈2⁢A+38⌉C_{\rm box}\geq\lceil 2A+38\rceil and is outside Theorem 3.2. A′=A+24⁢Cbox+31A^{\prime}=A+24C_{\rm box}+31 and Awork=A′+4A_{\rm work}=A^{\prime}+4 absorb the box count. Appendix B verifies the box-family bound (H7), that is (3.91) with K0=24⁢Cbox+26K_{0}=24C_{\rm box}+26. The aggregate form of Theorem 3.2, namely (3.92), bounds the Type-II boxes. For each fixed admissible σ>0\sigma>0, the mask and proper-power terms have fixed power savings. Proposition B.4 combines these terms over the complete support of (W). This gives the assertion for each fixed A,B,ε,u,θ,σA,B,\varepsilon,u,\theta,\sigma in the stated ranges. ∎

5.3. Proof of the logarithmic-integral comparator

Proof of Corollary 1.3.

Put L=log⁡NL=\log N. The coefficient bound in Theorem 1.2 and ∑q≤x1/φ⁢(q)≪log⁡(2⁢x)\sum_{q\leq x}1/\varphi(q)\ll\log(2x) give ∑q|wNν⁢(q)|/φ⁢(q)≪σ,u,θL\sum_{q}|w_{N}^{\nu}(q)|/\varphi(q)\ll_{\sigma,u,\theta}L. The prime number theorem at the two endpoints of INI_{N} gives

πIN=Li⁡((1−ε)⁢N)−Li⁡(N/LB)+OA⁢(N⁢L−A−1)\pi_{I_{N}}=\operatorname{Li}((1-\varepsilon)N)-\operatorname{Li}(N/L^{B})+O_{% A}(NL^{-A-1})

for every fixed A>0A>0. Strict endpoint conventions contribute at most two primes. Multiply this error by the reciprocal-totient sum and apply (1.2). ∎

Appendix A Source checks

The source input used for the coefficients in formula (W) is [10, Theorem 4]. Its hypotheses are [10, (1)–(2)]. Its upper inequality permits 2≤z≤D2\leq z\leq D; its lower inequality permits 2≤z≤D1/22\leq z\leq D^{1/2}. Fix 0<u≤1/5000<u\leq 1/500 and 1/2<θ<Θ⁢(u)1/2<\theta<\Theta(u) as in Theorem 1.2. Then D=NθD=N^{\theta} and z=Nuz=N^{u} satisfy 2⁢u<θ2u<\theta. Thus both ranges apply for all sufficiently large NN. The choice σ≤u/(2⁢θ)\sigma\leq\sqrt{u/(2\theta)} also gives Y=Dσ2≤Nu/2<zY=D^{\sigma^{2}}\leq N^{u/2}<z. The mesh is ϵs=σ\epsilon_{s}=\sigma and δs=σ9=τ\delta_{s}=\sigma^{9}=\tau. The smooth-prime cutoff is YY, as in (2.28)–(2.33b).

Theorem 4’s printed argument list of λdν\lambda_{d}^{\nu} contains the mesh parameter and box tuple. It contains neither the sequence nor the cutoff. The construction in [10, (23)–(26)] collects universal Rosser and fundamental-lemma coefficients. The sequence enters through r⁢(𝒜,q)r(\mathcal{A},q). At each cutoff zz, we use the coefficients and prime-tuple support supplied by that construction. The coefficient family is independent of the sequence. It may depend on zz. The signed prime-source estimate is proved separately in Appendix B.

The OO-constant in the main-term error of [10, Theorem 4] is not given numerically.

The proof of Theorem 1.2 uses no finite computation.

Appendix B Prime-source estimate for Iwaniec’s remainder weights

This section proves the source estimate used in Section 5. Equations (B.2)–(B.6) control the coefficients and distinctness masks. Equations (B.7)–(B.19) treat prime detection, logarithm freezing and boundary boxes. Equations (B.20)–(B.32) bound the retained boxes.

Fix the parameters in Theorem 1.2 and put

τ=σ9,eQ=(1+σ+τ)⁢θ<Θ⁢(u)≤153256,D=Nθ,Y=Dσ2.\begin{gathered}\tau=\sigma^{9},\quad e_{Q}=(1+\sigma+\tau)\theta<\Theta(u)% \leq\frac{153}{256},\\ D=N^{\theta},\quad Y=D^{\sigma^{2}}.\end{gathered}

Put s=log⁡D/log⁡z=θ/us=\log D/\log z=\theta/u, z=Nuz=N^{u}, L=log⁡NL=\log N, H=N/LBH=N/L^{B}, and use the width CboxC_{\rm box} in Theorem 1.2. Write 𝒮n⁢(q;a)=𝟏n≡a⁢(q)−𝟏(n,q)=1/φ⁢(q)\mathcal{S}_{n}(q;a)=\mathbf{1}_{n\equiv a\ (q)}-\mathbf{1}_{(n,q)=1}/\varphi(q). All thresholds below may depend on the fixed parameters. For a product shell [X,2⁢X)[X,2X), set LX=log⁡XL_{X}=\log X. The source measure is

(B.1) μD⁢(n)\displaystyle\mu_{D}(n) =𝟏ℙ⁢(n)⁢𝟏H<n<(1−ε)⁢N,\displaystyle=\mathbf{1}_{\mathbb{P}}(n)\mathbf{1}_{H<n<(1-\varepsilon)N},
ΔD⁢(q;a)\displaystyle\Delta_{D}(q;a) =∑nμD⁢(n)⁢(𝟏n≡a⁢(q)−𝟏(n,q)=1φ⁢(q)).\displaystyle=\sum_{n}\mu_{D}(n)\left(\mathbf{1}_{n\equiv a\ (q)}-\frac{% \mathbf{1}_{(n,q)=1}}{\varphi(q)}\right).
Lemma B.1 (Modulus support and coefficient size).

For either sign in (W),

(B.2) supp⁡wNν⊂{q<NeQ:(q,2⁢N)=1},supq|wNν⁢(q)|≤Cσ,u,θ.\operatorname{supp}w_{N}^{\nu}\subset\{q<N^{e_{Q}}:(q,2N)=1\},\qquad\sup_{q}|w% _{N}^{\nu}(q)|\leq C_{\sigma,u,\theta}.

If [X,2⁢X)[X,2X) meets (H,(1−ε)⁢N)(H,(1-\varepsilon)N), then, for all sufficiently large NN,

(B.3) q<NeQ≤X3/5(q∈supp⁡wNν),H>NeQ.q<N^{e_{Q}}\leq X^{3/5}\quad(q\in\operatorname{supp}w_{N}^{\nu}),\qquad H>N^{e% _{Q}}.

Proof. By the definition of 𝒟ν⁢(D)\mathcal{D}^{\nu}(D) in (2.29), every label vector in (W) satisfies the cubic label conditions of Iwaniec’s sieve remainder [10, Theorem 4]. Write si=logN⁡Dis_{i}=\log_{N}D_{i} for a label vector 𝐃=(D1,…,Dk)\mathbf{D}=(D_{1},\ldots,D_{k}). The cubic conditions in Iwaniec imply ∑isi<θ\sum_{i}s_{i}<\theta. For the plus sign and odd kk, use the last odd-rank condition. For even kk, use the condition at rank k−1k-1 and sk≤sk−1s_{k}\leq s_{k-1}. For the minus sign, if k=1k=1 then s1<θ/2s_{1}<\theta/2. If kk is even, use the last even-rank condition. If k≥3k\geq 3 is odd, use rank k−1k-1 and sk≤sk−1s_{k}\leq s_{k-1}. Thus every term of (W) satisfies

q<Nσ⁢θ+(1+τ)⁢∑isi<Nθ⁢(1+σ+τ)=NeQ.q<N^{\sigma\theta+(1+\tau)\sum_{i}s_{i}}<N^{\theta(1+\sigma+\tau)}=N^{e_{Q}}.

All prime factors in dd and in the tail avoid 2⁢N2N.

Each grid coordinate has the form Dσ2⁢(1+τ)hD^{\sigma^{2}(1+\tau)^{h}} and is less than D1/2D^{1/2}. Thus there are at most 1+2⁢τ−1⁢log⁡(σ−2)1+2\tau^{-1}\log(\sigma^{-2}) choices per position, since log⁡(1+τ)≥τ/2\log(1+\tau)\geq\tau/2. Also k<σ−2k<\sigma^{-2} by the last-rank cubic condition and si≥σ2⁢θs_{i}\geq\sigma^{2}\theta. With τ=σ9\tau=\sigma^{9} and 0<σ≤10−100<\sigma\leq 10^{-10}, the total number of vectors of all lengths is at most

∑0≤k<σ−2(1+2⁢σ−9⁢log⁡(σ−2))k<exp⁡(8⁢σ−3).\sum_{0\leq k<\sigma^{-2}}\bigl{(}1+2\sigma^{-9}\log(\sigma^{-2})\bigr{)}^{k}<% \exp(8\sigma^{-3}).

The logarithm of the left side is at most log⁡(1+σ−2)+σ−2⁢log⁡(1+4⁢σ−9⁢log⁡(1/σ))\log(1+\sigma^{-2})+\sigma^{-2}\log(1+4\sigma^{-9}\log(1/\sigma)). With t=1/σ≥1010t=1/\sigma\geq 10^{10}, this is at most (3+11⁢t2)⁢log⁡t<8⁢t3(3+11t^{2})\log t<8t^{3}, using log⁡t≤t/2\log t\leq t/2. For fixed qq, the primes below YY determine the smooth divisor dd uniquely. The remaining prime factors can be assigned to the kk labelled positions in at most k!k! ways. The Iwaniec coefficients have absolute value at most 11. Summing over the displayed finite vector family proves the multiplicity bound, including the empty-tail term.

If the shell meets the source interval, then X>H/2X>H/2 and log⁡X>L−B⁢log⁡L−log⁡2\log X>L-B\log L-\log 2. Impose

(B.4) (3/5−eQ)⁢L≥(3/5)⁢(B⁢log⁡L+log⁡2).(3/5-e_{Q})L\geq(3/5)(B\log L+\log 2).

It gives eQ⁢L≤(3/5)⁢log⁡Xe_{Q}L\leq(3/5)\log X, proving the first claim of (B.3). The second follows from N1−eQ/LB→∞N^{1-e_{Q}}/L^{B}\to\infty. □\square

Here p>H>NeQp>H>N^{e_{Q}}, and the theorem assumes (a,q)=1(a,q)=1 on the coefficient support. So the natural comparator in (B.1) is πIN/φ⁢(q)\pi_{I_{N}}/\varphi(q). Thus (B.1) is the exact prime-source discrepancy for this source.

Removing the distinctness masks

Let w~Nν\widetilde{w}_{N}^{\nu} be obtained from (W) by replacing each K𝐃K_{\mathbf{D}} by 11, and put w^Nν⁢(q)=𝟏(q,a)=1⁢w~Nν⁢(q)\widehat{w}_{N}^{\nu}(q)=\mathbf{1}_{(q,a)=1}\widetilde{w}_{N}^{\nu}(q). The counting argument in Lemma B.1 also gives supq|w~Nν⁢(q)|+supq|w^Nν⁢(q)|≪σ,u,θ1\sup_{q}|\widetilde{w}_{N}^{\nu}(q)|+\sup_{q}|\widehat{w}_{N}^{\nu}(q)|\ll_{% \sigma,u,\theta}1. Its termwise product bound applies to every unmasked term. So w~Nν\widetilde{w}_{N}^{\nu} and w^Nν\widehat{w}_{N}^{\nu} are also supported on {q<NeQ:(q,2⁢N)=1}\{q<N^{e_{Q}}:(q,2N)=1\}, and (B.3) applies to them. Their support need not lie in supp⁡wNν\operatorname{supp}w_{N}^{\nu}. The theorem assumes wNν⁢(q)=0w_{N}^{\nu}(q)=0 when (q,a)>1(q,a)>1. Hence wNν−w^Nνw_{N}^{\nu}-\widehat{w}_{N}^{\nu} is supported on the terms removed by a distinctness mask. This holds even when an unrestricted collision modulus is not coprime to aa. Every such modulus is divisible by p2p^{2} for some tail prime p≥Yp\geq Y. The coefficient difference is Oσ⁢(1)O_{\sigma}(1). Put Qsupp=NeQQ_{\rm supp}=N^{e_{Q}}.

(B.5) ∑q≤Qsuppp2∣q⁢ for some prime ⁢p≥Y(Nq+1+Nφ⁢(q))≪N⁢log⁡(2⁢Qsupp)Y−1.\sum_{\begin{subarray}{c}q\leq Q_{\rm supp}\\ p^{2}\mid q\text{ for some prime }p\geq Y\end{subarray}}\left(\frac{N}{q}+1+% \frac{N}{\varphi(q)}\right)\ll\frac{N\log(2Q_{\rm supp})}{Y-1}.

For the proof, write q=k⁢p2q=kp^{2}, use φ⁢(k⁢p2)≥φ⁢(k)⁢φ⁢(p2)\varphi(kp^{2})\geq\varphi(k)\varphi(p^{2}), and sum 1/k1/k and 1/φ⁢(k)1/\varphi(k) up to QsuppQ_{\rm supp}. Then use ∑p≥Y1/(p⁢(p−1))≪1/(Y−1)\sum_{p\geq Y}1/(p(p-1))\ll 1/(Y-1). The left side bounds the discrepancy of each removed term. Its progression count is at most N/q+1N/q+1. Consequently

(B.6) ∑qwNν⁢(q)⁢ΔD⁢(q;a)=∑qw^Nν⁢(q)⁢ΔD⁢(q;a)+Oσ⁢(N⁢L/Y).\sum_{q}w_{N}^{\nu}(q)\Delta_{D}(q;a)=\sum_{q}\widehat{w}_{N}^{\nu}(q)\Delta_{% D}(q;a)+O_{\sigma}(NL/Y).

As Y=Nθ⁢σ2Y=N^{\theta\sigma^{2}}, this error has a fixed power saving for each fixed σ>0\sigma>0. For a fixed Iwaniec vector, the exact factorization (4.13) survives the projection. Replace each slot factor γi⁢(m)\gamma_{i}(m) by γi⁢(m)⁢𝟏(m,a)=1\gamma_{i}(m)\mathbf{1}_{(m,a)=1}. Here (m1⁢m2⁢m3,a)=1(m_{1}m_{2}m_{3},a)=1 if and only if each (mi,a)=1(m_{i},a)=1. The bounds |γi|≤1|\gamma_{i}|\leq 1 are unchanged. Equivalently, the smooth divisor and each tail prime are restricted to avoid aa within their existing summation ranges. Thus the projected coefficient still has the labelled form (3.4). Every modulus to which the dispersion theorem is applied is coprime to 2⁢a2a.

Prime detection and the rough Heath–Brown identity

The shells meeting the source satisfy H/2<X<NH/2<X<N. Set

z0=z0⁢(X)=X1/(log⁡log⁡X)3,U=2⁢X1/3.z_{0}=z_{0}(X)=X^{1/(\log\log X)^{3}},\qquad U=2X^{1/3}.

For sufficiently large NN, every n∈[H,(1−ε)⁢N]n\in[H,(1-\varepsilon)N] has n≥z0n\geq z_{0}. Write Λz0⁢(n)=Λ⁢(n)⁢𝟏P−⁢(n)≥z0\Lambda_{z_{0}}(n)=\Lambda(n)\mathbf{1}_{P^{-}(n)\geq z_{0}}. For every integer n≥z0n\geq z_{0}, and so on the whole source range,

(B.7) 𝟏ℙ⁢(n)=Λz0⁢(n)log⁡n−∑k≥21k⁢𝟏n=pk,p≥z0.\mathbf{1}_{\mathbb{P}}(n)=\frac{\Lambda_{z_{0}}(n)}{\log n}-\sum_{k\geq 2}% \frac{1}{k}\mathbf{1}_{n=p^{k},\ p\geq z_{0}}.

The identity follows by checking primes, prime powers, and all other integers n≥z0n\geq z_{0}. It fails for primes below z0z_{0}, which lie outside the source range. The proper powers contribute to the weighted discrepancy

(B.8) Oσ⁢(N1/2+o⁢(1)),O_{\sigma}(N^{1/2+o(1)}),

in total. There are O⁢(N1/2⁢log⁡N)O(N^{1/2}\log N) such integers in the source range H<n<(1−ε)⁢NH<n<(1-\varepsilon)N. The theorem’s range N≤a≤N⁢L/3N\leq a\leq NL/3 gives a≠na\neq n there. Each contributes at most Oσ⁢(d⁢(a−n)+L)O_{\sigma}(d(a-n)+L), where d⁢(m)d(m) is the divisor function.

For n≤8⁢Xn\leq 8X, the order-three rough Heath–Brown identity is

(B.9) Λz0⁢(n)=∑j=13(−1)j−1⁢(3j)⁢∑m1⁢⋯⁢mj⁢n1⁢⋯⁢nj=nmi≤U,mi,ni∈ℛz0μz0⁢(m1)⁢⋯⁢μz0⁢(mj)⁢log⁡n1.\Lambda_{z_{0}}(n)=\sum_{j=1}^{3}(-1)^{j-1}\binom{3}{j}\sum_{\begin{subarray}{% c}m_{1}\cdots m_{j}n_{1}\cdots n_{j}=n\\ m_{i}\leq U,\ m_{i},n_{i}\in\mathcal{R}_{z_{0}}\end{subarray}}\mu_{z_{0}}(m_{1% })\cdots\mu_{z_{0}}(m_{j})\log n_{1}.

Here ℛz0\mathcal{R}_{z_{0}} consists of 11 and the z0z_{0}-rough integers, and μz⁢(m)=μ⁢(m)⁢𝟏P−⁢(m)≥z\mu_{z}(m)=\mu(m)\mathbf{1}_{P^{-}(m)\geq z}. To verify (B.9), put

ζz⁢(s)=∑r∈ℛzr−s,MU⁢(s)=∑m≤Uμz⁢(m)⁢m−s.\zeta_{z}(s)=\sum_{r\in\mathcal{R}_{z}}r^{-s},\qquad M_{U}(s)=\sum_{m\leq U}% \mu_{z}(m)m^{-s}.

The coefficients of ζz⁢MU\zeta_{z}M_{U} vanish except at 11 through degree UU. Thus all coefficients of (1−ζz⁢MU)3(1-\zeta_{z}M_{U})^{3} at n≤U3n\leq U^{3} vanish. Multiply the expansion of 1−(1−ζz⁢MU)31-(1-\zeta_{z}M_{U})^{3} by −ζz′/ζz-\zeta_{z}^{\prime}/\zeta_{z} to obtain (B.9). Every variable is rough; this includes the logarithmic variable n1n_{1}.

The tested indices for shell XX and pattern jj are

(B.10) TX,j={𝐯=(m1,…,mj,n1,…,nj)∈ℛz02⁢j:X≤∏ivi<2⁢X,H<∏ivi<(1−ε)⁢N,mi≤U}.T_{X,j}=\left\{\begin{aligned} \mathbf{v}&=(m_{1},\ldots,m_{j},n_{1},\ldots,n_% {j})\in\mathcal{R}_{z_{0}}^{2j}:\\ &X\leq\prod_{i}v_{i}<2X,\quad H<\prod_{i}v_{i}<(1-\varepsilon)N,\\ &m_{i}\leq U\end{aligned}\right\}.

There are at most six variables. Their coefficient is

cj⁢(𝐯)=(−1)j−1⁢(3j)⁢μz0⁢(m1)⁢⋯⁢μz0⁢(mj)⁢log⁡n1.c_{j}(\mathbf{v})=(-1)^{j-1}\binom{3}{j}\mu_{z_{0}}(m_{1})\cdots\mu_{z_{0}}(m_% {j})\log n_{1}.

The shell, pattern, and tuple are part of the index. The identity’s range n≤8⁢Xn\leq 8X is automatic on TX,jT_{X,j}.

For every nonnegative GG and each j∈{1,2,3}j\in\{1,2,3\},

(B.11) ∑X∑𝐯∈TX,jG⁢(∏ivi)≤∑n<Nτ2⁢j⁢(n)⁢G⁢(n)≤∑n<Nτ6⁢(n)⁢G⁢(n).\sum_{X}\sum_{\mathbf{v}\in T_{X,j}}G\!\left(\prod_{i}v_{i}\right)\leq\sum_{n<% N}\tau_{2j}(n)G(n)\leq\sum_{n<N}\tau_{6}(n)G(n).

The product determines its shell. Roughness restrictions can be dropped in this upper bound. Consequently the sum over all three patterns is at most 3⁢∑n<Nτ6⁢(n)⁢G⁢(n)3\sum_{n<N}\tau_{6}(n)G(n). The factor 33 is absorbed in later implied constants.

For n<Nn<N, (B.2) and its extension to w^Nν\widehat{w}_{N}^{\nu} after (B.5) give the pointwise majorant

|∑qw^Nν⁢(q)⁢𝒮n⁢(q;a)|≤Cσ⁢Fa⁢(n),Fa⁢(n)=d⁢(a−n)+2⁢(1+L).\left|\sum_{q}\widehat{w}_{N}^{\nu}(q)\mathcal{S}_{n}(q;a)\right|\leq C_{% \sigma}F_{a}(n),\qquad F_{a}(n)=d(a-n)+2(1+L).

The congruence term counts q∣a−nq\mid a-n. The natural-comparator term uses ∑q≤NeQ1/φ⁢(q)≪L\sum_{q\leq N^{e_{Q}}}1/\varphi(q)\ll L. On the prime source, (B.1) equals ∑nμD⁢(n)⁢𝒮n⁢(q;a)\sum_{n}\mu_{D}(n)\mathcal{S}_{n}(q;a). Apply (B.7) to this identity while keeping 𝒮n⁢(q;a)\mathcal{S}_{n}(q;a) attached to the tested integer. Each HB tuple then contributes the natural PSDT discrepancy 𝒮∏ivi⁢(q;a)\mathcal{S}_{\prod_{i}v_{i}}(q;a). This holds also when its product shares factors with qq. The proper-power terms use the same discrepancy and obey (B.8).

Equal-ratio boxes and faces

For each product shell put

δX=LX−Cbox,JX=⌈log⁡2log⁡(1+δX)⌉,ΔX=21/JX−1.\delta_{X}=L_{X}^{-C_{\rm box}},\qquad J_{X}=\left\lceil\frac{\log 2}{\log(1+% \delta_{X})}\right\rceil,\qquad\Delta_{X}=2^{1/J_{X}}-1.

For sufficiently large NN, δX≤1/3\delta_{X}\leq 1/3. The equal-ratio partition divides every dyadic coordinate interval [2a,2a+1)[2^{a},2^{a+1}) into the JXJ_{X} cells

[2a⁢(1+ΔX)h, 2a⁢(1+ΔX)h+1),0≤h<JX.[2^{a}(1+\Delta_{X})^{h},\ 2^{a}(1+\Delta_{X})^{h+1}),\qquad 0\leq h<J_{X}.

It covers the full interval, including its last cell. Also

(B.12) δX3≤δX⁢(1−2⁢δX)≤ΔX≤δX.\frac{\delta_{X}}{3}\leq\delta_{X}(1-2\delta_{X})\leq\Delta_{X}\leq\delta_{X}.

For the lower bound, set ℓ=log⁡(1+δX)\ell=\log(1+\delta_{X}). Since JX<log⁡2/ℓ+1J_{X}<\log 2/\ell+1,

log⁡(1+ΔX)>ℓ1+ℓ/log⁡2≥ℓ⁢(1−ℓ/log⁡2).\log(1+\Delta_{X})>\frac{\ell}{1+\ell/\log 2}\geq\ell(1-\ell/\log 2).

Use δX−δX2/2≤ℓ≤δX\delta_{X}-\delta_{X}^{2}/2\leq\ell\leq\delta_{X} and 1/2+1/log⁡2<21/2+1/\log 2<2. This proves (B.12).

The mesh is imposed on the ambient integer axes before roughness is tested. Keep {1}\{1\} as an atom. A product box is a Cartesian product of at most six cells. Let ViV_{i} be its lower endpoints and put ei=logN⁡Vie_{i}=\log_{N}V_{i}; the atom has Vi=1V_{i}=1. Define λℬ=∑ilog⁡Vi\lambda_{\mathcal{B}}=\sum_{i}\log V_{i}. Its tested-side faces are

(B.13) n=H,n=(1−ε)⁢N,n=X,n=2⁢X,mi=2⁢X1/3,n=H,\quad n=(1-\varepsilon)N,\quad n=X,\quad n=2X,\quad m_{i}=2X^{1/3},

where n=∏ivin=\prod_{i}v_{i} and mim_{i} ranges over the Möbius variables. The first two are the source cuts. The next two are product-shell edges, and the last are the HB caps. Roughness is part of the coefficient, not a face. A box is called boundary if one predicate in (B.13) is not constant on it. Every other box is either empty or a full Cartesian sum.

Lemma B.2 (Lattice thin-shell count).

Let s≥2s\geq 2, a∈ℤs∖{0}a\in\mathbb{Z}^{s}\setminus\{0\} with |ai|≤2|a_{i}|\leq 2, and J={i:ai≠0}J=\{i:a_{i}\neq 0\}. Let 1≤Y0≤N1\leq Y_{0}\leq N, 0<ηdist≤1/40<\eta_{\rm dist}\leq 1/4, and let ℒ\mathcal{L} be γ\gamma-separated. Put Kγ=(1−e−γ/2)−1K_{\gamma}=(1-e^{-\gamma/2})^{-1}. Then

(B.14) #{𝐯∈ℤ≥1s:∏ivi≤N,dist(∑iailogvi,ℒ)≤ηdist,maxi∈Jvi≥Y0}≤s⁢[4⁢ηdist⁢Kγ⁢N⁢(1+L)s−1+(4⁢Lγ+2)⁢NY0⁢(1+L)s−2].\begin{split}\#\{\mathbf{v}\in\mathbb{Z}_{\geq 1}^{s}:&\ \prod_{i}v_{i}\leq N,% \operatorname{dist}(\sum_{i}a_{i}\log v_{i},\mathcal{L})\leq\eta_{\rm dist},% \max_{i\in J}v_{i}\geq Y_{0}\}\\ &\leq s\left[4\eta_{\rm dist}K_{\gamma}N(1+L)^{s-1}+\left(\frac{4L}{\gamma}+2% \right)\frac{N}{Y_{0}}(1+L)^{s-2}\right].\end{split}

For a single face, take Kγ=1K_{\gamma}=1 and replace 4⁢L/γ+24L/\gamma+2 by 11.

Proof. Assign a tuple to the least active coordinate ii with vi≥Y0v_{i}\geq Y_{0}. Fix the other coordinates, with product PP, and put Z=N/PZ=N/P. The nonempty fibre has P≤N/Y0P\leq N/Y_{0}. Let q=|ai|∈{1,2}q=|a_{i}|\in\{1,2\}. The admissible values of viv_{i} lie in intervals of relative length at most e2⁢ηdist/q−1≤4⁢ηdiste^{2\eta_{\rm dist}/q}-1\leq 4\eta_{\rm dist}. Their logarithmic left endpoints have spacing at least γ/q\gamma/q. After clipping to [Y0,Z][Y_{0},Z] and merging overlaps, there are at most 2⁢L/γ+22L/\gamma+2 components. The separated left endpoints give total length at most 4⁢ηdist⁢Kγ⁢Z4\eta_{\rm dist}K_{\gamma}Z. Counting integer endpoints adds at most 2⁢L/γ+22L/\gamma+2. For a singleton face there is one component. Since 2⁢L/γ+2≤4⁢L/γ+22L/\gamma+2\leq 4L/\gamma+2, this gives the coefficient 4⁢L/γ+24L/\gamma+2 in (B.14). Sum over the fixed coordinates using

∑P≤Nτs−1⁢(P)P≤(1+L)s−1,∑P≤N/Y0τs−1⁢(P)≤NY0⁢(1+L)s−2.\sum_{P\leq N}\frac{\tau_{s-1}(P)}{P}\leq(1+L)^{s-1},\qquad\sum_{P\leq N/Y_{0}% }\tau_{s-1}(P)\leq\frac{N}{Y_{0}}(1+L)^{s-2}.

This proves (B.14). □\square

Boundary and logarithm-freezing estimates

For every shell meeting the source,

(B.15) L−B⁢log⁡L−log⁡2<log⁡X<L.L-B\log L-\log 2<\log X<L.

Thus, since CboxC_{\rm box} is fixed, for every ϵ>0\epsilon>0, (log⁡X)−Cbox≤(1+ϵ)⁢L−Cbox(\log X)^{-C_{\rm box}}\leq(1+\epsilon)L^{-C_{\rm box}} once NN is large. Also log⁡n\log n and each nonempty box lower-corner logarithm are (1+o⁢(1))⁢L(1+o(1))L on the source.

A boundary box lies within 6⁢δX6\delta_{X} in logarithmic distance of a face in (B.13). The source and product-shell faces give two singleton families and the lattice (log⁡2)⁢ℤ(\log 2)\mathbb{Z}. The cap faces give log⁡2+(log⁡2/3)⁢ℤ\log 2+(\log 2/3)\mathbb{Z}. In each boundary tuple, an active coordinate is at least N1/7N^{1/7} for large NN. For a product face, the largest of at most six factors is at least (H/2)1/6(H/2)^{1/6}. On a cap face the capped factor is at least (H/4)1/3(H/4)^{1/3}. Apply Lemma B.2 with s≤6s\leq 6, Y0=N1/7Y_{0}=N^{1/7}, and ηdist≪L−Cbox\eta_{\rm dist}\ll L^{-C_{\rm box}}. The number of face families is finite and independent of the number of boxes. Let 𝒰\mathcal{U} be the set of boundary indices (X,j,𝐯)(X,j,\mathbf{v}) across shells and patterns for which 𝐯∈TX,j\mathbf{v}\in T_{X,j} lies in a boundary box. It excludes ambient Cartesian points outside the source-restricted set (B.10). The number of boundary indices is therefore

(B.16) #⁢𝒰≪N⁢L5−Cbox+N6/7⁢L5≪N⁢L5−Cbox.\#\mathcal{U}\ll NL^{5-C_{\rm box}}+N^{6/7}L^{5}\ll NL^{5-C_{\rm box}}.

The elementary divisor estimates

(B.17) ∑n<Nτ6⁢(n)\displaystyle\sum_{n<N}\tau_{6}(n) ≤N⁢(1+L)5,\displaystyle\leq N(1+L)^{5},
∑n<Nτ6⁢(n)⁢Fa⁢(n)2\displaystyle\sum_{n<N}\tau_{6}(n)F_{a}(n)^{2} ≪N⁢(1+L)26,\displaystyle\ll N(1+L)^{26},
∑n<Nτ6⁢(n)⁢Fa⁢(n)\displaystyle\sum_{n<N}\tau_{6}(n)F_{a}(n) ≪N⁢(1+L)19\displaystyle\ll N(1+L)^{19}

follow from τ62≤τ36\tau_{6}^{2}\leq\tau_{36}, d2≤τ4d^{2}\leq\tau_{4}, d4≤τ16d^{4}\leq\tau_{16}, the divisor-sum bound ∑n≤xτk⁢(n)≤x⁢(1+log⁡x)k−1\sum_{n\leq x}\tau_{k}(n)\leq x(1+\log x)^{k-1}, and Cauchy–Schwarz. For the last bound, apply Shiu’s short-interval estimate [4] to d⁢(m)2≤τ4⁢(m)d(m)^{2}\leq\tau_{4}(m): ∑a−N<m≤ad⁢(m)2≪N⁢(1+L)3\sum_{a-N<m\leq a}d(m)^{2}\ll N(1+L)^{3} uniformly for N≤a≤N⁢L/3N\leq a\leq NL/3. For a≤2⁢Na\leq 2N the global divisor-sum bound suffices. For a>2⁢Na>2N the interval length NN exceeds a2/3a^{2/3} for all sufficiently large NN. Combining this with ∑n<Nτ6⁢(n)2≪N⁢(1+L)35\sum_{n<N}\tau_{6}(n)^{2}\ll N(1+L)^{35} gives the exponent 1919. The bound for Fa2F_{a}^{2} follows by summing d⁢(m)4d(m)^{4} up to a≤N⁢L/3a\leq NL/3. In particular, the LOG part from replacing 1/log⁡n1/\log n by the lower-corner value 1/λℬ1/\lambda_{\mathcal{B}} on a box satisfies

(B.18) |ELOG|≪σN⁢L18−Cbox.\left|E_{\rm LOG}\right|\ll_{\sigma}NL^{18-C_{\rm box}}.

Here 0≤log⁡n−λℬ≤6⁢δX0\leq\log n-\lambda_{\mathcal{B}}\leq 6\delta_{X}, |cj⁢(𝐯)|≤3⁢L|c_{j}(\mathbf{v})|\leq 3L, and |1/log⁡n−1/λℬ|≪L−Cbox−2|1/\log n-1/\lambda_{\mathcal{B}}|\ll L^{-C_{\rm box}-2}. Sum the resulting O⁢(L−Cbox−1)⁢Fa⁢(n)O(L^{-C_{\rm box}-1})F_{a}(n) over the tuples using (B.17). A tuple belongs to exactly one box, so there is no box-count factor.

For the boundary part, |cj⁢(𝐯)|/λℬ≤3+o⁢(1)|c_{j}(\mathbf{v})|/\lambda_{\mathcal{B}}\leq 3+o(1). Cauchy–Schwarz, (B.16), and the second estimate in (B.17) give

(B.19) |Eboundary|≪σN⁢L16−Cbox/2.|E_{\rm boundary}|\ll_{\sigma}NL^{16-C_{\rm box}/2}.

Classification and interval lengths

The thresholds in (B.4), together with

(B.20) σ⁢L≥202⁢(B⁢log⁡L+log⁡2),σ⁢L≥202⁢(log⁡2+6),\sigma L\geq 202(B\log L+\log 2),\qquad\sigma L\geq 202(\log 2+6),

ensure ωX:=logN⁡(N/X)≤σ/202\omega_{X}:=\log_{N}(N/X)\leq\sigma/202 and κX:=(log⁡2+6⁢log⁡(1+ΔX))/L≤σ/202\kappa_{X}:=(\log 2+6\log(1+\Delta_{X}))/L\leq\sigma/202. In this appendix κX\kappa_{X} plays the role of the κ\kappa in (3.98). For a box meeting TX,jT_{X,j},

(B.21) 1−ωX−κX≤∑iei≤1−ωX+κX,ei≤1−ωX3+κXon each Möbius variable.\begin{gathered}1-\omega_{X}-\kappa_{X}\leq\sum_{i}e_{i}\leq 1-\omega_{X}+% \kappa_{X},\\ e_{i}\leq\frac{1-\omega_{X}}{3}+\kappa_{X}\quad\text{on each M\"{o}bius % variable}.\end{gathered}

Here ∏iVi≥(∏ivi)/(1+ΔX)6\prod_{i}V_{i}\geq(\prod_{i}v_{i})/(1+\Delta_{X})^{6} and ∏iVi≤∏ivi<2⁢X\prod_{i}V_{i}\leq\prod_{i}v_{i}<2X. The Möbius bound follows from Vi≤mi≤2⁢X1/3V_{i}\leq m_{i}\leq 2X^{1/3}. The corner error is independent of the lower-cut exponent BB.

Use the window

𝒲=[60⁢σ, 1/3+14⁢σ].\mathcal{W}=[60\sigma,\,1/3+14\sigma].

A box is Type II if some ei∈𝒲e_{i}\in\mathcal{W}. Select the largest such eie_{i}, with ties broken by the fixed variable order. Suppose no exponent lies in 𝒲\mathcal{W}. A box is Type I-1 when it has exactly one large variable and that variable is not a Möbius variable. It is Type I-2 when it has exactly two large variables and neither is a Möbius variable. There are no other nonboundary boxes. In fact, a large Möbius variable would imply 14⁢σ≤κX−ωX/3≤σ/20214\sigma\leq\kappa_{X}-\omega_{X}/3\leq\sigma/202. If all variables were small, (B.21) would give 1−σ/101≤360⁢σ1-\sigma/101\leq 360\sigma. If three were large, it would give 1+42⁢σ≤1+σ/2021+42\sigma\leq 1+\sigma/202. Each is impossible.

Lemma B.3 (Lengths on retained Type-II boxes).

Let ℬ\mathcal{B} be a nonboundary Type-II box. Its selected cell is

[T,rX⁢T),rX=1+ΔX,[T,r_{X}T),\qquad r_{X}=1+\Delta_{X},

Let MM be the product of the other lower endpoints. At least one complementary cell is nonunit, since the source product exceeds H>N1/3+15⁢σH>N^{1/3+15\sigma} eventually. There are 1≤r≤51\leq r\leq 5 such cells. Set

(B.22) IT=(T,rX⁢T],NI=⌊rX⁢T⌋−⌊T⌋,MI=M⁢(rXr−1).I_{T}=(T,r_{X}T],\quad N_{I}=\lfloor r_{X}T\rfloor-\lfloor T\rfloor,\quad M_{I% }=M(r_{X}^{r}-1).

Then, for sufficiently large NN,

(B.23) NI≍T⁢LX−Cbox,MI≍(X/T)⁢LX−Cbox,N_{I}\asymp TL_{X}^{-C_{\rm box}},\qquad M_{I}\asymp(X/T)L_{X}^{-C_{\rm box}},

The PSDT interval ITI_{T} is contained in (T,2⁢T](T,2T]. It has exactly the same selected integer coefficients as the half-open cell [T,rX⁢T)[T,r_{X}T).

Proof. The real length of the selected cell is hN=T⁢ΔXh_{N}=T\Delta_{X}. Both

⌈rX⁢T⌉−⌈T⌉andNI\lceil r_{X}T\rceil-\lceil T\rceil\quad\hbox{and}\quad N_{I}

differ from hNh_{N} by less than 11. The only integer endpoints at which the half-open cell and ITI_{T} can differ are powers of two. Every internal mesh endpoint is 2a⁢2h/JX2^{a}2^{h/J_{X}} with 0<h<JX0<h<J_{X}, and is irrational. Write h/JX=u/vh/J_{X}=u/v in lowest terms with v>1v>1. If 2u/v2^{u/v} were rational, its 22-adic valuation would give u=v⁢v2⁢(2u/v)u=v\,v_{2}(2^{u/v}), contradicting (u,v)=1(u,v)=1. At powers of two the selected rough coefficient vanishes, since z0>2z_{0}>2. Thus the two integer conventions agree after multiplication by the coefficient.

Put

(B.24) σ⁢L≥2130⁢(Cbox+1)⁢(log⁡L+1).\sigma L\geq 2^{130}(C_{\rm box}+1)(\log L+1).

Then hN≥T/(3⁢LXCbox)>2h_{N}\geq T/(3L_{X}^{C_{\rm box}})>2, so NI≥T/(6⁢LXCbox)N_{I}\geq T/(6L_{X}^{C_{\rm box}}) and T/NI≤6⁢LXCbox≤6⁢LCboxT/N_{I}\leq 6L_{X}^{C_{\rm box}}\leq 6L^{C_{\rm box}}. Also ∏iVi≍X\prod_{i}V_{i}\asymp X, hence M≍X/TM\asymp X/T and MI≍LX−Cbox⁢MM_{I}\asymp L_{X}^{-C_{\rm box}}M, proving (B.23). Write x=logN⁡X=1−ωXx=\log_{N}X=1-\omega_{X}, ξ=logN⁡T\xi=\log_{N}T, and Σ2=logN⁡S\Sigma_{2}=\log_{N}S, Σ3=logN⁡R\Sigma_{3}=\log_{N}R for the slot scales in Lemma 4.3. The scale QslotQ_{\rm slot} is the first-slot scale in that lemma; QsuppQ_{\rm supp} is the modulus cutoff in (B.5). The inequalities in (4.9) and MI≍X⁢T−1⁢LX−CboxM_{I}\asymp XT^{-1}L_{X}^{-C_{\rm box}} give

(B.25) logN⁡(Qslot/T)\displaystyle\log_{N}(Q_{\rm slot}/T) ≤−(1+7271256)⁢σ<−29⁢σ⁢x,\displaystyle\leq-\left(1+\frac{7271}{256}\right)\sigma<-29\sigma x,
2⁢ξ+Σ2+2⁢Σ3\displaystyle 2\xi+\Sigma_{2}+2\Sigma_{3} ≤1−60⁢σ,\displaystyle\leq 1-60\sigma,
logN⁡MI⁢X−89⁢σQslot⁢R⁢S\displaystyle\log_{N}\frac{M_{I}X^{-89\sigma}}{Q_{\rm slot}RS} ≥x−2⁢ξ−Σ2−Σ3+(1+7271256)⁢σ−89⁢σ⁢x−o⁢(1)\displaystyle\geq x-2\xi-\Sigma_{2}-\Sigma_{3}+\left(1+\frac{7271}{256}\right)% \sigma-89\sigma x-o(1)
≥(7271256−28)⁢σ−ωX+Σ3+89⁢σ⁢ωX−o⁢(1)>0.\displaystyle\geq\left(\frac{7271}{256}-28\right)\sigma-\omega_{X}+\Sigma_{3}+% 89\sigma\omega_{X}-o(1)>0.

Here x=1−ωXx=1-\omega_{X}, ωX≤σ/202\omega_{X}\leq\sigma/202, and log⁡LX/L=o⁢(1)\log L_{X}/L=o(1) as N→∞N\to\infty for fixed σ,Cbox\sigma,C_{\rm box}. The terms o⁢(1)o(1) in (B.25) are taken in this sense. For fixed σ\sigma they are eventually smaller than σ/1000\sigma/1000. Thus Qslot<T⁢X−29⁢σQ_{\rm slot}<TX^{-29\sigma} and Qslot⁢R⁢S<MI⁢X−89⁢σQ_{\rm slot}RS<M_{I}X^{-89\sigma}. It follows that

(B.26) NI≥Qslot⁢Xσ/3,MI≥X1/2N_{I}\geq Q_{\rm slot}X^{\sigma/3},\qquad M_{I}\geq X^{1/2}

for all sufficiently large NN. For the first inequality, the ratio is at least

(6⁢LXCbox)−1⁢X(29−1/3)⁢σ;(6L_{X}^{C_{\rm box}})^{-1}X^{(29-1/3)\sigma};

for the second, use the bound T≤X1/3+15⁢σT\leq X^{1/3+15\sigma} of (B.30) in (B.23).

Let m0=M⁢(1+rXr)/2m_{0}=M(1+r_{X}^{r})/2, and let ϕ0\phi_{0} be the fixed smooth cutoff in (3.9). Then

ψI⁢(m)=ϕ0⁢(m−m0MI)\psi_{I}(m)=\phi_{0}\!\left(\frac{m-m_{0}}{M_{I}}\right)

equals 11 on [M,M⁢rXr][M,Mr_{X}^{r}] and is supported on [M−MI/2,M⁢rXr+MI/2][M-M_{I}/2,Mr_{X}^{r}+M_{I}/2]. It majorizes the full complementary interval without changing its length parameter.

Since T≥N60⁢σT\geq N^{60\sigma} and LX≤LL_{X}\leq L, (B.24) gives

T2−126≥12⁢LXCbox.T^{2^{-126}}\geq 12L_{X}^{C_{\rm box}}.

Together with NI≥T/(6⁢LXCbox)N_{I}\geq T/(6L_{X}^{C_{\rm box}}) this proves the integer-length condition

(B.27) NI≥(2⁢T)1−2−126.N_{I}\geq(2T)^{1-2^{-126}}.

This is the selected interval length hypothesis (LEN) in Section 3.2. □\square

The source cuts are constant on each retained box by the definition of a nonboundary box. Let n0n_{0} be a tested product in a retained Type-II box, and let T,M,rT,M,r be as in Lemma B.3. Every selected integer is at most rX⁢Tr_{X}T. The complementary cutoff ψI\psi_{I} is supported below M⁢[1+32⁢(rXr−1)]M[1+\tfrac{3}{2}(r_{X}^{r}-1)]. As T⁢M≤n0TM\leq n_{0} and 1≤r≤51\leq r\leq 5, their product is at most

n0⁢rX⁢[1+32⁢(rXr−1)]≤n0⁢(1+11⁢δX)≤(1−ε/2)⁢Nn_{0}r_{X}[1+\tfrac{3}{2}(r_{X}^{r}-1)]\leq n_{0}(1+11\delta_{X})\leq(1-% \varepsilon/2)N

for sufficiently large NN, using ΔX≤δX→0\Delta_{X}\leq\delta_{X}\to 0. Thus on this enlarged support the upper cut leaves

(B.28) a−m⁢n≥ε⁢N/2≥X⁢(log⁡X)−Cbox.a-mn\geq\varepsilon N/2\geq X(\log X)^{-C_{\rm box}}.

The final inequality follows from X<NX<N and δX=(log⁡X)−Cbox<ε/2\delta_{X}=(\log X)^{-C_{\rm box}}<\varepsilon/2. Thus the resonant class is absent. Also a≤X1+σ/20a\leq X^{1+\sigma/20} for all sufficiently large NN.

For each fixed Iwaniec vector, Lemma 4.3 and the exact slot identity (4.13) give the three-factor coefficient required by (3.5). The smooth-only term has all three prime slots empty. Every tail factor is at least Y=Nθ⁢σ2>Nℓ0⁢σ2=u0Y=N^{\theta\sigma^{2}}>N^{\ell_{0}\sigma^{2}}=u_{0}. This is the roughness threshold u0u_{0} of (3.2), which bounds the tail cutoff uLu_{L} in C1. The smooth divisor is attached to the first slot. The Section 4 packing lemma verifies the spectral inequality (3.7) directly, as displayed in (4.9). Separately, (B.25)–(B.26) verify the modulus and interval inequalities in (3.6); (B.27) gives the integer-length condition (LEN), and (B.30) gives the selected-window bounds used below. Also

logX⁡N=11−ωX≤1+σ20,\log_{X}N=\frac{1}{1-\omega_{X}}\leq 1+\frac{\sigma}{20},

and logX⁡T≤1/3+15⁢σ\log_{X}T\leq 1/3+15\sigma by the first inequality in (B.30) below. The selected window also gives X60⁢σ≤TX^{60\sigma}\leq T.

The interior estimate

Let EintE_{\rm int} be the sum of the HB contributions on retained Type-I-1, Type-I-2, and Type-II boxes. It is taken after the finite Iwaniec vector sum. The arguments above prove

(B.29) |∑qwNν⁢(q)⁢ΔD⁢(q;a)|≤Cσ(NL/Y+N1/2+o⁢(1)+NL18−Cbox+NL16−Cbox/2)+|Eint|.\begin{split}\left|\sum_{q}w_{N}^{\nu}(q)\Delta_{D}(q;a)\right|\\ \leq C_{\sigma}\bigl{(}NL/Y+N^{1/2+o(1)}+NL^{18-C_{\rm box}}\\ +NL^{16-C_{\rm box}/2}\bigr{)}+|E_{\rm int}|.\par\end{split}

The first two errors in (B.29) have fixed power savings. The choice Cbox≥⌈2⁢A+32⌉C_{\rm box}\geq\lceil 2A+32\rceil in Theorem 1.2 makes the last two O⁢(N⁢L−A)O(NL^{-A}). Both estimates are over the union of tuples.

The tested measure μD\mu_{D} is the prime indicator on the interval of (B.1). It does not depend on the Iwaniec vector. The sieve factors belong to the modulus coefficient in (W). The prime-detection and rough Heath–Brown identities are (B.7)–(B.10). Every variable, including the logarithmic one, is z0z_{0}-rough. The prime-power terms are estimated before the box partition.

The exponent constraints (B.20)–(B.21) imply that the residual cells are empty by the three contradictions above. The Type-II selected exponent obeys

(B.30) logX⁡T\displaystyle\log_{X}T ≤1/3+14⁢σ1−ωX≤1/3+15⁢σ,\displaystyle\leq\frac{1/3+14\sigma}{1-\omega_{X}}\leq 1/3+15\sigma,
1−ωX2−logN⁡T\displaystyle\frac{1-\omega_{X}}{2}-\log_{N}T ≥16−(15+1/202)⁢σ>0.\displaystyle\geq\frac{1}{6}-(15+1/202)\sigma>0.

The second line records T<X1/2T<X^{1/2}, the Type-II upper-length condition; the first line supplies the sharper bound used in (B.23). By (B.2), its extension to w~Nν\widetilde{w}_{N}^{\nu} and w^Nν\widehat{w}_{N}^{\nu} after (B.5), and the parameter choice in Theorem 1.2, q<NeQq<N^{e_{Q}} with eQ<Θ⁢(u)≤Θ⁢(0)=153/256<0.6e_{Q}<\Theta(u)\leq\Theta(0)=153/256<0.6. For a Type-I-1 box, (3.100) with eQ<153/256e_{Q}<153/256 gives e∗−eQ−(1−ωX)/10>0.3023e_{*}-e_{Q}-(1-\omega_{X})/10>0.3023. Take a Type-I-2 box. At most four of its at most six variables are small, each with ei<60⁢σe_{i}<60\sigma. Their product mm has upper endpoint at most N240⁢σ⁢(1+ΔX)4≤N240⁢σ+κXN^{240\sigma}(1+\Delta_{X})^{4}\leq N^{240\sigma+\kappa_{X}}, so logN⁡M≤240⁢σ+κX\log_{N}M\leq 240\sigma+\kappa_{X}. Since logN⁡X=1−ωX\log_{N}X=1-\omega_{X}, q<NeQq<N^{e_{Q}}, κX,ωX≤σ/202\kappa_{X},\omega_{X}\leq\sigma/202 by (B.20), and 0<σ≤10−100<\sigma\leq 10^{-10},

logX⁡M\displaystyle\log_{X}M ≤240⁢σ+κX1−ωX≤(240+1/202)⁢σ1−σ/202<2.401⋅10−8,\displaystyle\leq\frac{240\sigma+\kappa_{X}}{1-\omega_{X}}\leq\frac{(240+1/202% )\sigma}{1-\sigma/202}<2.401\cdot 10^{-8},
logX⁡q\displaystyle\log_{X}q <eQ1−ωX<153/2561−σ/202<0.5977.\displaystyle<\frac{e_{Q}}{1-\omega_{X}}<\frac{153/256}{1-\sigma/202}<0.5977.

Also N1,N2≥X1/3N_{1},N_{2}\geq X^{1/3} by the large-variable definition, and N1⁢N2⁢M≤230⁢XN_{1}N_{2}M\leq 2^{30}X by the Heath–Brown product support and its dyadic scale convention. Hence (3.101) holds, and with (B.30) and (3.100) the hypotheses (3.99)–(3.101) of the Type-I lemmas hold.

The packing lemmas give, for each Iwaniec vector, the exact three-slot coefficient and the packing inequalities (3.6)–(3.7). They include the empty-tail term and retain repeated-prime multiplicity before the mask error (B.6). The selected rough unit, Möbius and normalized-log coefficients are the three classes in (3.8). The proof of (3.25) in Section 3 applies to each class, with every auxiliary coprimality parameter dd and every subinterval. Its bound is T⁢τ⁢(d)⁢L−ASWT\tau(d)L^{-A_{\rm SW}} for every fixed ASW>0A_{\rm SW}>0. Its application to α(r)\alpha^{(r)} and the small-norm case in (3.47)–(3.48) give the norm-normalized BFI passage. The complementary short-interval second moment and the remaining dispersion steps are those of Theorem 3.2. On these boxes, (B.22)–(B.28) verify their interval, smoothing and nonresonance data. In the local theorem take Kscale=B+1K_{\rm scale}=B+1. In particular X>N/(2⁢LB)X>N/(2L^{B}) and a≤N⁢L/3a\leq NL/3 imply a≤(2/3)⁢X⁢LB+1≤X1+σ/20a\leq(2/3)XL^{B+1}\leq X^{1+\sigma/20} for large NN. The comparator is the natural PSDT comparator on every HB product. No coprimality of a composite product is asserted.

For the chosen width, the global box count in (3.91) has K0=24⁢Cbox+26K_{0}=24C_{\rm box}+26. The source labels, Iwaniec vectors and prefix cells number Oσ⁢(1)O_{\sigma}(1), and the HB coefficients are O⁢(1)O(1). There are at most six variables. So there are O⁢(L6)O(L^{6}) dyadic tuples, within the O⁢(L24)O(L^{24}) of §3.10, and each dyadic tuple contains O⁢(L6⁢Cbox)O(L^{6C_{\rm box}}) short boxes, within the O⁢(L24⁢Cbox)O(L^{24C_{\rm box}}) there. This verifies (H7) for the prime source. Choose the local Type-II precision A′=K0+A+5=A+24⁢Cbox+31A^{\prime}=K_{0}+A+5=A+24C_{\rm box}+31 and Awork=A′+4A_{\rm work}=A^{\prime}+4, as in (3.92). Then Theorem 3.2 with (H7), that is (3.92), bounds the sum over all Type-II boxes. The bound is O⁢(N⁢L−A−5)O(NL^{-A-5}) plus a fixed power-saving term. Lemmas 3.3 and 3.5 give O⁢(N⁢L−A)O(NL^{-A}) for Type-I-1 and Type-I-2 when requested with Ai=KI+A+5A_{i}=K_{I}+A+5 and KI=6⁢(Cbox+1)+2K_{I}=6(C_{\rm box}+1)+2. Thus

(B.31) |Eint|≪N⁢L−A+N1−cσ⁢LK0+C,cσ=ℓ0⁢σ2/4>0.|E_{\rm int}|\ll NL^{-A}+N^{1-c_{\sigma}}L^{K_{0}+C},\qquad c_{\sigma}=\ell_{0% }\sigma^{2}/4>0.

Here C=C⁢(σ,Cbox,A′,Kscale,𝒞src)C=C(\sigma,C_{\rm box},A^{\prime},K_{\rm scale},\mathcal{C}_{\rm src}) is the logarithmic exponent from (3.13). Here the local spectral, restoration, endpoint and slot-localization costs are included once in Theorem 3.2.

Proposition B.4 (Iwaniec prime-source estimate).

Take the parameters of Theorem 1.2, either Iwaniec sign ν\nu, and a sufficiently large even NN. Let wNνw_{N}^{\nu} be the exact coefficient (W). Let aa satisfy the residue conditions of Theorem 1.2, and let ΔD\Delta_{D} be (B.1). First split off the LOG correction algebraically. Then every remaining source summand is assigned exactly once to one class. The classes are mask, proper-power, boundary, Type-II, Type-I-1 and Type-I-2. Every retained box has the scale and coefficient properties stated above, and

(B.32) |∑qwNν⁢(q)⁢ΔD⁢(q;a)|≪σ,A,u,θ,B,ε,CboxN⁢L−A.\left|\sum_{q}w_{N}^{\nu}(q)\Delta_{D}(q;a)\right|\ll_{\sigma,A,u,\theta,B,% \varepsilon,C_{\rm box}}NL^{-A}.

Proof. The Iwaniec mask partition and support are (B.2)–(B.6). The explicit identities (B.7)–(B.11) partition the remaining tested measure into proper powers and HB tuples. The equal-ratio mesh puts each tuple in exactly one box. A face-straddling box belongs to the boundary class. On every other box both source predicates are constant. The exponent-polytope argument above puts every nonempty such box in exactly one of II, I-1 and I-2. The displayed tie rule selects one II factor. LOG is split off algebraically before that assignment. The errors are (B.6), (B.8), (B.18), (B.19) and (B.31). Their sum is Oσ,A,u,θ,B,ε,Cbox⁢(N⁢L−A)O_{\sigma,A,u,\theta,B,\varepsilon,C_{\rm box}}(NL^{-A}). □\square

Use of AI tools

The author devised the method of proof. Codex (OpenAI) and Claude Code (Anthropic) are the AI tools used. They assisted with derivation checks, code, typesetting, and review. The author checked every proof step, table, and reference. The author takes full responsibility for the content of the paper.

Statements and declarations

Competing interests. The author declares no competing interests.

Funding. No external funding was received.

Data availability. No external data or numerical computations are used in the proof. Appendix A records analytic source checks and their scope.

References

  • [1] J. D. Lichtman, Primes in arithmetic progressions to large moduli, and Goldbach beyond the square-root barrier, arXiv:2309.08522v1, 2023 (with an appendix by S. Drappeau and J. D. Lichtman).
  • [2] E. Bombieri, On the large sieve, Mathematika 12 (1965), no. 2, 201–225. DOI: 10.1112/S0025579300005313.
  • [3] A. I. Vinogradov, The density hypothesis for Dirichlet LL-series (in Russian), Izv. Akad. Nauk SSSR Ser. Mat. 29 (1965), no. 4, 903–934. MR0197414.
  • [4] P. Shiu, A Brun–Titchmarsh theorem for multiplicative functions, J. Reine Angew. Math. 313 (1980), 161–170. DOI: 10.1515/crll.1980.313.161.
  • [5] J.-M. Deshouillers and H. Iwaniec, Kloosterman sums and Fourier coefficients of cusp forms, Invent. Math. 70 (1982), no. 2, 219–288. DOI: 10.1007/BF01390728.
  • [6] E. Bombieri, J. B. Friedlander and H. Iwaniec, Primes in arithmetic progressions to large moduli, Acta Math. 156 (1986), 203–251. DOI: 10.1007/BF02399204.
  • [7] J. Maynard, Primes in arithmetic progressions to large moduli II: Well-factorable estimates, Mem. Amer. Math. Soc. 306 (2025), no. 1543. DOI: 10.1090/memo/1543; the theorem numbering cited here is from arXiv:2006.07088v1.
  • [8] A. Pascadi, On the exponents of distribution of primes and smooth numbers, arXiv:2505.00653v2, 2025.
  • [9] S. Drappeau, Sums of Kloosterman sums in arithmetic progressions, and the error term in the dispersion method, Proc. Lond. Math. Soc. 114 (2017), no. 4, 684–732. DOI: 10.1112/plms.12022; arXiv:1504.05549v4.
  • [10] H. Iwaniec, A new form of the error term in the linear sieve, Acta Arith. 37 (1980), 307–320. DOI: 10.4064/aa-37-1-307-320.
  • [11] H. Iwaniec, Rosser’s sieve, Acta Arith. 36 (1980), no. 2, 171–202. DOI: 10.4064/aa-36-2-171-202.
  • [12] D. R. Heath-Brown, Prime numbers in short intervals and a generalized Vaughan identity, Canad. J. Math. 34 (1982), no. 6, 1365–1377. DOI: 10.4153/CJM-1982-095-9.
  • [13] H. H. Kim, Functoriality for the exterior square of G⁢L4GL_{4} and the symmetric fourth of G⁢L2GL_{2}, J. Amer. Math. Soc. 16 (2003), 139–183; Appendix 2 by H. H. Kim and P. Sarnak, pp. 175–181. DOI: 10.1090/S0894-0347-02-00410-1.
  • [14] P. Deligne, La conjecture de Weil. I, Publ. Math. IHÉS 43 (1974), 273–307. DOI: 10.1007/BF02684373.
  • [15] A. Weil, On some exponential sums, Proc. Nat. Acad. Sci. USA 34 (1948), 204–207. DOI: 10.1073/pnas.34.5.204.
  • [16] T. Estermann, On Kloosterman’s sum, Mathematika 8 (1961), no. 1, 83–86. DOI: 10.1112/S0025579300002187.
  • [17] H. Iwaniec and E. Kowalski, Analytic Number Theory, AMS Colloquium Publications 53, AMS, Providence, RI, 2004. DOI: 10.1090/coll/053.
  • [18] J. Friedlander and H. Iwaniec, On Bombieri’s asymptotic sieve, Ann. Scuola Norm. Sup. Pisa Cl. Sci. (4) 5 (1978), 719–756.
  • [19] E. Fouvry and H. Iwaniec, On a theorem of Bombieri–Vinogradov type, Mathematika 27 (1980), no. 2, 135–152. DOI: 10.1112/S0025579300010032.
  • [20] E. Fouvry and H. Iwaniec, Primes in arithmetic progressions, Acta Arith. 42 (1983), no. 2, 197–218. DOI: 10.4064/aa-42-2-197-218.
  • [21] J. Maynard, Primes in arithmetic progressions to large moduli I: Fixed residue classes, Mem. Amer. Math. Soc. 306 (2025), no. 1542. DOI: 10.1090/memo/1542.
  • [22] J. Maynard, Primes in arithmetic progressions to large moduli III: Uniform residue classes, Mem. Amer. Math. Soc. 306 (2025), no. 1544. DOI: 10.1090/memo/1544.
  • [23] S. Drappeau, K. Pratt and M. Radziwiłł, One-level density estimates for Dirichlet LL-functions with extended support, Algebra Number Theory 17 (2023), no. 4, 805–830. DOI: 10.2140/ant.2023.17.805.
  • [24] E. Assing, V. Blomer and J. Li, Uniform Titchmarsh divisor problems, Adv. Math. 393 (2021), article 108076. DOI: 10.1016/j.aim.2021.108076.
  • [25] J. D. Lichtman, A modification of the linear sieve, and the count of twin primes, Algebra Number Theory 19 (2025), no. 1, 1–38. DOI: 10.2140/ant.2025.19.1; arXiv:2109.02851v2.
  • [26] N. V. Kuznetsov, Petersson’s conjecture for cusp forms of weight zero and Linnik’s conjecture. Sums of Kloosterman sums, Original Russian version: Mat. Sb. (N.S.) 111(153) (1980), no. 3, 334–383. English transl., Math. USSR-Sb. 39 (1981), no. 3, 299–342. DOI: 10.1070/SM1981v039n03ABEH001518.
  • [27] R. W. Bruggeman, Fourier coefficients of cusp forms, Invent. Math. 45 (1978), no. 1, 1–18. DOI: 10.1007/BF01406220.
  • [28] Yu. V. Linnik, The dispersion method in binary additive problems, translated by S. Schuur, Translations of Mathematical Monographs 4, American Mathematical Society, Providence, RI, 1963. Reprint record, DOI: 10.1090/mmono/004.
  • [29] NIST Digital Library of Mathematical Functions, §10.43(v), equations (10.43.30)–(10.43.31), https://dlmf.nist.gov/10.43.v.
  • [30] J. Friedlander and H. Iwaniec, Opera de Cribro, AMS Colloquium Publications 57, 2010. DOI: 10.1090/coll/057.