Contents

Theorem (1 + 1.75) on the Goldbach conjecture

Ruiyi Zhang Independent Researcher, Columbia, Maryland, USA
(Date: November 13, 2026)
Abstract.

Every sufficiently large even integer NN has a representation N=p+r⁢qN=p+rq, where p,qp,q are prime, r=1r=1 or prime, and r≤qa−1=q3/4r\leq q^{a-1}=q^{3/4}. In the terminology of Li and Liu, this proves Proposition (1+a)(1+a) for a=1.75=7/4a=1.75=7/4. A weighted sieve combines thirteen signed row estimates with a switched upper bound. The directed comparison gives DB>1.967088903489691335582703173494D_{B}>1.967088903489691335582703173494 and cK⁢2,G⁢0⁢I⁢(b)<1.966859949178424046530804965344c_{K2,G0}I(b)<1.966859949178424046530804965344. The exact margin enclosure is DB−cK⁢2,G⁢0⁢I⁢(b)>0.000228954311267289051898208151D_{B}-c_{K2,G0}I(b)>0.000228954311267289051898208151.

Key words and phrases:
Goldbach problem, sieve methods, primes in arithmetic progressions, automorphic forms
2020 Mathematics Subject Classification:
Primary 11P32; Secondary 11N36, 11N35

1. Introduction

We represent large even integers by two primes and one factor. Write ℙ\mathbb{P} for the primes. Chen’s theorem represents every sufficiently large even integer as a prime plus an integer with at most two prime factors [5]. Paper II supplies the quantitative smaller-factor starting point and the signed sieve sums used here. We change the exterior and switched coefficients and add retained and sixth-sum gains. Table 1.1 lists their separate costs. We use the terminology Proposition (1+a)(1+a) introduced by Li and Liu [19, p. 2, (1.6)]. Runbo Li proved lower bounds for D1,2⁢(N)D_{1,2}(N) [29]; we do not use that result.

Cai established a small-prime variant of Chen’s theorem [4]. Wu developed Chen’s double sieve for Goldbach and twin-prime problems [30]. His later paper continues this double-sieve program [31]. Lichtman modified the linear sieve and studied bounds for the twin-prime counting function [20]. He also proved results on large-modulus distribution and Goldbach beyond the square-root barrier [21]. Maynard’s first paper proves large-modulus estimates for fixed residue classes [22]. His second gives well-factorable estimates in that setting [23]. His third treats estimates uniform over residue classes [24]. Pascadi studies exponents of distribution for primes and smooth numbers [28]. Li and Liu proved Proposition (1+1.9)(1+1.9), with a lower bound for D1,1.9⁢(N)D_{1,1.9}(N) [19, Theorem 1.1]. The present proof does not use their estimates.

Theorem 1 (Representation theorem).

Let σ∗\sigma_{*} be a rational number satisfying (9.14), and let N0∗⁢(σ∗)N_{0}^{*}(\sigma_{*}) be the threshold (2.5). Then every even N≥N0∗⁢(σ∗)N\geq N_{0}^{*}(\sigma_{*}) admits

(1.1) N=p+r⁢q,p,q∈ℙ,r∈{1}∪ℙ,r≤qa−1=q3/4.N=p+rq,\qquad p,q\in\mathbb{P},\qquad r\in\{1\}\cup\mathbb{P},\qquad r\leq q^{% a-1}=q^{3/4}.

Section 5 proves the retained comparison (A1) of Table 1.2. Section 6 proves the sixth-sum estimate (A2). Section 7 proves the exterior comparison (A3). Section 8 proves the switched comparison (A4). The constant bounds (A5) follow from the cited Paper I and Paper II estimates, including Paper I, Theorem 2.6, (2.31) [26, Theorem 2.6, (2.31)]. Hence a rational σ∗\sigma_{*} as in the theorem exists; N0∗⁢(σ∗)N_{0}^{*}(\sigma_{*}) may be ineffective.

The proof uses Paper I, [26, Theorems 2.6, 2.8, 3.2 and 4.1], and Paper II, [27, (1.7)–(1.12), (6.4)–(6.4d)]. We restate each input below with its precise scope.

1.1. A positive count

Put

(1.2) ε=110000,a=74,b=37−1106=29999937000000.\varepsilon=\frac{1}{10000},\qquad a=\frac{7}{4},\qquad b=\frac{3}{7}-\frac{1}% {10^{6}}=\frac{2999993}{7000000}.

Define

(1.3) 𝒜N\displaystyle\mathcal{A}_{N} ={N−p:p∈ℙ,p<(1−ε)⁢N},\displaystyle=\{N-p:p\in\mathbb{P},\ p<(1-\varepsilon)N\},
𝒫b\displaystyle\mathcal{P}_{b} =ℙ∪{r⁢q:r,q∈ℙ,r≤q,r<Nb},\displaystyle=\mathbb{P}\cup\{rq:r,q\in\mathbb{P},\ r\leq q,\ r<N^{b}\},
Gb⁢(N)\displaystyle G_{b}(N) =#⁢(𝒜N∩𝒫b).\displaystyle=\#(\mathcal{A}_{N}\cap\mathcal{P}_{b}).

For a counted semiprime,

(1.4) q>ε⁢N1−b,q3/4>ε3/4⁢Nb+κtr≥Nb>r(N≥Ntr).\begin{gathered}q>\varepsilon N^{1-b},\\ q^{3/4}>\varepsilon^{3/4}N^{b+\kappa_{\mathrm{tr}}}\geq N^{b}>r\qquad(N\geq N_% {\mathrm{tr}}).\end{gathered}

The transfer parameters are defined in (2.3), and Lemma 9.2 proves (1.4). A counted prime gives r=1r=1. Hence Gb⁢(N)>0G_{b}(N)>0 implies (1.1).

Use Paper II’s normalization in (2.2) [27, (1.2), §6.1]. The convergent product gives C2>0C_{2}>0. Thus W⁢(N)>0W(N)>0.

1.2. The comparisons

Use the sums of Paper II [27, (1.7)–(1.11)]. Put

(1.5) R=\displaystyle R={} 3⁢S1−2⁢S3−S4−S5−S7+S8+S9+S10−2⁢S11−S12−S13,\displaystyle 3S_{1}-2S_{3}-S_{4}-S_{5}-S_{7}+S_{8}+S_{9}+S_{10}-2S_{11}-S_{12% }-S_{13},
ΣW=\displaystyle\Sigma_{W}={} R+S2−S6−Ssw,\displaystyle R+S_{2}-S_{6}-S_{\mathrm{sw}},
Bb⁢(N)=\displaystyle B_{b}(N)={} ∑r,q∈ℙNb≤r≤Nε⁢N<r⁢q<N1N−r⁢q∈ℙ.\displaystyle\sum_{\begin{subarray}{c}r,q\in\mathbb{P}\\ N^{b}\leq r\leq\sqrt{N}\\ \varepsilon N<rq<N\end{subarray}}1_{N-rq\in\mathbb{P}}.

Here S2S_{2} is the complete Paper II sum. All original coprimality conditions remain imposed. The last sum counts each eligible ordered prime pair; both orientations are counted only when both satisfy the displayed cutoff, and a square is counted once. Here R=RfixR=R_{\mathrm{fix}} and ΣW=𝒲\Sigma_{W}=\mathcal{W} in Section 4.

Write J¯6\overline{J}_{6} for Paper II’s sixth upper endpoint [27, (6.1), (6.3a)]. For the optional sharper arithmetic comparison, record

(1.6) I⁢(b)=log⁡1−bb,c=68342823671328463483589303809568258464426836291045.\begin{gathered}I(b)=\log\frac{1-b}{b},\\ c=\frac{6834282367132846348358930380956825846442683629}{10^{45}}.\end{gathered}

Both the exterior and switched comparisons use the common coefficient

(1.7) cK⁢2,G⁢0=68368251638755177562868463216507543729310946891045.c_{K2,G0}=\frac{6836825163875517756286846321650754372931094689}{10^{45}}.

Its definition and source comparison are (7.36) and (7.67). Put

(1.8) DII\displaystyle D_{\mathrm{II}} =4584991633800917059325000000000000000000,\displaystyle=\frac{45849916338009170593}{25000000000000000000},
H¯\displaystyle\overline{H} =3892535000000,\displaystyle=\frac{389253}{5000000},
M5,internal\displaystyle M_{5,\mathrm{internal}} =−Khi⁢6073714261109−LG⁢1,\displaystyle=-K_{\mathrm{hi}}\frac{6073714261}{10^{9}}-L_{G1},
gRA,lo\displaystyle g_{\mathrm{RA,lo}} =9895983531010,\displaystyle=\frac{989598353}{10^{10}},
Δ⁢DL⁢3\displaystyle\Delta D_{L3} =(2−cK⁢2,G⁢04)⁢H¯.\displaystyle=\left(2-\frac{c_{K2,G0}}{4}\right)\overline{H}.

The two mass constants are

(1.9) Khi\displaystyle K_{\mathrm{hi}} =39894807910705784663904430098309337537484429474781101122231058,\displaystyle=\frac{3989480791070578466390443009830933753748442947478110112223% }{10^{58}},
LG⁢1\displaystyle L_{G1} =−243950428265194656254206921939947762868871361874409552095097100433627766186892221372630771322662657637687111424552206336.\displaystyle=-\frac{243950428265194656254206921939947762868871361874409552095% 097}{100433627766186892221372630771322662657637687111424552206336}.

These are Paper II, (A.10d) and (4.84), respectively [27, (A.10d), (4.84)]. The constant H¯\overline{H} bounds the switched integral. It differs from the packing ceiling 153/256153/256. The exact rational cO1c_{\mathrm{O1}} is (8.60), with Table 8.1. It and cc belong to the optional certificate comparison only; neither is used to price the main count. The sixth-sum comparison uses the certified floor gRA,log_{\mathrm{RA,lo}}. The integral gain is denoted 𝔤RA\mathfrak{g}_{\mathrm{RA}}, with certified enclosure [0.0989598353353,0.0989598353355][0.0989598353353,0.0989598353355] in Section 6. Thus gRA,log_{\mathrm{RA,lo}} is rational and gRA,lo≤𝔤RAg_{\mathrm{RA,lo}}\leq\mathfrak{g}_{\mathrm{RA}}. It is neither the integral nor its central estimate.

The required comparisons are

(1.10) 4⁢Gb⁢(N)\displaystyle 4G_{b}(N) ≥ΣW−4⁢Bb⁢(N)−W⁢(N)⁢Eexc⁢(N),\displaystyle\geq\Sigma_{W}-4B_{b}(N)-W(N)E_{\mathrm{exc}}(N),
R+S2W⁢(N)\displaystyle\frac{R+S_{2}}{W(N)} ≥DII+J¯6+2⁢H¯+5719106\displaystyle\geq D_{\mathrm{II}}+\overline{J}_{6}+2\overline{H}+\frac{5719}{1% 0^{6}}
+M5,internal−E′⁢(N;σ),\displaystyle\qquad+M_{5,\mathrm{internal}}-E^{\prime}(N;\sigma),
S6W⁢(N)\displaystyle\frac{S_{6}}{W(N)} ≤J¯6−gRA,lo+ERA⁢(N;σ),\displaystyle\leq\overline{J}_{6}-g_{\mathrm{RA,lo}}+E_{\mathrm{RA}}(N;\sigma),
SswW⁢(N)\displaystyle\frac{S_{\mathrm{sw}}}{W(N)} ≤cK⁢2,G⁢04⁢H¯+Esw⁢(N;σ).\displaystyle\leq\frac{c_{K2,G0}}{4}\overline{H}+E_{\mathrm{sw}}(N;\sigma).

These errors are nonnegative by (5.2), (6.72) and (8.71); the first includes the inherited envelope EvanE_{\mathrm{van}}. Use the following error identifications:

(1.11) Eexc⁢(N)\displaystyle E_{\mathrm{exc}}(N) =4⁢Ept⁢(N)W⁢(N),\displaystyle=\frac{4E_{\mathrm{pt}}(N)}{W(N)},
Esw⁢(N;σ)\displaystyle E_{\mathrm{sw}}(N;\sigma) =Csw⁢σ+Psw⁢σ9+Vsw⁢(N;σ).\displaystyle=C_{\mathrm{sw}}\sigma+P_{\mathrm{sw}}\sigma^{9}+V_{\mathrm{sw}}(% N;\sigma).

Here EptE_{\mathrm{pt}} is (4.12). The switched quantities are (8.61) and (8.71). Their estimates form input (A4). The retained error includes the conversion errors:

(1.12) E′⁢(N;σ)=\displaystyle E^{\prime}(N;\sigma)={} Evan⁢(N;σ)+∑j∈ℋ(|Λj,N0|+|Λj,N|)\displaystyle E_{\mathrm{van}}(N;\sigma)+\sum_{j\in\mathcal{H}}\bigl{(}|% \Lambda^{0}_{j,N}|+|\Lambda_{j,N}|\bigr{)}
+|ΛG,N|.\displaystyle+|\Lambda_{G,N}|.

The row set ℋ\mathcal{H} is defined in (5.2). Its two qualified labels denote S5S_{5}’s lower part and retained S10S_{10}. The inherited error EvanE_{\mathrm{van}} is (5.11); the saved-array contribution Λj,N0\Lambda^{0}_{j,N} is included once, as in (5.2). The differences Δj\Delta_{j} are (5.22). The conversion arrays are (5.35) and (5.56); the equivalent notation Λj,N=ΛN⁢(Δj)\Lambda_{j,N}=\Lambda_{N}(\Delta_{j}) and ΛG,N=ΛN⁢(ΔG1)\Lambda_{G,N}=\Lambda_{N}(\Delta_{G_{1}}) is fixed in (5.3). The saved-array identifications and conversion bounds are proved in Section 5, as part of (A1). The two finite integral bounds are Propositions B.1 and B.2.

The exterior estimate required is

(1.13) −4⁢Bb⁢(N)W⁢(N)≥−cK⁢2,G⁢0⁢I⁢(b)−EK⁢(N;b,σ),EK⁢(N;b,σ)≥0.-\frac{4B_{b}(N)}{W(N)}\geq-c_{K2,G0}I(b)-E_{K}(N;b,\sigma),\qquad E_{K}(N;b,% \sigma)\geq 0.

Its convolution input is Paper II, [27, Lemma 5.1, (5.44)–(5.52)].

Define the constant by

(1.14) DB=DII+5719106+M5,internal+gRA,lo−110000+Δ⁢DL⁢3.\boxed{\begin{aligned} D_{B}={}&D_{\mathrm{II}}+\frac{5719}{10^{6}}+M_{5,% \mathrm{internal}}\\ &+g_{\mathrm{RA,lo}}-\frac{1}{10000}+\Delta D_{L3}.\end{aligned}}

Table 1.1 records each summand. Its decimals are rounded; the defining formulas are exact.

Table 1.1. Components of DBD_{B}
Component Value Definition
DIID_{\mathrm{II}} 1.8339966535203671.833996653520367 (1.8)
5719/1065719/10^{6} 0.0057190.005719 (5.25)
M5,internalM_{5,\mathrm{internal}} 0.0058749499450260.005874949945026 (1.8), (1.9)
gRA,log_{\mathrm{RA,lo}} 0.09895983530.0989598353 (1.8)
−1/10000-1/10000 −0.0001-0.0001 (1.14)
Δ⁢DL⁢3\Delta D_{L3} 0.0226384647242980.022638464724298 (1.8)
DBD_{B} 1.9670889034896911.967088903489691 (1.14)
1.967088903489691335582703173494<DB1.967088903489691335582703173494<D_{B}
DB<1.967088903489691335582703173495D_{B}<1.967088903489691335582703173495

Suppose the optional six-endpoint estimate is available. Then Proposition 5.10 would add g6=0.0020549454896034927680⁢…g_{6}=0.0020549454896034927680\ldots of (5.18) to the retained comparison. The assembled retained-count lower bound below would then increase by g6g_{6}. Theorem 1 does not use this. Let

(1.15) ℰB=E′+ERA+Esw+EK+Eexc,δerr=110000.\mathcal{E}_{B}=E^{\prime}+E_{\mathrm{RA}}+E_{\mathrm{sw}}+E_{K}+E_{\mathrm{% exc}},\qquad\delta_{\mathrm{err}}=\frac{1}{10000}.

Adding the established comparisons gives

(1.16) 4⁢Gb⁢(N)W⁢(N)≥DB+δerr−cK⁢2,G⁢0⁢I⁢(b)−ℰB⁢(N;b,σ).\frac{4G_{b}(N)}{W(N)}\geq D_{B}+\delta_{\mathrm{err}}-c_{K2,G0}I(b)-\mathcal{% E}_{B}(N;b,\sigma).

By (A1)–(A5), Proposition 9.1 proves

(1.17) ℰB⁢(N;b,σ∗)≤δerr(N≥N0∗⁢(σ∗),N∈2⁢ℤ).\mathcal{E}_{B}(N;b,\sigma_{*})\leq\delta_{\mathrm{err}}\qquad(N\geq N_{0}^{*}% (\sigma_{*}),\ N\in 2\mathbb{Z}).

Table 1.2 lists the five inputs, their exact statements and their contributions to the final constant. The first-line source count in (1.10) is (4.13), valid for N≥Npt=1012+1N\geq N_{\mathrm{pt}}=10^{12}+1. Lemma 9.2 gives Npt<Ntr≤N0∗⁢(σ∗)N_{\mathrm{pt}}<N_{\mathrm{tr}}\leq N_{0}^{*}(\sigma_{*}).

Table 1.2. Analytic inputs and their contributions
Input Exact statement and use Contribution and error
A1 Retained comparison (5.2) with g6g_{6} replaced by 0, Proposition 5.10, at σ=σ∗\sigma=\sigma_{*}; used in line 2 of (1.10); proved in Section 5. +5719/106+M5,internal+5719/10^{6}+M_{5,\mathrm{internal}}; error E′E^{\prime}.
A2 Proposition 6.12 at σ=σ∗\sigma=\sigma_{*}, giving the sixth-sum estimate (6.72) of Proposition 6.13; used in line 3 of (1.10). +gRA,lo+g_{\mathrm{RA,lo}}; error ERAE_{\mathrm{RA}}.
A3 Proposition 7.4 at σ=σ∗\sigma=\sigma_{*}, giving the exterior estimate (7.67) of Proposition 7.5; used in (1.13). −cK⁢2,G⁢0⁢I⁢(b)-c_{K2,G0}I(b); error AK⁢CAA⁢σ+PK⁢σ9+rKA_{K}C_{\mathrm{AA}}\sigma+P_{K}\sigma^{9}+r_{K}.
A4 The sieve data and the estimates (8.8), (8.53) and (8.62) of Section 8 for the source (8.3), at σ=σ∗\sigma=\sigma_{*}, giving the switched estimate (8.72) and the limit (8.73); used in line 4 of (1.10). This application uses Paper I, Theorem 2.8, at its stated inner spectral stage. +Δ⁢DL⁢3+\Delta D_{L3}; error Csw⁢σ+Psw⁢σ9+VswC_{\mathrm{sw}}\sigma+P_{\mathrm{sw}}\sigma^{9}+V_{\mathrm{sw}}.
A5 The constants CEC_{E} in (8.25) and CAAC_{\mathrm{AA}} in (7.39) are finite, positive and independent of σ\sigma and NN, and CE≥CEIIC_{E}\geq C_{E}^{\mathrm{II}}. Fixes the caps in (9.14).

The constants CEC_{E} and CAAC_{\mathrm{AA}} are distinct. Here CEC_{E} is the common maximum of the switched and Paper II sieve constants. The four-row K2 error constant is CAA=4⁢CAA37C_{\mathrm{AA}}=4C_{\mathrm{AA37}}.

The exact constants satisfy

(1.18) 0.000228954311267289051898208151\displaystyle 0.000228954311267289051898208151 <DB−cK⁢2,G⁢0⁢I⁢(b),\displaystyle<D_{B}-c_{K2,G0}I(b),
DB−cK⁢2,G⁢0⁢I⁢(b)\displaystyle D_{B}-c_{K2,G0}I(b) <0.000228954311267289051898208152,\displaystyle<0.000228954311267289051898208152,
1.749974884137892433433207484622\displaystyle 1.749974884137892433433207484622 <abuf∗,\displaystyle<a_{\mathrm{buf}}^{*},
abuf∗\displaystyle a_{\mathrm{buf}}^{*} <1.749974884137892433433207484623<74.\displaystyle<1.749974884137892433433207484623<\frac{7}{4}.

The last constant is defined in (9.26). The rational bounds are shown in Section 9. They need the stated analytic comparisons; the arithmetic alone gives no positive-count estimate. The value abuf∗a^{*}_{\mathrm{buf}} is a scalar diagnostic for this fixed bb. It does not prove the theorem for smaller aa; that would require comparisons at a different cutoff. The optional sharper scalar comparison (9.29) uses a separate constant DB,cD_{B,c}; it does not enter the main count.

1.3. Order of the parameters

Fix bb and all absolute error constants first. Choose one sufficiently small rational σ∗\sigma_{*}. Then put τ∗=(σ∗)9\tau_{*}=(\sigma_{*})^{9}. Freeze the finite partitions and all coefficient bounds next. Fix every logarithmic precision before the common threshold. Thus the order is

(1.19) absolute constants⟶σ∗∈ℚ∩(0,10−10]⟶τ∗=(σ∗)9,⟶partitions, coefficient bounds and precisions⟶N0∗⁢(σ∗)⟶N.\begin{gathered}\text{absolute constants}\ \longrightarrow\ \sigma_{*}\in% \mathbb{Q}\cap(0,10^{-10}]\ \longrightarrow\ \tau_{*}=(\sigma_{*})^{9},\\ \longrightarrow\ \text{partitions, coefficient bounds and precisions}\ % \longrightarrow\ N_{0}^{*}(\sigma_{*})\ \longrightarrow\ N.\end{gathered}

The common threshold is defined in (2.5). It includes every length, structural and error threshold. Every limit is taken at fixed σ∗\sigma_{*}. These thresholds exist by (A1)–(A5) and Proposition 9.1. The final section combines the comparisons and the error bounds. For the main construction, the comparison estimates used are:

  1. (1)

    (A1): the actual retained-source comparison in Section 5, including all saved-array conversions. It supplies 5719/106+M5,internal5719/10^{6}+M_{5,\mathrm{internal}} beyond the original retained bound.

  2. (2)

    (A2): the sixth-sum distribution and coefficient estimates in Section 6, supplying gRA,log_{\mathrm{RA,lo}}.

  3. (3)

    (A3): the actual semiprime-source distribution, principal-term and peel estimates in Section 7, giving the exterior cost cK⁢2,G⁢0⁢I⁢(b)c_{K2,G0}I(b).

  4. (4)

    (A4): the switched-source comparison, packing, distribution and peel estimates in Section 8, giving Δ⁢DL⁢3=(2−cK⁢2,G⁢0/4)⁢H¯\Delta D_{L3}=(2-c_{K2,G0}/4)\overline{H}.

Each requirement includes its exact nonnegative error estimates and the fixed-σ∗\sigma_{*} limits allocated in Section 9. The source-counting identity and pointwise bound are supplied in Section 4. The list only records dependencies. The cited sections prove the estimates, with precise scopes and error bounds; the scalar arithmetic here combines them.

The use of AI tools is described at the end.

2. Notation and parameters

All logarithms are natural. Put L=log⁡NL=\log N. The integer NN is even throughout. Table 2.1 fixes the common notation.

Table 2.1. Common notation
Symbol Meaning
ℙ\mathbb{P} The set of primes.
φ⁢(n),d⁢(n)\varphi(n),d(n) Euler’s totient and divisor function. The inherited notation τ⁢(n)=d⁢(n)\tau(n)=d(n) has an integer argument; the scalar τ=σ9\tau=\sigma^{9} has none.
μMob⁢(n),μ⁢(n)\mu_{\mathrm{Mob}}(n),\mu(n) The Möbius function; use μ∗\mu_{*} for the sieve cutoff.
Ω⁢(n)\Omega(n) Prime factors counted with multiplicity.
P−⁢(n)P^{-}(n) Least prime factor; P−⁢(1)=∞P^{-}(1)=\infty.
𝟏E\mathbf{1}_{E} Indicator of EE.
γ,γE\gamma,\gamma_{E} Euler’s constant, with γE=γ\gamma_{E}=\gamma.
a,ba,b Representation exponent and smaller-factor cutoff.
ε\varepsilon Fixed truncation parameter.
α,β,μ∗,λ,t0,u\alpha,\beta,\mu_{*},\lambda,t_{0},u Fixed sieve exponents in (2.1); cutoff μ=μ∗\mu=\mu_{*}.
C⁢(N),UC⁢(N),W⁢(N)C(N),U_{C}(N),W(N) Normalizations in (2.2).
σ,τ,ρ\sigma,\tau,\rho Partition parameters: τ=σ9\tau=\sigma^{9}, ρ=1+τ\rho=1+\tau.
σ∗,τ∗,ρ∗\sigma_{*},\tau_{*},\rho_{*} Their fixed choices for the final argument.
κtr,Ntr\kappa_{\mathrm{tr}},N_{\mathrm{tr}} Transfer parameters in (2.3).
δerr\delta_{\mathrm{err}} Fixed total error bound, 10−410^{-4}.
δpk\delta_{\mathrm{pk}} The parameter in the factor-partition theorem.
hG,h,δhh_{G},h,\delta_{h} Profile displacement hG=9/5000h_{G}=9/5000; h=hGh=h_{G} in (5.1), δh=hG/α\delta_{h}=h_{G}/\alpha.
ϵs,δs\epsilon_{s},\delta_{s} Local sieve parameters, δs=ϵs9\delta_{s}=\epsilon_{s}^{9}; applications use ϵs=σ\epsilon_{s}=\sigma.
ηL\eta_{L} The level margin, 10−410^{-4}; separate from ε\varepsilon and δerr\delta_{\mathrm{err}}.
r,qr,q In (1.1), qq is prime and rr is either 11 or prime; other uses are locally bound variables.
c,I⁢(b)c,I(b) Optional sharper coefficient and the logarithm in (1.6).
cK⁢2,G⁢0c_{K2,G0} Common K2/L3 coefficient in (1.7).
CE,CAAC_{E},C_{\mathrm{AA}} Error constants in (8.25) and (7.38).
KSW⁢(A),CK2,σ,CL3,σK_{\mathrm{SW}}(A),C_{\mathrm{K2},\sigma},C_{\mathrm{L3},\sigma} The logarithmic Siegel–Walfisz level and the K2 and L3 coefficient bounds; each is local to its stated application.
R,RfixR,R_{\mathrm{fix}} The signed sum in (1.5); elsewhere RR is a local level or remainder.
ΣW,𝒲\Sigma_{W},\mathcal{W} Equal signed source sums; see (4.5).
W13,Wr⁢sW_{13},W_{rs} Arithmetic source weight and spectral operator, respectively. Neither denotes W⁢(N)W(N).
H¯,H¯L\overline{H},\overline{H}_{L} Equal switched-integral bounds, 389253/5000000389253/5000000.
Hpk,max,HmaxH_{\mathrm{pk,max}},H_{\max} Equal packing ceilings, 153/256153/256.
DII,J¯6D_{\mathrm{II}},\overline{J}_{6} Original Paper II lower constant and sixth upper endpoint; (1.8), (6.59).
gRA,log_{\mathrm{RA,lo}} Certified floor 0.09895983530.0989598353, used in (1.14).
E′,EvanE^{\prime},E_{\mathrm{van}} Complete retained error and inherited envelope; (1.12), (5.11).
Λj,N,ΛG,N\begin{gathered}\Lambda_{j,N},\\ \Lambda_{G,N}\end{gathered} Retained conversion differences, defined in (5.35) and (5.56).
ΔG,ΛG,N\Delta_{G},\Lambda_{G,N} Joint-profile gain and conversion difference in (5.56). The spelling G⁢1G1 in subscripts denotes the same group.
ERA,Esw,EK,Eexc\begin{gathered}E_{\mathrm{RA}},E_{\mathrm{sw}},\\ E_{K},E_{\mathrm{exc}}\end{gathered} Nonnegative complete errors in (1.10)–(1.11) and (1.13).
ℰB\mathcal{E}_{B} Their total, including E′E^{\prime}, in (1.15).
DBD_{B} The constant in (1.14); evaluated in (9.1).
𝒜N,𝒫b,Gb,Bb\mathcal{A}_{N},\mathcal{P}_{b},G_{b},B_{b} Shifted-prime source, admissible factors, positive count and exterior count in (1.3), (1.5).
S1,…,S13,SswS_{1},\ldots,S_{13},S_{\mathrm{sw}} Paper II arithmetic sums retained in (1.5); definitions in Section 4.
𝔤RA,gRA,lo\mathfrak{g}_{\mathrm{RA}},g_{\mathrm{RA,lo}} Integral gain and its smaller rational floor; only the floor enters DBD_{B}.
g6,M5,internal,Khi,LG⁢1\begin{gathered}g_{6},M_{5,\mathrm{internal}},\\ K_{\mathrm{hi}},L_{G1}\end{gathered} Optional six-endpoint gain, shifted-profile gain and mass constants; the main proof sets g6=0g_{6}=0, see (5.18), (1.8), (1.9).
Δ⁢DL⁢3\Delta D_{L3} Switched gain (2−cK⁢2,G⁢0/4)⁢H¯(2-c_{K2,G0}/4)\overline{H}.
G∗,G0,U0,cO1G_{*},G_{0},U_{0},c_{\mathrm{O1}} Common unshifted K2/L3 functional; coefficient cap G0=6088440363/109G_{0}=6088440363/10^{9}; optional sharper upper certificate U0U_{0}; its exact coefficient in (8.60).
ℋ,Λj,N0\mathcal{H},\Lambda^{0}_{j,N} Retained row set and saved-array contribution in (5.2).
ℰ,Ept\mathcal{E},E_{\mathrm{pt}} Pointwise exceptional set and error in (4.9), (4.12).
N0∗,Nfloor,T∙N_{0}^{*},N_{\mathrm{floor}},T_{\bullet} Common threshold, numerical floor and named threshold requirements in (2.5).
ζ,abuf∗,𝔈∗\zeta,a_{\mathrm{buf}}^{*},\mathfrak{E}_{*} Buffer 10−610^{-6}, scalar endpoint and its exponential in (9.26).
WAA,K,W∗W_{\mathrm{AA},K},W_{*} K2 source-weight bound in (7.38) and Paper II bound 101410^{14}; these are distinct.
AK,PK,rKA_{K},P_{K},r_{K} K2 error multiplier, peel multiplier and vanishing remainder in (9.8).
Csw,Psw,VswC_{\mathrm{sw}},P_{\mathrm{sw}},V_{\mathrm{sw}} Switched error multipliers and positive remainder in (8.61), (8.71).
L,gAAL,g_{\mathrm{AA}} log⁡N\log N and Paper II’s fixed error allowance in (9.15).

Cusps carry the index 𝔞\mathfrak{a} in spectral sums. The switched blocks carry the index 𝔟\mathfrak{b}. Partition cells are cc or 𝔠\mathfrak{c}. Coefficient sequences are an,bma_{n},b_{m}, with dummy indices interchanged when needed. Spectral moduli and cusp numerators are locally bound variables. They do not redefine the constants cc and uu. Packing coordinates also have local scope. Bare TT and ww are local endpoints or weights; the named saved and root-A scales are Tsave,TintT_{\mathrm{save}},T_{\mathrm{int}}, and wRAw_{\mathrm{RA}}. The exponent A0>0A_{0}>0 in distribution estimates is a logarithmic precision. The normalization factor is written 2⁢e−γ2e^{-\gamma}.

2.1. Fixed parameters

Keep a,b,εa,b,\varepsilon from (1.2). The sieve parameters are

(2.1) α\displaystyle\alpha =1001149,\displaystyle=\frac{100}{1149}, β\displaystyle\beta =50309,\displaystyle=\frac{50}{309}, μ∗\displaystyle\mu_{*} =25128,\displaystyle=\frac{25}{128},
λ\displaystyle\lambda =93400,\displaystyle=\frac{93}{400}, t0\displaystyle t_{0} =57224,\displaystyle=\frac{57}{224}, u\displaystyle u =1500.\displaystyle=\frac{1}{500}.

These follow Paper II’s notation [27, (1.5)]; ε\varepsilon is εA\varepsilon_{A} in [27, (1.3)]. Put

(2.2) C2\displaystyle C_{2} =∏ℓ∈ℙℓ>2(1−1(ℓ−1)2),\displaystyle=\prod_{\begin{subarray}{c}\ell\in\mathbb{P}\\ \ell>2\end{subarray}}\left(1-\frac{1}{(\ell-1)^{2}}\right),
C⁢(N)\displaystyle C(N) =C2⁢∏ℓ∈ℙ,ℓ∣Nℓ>2ℓ−1ℓ−2,\displaystyle=C_{2}\prod_{\begin{subarray}{c}\ell\in\mathbb{P},\ \ell\mid N\\ \ell>2\end{subarray}}\frac{\ell-1}{\ell-2},
UC⁢(N)\displaystyle U_{C}(N) =C⁢(N)⁢NL2,W⁢(N)=4⁢(1−ε)⁢UC⁢(N).\displaystyle=\frac{C(N)N}{L^{2}},\qquad W(N)=4(1-\varepsilon)U_{C}(N).

We often suppress the argument NN.

Define the transfer parameters by

(2.3) κtr\displaystyle\kappa_{\mathrm{tr}} =a⁢(1−b)−1=74000000,\displaystyle=a(1-b)-1=\frac{7}{4000000},
Ntr\displaystyle N_{\mathrm{tr}} =ε−(a−1)/κtr=ε−3000000/7.\displaystyle=\varepsilon^{-(a-1)/\kappa_{\mathrm{tr}}}=\varepsilon^{-3000000/% 7}.

Here a−1=3/4a-1=3/4 is the exponent on the larger prime in the bound for the smaller factor. The transfer argument appears in the final section.

2.2. Order of choice

First fix all σ\sigma-independent constants in the estimates. These include CEC_{E} in (8.25) and CAAC_{\mathrm{AA}} in (7.38). Then choose one rational σ∗\sigma_{*}, with

(2.4) 0<σ∗≤10−10,τ∗=(σ∗)9,ρ∗=1+τ∗.0<\sigma_{*}\leq 10^{-10},\qquad\tau_{*}=(\sigma_{*})^{9},\qquad\rho_{*}=1+% \tau_{*}.

The final section gives the remaining upper restrictions. Apply every partition estimate with σ=σ∗\sigma=\sigma_{*}. Freeze its finite partitions and coefficient bounds next. Freeze the resulting finite-family bounds and logarithmic precisions too. These choices precede the common threshold.

Use the following named thresholds. Each requires its listed statement for every even NN above it, at the fixed σ∗\sigma_{*}. The cited comparison propositions establish these statements. The numerical floor supplies none of them. The resulting threshold exists but may be ineffective.

  1. (1)

    TsrcT_{\mathrm{src}}: the actual-source identity and first line of (1.10), including the pointwise hypotheses in (4.11) and (4.13). Include the explicit pointwise threshold Npt=1+⌈max⁡{21/α,ε−3,ε−1/(1−λ−β)}⌉N_{\mathrm{pt}}=1+\lceil\max\{2^{1/\alpha},\varepsilon^{-3},\varepsilon^{-1/(1% -\lambda-\beta)}\}\rceil from Section 4.

  2. (2)

    TretT_{\mathrm{ret}}: the retained comparison, saved-array identifications and nonnegativity of EvanE_{\mathrm{van}} in Section 5.

  3. (3)

    TRAT_{\mathrm{RA}}: the sixth-sum comparison (6.72), with every distribution and coefficient bound specified in Section 6. It also covers the finite source threshold N6N_{6}, chosen so that every even N≥N6N\geq N_{6} satisfies

    N1/6>Lmax⁡(BL,Btail),NvRA−1/3>LB,ε⁢N1/2>Nμ∗,N⁢L−333≥Nμ∗.N^{1/6}>L^{\max(B_{L},B_{\mathrm{tail}})},\quad N^{v_{\mathrm{RA}}-1/3}>L^{B},% \quad\varepsilon N^{1/2}>N^{\mu_{*}},\quad NL^{-333}\geq N^{\mu_{*}}.

    Thus the operative TRAT_{\mathrm{RA}} is the maximum of the sixth-sum comparison threshold and this N6N_{6}.

  4. (4)

    TKT_{K}: the actual-source exterior comparison (7.67) and its nonnegative error decomposition, the rKr_{K} formula displayed after (7.67).

  5. (5)

    TswT_{\mathrm{sw}}: the switched comparison (8.72) and the nonnegative decomposition (8.71).

  6. (6)

    TlenT_{\mathrm{len}}: all scale-conversion, zero-mode, factorization, packing, interval-length and logarithmic-precision conditions of the preceding applications, with the fixed finite partitions. In particular, require Nσ∗≥2N^{\sigma_{*}}\geq 2, N60⁢σ∗⁢2−126≥12⁢L334N^{60\sigma_{*}2^{-126}}\geq 12L^{334}, (7.61) and (8.46), and include Ndom,Nz,0,NLEN,appN_{\mathrm{dom}},N_{z,0},N_{\mathrm{LEN,app}} from (8.75). The remaining application conditions are exactly those of the cited comparison propositions. The floor implies none of them.

  7. (7)

    TE′,TV,TERA,Tr,TEexcT_{E^{\prime}},T_{V},T_{E_{\mathrm{RA}}},T_{r},T_{E_{\mathrm{exc}}}: respectively the eventual bounds

    E′≤δerr20,Vsw≤δerr20,ERA≤δerr10,rK≤δerr10,Eexc≤δerr10.\begin{gathered}E^{\prime}\leq\frac{\delta_{\mathrm{err}}}{20},\qquad V_{% \mathrm{sw}}\leq\frac{\delta_{\mathrm{err}}}{20},\qquad E_{\mathrm{RA}}\leq% \frac{\delta_{\mathrm{err}}}{10},\\ r_{K}\leq\frac{\delta_{\mathrm{err}}}{10},\qquad E_{\mathrm{exc}}\leq\frac{% \delta_{\mathrm{err}}}{10}.\end{gathered}

    All arguments are (N;σ∗)(N;\sigma_{*}), or (N;b,σ∗)(N;b,\sigma_{*}) for rKr_{K}.

These are finitely many requirements after all finite choices. Define the common threshold once by

(2.5) 𝒯∗=\displaystyle\mathcal{T}_{*}={} {Tsrc,Tret,TRA,TK,Tsw,Tlen,\displaystyle\{T_{\mathrm{src}},T_{\mathrm{ret}},T_{\mathrm{RA}},T_{K},T_{% \mathrm{sw}},T_{\mathrm{len}},
TE′,TV,TERA,Tr,TEexc},\displaystyle\hskip 34.1433ptT_{E^{\prime}},T_{V},T_{E_{\mathrm{RA}}},T_{r},T_% {E_{\mathrm{exc}}}\},
N0∗⁢(σ∗)\displaystyle N_{0}^{*}(\sigma_{*}) =2⁢⌈12⁢max⁡({Ntr,Nfloor}∪𝒯∗)⌉,\displaystyle=2\left\lceil\frac{1}{2}\max\bigl{(}\{N_{\mathrm{tr}},N_{\mathrm{% floor}}\}\cup\mathcal{T}_{*}\bigr{)}\right\rceil,
Nfloor\displaystyle N_{\mathrm{floor}} =2⁢⌈e2150/2⌉.\displaystyle=2\left\lceil e^{2^{150}}/2\right\rceil.

The floor is a convention added to Paper I’s selected-interval length hypothesis [26, §3.2, length hypothesis preceding (3.12)]. It proves none of the listed estimates. The named application estimates establish this threshold. The resulting N0∗N_{0}^{*} may be ineffective.

This implements the order in (1.19). Afterwards, NN is even and N≥N0∗⁢(σ∗)N\geq N_{0}^{*}(\sigma_{*}).

Let ϵerr⁢(N;σ∗)\epsilon_{\mathrm{err}}(N;\sigma_{*}) be a real- or complex-valued error function. Write ϵerr⁢(N;σ∗)=oσ∗⁢(1)\epsilon_{\mathrm{err}}(N;\sigma_{*})=o_{\sigma_{*}}(1) if and only if

(2.6) ∀η>0⁢∃Nη⁢(σ∗)⁢∀N∈2⁢ℕ,N≥Nη⁢(σ∗)⟹|ϵerr⁢(N;σ∗)|≤η.\begin{gathered}\forall\eta>0\ \exists N_{\eta}(\sigma_{*})\ \forall N\in 2% \mathbb{N},\\ N\geq N_{\eta}(\sigma_{*})\ \Longrightarrow\ |\epsilon_{\mathrm{err}}(N;\sigma% _{*})|\leq\eta.\end{gathered}

All preceding fixed data are suppressed here. The parameter σ∗\sigma_{*} remains fixed in this limit. Uniformity in other variables is stated with each estimate.

3. Classical inputs

We use counting-measure ℓ2\ell^{2} norms. Write n∼Yn\sim Y for Y<n≤2⁢YY<n\leq 2Y. The symbols μMob,Λ,φ\mu_{\rm Mob},\Lambda,\varphi have their usual meanings. Write d⁢(n)d(n) for the divisor function. The parameters in each fact are local. Put P−⁢(1)=∞P^{-}(1)=\infty and e⁢(t)=exp⁡(2⁢π⁢i⁢t)e(t)=\exp(2\pi it). Statements (P1.x) and (P2.x) restate results proved in Papers I and II, respectively, with their original scope. The structured sieve result is Paper I, Theorem 2.6. Its classical source is Iwaniec’s Theorem 4 [13, Theorem 4]. The SS-form displayed below specializes the WR±W_{R}^{\pm} estimates of Paper I, Theorem 2.6. It follows from them by S≤WR+S\leq W_{R}^{+} and S≥WR−S\geq W_{R}^{-}. Theorem 4 does not state it verbatim. Each new application needs its own coefficient, support and uniformity checks.

Fact 3.1 ((F1) Prime estimates).

For every A>0A>0, one may take Bψ⁢(A)=A+60B_{\psi}(A)=A+60 in

(3.1) ∑q≤Qmax(a,q)=1⁡|∑n≤yn≡a⁢(q)Λ⁢(n)−yφ⁢(q)|≪Ay⁢(log⁡y)−A,y≥3,Q≤y1/2⁢(log⁡y)−Bψ⁢(A).\begin{gathered}\sum_{q\leq Q}\max_{(a,q)=1}\left|\sum_{\begin{subarray}{c}n% \leq y\\ n\equiv a\ (q)\end{subarray}}\Lambda(n)-\frac{y}{\varphi(q)}\right|\ll_{A}y(% \log y)^{-A},\\ y\geq 3,\quad Q\leq y^{1/2}(\log y)^{-B_{\psi}(A)}.\end{gathered}

For fixed A,C>0A,C>0, uniformly for q≤(log⁡y)Cq\leq(\log y)^{C},

(3.2) π⁢(y;q,a)=Li⁡(y)φ⁢(q)+OA,C⁢(y⁢(log⁡y)−A),(a,q)=1,y≥3.\pi(y;q,a)=\frac{\operatorname{Li}(y)}{\varphi(q)}+O_{A,C}(y(\log y)^{-A}),% \quad(a,q)=1,\quad y\geq 3.

These are Paper I, (2.20)–(2.21) [26, (2.20)–(2.21), p. 9]. The endpoint yy is fixed. The second constant is ineffective.

Fact 3.2 ((F1′) Maximal-endpoint prime estimates).

Use the prime Siegel–Walfisz estimate (3.2). For every fixed S>0S>0 and X≥3X\geq 3, put QX=X1/2⁢(log⁡X)−(S+60)Q_{X}=X^{1/2}(\log X)^{-(S+60)}. Then

(3.3) ∑q≤QXmax(a,q)=1⁢sup0≤y≤X|∑n≤yn≡a⁢(q)Λ⁢(n)−yφ⁢(q)|\displaystyle\sum_{q\leq Q_{X}}\max_{(a,q)=1}\sup_{0\leq y\leq X}\left|\sum_{% \begin{subarray}{c}n\leq y\\ n\equiv a\ (q)\end{subarray}}\Lambda(n)-\frac{y}{\varphi(q)}\right| ≪SX⁢(log⁡X)−S,\displaystyle\ll_{S}X(\log X)^{-S},
∑q≤QXmax(a,q)=1⁢sup0≤y≤X|π⁢(y;q,a)−Li⁡(y)φ⁢(q)|\displaystyle\sum_{q\leq Q_{X}}\max_{(a,q)=1}\sup_{0\leq y\leq X}\left|\pi(y;q% ,a)-\frac{\operatorname{Li}(y)}{\varphi(q)}\right| ≪SX⁢(log⁡X)−S.\displaystyle\ll_{S}X(\log X)^{-S}.

Here Li⁡(y)=0\operatorname{Li}(y)=0 for 0≤y<20\leq y<2. The level is imposed at XX; the endpoints may be chosen separately for each modulus. An interval difference costs at most twice the bound. This is the classical maximal form of Bombieri–Vinogradov [6, Chapter 28]. Removing prime powers and partial summation pass from the von Mangoldt form to the prime-counting form. The constants may be ineffective through (3.2).

Fact 3.3 ((F2) Full-support bilinear distribution).

Let am,bna_{m},b_{n} have supports m∼M,n∼Ym\sim M,n\sim Y. Assume x=M⁢Y≥3x=MY\geq 3, set Lx=log⁡xL_{x}=\log x, and fix ϵ,B>0\epsilon,B>0. Assume ϵ≤log⁡Y/log⁡x≤1−ϵ\epsilon\leq\log Y/\log x\leq 1-\epsilon. For every A0>0A_{0}>0, assume uniformly in h,k≥1h,k\geq 1 and integers ℓ≠0\ell\neq 0 with (ℓ,k)=1(\ell,k)=1 that

(3.4) |∑n≡ℓ⁢(k)(n,h)=1bn−1φ⁢(k)⁢∑(n,h⁢k)=1bn|≤CA0⁢‖b‖2⁢Y1/2⁢d⁢(h)B⁢(log⁡(2⁢Y))−A0.\left|\sum_{\begin{subarray}{c}n\equiv\ell\ (k)\\ (n,h)=1\end{subarray}}b_{n}-\frac{1}{\varphi(k)}\sum_{(n,hk)=1}b_{n}\right|% \leq C_{A_{0}}\|b\|_{2}Y^{1/2}d(h)^{B}(\log(2Y))^{-A_{0}}.

Define

Δfs⁢(q,a)=∑m⁢n≡a⁢(q)am⁢bn−1φ⁢(q)⁢∑(m⁢n,q)=1am⁢bn.\Delta_{\rm fs}(q,a)=\sum_{mn\equiv a\ (q)}a_{m}b_{n}-\frac{1}{\varphi(q)}\sum% _{(mn,q)=1}a_{m}b_{n}.

For every A>0A>0, some BBV=BBV⁢(A,B,ϵ)>0B_{\rm BV}=B_{\rm BV}(A,B,\epsilon)>0 gives

(3.5) ∑q≤Qmax(a,q)=1⁡|Δfs⁢(q,a)|≪‖a‖2⁢‖b‖2⁢x1/2⁢Lx−A,Q≤x1/2⁢Lx−BBV.\sum_{q\leq Q}\max_{(a,q)=1}|\Delta_{\rm fs}(q,a)|\ll\|a\|_{2}\|b\|_{2}x^{1/2}% L_{x}^{-A},\qquad Q\leq x^{1/2}L_{x}^{-B_{\rm BV}}.

Both sums use the full supports. The constants depend on the family constants CA0C_{A_{0}}. This follows from the proof of BFI Theorem 0(b) [3, (A1)–(A2), p. 206; Theorem 0(b), (1.5), p. 212; proof, pp. 213–214].

Proof.

Character orthogonality and primitive induction give

left side of (3.5) ≤∑e≤Q1φ⁢(e)⁢∑2≤f≤Q/e1φ⁢(f)\displaystyle\leq\sum_{e\leq Q}\frac{1}{\varphi(e)}\sum_{2\leq f\leq Q/e}\frac% {1}{\varphi(f)}
⋅∑χ⁢(f)∗|Ae(χ)Be(χ)|,\displaystyle\qquad\cdot\sum_{\chi\ (f)}^{*}|A_{e}(\chi)B_{e}(\chi)|,
Ae⁢(χ)\displaystyle A_{e}(\chi) =∑(m,e)=1am⁢χ⁢(m).\displaystyle=\sum_{(m,e)=1}a_{m}\chi(m).

Define BeB_{e} similarly. Split at F=LxKF=L_{x}^{K}. Since M≥xϵM\geq x^{\epsilon}, large xx gives F2≤MF^{2}\leq M. This permits the small-conductor estimate. The hypothesis handles f≤Ff\leq F. The multiplicative large sieve handles f>Ff>F. Before summing ee, the bounds are

≪∥a∥2∥b∥2x1/2d(e)BF3/2Lx−A0,≪Lx2∥a∥2∥b∥2(Q+M1/2+Y1/2+x1/2/F).\ll\|a\|_{2}\|b\|_{2}x^{1/2}d(e)^{B}F^{3/2}L_{x}^{-A_{0}},\qquad\ll L_{x}^{2}% \|a\|_{2}\|b\|_{2}(Q+M^{1/2}+Y^{1/2}+x^{1/2}/F).

Choose B2B_{2} with ∑e≤Qd⁢(e)B/φ⁢(e)≪LxB2\sum_{e\leq Q}d(e)^{B}/\varphi(e)\ll L_{x}^{B_{2}}. In the large-conductor bound, summing 1/φ⁢(e)1/\varphi(e) costs one more logarithm, since ∑e≤Q1/φ⁢(e)≪Lx\sum_{e\leq Q}1/\varphi(e)\ll L_{x}. Take K=A+B2+4K=A+B_{2}+4, A0=A+B2+3⁢K/2+1A_{0}=A+B_{2}+3K/2+1, and BBV=KB_{\rm BV}=K. Since M,Y≥xϵM,Y\geq x^{\epsilon}, these bounds prove (3.5). The large sieve is BFI (1.6), p. 207, restated in Paper I, (2.19) [3, (1.6), p. 207][26, (2.19), p. 9]. ∎

We do not use BFI86, Theorem 0(a).

Fact (F2) is the standalone full-support bound. Section 8 checks the coefficients, relative levels and rough factors of the first three switched rows on the actual source.

Fact 3.4 ((F3) The spectral gap).

For every congruence subgroup Γ⊂SL2⁢(ℤ)\Gamma\subset\mathrm{SL}_{2}(\mathbb{Z}),

(3.6) λ1⁢(Γ)≥9754096,0<λ=14−t2<14,t≥0⟹0≤t≤764,ϑ=2⁢t≤732.\lambda_{1}(\Gamma)\geq\frac{975}{4096},\qquad 0<\lambda=\frac{1}{4}-t^{2}<% \frac{1}{4},\quad t\geq 0\Longrightarrow 0\leq t\leq\frac{7}{64},\quad% \vartheta=2t\leq\frac{7}{32}.

Here λ1⁢(Γ)\lambda_{1}(\Gamma) is the smallest nonzero Laplace eigenvalue. The implication applies to every eigenvalue λ\lambda of Δ\Delta on L2⁢(Γ\ℍ)L^{2}(\Gamma\backslash\mathbb{H}) in the indicated range. The first bound is Kim–Sarnak [17, Appendix 2]. The implications are elementary.

Fact 3.5 ((F4) Deligne’s bound).

Let f=∑n≥1ψf⁢(n)⁢e⁢(n⁢z)f=\sum_{n\geq 1}\psi_{f}(n)e(nz) be a primitive holomorphic cuspidal newform. Assume ψf⁢(1)=1\psi_{f}(1)=1, integer weight k≥2k\geq 2, level MM, and character χ\chi, with f⁢((a⁢z+b)/(c⁢z+d))=χ⁢(d)⁢(c⁢z+d)k⁢f⁢(z)f((az+b)/(cz+d))=\chi(d)(cz+d)^{k}f(z) on Γ0⁢(M)\Gamma_{0}(M). This agrees with Deligne’s convention χ⁢(a)−1\chi(a)^{-1}. For p∤Mp\nmid M, Deligne proved

(3.7) |ψf⁢(p)|≤2⁢p(k−1)/2|\psi_{f}(p)|\leq 2p^{(k-1)/2}

[8, Théorème (8.2), p. 302]. The same source states that the roots αp,βp\alpha_{p},\beta_{p} of T2−ψf⁢(p)⁢T+χ⁢(p)⁢pk−1T^{2}-\psi_{f}(p)T+\chi(p)p^{k-1} both have modulus p(k−1)/2p^{(k-1)/2}. Since |αp|2=|βp|2=pk−1|\alpha_{p}|^{2}=|\beta_{p}|^{2}=p^{k-1}, we have αp¯=pk−1/αp\overline{\alpha_{p}}=p^{k-1}/\alpha_{p} and likewise for βp\beta_{p}. With αp⁢βp=χ⁢(p)⁢pk−1\alpha_{p}\beta_{p}=\chi(p)p^{k-1}, this gives

(3.8) χ⁢(p)⁢ψf⁢(p)¯\displaystyle\chi(p)\overline{\psi_{f}(p)} =αp⁢βppk−1⁢(pk−1αp+pk−1βp)=ψf⁢(p).\displaystyle=\frac{\alpha_{p}\beta_{p}}{p^{k-1}}\left(\frac{p^{k-1}}{\alpha_{% p}}+\frac{p^{k-1}}{\beta_{p}}\right)=\psi_{f}(p).

Choose ηp2=χ⁢(p)\eta_{p}^{2}=\chi(p), |ηp|=1|\eta_{p}|=1. Then bp=ηp−1⁢p−(k−1)/2⁢ψf⁢(p)b_{p}=\eta_{p}^{-1}p^{-(k-1)/2}\psi_{f}(p) is real and |bp|≤2|b_{p}|\leq 2. With T=p(k−1)/2⁢ηp⁢ZT=p^{(k-1)/2}\eta_{p}Z, the polynomial becomes

T2−ψf⁢(p)⁢T+χ⁢(p)⁢pk−1=pk−1⁢χ⁢(p)⁢(Z2−bp⁢Z+1).T^{2}-\psi_{f}(p)T+\chi(p)p^{k-1}=p^{k-1}\chi(p)(Z^{2}-b_{p}Z+1).

Write bp=2⁢cos⁡ωpb_{p}=2\cos\omega_{p}, 0≤ωp≤π0\leq\omega_{p}\leq\pi. The normalized roots are e±i⁢ωpe^{\pm i\omega_{p}}, also in the repeated case bp=±2b_{p}=\pm 2. An earlier exposition of the modular-form setting is [7].

Fact 3.6 ((F5) Averaged Kloosterman sums).

For C,M,Y≥1C,M,Y\geq 1 and ϵ>0\epsilon>0,

(3.9) ∑c≤C|∑m≤M∑n≤YS⁢(m,n;c)|≪ϵ(C⁢M⁢Y)ϵ⁢C⁢(C+M⁢Y)\sum_{c\leq C}\left|\sum_{m\leq M}\sum_{n\leq Y}S(m,n;c)\right|\ll_{\epsilon}(% CMY)^{\epsilon}C(C+MY)

[9, Theorem 14, equation (8.13), p. 275]. The sums run over integers 1≤c≤C1\leq c\leq C, 1≤m≤M1\leq m\leq M, and 1≤n≤Y1\leq n\leq Y. Here S⁢(m,n;c)=∑u⁢(c)∗e⁢((m⁢u+n⁢u¯)/c)S(m,n;c)=\sum_{u\ (c)}^{*}e((mu+n\bar{u})/c).

Use the trivial character on Γ0⁢(q)\ℍ\Gamma_{0}(q)\backslash\mathbb{H}. The sum over ff runs through a Petersson-orthonormal basis of Sk⁢(Γ0⁢(q))S_{k}(\Gamma_{0}(q)). The sum over jj runs through an orthonormal basis of Maass cusp forms, including exceptional forms. The sum over 𝔞\mathfrak{a} runs through inequivalent cusps with width-one scaling matrices. The measure is d⁢x⁢d⁢y/y2dx\,dy/y^{2}. At infinity, the DI coefficients satisfy

(3.10) uj⁢(z)\displaystyle u_{j}(z) =∑n≠0ρj⁢(n)⁢y⁢Ki⁢κj⁢(2⁢π⁢|n|⁢y)⁢e⁢(n⁢x),λj=14+κj2,\displaystyle=\sum_{n\neq 0}\rho_{j}(n)\sqrt{y}K_{i\kappa_{j}}(2\pi|n|y)e(nx),% \quad\lambda_{j}=\tfrac{1}{4}+\kappa_{j}^{2},
f⁢(z)\displaystyle f(z) =∑n≥1ψf⁢(n)⁢e⁢(n⁢z),\displaystyle=\sum_{n\geq 1}\psi_{f}(n)e(nz),
E𝔞⁢(z,s)\displaystyle E_{\mathfrak{a}}(z,s) =constant terms+y⁢∑n≠02⁢πs⁢|n|s−1/2Γ⁢(s)⁢φ𝔞⁢∞⁢n⁢(s)⁢Ks−1/2⁢(2⁢π⁢|n|⁢y)⁢e⁢(n⁢x).\displaystyle=\text{constant terms}+\sqrt{y}\sum_{n\neq 0}\frac{2\pi^{s}|n|^{s% -1/2}}{\Gamma(s)}\varphi_{\mathfrak{a}\infty n}(s)K_{s-1/2}(2\pi|n|y)e(nx).

For 0<λj<1/40<\lambda_{j}<1/4, set ϑj=2⁢|ℑ⁡κj|=2⁢1/4−λj\vartheta_{j}=2|\Im\kappa_{j}|=2\sqrt{1/4-\lambda_{j}}. See Paper I, (2.2)–(2.4) [26, (2.2)–(2.4), p. 5].

Fact 3.7 ((F6) Spectral large sieves).

For q,K≥1q,K\geq 1, Y≥1/2Y\geq 1/2, and ana_{n} supported on n∼Yn\sim Y, put

Σhol⁢(K,a)\displaystyle\Sigma_{\rm hol}(K,a) =∑2≤k≤Kk⁢even(k−1)!(4⁢π)k−1⁢∑f|∑n∼Yan⁢n−(k−1)/2⁢ψf⁢(n)|2,\displaystyle=\sum_{\begin{subarray}{c}2\leq k\leq K\\ k\ {\rm even}\end{subarray}}\frac{(k-1)!}{(4\pi)^{k-1}}\sum_{f}\left|\sum_{n% \sim Y}a_{n}n^{-(k-1)/2}\psi_{f}(n)\right|^{2},
ΣMaa⁢(K,a)\displaystyle\Sigma_{\rm Maa}(K,a) =∑|κj|≤K1cosh⁡(π⁢κj)⁢|∑n∼Yan⁢ρj⁢(n)|2,\displaystyle=\sum_{|\kappa_{j}|\leq K}\frac{1}{\cosh(\pi\kappa_{j})}\left|% \sum_{n\sim Y}a_{n}\rho_{j}(n)\right|^{2},
ΣEis⁢(K,a)\displaystyle\Sigma_{\rm Eis}(K,a) =∑𝔞∫−KK|∑n∼Yan⁢ni⁢t⁢φ𝔞⁢∞⁢n⁢(1/2+i⁢t)|2⁢𝑑t.\displaystyle=\sum_{\mathfrak{a}}\int_{-K}^{K}\left|\sum_{n\sim Y}a_{n}n^{it}% \varphi_{\mathfrak{a}\infty n}(1/2+it)\right|^{2}dt.

The large-sieve estimates are

(3.11) Σhol⁢(K,a),ΣMaa⁢(K,a),ΣEis⁢(K,a)≪ϵ(K2+Y1+ϵ/q)⁢‖a‖22,∑j⁢exceptionalVϑj⁢|∑n∼Yan⁢ρj⁢(n)|2≪ϵ(1+Y⁢V/q)⁢(1+Y1+ϵ/q)⁢‖a‖22,V≥1.\begin{gathered}\Sigma_{\rm hol}(K,a),\Sigma_{\rm Maa}(K,a),\Sigma_{\rm Eis}(K% ,a)\ll_{\epsilon}(K^{2}+Y^{1+\epsilon}/q)\|a\|_{2}^{2},\\ \sum_{j\ {\rm exceptional}}V^{\vartheta_{j}}\left|\sum_{n\sim Y}a_{n}\rho_{j}(% n)\right|^{2}\ll_{\epsilon}(1+\sqrt{YV/q})(1+\sqrt{Y^{1+\epsilon}/q})\|a\|_{2}% ^{2},\quad V\geq 1.\end{gathered}

These are the specialized forms in Paper I, (2.5)–(2.8) [9, Theorem 2, (1.28)–(1.30), p. 230; Theorem 5, (1.38), p. 232] [26, (2.5)–(2.8), pp. 6–7].

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

(3.12) ϕ^⁢(t)\displaystyle\widehat{\phi}(t) =πsinh⁡π⁢t⁢∫0∞J2⁢i⁢t⁢(x)−J−2⁢i⁢t⁢(x)2⁢i⁢ϕ⁢(x)⁢d⁢xx,\displaystyle=\frac{\pi}{\sinh\pi t}\int_{0}^{\infty}\frac{J_{2it}(x)-J_{-2it}% (x)}{2i}\phi(x)\frac{dx}{x},
ϕˇ⁢(t)\displaystyle\check{\phi}(t) =4π⁢cosh⁡π⁢t⁢∫0∞K2⁢i⁢t⁢(x)⁢ϕ⁢(x)⁢d⁢xx,ϕ~⁢(l)=∫0∞Jl⁢(x)⁢ϕ⁢(x)⁢d⁢xx.\displaystyle=\frac{4}{\pi}\cosh\pi t\int_{0}^{\infty}K_{2it}(x)\phi(x)\frac{% dx}{x},\qquad\widetilde{\phi}(l)=\int_{0}^{\infty}J_{l}(x)\phi(x)\frac{dx}{x}.

The value at t=0t=0 is the removable limit.

Fact 3.8 ((F7) Corrected same-cusp trace formula).

For q,m,n≥1q,m,n\geq 1 and the test class above,

(3.13) ∑h≥1S⁢(m,n;q⁢h)q⁢h⁢ϕ⁢(4⁢π⁢m⁢nq⁢h)=Hϕ⁢(m,n)π−Mϕ⁢(m,n)−Eϕ⁢(m,n)π,\sum_{h\geq 1}\frac{S(m,n;qh)}{qh}\phi\left(\frac{4\pi\sqrt{mn}}{qh}\right)=% \frac{H_{\phi}(m,n)}{\pi}-M_{\phi}(m,n)-\frac{E_{\phi}(m,n)}{\pi},

where

Hϕ⁢(m,n)\displaystyle H_{\phi}(m,n) =∑k≥2k⁢evenik⁢(k−1)!⁢ϕ~⁢(k−1)(4⁢π⁢m⁢n)k−1⁢∑fψf⁢(m)¯⁢ψf⁢(n),\displaystyle=\sum_{\begin{subarray}{c}k\geq 2\\ k\ {\rm even}\end{subarray}}\frac{i^{k}(k-1)!\widetilde{\phi}(k-1)}{(4\pi\sqrt% {mn})^{k-1}}\sum_{f}\overline{\psi_{f}(m)}\psi_{f}(n),
Mϕ⁢(m,n)\displaystyle M_{\phi}(m,n) =∑jϕ^⁢(κj)cosh⁡π⁢κj⁢ρj⁢(m)¯⁢ρj⁢(n),\displaystyle=\sum_{j}\frac{\widehat{\phi}(\kappa_{j})}{\cosh\pi\kappa_{j}}% \overline{\rho_{j}(m)}\rho_{j}(n),
Eϕ⁢(m,n)\displaystyle E_{\phi}(m,n) =∑𝔞∫ℝ(n/m)i⁢t⁢φ𝔞⁢∞⁢m⁢(1/2+i⁢t)¯⁢φ𝔞⁢∞⁢n⁢(1/2+i⁢t)⁢ϕ^⁢(t)⁢𝑑t.\displaystyle=\sum_{\mathfrak{a}}\int_{\mathbb{R}}(n/m)^{it}\overline{\varphi_% {\mathfrak{a}\infty m}(1/2+it)}\varphi_{\mathfrak{a}\infty n}(1/2+it)\widehat{% \phi}(t)\,dt.

No extra diagonal term occurs, also for m=nm=n. This is the corrected same-cusp specialization proved in Paper I, (2.7.T15)–(2.7.T18) [26, (2.7.T15)–(2.7.T18)]. Compare [10, Lemma 4.5, (4.8)–(4.17)], in the DI convention [9, (1.15)–(1.17)].

Fact 3.9 ((F8) Mixed-cusp formulas).

For q=r⁢sq=rs, (r,s)=1(r,s)=1, use the trivial character and

σ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},\quad\mathcal{C}(\infty,1/s)=\{cs\sqrt{r}:c% \geq 1,\ (c,r)=1\}.

DI82 (1.6), p. 224, gives the arithmetic identity [9, (1.6), p. 224]

S∞,1/s⁢(m,n;c⁢s⁢r)=e⁢(n⁢s¯/r)⁢S⁢(m⁢r¯,n;c⁢s),m,n∈ℕ.S_{\infty,1/s}(m,n;cs\sqrt{r})=e(n\bar{s}/r)S(m\bar{r},n;cs),\qquad m,n\in% \mathbb{N}.

Here s⁢s¯≡1(modr)s\bar{s}\equiv 1\pmod{r} and r⁢r¯≡1(modc⁢s)r\bar{r}\equiv 1\pmod{cs}. The accompanying trace formulas, proved in Paper I, are

𝒦+=H∞,1/s/π−M∞,1/s−E∞,1/s/π,𝒦−=(π/2)⁢M∞,1/s−+(1/2)⁢E∞,1/s−.\mathcal{K}_{+}=H_{\infty,1/s}/\pi-M_{\infty,1/s}-E_{\infty,1/s}/\pi,\qquad% \mathcal{K}_{-}=(\pi/2)M^{-}_{\infty,1/s}+(1/2)E^{-}_{\infty,1/s}.

Here 𝒦±=∑γ∈𝒞γ−1⁢S∞,1/s⁢(m,±n;γ)⁢ϕ⁢(4⁢π⁢m⁢n/γ)\mathcal{K}_{\pm}=\sum_{\gamma\in\mathcal{C}}\gamma^{-1}S_{\infty,1/s}(m,\pm n% ;\gamma)\phi(4\pi\sqrt{mn}/\gamma). The plus terms have the definitions in (F7), with their second coefficient at 1/s1/s. For M−M^{-} and E−E^{-}, replace ϕ^\widehat{\phi} by ϕˇ\check{\phi} and nn by −n-n only in the second Fourier coefficient. The cusps are singular, and the scaling matrices have width one. The classical width of 1/s1/s is rr. For r>1r>1 they are inequivalent. The normalization is that of Paper I, (2.13)–(2.14). Compare [10, Lemmas 4.3, 4.5, (4.7)–(4.19)] [26, (2.13)–(2.14), p. 8].

Fact 3.10 ((F9) Bessel representations).

For x>0x>0, n∈ℤn\in\mathbb{Z}, and |ℜ⁡ν|<1|\Re\nu|<1,

Jn⁢(x)\displaystyle J_{n}(x) =π−1⁢∫0πcos⁡(x⁢sin⁡u−n⁢u)⁢𝑑u\displaystyle=\pi^{-1}\int_{0}^{\pi}\cos(x\sin u-nu)\,du
=i−n⁢π−1⁢∫0πei⁢x⁢cos⁡u⁢cos⁡(n⁢u)⁢𝑑u,\displaystyle\quad=i^{-n}\pi^{-1}\int_{0}^{\pi}e^{ix\cos u}\cos(nu)\,du,
Jν⁢(x)\displaystyle J_{\nu}(x) =(2/π)⁢∫0∞sin⁡(x⁢cosh⁡u−π⁢ν/2)⁢cosh⁡(ν⁢u)⁢𝑑u,\displaystyle=(2/\pi)\int_{0}^{\infty}\sin(x\cosh u-\pi\nu/2)\cosh(\nu u)\,du,
Yν⁢(x)\displaystyle Y_{\nu}(x) =−(2/π)⁢∫0∞cos⁡(x⁢cosh⁡u−π⁢ν/2)⁢cosh⁡(ν⁢u)⁢𝑑u,\displaystyle=-(2/\pi)\int_{0}^{\infty}\cos(x\cosh u-\pi\nu/2)\cosh(\nu u)\,du,
Kν⁢(x)\displaystyle K_{\nu}(x) =sec⁡(π⁢ν/2)⁢∫0∞cos⁡(x⁢sinh⁡u)⁢cosh⁡(ν⁢u)⁢𝑑u.\displaystyle=\sec(\pi\nu/2)\int_{0}^{\infty}\cos(x\sinh u)\cosh(\nu u)\,du.

The infinite integrals are improper. These are DLMF (10.9.2), (10.9.8), and (10.32.7) [25, (10.9.2), (10.9.8), (10.32.7)]. Paper I uses them on printed p. 20, (2.7.T31)–(2.7.T32).

Fact 3.11 ((F10) Kontorovich–Lebedev inversion).

For gg on (0,∞)(0,\infty), the inversion pair is

f⁢(y)=2⁢y⁢sinh⁡π⁢yπ2⁢∫0∞g⁢(x)⁢Ki⁢y⁢(x)⁢d⁢xx,g⁢(x)=∫0∞f⁢(y)⁢Ki⁢y⁢(x)⁢𝑑y.f(y)=\frac{2y\sinh\pi y}{\pi^{2}}\int_{0}^{\infty}g(x)K_{iy}(x)\frac{dx}{x},% \qquad g(x)=\int_{0}^{\infty}f(y)K_{iy}(x)\,dy.

It holds under either of two conditions. (a) g/x∈C1g/x\in C^{1}, with x⁢gxg and x⁢(g/x)′x(g/x)^{\prime} absolutely integrable. (b) Local piecewise continuity and bounded variation, with

∫01/2|g⁢(x)|x⁢log⁡(1/x)⁢𝑑x<∞,∫1/2∞|g⁢(x)|x⁢𝑑x<∞.\int_{0}^{1/2}\frac{|g(x)|}{x}\log(1/x)\,dx<\infty,\qquad\int_{1/2}^{\infty}% \frac{|g(x)|}{\sqrt{x}}\,dx<\infty.

Under condition (b), the inverse equality is asserted at continuity points of gg. In our applications, the inverse equality is used only at continuity points of gg. See DLMF (10.43.30)–(10.43.32) [25, (10.43.30)–(10.43.32)]. These hypotheses hold for g=ϕ/xg=\phi/x, ϕ∈Cc∞⁢((0,∞))\phi\in C_{c}^{\infty}((0,\infty)). They also hold for g=x⁢K2⁢i⁢t⁢(x)g=xK_{2it}(x) when |ℑ⁡t|≤7/64|\Im t|\leq 7/64. Near zero, K2⁢i⁢t⁢(x)≪tx−2⁢|ℑ⁡t|⁢(1+|log⁡x|)K_{2it}(x)\ll_{t}x^{-2|\Im t|}(1+|\log x|), so the first integral in condition (b) converges absolutely. At infinity, K2⁢i⁢t⁢(x)≪tx−1/2⁢e−xK_{2it}(x)\ll_{t}x^{-1/2}e^{-x}, so the second converges too. Both functions are smooth on compact subintervals.

Fact 3.12 ((F11) Hecke operators on the full space).

For trivial character and (k,q)=1(k,q)=1, Paper I proves

‖Tk‖Maass,q≤d⁢(k)⁢k7/64,‖Tk‖hol,q≤d⁢(k).\|T_{k}\|_{\mathrm{Maass},q}\leq d(k)k^{7/64},\qquad\|T_{k}\|_{\mathrm{hol},q}% \leq d(k).

Their proof uses the orthogonal cuspidal representation decomposition of Jacquet–Langlands, Chapter III, §16 [16, Chapter III, §16]. It also uses the holomorphic oldform classes of Atkin–Lehner [1, Lemmas 6, 13–15; Theorems 3(i), 5]. Atkin–Lehner’s weight kk means classical weight 2⁢k2k. For an unramified normalized newform, the algebra needed is

λf⁢(pr)=∑j=0rαpr−j⁢βpj,λf⁢(m⁢n)=λf⁢(m)⁢λf⁢(n)((m,n)=1).\lambda_{f}(p^{r})=\sum_{j=0}^{r}\alpha_{p}^{r-j}\beta_{p}^{j},\qquad\lambda_{% f}(mn)=\lambda_{f}(m)\lambda_{f}(n)\quad((m,n)=1).

The Maass Satake bound is |αp|,|βp|≤p7/64|\alpha_{p}|,|\beta_{p}|\leq p^{7/64} [17, Appendix 2]. The holomorphic bound is (F4). Full-space diagonalization and unitary transport give the displayed norms, as in Paper I, (2.7.T37)–(2.7.T40) [26, (2.7.T37)–(2.7.T40), pp. 21–22].

Fact 3.13 ((F12) Eisenstein inputs).

Paper I uses three classical Eisenstein properties. The Eisenstein family has a meromorphic continuation, which allows compact Fourier-coefficient extraction. It has an arithmetic Fourier normalization. There is a complete irredundant cusp set. For the cusp u/wu/w, let ddend_{\rm den} be the lower-row denominator variable in c⁢z+ddencz+d_{\rm den} and write the printed variable as d=−ddend=-d_{\rm den}. The printed denominator is therefore c⁢z−dcz-d, and the Fourier phase changes with this sign choice. Thus replacing dd by −d-d changes the congruence and the phase together, not one sign in isolation. The normalization includes the orbit conditions

(c,d)=1,(c,q)=w,c⁢d≡u⁢w(mod(w2,q)).(c,d)=1,\quad(c,q)=w,\quad cd\equiv uw\pmod{(w^{2},q)}.

With c=w⁢γc=w\gamma, the last condition is γ⁢d≡u(mod(w,q/w))\gamma d\equiv u\pmod{(w,q/w)}. The cusp set has the form

u/w,w∣q,u(mod(w,q/w)),(u,(w,q/w))=1,u/w,\quad w\mid q,\quad u\pmod{(w,q/w)},\quad(u,(w,q/w))=1,

with admissible lifts chosen coprime to qq. The sources are Iwaniec, Chapter 6 and Theorem 3.4; DI82 (1.17), Lemmas 2.3 and 3.6; and Kiral–Young, Proposition 3.1 and Corollary 3.2 [15, Chapter 6; Theorem 3.4] [9, (1.17), p. 227; Lemma 2.3, p. 240; Lemma 3.6, p. 247] [18, Proposition 3.1, Corollary 3.2]. These are the conventions used in Paper I, (2.7.T20)–(2.7.T24) and (2.7.T41)–(2.7.T43) [26, (2.7.T20)–(2.7.T24), (2.7.T41)–(2.7.T43), pp. 18–19, 22–23].

Fact 3.14 ((F13) Further spectral estimates).

For exceptional eigenfunctions, the first line below follows from (F3), since 975/4096>768/4096=3/16975/4096>768/4096=3/16 and 7/32<1/27/32<1/2. Paper I derives the interval estimate from (F5), (F6), (F7), (P1.1) and this first line. The last line is its supported imaginary-transform estimate:

(3.14) λj≥3/16,0<ϑj≤1/2,∑2≤q≤Q∑j⁢exceptional(q)Vϑj⁢|∑n∈Iρj⁢(n)|2≪ϵ(Q⁢Y)ϵ⁢(Q+Y+Y⁢V)⁢Y,Q,Y,V≥1,I⊂(Y,2⁢Y]∩ℤan integer interval,|ϕ^⁢(i⁢ν)|+|ϕˇ⁢(i⁢ν)|≪𝔅⁢(1+|log⁡Z|)⁢(1+Z−2⁢ν)/(1+Z),0<ν≤1/4.\begin{gathered}\lambda_{j}\geq 3/16,\qquad 0<\vartheta_{j}\leq 1/2,\\ \sum_{2\leq q\leq Q}\sum_{j\ {\rm exceptional}}^{(q)}V^{\vartheta_{j}}\left|% \sum_{n\in I}\rho_{j}(n)\right|^{2}\ll_{\epsilon}(QY)^{\epsilon}(Q+Y+\sqrt{YV}% )Y,\\ Q,Y,V\geq 1,\qquad I\subset(Y,2Y]\cap\mathbb{Z}\quad\text{an integer interval}% ,\\ |\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.\end{gathered}

The last line uses the supported test class of (P1.1). The interval argument uses DI82’s proof of Theorem 7, (8.17), with the corrected same-cusp normalization (F7) [9, proof of Theorem 7, (8.17)] [26, (2.9), (2.7.T32), pp. 6, 20]. The weaker gap 3/163/16 is also DI82, Theorem 4, p. 232, which we do not use separately. The reconstruction of the last estimate uses (F9).

Fact 3.15 ((F14) Transform identities and interchanges).

Paper I proves the following identities and accompanying interchange bounds in (2.7.T26)–(2.7.T32). Use the transforms (3.12) without rescaling. For ϕ∈Cc∞⁢((0,∞))\phi\in C_{c}^{\infty}((0,\infty)), put

(3.15) ℛϕ⁢(v)=∫0∞K2⁢i⁢v⁢(x)⁢ϕ⁢(x)⁢x−2⁢𝑑x,kϕ⁢(v)=4π2⁢v⁢sinh⁡(2⁢π⁢v)⁢ℛϕ⁢(v),ℋ⁢(t,v)=cosh⁡π⁢tcosh⁡π⁢(t−v)⁢cosh⁡π⁢(t+v),∫ℝkϕ⁢(v)⁢K2⁢i⁢v⁢(x)⁢𝑑v=ϕ⁢(x)/x,∫ℝv⁢sinh⁡(2⁢π⁢v)⁢ℋ⁢(t,v)⁢K2⁢i⁢v⁢(x)⁢𝑑v=cosh⁡(π⁢t)⁢x⁢K2⁢i⁢t⁢(x).\begin{gathered}\mathcal{R}_{\phi}(v)=\int_{0}^{\infty}K_{2iv}(x)\phi(x)x^{-2}% \,dx,\qquad k_{\phi}(v)=\frac{4}{\pi^{2}}v\sinh(2\pi v)\mathcal{R}_{\phi}(v),% \\ \mathcal{H}(t,v)=\frac{\cosh\pi t}{\cosh\pi(t-v)\cosh\pi(t+v)},\\ \int_{\mathbb{R}}k_{\phi}(v)K_{2iv}(x)\,dv=\phi(x)/x,\\ \int_{\mathbb{R}}v\sinh(2\pi v)\mathcal{H}(t,v)K_{2iv}(x)\,dv=\cosh(\pi t)xK_{% 2it}(x).\end{gathered}

By (F10), the KL hypotheses hold for both applications, to ϕ⁢(x)/x\phi(x)/x and to x⁢K2⁢i⁢t⁢(x)xK_{2it}(x). For the latter, the product-integral condition is |ℜ⁡(2⁢i⁢t)|+|ℜ⁡(2⁢i⁢v)|<1|\Re(2it)|+|\Re(2iv)|<1, with v∈ℝv\in\mathbb{R}. The permitted tt are real or exceptional, |ℑ⁡t|≤7/64|\Im t|\leq 7/64. The differentiations and contour, limit, sum, and integral interchanges in (2.7.T26)–(2.7.T32) hold in these ranges. This includes absolute summability after the spectral estimates. For each fixed smooth test family, the decay bound is

ℛϕ⁢(v)≪ϕ,je−π⁢|v|⁢(1+|v|)1−2⁢j(j≥0).\mathcal{R}_{\phi}(v)\ll_{\phi,j}e^{-\pi|v|}(1+|v|)^{1-2j}\qquad(j\geq 0).

Let supp⁡ϕ⊂[Z/21,9⁢Z]\operatorname{supp}\phi\subset[Z/21,9Z]. The integrations by parts and differentiated estimates retain the five-derivative seminorm 𝔅\mathfrak{B} of (P1.1), uniformly in every auxiliary parameter. For the following bounds U>0U>0, and the oscillatory kernels are the normalized combinations in (3.12); these estimates are not assertions about an unnormalized J2⁢i⁢tJ_{2it} tail. The hyperbolic factor in the raw Bessel representation is cancelled only after this normalization. For truncated normalized oscillatory representations, the tails are bounded by

O⁢(1+|t|x⁢sinh⁡U)(t∈ℝ),O⁢((1+ν)⁢e2⁢ν⁢Ux⁢sinh⁡U)(t=i⁢ν, 0<ν≤1/4).O\!\left(\frac{1+|t|}{x\sinh U}\right)\quad(t\in\mathbb{R}),\qquad O\!\left(% \frac{(1+\nu)e^{2\nu U}}{x\sinh U}\right)\quad(t=i\nu,\ 0<\nu\leq 1/4).

These tails permit the stated limiting interchanges. The derivative and decay constants are uniform in the families consumed by Theorem 2.8, with the losses prescribed there. The first inversion identity follows from (F10). The product integral, second kernel identity, and uniform differentiation and interchange steps are proved in the same passage [26, (2.7.T26)–(2.7.T32), pp. 19–20]. A reconstruction from the individual Bessel representations uses (F9).

Fact 3.16 ((P1.1) Supported real transforms).

For Z>0Z>0, let supp⁡ϕ⊂[Z/21,9⁢Z]\operatorname{supp}\phi\subset[Z/21,9Z] and set 𝔅=max0≤j≤5⁢supx>0xj⁢|ϕ(j)⁢(x)|\mathfrak{B}=\max_{0\leq j\leq 5}\sup_{x>0}x^{j}|\phi^{(j)}(x)|. Then

(3.16) |ϕ^⁢(t)|+|ϕˇ⁢(t)|\displaystyle|\widehat{\phi}(t)|+|\check{\phi}(t)| ≪𝔅⁢(1+|log⁡Z|)1+Z⁢min⁡{1,((1+Z)/|t|)3},t∈ℝ,\displaystyle\ll\frac{\mathfrak{B}(1+|\log Z|)}{1+Z}\min\{1,((1+Z)/|t|)^{3}\},% \quad t\in\mathbb{R},
|ϕ~⁢(l)|\displaystyle|\widetilde{\phi}(l)| ≪𝔅⁢(1+|log⁡Z|)1+Z⁢min⁡{1,((1+Z)/l)3},l∈ℕ.\displaystyle\ll\frac{\mathfrak{B}(1+|\log Z|)}{1+Z}\min\{1,((1+Z)/l)^{3}\},% \quad l\in\mathbb{N}.

The constants are absolute. The minimum at t=0t=0 is 11. This is the real-parameter part of Paper I, (2.7.T31) [26, (2.12), (2.7.T31), pp. 8, 20]. The real-transform bound uses exactly the Bessel representations in (F9). It does not cover the imaginary-parameter or interchange steps.

Write γE\gamma_{\!E} for Euler’s constant. The continuous linear-sieve functions are normalized by

(3.17) s⁢F⁢(s)=2⁢eγ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_{\!E}}\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}

Thus F⁢(1)=2⁢eγEF(1)=2e^{\gamma_{\!E}} and f⁢(s)=0f(s)=0 for 0<s≤20<s\leq 2. This is Paper I, (2.23), p. 10 [26, (2.23), p. 10].

Fact 3.17 ((P1.2) Structured linear sieve).

Let 𝒜\mathcal{A} be a finite integer sequence with nonnegative multiplicities, let 𝒫\mathcal{P} be a set of primes, and let 𝒳>0\mathcal{X}>0. For a multiplicative function ω\omega, set

(3.18) P⁢(z)=∏p<zp∈𝒫p,S⁢(𝒜,𝒫,z)=∑a∈𝒜1(a,P⁢(z))=1,|𝒜d|=ω⁢(d)d⁢𝒳+r⁢(𝒜,d),V⁢(z)=∏p<zp∈𝒫(1−ω⁢(p)p).\begin{gathered}P(z)=\prod_{\begin{subarray}{c}p<z\\ p\in\mathcal{P}\end{subarray}}p,\qquad S(\mathcal{A},\mathcal{P},z)=\sum_{a\in% \mathcal{A}}1_{(a,P(z))=1},\\ |\mathcal{A}_{d}|=\frac{\omega(d)}{d}\mathcal{X}+r(\mathcal{A},d),\qquad V(z)=% \prod_{\begin{subarray}{c}p<z\\ p\in\mathcal{P}\end{subarray}}\left(1-\frac{\omega(p)}{p}\right).\end{gathered}

Assume 0<ω⁢(p)<p0<\omega(p)<p on 𝒫\mathcal{P}, ω⁢(p)=0\omega(p)=0 off 𝒫\mathcal{P}, and ω⁢(pa)≥0\omega(p^{a})\geq 0. Suppose fixed K≥2K\geq 2 and Lω>1L_{\omega}>1 satisfy, for every z>w≥2z>w\geq 2,

(3.19) ∏w≤p<zp∈𝒫(1−ω⁢(p)p)−1≤log⁡zlog⁡w⁢(1+Klog⁡w),∑w≤p<zp∈𝒫∑a≥2ω⁢(pa)pa≤Lωlog⁡(3⁢w).\begin{gathered}\prod_{\begin{subarray}{c}w\leq p<z\\ p\in\mathcal{P}\end{subarray}}\left(1-\frac{\omega(p)}{p}\right)^{-1}\leq\frac% {\log z}{\log w}\left(1+\frac{K}{\log w}\right),\\ \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)}.\end{gathered}

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

(3.20) 𝒢⁢(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 the finite tuples 𝐃=(D1,…,Dk)\mathbf{D}=(D_{1},\ldots,D_{k}) from this grid such that Dk≤⋯≤D1<D1/2D_{k}\leq\cdots\leq D_{1}<D^{1/2}. Set

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

Each of these sets has fewer than exp⁡(8⁢ϵs−3)\exp(8\epsilon_{s}^{-3}) elements. There are coefficients ϕdν\phi_{d}^{\nu} and λdν⁢(𝐃)\lambda_{d}^{\nu}(\mathbf{D}), ν∈{+,−}\nu\in\{+,-\}, with |ϕdν|,|λdν⁢(𝐃)|≤1|\phi_{d}^{\nu}|,|\lambda_{d}^{\nu}(\mathbf{D})|\leq 1, independent of 𝒜,𝒳,ω\mathcal{A},\mathcal{X},\omega, for which

(3.22) S⁢(𝒜,𝒫,z)\displaystyle S(\mathcal{A},\mathcal{P},z) ≤𝒳⁢V⁢(z)⁢{F⁢(s)+Es}+R1++R+\displaystyle\leq\mathcal{X}V(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) ≥𝒳⁢V⁢(z)⁢{f⁢(s)−Es}−R1−−R−\displaystyle\geq\mathcal{X}V(z)\{f(s)-E_{s}\}-R_{1}^{-}-R^{-} (2≤z≤D1/2),\displaystyle(2\leq z\leq D^{1/2}),
s\displaystyle s =log⁡Dlog⁡z,Es≪ϵs+ϵs−8⁢eK+Lω⁢(log⁡D)−1/3.\displaystyle=\frac{\log D}{\log z},\qquad E_{s}\ll\epsilon_{s}+\epsilon_{s}^{% -8}e^{K+L_{\omega}}(\log D)^{-1/3}.

The implied constant in the last line is absolute. The signed remainders are

(3.23) 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)

and

(3.24) Rν=∑𝐃∈𝒟ν⁢(D)∑d<Dϵsd∣P⁢(Dϵs2)λdν⁢(𝐃)⁢∑Di≤pi<Di1+δspi∣P⁢(z)pi≠pj⁢((i,j)∈I⁢(𝐃))r⁢(𝒜,d⁢p1⁢⋯⁢pk).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_{k}).

Here I⁢(𝐃)I(\mathbf{D}) imposes distinctness between the equal-label positions in Iwaniec’s construction. Unequal grid intervals are disjoint. The coefficients may depend on 𝒫,D,z,ϵs,𝐃\mathcal{P},D,z,\epsilon_{s},\mathbf{D} and these distinctness conditions. We do not claim that coefficients at different cutoffs agree. See Paper I, Theorem 2.6, (2.22), (2.24), (2.27)–(2.33), pp. 10–12 [26, Theorem 2.6, (2.22), (2.24), (2.27)–(2.33), pp. 10–12]. Its classical source is Iwaniec, Theorem 4 [13, Theorem 4].

Below, the prime set is 𝒫N={p:p∤2⁢N}\mathcal{P}_{N}=\{p:p\nmid 2N\}. Take the nominal density ω⁢(p)=1\omega(p)=1 on 𝒫N\mathcal{P}_{N}, ω⁢(p)=0\omega(p)=0 elsewhere and ω⁢(pa)=0\omega(p^{a})=0 for a≥2a\geq 2. Then the second sum in (3.19) is zero. Mertens’ product estimate gives one fixed absolute KM≥2K_{\mathrm{M}}\geq 2 with

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

The first product in (3.19) is no larger than this product. Hence K=KMK=K_{\mathrm{M}}, Lω=2L_{\omega}=2 are valid for this nominal density. The factor in (3.22) is then eKM+2e^{K_{\mathrm{M}}+2}. See [26, pp. 10–11]. Each actual sequence still needs its own decomposition (3.18) and error estimate.

For every relative level Lc≥2L_{c}\geq 2 we use, exactly as in Paper I, (2.33a)–(2.33b), p. 12 [26, (2.33a)–(2.33b), p. 12],

(3.26) 0<σ≤10−10,τ=σ9,ϵs=σ,δs=τ,D=Lc,𝒢⁢(Lc)={Lcσ2⁢(1+τ)n:n≥0},d⁢<Lcσ,d∣⁢P⁢(Lcσ2).\begin{gathered}0<\sigma\leq 10^{-10},\qquad\tau=\sigma^{9},\qquad\epsilon_{s}% =\sigma,\quad\delta_{s}=\tau,\quad D=L_{c},\\ \mathcal{G}(L_{c})=\{L_{c}^{\sigma^{2}(1+\tau)^{n}}:n\geq 0\},\qquad d<L_{c}^{% \sigma},\quad d\mid P(L_{c}^{\sigma^{2}}).\end{gathered}

Thus the prime intervals, the smooth-divisor support and the level all refer to the same LcL_{c}. First fix σ>0\sigma>0. Then let NN tend to infinity.

Fact 3.18 ((P1.3) Finite factorization).

Let X≥2X\geq 2, K∈ℕK\in\mathbb{N}, and z≥1z\geq 1. Assume zK>Xz^{K}>X. For every integer 1≤n≤X1\leq n\leq X,

(3.27) Λ⁢(n)=∑j=1K(−1)j−1⁢(Kj)⁢∑m1⁢⋯⁢mj⁢n1⁢⋯⁢nj=nmi≤zμMob⁢(m1)⁢⋯⁢μMob⁢(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_{\rm Mob}(m_{1})\cdots\mu_{\rm Mob}(m_{j})\log n% _{1}.

This is Paper I, Lemma 2.7, (2.36), p. 13 [26, Lemma 2.7, (2.36), p. 13].

Proof.

For ℜ⁡s>1\Re s>1, set Mz⁢(s)=∑m≤zμMob⁢(m)⁢m−sM_{z}(s)=\sum_{m\leq z}\mu_{\rm Mob}(m)m^{-s} and Yz⁢(s)=ζ⁢(s)⁢Mz⁢(s)Y_{z}(s)=\zeta(s)M_{z}(s). The polynomial identity 1−(1−Yz)K=∑j=1K(−1)j−1⁢(Kj)⁢Yzj1-(1-Y_{z})^{K}=\sum_{j=1}^{K}(-1)^{j-1}\binom{K}{j}Y_{z}^{j} gives

−ζ′ζ=∑j=1K(−1)j−1⁢(Kj)⁢(−ζ′)⁢ζj−1⁢Mzj+(−ζ′ζ)⁢(1−Yz)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_{z% })^{K}.

Every nonzero coefficient of Yz−1Y_{z}-1 has index greater than zz. The last term therefore has no coefficient at n≤X<zKn\leq X<z^{K}; coefficient extraction proves (3.27). ∎

For n≤2⁢Xmn\leq 2X_{m}, choose K=3K=3, z=2⁢Xm1/3z=2X_{m}^{1/3}. Then z3=8⁢Xm>2⁢Xmz^{3}=8X_{m}>2X_{m}. Any interval partition is imposed after (3.27). The product condition and all representation multiplicities remain in the resulting coefficients. See [26, (2.36)–(2.37), p. 13].

For the packing theorem, put μ∗=25/128\mu_{*}=25/128 and define the packing ceiling by

Hpk,max=153256.H_{\rm pk,max}=\frac{153}{256}.

Use this constant in the packing hypotheses below. Put

(3.28) vpk⁢(x)=min⁡{1+x2,32−34⁢x39,5764−32⁢x}(x≥0),ψpk⁢(x,y)=x⁢1x≥y(x∈ℝ,y≥0),wpk⁢(x1,x2,x3)=ψpk⁢(min⁡{132−68⁢x3214,153−96⁢x3256,1−2⁢x2},1+x12).\begin{gathered}v_{\rm pk}(x)=\min\left\{\frac{1+x}{2},\frac{32-34x}{39},\frac% {57}{64}-\frac{3}{2}x\right\}\quad(x\geq 0),\\ \psi_{\rm pk}(x,y)=x1_{x\geq y}\quad(x\in\mathbb{R},\ y\geq 0),\\ w_{\rm pk}(x_{1},x_{2},x_{3})=\psi_{\rm pk}\left(\min\left\{\frac{132-68x_{3}}% {214},\frac{153-96x_{3}}{256},1-2x_{2}\right\},\frac{1+x_{1}}{2}\right).\end{gathered}

For x1≥x2≥x3≥0x_{1}\geq x_{2}\geq x_{3}\geq 0, define

(3.29) H(x1,x2,x3)=max{\displaystyle H(x_{1},x_{2},x_{3})=\max\{ vpk⁢(x1),vpk⁢(x2),vpk⁢(x1+x2),vpk⁢(x1+x2+x3),\displaystyle v_{\rm pk}(x_{1}),v_{\rm pk}(x_{2}),v_{\rm pk}(x_{1}+x_{2}),v_{% \rm pk}(x_{1}+x_{2}+x_{3}),
wpk⁢(x1,x2,x3),wpk⁢(x1,x3,x2),\displaystyle w_{\rm pk}(x_{1},x_{2},x_{3}),w_{\rm pk}(x_{1},x_{3},x_{2}),
ψpk⁢(vpk⁢(x1+x3),x1+2⁢x2+x3),\displaystyle\psi_{\rm pk}(v_{\rm pk}(x_{1}+x_{3}),x_{1}+2x_{2}+x_{3}),
ψpk(vpk(x2+x3),2x1+x2+x3)},\displaystyle\psi_{\rm pk}(v_{\rm pk}(x_{2}+x_{3}),2x_{1}+x_{2}+x_{3})\},
H~⁢(x1,x2,x3)\displaystyle\widetilde{H}(x_{1},x_{2},x_{3}) ={H⁢(x1,x2,x3),x1≤μ∗,vpk⁢(x1),x1>μ∗.\displaystyle=\begin{cases}H(x_{1},x_{2},x_{3}),&x_{1}\leq\mu_{*},\\ v_{\rm pk}(x_{1}),&x_{1}>\mu_{*}.\end{cases}

These are the definitions preceding Paper I, Theorem 4.1, p. 53 [26, p. 53].

Fact 3.19 ((P1.4) Three-factor packing).

Let 0<δpk≤3⋅10−90<\delta_{\rm pk}\leq 3\cdot 10^{-9}, 1/2≤h≤Hpk,max1/2\leq h\leq H_{\rm pk,max}, d∗=h−2⁢δpkd_{*}=h-2\delta_{\rm pk}, and δpk≤g≤1/3−δpk/2\delta_{\rm pk}\leq g\leq 1/3-\delta_{\rm pk}/2. Let e1≥⋯≥em≥0e_{1}\geq\cdots\geq e_{m}\geq 0 be a finite labelled list. Equal values keep distinct labels. The empty list is allowed. Extend the list by zeros, writing e¯i=0\bar{e}_{i}=0 for i>mi>m. Suppose

(3.30) ∑i<jei+2⁢ej≤h−2⁢δpk(1≤j≤m),h≤H~⁢(e¯1,e¯2,e¯3).\sum_{i<j}e_{i}+2e_{j}\leq h-2\delta_{\rm pk}\quad(1\leq j\leq m),\qquad h\leq% \widetilde{H}(\bar{e}_{1},\bar{e}_{2},\bar{e}_{3}).

The rule of Paper I, Section 4.1, partitions the labels as J1⊔J2⊔J3J_{1}\sqcup J_{2}\sqcup J_{3}. With Σs=∑i∈Jsei\Sigma_{s}=\sum_{i\in J_{s}}e_{i} and θsp=7/32\theta_{\rm sp}=7/32,

(3.31) Σ1\displaystyle\Sigma_{1} ≤g,\displaystyle\leq g,
2⁢g+Σ2+2⁢Σ3\displaystyle 2g+\Sigma_{2}+2\Sigma_{3} ≤1−4⁢δpk,\displaystyle\leq 1-4\delta_{\rm pk},
θsp+g+Σ1+5⁢Σ2+2⁢Σ3\displaystyle\theta_{\rm sp}+g+\Sigma_{1}+5\Sigma_{2}+2\Sigma_{3} ≤2−4⁢δpk,\displaystyle\leq 2-4\delta_{\rm pk},
(1+2⁢θsp)⁢g+Σ1+(5−2⁢θsp)⁢Σ2+(2+2⁢θsp)⁢Σ3\displaystyle(1+2\theta_{\rm sp})g+\Sigma_{1}+(5-2\theta_{\rm sp})\Sigma_{2}+(% 2+2\theta_{\rm sp})\Sigma_{3} ≤2−4⁢(1+θsp)⁢δpk.\displaystyle\leq 2-4(1+\theta_{\rm sp})\delta_{\rm pk}.

The partition depends only on these data. This is Paper I, Theorem 4.1, (4.1)–(4.3), pp. 53–54 [26, Theorem 4.1, (4.1)–(4.3), pp. 53–54].

Fact 3.20 ((P1.5) Continuous Hecke comparison).

Assume the three Eisenstein statements in (F12). Let w∣qw\mid q, put w′=(w,q/w)w^{\prime}=(w,q/w), and let χ\chi be a Dirichlet character modulo w′w^{\prime}. Then Paper I, (2.7.T41)–(2.7.T43), gives

(3.32) φu/w,∞,n⁢(z)\displaystyle\varphi_{u/w,\infty,n}(z) =(w′/(w⁢q))z⁢∑γ≥1(γ,q/w)=1γ−2⁢z⁢∑d⁢(γ⁢w)(d,γ⁢w)=1γ⁢d≡u⁢(w′)e⁢(−n⁢d/(γ⁢w)),\displaystyle=(w^{\prime}/(wq))^{z}\sum_{\begin{subarray}{c}\gamma\geq 1\\ (\gamma,q/w)=1\end{subarray}}\gamma^{-2z}\sum_{\begin{subarray}{c}d\ (\gamma w% )\\ (d,\gamma w)=1\\ \gamma d\equiv u\ (w^{\prime})\end{subarray}}e(-nd/(\gamma w)),
𝒱χ⁢(n;z)\displaystyle\mathcal{V}_{\chi}(n;z) =∑u⁢(w′)∗χ⁢(u)⁢φu/w,∞,n⁢(z),\displaystyle=\sum_{u\ (w^{\prime})}^{*}\chi(u)\varphi_{u/w,\infty,n}(z),
𝒱χ⁢(k⁢n′;z)\displaystyle\mathcal{V}_{\chi}(kn^{\prime};z) =χ⁢(k)¯⁢(∑d∣kχ⁢(d)2⁢d1−2⁢z)⁢𝒱χ⁢(n′;z),(k,q)=(k,n′)=1.\displaystyle=\overline{\chi(k)}\left(\sum_{d\mid k}\chi(d)^{2}d^{1-2z}\right)% \mathcal{V}_{\chi}(n^{\prime};z),\quad(k,q)=(k,n^{\prime})=1.

The first identity initially holds for ℜ⁡z>1\Re z>1. The last extends meromorphically. For finitely supported vn′v_{n^{\prime}} in this coprime range,

(3.33) ∑𝔞|∑n′vn′⁢|k⁢n′|i⁢t⁢φ𝔞⁢∞,k⁢n′⁢(1/2+i⁢t)|2\displaystyle\sum_{\mathfrak{a}}\left|\sum_{n^{\prime}}v_{n^{\prime}}|kn^{% \prime}|^{it}\varphi_{\mathfrak{a}\infty,kn^{\prime}}(1/2+it)\right|^{2}
≤d⁢(k)2⁢∑𝔞|∑n′vn′⁢|n′|i⁢t⁢φ𝔞⁢∞,n′⁢(1/2+i⁢t)|2.\displaystyle\qquad\leq d(k)^{2}\sum_{\mathfrak{a}}\left|\sum_{n^{\prime}}v_{n% ^{\prime}}|n^{\prime}|^{it}\varphi_{\mathfrak{a}\infty,n^{\prime}}(1/2+it)% \right|^{2}.

It holds almost everywhere in real tt, for either index sign [26, (2.7.T41)–(2.7.T43), pp. 22–23].

Proof.

In (3.32), write the modulus c1=w⁢γ=c1′⁢c1′′c_{1}=w\gamma=c_{1}^{\prime}c_{1}^{\prime\prime}, where (c1′,q)=1(c_{1}^{\prime},q)=1 and every prime of c1′′c_{1}^{\prime\prime} divides qq. CRT factors the inner character sum as χ⁢(c1′)⁢Gχ⁢(−n;c1′′)⁢cc1′⁢(n)\chi(c_{1}^{\prime})G_{\chi}(-n;c_{1}^{\prime\prime})c_{c_{1}^{\prime}}(n). Here GχG_{\chi} is the corresponding finite Gauss sum and cc1′c_{c_{1}^{\prime}} is the Ramanujan sum. The outer character supplies another χ⁢(c1′)\chi(c_{1}^{\prime}). The coprime 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_{\begin{subarray}{c}d\mid|n|\\ (d,q)=1\end{subarray}}\chi^{2}(d)d^{1-2z},

where L(q)L^{(q)} omits Euler factors at primes dividing qq. For (k,q)=(k,n′)=1(k,q)=(k,n^{\prime})=1, its divisor sum factors at n=k⁢n′n=kn^{\prime}. Changing the Gauss-sum variable supplies χ⁢(k)¯\overline{\chi(k)}. Absolute convergence for ℜ⁡z>1\Re z>1, followed by meromorphic continuation, proves the last identity in (3.32). At z=1/2+i⁢tz=1/2+it, the character multiplier is

χ⁢(k)¯⁢∑d∣kχ⁢(d)2⁢(k/d2)i⁢t.\overline{\chi(k)}\sum_{d\mid k}\chi(d)^{2}(k/d^{2})^{it}.

Its modulus is at most d⁢(k)d(k). Orthogonality over the complete cusp set proves the inequality. ∎

Fact 3.21 ((P1.6) Exceptional parameters on the full space).

Apply (F3) to Γ0⁢(q)\Gamma_{0}(q). Every exceptional eigenfunction in the full Γ0⁢(q)\Gamma_{0}(q) space then has

ϑj=2⁢1/4−λj≤7/32.\vartheta_{j}=2\sqrt{1/4-\lambda_{j}}\leq 7/32.

The bound depends only on the eigenvalue, so it covers oldforms. These are the parameters in Paper I, (2.7.T32), (2.7.T52), and (2.7.T56) [26, (2.7.T32), (2.7.T52), (2.7.T56), pp. 20, 24–25].

Fact 3.22 ((P1.7) The spectral estimate).

Paper I, Theorem 2.8, proves the estimate below. Its proof uses the large sieves (F6) and the trace formulas (F7)–(F8). It also uses the transform bounds (P1.1), (F13)–(F14), the full-space Hecke bounds (F11), and the continuous and exceptional comparisons (P1.5)–(P1.6). The normalized unitary cusp transport, proved in Paper I, (2.7.T33)–(2.7.T40), is as follows. Choose r⁢w−s⁢y=1rw-sy=1 and use

(3.34) Wr⁢s=r−1/2⁢(ryr⁢sr⁢w),Wr⁢s⁢Γ0⁢(r⁢s)⁢Wr⁢s−1=Γ0⁢(r⁢s),ρF,1/s⁢(n)=e⁢(n⁢s¯/r)⁢ρF∘Wr⁢s,∞⁢(n),ψF,1/s⁢(n)=e⁢(n⁢s¯/r)⁢ψF|Wr⁢s,∞⁢(n),φ𝔞,1/s,n⁢(z)=e⁢(n⁢s¯/r)⁢φWr⁢s−1⁢𝔞,∞,n⁢(z),Tk⁢F⁢(z)=k−1/2⁢∑h⁢d=k∑j⁢(d)F⁢((h⁢z+j)/d),cTk⁢F⁢(n)=∑h∣(k,n)cF⁢(k⁢n/h2).\begin{gathered}W_{rs}=r^{-1/2}\begin{pmatrix}r&y\\ rs&rw\end{pmatrix},\qquad W_{rs}\Gamma_{0}(rs)W_{rs}^{-1}=\Gamma_{0}(rs),\\ \rho_{F,1/s}(n)=e(n\bar{s}/r)\rho_{F\circ W_{rs},\infty}(n),\qquad\psi_{F,1/s}% (n)=e(n\bar{s}/r)\psi_{F|W_{rs},\infty}(n),\\ \varphi_{\mathfrak{a},1/s,n}(z)=e(n\bar{s}/r)\varphi_{W_{rs}^{-1}\mathfrak{a},% \infty,n}(z),\\ T_{k}F(z)=k^{-1/2}\sum_{hd=k}\sum_{j\ (d)}F((hz+j)/d),\qquad c_{T_{k}F}(n)=% \sum_{h\mid(k,n)}c_{F}(kn/h^{2}).\end{gathered}

The last line is the Maass normalization, with (k,r⁢s)=1(k,rs)=1. For holomorphic forms use the normalized coefficients of (F11). These formulas fix the normalization of the following theorem.

Let C,D,Y,R,S,AT≥1C,D,Y,R,S,A_{T}\geq 1 and 0<ϵ0<1/1000<\epsilon_{0}<1/100. Let aT∈ℤa_{T}\in\mathbb{Z} satisfy 0<|aT|≤AT0<|a_{T}|\leq A_{T}. Let bn,r,sb_{n,r,s} be supported on

(3.35) 0<n≤Y,r∼R,s∼S,(aT,r⁢s)=1.0<n\leq Y,\qquad r\sim R,\qquad s\sim S,\qquad(a_{T},rs)=1.

Let gg be smooth, supported in (C,2⁢C]×(D,2⁢D]×ℝ>03(C,2C]\times(D,2D]\times\mathbb{R}_{>0}^{3}, with

(3.36) |∂νg⁢(c,d,n,r,s)|≤Gν⁢(c−ν1⁢d−ν2⁢n−ν3⁢r−ν4⁢s−ν5)1−ϵ0(ν∈ℤ≥05).|\partial^{\nu}g(c,d,n,r,s)|\leq G_{\nu}(c^{-\nu_{1}}d^{-\nu_{2}}n^{-\nu_{3}}r% ^{-\nu_{4}}s^{-\nu_{5}})^{1-\epsilon_{0}}\quad(\nu\in\mathbb{Z}_{\geq 0}^{5}).

Set 𝒳=2+AT⁢C⁢D⁢Y⁢R⁢S\mathcal{X}=2+A_{T}CDYRS and θsp=7/32\theta_{\rm sp}=7/32. For every ϵ>0\epsilon>0,

(3.37) |∑(r,s)=1∑0<n≤Ybn,r,s⁢∑c,d≥1(r⁢d,s⁢c)=1g⁢(c,d,n,r,s)⁢e⁢(aT⁢n⁢r⁢d¯s⁢c)|≪ϵ,ϵ0,{Gν}𝒳ϵ+18⁢ϵ0⁢J∗⁢(aT),\left|\sum_{(r,s)=1}\sum_{0<n\leq Y}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{a_{T}n\overline{rd}}{sc}% \right)\right|\ll_{\epsilon,\epsilon_{0},\{G_{\nu}\}}\mathcal{X}^{\epsilon+18% \epsilon_{0}}J_{*}(a_{T}),

where the inverse is modulo s⁢csc, and

(3.38) J∗⁢(aT)2=\displaystyle J_{*}(a_{T})^{2}={} ∑n′′∣aT∞n′′≤2⁢YATθsp⁢(n′′)θsp\displaystyle\sum_{\begin{subarray}{c}n^{\prime\prime}\mid a_{T}^{\infty}\\ n^{\prime\prime}\leq 2Y\end{subarray}}A_{T}^{\theta_{\rm sp}}(n^{\prime\prime}% )^{\theta_{\rm sp}}
×[C⁢S⁢(Yn′′+R⁢S)⁢(C+D⁢R)+|aT|⁢Y⁢R⁢S]⁢‖b~⁢(n′′)‖22\displaystyle\quad\times\left[CS\left(\frac{Y}{n^{\prime\prime}}+RS\right)(C+% DR)+|a_{T}|YRS\right]\|\widetilde{b}(n^{\prime\prime})\|_{2}^{2}
+[CS(CDR)2⁢θsp(Y+RS)1−θsp\displaystyle+\left[CS(CD\sqrt{R})^{2\theta_{\rm sp}}(Y+RS)^{1-\theta_{\rm sp}% }\right.
×(C+DR)1−2⁢θsp+D2YR]∥b∥22,\displaystyle\qquad\left.\times(C+DR)^{1-2\theta_{\rm sp}}+D^{2}YR\right]\|b\|% _{2}^{2},
‖b‖22=\displaystyle\|b\|_{2}^{2}={} ∑n,r,s|bn,r,s|2,‖b~⁢(n′′)‖22=∑n′,r,s(n′,aT)=1|bn′⁢n′′,r,s|2.\displaystyle\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_{T})=1\end{subarray}}|b_{n^{\prime}n^{\prime\prime},r,s}|^{2}.

Here n′′∣aT∞n^{\prime\prime}\mid a_{T}^{\infty} means that every prime factor of n′′n^{\prime\prime} divides aTa_{T}. It includes n′′=1n^{\prime\prime}=1; when aT=±1a_{T}=\pm 1, only n′′=1n^{\prime\prime}=1 occurs. The bound is uniform in (aT,AT,C,D,Y,R,S,b)(a_{T},A_{T},C,D,Y,R,S,b). These are Paper I, Theorem 2.8, (2.38)–(2.43) [26, Theorem 2.8, (2.38)–(2.43), pp. 14–15].

Section 8 checks the masked coefficients, intervals and support of the fourth switched row.

4. Finite source identities and decomposition

Throughout this section, NN is an even integer with N≥2N\geq 2. Further size hypotheses appear at each display or just before it. Use L=log⁡NL=\log N from Section 2. We prove the finite identities of this section below. They count each occurrence with its multiplicity. The later analytic estimates are separate hypotheses. Use 𝒜N,Gb⁢(N),ε,a,b\mathcal{A}_{N},G_{b}(N),\varepsilon,a,b from (1.2)–(1.3) and α,β,μ∗,λ,t0,u\alpha,\beta,\mu_{*},\lambda,t_{0},u from (2.1). Take the roughness cutoff zs=Nαz_{s}=N^{\alpha} from the Root–A scale definition in (6.1). Throughout, nn is a positive source integer. When n∈𝒜Nn\in\mathcal{A}_{N}, n=N−pn=N-p for a prime pp. In a source sum, ee is the integer being counted. The letters p,pi,ai,rp,p_{i},a_{i},r denote prime variables, qq is a positive modulus, and mm is the factor or cofactor specified by its sum. Paper-II counts use n=d⁢mn=dm; the marked count of Section 6 uses m=(N−e)/pm=(N-e)/p. These roles are local to the displayed source. Here Ω⁢(n)\Omega(n) counts prime factors with multiplicity. For squarefree dd with (d,N)=1(d,N)=1, define

(4.1) SII(d;y)=#{n=dm∈𝒜N:P−(m)≥y,(m,Nd)=1}.(2∣N,N≥2).S^{\mathrm{II}}(d;y)=\#\{n=dm\in\mathcal{A}_{N}:P^{-}(m)\geq y,\ (m,Nd)=1\}.% \qquad(2\mid N,\ N\geq 2).

Set this count to zero for other dd. For admissible dd, it is Paper II’s (1.7) count in our notation [27, (1.7)]. The zero value for other dd is our convention. Put xi=log⁡pi/log⁡Nx_{i}=\log p_{i}/\log N. The tenth row uses

(4.2) C10=5764−1500−115⁢α,B10⁢(x)={β,β≤x<μ∗,min⁡{β,max⁡{α,C10−5⁢x/2}},μ∗≤x<λ.(2∣N,N≥2).\begin{aligned} C_{10}&=\frac{57}{64}-\frac{1}{500}-\frac{11}{5}\alpha,\\ B_{10}(x)&=\begin{cases}\beta,&\beta\leq x<\mu_{*},\\ \min\{\beta,\max\{\alpha,C_{10}-5x/2\}\},&\mu_{*}\leq x<\lambda.\end{cases}% \end{aligned}\qquad(2\mid N,\ N\geq 2).

Table 4.1 lists all thirteen sums with every divisor and cutoff of [27, (1.6)–(1.7), row table]. All pip_{i} in the table are prime. Each admissible divisor contributes separately.

Table 4.1. The Paper II source sums. Each row sums SII⁢(d;y)S^{\mathrm{II}}(d;y).
Row Coefficient Divisor and domain Cutoff yy
S1S_{1} 33 d=1d=1 NαN^{\alpha}
S2S_{2} 11 d=1d=1 NβN^{\beta}
S3S_{3} −2-2 d=p1,α≤x1<μ∗d=p_{1},\ \alpha\leq x_{1}<\mu_{*} NαN^{\alpha}
S4S_{4} −1-1 d=p1,μ∗≤x1<1/4d=p_{1},\ \mu_{*}\leq x_{1}<1/4 NαN^{\alpha}
S5S_{5} −1-1 d=p1, 1/4≤x1<t0d=p_{1},\ 1/4\leq x_{1}<t_{0} NαN^{\alpha}
S6S_{6} −1-1 d=p1,t0≤x1<1/3d=p_{1},\ t_{0}\leq x_{1}<1/3 NαN^{\alpha}
S7S_{7} −1-1 d=p1,μ∗≤x1<λd=p_{1},\ \mu_{*}\leq x_{1}<\lambda NαN^{\alpha}
S8S_{8} 11 d=p1⁢p2,d=p_{1}p_{2},
α≤x2<x1<β\alpha\leq x_{2}<x_{1}<\beta
NαN^{\alpha}
S9S_{9} 11 d=p1⁢p2,d=p_{1}p_{2},
α≤x2<β≤x1<μ∗\alpha\leq x_{2}<\beta\leq x_{1}<\mu_{*}
NαN^{\alpha}
S10S_{10} 11 d=p1⁢p2,μ∗≤x1<λ,d=p_{1}p_{2},\ \mu_{*}\leq x_{1}<\lambda,
α≤x2<B10⁢(x1)\alpha\leq x_{2}<B_{10}(x_{1})
NαN^{\alpha}
S11S_{11} −2-2 d=p1⁢p2,λ≤x1<1/3,d=p_{1}p_{2},\ \lambda\leq x_{1}<1/3,
x1<x2<(1−x1)/2x_{1}<x_{2}<(1-x_{1})/2
p2p_{2}
S12S_{12} −1-1 d=p1⁢p2,d=p_{1}p_{2},
α≤x1<1/3≤x2<(1−x1)/2\alpha\leq x_{1}<1/3\leq x_{2}<(1-x_{1})/2
p2p_{2}
S13S_{13} −1-1 d=p1⁢p2,d=p_{1}p_{2},
β≤x1<λ≤x2<(1−x1)/2\beta\leq x_{1}<\lambda\leq x_{2}<(1-x_{1})/2
N/(p1⁢p2)\sqrt{N/(p_{1}p_{2})}

Let 𝒟i\mathcal{D}_{i} be the displayed divisor domain and yi⁢(d)y_{i}(d) its cutoff. Define the row occurrences by

(4.3) ϑi(n)=∑d∈𝒟id∣nd⁢squarefree,(d,N)=11P−⁢(n/d)≥yi⁢(d)1(n/d,N⁢d)=1.(2∣N,N≥2).\vartheta_{i}(n)=\sum_{\begin{subarray}{c}d\in\mathcal{D}_{i}\\ d\mid n\\ d\ \mathrm{squarefree},\ (d,N)=1\end{subarray}}1_{P^{-}(n/d)\geq y_{i}(d)}1_{(% n/d,Nd)=1}.\qquad(2\mid N,\ N\geq 2).

Thus Si=∑d∈𝒟iSII⁢(d;yi⁢(d))S_{i}=\sum_{d\in\mathcal{D}_{i}}S^{\mathrm{II}}(d;y_{i}(d)). Keep every cofactor and endpoint restriction. Define

(4.4) Si=∑n∈𝒜Nϑi⁢(n)(1≤i≤13),W13⁢(n)=3⁢ϑ1⁢(n)+ϑ2⁢(n)−2⁢ϑ3⁢(n)−ϑ4⁢(n)−ϑ5⁢(n)−ϑ6⁢(n)−ϑ7⁢(n)+ϑ8⁢(n)+ϑ9⁢(n)+ϑ10⁢(n)−2⁢ϑ11⁢(n)−ϑ12⁢(n)−ϑ13⁢(n),ssw⁢(n)=1Ω⁢(n)≥3⁢max⁡{W13⁢(n),0},Ssw=∑n∈𝒜Nssw⁢(n),w⁢(n)=W13⁢(n)−ssw⁢(n),𝒲=∑n∈𝒜Nw⁢(n).(2∣N,N≥2).\begin{aligned} S_{i}&=\sum_{n\in\mathcal{A}_{N}}\vartheta_{i}(n)\qquad(1\leq i% \leq 13),\\ W_{13}(n)&=3\vartheta_{1}(n)+\vartheta_{2}(n)-2\vartheta_{3}(n)-\vartheta_{4}(% n)-\vartheta_{5}(n)-\vartheta_{6}(n)-\vartheta_{7}(n)\\ &{}+\vartheta_{8}(n)+\vartheta_{9}(n)+\vartheta_{10}(n)-2\vartheta_{11}(n)-% \vartheta_{12}(n)-\vartheta_{13}(n),\\ s_{\mathrm{sw}}(n)&=1_{\Omega(n)\geq 3}\max\{W_{13}(n),0\},\\ S_{\mathrm{sw}}&=\sum_{n\in\mathcal{A}_{N}}s_{\mathrm{sw}}(n),\qquad w(n)=W_{1% 3}(n)-s_{\mathrm{sw}}(n),\qquad\mathcal{W}=\sum_{n\in\mathcal{A}_{N}}w(n).\end% {aligned}\qquad(2\mid N,\ N\geq 2).

This is the complete switched source of Paper II, (1.9) [27, (1.9)]. Every divisor prime and cofactor cutoff is at least NαN^{\alpha}. For S13S_{13} the cutoff exceeds N(1−λ)/4>NαN^{(1-\lambda)/4}>N^{\alpha}. Thus every ϑi⁢(n)\vartheta_{i}(n) vanishes when P−⁢(n)<NαP^{-}(n)<N^{\alpha}, so the extra roughness indicator of Paper II is redundant. Use P−⁢(1)=∞P^{-}(1)=\infty as in Table 2.1. Finite linearity gives

(4.5) 𝒲=3⁢S1+S2−2⁢S3−S4−S5−S6−S7+S8+S9+S10−2⁢S11−S12−S13−Ssw.(2∣N,N≥2).\begin{aligned} \mathcal{W}={}&3S_{1}+S_{2}-2S_{3}-S_{4}-S_{5}-S_{6}-S_{7}\\ &+S_{8}+S_{9}+S_{10}-2S_{11}-S_{12}-S_{13}-S_{\mathrm{sw}}.\end{aligned}\qquad% (2\mid N,\ N\geq 2).

4.1. The representation count

Put

(4.6) gb⁢(e)=#⁢{(p1,p2)∈ℙ2:Nb≤p1≤N,ε⁢N<p1⁢p2=e<N},Bb=∑egb⁢(e)⁢1N−e∈ℙ,P2=#⁢{n∈𝒜N:Ω⁢(n)≤2}.(2∣N,N≥2).\begin{aligned} g_{b}(e)&=\#\{(p_{1},p_{2})\in\mathbb{P}^{2}:N^{b}\leq p_{1}% \leq\sqrt{N},\ \varepsilon N<p_{1}p_{2}=e<N\},\\ B_{b}&=\sum_{e}g_{b}(e)1_{N-e\in\mathbb{P}},\qquad P_{2}=\#\{n\in\mathcal{A}_{% N}:\Omega(n)\leq 2\}.\end{aligned}\qquad(2\mid N,\ N\geq 2).

When ee has distinct prime factors and both choices satisfy the first-factor cutoff, both orientations are counted. For e=p2e=p^{2}, there is only the ordered pair (p,p)(p,p). Hence

(4.7) 0≤gb(e)≤2,P2−Gb(N)≤Bb(εN>1).(2∣N,N≥2).0\leq g_{b}(e)\leq 2,\qquad P_{2}-G_{b}(N)\leq B_{b}\qquad(\varepsilon N>1).% \qquad(2\mid N,\ N\geq 2).

For the second inequality, write n=r⁢sn=rs, r≤sr\leq s, with both factors prime. If nn is excluded from GbG_{b}, then

(4.8) Nb≤r≤n<N,gb(n)≥1.(2∣N,N≥2,εN>1).N^{b}\leq r\leq\sqrt{n}<\sqrt{N},\qquad g_{b}(n)\geq 1.\qquad(2\mid N,\ N\geq 2% ,\ \varepsilon N>1).

Prime squares are counted with their actual multiplicity.

Define

(4.9) ℰ={n∈𝒜N:P−(n)≥zs,n is not squarefree or (n,N)>1}.(2∣N,N≥2).\mathcal{E}=\{n\in\mathcal{A}_{N}:P^{-}(n)\geq z_{s},\ n\text{ is not % squarefree or }(n,N)>1\}.\qquad(2\mid N,\ N\geq 2).

For zs=Nα≥2z_{s}=N^{\alpha}\geq 2,

(4.10) #⁢{n∈ℰ:n⁢ is not squarefree}≤N⁢∑k≥⌈zs⌉k−2≤2⁢Nzs,#⁢{n≤N:P−⁢(n)≥zs,(n,N)>1}≤∑ℓ∈ℙ,ℓ∣Nℓ≥zsNℓ≤11⁢Nzs,|ℰ|≤13⁢N1−α.(2∣N,N≥21/α).\begin{aligned} \#\{n\in\mathcal{E}:n\text{ is not squarefree}\}&\leq N\sum_{k% \geq\lceil z_{s}\rceil}k^{-2}\leq\frac{2N}{z_{s}},\\ \#\{n\leq N:P^{-}(n)\geq z_{s},\ (n,N)>1\}&\leq\sum_{\begin{subarray}{c}\ell% \in\mathbb{P},\ \ell\mid N\\ \ell\geq z_{s}\end{subarray}}\frac{N}{\ell}\leq\frac{11N}{z_{s}},\\ |\mathcal{E}|&\leq 13N^{1-\alpha}.\end{aligned}\qquad(2\mid N,\ N\geq 2^{1/% \alpha}).

The prime divisors in the middle sum are distinct. Their number is at most ⌊1/α⌋=11\lfloor 1/\alpha\rfloor=11.

Set Npt=1+⌈max⁡{21/α,ε−3,ε−1/(1−λ−β)}⌉N_{\mathrm{pt}}=1+\left\lceil\max\{2^{1/\alpha},\varepsilon^{-3},\varepsilon^{% -1/(1-\lambda-\beta)}\}\right\rceil.

Lemma 4.1 (Pointwise source weight bound).

For all N≥NptN\geq N_{\mathrm{pt}}, the weight bounds are

(4.11) w⁢(n)=0(P−⁢(n)<zs),w⁢(n)≤4 1Ω⁢(n)≤2(n∈𝒜N∖ℰ),max⁡{0,w⁢(n)−4 1Ω⁢(n)≤2}≤169(n∈ℰ),Ept=0.(2∣N,N≥Npt).\begin{gathered}w(n)=0\quad(P^{-}(n)<z_{s}),\qquad w(n)\leq 4\,1_{\Omega(n)% \leq 2}\quad(n\in\mathcal{A}_{N}\setminus\mathcal{E}),\\ \max\{0,w(n)-4\,1_{\Omega(n)\leq 2}\}\leq 169\quad(n\in\mathcal{E}),\qquad E_{% \mathrm{pt}}=0.\end{gathered}\qquad(2\mid N,\ N\geq N_{\mathrm{pt}}).
Proof.

Start from the roughness observation above. If Ω⁢(n)≥3\Omega(n)\geq 3, then w⁢(n)=min⁡{W13⁢(n),0}≤0w(n)=\min\{W_{13}(n),0\}\leq 0. If (n,N)>1(n,N)>1, the coprimality conditions force every row occurrence to vanish. For Ω⁢(n)≤2\Omega(n)\leq 2 and n∈ℰn\in\mathcal{E} with (n,N)=1(n,N)=1, only n=p2n=p^{2} occurs; only S1,S2S_{1},S_{2} contribute, giving w⁢(n)=4w(n)=4. For n∉ℰn\notin\mathcal{E} with Ω⁢(n)≤2\Omega(n)\leq 2, a prime has weight 44. For n=r⁢sn=rs, with primes r<sr<s, the bands [α,β)[\alpha,\beta), [β,μ∗)[\beta,\mu_{*}), [μ∗,λ)[\mu_{*},\lambda), [λ,1/3)[\lambda,1/3) and [1/3,1/2)[1/3,1/2) for logN⁡r\log_{N}r give weights 1,2,2,3,41,2,2,3,4, respectively, directly from the row table. This agrees with Paper II, (1.11) [27, (1.10)–(1.11)]. Here NptN_{\mathrm{pt}} is chosen so that ε⁢N>N2/3\varepsilon N>N^{2/3} and ε⁢N>Nλ+β\varepsilon N>N^{\lambda+\beta}. Then the larger prime exceeds N1/3N^{1/3}. The two-prime divisor rows vanish, since their products are below Nλ+βN^{\lambda+\beta} for S8S_{8}–S10S_{10} and below N2/3N^{2/3} for S11S_{11}–S13S_{13}. These observations prove all three bounds, including the stronger exceptional bound with right-hand side zero. ∎

Put

(4.12) Ept=14∑n∈ℰmax{0,w(n)−4 1Ω⁢(n)≤2}.(2∣N,N≥2).E_{\mathrm{pt}}=\frac{1}{4}\sum_{n\in\mathcal{E}}\max\{0,w(n)-4\,1_{\Omega(n)% \leq 2}\}.\qquad(2\mid N,\ N\geq 2).

The pointwise lemma gives Ept=0E_{\mathrm{pt}}=0 for N≥NptN\geq N_{\mathrm{pt}}, within its stated scope. We still record cruder bounds. Summation gives

(4.13) 0≤Ept≤1694⁢|ℰ|≤21974⁢N1−α,𝒲≤4⁢P2+4⁢Ept,4⁢Gb⁢(N)≥𝒲−4⁢Bb−4⁢Ept.(2∣N,N≥Npt).\begin{gathered}0\leq E_{\mathrm{pt}}\leq\frac{169}{4}|\mathcal{E}|\leq\frac{2% 197}{4}N^{1-\alpha},\\ \mathcal{W}\leq 4P_{2}+4E_{\mathrm{pt}},\qquad 4G_{b}(N)\geq\mathcal{W}-4B_{b}% -4E_{\mathrm{pt}}.\end{gathered}\qquad(2\mid N,\ N\geq N_{\mathrm{pt}}).

The transfer to r≤q3/4r\leq q^{3/4} is (1.4).

4.2. Signed arithmetic sums

Put

(4.14) Rfix=3⁢S1−2⁢S3−S4−S5−S7+S8+S9+S10−2⁢S11−S12−S13.(2∣N,N≥2).\begin{aligned} R_{\mathrm{fix}}={}&3S_{1}-2S_{3}-S_{4}-S_{5}-S_{7}+S_{8}+S_{9% }+S_{10}\\ &-2S_{11}-S_{12}-S_{13}.\end{aligned}\qquad(2\mid N,\ N\geq 2).

Then (4.5) gives

(4.15) 𝒲−4Bb=Rfix+S2−S6−Ssw−4Bb.(2∣N,N≥2).\mathcal{W}-4B_{b}=R_{\mathrm{fix}}+S_{2}-S_{6}-S_{\mathrm{sw}}-4B_{b}.\qquad(% 2\mid N,\ N\geq 2).

Define

(4.16) Grows=2⁢S11+S12+S13,𝒞ret=3⁢S1+S2−S4−S5−S7+S10−Grows,𝒬=−2⁢S3+S8+S9.(2∣N,N≥2).\begin{aligned} G_{\mathrm{rows}}&=2S_{11}+S_{12}+S_{13},\\ \mathcal{C}_{\mathrm{ret}}&=3S_{1}+S_{2}-S_{4}-S_{5}-S_{7}+S_{10}-G_{\mathrm{% rows}},\\ \mathcal{Q}&=-2S_{3}+S_{8}+S_{9}.\end{aligned}\qquad(2\mid N,\ N\geq 2).

Coefficient comparison gives

(4.17) 𝒞ret+𝒬=Rfix+S2,𝒲−4⁢Bb=𝒞ret+𝒬−S6−Ssw−4⁢Bb.(2∣N,N≥2).\begin{gathered}\mathcal{C}_{\mathrm{ret}}+\mathcal{Q}=R_{\mathrm{fix}}+S_{2},% \\ \mathcal{W}-4B_{b}=\mathcal{C}_{\mathrm{ret}}+\mathcal{Q}-S_{6}-S_{\mathrm{sw}% }-4B_{b}.\end{gathered}\qquad(2\mid N,\ N\geq 2).

Substitution proves both equalities coefficient by coefficient. The coefficients 3⁢S13S_{1} and +S10+S_{10} are fixed. The integer supports may overlap. These coefficient identities do not depend on later estimates. Take the signed normalized chains Qj,kQ_{j,k}, their index set ℐ\mathcal{I}, and the stage index k∈{0,…,10}k\in\{0,\ldots,10\} from Section 5. See its “original signed chains” paragraph and (5.4). Each Qj,kQ_{j,k} already includes its signed normalized coefficient, so no extra multiplicity factor enters. Finite telescoping gives

(4.18) ∑j∈ℐQj,0=∑j∈ℐQj,10+∑j∈ℐ∑k=110(Qj,k−1−Qj,k).(2∣N,N≥2).\sum_{j\in\mathcal{I}}Q_{j,0}=\sum_{j\in\mathcal{I}}Q_{j,10}+\sum_{j\in% \mathcal{I}}\sum_{k=1}^{10}(Q_{j,k-1}-Q_{j,k}).\qquad(2\mid N,\ N\geq 2).

This is the normalized-chain identity cited above. The arithmetic coefficient identities above keep their unnormalized definitions. Paper II uses joint endpoints for S1,S2⁢-⁢T8/4,GrowsS_{1},S_{2}\text{-}T_{8}/4,G_{\mathrm{rows}} [27, (6.4)–(6.4d), pp. 70–72]. Here T8T_{8} is Paper II’s stage-eight endpoint in the S2S_{2} chain. The notation S2⁢-⁢T8/4S_{2}\text{-}T_{8}/4 is a joint-chain label; it defines no new arithmetic sum. Their joint endpoint is kept before the differences are split.

4.3. A finite upper decomposition

Each original representation occurrence uses the shifted-prime set of (⁢1.3⁢)\eqref{eq:intro-count}:

(4.19) 𝒜N={N−p:p∈ℙ,p<(1−ε)N}.(2∣N,N≥2).\mathcal{A}_{N}=\{N-p:p\in\mathbb{P},\ p<(1-\varepsilon)N\}.\qquad(2\mid N,\ N% \geq 2).

The two arithmetic sources stay separate. Take Ab,EtopA_{b},E_{\mathrm{top}} from (7.2) and SbS_{b} from the Section 7 definition (7.13); AA from (8.3); 𝒫N\mathcal{P}_{N} from (8.1); and bA,PN,Sv,SA,Esrcb_{A},P_{N},S_{v},S_{A},E_{\mathrm{src}} from (8.6). The ordered prime coordinates aia_{i} and their prefix domains are those of (8.9) and the paragraph before it. Define

(4.20) hb⁢(n)=Ab⁢(N−n),ℒb={p∈ℙ:p∤2⁢N},Eb=Etop,hsw⁢(n)=A⁢(N−n),ℒsw=𝒫N,Eswsrc=Esrc,(2∣N,N≥2).\begin{gathered}h_{b}(n)=A_{b}(N-n),\qquad\mathscr{L}_{b}=\{p\in\mathbb{P}:p% \nmid 2N\},\qquad E_{b}=E_{\mathrm{top}},\\ h_{\mathrm{sw}}(n)=A(N-n),\qquad\mathscr{L}_{\mathrm{sw}}=\mathcal{P}_{N},% \qquad E_{\mathrm{sw}}^{\mathrm{src}}=E_{\mathrm{src}},\end{gathered}\qquad(2% \mid N,\ N\geq 2).

Here Ab,EtopA_{b},E_{\mathrm{top}} are the Section 7 source objects in (⁢7.2⁢)\eqref{eq:k2-source}. The objects A,𝒫N,EsrcA,\mathcal{P}_{N},E_{\mathrm{src}} are the Section 8 source objects in (⁢8.3⁢)\eqref{eq:l3-source}, (⁢8.1⁢)\eqref{eq:l3-constants}, and (⁢8.6⁢)\eqref{eq:l3-sieved-source}. Both sequences are nonnegative. No extra 1(e,2⁢N)=11_{(e,2N)=1} factor enters. The script-font symbols ℒb\mathscr{L}_{b}, ℒsw\mathscr{L}_{\mathrm{sw}}, ℒX\mathscr{L}_{X}, and 𝒰X\mathscr{U}_{X} denote the variable sieve families and their sifted sums. The fixed prime support is written 𝒫N\mathcal{P}_{N}. For X∈{b,sw}X\in\{b,\mathrm{sw}\}, write hX,ℒX,EXh_{X},\mathscr{L}_{X},E_{X} for the corresponding line of (⁢4.20⁢)\eqref{eq:source-local-sequences}, and put

(4.21) PX⁢(y)=∏ℓ<yℓ∈ℒXℓ,𝒰X⁢(d;y)=∑d∣nhX⁢(n)⁢1(n/d,PX⁢(y))=1.(2∣N,N≥2).\begin{aligned} P_{X}(y)&=\prod_{\begin{subarray}{c}\ell<y\\ \ell\in\mathscr{L}_{X}\end{subarray}}\ell,\\ \mathscr{U}_{X}(d;y)&=\sum_{d\mid n}h_{X}(n)1_{(n/d,P_{X}(y))=1}.\end{aligned}% \qquad(2\mid N,\ N\geq 2).

Take IL,IH,J,Jtail,Jt,zs,ηm,vRAI_{L},I_{H},J,J_{\mathrm{tail}},J_{t},z_{s},\eta_{\mathrm{m}},v_{\mathrm{RA}} from the Root–A definition (6.1). Take cR,Kc_{R,K} from (6.4), and RL,Rtail,BL,Btail,B,clo,ΓR_{L},R_{\mathrm{tail}},B_{L},B_{\mathrm{tail}},B,c_{\mathrm{lo}},\Gamma from (6.6) and its preceding choice of fixed logarithmic exponents. Take DmD_{\mathrm{m}} from (6.52). Write QRAQ_{\mathrm{RA}} for the level called QQ in (6.6). This alias is distinct from every signed chain Qj,kQ_{j,k}. We do not redefine these objects here. Both source comparisons require the finite threshold N6N_{6} of Section 2. It enters the operative TRAT_{\mathrm{RA}}, the maximum of the sixth-sum comparison threshold and N6N_{6}. We do not redefine it here.

Use the common choice σ=σ∗\sigma=\sigma_{*} from (2.4). It lies in the Section 7 range of (7.1), and the switched comparison uses it. Take τ,ρ\tau,\rho from Section 7 (7.1); Section 8 uses the same values. We make no new choice or definition of σ,τ,ρ\sigma,\tau,\rho here. Partition the logarithmic prime ranges into half-open intervals [ti,ρ⁢ti)[t_{i},\rho t_{i}), with ti=u⁢ρkit_{i}=u\rho^{k_{i}}, ki≥0k_{i}\geq 0. Clip the intervals at μ∗\mu_{*}. Each prime has one cell. For X=bX=b, use the retained cells of the Section 7 (⁢7.19⁢)\eqref{eq:k2-retention} retained-cell definition and the cutoff in (⁢7.18⁢)\eqref{eq:k2-four-rows}. Write them as ℛb,zb,c,χb,c\mathcal{R}_{b},z_{b,c},\chi_{b,c}. For X=swX=\mathrm{sw}, use the Section 8 definitions (⁢8.12⁢)\eqref{eq:l3-buchstab-peel} and (⁢8.10⁢)\eqref{eq:l3-row3-level}. Write them as ℛsw,zsw,c,χsw,c\mathcal{R}_{\mathrm{sw}},z_{\mathrm{sw},c},\chi_{\mathrm{sw},c}. These definitions come from the two source sections. They form no common envelope in this section. We use no equality between the retained collections of the three sections. The closed-cell infima of Sections 7 and 8 and their endpoint rules apply only within their own source. For X=bX=b, the packing function is HH, as specified in (7.19). For X=swX=\mathrm{sw}, it is H~\widetilde{H}, as specified in (8.10) and its preceding definition of Θc\Theta_{c}. The two functions are defined in Paper II, equation (2.17d), and the paragraph after it. We have H~=H\widetilde{H}=H only on the stated largest-coordinate range, and use no equality outside it. For either source write zX,c=Nt3z_{X,c}=N^{t_{3}}, with t3t_{3} the lower endpoint of the third coordinate of its cell cc. Here zsw,cz_{\mathrm{sw},c} is the object called zcz_{c} in Section 8; we use only the source-indexed name. The Section 7 cutoff is defined in (7.18), with the lower-endpoint convention stated before (7.31).

The source index here is always X∈{b,sw}X\in\{b,\mathrm{sw}\}. For the bb-source the underlying prime support is 𝒫N\mathcal{P}_{N}, so Pb⁢(y)=PN⁢(y)P_{b}(y)=P_{N}(y). Both sieve products use primes below yy not dividing 2⁢N2N. For the bb-source, the substitution e=N−ne=N-n identifies the generic sieve with SbS_{b} of Section 7 on that source:

(4.22) 𝒰b(d;y)=∑d∣nAb(N−n)1(n/d,Pb⁢(y))=1=∑d∣N−eAb(e)1((N−e)/d,Pb⁢(y))=1=Sb(d;y).(2∣N,N≥2).\mathscr{U}_{b}(d;y)=\sum_{d\mid n}A_{b}(N-n)1_{(n/d,P_{b}(y))=1}=\sum_{d\mid N% -e}A_{b}(e)1_{((N-e)/d,P_{b}(y))=1}=S_{b}(d;y).\qquad(2\mid N,\ N\geq 2).

For X=swX=\mathrm{sw}, identify the generic cofactor sieve with the Section 8 sieve on precisely the following rows:

  • •

    d=1d=1 with cutoff y=Nμ∗y=N^{\mu_{*}}, the source-comparison row 𝒰sw⁢(1;Nμ∗)=SA\mathscr{U}_{\mathrm{sw}}(1;N^{\mu_{*}})=S_{A} from Section 8 (8.6);

  • •

    v=a1⁢⋯⁢ajv=a_{1}\cdots a_{j}, 0≤j≤20\leq j\leq 2, with cutoff y=Nuy=N^{u};

  • •

    v=a1⁢a2⁢a3v=a_{1}a_{2}a_{3}, with dynamic cutoff y=a3y=a_{3}, or retained-cell cutoff y=zsw,c=Nt3y=z_{\mathrm{sw},c}=N^{t_{3}};

  • •

    v⁢r=a1⁢a2⁢a3⁢rvr=a_{1}a_{2}a_{3}r on a retained cell, with zsw,c≤r<a3z_{\mathrm{sw},c}\leq r<a_{3}, at cutoff y=ry=r or y=zsw,cy=z_{\mathrm{sw},c}.

Here the empty prefix is v=1v=1, and all primes belong to 𝒫N\mathcal{P}_{N} and have the ordering in (8.9) and (8.11). Let dd be the displayed prefix vv or product v⁢rvr. Every prime divisor of dd is at least yy, so (d,Psw⁢(y))=1(d,P_{\mathrm{sw}}(y))=1. The definitions give Psw⁢(y)=PN⁢(y)P_{\mathrm{sw}}(y)=P_{N}(y). Write Sd⁢(y)S_{d}(y) for the Sv⁢(y)S_{v}(y) of Section 8 from (8.6) with v=dv=d. For d∣nd\mid n, the Section 8 definition (8.6) gives

(4.23) 𝒰sw(d;y)=∑d∣nhsw(n)1(n/d,PN⁢(y))=1=∑d∣nbA(n)1(n,Psw⁢(y))=1=Sd(y).(2∣N,N≥2).\mathscr{U}_{\mathrm{sw}}(d;y)=\sum_{d\mid n}h_{\mathrm{sw}}(n)1_{(n/d,P_{N}(y% ))=1}=\sum_{d\mid n}b_{A}(n)1_{(n,P_{\mathrm{sw}}(y))=1}=S_{d}(y).\qquad(2\mid N% ,\ N\geq 2).

This identity holds on these rows only, not for arbitrary d,yd,y. These EE-terms are unnormalized source-restoration costs. The two source upper comparisons are stated separately: Here Bb′B_{b}^{\prime} is the prime-occurrence part of BbB_{b}, and EtopE_{\mathrm{top}} is the removed-top cost.

Lemma 4.2 (Upper-source comparisons).
(4.24) Bb≤Eb+𝒰b⁢(1;Nμ∗),Ssw≤Eswsrc+𝒰sw⁢(1;Nμ∗)for even ⁢N≥N6.\begin{gathered}B_{b}\leq E_{b}+\mathscr{U}_{b}(1;N^{\mu_{*}}),\qquad S_{% \mathrm{sw}}\leq E_{\mathrm{sw}}^{\mathrm{src}}+\mathscr{U}_{\mathrm{sw}}(1;N^% {\mu_{*}})\\ \text{for even }N\geq N_{6}.\end{gathered}
Proof.

The first inequality follows from Section 7 (7.16) and Eb=EtopE_{b}=E_{\mathrm{top}}; the second is the Section 8 source comparison (8.7). We do not identify their hypotheses or their restoration costs. ∎

We invoke the source comparison once, with the named hypotheses displayed above.

For real cutoffs 1≤y≤wcut1\leq y\leq w_{\mathrm{cut}}, the least allowed prime gives

(4.25) 𝒰X(d;wcut)=𝒰X(d;y)−∑y≤r<wcutr∈ℒX𝒰X(dr;r).(2∣N,N≥2).\mathscr{U}_{X}(d;w_{\mathrm{cut}})=\mathscr{U}_{X}(d;y)-\sum_{\begin{subarray% }{c}y\leq r<w_{\mathrm{cut}}\\ r\in\mathscr{L}_{X}\end{subarray}}\mathscr{U}_{X}(dr;r).\qquad(2\mid N,\ N\geq 2).

Write n=d⁢mn=dm. If mm survives at yy but fails at wcutw_{\mathrm{cut}}, choose its least allowed prime in [y,wcut)[y,w_{\mathrm{cut}}). Exactly one summand records that prime. Repeated copies remain in the cofactor. Thus the identity also counts prime powers correctly.

Three applications give

(4.26) 𝒰X⁢(1;Nμ∗)=TX,0−TX,1+TX,2−TX,3,TX,j=∑Nu≤aj<⋯<a1<Nμ∗ai∈ℒX𝒰X⁢(a1⁢⋯⁢aj;Nu)(0≤j≤2),TX,3=∑Nu≤a3<a2<a1<Nμ∗ai∈ℒX𝒰X⁢(a1⁢a2⁢a3;a3).(2∣N,N≥2).\begin{aligned} \mathscr{U}_{X}(1;N^{\mu_{*}})&=T_{X,0}-T_{X,1}+T_{X,2}-T_{X,3% },\\ T_{X,j}&=\sum_{\begin{subarray}{c}N^{u}\leq a_{j}<\cdots<a_{1}<N^{\mu_{*}}\\ a_{i}\in\mathscr{L}_{X}\end{subarray}}\mathscr{U}_{X}(a_{1}\cdots a_{j};N^{u})% \quad(0\leq j\leq 2),\\ T_{X,3}&=\sum_{\begin{subarray}{c}N^{u}\leq a_{3}<a_{2}<a_{1}<N^{\mu_{*}}\\ a_{i}\in\mathscr{L}_{X}\end{subarray}}\mathscr{U}_{X}(a_{1}a_{2}a_{3};a_{3}).% \end{aligned}\qquad(2\mid N,\ N\geq 2).

For j=0j=0, the sum is 𝒰X⁢(1;Nu)\mathscr{U}_{X}(1;N^{u}). The primes are ordered; no factorial occurs. Every multiplicity remains in hXh_{X}.

For d=a1⁢a2⁢a3d=a_{1}a_{2}a_{3} in a retained cell of source XX, put

(4.27) −𝒰X⁢(d;a3)=−𝒰X⁢(d;zX,c)+∑zX,c≤r<a3r∈ℒX𝒰X⁢(d⁢r;r)≤−𝒰X⁢(d;zX,c)+∑zX,c≤r<a3r∈ℒX𝒰X⁢(d⁢r;zX,c).(2∣N,N≥2).\begin{aligned} -\mathscr{U}_{X}(d;a_{3})&=-\mathscr{U}_{X}(d;z_{X,c})+\sum_{% \begin{subarray}{c}z_{X,c}\leq r<a_{3}\\ r\in\mathscr{L}_{X}\end{subarray}}\mathscr{U}_{X}(dr;r)\\ &\leq-\mathscr{U}_{X}(d;z_{X,c})+\sum_{\begin{subarray}{c}z_{X,c}\leq r<a_{3}% \\ r\in\mathscr{L}_{X}\end{subarray}}\mathscr{U}_{X}(dr;z_{X,c}).\end{aligned}% \qquad(2\mid N,\ N\geq 2).

The equality is (4.25). Nonnegativity proves the inequality. Actual cell membership gives zX,c≤a3z_{X,c}\leq a_{3}. The closed infimum creates no additional occurrences.

Let ∑ret,X\sum_{\mathrm{ret},X} restrict the ordered triples to ℛX\mathcal{R}_{X}, equivalently to χX,c=1\chi_{X,c}=1. For either source define the peel terms

(4.28) RX,3=∑ret,X𝒰X⁢(a1⁢a2⁢a3;zX,c),PX,3=∑ret,X∑zX,c≤r<a3r∈ℒX𝒰X⁢(a1⁢a2⁢a3⁢r;zX,c).(2∣N,N≥2).\begin{aligned} R_{X,3}&=\sum_{\mathrm{ret},X}\mathscr{U}_{X}(a_{1}a_{2}a_{3};% z_{X,c}),\\ P_{X,3}&=\sum_{\mathrm{ret},X}\sum_{\begin{subarray}{c}z_{X,c}\leq r<a_{3}\\ r\in\mathscr{L}_{X}\end{subarray}}\mathscr{U}_{X}(a_{1}a_{2}a_{3}r;z_{X,c}).% \end{aligned}\qquad(2\mid N,\ N\geq 2).

For each source X∈{b,sw}X\in\{b,\mathrm{sw}\}, the non-retained depth-three terms are nonnegative and occur with a minus sign, so we drop them. The retained terms use the dynamic inequality above:

(4.29) −TX,3≤−RX,3+PX,3.(2∣N,N≥2).-T_{X,3}\leq-R_{X,3}+P_{X,3}.\qquad(2\mid N,\ N\geq 2).

For even N≥N6N\geq N_{6}, define the two upper expressions and their slacks, one per source. The next comparison proves their nonnegativity:

(4.30) Ub:=Tb,0−Tb,1+Tb,2−Rb,3+Pb,3,Zb:=Eb+Ub−Bb≥0,Usw:=Tsw,0−Tsw,1+Tsw,2−Rsw,3+Psw,3,Zsw:=Eswsrc+Usw−Ssw≥0.(2∣N,N≥N6).\begin{aligned} U_{b}&:=T_{b,0}-T_{b,1}+T_{b,2}-R_{b,3}+P_{b,3},&Z_{b}&:=E_{b}% +U_{b}-B_{b}\geq 0,\\ U_{\mathrm{sw}}&:=T_{\mathrm{sw},0}-T_{\mathrm{sw},1}+T_{\mathrm{sw},2}-R_{% \mathrm{sw},3}+P_{\mathrm{sw},3},&Z_{\mathrm{sw}}&:=E_{\mathrm{sw}}^{\mathrm{% src}}+U_{\mathrm{sw}}-S_{\mathrm{sw}}\geq 0.\end{aligned}\qquad(2\mid N,\ N% \geq N_{6}).

Hence

(4.31) 𝒰X⁢(1;Nμ∗)≤{Ub,X=b,Usw,X=sw.(2∣N,N≥N6).\mathscr{U}_{X}(1;N^{\mu_{*}})\leq\begin{cases}U_{b},&X=b,\\ U_{\mathrm{sw}},&X=\mathrm{sw}.\end{cases}\qquad(2\mid N,\ N\geq N_{6}).

These inequalities assume the two source comparisons in (4.24). They give no estimate for either restoration cost.

4.4. The conditional lower expression

Take AmixA_{\mathrm{mix}} from the Root–A definition (6.8), and Z6Z_{6} with its comparison from Section 6 (6.9). We redefine neither object. This sum uses the ordinary upper Rosser weights μd+⁢(D)\mu_{d}^{+}(D) with the odd-index cubic gates of (⁢6.3⁢)\eqref{eq:ra-rosser-weight}. Their upper-sieve property is the Iwaniec upper-bound lemma [14, Lemma 1, (3.2), (3.6)] [13, Lemmas 2–3, p. 313]. This section introduces no new weight. The Section 6 comparison gives

(4.32) S6≤Amix,Z6≥0(2∣N,N≥N6).S_{6}\leq A_{\mathrm{mix}},\qquad Z_{6}\geq 0\qquad(2\mid N,\ N\geq N_{6}).

For a mark pp, put m=(N−e)/pm=(N-e)/p and PRA=∏ℓ<zs,ℓ∤2⁢NℓP_{\mathrm{RA}}=\prod_{\ell<z_{s},\,\ell\nmid 2N}\ell. For D>1D>1, the cited Iwaniec upper-bound lemmas give, for the upper Rosser divisor sum, [14, Lemma 1, (3.2), (3.6)] [13, Lemmas 2–3, p. 313],

∑d∣(m,PRA)μd+⁢(D)≥1(m,PRA)=1≥1P−⁢(m)≥zs(2⁢∣N,N≥2,D>⁢1).\sum_{d\mid(m,P_{\mathrm{RA}})}\mu_{d}^{+}(D)\geq 1_{(m,P_{\mathrm{RA}})=1}% \geq 1_{P^{-}(m)\geq z_{s}}\qquad(2\mid N,\ N\geq 2,\ D>1).

Dropping (m,N⁢p)=1(m,Np)=1 enlarges the original nonnegative occurrence count. For even N≥N6N\geq N_{6}, each of RL,Rtail,QRAR_{L},R_{\mathrm{tail}},Q_{\mathrm{RA}} exceeds N1/3N^{1/3}. Hence take D=RL/p,Rtail/p,QRA/pD=R_{L}/p,R_{\mathrm{tail}}/p,Q_{\mathrm{RA}}/p on, respectively, IL×JI_{L}\times J, IH×JtailI_{H}\times J_{\mathrm{tail}}, IH×JtI_{H}\times J_{t}. These pieces partition the original source: e=N/4e=N/4 belongs to ILI_{L}, and the shared mark endpoint belongs to JtailJ_{\mathrm{tail}}. Since p≥Nt0>zsp\geq N^{t_{0}}>z_{s}, the mark is unique in q=p⁢dq=pd. The condition d∣md\mid m is exactly e≡N(modp⁢d)e\equiv N\pmod{pd}. The original gates give cR,K⁢(p⁢d)=μd+⁢(R/p)c_{R,K}(pd)=\mu_{d}^{+}(R/p). Summation gives precisely S6≤AmixS_{6}\leq A_{\mathrm{mix}} and Z6≥0Z_{6}\geq 0, with all mark multiplicities. A product-cell partition only splits these exact sums. It must keep the original p⁢d<Rpd<R, the cubic gates and every clipped endpoint. In particular cloc_{\mathrm{lo}} and Γ\Gamma keep the gates at QRAQ_{\mathrm{RA}}. Subdivide each of the three marked pieces in (6.7) into cells in its two displayed coordinates. Let δ=L−Dm\delta=L^{-D_{\mathrm{m}}}, and use half-open multiplicative intervals of relative width at most 1+δ1+\delta in each coordinate. Insert all row cuts, the points N/4N/4, 1/3−ηm1/3-\eta_{\mathrm{m}}, 1/31/3, and the two endpoints of IHI_{H} as cell boundaries. Denote the resulting finite, disjoint cell families by ΘL♯,Θtail♯,Θt♯\Theta^{\sharp}_{L},\Theta^{\sharp}_{\mathrm{tail}},\Theta^{\sharp}_{t}. Use the separate piece index Y∈{L,tail,t}Y\in\{L,\mathrm{tail},t\} and the mapping

(4.33) (IY,KY,RY)={(IL,J,RL),Y=L,(IH,Jtail,Rtail),Y=tail,(IH,Jt,QRA),Y=t.(2∣N,N≥N6).(I_{Y},K_{Y},R_{Y})=\begin{cases}(I_{L},J,R_{L}),&Y=L,\\ (I_{H},J_{\mathrm{tail}},R_{\mathrm{tail}}),&Y=\mathrm{tail},\\ (I_{H},J_{t},Q_{\mathrm{RA}}),&Y=t.\end{cases}\qquad(2\mid N,\ N\geq N_{6}).

Thus each C∈ΘY♯C\in\Theta^{\sharp}_{Y} satisfies C⊆(ℙ∩IY)×(ℙ∩NKY)C\subseteq(\mathbb{P}\cap I_{Y})\times(\mathbb{P}\cap N^{K_{Y}}) and (p,N)=1(p,N)=1, with 0<(N−e)/p0<(N-e)/p on every included occurrence. Their unions are exactly the corresponding coprime marked source pieces IL×JI_{L}\times J, IH×JtailI_{H}\times J_{\mathrm{tail}}, and IH×JtI_{H}\times J_{t}. A cell touching a boundary is kept as a boundary cell. For Y∈{L,tail,t}Y\in\{L,\mathrm{tail},t\} and C∈ΘY♯C\in\Theta^{\sharp}_{Y}, define

(4.34) S6,Y,C:=∑(e,p)∈C𝟏p∈ℙ⁢𝟏(p,N)=1⁢𝟏p∣N−e⁢𝟏0<(N−e)/p⁢𝟏e∈ℙ⁢𝟏P−⁢((N−e)/p)≥zs⁢𝟏((N−e)/p,N⁢p)=1,AY,C:=∑(e,p)∈C𝟏p∈ℙ⁢𝟏(p,N)=1⁢𝟏p∣N−e⁢𝟏0<(N−e)/p⁢𝟏e∈ℙ⁢∑d∣(N−e)/pd∣PRAcRY,KY⁢(p⁢d)⁢𝟏e≡N⁢(p⁢d),(2∣N,N≥2).\begin{aligned} S_{6,Y,C}&:=\sum_{(e,p)\in C}\mathbf{1}_{p\in\mathbb{P}}% \mathbf{1}_{(p,N)=1}\mathbf{1}_{p\mid N-e}\mathbf{1}_{0<(N-e)/p}\mathbf{1}_{e% \in\mathbb{P}}\mathbf{1}_{P^{-}((N-e)/p)\geq z_{s}}\mathbf{1}_{((N-e)/p,Np)=1}% ,\\ A_{Y,C}&:=\sum_{(e,p)\in C}\mathbf{1}_{p\in\mathbb{P}}\mathbf{1}_{(p,N)=1}% \mathbf{1}_{p\mid N-e}\mathbf{1}_{0<(N-e)/p}\mathbf{1}_{e\in\mathbb{P}}\sum_{% \begin{subarray}{c}d\mid(N-e)/p\\ d\mid P_{\mathrm{RA}}\end{subarray}}c_{R_{Y},K_{Y}}(pd)\mathbf{1}_{e\equiv N\ % (pd)},\end{aligned}\qquad(2\mid N,\ N\geq 2).

Here RYR_{Y} is RLR_{L}, RtailR_{\mathrm{tail}}, or QRAQ_{\mathrm{RA}}. The corresponding coefficient gates stay in the inner sum. The half-open families make every marked occurrence belong to exactly one CC, including e=N/4e=N/4 and the shared mark endpoint. The one-term Rosser inequality at each occurrence gives S6,Y,C≤AY,CS_{6,Y,C}\leq A_{Y,C}, cell by cell. Reindexing the finite sums gives

(4.35) S6=∑Y∑C∈ΘY♯S6,Y,C,∑Y∑C∈ΘY♯AY,C=Amix.(2∣N,N≥N6).S_{6}=\sum_{Y}\sum_{C\in\Theta^{\sharp}_{Y}}S_{6,Y,C},\qquad\sum_{Y}\sum_{C\in% \Theta^{\sharp}_{Y}}A_{Y,C}=A_{\mathrm{mix}}.\qquad(2\mid N,\ N\geq N_{6}).

The finite comparison uses these cellwise Rosser inequalities. Thus the displayed comparison is the sum of finitely many explicit cell inequalities. No product cell, endpoint, or boundary strip is omitted. The later complete-cell estimates and boundary-strip bound are quantitative inputs only and do not alter this finite identity. The three slacks below are cited or defined by the source comparisons above, before this substitution. Substitution in (4.15) gives

(4.36) 𝒲−4⁢Bb−4⁢Ept=Rfix+S2−Amix−Usw−4⁢Ub−Eswsrc−4⁢Eb−4⁢Ept+Z6+Zsw+4⁢Zb.(2∣N,N≥N6).\begin{aligned} \mathcal{W}-4B_{b}-4E_{\mathrm{pt}}={}&R_{\mathrm{fix}}+S_{2}-% A_{\mathrm{mix}}-U_{\mathrm{sw}}-4U_{b}\\ &-E_{\mathrm{sw}}^{\mathrm{src}}-4E_{b}-4E_{\mathrm{pt}}+Z_{6}+Z_{\mathrm{sw}}% +4Z_{b}.\end{aligned}\qquad(2\mid N,\ N\geq N_{6}).

This equality follows from the source identity and the cited and local definitions. The Section 6 comparison (6.9) gives Z6≥0Z_{6}\geq 0. The comparisons in (4.30) give Zsw,Zb≥0Z_{\mathrm{sw}},Z_{b}\geq 0. For even N≥max⁡{N6,Npt}N\geq\max\{N_{6},N_{\mathrm{pt}}\}, (4.13) and nonnegativity of these slacks yield

(4.37) 4⁢Gb⁢(N)≥Rfix+S2−Amix−(Tsw,0−Tsw,1+Tsw,2−Rsw,3+Psw,3)−4⁢(Tb,0−Tb,1+Tb,2−Rb,3+Pb,3)−Eswsrc−4⁢Eb−4⁢Ept.(2∣N,N≥max⁡{N6,Npt}).\begin{aligned} 4G_{b}(N)\geq{}&R_{\mathrm{fix}}+S_{2}-A_{\mathrm{mix}}\\ &-(T_{\mathrm{sw},0}-T_{\mathrm{sw},1}+T_{\mathrm{sw},2}-R_{\mathrm{sw},3}+P_{% \mathrm{sw},3})\\ &-4(T_{b,0}-T_{b,1}+T_{b,2}-R_{b,3}+P_{b,3})\\ &-E_{\mathrm{sw}}^{\mathrm{src}}-4E_{b}-4E_{\mathrm{pt}}.\end{aligned}\qquad(2% \mid N,\ N\geq\max\{N_{6},N_{\mathrm{pt}}\}).

The two expanded signs are

(4.38) −Usw=−Tsw,0+Tsw,1−Tsw,2+Rsw,3−Psw,3,−4⁢Ub=−4⁢Tb,0+4⁢Tb,1−4⁢Tb,2+4⁢Rb,3−4⁢Pb,3.(2∣N,N≥N6).\begin{aligned} -U_{\mathrm{sw}}&=-T_{\mathrm{sw},0}+T_{\mathrm{sw},1}-T_{% \mathrm{sw},2}+R_{\mathrm{sw},3}-P_{\mathrm{sw},3},\\ -4U_{b}&=-4T_{b,0}+4T_{b,1}-4T_{b,2}+4R_{b,3}-4P_{b,3}.\end{aligned}\qquad(2% \mid N,\ N\geq N_{6}).

Use one bound for the complete SswS_{\mathrm{sw}}. Paper II gives its coefficient-eight estimate [27, (1.9), (5.29)–(5.43)]; the Buchstab upper bound concerns the same occurrence. Sections 7 and 8 estimate these two five-term upper expressions (four principal rows and their peel term) separately. The displayed expansion fixes each peel term’s sign. The finite switched-source domination is already in the local ZswZ_{\mathrm{sw}} identity above. The remaining distribution and quantitative estimates for this occurrence are separate hypotheses of the later bill. They lie outside the finite decomposition of this section.

4.5. The lower expression with the original S2S_{2}

Keep the original S2S_{2} throughout. Use H¯\overline{H}, M5,internalM_{5,\mathrm{internal}} and Δ⁢DL⁢3\Delta D_{L3} from (1.8). Here H¯\overline{H} is the switched integral bound. The distinct constant 153/256153/256 bounds the packing envelope. The complete normalized switched error is Esw⁢(N;σ)E_{\mathrm{sw}}(N;\sigma). The source-restoration error EswsrcE_{\mathrm{sw}}^{\mathrm{src}} is unnormalized. The main route takes g6:=0g_{6}:=0 and excludes the optional six-endpoint improvement. Fix this common parameter and an even N≥max⁡{N6,Npt}N\geq\max\{N_{6},N_{\mathrm{pt}}\} throughout the following conditional lemma. Take W,Evan,Λj,N0,ΛN,Δj,ΔG⁢1W,E_{\mathrm{van}},\Lambda^{0}_{j,N},\Lambda_{N},\Delta_{j},\Delta_{G1} from (2.2), (1.12), and Section 5, and gRA,lo,ERAg_{\mathrm{RA,lo}},E_{\mathrm{RA}} from (6.72). Use the complete switched and exterior errors from (8.72) and (7.67). The fixed constants are defined in (1.8) and (1.7).

Lemma 4.3 (Addition of the four comparisons).

Assume (4.11) and the following four inequalities. Write

(4.39) Rfix+S2W⁢(N)≥DII+J¯6+2⁢H¯+5719106+M5,internal−E′⁢(N;σ),E′⁢(N;σ)=Evan⁢(N;σ)+∑j∈ℋ(|Λj,N0|+|ΛN⁢(Δj)|)+|ΛN⁢(ΔG⁢1)|.(2∣N,N≥max⁡{N6,Npt}⁢(assumed)).\begin{aligned} \frac{R_{\mathrm{fix}}+S_{2}}{W(N)}&\geq D_{\mathrm{II}}+% \overline{J}_{6}+2\overline{H}+\frac{5719}{10^{6}}+M_{5,\mathrm{internal}}-E^{% \prime}(N;\sigma),\\ E^{\prime}(N;\sigma)&=E_{\mathrm{van}}(N;\sigma)+\sum_{j\in\mathcal{H}}\bigl{(% }|\Lambda^{0}_{j,N}|+|\Lambda_{N}(\Delta_{j})|\bigr{)}+|\Lambda_{N}(\Delta_{G1% })|.\end{aligned}\qquad(2\mid N,\ N\geq\max\{N_{6},N_{\mathrm{pt}}\}\ \text{(% assumed)}).

Here DIID_{\mathrm{II}} denotes the original Paper II floor. The main route does not use the six endpoint replacements. Here ℋ={4,5,7,10}\mathcal{H}=\{4,5,7,10\}, with 55 denoting the lower part of S5S_{5} and 1010 its retained S10S_{10} part. Section 5 gives the hypotheses for this estimate.

The other three comparisons have the forms

(4.40) S6W⁢(N)≤J¯6−gRA,lo+ERA⁢(N;σ),SswW⁢(N)≤2⁢H¯−Δ⁢DL⁢3+Esw⁢(N;σ),4⁢BbW⁢(N)≤cK⁢2,G⁢0⁢I⁢(b)+EK⁢(N;b,σ).(2∣N,N≥max⁡{N6,Npt}⁢(assumed)).\begin{aligned} \frac{S_{6}}{W(N)}&\leq\overline{J}_{6}-g_{\mathrm{RA,lo}}+E_{% \mathrm{RA}}(N;\sigma),\\ \frac{S_{\mathrm{sw}}}{W(N)}&\leq 2\overline{H}-\Delta D_{L3}+E_{\mathrm{sw}}(% N;\sigma),\\ \frac{4B_{b}}{W(N)}&\leq c_{K2,G0}I(b)+E_{K}(N;b,\sigma).\end{aligned}\qquad(2% \mid N,\ N\geq\max\{N_{6},N_{\mathrm{pt}}\}\ \text{(assumed)}).

All error terms are nonnegative.

Then the following normalized lower bound holds:

(4.41) 4⁢Gb⁢(N)W⁢(N)≥DII+5719106+M5,internal+gRA,lo+Δ⁢DL⁢3−cK⁢2,G⁢0⁢I⁢(b)−ℰB⁢(N;b,σ),ℰB⁢(N;b,σ)=E′⁢(N;σ)+ERA⁢(N;σ)+Esw⁢(N;σ)+EK⁢(N;b,σ)+4⁢EptW⁢(N).(2∣N,N≥max⁡{N6,Npt}).\begin{aligned} \frac{4G_{b}(N)}{W(N)}&\geq D_{\mathrm{II}}+\frac{5719}{10^{6}% }+M_{5,\mathrm{internal}}+g_{\mathrm{RA,lo}}+\Delta D_{L3}-c_{K2,G0}I(b)-% \mathcal{E}_{B}(N;b,\sigma),\\ \mathcal{E}_{B}(N;b,\sigma)&=E^{\prime}(N;\sigma)+E_{\mathrm{RA}}(N;\sigma)+E_% {\mathrm{sw}}(N;\sigma)+E_{K}(N;b,\sigma)+\frac{4E_{\mathrm{pt}}}{W(N)}.\end{% aligned}\qquad(2\mid N,\ N\geq\max\{N_{6},N_{\mathrm{pt}}\}).
Proof.

Substitute the four assumed estimates into (4.15) and use (4.13). The terms J¯6\overline{J}_{6} and 2⁢H¯2\overline{H} cancel exactly. Each complete upper source is subtracted once. In particular, no additional switched majorant is added.

Using the same retained constant as in Section 9, put

(4.42) DB=DII+5719106+M5,internal+gRA,lo−110000+Δ⁢DL⁢3,ℰB⁢(N;b,σ)≤110000⟹4⁢Gb⁢(N)W⁢(N)≥DB−cK⁢2,G⁢0⁢I⁢(b).(2∣N,N≥max⁡{N6,Npt}).\begin{aligned} D_{B}&=D_{\mathrm{II}}+\frac{5719}{10^{6}}+M_{5,\mathrm{% internal}}+g_{\mathrm{RA,lo}}-\frac{1}{10000}+\Delta D_{L3},\\ \mathcal{E}_{B}(N;b,\sigma)\leq\frac{1}{10000}&\quad\Longrightarrow\quad\frac{% 4G_{b}(N)}{W(N)}\geq D_{B}-c_{K2,G0}I(b).\end{aligned}\qquad(2\mid N,\ N\geq% \max\{N_{6},N_{\mathrm{pt}}\}).

∎

5. The retained side

Keep every original source of Paper II, including the complete sum S2S_{2}. Fix 0<σ≤10−100<\sigma\leq 10^{-10} satisfying Paper II, (1.27). Put

(5.1) L=log⁡N,τ=σ9,ρ=1+τ,h=hG=95000,ηL=110000.L=\log N,\qquad\tau=\sigma^{9},\qquad\rho=1+\tau,\qquad h=h_{G}=\frac{9}{5000}% ,\qquad\eta_{L}=\frac{1}{10000}.

The choice of σ\sigma precedes the limit. Use WW from (2.2). Write RfixR_{\mathrm{fix}} for (4.14).

The comparison required in this section is

(5.2) Rfix+S2W\displaystyle\frac{R_{\mathrm{fix}}+S_{2}}{W} ≥DII+g6+J¯6+2⁢H¯+5719106+M5,internal−E′⁢(N;σ),\displaystyle\geq D_{\mathrm{II}}+g_{6}+\overline{J}_{6}+2\overline{H}+\frac{5% 719}{10^{6}}+M_{5,\mathrm{internal}}-E^{\prime}(N;\sigma),
E′⁢(N;σ)\displaystyle E^{\prime}(N;\sigma) =Evan⁢(N;σ)+∑j∈ℋ(|Λj,N0|+|Λj,N|)+|ΛG,N|,ℋ={4,5,7,10}.\displaystyle=E_{\mathrm{van}}(N;\sigma)+\sum_{j\in\mathcal{H}}\bigl{(}|% \Lambda^{0}_{j,N}|+|\Lambda_{j,N}|\bigr{)}+|\Lambda_{G,N}|,\qquad\mathcal{H}=% \{4,5,7,10\}.

In ℋ\mathcal{H}, indices 55 and 1010 denote the lower S5S_{5} and retained S10S_{10} parts. Every displayed error is nonnegative. The notation agrees with (1.12):

(5.3) Λj,N=ΛN⁢(Δj),ΛG,N=ΛN⁢(ΔG⁢1).\Lambda_{j,N}=\Lambda_{N}(\Delta_{j}),\qquad\Lambda_{G,N}=\Lambda_{N}(\Delta_{% G1}).

The required limit is E′⁢(N;σ)→0E^{\prime}(N;\sigma)\to 0. Proposition 5.10 proves (5.2). Its inputs are listed in Remark 5.9. The six-endpoint lemma is optional: without it, the same proof gives (5.2) with g6g_{6} replaced by 0. We display the unchanged comparisons first. Then we specify the five incremental and four saved-array conversion terms.

5.1. The original signed chains

Let ℐ=ℐrow⊔{T5}\mathcal{I}=\mathcal{I}_{\mathrm{row}}\sqcup\{\mathrm{T5}\} index the signed chains of Rfix+S2R_{\mathrm{fix}}+S_{2}. Here ℐrow\mathcal{I}_{\mathrm{row}} is the set of Paper II’s nineteen row chains. The chain T5\mathrm{T5} is Paper II’s outer chain for the upper part of S5S_{5} [27, (2.28), (5.10), (6.1) and §6.1, condition 1]. For j∈ℐj\in\mathcal{I}, let Qj,kQ_{j,k} include its normalized coefficient. Paper II uses ten stages [27, (6.4)–(6.4d)]:

(5.4) Qj,0=Qj,10+∑k=110(Qj,k−1−Qj,k).Q_{j,0}=Q_{j,10}+\sum_{k=1}^{10}(Q_{j,k-1}-Q_{j,k}).

The initial expression is the actual arithmetic source. The last expression is a directed rational endpoint. For j=T5j=\mathrm{T5} the stages are those of Lemma 5.1: QT5,kQ_{\mathrm{T5},k} is defined there for k≤3k\leq 3, and QT5,k=QT5,3Q_{\mathrm{T5},k}=Q_{\mathrm{T5},3} for 3≤k≤103\leq k\leq 10. For the three joint groups, use

(5.5) 𝒪\displaystyle\mathcal{O} ∈{S1,S2⁢-⁢T8/4,G1},Q𝒪,9=∑j∈𝒪Qj,9,\displaystyle\in\{S_{1},S_{2}\text{-}T_{8}/4,G_{1}\},\qquad Q_{\mathcal{O},9}=% \sum_{j\in\mathcal{O}}Q_{j,9},
∑j∈𝒪Qj,0\displaystyle\sum_{j\in\mathcal{O}}Q_{j,0} =E𝒪+(Q𝒪,9−E𝒪)+∑j∈𝒪∑k=19(Qj,k−1−Qj,k),\displaystyle=E_{\mathcal{O}}+(Q_{\mathcal{O},9}-E_{\mathcal{O}})+\sum_{j\in% \mathcal{O}}\sum_{k=1}^{9}(Q_{j,k-1}-Q_{j,k}),
Q𝒪,9−E𝒪\displaystyle Q_{\mathcal{O},9}-E_{\mathcal{O}} ≥0.\displaystyle\geq 0.

The joint signs are kept before rounding. The G1G_{1} weights are (2,1,1)(2,1,1).

Signed sources and parent assignment.

Here “parent” records the assignment of an arithmetic occurrence and its source-restoration share. It does not assert that each Buchstab child is numerically bounded by the unsplit parent. Let Tj,rT_{j,r} be the nonnegative plain-source terms of Paper II, (2.19) and (3.2). Let Δjsrc\Delta_{j}^{\rm src} be its signed source correction. Then

3⁢S1=3⁢(T1,0−T1,1+T1,2−T1,3)+3⁢Δ1src,S2=T2,0−T2,1+T2,2−T2,3+Δ2src.3S_{1}=3(T_{1,0}-T_{1,1}+T_{1,2}-T_{1,3})+3\Delta_{1}^{\rm src},\qquad S_{2}=T% _{2,0}-T_{2,1}+T_{2,2}-T_{2,3}+\Delta_{2}^{\rm src}.

For every third-depth S1 occurrence, E3≤p3E_{3}\leq p_{3} gives −3⁢Spl⁢(b,p3)≥−3⁢Spl⁢(b,E3)-3S_{\rm pl}(b,p_{3})\geq-3S_{\rm pl}(b,E_{3}). For S2 we make this replacement only on Paper II’s selected whole-KK blocks ℱ\mathcal{F}, including P⁢FPF and ℱ∩R⁢1\mathcal{F}\cap R1. There −Spl⁢(b,p3)≥−Spl⁢(b,E3)-S_{\rm pl}(b,p_{3})\geq-S_{\rm pl}(b,E_{3}). On the strict complement ℬ\mathcal{B} keep the actual p3p_{3} and Paper II’s strict-BV comparison. The last child of S2 keeps its negative sign on all three pieces P⁢FPF, ℱ∩R⁢1\mathcal{F}\cap R1, and ℬ\mathcal{B}. The strict BV piece stays in S2.

For the fixed-cutoff rows use their literal divisor domains. Their signed sources are −2⁢S3-2S_{3}, −S4-S_{4}, −S5,low-S_{5,\rm low}, −S7-S_{7}, +S8+S_{8}, and +S9+S_{9}, respectively. On each source cell, an upper sieve bound S≤US\leq U gives c⁢S≥c⁢UcS\geq cU when c<0c<0. A lower sieve bound L≤SL\leq S gives c⁢S≥c⁢LcS\geq cL when c>0c>0. These comparisons keep the source corrections and the row’s allocated errors. Paper II, (2.28), gives the exact assignment identity

−S5=−S5,low−S5,top,S5,low=∑1/4≤logN⁡p<t∗S⁢(p,Nα),S5,top=∑t∗≤logN⁡p<τSS⁢(p,Nα).-S_{5}=-S_{5,\rm low}-S_{5,\rm top},\quad S_{5,\rm low}=\sum_{1/4\leq\log_{N}p% <t_{*}}S(p,N^{\alpha}),\quad S_{5,\rm top}=\sum_{t_{*}\leq\log_{N}p<\tau_{S}}S% (p,N^{\alpha}).

The endpoint t∗t_{*} belongs to the upper/BV part. The split precedes the structured sieve or Heath–Brown expansion and keeps parent labels. S5-low and T5 both have parent S5. S5-low gets no restoration address of its own. For S10 the source partition S10=S10,Ret+S10,DropS_{10}=S_{10,\rm Ret}+S_{10,\rm Drop} is exact, with S10,Ret,S10,Drop≥0S_{10,\rm Ret},S_{10,\rm Drop}\geq 0. Hence +S10≥+S10,Ret+S_{10}\geq+S_{10,\rm Ret} before its lower sieve bound.

The joint source keeps the representation weights (2,1,1)(2,1,1). Paper II, (4.14), gives, with its stated exceptional-source and small-prime allowance EG≥0E_{G}\geq 0,

G1≤2⁢S⁢(ℬ11,N1/2)+S⁢(ℬ12,N1/2)+S⁢(ℬ13,N1/2)+EG.G_{1}\leq 2S(\mathcal{B}_{11},N^{1/2})+S(\mathcal{B}_{12},N^{1/2})+S(\mathcal{% B}_{13},N^{1/2})+E_{G}.

Make its cut-measure replacement with the original signed correction before applying (4.18). The four signed descendants of −G1-G_{1} then have coefficients (−1,+1,−1,+1)(-1,+1,-1,+1) on the single weighted source. Their last positive term is bounded from below by its retained cells. The change from actual a3a_{3} to label base EE keeps the signed peel correction of Paper II, (4.45)–(4.57). The four rows share one joint source parent and one restoration allocation. Thus S1, S2, S4, S5, S7, S10 and G1 are the seven parents of the sixteen listed retained rows. S3, S8 and S9 keep their original single-comparison parents, and T5 remains the upper part of S5. These are sign-correct source reductions for the complete parent chains. They do not discharge the distinct S6, bad-source or switched-source comparisons in Section 4.

The nineteen original row chains of ℐrow\mathcal{I}_{\mathrm{row}} are the sixteen rows of Appendix B.7 and Paper II’s original S3,S8,S9S_{3},S_{8},S_{9} comparisons. The strict BV piece of S2S_{2} lies inside the joint S2S_{2} group. The source −S5-S_{5} of RfixR_{\mathrm{fix}} is split at Nt∗N^{t_{*}}, t∗=7109/28000t_{*}=7109/28000, before any sieve step. Its lower part is the row S5S_{5}-low of ℐrow\mathcal{I}_{\mathrm{row}}. Its upper part is the chain T5\mathrm{T5}. The chains of S6S_{6} and SswS_{\mathrm{sw}} are excluded. Thus the endpoint sum over ℐ\mathcal{I} is

(5.6) ∑j∈ℐQj,10=Bprint−δG⁢1+J¯6+2⁢H¯,δG⁢1=4.98⋅10−54.\sum_{j\in\mathcal{I}}Q_{j,10}=B_{\mathrm{print}}-\delta_{G1}+\overline{J}_{6}% +2\overline{H},\qquad\delta_{G1}=4.98\cdot 10^{-54}.

This follows from Paper II’s printed thirteen-term sum [27, §6.4, immediately before (6.6)]. Its joint endpoint is QG⁢1,10=LG⁢1−δG⁢1Q_{G1,10}=L_{G1}-\delta_{G1}; the printed sum uses LG⁢1L_{G1}. The term −J¯5-\overline{J}_{5} of (5.7) is QT5,10Q_{\mathrm{T5},10}, by Lemma 5.1. Apart from −J¯6−2⁢H¯-\overline{J}_{6}-2\overline{H}, every other term of (5.7) is an endpoint. It ends a chain of ℐrow\mathcal{I}_{\mathrm{row}} or a joint group. This is a finite coefficient identity. The printed sum is

(5.7) Bprint=\displaystyle B_{\mathrm{print}}={} D¯1+d¯2−U3,A2−U4+U5,low+U74\displaystyle\underline{D}_{1}+\underline{d}_{2}-\frac{U_{3,A}}{2}-\frac{U_{4}% +U_{5,\mathrm{low}}+U_{7}}{4}
+L8,A+L9,A+L104+LG⁢1−J¯5−J¯6−2⁢H¯\displaystyle+\frac{L_{8,A}+L_{9,A}+L_{10}}{4}+L_{G1}-\overline{J}_{5}-% \overline{J}_{6}-2\overline{H}
>\displaystyle> 1.83403742109641331345957914542194044932304169727869681073064.\displaystyle 1.83403742109641331345957914542194044932304169727869681073064.

The letters denote the rational endpoints printed in Paper II, Appendix A.2–A.6 and (A.7), (A.10), (A.13)–(A.14). The constant J¯6\overline{J}_{6} keeps its rational definition:

(5.8) J¯6=1.3148581959157321533513247276782285310758770468886237619585.\overline{J}_{6}=1.3148581959157321533513247276782285310758770468886237619585.

The upper part of S5S_{5} has the following outer chain. Put t∗=7109/28000t_{*}=7109/28000, τS=57/224\tau_{S}=57/224, and let

(5.9) J¯5=14⁢(c5+8.84⋅10−57),c5=0.03658166423843258896399704402764682632822246022922592990,\overline{J}_{5}=\frac{1}{4}\bigl{(}c_{5}+8.84\cdot 10^{-57}\bigr{)},\qquad c_% {5}=0.03658166423843258896399704402764682632822246022922592990,

which is Paper II’s directed upper endpoint for J5⁢(0)=∫t∗τSd⁢tt⁢(1/2−t)J_{5}(0)=\int_{t_{*}}^{\tau_{S}}\frac{dt}{t(1/2-t)} [27, (5.16), (5.20), (A.14)–(A.14a)].

Lemma 5.1 (The outer chain of the upper part of S5S_{5}).

Define

QT5,0\displaystyle Q_{\mathrm{T5},0} =−1W⁢∑t∗≤logN⁡p1<τSS⁢(p1,Nα),\displaystyle=-\frac{1}{W}\sum_{t_{*}\leq\log_{N}p_{1}<\tau_{S}}S(p_{1},N^{% \alpha}), QT5,1\displaystyle Q_{\mathrm{T5},1} =−T5W,\displaystyle=-\frac{T_{5}}{W},
QT5,2\displaystyle Q_{\mathrm{T5},2} =−J5⁢(0),\displaystyle=-J_{5}(0), QT5,3\displaystyle Q_{\mathrm{T5},3} =−J¯5,\displaystyle=-\overline{J}_{5},

where the first sum is the second term of Paper II, (2.28), and T5T_{5} is Paper II, (5.10). Then

QT5,0−QT5,1≥−ET5,1⁢(N),QT5,1−QT5,2≥−ET5,2⁢(N),QT5,2−QT5,3≥0,Q_{\mathrm{T5},0}-Q_{\mathrm{T5},1}\geq-E_{\mathrm{T5},1}(N),\qquad Q_{\mathrm% {T5},1}-Q_{\mathrm{T5},2}\geq-E_{\mathrm{T5},2}(N),\qquad Q_{\mathrm{T5},2}-Q_% {\mathrm{T5},3}\geq 0,

with ET5,1,ET5,2≥0E_{\mathrm{T5},1},E_{\mathrm{T5},2}\geq 0 tending to 0 at fixed σ\sigma. Both are entries of EvanE_{\mathrm{van}}. In particular QT5,0≥−J¯5−ET5,1⁢(N)−ET5,2⁢(N)Q_{\mathrm{T5},0}\geq-\overline{J}_{5}-E_{\mathrm{T5},1}(N)-E_{\mathrm{T5},2}(N).

Proof.

Paper II splits −S5-S_{5} at Nt∗N^{t_{*}} before the structured sieve or HB. The endpoint t∗t_{*} belongs to the upper part [27, (2.28) and the three lines after it]. The coefficient is −1-1.

Stage one. For a prefix p1∈𝒫Np_{1}\in\mathcal{P}_{N}, dropping the condition (m,N⁢b)=1(m,Nb)=1 gives S⁢(p1,Nα)≤Sp1⁢(Nα)S(p_{1},N^{\alpha})\leq S_{p_{1}}(N^{\alpha}) in the notation of Paper II, (5.9) [27, the sentence after (5.9)]. Prefixes p1∣Np_{1}\mid N are removed at their first failure. This is the error-table entry “Exceptional source factors”, of size Oσ⁢(L3/N+N−α/2+o⁢(1))O_{\sigma}(L^{3}/N+N^{-\alpha/2+o(1)}) [27, §6.3]. A prime equal to Nt∗N^{t_{*}} or NτSN^{\tau_{S}} divides NN [27, after (5.20)]. With the coefficient −1-1 this gives the first inequality.

Stage two. Paper II applies the upper sieve (5.4) to each 𝒜b\mathcal{A}_{b}, b=p1b=p_{1}. Its parameters are X𝒜=Li⁡(X)/φ⁢(b)X_{\mathcal{A}}=\operatorname{Li}(X)/\varphi(b), level Q=N1/2⁢L−BQ=N^{1/2}L^{-B} (κ=0\kappa=0), Db=Q/bD_{b}=Q/b and zb=Nαz_{b}=N^{\alpha} [27, (5.12)]. For t=logN⁡p1∈[t∗,τS)t=\log_{N}p_{1}\in[t_{*},\tau_{S}) one has a0⁢(t)=1/2−t≥55/224a_{0}(t)=1/2-t\geq 55/224, t∗−α=5368241/32172000>0t_{*}-\alpha=5368241/32172000>0, and

a0α∈[126394480,79177592800000]⊂(2,3)\frac{a_{0}}{\alpha}\in\Bigl{[}\frac{12639}{4480},\frac{7917759}{2800000}\Bigr% {]}\subset(2,3)

[27, table after (5.12), row T5]. Hence eventually sb=(a0−δN)/α∈(2,3)s_{b}=(a_{0}-\delta_{N})/\alpha\in(2,3), where F⁢(s)=2⁢eγ/sF(s)=2e^{\gamma}/s [27, between (5.4) and (5.5)]. By (5.14) the remainders are o⁢(UC)o(U_{C}). The main terms are (5.15), and (5.16) gives T5≤4⁢(1−ε)⁢UC⁢J5⁢(0)+o⁢(UC)T_{5}\leq 4(1-\varepsilon)U_{C}J_{5}(0)+o(U_{C}) with the vanishing logarithmic loss (5.21) [27, (5.14)–(5.16), (5.21) and the sentence “S5 keeps its vanishing logarithmic loss”]. Since W=4⁢(1−ε)⁢UCW=4(1-\varepsilon)U_{C}, this is the second inequality. Its error is the error-table entry “S5 BV remainder” plus the prime-measure and Euler conversion of that row [27, §6.3].

Stage three. By Paper II, (A.14)–(A.14a), 4⁢J5⁢(0)4J_{5}(0) lies in the ball of centre c5c_{5} and radius 8.84⋅10−578.84\cdot 10^{-57}, so J5⁢(0)≤J¯5J_{5}(0)\leq\overline{J}_{5}. Paper II also gives the independent rational enclosure P5<4⁢J5⁢(0)<P5+R5P_{5}<4J_{5}(0)<P_{5}+R_{5} inside the same ball [27, after (A.14a)].

The chain uses κ=0\kappa=0, so the increment J5⁢(κ)−J5⁢(0)J_{5}(\kappa)-J_{5}(0) does not occur. Paper II’s allowance E5,κ=4⋅10−8E_{5,\kappa}=4\cdot 10^{-8} is a summand of gBV=0.00000575g_{\mathrm{BV}}=0.00000575 in (5.10) and stays there once. Paper II, Appendix A, records the hypothetical increment and its once-booked decomposition. They are in the paragraph opening For comparison, if S5-top used κ=10−6\kappa=10^{-6} and in the BV-allowance line right after it [27, Appendix A, comparison paragraph and following decomposition]. Equation (A.14a) gives only the nominal value at κ=0\kappa=0. ∎

The chain T5\mathrm{T5} does not meet the changes of this section. Its three stages use no sieve level ℓc\ell_{c} and no saved profile. They use no Class II, packing or Class I term. Paper II’s prepared Class II, packing and Class I contributions of this row are zero [27, §2.4, paragraph “S5-top and S6 use BV separately”]. The lift below changes the kernels on I4I_{4}, I5=[1/4,t∗)I_{5}=[1/4,t_{*}), I7I_{7} and 𝒟10\mathcal{D}_{10} only. The interval I5I_{5} is disjoint from [t∗,τS)[t_{*},\tau_{S}). The joint shift changes the G1G_{1} cone only. Hence Lemma 5.1 holds unchanged after both changes.

Keep the whole fixed deduction of Paper II:

(5.10) Fnet=\displaystyle F_{\mathrm{net}}={} 0.000006484294227956901+0.00000575+0.00002853328\displaystyle 0.000006484294227956901+0.00000575+0.00002853328
+4.98⋅10−54+2⋅10−24+10−390\displaystyle+4.98\cdot 10^{-54}+2\cdot 10^{-24}+10^{-390}
<0.000040767574227956903.\displaystyle<0.000040767574227956903.

These are Paper II’s six deductions [27, (6.6)]. The first remains paid although its source is excluded. The joint G1G_{1} reconciliation also remains paid. Every adverse row difference has an absolute bound. Keep their whole vanishing envelope, EvanE_{\mathrm{van}}. The row estimates required here are

(5.11) ∑j∈ℐ∑k=110(Qj,k−1−Qj,k)≥−(Fnet−δG⁢1)−Evan⁢(N;σ),Evan⁢(N;σ)⟶0.\sum_{j\in\mathcal{I}}\sum_{k=1}^{10}(Q_{j,k-1}-Q_{j,k})\geq-\bigl{(}F_{% \mathrm{net}}-\delta_{G1}\bigr{)}-E_{\mathrm{van}}(N;\sigma),\qquad E_{\mathrm% {van}}(N;\sigma)\longrightarrow 0.

The δG⁢1\delta_{G1} part is already in the endpoint sum, so the remaining chain deduction is Fnet−δG⁢1F_{\mathrm{net}}-\delta_{G1}. Their total is exactly FnetF_{\mathrm{net}}. The fixed AA37 share is paid under the admissible condition 0<σ≤4⁢gAA/(CE⁢W∗)0<\sigma\leq 4g_{\mathrm{AA}}/(C_{E}W_{*}) of Paper II, (1.27) [27]. See Paper II, §6.5. This condition is part of the fixed-parameter choice made before the limit. The analytic inputs are Paper II, (6.4b)–(6.5), and its direct and G1G_{1} estimates [27, (4.66)–(4.69), (6.4b)–(6.5)]. Their logarithmic parameters are

(5.12) K0=8042,A′=8047,Awork=8051,K0+2−A′=−3.K_{0}=8042,\qquad A^{\prime}=8047,\qquad A_{\mathrm{work}}=8051,\qquad K_{0}+2% -A^{\prime}=-3.

These are Paper II, (4.66), for the original coefficient families. This section leaves them unchanged.

Lemma 5.2 (Inherited chain errors).

The bound (5.11) holds, and Evan⁢(N;σ)→0E_{\mathrm{van}}(N;\sigma)\to 0 as N→∞N\to\infty at fixed σ\sigma. Each row or separately listed stage difference used below has an allocated nonnegative share in Paper II’s error table. Denote it by ℰj\mathcal{E}_{j}. Paper II, §6, charges these shares once. An entry may be grouped across rows, so the lemma claims nothing for arbitrary subfamilies and does not claim pairwise disjoint entries. The only omission bounds used are those for the whole chains or stage differences named in the proof below.

Proof.

The signed-assembly theorem of Paper II proves Dsrc≥Bmain−Fpers−EvanD_{\mathrm{src}}\geq B_{\mathrm{main}}-F_{\mathrm{pers}}-E_{\mathrm{van}} with Evan→0E_{\mathrm{van}}\to 0 for the source (6.1) [27, §6.1, (6.1)–(6.2), (6.4)–(6.4d)]. Its proof bounds every adverse stage difference by an allocated share of Paper II’s error table, §6.3. Each entry is a nonnegative bound or a proved zero; some entries are grouped across rows. Paper II assigns each tuple to its first failed condition and charges each difference or part once below [27, §6.3]. The fixed entries are the six deductions of (5.10), that is Fpers=FnetF_{\mathrm{pers}}=F_{\mathrm{net}} [27, (6.6)]. The others tend to zero at fixed σ\sigma, and their sum is EvanE_{\mathrm{van}}. The rows of ℐ\mathcal{I} are rows of (6.1). The S6S_{6} level increment is still deducted when that chain is omitted. The δG⁢1\delta_{G1} part is already in (5.6). This gives (5.11). For T5\mathrm{T5} the differences and entries are those of Lemma 5.1. Separately listed entries cover the omissions used in this chapter. The whole S6S_{6} and SswS_{\mathrm{sw}} chains use the S6 BV remainder, S6 level increment and ESswE_{S_{\mathrm{sw}}} entries. The whole G1G_{1} chain uses the §4.6 table and (4.85) of Paper II [27, §4.6, (4.85)]. The stage-nine strip for the retained part of S10S_{10} uses the S10 selector entry. These bounds apply to the named whole chains or stage difference after allocating their shares. No arbitrary omitted subfamily is asserted. For the direct rows, the stage-nine entry “Profile comparison” is zero adverse. The stage-ten entry “Directed enclosure” is zero additional [27, §6.3]. For the retained part of S10S_{10}, the strip between the retained cells and 𝒟10\mathcal{D}_{10} is the entry “S10 selector”, 7.160⁢τ7.160\tau. The term gτ=2⋅10−24g_{\tau}=2\cdot 10^{-24} replaces it [27, §6.3, rows “S10 selector” and gτg_{\tau}].

The entries rest on the following inputs, all used by Paper II on these same sources. The linear-sieve main terms and remainders are Paper I, Theorem 2.6, (2.30)–(2.33b). This is the structured form of Iwaniec’s Theorem 4 [13, Theorem 4, p. 311], applied with D=LcD=L_{c}, ϵs=σ\epsilon_{s}=\sigma and δs=τ\delta_{s}=\tau [27, §6.2]. Before the exterior sign, applied once, each block remainder splits as

CcMc⁢⟨γc,ΔP⟩+N⁢Csf,c−⟨ΞU,c,ΔP⟩+⟨ΞA,c,Δ0−ΔP⟩,\frac{C_{c}}{M_{c}}\langle\gamma_{c},\Delta_{P}\rangle+NC_{\mathrm{sf},c}-% \langle\Xi_{U,c},\Delta_{P}\rangle+\langle\Xi_{A,c},\Delta_{0}-\Delta_{P}\rangle,

with ΞA,c=Oc⁢𝟏q⁢not⁢squarefree\Xi_{A,c}=O_{c}\mathbf{1}_{q\ \mathrm{not\ squarefree}} [27, (6.4a)–(6.4b), (4.23)]. The term N⁢CsfNC_{\mathrm{sf}} vanishes on the direct rows, where Δ0=ΔP\Delta_{0}=\Delta_{P}. On G1G_{1} it is Oσ⁢(N−α⁢L5)O_{\sigma}(N^{-\alpha}L^{5}) by Paper II, (4.64)–(4.65). The terms ΞU\Xi_{U} and ΞA\Xi_{A} are bounded jointly, once, by 232⁢Λσ⁢Cret,σ⁢N−ℓ0⁢σ2⁢(1+L)4232\Lambda_{\sigma}C_{\mathrm{ret},\sigma}N^{-\ell_{0}\sigma^{2}}(1+L)^{4}, with ℓ0=264897/2060000\ell_{0}=264897/2060000 [27, (B.1)–(B.7)]. Here Cret,σC_{\mathrm{ret},\sigma} is the retained-side combinatorial constant; it depends on the fixed σ\sigma and not on NN. The persistent part CE⁢σ⁢WAA/4C_{E}\sigma W_{\mathrm{AA}}/4 of Paper II, (B.8), lies in gAAg_{\mathrm{AA}}; only its secondary part belongs to EvanE_{\mathrm{van}}. The Class II estimate (6.5) of Paper II applies Paper I, Theorem 3.2, (3.13), with the precisions (5.12). The spectral input of that theorem is Paper I, Theorem 2.8; see Fact 3.22. In the large-norm case of Paper I, (3.48), its mean-square input is Lemma 6.5(ii), in place of [3, Theorem 0(a)]. Lemma 6.5(ii) applies under the Paper I hypotheses and selected parameter box stated there. It uses neither the optional six-endpoint lemma nor any broader BFI86 scope. Its premises are checked for these sources as follows. In Paper I, conditions (3.1), (3.2), (3.6), (3.8) with the length condition, and (3.11) display its hypotheses (H1)–(H5). Paper II verifies them for these same sources, coefficients, boxes and scales [27, §6.2, hypothesis table, row “C1–C5, LEN”]. Paper I proves condition (3.25) for every selected factor of this form. The proof uses the prime Siegel–Walfisz theorem (2.21) [26, (3.25) and its proof]. Conditions (3.26)–(3.27) are the definition of λr\lambda_{r} and the Cauchy–Schwarz step of that proof. They hold under (H1)–(H5), with |λr|≤τ⁢(r)|\lambda_{r}|\leq\tau(r) from the roughness in (H2) [26, (3.26)–(3.27)]. Stages one to eight are unchanged, so these are Paper II’s own checks. The prime-measure and Euler conversions are the prime number theorem, Mertens’ theorem and Paper II, (4.76)–(4.78). The profile lift and the shifted joint profile below act at stages nine and ten only. They change no source, cell, level, mask, box, norm or precision at stages one to eight. Hence EvanE_{\mathrm{van}} is Paper II’s own envelope for these rows. ∎

Paper II’s rational floor satisfies

(5.13) Bprint−Fnet>DII=4584991633800917059325000000000000000000;B_{\mathrm{print}}-F_{\mathrm{net}}>D_{\mathrm{II}}=\frac{45849916338009170593% }{25000000000000000000};

see [27, (6.3a), (6.6)]. The selected S2 endpoint used in this floor is dT⁢8d_{T8}. Paper II’s tail reserve is

(5.14) δT⁢8=120000,dT⁢8=P−−(2/eγ)⁢Vfull−(2/eγ)⁢J++C−4−δT⁢8.\delta_{T8}=\frac{1}{20000},\qquad d_{T8}=\frac{P_{-}-(2/e^{\gamma})V_{\mathrm% {full}}-(2/e^{\gamma})J_{+}+C_{-}}{4}-\delta_{T8}.

Thus δT⁢8\delta_{T8} is deducted once inside dT⁢8d_{T8}, as in Paper II, (A.7)–(A.8). It is not a second deduction from DIID_{\mathrm{II}}. The separate fixed term 275009680⁢τ275009680\tau remains outside dT⁢8d_{T8} in the S2 estimate [27, (3.22)–(3.23), (A.7)]. Combining the preceding estimates gives

(5.15) Rfix+S2W≥DII+J¯6+2⁢H¯−Evan⁢(N;σ).\frac{R_{\mathrm{fix}}+S_{2}}{W}\geq D_{\mathrm{II}}+\overline{J}_{6}+2% \overline{H}-E_{\mathrm{van}}(N;\sigma).

This deduction uses the individual signed chains. Its analytic input is (5.11).

5.2. Six improved endpoints

Let

(5.16) 𝒥={1,2,4,5,7,10}.\mathcal{J}=\{1,2,4,5,7,10\}.

For j∈𝒥j\in\mathcal{J}, let PjP_{j} be its Paper II profile integral. The indices 55 and 1010 keep the preceding conventions. Let OjO_{j} and NjN_{j} be directed lower endpoints. The required numerical comparisons are

(5.17) Pj≥Nj≥Oj,Pj−Oj=(Nj−Oj)+(Pj−Nj).P_{j}\geq N_{j}\geq O_{j},\qquad P_{j}-O_{j}=(N_{j}-O_{j})+(P_{j}-N_{j}).

The old and improved directed endpoints are the following exact terminating decimals. They are given in the normalized D contributions used by the signed sum. For S4, S5-low and S7 the sign −1/4-1/4 is included; for S10 the sign +1/4+1/4 is included.

Endpoint source Directed contribution in D units
S1, [27, (A.4), (A.5a)] O1=9.67653874894124412908238749318694090949698021569432709634O_{1}=9.67653874894124412908238749318694090949698021569432709634
N1=9.676557035420731097796376157212899872020518126053458552042N_{1}=9.676557035420731097796376157212899872020518126053458552042
S2, [27, (A.8), (A.8a)] O2=1.6195813569890835255913340433210572922007671408165O_{2}=1.6195813569890835255913340433210572922007671408165
N2=1.62063469556829N_{2}=1.62063469556829
S4, [27, Appendix A.2–A.6] O4=−0.8342438370724665O_{4}=-0.8342438370724665
N4=−0.8341817006889064605174981431060625N_{4}=-0.8341817006889064605174981431060625
S5-low, [27, Appendix A.2–A.6] O5=−0.05972210829776175O_{5}=-0.05972210829776175
N5=−0.05971885506770766576732140865035175N_{5}=-0.05971885506770766576732140865035175
S7, [27, Appendix A.2–A.6] O7=−0.574850630119163O_{7}=-0.574850630119163
N7=−0.574815106890481420929612425345365N_{7}=-0.574815106890481420929612425345365
S10-Ret, [27, Appendix A.2–A.6] O10=0.214711863944485O_{10}=0.214711863944485
N10=0.21559427153309934685978873940373255N_{10}=0.21559427153309934685978873940373255

The rational endpoint differences sum to

(5.18) g6\displaystyle g_{6} =∑j∈𝒥(Nj−Oj)\displaystyle=\sum_{j\in\mathcal{J}}(N_{j}-O_{j})
=0.002054945489603492768011383006854970322770769542631455702.\displaystyle=0.002054945489603492768011383006854970322770769542631455702.

Exact rational addition of the six entries above gives the displayed sum, and each entry satisfies Nj≥OjN_{j}\geq O_{j}. The values OjO_{j} are Paper II’s directed endpoints, and Pj≥OjP_{j}\geq O_{j} is proved there [27, (A.4), (A.5a), (A.8), (A.8a), Appendix A.2–A.6]. The values NjN_{j} are lower bounds read from Paper II’s printed independent enclosures. The following optional lemma states them.

Lemma 5.3 (Six directed endpoints from Paper II; optional).

For each j∈𝒥={1,2,4,5,7,10}j\in\mathcal{J}=\{1,2,4,5,7,10\}, the Paper II profile integral PjP_{j}, with its signed normalized coefficient, satisfies Pj≥NjP_{j}\geq N_{j}, with NjN_{j} as tabulated above.

Proof.

For j=1j=1, Paper II, (A.5a), gives the printed 3/43/4 ball; its lower endpoint is N1N_{1}. For j=2j=2, Paper II, (A.8a), gives the printed interval whose lower endpoint is N2N_{2}. Paper II states that this interval covers the continuous functional and the infinite tail. The dT⁢8d_{T8} deduction in (6.6a) is released once in N2−O2N_{2}-O_{2}. The term FnetF_{\mathrm{net}} in (6.6b) contains no δT⁢8\delta_{T8} [27, (6.6a)–(6.6b)]. For j=4,5,7j=4,5,7, the Appendix A.3 balls include the adverse τ=10−90\tau=10^{-90} shifts. Since the profile function is nonincreasing, the shifted raw integrals are at least the τ\tau-free ones. Their upper endpoints with the negative coefficient therefore give Pj≥NjP_{j}\geq N_{j}. For j=10j=10, the Appendix A.3 S10S_{10}-Ret ball encloses the τ\tau-free actual-coordinate profile on 𝒟10\mathcal{D}_{10}. Its lower endpoint gives P10≥N10P_{10}\geq N_{10}. The separate D∗⁢τD_{*}\tau strip is paid in the S10S_{10} selector estimate. These are the printed enclosures in Paper II, (A.5a), (A.8a), and Appendix A.3. Its numerical-certificate section records the adverse-shift and actual-coordinate conventions [27, (A.5a), (A.8a), Appendix A.3]. The remaining directed endpoints OjO_{j} are unchanged. ∎

With OjO_{j} in place of NjN_{j}, (5.17) is Paper II’s own endpoint comparison and g6g_{6} is replaced by 0. Only the endpoint changes in (5.4). All earlier signed differences remain unchanged. Thus (5.17) adds g6g_{6} once. The S5S_{5} upper part remains separate. The joint G1G_{1} endpoint is absent from 𝒥\mathcal{J}.

5.3. Four stronger profile comparisons

Use the sieve functions of Paper I [26, (2.23), immediately before Theorem 2.6]. Put

(5.19) F^=F2⁢eγ,f^=f2⁢eγ,K=5764−u.\widehat{F}=\frac{F}{2e^{\gamma}},\qquad\widehat{f}=\frac{f}{2e^{\gamma}},% \qquad K=\frac{57}{64}-u.

Define

(5.20) s⁢(x)\displaystyle s(x) =K−5⁢x/2α,q⁢(x,y)=K−5⁢x/2−yα,\displaystyle=\frac{K-5x/2}{\alpha},\qquad q(x,y)=\frac{K-5x/2-y}{\alpha},
B0⁢(x)\displaystyle B_{0}(x) =min⁡{β,max⁡{α,K−11⁢α/5−5⁢x/2}}.\displaystyle=\min\{\beta,\max\{\alpha,K-11\alpha/5-5x/2\}\}.

The domains are

(5.21) I4=[μ∗,1/4),I5=[1/4,7109/28000),I7=[μ∗,λ),𝒟10={(x,y):μ∗≤x<λ,α≤y<B0⁢(x)}.\begin{gathered}I_{4}=[\mu_{*},1/4),\quad I_{5}=[1/4,7109/28000),\quad I_{7}=[% \mu_{*},\lambda),\\ \mathcal{D}_{10}=\{(x,y):\mu_{*}\leq x<\lambda,\ \alpha\leq y<B_{0}(x)\}.\end{gathered}

These are Paper II’s domains [27, (2.27), (2.29), (2.31), (2.38)–(2.40)]. Set

(5.22) Δj\displaystyle\Delta_{j} =∫IjF^⁢(s⁢(x))−F^⁢(s⁢(x)+h/α)α⁢x⁢𝑑x\displaystyle=\int_{I_{j}}\frac{\widehat{F}(s(x))-\widehat{F}(s(x)+h/\alpha)}{% \alpha x}\,dx (j=4,5,7),\displaystyle(j=4,5,7),
Δ10\displaystyle\Delta_{10} =∬𝒟10f^⁢(q⁢(x,y)+h/α)−f^⁢(q⁢(x,y))α⁢x⁢y⁢𝑑x⁢𝑑y.\displaystyle=\iint_{\mathcal{D}_{10}}\frac{\widehat{f}(q(x,y)+h/\alpha)-% \widehat{f}(q(x,y))}{\alpha xy}\,dx\,dy.

The three upper rows carry a negative sign. The lower S10S_{10} row carries a positive sign. Their original coefficients are included in these gains, so there is no further factor 1/41/4.

Paper II’s actual levels give

(5.23) ℓc\displaystyle\ell_{c} ≥α⁢s⁢(x)+h+110000−3⁢τ\displaystyle\geq\alpha s(x)+h+\frac{1}{10000}-3\tau (j=4,5,7),\displaystyle(j=4,5,7),
ℓc\displaystyle\ell_{c} ≥α⁢q⁢(x,y)+h+110000−(5⁢λ2+β)⁢τ\displaystyle\geq\alpha q(x,y)+h+\frac{1}{10000}-\left(\frac{5\lambda}{2}+% \beta\right)\tau (j=10).\displaystyle(j=10).

See [27, §2.4, proof of (2.26)–(2.31); §2.5, proof of (2.40)]. The exact split behind the displayed reserve is

(5.24) u−ηL=1910000=95000+110000=hG+110000.u-\eta_{L}=\frac{19}{10000}=\frac{9}{5000}+\frac{1}{10000}=h_{G}+\frac{1}{1000% 0}.

After the hGh_{G} lift, Paper II’s S4, S5-low (including its B branch) and S7 comparisons leave 1/10000−3⁢τ1/10000-3\tau. Its S10-Ret comparison leaves 1/10000−τ⁢(5⁢λ/2+β)1/10000-\tau(5\lambda/2+\beta). Both are positive for τ≤10−90\tau\leq 10^{-90}. The G1-3 shift leaves gs=1/10000−(225/256)⁢τ>2⁢μ∗⁢τg_{s}=1/10000-(225/256)\tau>2\mu_{*}\tau and the μ∗\mu_{*} crossing leaves 1/10000−(75/256)⁢τ>01/10000-(75/256)\tau>0, by [27, (4.72)]. These are pointwise profile-numerator inequalities. They do not change the actual level ℓc\ell_{c}, the level DcD_{c}, or the masks, boxes, Class-II and AA37 inputs. The other level conditions of Paper II remain pointwise and unmodified. They include the G1 guard, S1–S3, S2/S3/S8/S9, and the whole-K margin. See Paper II, (2.21), (2.40), (4.72), and (4.19). Decreasing FF gives the first three comparisons. Increasing ff gives the fourth comparison. These operations leave the actual levels unchanged. The H6 lift and the M5 shift act only at stages 9–10, after Class II at stage 7. They change no Class-II, AA37, box, mask or precision input: ℓc=Θc−ηL−∑iti\ell_{c}=\Theta_{c}-\eta_{L}-\sum_{i}t_{i} contains no saved profile, and (5.12) remains unchanged.

Proposition B.1 gives finite integral enclosures. With the directed calculation of the computational appendix, they prove the following. Its exact rational interval is

[0.005720047094327988714222991186379229149381887590042773120871489672965022499±7.09⋅10−76][0.005720047094327988714222991186379229149381887590042773120871489672965022499% \mathbin{\pm}7.09\cdot 10^{-76}]. This is a ball for the sum of the four rowwise lower bounds, not for ∑jΔj\sum_{j}\Delta_{j}. We use the terminating credit 572004/108572004/10^{8}. It lies below that exact lower endpoint and leaves the existing 10−2010^{-20} allowance intact. This allowance is conservative; it is not an additional gain in the final constant.

(5.25) 572004108<Δ4+Δ5+Δ7+Δ10<606486108,572004108−10−20>5719106.\frac{572004}{10^{8}}<\Delta_{4}+\Delta_{5}+\Delta_{7}+\Delta_{10}<\frac{60648% 6}{10^{8}},\qquad\frac{572004}{10^{8}}-10^{-20}>\frac{5719}{10^{6}}.

The unchanged S10S_{10} strip also satisfies

(5.26) 10987/100004⁢α2⁢(5⁢λ2+β)⁢λ−μ∗μ∗=211372545161976874120000000000000<5.137<7.160.\frac{10987/10000}{4\alpha^{2}}\left(\frac{5\lambda}{2}+\beta\right)\frac{% \lambda-\mu_{*}}{\mu_{*}}=\frac{21137254516197687}{4120000000000000}<5.137<7.1% 60.

The lifted S10S_{10} argument satisfies q+h/α≤11519839/3200000+h/α<4q+h/\alpha\leq 11519839/3200000+h/\alpha<4. Thus f≤f⁢(4)=2⁢eγ⁢log⁡3/4f\leq f(4)=2e^{\gamma}\log 3/4 throughout the strip, as used in this density bound. These are finite bounds, including their stated domains. The retained cells also leave a reserve. Put

(5.27) R10=[15,21100]×[9100,110],δ10=120000⁢α,c10=1α⋅7⁢δ10480⋅1210=146689320000000000,c10−211372545161976874120000000000000⁢τ>10−7.\begin{gathered}R_{10}=\Bigl{[}\frac{1}{5},\frac{21}{100}\Bigr{]}\times\Bigl{[% }\frac{9}{100},\frac{1}{10}\Bigr{]},\qquad\delta_{10}=\frac{1}{20000\alpha},\\ c_{10}=\frac{1}{\alpha}\cdot\frac{7\delta_{10}}{480}\cdot\frac{1}{210}=\frac{1% 46689}{320000000000},\qquad c_{10}-\frac{21137254516197687}{4120000000000000}% \,\tau>10^{-7}.\end{gathered}

Lemma 5.5 uses (5.26) and (5.27), so its comparison over the whole of 𝒟10\mathcal{D}_{10} needs no deduction. Paper II’s S10S_{10} selector entry 7.160⁢τ7.160\tau is replaced in Paper II by gτ=2⋅10−24g_{\tau}=2\cdot 10^{-24}, a summand of (5.10). The fixed gτg_{\tau} amount is deducted once. The retained reserve above eliminates the S10S_{10} selector deduction in this comparison. The inherited G1G_{1} peel and its label replacement are jointly covered by that same summand.

We next define the finite profile arrays. Let X0=[u,1]X_{0}=[u,1]. On this compact interval, use the zero extension of the profile outside its displayed domain, and put

(5.28) mN=∑p∈ℙ,p>2,p∤NNu≤p≤NδlogN⁡pp−1,m⁢(d⁢t)=d⁢tt.m_{N}=\sum_{\begin{subarray}{c}p\in\mathbb{P},\ p>2,\ p\nmid N\\ N^{u}\leq p\leq N\end{subarray}}\frac{\delta_{\log_{N}p}}{p-1},\qquad m(dt)=% \frac{dt}{t}.

The symbol δx\delta_{x} denotes unit mass at xx. Define

(5.29) VN⁢(z)=∏p<z,p∈ℙp∤N(1−1p−1),V_{N}(z)=\prod_{\begin{subarray}{c}p<z,\ p\in\mathbb{P}\\ p\nmid N\end{subarray}}\left(1-\frac{1}{p-1}\right),

and

(5.30) XD\displaystyle X_{D} =∑v∈ℙ𝟏N/L30<v<(1−ε)⁢N,\displaystyle=\sum_{v\in\mathbb{P}}\mathbf{1}_{N/L^{30}<v<(1-\varepsilon)N},
rD,N\displaystyle r_{D,N} =2⁢eγ⁢α⁢XD⁢VN⁢(Nα)W.\displaystyle=\frac{2e^{\gamma}\alpha X_{D}V_{N}(N^{\alpha})}{W}.

For j=4,5,7j=4,5,7, set

(5.31) kj0⁢(x)\displaystyle k_{j}^{0}(x) =−𝟏Ij⁢(x)α⁢F^⁢(s⁢(x)),\displaystyle=-\frac{\mathbf{1}_{I_{j}}(x)}{\alpha}\widehat{F}(s(x)),
kjh⁢(x)\displaystyle k_{j}^{h}(x) =−𝟏Ij⁢(x)α⁢F^⁢(s⁢(x)+h/α).\displaystyle=-\frac{\mathbf{1}_{I_{j}}(x)}{\alpha}\widehat{F}(s(x)+h/\alpha).

For j=10j=10, set

(5.32) k100⁢(x,y)\displaystyle k_{10}^{0}(x,y) =𝟏𝒟10α⁢f^⁢(q⁢(x,y)),\displaystyle=\frac{\mathbf{1}_{\mathcal{D}_{10}}}{\alpha}\widehat{f}(q(x,y)),
k10h⁢(x,y)\displaystyle k_{10}^{h}(x,y) =𝟏𝒟10α⁢f^⁢(q⁢(x,y)+h/α).\displaystyle=\frac{\mathbf{1}_{\mathcal{D}_{10}}}{\alpha}\widehat{f}(q(x,y)+h% /\alpha).

Put ej=1e_{j}=1 for j=4,5,7j=4,5,7, and e10=2e_{10}=2. The original and lifted arrays are

(5.33) Pj\displaystyle P_{j} =∫kj0⁢d⁢(mej),\displaystyle=\int k_{j}^{0}\,d(m^{e_{j}}), Sj,N0\displaystyle S_{j,N}^{0} =rD,N⁢∫kj0⁢d⁢(mNej),\displaystyle=r_{D,N}\int k_{j}^{0}\,d(m_{N}^{e_{j}}),
Sj,Nh\displaystyle S_{j,N}^{h} =rD,N⁢∫kjh⁢d⁢(mNej),\displaystyle=r_{D,N}\int k_{j}^{h}\,d(m_{N}^{e_{j}}), Bj,N\displaystyle B_{j,N} =Sj,Nh−Sj,N0.\displaystyle=S_{j,N}^{h}-S_{j,N}^{0}.

The powers denote product measures. These formulas use PjP_{j} from (5.17). Write dj=kjh−kj0d_{j}=k_{j}^{h}-k_{j}^{0}. For j=4,5,7j=4,5,7, and then j=10j=10,

(5.34) dj⁢(x)\displaystyle d_{j}(x) =𝟏Ij⁢(x)α⁢[F^⁢(s⁢(x))−F^⁢(s⁢(x)+h/α)],\displaystyle=\frac{\mathbf{1}_{I_{j}}(x)}{\alpha}[\widehat{F}(s(x))-\widehat{% F}(s(x)+h/\alpha)],
d10⁢(x,y)\displaystyle d_{10}(x,y) =𝟏𝒟10α⁢[f^⁢(q⁢(x,y)+h/α)−f^⁢(q⁢(x,y))].\displaystyle=\frac{\mathbf{1}_{\mathcal{D}_{10}}}{\alpha}[\widehat{f}(q(x,y)+% h/\alpha)-\widehat{f}(q(x,y))].

Thus Δj=∫dj⁢d⁢(mej)\Delta_{j}=\int d_{j}\,d(m^{e_{j}}). Define the two conversion errors:

(5.35) Λj,N0=Sj,N0−Pj,Λj,N=Bj,N−Δj(j∈ℋ).\Lambda^{0}_{j,N}=S^{0}_{j,N}-P_{j},\qquad\Lambda_{j,N}=B_{j,N}-\Delta_{j}% \qquad(j\in\mathcal{H}).
Lemma 5.4 (Finite profile shift).

For the arrays above,

(5.36) Sj,Nh=Pj+Λj,N0+Δj+Λj,N≥Pj+Δj−|Λj,N0|−|Λj,N|.S_{j,N}^{h}=P_{j}+\Lambda^{0}_{j,N}+\Delta_{j}+\Lambda_{j,N}\geq P_{j}+\Delta_% {j}-|\Lambda^{0}_{j,N}|-|\Lambda_{j,N}|.
Proof.

Substitute the two definitions in (5.35). ∎

Both absolute conversion terms appear as separate summands of E′E^{\prime}. We do not assume that Paper II’s original envelope contains the saved-array error. Its stage 8 converts the actual-level array before stage 9 domination [27, §6.1, stage table]. The arithmetic application uses the preceding level domination.

Restoration.

The four rows of ℋ\mathcal{H} are Paper II’s rows S4S_{4}, the lower part of S5S_{5}, S7S_{7} and the retained part of S10S_{10}. Their stage-two source-restoration shares are assigned once to the source parents S4S_{4}, S5S_{5}, S7S_{7} and S10S_{10}. The literal S5S_{5} split at 7109/280007109/28000 is made before the structured sieve or Heath–Brown expansion, as above. Both parts retain the parent S5S_{5} for this restoration accounting [27, (2.28), §6.1, stage table and the list of S10, S5 and S4/S7 endpoints]. There is no separate restoration for the lower part of S5S_{5}. The upper part of S5S_{5} is the outer chain T5\mathrm{T5} of Lemma 5.1, which the lift does not change. Each tuple of an actual source is assigned to one entry by Paper II’s first-failure rule [27, (6.4d) and the two sentences after it]. This section changes no source and no stage from one to eight, so the assignment is Paper II’s. Appendix B.7 lists the finite correspondence between these rows and Paper II’s error entries. It is an index of that assignment, and each entry occurs once.

Lemma 5.5 (Lifted direct comparison).

Let j∈ℋj\in\mathcal{H}, and let Qj,8Q_{j,8} be Paper II’s stage-eight quantity for this row. It is the continuum mass of the actual-level main term after the prime-measure and Euler conversion. There each actual cell carries its actual relative level ℓc\ell_{c}. Put Qj,9h=Pj+Δj=∫kjh⁢d⁢(mej)Q^{h}_{j,9}=P_{j}+\Delta_{j}=\int k_{j}^{h}\,d(m^{e_{j}}). Then Qj,8≥Qj,9hQ_{j,8}\geq Q^{h}_{j,9}.

Proof.

Stages one to eight are Paper II’s. Paper II passes from Qj,8Q_{j,8} to Qj,9=PjQ_{j,9}=P_{j} by pointwise domination of the actual-level integrand by the specified profile. The cells and the continuum measure are the same [27, §6.1, stage table; §2.4, after (2.31); §2.5, after (2.40)]. We repeat that domination with the lifted profile. For each B-labelled parent contributing to S4S_{4}, S7S_{7} or S5S_{5}-low, we first rederive the buffer used below. Write

m⁢(t)=min⁡{1+t2,5764−3⁢ρ⁢t2},tdd=2532⁢(1+3⁢ρ).m(t)=\min\left\{\frac{1+t}{2},\frac{57}{64}-\frac{3\rho t}{2}\right\},\qquad t% _{\rm dd}=\frac{25}{32(1+3\rho)}.

Paper II gives Θc≥m⁢(t1)\Theta_{c}\geq m(t_{1}). The branch comparison is the exact identity

1+t12−(5764−3⁢ρ⁢t12)=1+3⁢ρ2⁢(t1−tdd).\frac{1+t_{1}}{2}-\left(\frac{57}{64}-\frac{3\rho t_{1}}{2}\right)=\frac{1+3% \rho}{2}(t_{1}-t_{\rm dd}).

Thus the decreasing branch is active exactly when t1>tddt_{1}>t_{\rm dd}. Equality is assigned to A, where both bounds agree. This active branch test is applied to every B-labelled parent. The branch is never inferred from the largest completed coordinate alone. Paper II keeps the inherited label through clipping. In S4 and S7 the B parents are separate intersections of their respective row domains with t1>tddt_{1}>t_{\rm dd}. No common parent interval is asserted. S5-low has 1/4≤r<t∗=7109/280001/4\leq r<t_{*}=7109/28000 and t1≤r<ρ⁢t1t_{1}\leq r<\rho t_{1}, so t1>1/(4⁢ρ)>tddt_{1}>1/(4\rho)>t_{\rm dd} because ρ<8\rho<8. It is therefore entirely B. Let a parent in S4 or S7 be A-labelled. Then t1≤tddt_{1}\leq t_{\rm dd}, and Paper II’s first branch in (2.17f) [27, (2.17f)] gives Θc≥(1+t1)/2\Theta_{c}\geq(1+t_{1})/2. Take an actual exponent r∈[t1,ρ⁢t1)r\in[t_{1},\rho t_{1}). The S4 and S7 row domains are clipped by r≥μ∗r\geq\mu_{*} [27, §2.1, fixed-cutoff rows], and the retained bin gives r≥t1r\geq t_{1}. The residual is therefore

2⁢(t1−μ∗)+52⁢(r−t1)=2⁢(r−μ∗)+12⁢(r−t1)≥0.2(t_{1}-\mu_{*})+\frac{5}{2}(r-t_{1})=2(r-\mu_{*})+\frac{1}{2}(r-t_{1})\geq 0.
ℓc−(5764−u−5⁢r2)≥u−ηL−2564+2⁢t1+52⁢(r−t1)=1910000+2⁢(t1−μ∗)+52⁢(r−t1)≥1910000.\ell_{c}-\left({57\over 64}-u-{5r\over 2}\right)\geq u-\eta_{L}-{25\over 64}+2% t_{1}+{5\over 2}(r-t_{1})={19\over 10000}+2(t_{1}-\mu_{*})+{5\over 2}(r-t_{1})% \geq{19\over 10000}.

Here μ∗=25/128\mu_{*}=25/128 is the retained cutoff parameter; the symbol μ⁢(n)\mu(n) elsewhere denotes the Möbius function. Thus the A pieces also have the required 19/10000−3⁢τ19/10000-3\tau buffer. This is a row-local calculation. It does not merge the distinct S4 and S7 parent domains. For any B parent, Paper II’s floor gives

(5.37) Θc≥5764−32⁢ρ⁢t1,ℓc−(5764−u−5⁢r2)≥(u−ηL)+52⁢(r−t1)−32⁢τ⁢t1≥1910000−3⁢τ.\Theta_{c}\geq{57\over 64}-{3\over 2}\rho t_{1},\qquad\ell_{c}-\left({57\over 6% 4}-u-{5r\over 2}\right)\geq(u-\eta_{L})+{5\over 2}(r-t_{1})-{3\over 2}\tau t_{% 1}\geq{19\over 10000}-3\tau.

The first bound is Paper II’s linear branch of the full-anatomy floor [27, (2.17d)–(2.17f)]. Using ℓc=Θc−ηL−t1\ell_{c}=\Theta_{c}-\eta_{L}-t_{1}, r≥t1r\geq t_{1}, u−ηL=19/10000u-\eta_{L}=19/10000, and t1<t∗<1t_{1}<t_{*}<1 proves the second line by direct subtraction. The B pieces of S4 and S7 use the same row-local calculation. Their parent intervals stay distinct.

For j=4,5,7j=4,5,7 the row coefficient is negative. At a point xx of an actual cell, the actual sieve argument is ℓc/α\ell_{c}/\alpha and, by (5.23),

ℓcα≥s⁢(x)+hα+10−4−3⁢τα>s⁢(x)+hα.\frac{\ell_{c}}{\alpha}\geq s(x)+\frac{h}{\alpha}+\frac{10^{-4}-3\tau}{\alpha}% >s(x)+\frac{h}{\alpha}.

These are Paper II’s margins 19/10000−3⁢τ19/10000-3\tau for S4S_{4}, S7S_{7} and the BB branch of the lower part of S5S_{5}. Here hh has moved into the profile [27, §2.4, display before “The S4/S7 A/B levels give the same buffer”]. Since FF is decreasing, −F^⁢(ℓc/α)≥−F^⁢(s⁢(x)+h/α)-\widehat{F}(\ell_{c}/\alpha)\geq-\widehat{F}(s(x)+h/\alpha). For j=10j=10 the coefficient is positive, and on the retained cells

ℓcα≥q⁢(x,y)+hα+10−4−(5⁢λ/2+β)⁢τα>q⁢(x,y)+hα,\frac{\ell_{c}}{\alpha}\geq q(x,y)+\frac{h}{\alpha}+\frac{10^{-4}-(5\lambda/2+% \beta)\tau}{\alpha}>q(x,y)+\frac{h}{\alpha},

which is Paper II’s α⁢(slive−ssaved)≥(u−ηL)−τ⁢((5/2)⁢λ+β)\alpha(s_{\mathrm{live}}-s_{\mathrm{saved}})\geq(u-\eta_{L})-\tau((5/2)\lambda% +\beta) with hh moved into the profile [27, §2.5, proof after (2.40)]. Since ff is nondecreasing, f^⁢(ℓc/α)≥f^⁢(q⁢(x,y)+h/α)\widehat{f}(\ell_{c}/\alpha)\geq\widehat{f}(q(x,y)+h/\alpha). Paper II uses the same monotonicity of FF and ff for these comparisons [27, §2.4]. For j=4,5,7j=4,5,7 the cells cover IjI_{j}, and integrating the pointwise inequality against mm gives Qj,8≥∫kjh⁢𝑑m=Pj+ΔjQ_{j,8}\geq\int k_{j}^{h}\,dm=P_{j}+\Delta_{j}.

For j=10j=10 the retained cells need not cover 𝒟10\mathcal{D}_{10}. Let Rτ⊂𝒟10R_{\tau}\subset\mathcal{D}_{10} be their union, put a10=5⁢λ/2+βa_{10}=5\lambda/2+\beta, and write Th⁢(E)=∫Ek10h⁢d⁢(m2)T_{h}(E)=\int_{E}k_{10}^{h}\,d(m^{2}). Then

Q10,8=1α⁢∑c⁢retained∫cf^⁢(ℓc/α)⁢d⁢(m2).Q_{10,8}=\frac{1}{\alpha}\sum_{c\ \mathrm{retained}}\int_{c}\widehat{f}(\ell_{% c}/\alpha)\,d(m^{2}).

Strip. Let (x,y)∈𝒟10∖Rτ(x,y)\in\mathcal{D}_{10}\setminus R_{\tau} lie in a cell with labels t1≤xt_{1}\leq x, t2≤yt_{2}\leq y. The cell is dropped, so y≥t2>sel⁡(t1)≥B0⁢(t1)−a10⁢τ≥B0⁢(x)−a10⁢τy\geq t_{2}>\operatorname{sel}(t_{1})\geq B_{0}(t_{1})-a_{10}\tau\geq B_{0}(x)% -a_{10}\tau. This uses the two deficit bounds of Paper II, §2.5, and the fact that B0B_{0} is nonincreasing [27, §2.5, proof of (2.40)]. Also y<B0⁢(x)y<B_{0}(x). On 𝒟10\mathcal{D}_{10} one has 11/5≤q11/5\leq q and q+h/α<4q+h/\alpha<4, so f^⁢(q+h/α)≤f^⁢(4)=log⁡3/4\widehat{f}(q+h/\alpha)\leq\widehat{f}(4)=\log 3/4. With y≥αy\geq\alpha and ∫μ∗λ𝑑x/x≤(λ−μ∗)/μ∗\int_{\mu_{*}}^{\lambda}dx/x\leq(\lambda-\mu_{*})/\mu_{*}, this gives Th⁢(𝒟10∖Rτ)≤D∗⁢τT_{h}(\mathcal{D}_{10}\setminus R_{\tau})\leq D_{*}\tau, where D∗D_{*} is the constant in (5.26).

Reserve. On a retained cell the margin in (5.23) satisfies 10−4−a10⁢τ>1/2000010^{-4}-a_{10}\tau>1/20000, so ℓc/α≥q+h/α+δ10\ell_{c}/\alpha\geq q+h/\alpha+\delta_{10}. Here 2<q+h/α<q+h/α+δ10<42<q+h/\alpha<q+h/\alpha+\delta_{10}<4. For 2<s<42<s<4, f^⁢(s)=log⁡(s−1)/s\widehat{f}(s)=\log(s-1)/s and

f^′⁢(s)=s/(s−1)−log⁡(s−1)s2>4/3−11/1016=7480,\widehat{f}^{\prime}(s)=\frac{s/(s-1)-\log(s-1)}{s^{2}}>\frac{4/3-11/10}{16}=% \frac{7}{480},

since log⁡3<11/10\log 3<11/10. As ff is nondecreasing, f^⁢(ℓc/α)−f^⁢(q+h/α)≥7⁢δ10/480\widehat{f}(\ell_{c}/\alpha)-\widehat{f}(q+h/\alpha)\geq 7\delta_{10}/480 at every point of RτR_{\tau}.

A fixed retained rectangle. Let (x,y)∈R10(x,y)\in R_{10}, in a cell with labels t1∈(x/ρ,x]t_{1}\in(x/\rho,x], t2∈(y/ρ,y]t_{2}\in(y/\rho,y]. Then μ∗<t1<λ\mu_{*}<t_{1}<\lambda and α<t2<β\alpha<t_{2}<\beta. On [μ∗,21/100][\mu_{*},21/100] we have B0=βB_{0}=\beta, because 57/64−u−11⁢α/5−(5/2)⁢(21/100)>β57/64-u-11\alpha/5-(5/2)(21/100)>\beta. Hence sel⁡(t1)≥β−a10⁢τ>1/10≥t2\operatorname{sel}(t_{1})\geq\beta-a_{10}\tau>1/10\geq t_{2}, and the cell is retained: R10⊂RτR_{10}\subset R_{\tau}. Also m2⁢(R10)=log⁡2120⁢log⁡109≥121⋅110=1210m^{2}(R_{10})=\log\frac{21}{20}\log\frac{10}{9}\geq\frac{1}{21}\cdot\frac{1}{1% 0}=\frac{1}{210}.

Combining the three steps with the pointwise inequality above,

Q10,8≥Th⁢(Rτ)+c10≥Th⁢(𝒟10)−D∗⁢τ+c10>Th⁢(𝒟10)=P10+Δ10,Q_{10,8}\geq T_{h}(R_{\tau})+c_{10}\geq T_{h}(\mathcal{D}_{10})-D_{*}\tau+c_{1% 0}>T_{h}(\mathcal{D}_{10})=P_{10}+\Delta_{10},

by (5.27). No deduction is made. The reserve is the part of Paper II’s level margin left after the lift hh. It exists on cells of S10S_{10} only and is used only here. ∎

The finite arrays Sj,N0,Sj,NhS^{0}_{j,N},S^{h}_{j,N} are not used in this inequality. The errors |Λj,N0||\Lambda^{0}_{j,N}| and |Λj,N||\Lambda_{j,N}| are nonnegative and are kept in E′E^{\prime} so that E′E^{\prime} agrees with (1.12). They tend to zero by Lemma 5.8.

5.4. The internal joint shift

The joint occurrence is 2⁢S11+S12+S132S_{11}+S_{12}+S_{13}. Its six-branch function is Paper II, (4.70) [27, (4.70)–(4.72)]:

(5.38) v1⁢(t)\displaystyle v_{1}(t) =min⁡{1+t2,32−34⁢t39,5764−3⁢t2},\displaystyle=\min\left\{\frac{1+t}{2},\frac{32-34t}{39},\frac{57}{64}-\frac{3% t}{2}\right\},
v⁢(t)\displaystyle v(t) =v1⁢(t)−u,ψ⁢(x,y)=x⁢𝟏x≥y,\displaystyle=v_{1}(t)-u,\qquad\psi(x,y)=x\mathbf{1}_{x\geq y},
Θ∗⁢(a,b,c)\displaystyle\Theta_{*}(a,b,c) =max{v(a),v(b),v(a+b),v(a+b+c),\displaystyle=\max\{v(a),v(b),v(a+b),v(a+b+c),
ψ(v(a+c),a+2b+c),ψ(v(b+c),2a+b+c)}.\displaystyle\hskip 96.73936pt\psi(v(a+c),a+2b+c),\psi(v(b+c),2a+b+c)\}.

Subtract uu before testing each guard. Set

(5.39) 𝒞={(t1,t2,t3):u≤t3<t2<t1<μ∗},a3⁢(𝐭)=Θ∗⁢(𝐭)−t1−t2−t3t3.\mathcal{C}=\{(t_{1},t_{2},t_{3}):u\leq t_{3}<t_{2}<t_{1}<\mu_{*}\},\qquad a_{% 3}(\mathbf{t})=\frac{\Theta_{*}(\mathbf{t})-t_{1}-t_{2}-t_{3}}{t_{3}}.

Shift the output of Θ∗\Theta_{*} by hh. Keep its guards and actual source unchanged:

(5.40) a3s⁢(𝐭)\displaystyle a_{3}^{s}(\mathbf{t}) =a3⁢(𝐭)+ht3,\displaystyle=a_{3}(\mathbf{t})+\frac{h}{t_{3}},
J\displaystyle J =∭𝒞1−f⁢(a3⁢(𝐭))t1⁢t2⁢t32⁢𝑑𝐭,\displaystyle=\iiint_{\mathcal{C}}\frac{1-f(a_{3}(\mathbf{t}))}{t_{1}t_{2}t_{3% }^{2}}\,d\mathbf{t},
Js\displaystyle J_{s} =∭𝒞1−f⁢(a3s⁢(𝐭))t1⁢t2⁢t32⁢𝑑𝐭.\displaystyle=\iiint_{\mathcal{C}}\frac{1-f(a_{3}^{s}(\mathbf{t}))}{t_{1}t_{2}% t_{3}^{2}}\,d\mathbf{t}.

Use f⁢(s)=0f(s)=0 for s<2s<2. Keep its true values at every larger argument. The new margins are

(5.41) gs=110000−225256⁢τ>2⁢μ∗⁢τ,gs,μ∗=110000−75256⁢τ>0.g_{s}=\frac{1}{10000}-\frac{225}{256}\tau>2\mu_{*}\tau,\qquad g_{s,\mu_{*}}=% \frac{1}{10000}-\frac{75}{256}\tau>0.

The second margin concerns a parent interval crossing μ∗\mu_{*}. Both follow by subtracting hh in Paper II, (4.72); see Lemma 5.6. They hold throughout 0<τ≤10−900<\tau\leq 10^{-90}. If f⁢(a3s)>0f(a_{3}^{s})>0, the retained-cell condition follows:

(5.42) ℓc≥Θ∗+h−t1−t2−t3+gs>2⁢t3+2⁢μ∗⁢τ≥2⁢ρ⁢t3.\ell_{c}\geq\Theta_{*}+h-t_{1}-t_{2}-t_{3}+g_{s}>2t_{3}+2\mu_{*}\tau\geq 2\rho t% _{3}.

Thus the canonical restriction still loses zero. At fixed numerator, use the increase of s⁢f⁢(s)sf(s). This is the same comparison as Paper II, (4.72).

Lemma 5.6 (Shifted retention).

The margins (5.41) hold for 0<τ≤10−900<\tau\leq 10^{-90}. On the original joint source, every positive shifted lower contribution lies in an original retained whole cell of Paper II, (4.19). On such a cell the actual lower main term dominates the shifted canonical one.

Proof.

Use an original G1-3 cell with inherited labels t1≥t2≥t3>0t_{1}\geq t_{2}\geq t_{3}>0, and order its distinct actual prefix primes as a1>a2>a3a_{1}>a_{2}>a_{3}. Put xi=logN⁡aix_{i}=\log_{N}a_{i}. Unequal parent bins enforce the actual order, while within an equal-label group we order the primes. Hence ti≤xi<ρ⁢tit_{i}\leq x_{i}<\rho t_{i}, including clipped bins. No strict inequality between the labels is required.

Let Θc\Theta_{c} be the original full-anatomy infimum and ℓc=Θc−ηL−∑iti\ell_{c}=\Theta_{c}-\eta_{L}-\sum_{i}t_{i}. Put Bs⁢(x)=Θ∗⁢(x)+h−∑ixiB_{s}(x)=\Theta_{*}(x)+h-\sum_{i}x_{i}. The function v1v_{1} is 3/23/2-Lipschitz. On the closed ordered parent a coordinate changes by at most μ∗⁢τ\mu_{*}\tau. A sum of at most three coordinates changes by at most 3⁢μ∗⁢τ3\mu_{*}\tau. If a saved guarded branch is active at xx, its buffered guard has nonnegative gap, including equality. Removing its buffer adds uu. Throughout the parent its unbuffered gap is therefore at least u−(9/2)⁢μ∗⁢τ−4⁢μ∗⁢τ>0u-(9/2)\mu_{*}\tau-4\mu_{*}\tau>0. Thus it stays available in the full anatomy. Take an unguarded or active guarded saved branch. The corresponding full branch is at least its value at xx plus u−(9/2)⁢μ∗⁢τu-(9/2)\mu_{*}\tau. Taking their maximum and then the parent infimum preserves this lower bound. Ties between maximizing branches cause no loss. Therefore

ℓc≥Bs⁢(x)+gs+∑i(xi−ti),gs=u−ηL−h−(9/2)⁢μ∗⁢τ=10−4−(225/256)⁢τ.\ell_{c}\geq B_{s}(x)+g_{s}+\sum_{i}(x_{i}-t_{i}),\qquad g_{s}=u-\eta_{L}-h-(9% /2)\mu_{*}\tau=10^{-4}-(225/256)\tau.

For a parent crossing μ∗\mu_{*}, the largest exponent is within μ∗⁢τ\mu_{*}\tau of μ∗\mu_{*}, and v1⁢(μ∗)=153/256v_{1}(\mu_{*})=153/256. Every saved branch is at most 153/256−u153/256-u, so the crossing comparison gives instead 10−4−(75/256)⁢τ≥gs10^{-4}-(75/256)\tau\geq g_{s}. Clipping only shrinks the infimum domain. These arguments also apply when two or all three labels coincide. For 0<τ≤10−900<\tau\leq 10^{-90} we have gs>2⁢μ∗⁢τ>0g_{s}>2\mu_{*}\tau>0.

If f⁢(Bs⁢(x)/x3)>0f(B_{s}(x)/x_{3})>0, then Bs⁢(x)>2⁢x3B_{s}(x)>2x_{3} and hence

ℓc>2⁢x3+2⁢μ∗⁢τ≥2⁢t3+2⁢τ⁢t3=2⁢ρ⁢t3.\ell_{c}>2x_{3}+2\mu_{*}\tau\geq 2t_{3}+2\tau t_{3}=2\rho t_{3}.

Thus the whole original cell is retained by Paper II, (4.19). On positive support ℓc>Bs⁢(x)>0\ell_{c}>B_{s}(x)>0 and 0<t3≤x30<t_{3}\leq x_{3} imply

ℓct3≥Bs⁢(x)x3,f⁢(ℓc/t3)≥f⁢(Bs⁢(x)/x3),f⁢(ℓc/t3)t3≥f⁢(Bs⁢(x)/x3)x3.\frac{\ell_{c}}{t_{3}}\geq\frac{B_{s}(x)}{x_{3}},\qquad f(\ell_{c}/t_{3})\geq f% (B_{s}(x)/x_{3}),\qquad\frac{f(\ell_{c}/t_{3})}{t_{3}}\geq\frac{f(B_{s}(x)/x_{% 3})}{x_{3}}.

These use only nonnegativity and monotonicity of ff. Equal labels invalidate none of the weak inequalities. Also E=Nt3≤a3E=N^{t_{3}}\leq a_{3}, so VN⁢(E)≥VN⁢(a3)V_{N}(E)\geq V_{N}(a_{3}). At zero shifted contribution the required comparison follows from nonnegativity without any assertion that Bs⁢(x)>0B_{s}(x)>0.

Keep the original orbit normalization. If the equal-label groups are GhG_{h}, put Mc=∏h|Gh|!∈{1,2,6}M_{c}=\prod_{h}|G_{h}|!\in\{1,2,6\}. For a full labelled realization 𝐚\mathbf{a}, write 𝐚↓\mathbf{a}^{\downarrow} for its decreasing rearrangement within the equal-label groups. The shifted comparison above is evaluated at 𝐱↓\mathbf{x}^{\downarrow} and is invariant under these group permutations. For every nonnegative, invariant main-mass weight wcw_{c}, therefore,

1Mc⁢∑fullKP⁢(𝐚)⁢wc⁢(𝐚)⁢VN⁢(E)⁢f⁢(ℓc/t3)≥1Mc⁢∑fullKP⁢(𝐚)⁢wc⁢(𝐚)⁢VN⁢(a3↓)⁢f⁢(Bs⁢(𝐱↓)/x3↓).\frac{1}{M_{c}}\sum_{\rm full}K_{P}(\mathbf{a})w_{c}(\mathbf{a})V_{N}(E)f(\ell% _{c}/t_{3})\geq\frac{1}{M_{c}}\sum_{\rm full}K_{P}(\mathbf{a})w_{c}(\mathbf{a}% )V_{N}(a_{3}^{\downarrow})f(B_{s}(\mathbf{x}^{\downarrow})/x_{3}^{\downarrow}).

Each distinct ordered triple has exactly McM_{c} labelled realizations. The prefix mask KPK_{P} and its correction are kept exactly as in Paper II, (4.22)–(4.23). No repeated-prefix realization is reclassified. The tail mask and all remainder coefficients are likewise unchanged. This proves the finite lower-main-term comparison with the cell mass divided by McM_{c}. The corresponding continuum comparison uses the preceding inequality with the 1/t31/t_{3} and 1/x31/x_{3} factors. Equal-label bins are kept. Their strictly ordered actual triples lie in the original cone. The orbit identity converts the full-block sum to that ordered sum exactly. Only actual coordinate diagonals have zero continuum measure. The proof imposes no N→∞N\to\infty disappearance of equal-bin regions. ∎

Put Hlog=log⁡(μ∗/u)H_{\log}=\log(\mu_{*}/u). Paper II’s remaining terms satisfy

(5.43) 0≤RG≤Rup=\displaystyle 0\leq R_{G}\leq R_{\mathrm{up}}={} 500⁢(F⁢(30)−1)+500⁢Hlog⁢(1−f⁢(30))\displaystyle 500(F(30)-1)+500H_{\log}(1-f(30))
+250⁢Hlog2⁢(F⁢(30)−1).\displaystyle+250H_{\log}^{2}(F(30)-1).

Its constant terms cancel exactly [27, (4.73)–(4.75)]:

(5.44) 500⁢(1−Hlog+Hlog22)−∭𝒞d⁢𝐭t1⁢t2⁢t32=1μ∗.500\left(1-H_{\log}+\frac{H_{\log}^{2}}{2}\right)-\iiint_{\mathcal{C}}\frac{d% \mathbf{t}}{t_{1}t_{2}t_{3}^{2}}=\frac{1}{\mu}_{*}.

The shifted upper comparison is therefore

(5.45) G1s=1μ∗+RG+Js,ΦG1s=−KG⁢G1s,KG=2⁢I11+I12+I132⁢eγ.G_{1}^{s}=\frac{1}{\mu}_{*}+R_{G}+J_{s},\qquad\Phi_{G_{1}}^{s}=-K_{G}G_{1}^{s}% ,\qquad K_{G}=\frac{2I_{11}+I_{12}+I_{13}}{2e^{\gamma}}.

The source-mass integrals are [27, (4.77)]

(5.46) I11=\displaystyle I_{11}={} ∫λ1/3log⁡((1−2⁢t)/t)t⁢(1−t)⁢𝑑t\displaystyle\int_{\lambda}^{1/3}\frac{\log((1-2t)/t)}{t(1-t)}\,dt
+∫λ1/4d⁢tt⁢∫t(1−t)/3log⁡((1−t−2⁢v)/v)v⁢(1−t−v)⁢𝑑v,\displaystyle+\int_{\lambda}^{1/4}\frac{dt}{t}\int_{t}^{(1-t)/3}\frac{\log((1-% t-2v)/v)}{v(1-t-v)}\,dv,
I12=\displaystyle I_{12}={} ∫α1/3log⁡(2−3⁢t)t⁢(1−t)⁢𝑑t,\displaystyle\int_{\alpha}^{1/3}\frac{\log(2-3t)}{t(1-t)}\,dt,
I13=\displaystyle I_{13}={} ∫βλlog⁡((1−t−λ)/λ)t⁢(1−t)⁢𝑑t.\displaystyle\int_{\beta}^{\lambda}\frac{\log((1-t-\lambda)/\lambda)}{t(1-t)}% \,dt.

We have I11,I12,I13≥0I_{11},I_{12},I_{13}\geq 0 and I12>0I_{12}>0. Thus KG>0K_{G}>0. The finite shifted enclosure gives

(5.47) 0≤G1s≤6073714261109(shifted mesh nmesh=512).0\leq G_{1}^{s}\leq\frac{6073714261}{10^{9}}\quad\text{(shifted mesh $n_{% \mathrm{mesh}}=512$)}.

Paper II’s mass enclosure gives 0≤KG≤Khi0\leq K_{G}\leq K_{\mathrm{hi}} [27, (A.10d)]. The exact constants are

(5.48) Khi=39894807910705784663904430098309337537484429474781101122231058.K_{\mathrm{hi}}=\frac{39894807910705784663904430098309337537484429474781101122% 23}{10^{58}}.

Paper II, (4.84), gives

(5.49) LG⁢1=−243950428265194656254206921939947762868871361874409552095097100433627766186892221372630771322662657637687111424552206336.L_{G1}=-\frac{243950428265194656254206921939947762868871361874409552095097}{10% 0433627766186892221372630771322662657637687111424552206336}.

Define

(5.50) M5,internal=−Khi⁢6073714261109−LG⁢1.M_{5,\mathrm{internal}}=-K_{\mathrm{hi}}\frac{6073714261}{10^{9}}-L_{G1}.

Their exact substitution gives

(5.51) 0.0058749499450263575220<M5,internal,M5,internal<0.0058749499450263575221.\begin{gathered}0.0058749499450263575220<M_{5,\mathrm{internal}},\\ M_{5,\mathrm{internal}}<0.0058749499450263575221.\end{gathered}

The finite enclosure and identity are proved. They concern the shifted profile integral. The required actual-source inequality is

(5.52) −2⁢S11+S12+S13W≥LG⁢1+M5,internal−EG⁢1D−|ΛG,N|.-\frac{2S_{11}+S_{12}+S_{13}}{W}\geq L_{G1}+M_{5,\mathrm{internal}}-E^{D}_{G1}% -|\Lambda_{G,N}|.
Proof of (5.52).

Paper II proves

2⁢S11+S12+S13W≤KG⁢G1+EG⁢1D,G1=1μ∗+RG+J,\frac{2S_{11}+S_{12}+S_{13}}{W}\leq K_{G}G_{1}+E^{D}_{G1},\qquad G_{1}=\frac{1% }{\mu_{*}}+R_{G}+J,

from (4.73)–(4.77) [27, (4.75), (4.78)]. Run the same argument with JJ replaced by JsJ_{s}. The first three residual rows and the bound RG≤RupR_{G}\leq R_{\mathrm{up}} do not change, and neither does the cancellation (5.44). In the fourth row, Lemma 5.6 replaces Paper II’s comparison after (4.72). The canonical restriction loses zero, and the actual lower main term dominates the shifted one. The source and its weights (2,1,1)(2,1,1) do not change, and neither do the peel (4.45)–(4.57) and the mass conversion (4.76)–(4.78). Hence

2⁢S11+S12+S13W≤KG⁢G1s+EG⁢1D\frac{2S_{11}+S_{12}+S_{13}}{W}\leq K_{G}G_{1}^{s}+E^{D}_{G1}

with the same EG⁢1DE^{D}_{G1}. By Proposition B.2, 0≤G1s≤6073714261/1090\leq G_{1}^{s}\leq 6073714261/10^{9}, which is (5.47), with the residual bound supplied by (5.43). By Paper II, (A.10d), 0≤KG≤Khi0\leq K_{G}\leq K_{\mathrm{hi}}. Both factors are nonnegative, so by (5.50)

−KG⁢G1s≥−Khi⁢6073714261109=LG⁢1+M5,internal.-K_{G}G_{1}^{s}\geq-K_{\mathrm{hi}}\frac{6073714261}{10^{9}}=L_{G1}+M_{5,% \mathrm{internal}}.

This gives (5.52) even without |ΛG,N||\Lambda_{G,N}|. That term is nonnegative and is kept so that the error agrees with (1.12). ∎

The existing EG⁢1DE^{D}_{G1} is a disjoint component of the original Fnet+EvanF_{\mathrm{net}}+E_{\mathrm{van}} allowance. Its fixed peel 145664566.4567⁢τ145664566.4567\tau is covered by gτg_{\tau}, and its fixed CE⁢σC_{E}\sigma share by gAAg_{\mathrm{AA}}. Its vanishing part belongs to EvanE_{\mathrm{van}}. When replacing the joint chain, carry these same components once. The reconciliation in (5.10) remains paid. These components are the G1G_{1} comparator term N⁢CsfNC_{\mathrm{sf}} of Paper II, (4.64)–(4.65), and the G1G_{1} share of the joint bound. That bound treats ΞU\Xi_{U} and ΞA\Xi_{A} in Paper II, (B.1)–(B.7). Both are attached to the original source measure and not to the profile. Hence the shift neither creates nor removes them.

5.5. Conversion of the finite arrays

We give the remaining definitions before stating the lemma. All representation variables in the following table are prime. Their product is ee, with ε⁢N<e<N\varepsilon N<e<N. Let R11,3⁢(e)R_{11,3}(e) and R11,4⁢(e)R_{11,4}(e) count the first two forms. Let R12⁢(e)R_{12}(e) and R13⁢(e)R_{13}(e) count the last two forms. Put R11=R11,3+R11,4R_{11}=R_{11,3}+R_{11,4}. These are Paper II’s representation weights [27, (4.4), source table preceding (4.4)].

Table 5.1. The internal representation counts
Count Product Restrictions
R11,3R_{11,3} p1⁢p2⁢p3p_{1}p_{2}p_{3} Nλ≤p1<N1/3N^{\lambda}\leq p_{1}<N^{1/3}, p1<p2p_{1}<p_{2}, p1⁢p22<Np_{1}p_{2}^{2}<N, p3≥p2p_{3}\geq p_{2}.
R11,4R_{11,4} p1⁢p2⁢p3⁢p4p_{1}p_{2}p_{3}p_{4} The same conditions on p1,p2p_{1},p_{2}; p2≤p3≤p4p_{2}\leq p_{3}\leq p_{4}.
R12R_{12} p1⁢p2⁢p3p_{1}p_{2}p_{3} Nα≤p1<N1/3≤p2N^{\alpha}\leq p_{1}<N^{1/3}\leq p_{2}, p1⁢p22<Np_{1}p_{2}^{2}<N, p3≥p2p_{3}\geq p_{2}.
R13R_{13} p1⁢p2⁢p3p_{1}p_{2}p_{3} Nβ≤p1<Nλ≤p2N^{\beta}\leq p_{1}<N^{\lambda}\leq p_{2}, p1⁢p22<Np_{1}p_{2}^{2}<N, p1⁢p2⁢p32≥Np_{1}p_{2}p_{3}^{2}\geq N.

For the last form the endpoint orders are distinct. Every permitted representation keeps its multiplicity. Define the upper cut and masses by

(5.53) Ncut\displaystyle N_{\mathrm{cut}} =N⁢(1−L−333),\displaystyle=N(1-L^{-333}),
Xjcut\displaystyle X_{j}^{\mathrm{cut}} =∑eRj⁢(e)⁢𝟏ε⁢N<e≤Ncut\displaystyle=\sum_{e}R_{j}(e)\mathbf{1}_{\varepsilon N<e\leq N_{\mathrm{cut}}} (j=11,12,13),\displaystyle(j=11,12,13),
XG\displaystyle X_{G} =2⁢X11cut+X12cut+X13cut,\displaystyle=2X_{11}^{\mathrm{cut}}+X_{12}^{\mathrm{cut}}+X_{13}^{\mathrm{cut% }},
rG,N⁢(t)\displaystyle r_{G,N}(t) =t⁢XG⁢VN⁢(Nt)W⁢KG.\displaystyle=\frac{tX_{G}V_{N}(N^{t})}{WK_{G}}.

The cut precedes the sieve decomposition [27, (4.16)–(4.17)]. The source-mass input used below is

(5.54) XD\displaystyle X_{D} =(1−ε+o⁢(1))⁢NL,\displaystyle=\left(1-\varepsilon+o(1)\right)\frac{N}{L},
XG\displaystyle X_{G} =((1−ε)⁢(2⁢I11+I12+I13)+o⁢(1))⁢NL.\displaystyle=\left((1-\varepsilon)(2I_{11}+I_{12}+I_{13})+o(1)\right)\frac{N}% {L}.
Lemma 5.7 (Source masses).

The formulas (5.54) hold.

Proof.

The sum XDX_{D} counts the primes in (N/L30,(1−ε)⁢N)(N/L^{30},(1-\varepsilon)N), so the prime number theorem gives XD=(1−ε+o⁢(1))⁢N/LX_{D}=(1-\varepsilon+o(1))N/L. For the representation weights of Table 5.1, Paper II proves Xj=((1−ε)⁢Ij+o⁢(1))⁢N/LX_{j}=((1-\varepsilon)I_{j}+o(1))N/L for the uncut masses, j=11,12,13j=11,12,13 [27, (4.76)–(4.77)]. The cut strip Ncut<e<NN_{\mathrm{cut}}<e<N carries joint mass at most 100⁢(N⁢L−333+1)100(NL^{-333}+1) [27, (4.16)–(4.17)], which is o⁢(N/L)o(N/L). Summing with the weights (2,1,1)(2,1,1) gives the formula for XGX_{G}. ∎

On X03X_{0}^{3}, define the zero-extended kernel

(5.55) dG⁢(𝐭)=𝟏𝒞⁢(𝐭)⁢KG⁢f⁢(a3s⁢(𝐭))−f⁢(a3⁢(𝐭))t3.d_{G}(\mathbf{t})=\mathbf{1}_{\mathcal{C}}(\mathbf{t})K_{G}\frac{f(a_{3}^{s}(% \mathbf{t}))-f(a_{3}(\mathbf{t}))}{t_{3}}.

Its arrays and integral are

(5.56) BG,N\displaystyle B_{G,N} =∭rG,N⁢(t3)⁢dG⁢(𝐭)⁢d⁢(mN3)⁢(𝐭),\displaystyle=\iiint r_{G,N}(t_{3})d_{G}(\mathbf{t})\,d(m_{N}^{3})(\mathbf{t}),
ΔG\displaystyle\Delta_{G} =∭dG⁢d⁢(m3)=KG⁢(J−Js),\displaystyle=\iiint d_{G}\,d(m^{3})=K_{G}(J-J_{s}),
ΛG,N\displaystyle\Lambda_{G,N} =BG,N−ΔG.\displaystyle=B_{G,N}-\Delta_{G}.

Equivalently,

(5.57) BG,N\displaystyle B_{G,N} =XGW⁢∑p3<p2<p1,pi∈ℙ,pi∤Nu≤logN⁡p3<logN⁡p2<logN⁡p1<μ∗VN⁢(p3)⁢[f⁢(a3s⁢(𝐭))−f⁢(a3⁢(𝐭))](p1−1)⁢(p2−1)⁢(p3−1),\displaystyle=\frac{X_{G}}{W}\sum_{\begin{subarray}{c}p_{3}<p_{2}<p_{1},\ p_{i% }\in\mathbb{P},\ p_{i}\nmid N\\ u\leq\log_{N}p_{3}<\log_{N}p_{2}<\log_{N}p_{1}<\mu_{*}\end{subarray}}\frac{V_{% N}(p_{3})[f(a_{3}^{s}(\mathbf{t}))-f(a_{3}(\mathbf{t}))]}{(p_{1}-1)(p_{2}-1)(p% _{3}-1)},
ti=logN⁡pi.\displaystyle\hskip 108.12047ptt_{i}=\log_{N}p_{i}.

These definitions specify all five additional conversion errors.

Lemma 5.8 (Conversion of the five profile differences).

Fix 0<σ≤10−100<\sigma\leq 10^{-10}. For mN,mm_{N},m in (5.28), the finite arrays (5.33) and (5.56) satisfy

(5.58) Λj,N⟶0(j∈ℋ),ΛG,N⟶0,\Lambda_{j,N}\longrightarrow 0\quad(j\in\mathcal{H}),\qquad\Lambda_{G,N}% \longrightarrow 0,

and Λj,N0→0\Lambda^{0}_{j,N}\to 0 for j∈ℋj\in\mathcal{H}. Every limit ranges over even NN tending to infinity; the thresholds depend on σ\sigma.

Proof.

Step 1: convergence of the harmonic measures. Let u≤a<b≤1u\leq a<b\leq 1. Mertens’ theorem and partial summation give

(5.59) mN⁢([a,b))=log⁡ba+o⁢(1).m_{N}([a,b))=\log\frac{b}{a}+o(1).

Replacing 1/(p−1)1/(p-1) by 1/p1/p costs O⁢(N−u)O(N^{-u}). There are at most L/log⁡2L/\log 2 prime divisors of NN. Each omitted divisor above NuN^{u} has mass O⁢(N−u)O(N^{-u}). Their total cost is O⁢(N−u⁢L)O(N^{-u}L). The largest endpoint atom is O⁢(N−u)O(N^{-u}). The total masses therefore satisfy

(5.60) cN:=mN⁢(X0)⟶c0:=m⁢(X0)=log⁡(1/u)>0.c_{N}:=m_{N}(X_{0})\longrightarrow c_{0}:=m(X_{0})=\log(1/u)>0.

Let gg be continuous on X0X_{0}. Choose a finite interval partition and a step function on it, uniformly within a prescribed error of gg. The integrals of the step function converge by (5.59). The integral errors are at most the uniform error times cN+c0c_{N}+c_{0}, which is bounded by (5.60). Hence mN⇒mm_{N}\Rightarrow m [2, Theorem 2.2 and Example 2.3]. For k=2,3k=2,3, rectangle masses are products of interval masses. The same argument with rectangular step functions gives

(5.61) mNk⇒mk(k=1,2,3).m_{N}^{k}\Rightarrow m^{k}\qquad(k=1,2,3).

For a coordinate diagonal Di⁢j={ti=tj}D_{ij}=\{t_{i}=t_{j}\},

(5.62) mNk⁢(Di⁢j)≤(maxp≥Nu⁡1p−1)⁢cNk−1=O⁢(N−u)(k≥2).m_{N}^{k}(D_{ij})\leq\left(\max_{p\geq N^{u}}\frac{1}{p-1}\right)c_{N}^{k-1}=O% (N^{-u})\qquad(k\geq 2).

Thus strict prime order costs nothing in the limit, and no orbit factor enters.

Step 2: the source and Euler normalizations. For p>2p>2,

(5.63) 1−1p−1=(1−1p)⁢(1−1(p−1)2).1-\frac{1}{p-1}=\left(1-\frac{1}{p}\right)\left(1-\frac{1}{(p-1)^{2}}\right).

Mertens’ product formula and the convergent second product yield

(5.64) VN⁢(Nt)=2⁢e−γ⁢C⁢(N)t⁢L⁢(1+o⁢(1)),u/ρ≤t≤1,V_{N}(N^{t})=\frac{2e^{-\gamma}C(N)}{tL}(1+o(1)),\qquad u/\rho\leq t\leq 1,

uniformly in tt. The prime 22 is omitted because NN is even. The missing divisors p∣Np\mid N above NtN^{t} contribute ∏(1+1/(p−2))=1+O⁢(N−u/ρ⁢L)\prod(1+1/(p-2))=1+O(N^{-u/\rho}L). The ordinary product error is uniform for Nt≥Nu/ρN^{t}\geq N^{u/\rho}. By Lemma 5.7 and (2.2),

(5.65) rD,N⟶1,supu≤t≤μ∗|rG,N⁢(t)−1|⟶0.r_{D,N}\longrightarrow 1,\qquad\sup_{u\leq t\leq\mu_{*}}|r_{G,N}(t)-1|% \longrightarrow 0.

For example, W⁢KG=2⁢e−γ⁢(1−ε)⁢(2⁢I11+I12+I13)⁢C⁢(N)⁢N/L2WK_{G}=2e^{-\gamma}(1-\varepsilon)(2I_{11}+I_{12}+I_{13})C(N)N/L^{2}. This is exactly the main factor in t⁢XG⁢VN⁢(Nt)tX_{G}V_{N}(N^{t}). Thus both the truncation factor and the representation multiplicities cancel once.

Step 3: restriction and bounded kernels. Write m^N=mN/cN\widehat{m}_{N}=m_{N}/c_{N} and m^=m/c0\widehat{m}=m/c_{0}. These are probability measures, and their products converge weakly. Let DD have mk⁢(∂D)=0m^{k}(\partial D)=0, and let g⁢𝟏Dg\mathbf{1}_{D} be bounded and mkm^{k}-almost everywhere continuous. Apply the mapping form of the portmanteau theorem [2, Theorems 2.1 and 2.7] to g⁢𝟏Dg\mathbf{1}_{D} and the probability measures. Then multiply by cNk→c0kc_{N}^{k}\to c_{0}^{k}. This gives

(5.66) ∫Dg⁢d⁢(mNk)⟶∫Dg⁢d⁢(mk).\int_{D}g\,d(m_{N}^{k})\longrightarrow\int_{D}g\,d(m^{k}).

The intervals IjI_{j} have finitely many boundary points. The boundary of 𝒟10\mathcal{D}_{10} is piecewise affine, since B0B_{0} is continuous and piecewise affine. Both have zero mejm^{e_{j}}-measure. On IjI_{j} (j=4,5,7)(j=4,5,7) the argument s⁢(x)s(x) lies in a compact subinterval of (1,∞)(1,\infty), where FF is continuous. On 𝒟10\mathcal{D}_{10}, y<K−11⁢α/5−5⁢x/2y<K-11\alpha/5-5x/2 gives q⁢(x,y)>11/5q(x,y)>11/5, and q+h/α<4q+h/\alpha<4; there ff is continuous. Hence kj0,kjhk_{j}^{0},k_{j}^{h} and djd_{j} are bounded and continuous off a null set, so (5.66) applies to them. With (5.65), it gives

(5.67) Sj,N0⟶Pj,Bj,N⟶Δj(j∈ℋ).S_{j,N}^{0}\longrightarrow P_{j},\qquad B_{j,N}\longrightarrow\Delta_{j}\qquad% (j\in\mathcal{H}).

Step 4: the ordered three-dimensional kernel. The cone 𝒞\mathcal{C} has affine boundary faces, so its boundary is m3m^{3}-null. The function Θ∗\Theta_{*} is piecewise affine. Its possible jumps lie on finitely many guard hyperplanes, and its branch switches add finitely many affine faces. On every remaining open piece, a3a_{3} and a3sa_{3}^{s} are continuous. The denominator satisfies t3≥u>0t_{3}\geq u>0, so the arguments of ff remain in a fixed compact interval. On it ff, extended by zero below 22, is continuous. Since 0≤f≤10\leq f\leq 1, |dG|≤KG/u|d_{G}|\leq K_{G}/u. Thus dGd_{G} is bounded and m3m^{3}-almost everywhere continuous. Apply (5.66) to the zero extension on X03X_{0}^{3}:

(5.68) ∭dG⁢d⁢(mN3)⟶∭dG⁢d⁢(m3)=ΔG.\iiint d_{G}\,d(m_{N}^{3})\longrightarrow\iiint d_{G}\,d(m^{3})=\Delta_{G}.

The normalization costs at most

(5.69) |BG,N−∭dG⁢d⁢(mN3)|≤sup[u,μ∗]|rG,N−1|⁢‖dG‖∞⁢cN3⟶0.\left|B_{G,N}-\iiint d_{G}\,d(m_{N}^{3})\right|\leq\sup_{[u,\mu_{*}]}|r_{G,N}-% 1|\,\|d_{G}\|_{\infty}c_{N}^{3}\longrightarrow 0.

The cone’s coordinate-order inequalities are strict, so BG,NB_{G,N} counts strictly ordered triples, as in (5.57). Hence BG,N→ΔGB_{G,N}\to\Delta_{G}, and with Step 3 all limits in (5.58) and Λj,N0→0\Lambda^{0}_{j,N}\to 0 follow. ∎

Whole cells, retained cells and the label cutoff.

For the four direct rows, the arithmetic identification is Lemma 5.5. For the joint row it is the proof of (5.52). Both are made at stage eight on Paper II’s actual cells, with their inherited signed coefficients. Hence no further whole-cell kernel is needed. For the retained part of S10S_{10}, the actual whole cells cover 𝒟10\mathcal{D}_{10} up to a strip. Lemma 5.5 absorbs this strip by the retained reserve (5.27). For G1G_{1}, the retained cells are those of Paper II, (4.19). By Lemma 5.6, the shifted profile has no positive support outside them. The arrays (5.33) and (5.56) enter only through the nonnegative errors in E′E^{\prime}, which vanish by Lemma 5.8.

The array (5.57) carries VN⁢(p3)V_{N}(p_{3}) at the actual coordinate. The arithmetic lower main term carries VN⁢(E)V_{N}(E), E=Nt3E=N^{t_{3}}, at the inherited label. Since E≤a3E\leq a_{3}, VN⁢(E)≥VN⁢(a3)V_{N}(E)\geq V_{N}(a_{3}). In the lower part of the joint upper bound this replacement is favourable. We nevertheless bound it absolutely and include it once in Paper II’s peel allowance (4.57). No fixed cost is added. By (5.64), uniformly for actual label/coordinate pairs in the same cell with u/ρ≤t3≤x3≤1u/\rho\leq t_{3}\leq x_{3}\leq 1 and x3<ρ⁢t3x_{3}<\rho t_{3},

VN⁢(Nt3)VN⁢(Nx3)=x3t3⁢(1+o⁢(1))≤ρ⁢(1+o⁢(1)).\frac{V_{N}(N^{t_{3}})}{V_{N}(N^{x_{3}})}=\frac{x_{3}}{t_{3}}(1+o(1))\leq\rho(% 1+o(1)).

For a weight 0≤w≤10\leq w\leq 1 on the strictly ordered cone, the replacement therefore costs at most

(5.70) Ccut,N≤(τ+oσ⁢(1))⁢TN,TN=XGW⁢∑𝒞VN⁢(p3)(p1−1)⁢(p2−1)⁢(p3−1)⟶KG⁢I0,I0=∭𝒞d⁢𝐭t1⁢t2⁢t32=500⁢(1−Hlog+Hlog22)−1μ∗,\begin{gathered}C_{\mathrm{cut},N}\leq(\tau+o_{\sigma}(1))T_{N},\qquad T_{N}=% \frac{X_{G}}{W}\sum_{\mathcal{C}}\frac{V_{N}(p_{3})}{(p_{1}-1)(p_{2}-1)(p_{3}-% 1)}\longrightarrow K_{G}I_{0},\\ I_{0}=\iiint_{\mathcal{C}}\frac{d\mathbf{t}}{t_{1}t_{2}t_{3}^{2}}=500\Bigl{(}1% -H_{\log}+\frac{H_{\log}^{2}}{2}\Bigr{)}-\frac{1}{\mu_{*}},\end{gathered}

where the sum runs over the primes of (5.57). The limit follows from Steps 2–4 of the proof of Lemma 5.8 applied to the bounded kernel 𝟏𝒞⁢KG/t3\mathbf{1}_{\mathcal{C}}K_{G}/t_{3}. We evaluate I0I_{0} by (5.44). Since 1<Hlog<459/1001<H_{\log}<459/100 and the quadratic increases for Hlog>1H_{\log}>1,

I0<693381200,KG⁢I0≤Khi⁢693381200<1400.I_{0}<\frac{693381}{200},\qquad K_{G}I_{0}\leq K_{\mathrm{hi}}\frac{693381}{20% 0}<1400.

At fixed τ\tau, eventually oσ⁢(1)≤τo_{\sigma}(1)\leq\tau and TN≤1400T_{N}\leq 1400, so Ccut,N≤2800⁢τ<4000⁢τC_{\mathrm{cut},N}\leq 2800\tau<4000\tau. We include 4000⁢τ4000\tau once. Paper II’s peel bound before its final rounding is

Ppeel⁢τ=3⋅502002⁢(459/100)31−ε⁢τ=809081467719355550⁢τP_{\mathrm{peel}}\tau=\frac{3\cdot 502002\,(459/100)^{3}}{1-\varepsilon}\tau=% \frac{8090814677193}{55550}\tau

[27, (4.47), (4.56)], and its printed allowance is Pcap⁢τ=(485500000000/3333)⁢τP_{\mathrm{cap}}\tau=(485500000000/3333)\tau [27, (4.57)]. The per-layer coefficient 502002 in Paper II, (4.53), includes the Selberg remainder. The printed allowance (4.57) uses that coefficient; we therefore use its slack with the Selberg remainder already included. Exact subtraction gives

(5.71) Pcap−Ppeel=2555968421166650,Pcap−Ppeel−4000=1889368421166650>0.P_{\mathrm{cap}}-P_{\mathrm{peel}}=\frac{2555968421}{166650},\qquad P_{\mathrm% {cap}}-P_{\mathrm{peel}}-4000=\frac{1889368421}{166650}>0.

Hence the peel and the label replacement together stay below Pcap⁢τ<145664566.4567⁢τP_{\mathrm{cap}}\tau<145664566.4567\tau, the entry already contained in gτg_{\tau}. The fixed deduction FnetF_{\mathrm{net}} is unchanged.

5.6. The resulting lower comparison

Remark 5.9 (Inputs).

The proof of Proposition 5.10 uses the cited statements of Paper I and Paper II. They are applied to Paper II’s unchanged sources. It uses Paper I, Theorem 2.8, through Fact 3.22, and the prime Siegel–Walfisz theorem, Paper I, (2.21). It uses Lemma 6.5(ii) at Paper I, (3.48), and the finite enclosures of Propositions B.1 and B.2. The optional endpoint improvement also uses Lemma 5.3. The table of Appendix B.7 is an index, not an input.

Proposition 5.10 (Retained comparison).

Fix 0<σ≤10−100<\sigma\leq 10^{-10} satisfying Paper II, (1.27) and assume Lemma 5.3. Then (5.2) holds, and E′⁢(N;σ)→0E^{\prime}(N;\sigma)\to 0 as N→∞N\to\infty. Without that lemma, (5.2) holds with g6g_{6} replaced by 0; the same limit for E′⁢(N;σ)E^{\prime}(N;\sigma) holds.

Proof.

Write each chain of ℐ\mathcal{I}, including T5\mathrm{T5}, by (5.4) and each joint group by (5.5). Lemma 5.2 covers the differences at stages one to eight and the remaining Paper II differences at stages nine and ten. Their sum is at least −(Fnet−δG⁢1)−Evan-(F_{\mathrm{net}}-\delta_{G1})-E_{\mathrm{van}}. For j∈ℋj\in\mathcal{H}, replace the stage-nine object by Qj,9h=Pj+ΔjQ^{h}_{j,9}=P_{j}+\Delta_{j}. Then Lemma 5.5 gives Qj,8−Qj,9h≥0Q_{j,8}-Q^{h}_{j,9}\geq 0. For j∈𝒥j\in\mathcal{J}, Lemma 5.3 gives the stage-ten difference Pj−Nj≥0P_{j}-N_{j}\geq 0, so the endpoint rises by Nj−OjN_{j}-O_{j}. Only the endpoint changes, so g6g_{6} enters once. By Proposition B.1, ∑j∈ℋΔj>572004/108>5719/106\sum_{j\in\mathcal{H}}\Delta_{j}>572004/10^{8}>5719/10^{6}, which is (5.25). For the joint occurrence, (5.52) replaces Paper II’s G1G_{1} bound. Its EG⁢1DE^{D}_{G1} is the G1G_{1} part of Fnet+EvanF_{\mathrm{net}}+E_{\mathrm{van}} and is counted once. These modifications concern disjoint profile terms, so their gains enter once. The endpoint sum (5.6) and the floor (5.13) give DII+J¯6+2⁢H¯D_{\mathrm{II}}+\overline{J}_{6}+2\overline{H}. Hence

(5.72) Rfix+S2W≥\displaystyle\frac{R_{\mathrm{fix}}+S_{2}}{W}\geq{} DII+g6+J¯6+2⁢H¯+5719106+M5,internal\displaystyle D_{\mathrm{II}}+g_{6}+\overline{J}_{6}+2\overline{H}+\frac{5719}% {10^{6}}+M_{5,\mathrm{internal}}
−Evan⁢(N;σ)−∑j∈ℋ(|Λj,N0|+|Λj,N|)−|ΛG,N|.\displaystyle-E_{\mathrm{van}}(N;\sigma)-\sum_{j\in\mathcal{H}}\bigl{(}|% \Lambda^{0}_{j,N}|+|\Lambda_{j,N}|\bigr{)}-|\Lambda_{G,N}|.

The nine conversion errors are nonnegative, so (5.72) is weaker than the same bound without them. This is (5.2). By Lemmas 5.2 and 5.8, E′⁢(N;σ)→0E^{\prime}(N;\sigma)\to 0; the threshold depends on the fixed σ\sigma. No fixed increment is added. The only new fixed cost is the label replacement, and by (5.71) it lies inside Paper II, (4.57). Without Lemma 5.3, take Nj=OjN_{j}=O_{j}; then the same argument gives (5.72) with g6g_{6} replaced by 0. ∎

6. The sixth sum at N/4N/4

Put L=log⁡NL=\log N and fix 0<σ≤10−100<\sigma\leq 10^{-10} for the common error allocation. No estimate in the sixth-sum construction depends on σ\sigma. Fix

(6.1) α=1001149,t0=57224,vRA=522710000,ηm=ε=110000,J=[t0,1/3),Jt=[t0,1/3−ηm),Jtail=[1/3−ηm,1/3),IL=[2,N/4],IH=(N/4,(1−ε)⁢N),zs=Nα.\begin{gathered}\alpha=\frac{100}{1149},\qquad t_{0}=\frac{57}{224},\qquad v_{% \mathrm{RA}}=\frac{5227}{10000},\qquad\eta_{\mathrm{m}}=\varepsilon=\frac{1}{1% 0000},\\ J=[t_{0},1/3),\quad J_{t}=[t_{0},1/3-\eta_{\mathrm{m}}),\quad J_{\mathrm{tail}% }=[1/3-\eta_{\mathrm{m}},1/3),\\ I_{L}=[2,N/4],\qquad I_{H}=(N/4,(1-\varepsilon)N),\qquad z_{s}=N^{\alpha}.\end% {gathered}

Write p∈NKp\in N^{K} for p∈ℙp\in\mathbb{P} with log⁡p/L∈K\log p/L\in K. Paper II, (1.7), gives the original sum [27, (1.7)]:

(6.2) S6=∑p∈NJ(p,N)=1∑m≥1,e=N−p⁢m∈ℙ2≤e<(1−ε)⁢N𝟏P−⁢(m)≥zs⁢𝟏(m,N⁢p)=1.S_{6}=\sum_{\begin{subarray}{c}p\in N^{J}\\ (p,N)=1\end{subarray}}\ \sum_{\begin{subarray}{c}m\geq 1,\ e=N-pm\in\mathbb{P}% \\ 2\leq e<(1-\varepsilon)N\end{subarray}}\mathbf{1}_{P^{-}(m)\geq z_{s}}\mathbf{% 1}_{(m,Np)=1}.

Each prime mark remains a separate occurrence.

6.1. Three upper weights

For squarefree d=ℓ1⁢⋯⁢ℓkd=\ell_{1}\cdots\ell_{k}, order its primes decreasingly. The ordinary upper Rosser weight is

(6.3) μd+⁢(D)=μ⁢(d)⁢∏1≤j≤kj⁢odd𝟏ℓ1⁢⋯⁢ℓj−1⁢ℓj3<D,μ1+⁢(D)=1.\mu_{d}^{+}(D)=\mu(d)\prod_{\begin{subarray}{c}1\leq j\leq k\\ j\ \mathrm{odd}\end{subarray}}\mathbf{1}_{\ell_{1}\cdots\ell_{j-1}\ell_{j}^{3}% <D},\qquad\mu_{1}^{+}(D)=1.

The weight is zero outside its stated squarefree support. Its divisor sum is a nonnegative upper sieve weight [14, Lemma 1, (3.2), (3.6)] [13, Lemmas 2–3, p. 313].

For K⊆JK\subseteq J and p∈NKp\in N^{K}, define

(6.4) cR,K⁢(p⁢d)=μ⁢(d)⁢𝟏p⁢d<R⁢∏1≤j≤kj⁢odd𝟏p⁢ℓ1⁢⋯⁢ℓj−1⁢ℓj3<R.c_{R,K}(pd)=\mu(d)\mathbf{1}_{pd<R}\prod_{\begin{subarray}{c}1\leq j\leq k\\ j\ \mathrm{odd}\end{subarray}}\mathbf{1}_{p\ell_{1}\cdots\ell_{j-1}\ell_{j}^{3% }<R}.

Require ℓj<zs\ell_{j}<z_{s} and (p⁢d,2⁢N)=1(pd,2N)=1. Set the coefficient to zero otherwise. Since t0>αt_{0}>\alpha, the mark is unique. Thus |cR,K⁢(q)|≤1|c_{R,K}(q)|\leq 1. On supported moduli with p<Rp<R, the gates give d<R/pd<R/p. For d=1d=1 the gate product is empty, and p<Rp<R suffices. Every marked prime has p<N1/3p<N^{1/3}. Each sieve level below is >N1/3>N^{1/3} for large NN. Hence

(6.5) cR,K⁢(p⁢d)=μd+⁢(R/p),φ⁢(p⁢d)=(p−1)⁢φ⁢(d).c_{R,K}(pd)=\mu_{d}^{+}(R/p),\qquad\varphi(pd)=(p-1)\varphi(d).

The equality is claimed on supported moduli only. Off that support the coefficient is zero.

Choose fixed logarithmic exponents. Put

(6.6) RL\displaystyle R_{L} =N1/2⁢L−BL,\displaystyle=N^{1/2}L^{-B_{L}}, Rtail\displaystyle R_{\mathrm{tail}} =N1/2⁢L−Btail,\displaystyle=N^{1/2}L^{-B_{\mathrm{tail}}},
Q\displaystyle Q =NvRA⁢L−B,\displaystyle=N^{v_{\mathrm{RA}}}L^{-B}, Q0\displaystyle Q_{0} =N1/2⁢L−B0,\displaystyle=N^{1/2}L^{-B_{0}},
ball\displaystyle b_{\mathrm{all}} =cRL,J,\displaystyle=c_{R_{L},J}, btail\displaystyle b_{\mathrm{tail}} =cRtail,Jtail,\displaystyle=c_{R_{\mathrm{tail}},J_{\mathrm{tail}}},
ctrim\displaystyle c_{\mathrm{trim}} =cQ,Jt,\displaystyle=c_{Q,J_{t}}, clo⁢(q)\displaystyle c_{\mathrm{lo}}(q) =ctrim⁢(q)⁢𝟏q≤Q0,\displaystyle=c_{\mathrm{trim}}(q)\mathbf{1}_{q\leq Q_{0}},
Γ⁢(q)\displaystyle\Gamma(q) =ctrim⁢(q)⁢𝟏q>Q0.\displaystyle=c_{\mathrm{trim}}(q)\mathbf{1}_{q>Q_{0}}.

The last two arrays keep the gates at QQ.

First omit (m,N⁢p)=1(m,Np)=1 in (6.2). Sieve the larger sequence by primes ℓ∤2⁢N\ell\nmid 2N, ℓ<zs\ell<z_{s}. Use the three weights on

(6.7) IL×J,IH×Jtail,IH×Jt.I_{L}\times J,\qquad I_{H}\times J_{\mathrm{tail}},\qquad I_{H}\times J_{t}.

Their divisor sum is the finite weighted count

(6.8) Amix=\displaystyle A_{\mathrm{mix}}={} ∑qball⁢(q)⁢∑e∈IL∩ℙe≡N⁢(q)1\displaystyle\sum_{q}b_{\mathrm{all}}(q)\sum_{\begin{subarray}{c}e\in I_{L}% \cap\mathbb{P}\\ e\equiv N\ (q)\end{subarray}}1
+∑q{btail⁢(q)+ctrim⁢(q)}⁢∑e∈IH∩ℙe≡N⁢(q)1.\displaystyle+\sum_{q}\{b_{\mathrm{tail}}(q)+c_{\mathrm{trim}}(q)\}\sum_{% \begin{subarray}{c}e\in I_{H}\cap\mathbb{P}\\ e\equiv N\ (q)\end{subarray}}1.

The upper-weight comparison

(6.9) S6≤Amix,Z6:=Amix−S6≥0,S_{6}\leq A_{\mathrm{mix}},\qquad Z_{6}:=A_{\mathrm{mix}}-S_{6}\geq 0,

is proved in Lemma 6.11(a) below. Positivity is used before expanding the divisor sums.

6.2. The exact discrepancy identity

For a bounded interval I⊂[2,∞)I\subset[2,\infty) and a finitely supported modulus array a⁢(q)a(q), put Li⁡(I)=∫I𝑑t/log⁡t\operatorname{Li}(I)=\int_{I}dt/\log t and define

(6.10) ΠI⁢(q)\displaystyle\Pi_{I}(q) =∑e∈I∩ℙ𝟏e≡N(modq),\displaystyle=\sum_{e\in I\cap\mathbb{P}}\mathbf{1}_{e\equiv N\pmod{q}},
BI⁢(q)\displaystyle B_{I}(q) =1φ⁢(q)⁢∑e∈I∩ℙ𝟏(e,q)=1,\displaystyle=\frac{1}{\varphi(q)}\sum_{e\in I\cap\mathbb{P}}\mathbf{1}_{(e,q)% =1},
DI⁢(a)\displaystyle D_{I}(a) =∑qa⁢(q)⁢{ΠI⁢(q)−Li⁡(I)φ⁢(q)},\displaystyle=\sum_{q}a(q)\left\{\Pi_{I}(q)-\frac{\operatorname{Li}(I)}{% \varphi(q)}\right\},
PI⁢(a)\displaystyle P_{I}(a) =∑qa⁢(q)⁢{ΠI⁢(q)−BI⁢(q)},CI⁢(a)=DI⁢(a)−PI⁢(a).\displaystyle=\sum_{q}a(q)\{\Pi_{I}(q)-B_{I}(q)\},\qquad C_{I}(a)=D_{I}(a)-P_{% I}(a).

Also put

(6.11) Mmix=\displaystyle M_{\mathrm{mix}}={} Li⁡(IL)⁢∑qball⁢(q)φ⁢(q)\displaystyle\operatorname{Li}(I_{L})\sum_{q}\frac{b_{\mathrm{all}}(q)}{% \varphi(q)}
+Li⁡(IH)⁢∑qbtail⁢(q)+ctrim⁢(q)φ⁢(q).\displaystyle+\operatorname{Li}(I_{H})\sum_{q}\frac{b_{\mathrm{tail}}(q)+c_{% \mathrm{trim}}(q)}{\varphi(q)}.

Finite expansion gives

(6.12) Amix=\displaystyle A_{\mathrm{mix}}={} Mmix+DIL⁢(ball)+DIH⁢(btail)\displaystyle M_{\mathrm{mix}}+D_{I_{L}}(b_{\mathrm{all}})+D_{I_{H}}(b_{% \mathrm{tail}})
+CIH⁢(ctrim)+PIH⁢(clo)+PIH⁢(Γ).\displaystyle+C_{I_{H}}(c_{\mathrm{trim}})+P_{I_{H}}(c_{\mathrm{lo}})+P_{I_{H}% }(\Gamma).

Since ctrim=clo+Γc_{\mathrm{trim}}=c_{\mathrm{lo}}+\Gamma,

(6.13) CIH⁢(ctrim)+PIH⁢(clo)=DIH⁢(clo)+CIH⁢(Γ).C_{I_{H}}(c_{\mathrm{trim}})+P_{I_{H}}(c_{\mathrm{lo}})=D_{I_{H}}(c_{\mathrm{% lo}})+C_{I_{H}}(\Gamma).

Therefore

(6.14) Amix=\displaystyle A_{\mathrm{mix}}={} Mmix+DIL⁢(ball)+DIH⁢(btail)+DIH⁢(clo)\displaystyle M_{\mathrm{mix}}+D_{I_{L}}(b_{\mathrm{all}})+D_{I_{H}}(b_{% \mathrm{tail}})+D_{I_{H}}(c_{\mathrm{lo}})
+CIH⁢(Γ)+PIH⁢(Γ).\displaystyle+C_{I_{H}}(\Gamma)+P_{I_{H}}(\Gamma).

No low natural-coprime term is estimated separately.

For large NN, each prime in IHI_{H} exceeds QQ. Hence

(6.15) CIH⁢(Γ)={π⁢(IH)−Li⁡(IH)}⁢∑qΓ⁢(q)φ⁢(q).C_{I_{H}}(\Gamma)=\{\pi(I_{H})-\operatorname{Li}(I_{H})\}\sum_{q}\frac{\Gamma(% q)}{\varphi(q)}.

The elementary identity

(6.16) qφ⁢(q)=∑d∣qμ⁢(d)2φ⁢(d),∑q≤Q1φ⁢(q)≪log⁡(2⁢Q)\frac{q}{\varphi(q)}=\sum_{d\mid q}\frac{\mu(d)^{2}}{\varphi(d)},\qquad\sum_{q% \leq Q}\frac{1}{\varphi(q)}\ll\log(2Q)

follows by multiplicativity and a convergent Euler product. Thus Paper I, (2.21), bounds (6.15) by OA⁢(N⁢L−A)O_{A}(NL^{-A}) for each fixed AA [26, (2.21)].

For the three DD-terms we use the maximal-endpoint prime form of Bombieri–Vinogradov. Here it is conditional on the prime Siegel–Walfisz input [26, (2.21)]. Define the prime progression error by

(6.17) Δπ⁢(y;q,a)=π⁢(y;q,a)−Li⁡(y)φ⁢(q).\Delta_{\pi}(y;q,a)=\pi(y;q,a)-\frac{\operatorname{Li}(y)}{\varphi(q)}.

Fact 3.2 gives, for each fixed S>0S>0,

(6.18) ∑q≤X1/2⁢(log⁡X)−(S+60)max(a,q)=1⁢sup0≤y≤X|Δπ⁢(y;q,a)|≪SX⁢(log⁡X)−S.\sum_{q\leq X^{1/2}(\log X)^{-(S+60)}}\max_{(a,q)=1}\sup_{0\leq y\leq X}|% \Delta_{\pi}(y;q,a)|\ll_{S}X(\log X)^{-S}.

Here Li⁡(y)=0\operatorname{Li}(y)=0 for 0≤y<20\leq y<2. The level sits at XX, not at the variable endpoint yy, so intervals with endpoints chosen separately for each modulus cost at most twice this bound. This is the maximal prime statement. We do not substitute the fixed-endpoint von Mangoldt statement of Paper I, (2.20). The source and the fixed 6060 logarithmic buffer are those of Fact 3.2.

Set X=NX=N, S=A+10S=A+10, and choose the half-level buffers so that

(6.19) BL,Btail,B0≥A+72.B_{L},\ B_{\mathrm{tail}},\ B_{0}\geq A+72.
Lemma 6.1 (The three low discrepancies).

Under (6.19),

(6.20) |DIL⁢(ball)|+|DIH⁢(btail)|+|DIH⁢(clo)|≪AN⁢L−A−10.|D_{I_{L}}(b_{\mathrm{all}})|+|D_{I_{H}}(b_{\mathrm{tail}})|+|D_{I_{H}}(c_{% \mathrm{lo}})|\ll_{A}NL^{-A-10}.
Proof.

The arrays ballb_{\mathrm{all}}, btailb_{\mathrm{tail}} and cloc_{\mathrm{lo}} are supported on q<RLq<R_{L}, q<Rtailq<R_{\mathrm{tail}} and q≤Q0q\leq Q_{0}, respectively. Each is one-bounded. Since BL,Btail,B0≥A+72>S+60B_{L},B_{\mathrm{tail}},B_{0}\geq A+72>S+60, every such qq has q≤N1/2⁢L−(S+60)q\leq N^{1/2}L^{-(S+60)}. This is the level of (6.18) at X=NX=N. Every supported qq is coprime to NN, so NmodqN\bmod q is a reduced class. Since π⁢(y;q,N)=Li⁡(y)=0\pi(y;q,N)=\operatorname{Li}(y)=0 for y<2y<2,

ΠIL⁢(q)−Li⁡(IL)φ⁢(q)=Δπ⁢(N/4;q,N).\Pi_{I_{L}}(q)-\frac{\operatorname{Li}(I_{L})}{\varphi(q)}=\Delta_{\pi}(N/4;q,% N).

Write y−y^{-} for the left limit at yy. Then

ΠIH⁢(q)−Li⁡(IH)φ⁢(q)=Δπ⁢(((1−ε)⁢N)−;q,N)−Δπ⁢(N/4;q,N).\Pi_{I_{H}}(q)-\frac{\operatorname{Li}(I_{H})}{\varphi(q)}=\Delta_{\pi}\bigl{(% }((1-\varepsilon)N)^{-};q,N\bigr{)}-\Delta_{\pi}(N/4;q,N).

A left limit is a limit of values at points of [0,N][0,N]. Hence each value on the right is at most sup0≤y≤N|Δπ⁢(y;q,N)|\sup_{0\leq y\leq N}|\Delta_{\pi}(y;q,N)|. Therefore the left side of (6.20) is at most five times the left side of (6.18), with X=NX=N and S=A+10S=A+10. This is the maximal prime statement of Fact 3.2. ∎

6.3. The high coefficient

Put

(6.21) U=V=N1/3,z0=N1/(log⁡log⁡N)3,ℛ⁢(n)=𝟏P−⁢(n)>z0,ℛ⁢(1)=1,𝒜⁢(a)=μ⁢(a)⁢ℛ⁢(a),𝒞⁢(t)=ℛ⁢(t)⁢∑a⁢b=ta≤U,b≤Vμ⁢(a)⁢Λ⁢(b),ℬ⁢(s)=ℛ⁢(s)⁢∑b∣sb>VΛ⁢(b),𝒦q⁢(e)=𝟏e≡N(modq)−𝟏(e,q)=1φ⁢(q).\begin{gathered}U=V=N^{1/3},\qquad z_{0}=N^{1/(\log\log N)^{3}},\\ \mathcal{R}(n)=\mathbf{1}_{P^{-}(n)>z_{0}},\qquad\mathcal{R}(1)=1,\qquad% \mathcal{A}(a)=\mu(a)\mathcal{R}(a),\\ \mathcal{C}(t)=\mathcal{R}(t)\sum_{\begin{subarray}{c}ab=t\\ a\leq U,\ b\leq V\end{subarray}}\mu(a)\Lambda(b),\qquad\mathcal{B}(s)=\mathcal% {R}(s)\sum_{\begin{subarray}{c}b\mid s\\ b>V\end{subarray}}\Lambda(b),\\ \mathcal{K}_{q}(e)=\mathbf{1}_{e\equiv N\pmod{q}}-\frac{\mathbf{1}_{(e,q)=1}}{% \varphi(q)}.\end{gathered}

The von Mangoldt identity gives three sums:

(6.22) T1\displaystyle T_{1} =∑qΓ⁢(q)⁢∑a≤U,c≥1a⁢c∈IH𝒜⁢(a)⁢ℛ⁢(c)⁢log⁡clog⁡(a⁢c)⁢𝒦q⁢(a⁢c),\displaystyle=\sum_{q}\Gamma(q)\sum_{\begin{subarray}{c}a\leq U,\ c\geq 1\\ ac\in I_{H}\end{subarray}}\mathcal{A}(a)\mathcal{R}(c)\frac{\log c}{\log(ac)}% \mathcal{K}_{q}(ac),
T2\displaystyle T_{2} =−∑qΓ⁢(q)⁢∑t≤U⁢V,c≥1t⁢c∈IH𝒞⁢(t)⁢ℛ⁢(c)log⁡(t⁢c)⁢𝒦q⁢(t⁢c),\displaystyle=-\sum_{q}\Gamma(q)\sum_{\begin{subarray}{c}t\leq UV,\ c\geq 1\\ tc\in I_{H}\end{subarray}}\frac{\mathcal{C}(t)\mathcal{R}(c)}{\log(tc)}% \mathcal{K}_{q}(tc),
TII\displaystyle T_{\mathrm{II}} =∑qΓ⁢(q)⁢∑a>U,s>Va⁢s∈IH𝒜⁢(a)⁢ℬ⁢(s)log⁡(a⁢s)⁢𝒦q⁢(a⁢s).\displaystyle=\sum_{q}\Gamma(q)\sum_{\begin{subarray}{c}a>U,\ s>V\\ as\in I_{H}\end{subarray}}\frac{\mathcal{A}(a)\mathcal{B}(s)}{\log(as)}% \mathcal{K}_{q}(as).

These come from

(6.23) Λ=μ≤U∗log−μ≤U∗Λ≤V∗1+Λ≤V+μ>U∗Λ>V∗1.\Lambda=\mu_{\leq U}*\log-\mu_{\leq U}*\Lambda_{\leq V}*1+\Lambda_{\leq V}+\mu% _{>U}*\Lambda_{>V}*1.

Roughness is multiplicative, including shared prime factors. The short Λ\Lambda-term vanishes on IHI_{H}.

The detector retains proper prime powers whose bases exceed z0z_{0}. For e∈IHe\in I_{H}, hence e>z0e>z_{0},

(6.24) ℛ⁢(e)⁢Λ⁢(e)log⁡e=𝟏e∈ℙ+∑P∈ℙ,j≥2e=Pj𝟏P>z0j.\frac{\mathcal{R}(e)\Lambda(e)}{\log e}=\mathbf{1}_{e\in\mathbb{P}}+\sum_{% \begin{subarray}{c}P\in\mathbb{P},\ j\geq 2\\ e=P^{j}\end{subarray}}\frac{\mathbf{1}_{P>z_{0}}}{j}.

Consequently

(6.25) PIH⁢(Γ)\displaystyle P_{I_{H}}(\Gamma) =T1+T2+TII−Epp,\displaystyle=T_{1}+T_{2}+T_{\mathrm{II}}-E_{\mathrm{pp}},
Epp\displaystyle E_{\mathrm{pp}} =∑qΓ⁢(q)⁢∑P∈ℙ,j≥2Pj∈IH𝟏P>z0j⁢𝒦q⁢(Pj).\displaystyle=\sum_{q}\Gamma(q)\sum_{\begin{subarray}{c}P\in\mathbb{P},\ j\geq 2% \\ P^{j}\in I_{H}\end{subarray}}\frac{\mathbf{1}_{P>z_{0}}}{j}\mathcal{K}_{q}(P^{% j}).

Let e∈IHe\in I_{H}. A supported qq with e≡N(modq)e\equiv N\pmod{q} divides N−eN-e, and |Γ⁢(q)|≤1|\Gamma(q)|\leq 1 by unique marking. The comparator part is at most ∑q≤Q1/φ⁢(q)\sum_{q\leq Q}1/\varphi(q). Hence (6.16) gives

(6.26) ∑q|Γ⁢(q)|⁢|𝒦q⁢(e)|≤d⁢(N−e)+O⁢(L),Epp≪νN1/2+ν⁢L2.\sum_{q}|\Gamma(q)||\mathcal{K}_{q}(e)|\leq d(N-e)+O(L),\qquad E_{\mathrm{pp}}% \ll_{\nu}N^{1/2+\nu}L^{2}.

Here N−e≥ε⁢NN-e\geq\varepsilon N, and 0<ν<1/20<\nu<1/2 is fixed. The second bound follows from the first, d⁢(N−e)≪νNνd(N-e)\ll_{\nu}N^{\nu} and ∑j≥2#⁢{P∈ℙ:Pj≤N}≪N1/2\sum_{j\geq 2}\#\{P\in\mathbb{P}:P^{j}\leq N\}\ll N^{1/2}. The high-coefficient estimate uses the P>z0P>z_{0} mask of EppE_{\mathrm{pp}} in (6.25). That mask excludes bases P≤z0P\leq z_{0}, so the displayed decomposition needs no separate add-back.

Proposition 6.12(3) proves the high-coefficient estimate

(6.27) PIH⁢(Γ)≪A,B,B0N⁢L−A(A>0⁢fixed).P_{I_{H}}(\Gamma)\ll_{A,B,B_{0}}NL^{-A}\qquad(A>0\ \hbox{fixed}).

Its modulus coefficient is exactly (6.6). The estimate permits no joint arithmetic mask. Table 6.1 gives its decomposition. Each power boundary belongs to the interval on its right.

Table 6.1. The high-coefficient decomposition
Sum and range Tested array Required estimate
T1T_{1}, all a≤Ua\leq U ℛ⁢(c)\mathcal{R}(c) Rough-factor estimate
T2T_{2}, c<N.46c<N^{.46} ℛ⁢(c)\mathcal{R}(c) Two-factor convolution
T2T_{2}, N.46≤c<N.50N^{.46}\leq c<N^{.50} 𝒞⁢(t)/(2⁢L)\mathcal{C}(t)/(2L) Central estimate
T2T_{2}, N.50≤c<N.54N^{.50}\leq c<N^{.54} ℛ⁢(c)\mathcal{R}(c) Central estimate
T2T_{2}, c≥N.54c\geq N^{.54} ℛ⁢(c)\mathcal{R}(c) Rough-factor estimate
TIIT_{\mathrm{II}}, a<N.46a<N^{.46} 𝒜⁢(a)\mathcal{A}(a) Two-factor convolution
TIIT_{\mathrm{II}}, N.46≤a<N.50N^{.46}\leq a<N^{.50} ℬ⁢(s)/(2⁢L)\mathcal{B}(s)/(2L) Central estimate
TIIT_{\mathrm{II}}, N.50≤a<N.54N^{.50}\leq a<N^{.54} 𝒜⁢(a)\mathcal{A}(a) Central estimate
TIIT_{\mathrm{II}}, a≥N.54a\geq N^{.54} ℬ⁢(s)/(2⁢L)\mathcal{B}(s)/(2L) Two-factor convolution

6.4. The three distribution estimates

Lemma 6.2 (Rough-factor distribution under parent-scale and strict-roughness conditions).

Let L=log⁡NL=\log N, z0=N1/(log⁡log⁡N)3z_{0}=N^{1/(\log\log N)^{3}}, and Q=N5227/10000⁢L−BQ=N^{5227/10000}L^{-B}, with fixed BB. Assume the two explicit conditions used by the direct rows:

  1. (W1)

    The original parent satisfies c⁢N.54≤H≤NcN^{.54}\leq H\leq N, for a fixed c>0c>0. In the T1T_{1} row H=N/a≤NH=N/a\leq N; in the right T2T_{2} row H=N/t≤NH=N/t\leq N.

  2. (W2)

    Use the strict roughness convention ℛ⁢(n)=𝟏P−⁢(n)>z0\mathcal{R}(n)=\mathbf{1}_{P^{-}(n)>z_{0}}, as in (6.21). It is not replaced by P−⁢(n)≥z0P^{-}(n)\geq z_{0}.

For every fixed Tsave>0T_{\mathrm{save}}>0, uniformly in real intervals I⊂(0,2⁢H]I\subset(0,2H] (so |I|≤2⁢H|I|\leq 2H; open, closed or one-point), supported q≤Qq\leq Q with (q,N)=1(q,N)=1, and reduced residues (b,q)=1(b,q)=1,

(6.28) ∑n∈Iℛ⁢(n)⁢{𝟏n≡b(modq)−𝟏(n,q)=1φ⁢(q)}≪TsaveHq⁢LTsave.\sum_{n\in I}\mathcal{R}(n)\left\{\mathbf{1}_{n\equiv b\pmod{q}}-\frac{\mathbf% {1}_{(n,q)=1}}{\varphi(q)}\right\}\ll_{T_{\mathrm{save}}}\frac{H}{qL^{T_{% \mathrm{save}}}}.

The interval may be arbitrarily short. The saving is measured at its original parent. The estimate is an integer-sieve statement and uses no prime distribution input.

Proof.

Put ℓ=log⁡log⁡N\ell=\log\log N and 𝒫q={p≤z0:p∤q}\mathcal{P}_{q}=\{p\leq z_{0}:p\nmid q\}. The Euler product at s=1+1/log⁡z0s=1+1/\log z_{0} gives hq=∑p∈𝒫qp−1≤3⁢ℓh_{q}=\sum_{p\in\mathcal{P}_{q}}p^{-1}\leq 3\ell for sufficiently large NN. Choose the fixed constant KK after TsaveT_{\mathrm{save}}, with

(6.29) K>3⁢e,K⁢log⁡(K3⁢e)>Tsave+4.K>3e,\qquad K\log\!\left(\frac{K}{3e}\right)>T_{\mathrm{save}}+4.

Let k=2⁢⌈K⁢ℓ/2⌉k=2\lceil K\ell/2\rceil. The two adjacent Bonferroni truncations bracket the strict exclusion of all primes in 𝒫q\mathcal{P}_{q}. Their normalized gap satisfies

(6.30) k=2⁢⌈K⁢log⁡log⁡N/2⌉,Ek≤hqkk!≤(3⁢eK)K⁢ℓ≤L−Tsave−4,(k+1)⁢z0k=NO⁢(K/ℓ2).k=2\lceil K\log\log N/2\rceil,\qquad E_{k}\leq\frac{h_{q}^{k}}{k!}\leq\left(% \frac{3e}{K}\right)^{K\ell}\leq L^{-T_{\mathrm{save}}-4},\qquad(k+1)z_{0}^{k}=% N^{O(K/\ell^{2})}.

Every divisor in the truncation is at most z0kz_{0}^{k}. By CRT, each divisor contributes its expected interval mass with error O⁢(1)O(1). This is uniform for open, closed, or singleton intervals. The same expansion applies to the comparator after using

𝟏(n,q)=1=∑d∣rad⁡(q)d∣nμ⁢(d).\mathbf{1}_{(n,q)=1}=\sum_{\begin{subarray}{c}d\mid\operatorname{rad}(q)\\ d\mid n\end{subarray}}\mu(d).

Thus the main terms cancel. The accumulated lattice error is NO⁢(K/ℓ2)⁢q/φ⁢(q)N^{O(K/\ell^{2})}q/\varphi(q), and q/φ⁢(q)≤ω⁢(q)+1≪Lq/\varphi(q)\leq\omega(q)+1\ll L. Under (W1), H/q≫N.0173⁢LBH/q\gg N^{.0173}L^{B}. The Bonferroni remainder is at most (|I|/q)⁢Ek⁢L2≤2⁢H⁢L−Tsave−2/q(|I|/q)E_{k}L^{2}\leq 2HL^{-T_{\mathrm{save}}-2}/q because |I|≤2⁢H|I|\leq 2H. Hence both are absorbed by H/(q⁢LTsave)H/(qL^{T_{\mathrm{save}}}) once the fixed truncation precision is raised. This proves (6.28).

The strict convention in (W2) has no threshold atom. An application might instead use P−⁢(n)≥z0P^{-}(n)\geq z_{0}. Then the only possible difference is the atom z0=Pz_{0}=P when z0z_{0} is prime. That weak convention requires its separate CRT boundary correction. It is not used in (6.28). ∎

The positive gap .54−vRA=173/10000.54-v_{\mathrm{RA}}=173/10000 absorbs the lattice error in (6.30). For T1T_{1}, the free scale is at least N2/3/4N^{2/3}/4. For the right T2T_{2}-part, it exceeds a fixed multiple of N.54N^{.54}. Partial summation then gives

(6.31) ∑m≤Mout∑q≤QNm⁢q⁢LTsave≪N⁢L2−Tsave.\sum_{m\leq M_{\mathrm{out}}}\sum_{q\leq Q}\frac{N}{mqL^{T_{\mathrm{save}}}}% \ll NL^{2-T_{\mathrm{save}}}.

Both kernel terms remain in this estimate. Here MoutM_{\mathrm{out}} is the outer endpoint of the current row. It is UU in the T1T_{1} row and the corresponding low-row endpoint in the T2T_{2} decomposition.

The other tested arrays need uniformity under coprimality with an auxiliary integer. Write τ⁢(h)=∑d∣h1\tau(h)=\sum_{d\mid h}1 and ω⁢(h)=#⁢{p∈ℙ:p∣h}\omega(h)=\#\{p\in\mathbb{P}:p\mid h\}. For any sequence f⁢(n)f(n) on its original parent (H,2⁢H](H,2H], define

(6.32) Δf⁢(I;k,b;h)=\displaystyle\Delta_{f}(I;k,b;h)={} ∑n∈I,n≡b(modk)(n,h)=1f⁢(n)\displaystyle\sum_{\begin{subarray}{c}n\in I,\ n\equiv b\pmod{k}\\ (n,h)=1\end{subarray}}f(n)
−1φ⁢(k)⁢∑n∈I(n,k⁢h)=1f⁢(n).\displaystyle-\frac{1}{\varphi(k)}\sum_{\begin{subarray}{c}n\in I\\ (n,kh)=1\end{subarray}}f(n).
Lemma 6.3 (Prime-variable transfer).

Let N1/3/8≤H≤2⁢NN^{1/3}/8\leq H\leq 2N, L=log⁡NL=\log N, and z0=N1/(log⁡log⁡N)3z_{0}=N^{1/(\log\log N)^{3}}. Let y0≥z0y_{0}\geq z_{0} and

f⁢(n)=∑m⁢p=np∈Jmα⁢(m)⁢w⁢(p),f(n)=\sum_{\begin{subarray}{c}mp=n\\ p\in J_{m}\end{subarray}}\alpha(m)w(p),

where pp is prime and |α⁢(m)|≤1|\alpha(m)|\leq 1. For each mm the allowed primes lie in a real interval Jm⊂[y0,∞)J_{m}\subset[y_{0},\infty). Assume ‖w‖∞+Var⁡(w)≤W\|w\|_{\infty}+\operatorname{Var}(w)\leq W on [y0,2⁢H][y_{0},2H] and |f⁢(n)|≤1|f(n)|\leq 1 on (H,2⁢H](H,2H]. For every fixed P>0P>0, uniformly in intervals I⊂(H,2⁢H]I\subset(H,2H], k,h≥1k,h\geq 1, and (b,k)=1(b,k)=1, prime Siegel–Walfisz, Paper I (2.21), implies

(6.33) |Δf⁢(I;k,b;h)|≪PW⁢H⁢(L−P+ω⁢(h)⁢Ly0)≪PW⁢H⁢τ⁢(h)⁢L−P.|\Delta_{f}(I;k,b;h)|\ll_{P}WH\left(L^{-P}+\frac{\omega(h)L}{y_{0}}\right)\ll_% {P}WH\tau(h)L^{-P}.
Proof.

Put K=2⁢P+4K=2P+4. If k>LKk>L^{K}, the two terms in the discrepancy are bounded by a constant times ‖f‖∞⁢(H/k+1+H/φ⁢(k))\|f\|_{\infty}(H/k+1+H/\varphi(k)). For each represented nn, a prime divisor p≥y0p\geq y_{0} determines at most one pair (m,p)(m,p), since m=n/pm=n/p. Hence

|f⁢(n)|≤W⁢log⁡(2⁢H)log⁡y0≪W⁢(log⁡L)3,|f(n)|\leq W\frac{\log(2H)}{\log y_{0}}\ll W(\log L)^{3},

using y0≥z0y_{0}\geq z_{0}, H≤2⁢NH\leq 2N, and log⁡z0=L/(log⁡L)3\log z_{0}=L/(\log L)^{3}. Since φ⁢(k)≫k\varphi(k)\gg\sqrt{k} and H≥N1/3/8H\geq N^{1/3}/8, the resulting discrepancy is ≪PW⁢H⁢L−P\ll_{P}WHL^{-P}. The two spare powers in K/2=P+2K/2=P+2 absorb (log⁡L)3(\log L)^{3}. The additive 11 is absorbed because H≥N1/3/8≫LPH\geq N^{1/3}/8\gg L^{P}.

Now let k≤LKk\leq L^{K}. Terms with (m,k⁢h)>1(m,kh)>1 vanish from both sides. Otherwise the prime progression is p≡b⁢m−1(modk)p\equiv bm^{-1}\pmod{k} on Jm∩I/mJ_{m}\cap I/m. Primes dividing hh are excluded on the progression side and in the comparator. For each mm the two exclusions differ by at most 2⁢W⁢ω⁢(h)2W\omega(h). There are at most 2⁢H/y02H/y_{0} possible values of mm, so these terms contribute ≪W⁢H⁢ω⁢(h)/y0\ll WH\omega(h)/y_{0}.

For the remaining primes define

E⁢(t)=π⁢(t;k,c)−1φ⁢(k)⁢∑amodk(a,k)=1π⁢(t;k,a).E(t)=\pi(t;k,c)-\frac{1}{\varphi(k)}\sum_{\begin{subarray}{c}a\bmod k\\ (a,k)=1\end{subarray}}\pi(t;k,a).

The reduced-class sum equals π⁢(t)−#⁢{p≤t:p∣k}\pi(t)-\#\{p\leq t:p\mid k\}. Thus this is the centered prime discrepancy without the primes dividing kk. Apply (2.21) to the class cc and average its uniform error over all reduced classes. This gives E⁢(t)≪A′t⁢(log⁡t)−A′E(t)\ll_{A^{\prime}}t(\log t)^{-A^{\prime}}, with no factor of kk. Since t≥y0≥z0t\geq y_{0}\geq z_{0}, log⁡t≥L/(log⁡L)3\log t\geq L/(\log L)^{3}. Hence, for all sufficiently large NN, k≤(log⁡t)2⁢Kk\leq(\log t)^{2K}. Therefore (2.21), with modulus exponent 2⁢K2K and fixed saving A′A^{\prime}, applies throughout each interval of integration. Stieltjes partial summation bounds each mm-contribution by O⁢(W⁢(H/m)⁢(log⁡y0)−A′)O(W(H/m)(\log y_{0})^{-A^{\prime}}). Sum over m≤2⁢H/y0m\leq 2H/y_{0} and take A′=2⁢(P+K+2)A^{\prime}=2(P+K+2). This gives OP⁢(W⁢H⁢L−P)O_{P}(WHL^{-P}). The estimate is measured at the original parent HH, including for short intervals. Finally, L/y0≪PL−PL/y_{0}\ll_{P}L^{-P} because y0≥z0y_{0}\geq z_{0}, and ω⁢(h)≤τ⁢(h)\omega(h)\leq\tau(h). This proves (6.33). ∎

Lemma 6.4 (Four-family auxiliary-coprime Siegel–Walfisz).

By prime Siegel–Walfisz, Paper I (2.21), for each of ℛ,𝒜,𝒞/(2⁢L),ℬ/(2⁢L)\mathcal{R},\mathcal{A},\mathcal{C}/(2L),\mathcal{B}/(2L), the bound

(6.34) |Δf⁢(I;k,b;h)|≪PH⁢τ⁢(h)⁢L−P,(b,k)=1,|\Delta_{f}(I;k,b;h)|\ll_{P}H\tau(h)L^{-P},\qquad(b,k)=1,

holds uniformly for every I⊂(H,2⁢H]I\subset(H,2H] and k,h≥1k,h\geq 1. The parents are the central ranges in Table 6.1 and the convolution parents N1/3/8≤H≤2⁢N.46+O⁢(1/L)N^{1/3}/8\leq H\leq 2N^{.46+O(1/L)}. The proof uses the lower bound only to absorb the large-modulus lattice term and to exclude n=1n=1. It uses H≤2⁢N.54H\leq 2N^{.54} for the remaining weight bounds. The divisor exponent is the single fixed value CSW=1C_{\mathrm{SW}}=1, independent of PP. The implied constant may depend on PP and the fixed family parameters, but not on N,H,I,k,h,bN,H,I,k,h,b. The error is measured at HH, even when II is short.

Proof.

For sufficiently large NN, every parent has H≥N1/3/8>1H\geq N^{1/3}/8>1, so n=1n=1 is excluded. The rough and signed-rough arrays have exact prime-variable decompositions. For ℛ⁢(n)\mathcal{R}(n), take α⁢(m)=ℛ⁢(m)\alpha(m)=\mathcal{R}(m), Jm=[P+⁢(m),∞)∩(z0,∞)J_{m}=[P^{+}(m),\infty)\cap(z_{0},\infty), and w⁢(p)=1w(p)=1. Use P+⁢(1)=1P^{+}(1)=1. The largest prime factor gives the unique term. For 𝒜⁢(n)=μ⁢(n)⁢ℛ⁢(n)\mathcal{A}(n)=\mu(n)\mathcal{R}(n), take α⁢(m)=−μ⁢(m)⁢ℛ⁢(m)\alpha(m)=-\mu(m)\mathcal{R}(m), Jm=(max⁡(P+⁢(m),z0),∞)J_{m}=(\max(P^{+}(m),z_{0}),\infty), and w⁢(p)=1w(p)=1. The strict inequality excludes repeated largest primes, where μ⁢(n)=0\mu(n)=0.

For ℬ⁢(s)/(2⁢L)\mathcal{B}(s)/(2L), the j=1j=1 terms in b=pj∣sb=p^{j}\mid s, b>Vb>V, use α⁢(m)=ℛ⁢(m)\alpha(m)=\mathcal{R}(m), Jm=(V,∞)J_{m}=(V,\infty), and w⁢(p)=log⁡p/(2⁢L)w(p)=\log p/(2L). For 𝒞⁢(t)/(2⁢L)\mathcal{C}(t)/(2L), the j=1j=1 terms use α⁢(a)=μ⁢(a)⁢ℛ⁢(a)⁢𝟏a≤U\alpha(a)=\mu(a)\mathcal{R}(a)\mathbf{1}_{a\leq U}, Ja=(z0,V]J_{a}=(z_{0},V], and the same weight. In each case ‖w‖∞+Var⁡(w)≤1\|w\|_{\infty}+\operatorname{Var}(w)\leq 1. The four tested arrays are one-bounded on their parent ranges. For the last two arrays this follows from ∑d∣nΛ⁢(d)=log⁡n\sum_{d\mid n}\Lambda(d)=\log n and log⁡(2⁢H)<2⁢L\log(2H)<2L. On the central ranges H≤2⁢N.54H\leq 2N^{.54}. There the weight bound follows from y0=V=N1/3y_{0}=V=N^{1/3} for ℬ\mathcal{B} and y0=z0y_{0}=z_{0} for 𝒞\mathcal{C}, since log⁡(2⁢H)≤.54⁢L+O⁢(1)\log(2H)\leq.54L+O(1).

For ℬ\mathcal{B} and 𝒞\mathcal{C}, write the remaining j≥2j\geq 2 terms as f≥2f_{\geq 2}. They need not be nonnegative. For instance, the μ⁢(a)\mu(a) coefficient in 𝒞\mathcal{C} may change sign. Take absolute values before summing:

∑n≤2⁢H|f≥2⁢(n)|≪HL⁢∑p>z0∑j≥2log⁡ppj≪H⁢log⁡z0L⁢z0≪Hz0.\sum_{n\leq 2H}|f_{\geq 2}(n)|\ll\frac{H}{L}\sum_{p>z_{0}}\sum_{j\geq 2}\frac{% \log p}{p^{j}}\ll\frac{H\log z_{0}}{Lz_{0}}\ll\frac{H}{z_{0}}.

For any sequence gg, |Δg|≤2⁢∑n≤2⁢H|g⁢(n)||\Delta_{g}|\leq 2\sum_{n\leq 2H}|g(n)|. Hence this remainder is OP⁢(H⁢L−P)O_{P}(HL^{-P}) for every fixed PP. Applying Lemma 6.3 to each prime term proves (6.34) with the same exponent CSW=1C_{\mathrm{SW}}=1. ∎

The mean-square estimate below has five uses. Section 7 uses it for the zero mode of the exterior sum. Section 5 uses it for the Class II estimate of Paper II inside the retained side. Section 8 uses it for the row-three dispersion estimate of the switched sum. These three apply Paper I, Theorem 3.2. In the large-norm case of Paper I, (3.48), part (ii) below replaces [3, Theorem 0(a)]. The other two uses are the central rectangular estimate of Lemma 6.9 and the small-modulus norm-relative step of Lemma 6.8. Part (i) derives the conclusion of that published theorem (Paper I, Theorem 2.4). Its inputs are the norm-relative condition (6.35) and an elementary large sieve, so the argument is self-contained at this step. We do not correct [3]. Paper I’s use of it is unaffected. The norm-relative premise is not deduced from the absolute parent-scale estimate (6.34) alone. Let ξ\xi be complex and supported in [1,Z][1,Z], Z≥3Z\geq 3. Fix Bdiv≥0B_{\mathrm{div}}\geq 0. Consider the following condition. For every P>0P>0, uniformly in integers h,k≥1h,k\geq 1 and reduced classes bmodkb\bmod k,

(6.35) |∑n≡b⁢(k)(n,h)=1ξn−1φ⁢(k)⁢∑(n,k⁢h)=1ξn|≪P‖ξ‖2⁢Z1/2⁢τ⁢(h)Bdiv⁢(log⁡(2⁢Z))−P,\left|\sum_{\begin{subarray}{c}n\equiv b\ (k)\\ (n,h)=1\end{subarray}}\xi_{n}-\frac{1}{\varphi(k)}\sum_{(n,kh)=1}\xi_{n}\right% |\ll_{P}\|\xi\|_{2}Z^{1/2}\tau(h)^{B_{\mathrm{div}}}(\log(2Z))^{-P},

The constants are common to the family of pairs (Z,ξ)(Z,\xi) under consideration. Write Δξ⁢(k,b)\Delta_{\xi}(k,b) for the centered discrepancy at h=1h=1. The norm conclusion is

(6.36) ∑k≤Z⁢(log⁡Z)−B1⁢(A)∑bmodk∗|Δξ⁢(k,b)|2≪A‖ξ‖22⁢Z⁢(log⁡Z)−A.\sum_{k\leq Z(\log Z)^{-B_{1}(A)}}\sum_{b\bmod k}^{*}|\Delta_{\xi}(k,b)|^{2}% \ll_{A}\|\xi\|_{2}^{2}Z(\log Z)^{-A}.

In the selected-factor form of Paper I, (3.48), ξn=αn⁢1(n,r)=1\xi_{n}=\alpha_{n}1_{(n,r)=1}, Z=⌈2⁢Tint⌉Z=\lceil 2T_{\mathrm{int}}\rceil, and

(6.37) ∑q≤3⁢Q∑bmodq∗|Δξ⁢(q,b)|2≪Nℐ⁢Tint⁢L−A3,3⁢Q≤Z⁢(log⁡Z)−BF,BF=A3+15,\sum_{q\leq 3Q}\sum_{b\bmod q}^{*}|\Delta_{\xi}(q,b)|^{2}\ll N_{\mathcal{I}}T_% {\mathrm{int}}L^{-A_{3}},\qquad 3Q\leq Z(\log Z)^{-B_{F}},\quad B_{F}=A_{3}+15,

where NℐN_{\mathcal{I}} is the interval mass in Paper I, (3.8).

Lemma 6.5 (Transferred mean-square estimate).
  1. (i)

    If (6.35) holds, then (6.36) holds for every fixed A>0A>0. Here B1⁢(A)B_{1}(A) and the implied constant depend only on AA, BdivB_{\mathrm{div}} and the common constants.

  2. (ii)

    Assume the hypotheses (3.1), (3.2), (3.6), (3.8) with its length condition, (3.11) and (3.25)–(3.27) of Paper I. Then the estimate (6.37) holds uniformly over the parameter boxes and selected factors of Paper I, Theorem 3.2. Hence that theorem holds with this input in place of [3, Theorem 0(a)] at (3.48).

Proof.

(i) Expand Δξ⁢(k,b)\Delta_{\xi}(k,b) in Dirichlet characters modulo kk and pass to primitive characters. For conductors up to a fixed power of log⁡Z\log Z, apply (6.35). Take the auxiliary divisor hh to be the imprimitive part of the modulus. For larger conductors use the multiplicative large sieve inequality. Its elementary proof uses finite Fourier identities and the spacing of reduced fractions. Summing over the moduli gives (i). (ii) If ‖ξ‖22≤Nℐ⁢L−A3−1\|\xi\|_{2}^{2}\leq N_{\mathcal{I}}L^{-A_{3}-1}, the elementary bound in Paper I, (3.48), applies. Otherwise (3.25), with auxiliary divisor d⁢rdr, and (3.26) give (6.35) for ξn=αn⁢1(n,r)=1\xi_{n}=\alpha_{n}1_{(n,r)=1} with divisor exponent one. Also (3.6) gives the modulus range in (6.37). Part (i) then applies. The complete argument is in Appendix  A.2, with its row index in Appendix  B.8. We assert no implication from (6.34) alone to the norm bound. ∎

For the three convolution rows, let

(6.38) D1=H⁢N−σp,D2=Q⁢NwRA+σp/H,σp=10−6,wRA=9/1000,D_{1}=HN^{-\sigma_{\mathrm{p}}},\qquad D_{2}=QN^{w_{\mathrm{RA}}+\sigma_{% \mathrm{p}}}/H,\qquad\sigma_{\mathrm{p}}=10^{-6},\quad w_{\mathrm{RA}}=9/1000,

where N1/3/8≤H≤2⁢N.46+O⁢(1/L)N^{1/3}/8\leq H\leq 2N^{.46+O(1/L)}. A supported modulus has the unique form q=p⁢dq=pd of (6.4). Here pp is the marked prime and dd the squarefree cofactor.

(6.39) r<D1,s<D2,r⁢s=q<Q.r<D_{1},\qquad s<D_{2},\qquad rs=q<Q.
Lemma 6.6 (Deterministic allocation).

For each supported q=p⁢dq=pd, the following rule defines a unique coprime split q=r⁢sq=rs satisfying (6.39). Put pp in rr. Order the cofactor primes exceeding NwRAN^{w_{\mathrm{RA}}} as b1>⋯>bmb_{1}>\cdots>b_{m}. Here m≤(vRA−t0)/wRA=37553/1260<30m\leq(v_{\mathrm{RA}}-t_{0})/w_{\mathrm{RA}}=37553/1260<30. Process them in this order. Put bib_{i} in rr exactly when the current r⁢bi<D1rb_{i}<D_{1}, and put it in ss otherwise. Let rbigr_{\rm big} and sbigs_{\rm big} be the resulting factors. Order the remaining cofactor primes as l1′>⋯>lk′l^{\prime}_{1}>\cdots>l^{\prime}_{k}. Set r0=rbig⁢∏j=1klj′r_{0}=r_{\rm big}\prod_{j=1}^{k}l^{\prime}_{j}. If r0<D1r_{0}<D_{1}, take r=r0r=r_{0}, s=sbigs=s_{\rm big}. Otherwise let j∗j_{*} be the least index for which r0/(l1′⁢⋯⁢lj∗′)<D1r_{0}/(l^{\prime}_{1}\cdots l^{\prime}_{j_{*}})<D_{1}, and take

r=r0/(l1′⁢⋯⁢lj∗′),s=sbig⁢l1′⁢⋯⁢lj∗′.r=r_{0}/(l^{\prime}_{1}\cdots l^{\prime}_{j_{*}}),\qquad s=s_{\rm big}l^{% \prime}_{1}\cdots l^{\prime}_{j_{*}}.

Call the resulting pair SelH⁡(q)=(r,s)\operatorname{Sel}_{H}(q)=(r,s).

Proof.

The marked prime fits, since p<N1/3−ηm<D1p<N^{1/3-\eta_{\rm m}}<D_{1}, even at the fixed lower endpoint H≥N1/3/8H\geq N^{1/3}/8. The accepted big-prime partial products stay below D1D_{1}. Thus rbig<D1r_{\rm big}<D_{1}, and the least index j∗j_{*} exists when needed. Write all cofactor primes in decreasing order as l1>l2>⋯l_{1}>l_{2}>\cdots. The odd cube gates in (6.4) imply

p⁢l1⁢⋯⁢li−1⁢li2<Qfor every ⁢i:pl_{1}\cdots l_{i-1}l_{i}^{2}<Q\qquad\text{for every }i:

For odd ii, drop one factor from the cube gate. For even ii, use the preceding odd gate and li≤li−1l_{i}\leq l_{i-1}.

Suppose r0<D1r_{0}<D_{1}, and let bib_{i} be the last big prime rejected into ss. The rejection test gives r(i)⁢bi≥D1r^{(i)}b_{i}\geq D_{1}. The two-gate inequality then gives

s=sbig=p⁢b1⁢⋯⁢bir(i)≤p⁢b1⁢⋯⁢bi−1⁢bi2D1<QD1<D2.s=s_{\rm big}=\frac{pb_{1}\cdots b_{i}}{r^{(i)}}\leq\frac{pb_{1}\cdots b_{i-1}% b_{i}^{2}}{D_{1}}<\frac{Q}{D_{1}}<D_{2}.

If no big prime is rejected, s=1s=1. In the prefix case, minimality gives r⁢lj∗′≥D1rl^{\prime}_{j_{*}}\geq D_{1}, hence r≥D1⁢N−wRAr\geq D_{1}N^{-w_{\mathrm{RA}}} and

s=q/r<Q⁢NwRA/D1=D2.s=q/r<QN^{w_{\mathrm{RA}}}/D_{1}=D_{2}.

The factors partition the squarefree prime factors of qq. Thus (r,s)=1(r,s)=1, r⁢s=q<Qrs=q<Q, and r<D1r<D_{1}. ∎

Define the exact joint coefficient on each dyadic Cartesian modulus shell by

(6.40) FH⁢(r,s)={Γ⁢(r⁢s),r⁢s⁢ is supported and ⁢SelH⁡(r⁢s)=(r,s),0,otherwise,∑qΓ⁢(q)⁢Φ⁢(q)=∑r,sFH⁢(r,s)⁢Φ⁢(r⁢s),FH⁢(r,s)=∑νcν⁢fν⁢(r)⁢gν⁢(s),|fν|,|gν|≤1,∑ν|cν|≪LCtensor,Ctensor=230+91.\begin{gathered}F_{H}(r,s)=\begin{cases}\Gamma(rs),&rs\text{ is supported and % }\operatorname{Sel}_{H}(rs)=(r,s),\\ 0,&\text{otherwise},\end{cases}\\ \sum_{q}\Gamma(q)\Phi(q)=\sum_{r,s}F_{H}(r,s)\Phi(rs),\\ F_{H}(r,s)=\sum_{\nu}c_{\nu}f_{\nu}(r)g_{\nu}(s),\qquad|f_{\nu}|,|g_{\nu}|\leq 1% ,\qquad\sum_{\nu}|c_{\nu}|\ll L^{C_{\mathrm{tensor}}},\quad C_{\mathrm{tensor}% }=2^{30}+91.\end{gathered}

Here SelH\operatorname{Sel}_{H} is the rule in Lemma 6.6. The expansion is exact on the full Cartesian parent, including zero values off the selected pairs.

Lemma 6.7 (Global tensor for the selector).

The coefficient FHF_{H} has a rank-one expansion satisfying (6.40), with the sharper bound

(6.41) ∑ν|cν|≤4⁢(230−1)⁢(3+L)78≪L79.\sum_{\nu}|c_{\nu}|\leq 4(2^{30}-1)(3+L)^{78}\ll L^{79}.
Proof.

Fix a pair of dyadic shells. A branch fixes the merge order π∈{R,S}m\pi\in\{R,S\}^{m} of the at most 29 big cofactor primes. It also fixes the final large-prime/prefix case. In the prefix case it fixes the parity of the number of factors assigned to ss. There are at most 4⁢∑m=0292m=4⁢(230−1)4\sum_{m=0}^{29}2^{m}=4(2^{30}-1) branches. Within a branch, unary conditions impose squarefreeness, coprimality with 2⁢N2N and the unique marked prime pp in rr. They also impose the bounds P+⁢(r/p)<zsP^{+}(r/p)<z_{s} and P+⁢(s)<zsP^{+}(s)<z_{s}, assigned big-prime counts, r<D1r<D_{1}, s<D2s<D_{2}, and rbig<D1r_{\rm big}<D_{1}. The remaining unary data are the case indicator, the parity of the small-prime count, and the sign Γ⁢(r⁢s)=μ⁢(r⁢s/p)=−μ⁢(r)⁢μ⁢(s)\Gamma(rs)=\mu(rs/p)=-\mu(r)\mu(s).

Every cross-condition is a comparison ϕ⁢(r)<ψ⁢(s)\phi(r)<\psi(s) or its weak counterpart. Let K0K_{0} be the number of distinct values of ϕ\phi on the rr-shell. For ranks 1≤a≤K01\leq a\leq K_{0}, 0≤b≤K00\leq b\leq K_{0}, put M=2⁢K0+1M=2K_{0}+1 and

ct=M−1⁢∑u=0K0e⁢(−t⁢u/M).c_{t}=M^{-1}\sum_{u=0}^{K_{0}}e(-tu/M).

Finite Fourier orthogonality gives the exact separator

(6.42) 𝟏a≤b=∑tmodMct⁢e⁢(t⁢b/M)⁢e⁢(−t⁢a/M),∑tmodM|ct|≤3+log⁡M.\mathbf{1}_{a\leq b}=\sum_{t\bmod M}c_{t}e(tb/M)e(-ta/M),\qquad\sum_{t\bmod M}% |c_{t}|\leq 3+\log M.

Rank ϕ⁢(r)\phi(r) among its shell values, and count the values below ψ⁢(s)\psi(s). Each shell has at most QQ values, so log⁡M≪L\log M\ll L. The cross-comparisons are exactly:

  1. (1)

    the adjacent strict comparisons in the fixed merge order of the big primes (at most 28);

  2. (2)

    for each SS-letter bib_{i}, the greedy rejection test p⁢(∏bj>bi,bj∈rbj)⁢bi≥D1p(\prod_{b_{j}>b_{i},\ b_{j}\in r}b_{j})b_{i}\geq D_{1} (at most 29);

  3. (3)

    the odd cube gates p⁢l1⁢⋯⁢li−1⁢li3<Qpl_{1}\cdots l_{i-1}l_{i}^{3}<Q at odd indices among the big primes (at most 15);

  4. (4)

    the remaining odd cube gates on the small-prime part, grouped by the fixed parity into the two maxima of the rr- and ss-side partial products (two comparisons);

  5. (5)

    in the prefix case, the prefix-order test min⁡P>max⁡Rsmall\min P>\max R_{\rm small} and the least-prefix test r⁢min⁡P≥D1r\min P\geq D_{1} (two comparisons);

  6. (6)

    the support range Q0<r⁢s<QQ_{0}<rs<Q (two comparisons).

There are at most 78 comparisons in total. Once a merge branch is fixed, each displayed test compares an rr-only quantity with an ss-only quantity. The small-prime maxima combine all gates of the same parity and side. The branch conditions are exactly the greedy tests, the cube gates and the least-prefix condition. Hence their union is precisely FHF_{H}. Multiplying the separators in (6.42) gives (6.41). The unary factors remain one-bounded. The bound in (6.41) is per dyadic shell pair. The resulting O⁢(L2)O(L^{2}) shell pairs are absorbed by the chosen logarithmic precision. ∎

For the convolution rows, split s=d⁢ts=dt with P+⁢(d)≤z<P−⁢(t)P^{+}(d)\leq z<P^{-}(t), where z=N1/(log⁡log⁡N)3z=N^{1/(\log\log N)^{3}} and y=N1/log⁡log⁡Ny=N^{1/\log\log N}. The aggregate with d>yd>y is bounded by Rankin’s method. The mean-square modulus in the proof of Lemma 6.8 is k=r⁢dk=rd, not the full qq. Its scale is

(6.43) Q′=D1⁢y=H⁢N−σp+1/log⁡log⁡N,k≤5⁢Q′,Z=⌈2⁢H⌉.Q^{\prime}=D_{1}y=HN^{-\sigma_{\mathrm{p}}+1/\log\log N},\qquad k\leq 5Q^{% \prime},\qquad Z=\lceil 2H\rceil.

The inner factor tt is zz-rough and is removed in L2L^{2}, with cost H2⁢LC/zH^{2}L^{C}/z. No bound for τ⁢(r)\tau(r) and no roughness condition on rr is used. The required range is

(6.44) 5⁢Q′≤Z⁢(log⁡Z)−BF,BF=PMS+15,5Q^{\prime}\leq Z(\log Z)^{-B_{F}},\qquad B_{F}=P_{\mathrm{MS}}+15,

where PMSP_{\mathrm{MS}} is the fixed source-level precision in the supplementary Lemma 6.5(i). This holds since Q′/H=N−σp+o⁢(1)Q^{\prime}/H=N^{-\sigma_{\mathrm{p}}+o(1)}. The full-modulus range 3⁢Q≤Z⁢(log⁡Z)−BF3Q\leq Z(\log Z)^{-B_{F}} is not asserted for these parents.

Lemma 6.8 (Two-factor convolution estimate).

Let N1/3/8≤H≤2⁢N.46+O⁢(1/L)N^{1/3}/8\leq H\leq 2N^{.46+O(1/L)} and H⁢M≍NHM\asymp N. Let ana_{n}, n∼Hn\sim H, be one-bounded, supported on P−⁢(n)>zP^{-}(n)>z, and satisfy (6.34) at the original parent HH, where z=N1/(log⁡log⁡N)3z=N^{1/(\log\log N)^{3}}. Let bmb_{m}, m∼Mm\sim M, be one-bounded. Let U1,V1U_{1},V_{1} be dyadic modulus scales, allowing the singleton scale 1/21/2 for the integer 11, such that

U1≤D1,V1≤D2,U1⁢V1≤NvRA.U_{1}\leq D_{1},\qquad V_{1}\leq D_{2},\qquad U_{1}V_{1}\leq N^{v_{\mathrm{RA}% }}.

Let f⁢(r)f(r), r∼U1r\sim U_{1}, and g⁢(s)g(s), s∼V1s\sim V_{1}, be arbitrary one-bounded arrays. Keep the unary restrictions r<D1r<D_{1}, s<D2s<D_{2}, (r,N)=(s,N)=1(r,N)=(s,N)=1. Neither a pointwise condition r⁢s<Qrs<Q nor a joint condition (r,s)=1(r,s)=1 is imposed on the pair. Then, for every fixed A>0A>0, uniformly in these occupied-parent scales, ff, gg, unary interval cuts of ana_{n} and bmb_{m}, and intervals I⊂[N/8,2⁢N]I\subset[N/8,2N],

(6.45) ∑r,sf⁢(r)⁢g⁢(s)⁢∑n,mn⁢m∈Ian⁢bm⁢𝒦r⁢s⁢(n⁢m)≪AN⁢L−A.\sum_{r,s}f(r)g(s)\sum_{\begin{subarray}{c}n,m\\ nm\in I\end{subarray}}a_{n}b_{m}\mathcal{K}_{rs}(nm)\ll_{A}NL^{-A}.
Proof.

We use the dispersion method of Paper I, Theorem 3.2. It runs on the whole Cartesian shell r∼U1r\sim U_{1}, s∼V1s\sim V_{1}, with residue class Nmodr⁢sN\bmod rs. Its occupied-parent scale conditions are U1≤H⁢N−σpU_{1}\leq HN^{-\sigma_{\mathrm{p}}}, V1≤NvRA+wRA/(H⁢N−σp)V_{1}\leq N^{v_{\mathrm{RA}}+w_{\mathrm{RA}}}/(HN^{-\sigma_{\mathrm{p}}}), and U1⁢V1≤NvRAU_{1}V_{1}\leq N^{v_{\mathrm{RA}}}. The second follows from the displayed bound by D2D_{2} after dropping L−BL^{-B}. The tested sequence is strictly zz-rough. The unary supports carry (r⁢s,N)=1(rs,N)=1 and the individual caps. No pointwise product cap is needed for the rank-one arrays. After Cauchy’s inequality in mm, the split s=d⁢ts=dt above reduces the modulus of the mean square to k=r⁢dk=rd in the range (6.44). The mean square is split at a fixed power of LL below its target. Below it the trivial bound suffices. Above it (6.34) gives (6.35) with a loss of that power, so Lemma 6.5(i) applies. The prime Siegel–Walfisz input is Paper I, (2.21). No joint condition (r,s)=1(r,s)=1 is used, because r,sr,s are not the moduli of Paper I, Theorem 2.8. Write s=d⁢ts=dt as above and k=r⁢dk=rd. A prime p∣(r,s)p\mid(r,s) with p≤zp\leq z divides dd and only enlarges kk. The Chinese remainder step needs only that k,t1,t2k,t_{1},t_{2} are pairwise coprime. The smooth–rough split gives (d,t1⁢t2)=1(d,t_{1}t_{2})=1. A prime p∣(r,s)p\mid(r,s) with p>zp>z divides kk and a rough tit_{i}. Such tuples are the bad type (k,t1⁢t2)>1(k,t_{1}t_{2})>1. If p∣t2p\mid t_{2}, the second progression k⁢t2∣m⁢n2−Nkt_{2}\mid mn_{2}-N places n2n_{2} in one class modulo k⁢pkp. If p∣t1p\mid t_{1} only, exchange the two copies first; the absolute square majorant is symmetric, and the same statement then applies. We therefore remove these tuples before the Chinese remainder step. The cost in the square is ≪M⁢H⁢LC⁢[H/(z⁢K)+1]\ll MHL^{C}[H/(zK)+1]. After the factor K⁢MKM of the first Cauchy step this is ≪N⁢LC⁢(z−1/2+(K/H)1/2)\ll NL^{C}(z^{-1/2}+(K/H)^{1/2}). That is OA⁢(N⁢L−A)O_{A}(NL^{-A}), since z=N1/(log⁡log⁡N)3z=N^{1/(\log\log N)^{3}} and K/H≤N−σp/2K/H\leq N^{-\sigma_{\mathrm{p}}/2}. The zero-mode identity holds for all tuples, including those with gcd failures. After the second Cauchy step, Paper I, Theorem 2.8 bounds the nonzero frequencies. It is applied with rint=t⁢t′r_{\mathrm{int}}=tt^{\prime}, the product of two zz-rough inner variables, and sint=p0s_{\mathrm{int}}=p_{0}, the least prime not dividing NN. Since p0≪log⁡N<zp_{0}\ll\log N<z, (rint,sint)=1(r_{\mathrm{int}},s_{\mathrm{int}})=1, exactly as in Paper I, (3.82)–(3.83). This is the form of Paper I, Theorem 2.8 (Sections 5.3 and 7.4) used here. Its statement allows arbitrary one-bounded f,gf,g with only (r⁢s,N)=1(rs,N)=1. The product restriction n⁢m∈Inm\in I is kept as in Paper I, Theorem 3.2. The finite product partition used there also handles the endpoints. Neither (6.37) at the full modulus 3⁢Q3Q nor a norm-relative consequence of (6.34) for small norms is used. The complete argument is in Appendix  A.3, with its row index in Appendix  B.8. ∎

The central rows use Y=NyY=N^{y}, y=341/5000y=341/5000. Choose the largest divisor s∣ds\mid d with s≤Ys\leq Y. Since p<N1/3−ηmp<N^{1/3-\eta_{\mathrm{m}}} and q=p⁢d>Q0q=pd>Q_{0}, d>Q0/p≫N1/6+ηm⁢L−B0>Yd>Q_{0}/p\gg N^{1/6+\eta_{\mathrm{m}}}L^{-B_{0}}>Y. Hence a next divisor exists. The cube gates control adjacent divisors and give

(6.46) Y⁢qQ<s≤Y,r=q/s<Q/Y.\frac{Yq}{Q}<s\leq Y,\qquad r=q/s<Q/Y.

This allocation keeps a one-bounded joint modulus coefficient. The required central estimate has

(6.47) Hc⁢Mc≍N,N.50≪Hc≪N.54,Q1≪N.4545,Q2≪N.0682.\begin{gathered}H_{\mathrm{c}}M_{\mathrm{c}}\asymp N,\qquad N^{.50}\ll H_{% \mathrm{c}}\ll N^{.54},\\ Q_{1}\ll N^{.4545},\qquad Q_{2}\ll N^{.0682}.\end{gathered}
Lemma 6.9 (Central rectangular distribution).

Let xx be even, Hc⁢Mc≍xH_{\mathrm{c}}M_{\mathrm{c}}\asymp x, and let the bounds in (6.47) hold with NN replaced by xx, with fixed comparison constants. Let an,bma_{n},b_{m} be one-bounded on the complete dyadic rectangle n∼Hc,m∼Mcn\sim H_{\mathrm{c}},m\sim M_{\mathrm{c}}. Let the tested ana_{n} satisfy (6.34) at its original parent. The divisor exponent is fixed, and the constants are uniform at every requested precision. Write

𝒟⁢(q,a)=∑n∼Hc,m∼Mcan⁢bm⁢(1n⁢m≡a⁢(q)−1(n⁢m,q)=1φ⁢(q)).\mathcal{D}(q,a)=\sum_{n\sim H_{\mathrm{c}},m\sim M_{\mathrm{c}}}a_{n}b_{m}% \left(1_{nm\equiv a\ (q)}-\frac{1_{(nm,q)=1}}{\varphi(q)}\right).

Then, for every fixed A>0A>0,

(6.48) ∑r∼Q1max(b,r)=1⁢∑s∼Q2μ⁢(r⁢s)2=1,(r⁢s,x)=1maxamodr⁢s,(a,r⁢s)=1a≡b⁢(r)⁡|𝒟⁢(r⁢s,a)|≪Ax⁢(log⁡x)−A.\sum_{r\sim Q_{1}}\max_{(b,r)=1}\sum_{\begin{subarray}{c}s\sim Q_{2}\\ \mu(rs)^{2}=1,\ (rs,x)=1\end{subarray}}\max_{\begin{subarray}{c}a\bmod rs,\ (a% ,rs)=1\\ a\equiv b\ (r)\end{subarray}}|\mathcal{D}(rs,a)|\ll_{A}x(\log x)^{-A}.

The constant is uniform over these families, rectangles, squarefree modulus supports and unary interval restrictions of ana_{n} and bmb_{m}. All errors are measured at the original parents. One outer residue bb is chosen before ss varies. In the application it is NmodrN\bmod r.

Proof.

This is the rectangular dispersion theorem proved in Appendix  A.4 and indexed in Appendix B.8. The restriction (r⁢s,x)=1(rs,x)=1 only removes nonnegative terms. Its proof opens the inner modulus ss by dispersion with the outer residue fixed. It uses the mean square over all moduli of Lemma 6.5(i), which gives Paper I, (2.17), under its hypothesis (2.16). The supplementary proof applies the mean square twice. The second application is repeated over two correlations. At each application a constant sequence on the same parent is added. Its sign is chosen by the parallelogram identity to make the tested sequence norm-large. The resulting sequence and the constant sequence satisfy (6.35) uniformly. Their squared norms are at most the original parent times a fixed power of LL. Fix the requested logarithmic modulus buffer B1B_{1} first. Then choose the source-level parameter so that the moduli lie in the range of (6.36). Apply part (i) to both sequences, subtract by linearity, and absorb that fixed power by increasing the requested precision. This uses neither part (ii) nor a mean-square conclusion for an arbitrary small-norm sequence from absolute Siegel–Walfisz alone. The other inputs are Paper I, (2.21) (prime Siegel–Walfisz), (2.35) (Weil–Estermann) and Lemma 3.4 (completed hyperbola count). It does not use Paper I, Theorem 2.8. For the four tested arrays of Table 6.1, Lemma 6.4 supplies (6.34) with divisor exponent one. ∎

Lemma 6.9 concerns complete dyadic rectangles and one-bounded sequences. Lemma 6.10 below reduces the four central rows, with their product cuts, to it. The raw exponent checks are

(6.49) 7⁢vRA+5⁢y\displaystyle 7v_{\mathrm{RA}}+5y =3.9999<4,\displaystyle=3.9999<4,
3⁢vRA−y−1\displaystyle 3v_{\mathrm{RA}}-y-1 =.4999<.50,\displaystyle=.4999<.50,
1−vRA+y\displaystyle 1-v_{\mathrm{RA}}+y =.5455>.54.\displaystyle=.5455>.54.

The three margins verify the numerical range only. They do not establish the rectangular-support or family hypotheses for a selected product region.

Product cuts require an additional finite reduction. For e∈IHe\in I_{H}, put

(6.50) w⁢(e)\displaystyle w(e) =2⁢Llog⁡e,\displaystyle=\frac{2L}{\log e},
𝒜⁢(a)⁢ℛ⁢(c)⁢log⁡clog⁡(a⁢c)\displaystyle\mathcal{A}(a)\mathcal{R}(c)\frac{\log c}{\log(ac)} =(𝒜⁢(a)⁢ℛ⁢(c)⁢log⁡c2⁢L)⁢w⁢(a⁢c),\displaystyle=\left(\mathcal{A}(a)\mathcal{R}(c)\frac{\log c}{2L}\right)w(ac),
−𝒞⁢(t)⁢ℛ⁢(c)log⁡(t⁢c)\displaystyle-\frac{\mathcal{C}(t)\mathcal{R}(c)}{\log(tc)} =(−𝒞⁢(t)2⁢L⁢ℛ⁢(c))⁢w⁢(t⁢c),\displaystyle=\left(-\frac{\mathcal{C}(t)}{2L}\mathcal{R}(c)\right)w(tc),
𝒜⁢(a)⁢ℬ⁢(s)log⁡(a⁢s)\displaystyle\frac{\mathcal{A}(a)\mathcal{B}(s)}{\log(as)} =(𝒜⁢(a)⁢ℬ⁢(s)2⁢L)⁢w⁢(a⁢s).\displaystyle=\left(\mathcal{A}(a)\frac{\mathcal{B}(s)}{2L}\right)w(as).

Here log⁡c/(2⁢L)\log c/(2L) is unary, and ‖w‖∞≤2⁢L/(L−log⁡4)=O⁢(1)\|w\|_{\infty}\leq 2L/(L-\log 4)=O(1), and

VarIH⁡(w)=2⁢LL−log⁡4−2⁢LL+log⁡(1−ε)=O⁢(1).\operatorname{Var}_{I_{H}}(w)=\frac{2L}{L-\log 4}-\frac{2L}{L+\log(1-% \varepsilon)}=O(1).

Thus uniform product-prefix estimates restore the exact weights by Stieltjes summation, including the minus sign of T2T_{2}. Use multiplicative cells of relative width L−DmL^{-D_{\mathrm{m}}}. The original-source boundary strips satisfy

(6.51) Estrip≪(N⁢L−Dm/2+N1/2)⁢L15/2.E_{\mathrm{strip}}\ll\bigl{(}NL^{-D_{\mathrm{m}}/2}+N^{1/2}\bigr{)}L^{15/2}.

Each unnormalized source multiplicity is at most 3⁢d⁢(e)3d(e). Cauchy and d⁢(n)4≤d16⁢(n)d(n)^{4}\leq d_{16}(n) give (6.51). Sum the boundary strips before the modulus expansion. For a final saving AA, fix

(6.52) Dm=2⁢A+40,Tsave>A+Ctensor+2⁢Dm+40.D_{\mathrm{m}}=2A+40,\qquad T_{\mathrm{save}}>A+C_{\mathrm{tensor}}+2D_{% \mathrm{m}}+40.

Then fix every Siegel–Walfisz and half-level precision. Choose the common threshold last.

Lemma 6.10 (Product-region reduction for the central rows).

Fix A>0A>0 and choose DmD_{\mathrm{m}} and TsaveT_{\mathrm{save}} as in (6.52). Take one of the four central rows of Table 6.1. Keep its unary cuts, its normalized arrays from (6.50) and the coefficient Γ\Gamma. For N/4<u≤(1−ε)⁢NN/4<u\leq(1-\varepsilon)N let 𝒮⁢(u)\mathcal{S}(u) be its normalized discrepancy sum over N/4<n⁢m≤uN/4<nm\leq u, without the factor ww. Then

(6.53) supN/4<u≤(1−ε)⁢N|𝒮⁢(u)|≪AN⁢L−A,\sup_{N/4<u\leq(1-\varepsilon)N}|\mathcal{S}(u)|\ll_{A}NL^{-A},

and the same bound holds for the sum over n⁢m∈IHnm\in I_{H} with the factor w⁢(n⁢m)w(nm).

Proof.

Selector. Let q=p⁢dq=pd be supported, with the primes of dd in decreasing order ℓ1>⋯>ℓk\ell_{1}>\cdots>\ell_{k}. As in the proof of Lemma 6.6, the cube gates give p⁢ℓ1⁢⋯⁢ℓi−1⁢ℓi2<Qp\ell_{1}\cdots\ell_{i-1}\ell_{i}^{2}<Q for every ii, hence

ℓiℓi+1⁢⋯⁢ℓk<Qq(1≤i≤k).\frac{\ell_{i}}{\ell_{i+1}\cdots\ell_{k}}<\frac{Q}{q}\qquad(1\leq i\leq k).

Consecutive divisors of a squarefree dd have ratio at most maxi⁡ℓi/(ℓi+1⁢⋯⁢ℓk)\max_{i}\ell_{i}/(\ell_{i+1}\cdots\ell_{k}). Write d=ℓ1⁢Md=\ell_{1}M. The divisors of dd form the two chains 𝒟⁢(M)\mathcal{D}(M) and ℓ1⁢𝒟⁢(M)\ell_{1}\mathcal{D}(M). If ℓ1>M\ell_{1}>M, the only new gap is ℓ1/M\ell_{1}/M. If ℓ1≤M\ell_{1}\leq M, the ranges [1,M][1,M] and [ℓ1,ℓ1⁢M][\ell_{1},\ell_{1}M] overlap. A gap of the union below MM lies inside a gap of 𝒟⁢(M)\mathcal{D}(M). One above MM lies inside a gap of ℓ1⁢𝒟⁢(M)\ell_{1}\mathcal{D}(M). Induction on kk gives the claim. Since d>Yd>Y, the largest divisor s≤Ys\leq Y of dd has a successor s′>Ys^{\prime}>Y with s′/s<Q/qs^{\prime}/s<Q/q. This proves (6.46). The pair (r,s)(r,s) is determined by qq, and q=r⁢sq=rs. Put F⁢(r,s)=Γ⁢(r⁢s)F(r,s)=\Gamma(rs) on selected pairs and F⁢(r,s)=0F(r,s)=0 otherwise. This coefficient is one-bounded and supported on squarefree r⁢srs with (r⁢s,2⁢N)=1(rs,2N)=1. Its dyadic shells satisfy Q1≪NvRA−yQ_{1}\ll N^{v_{\mathrm{RA}}-y} and Q2≪NyQ_{2}\ll N^{y}, where vRA−y=909/2000v_{\mathrm{RA}}-y=909/2000 and y=341/5000y=341/5000. There are O⁢(L2)O(L^{2}) shell pairs.

Parents. In the first central T2T_{2} row the tested variable and array are n=tn=t and 𝒞⁢(t)/(2⁢L)\mathcal{C}(t)/(2L). In the second they are n=cn=c and ℛ⁢(c)\mathcal{R}(c). In the central TIIT_{\mathrm{II}} rows they are n=sn=s and ℬ⁢(s)/(2⁢L)\mathcal{B}(s)/(2L) in the first. In the second they are n=an=a and 𝒜⁢(a)\mathcal{A}(a). The other variable carries the remaining one-bounded array, with the sign of T2T_{2}. On IHI_{H}, every relevant pair of dyadic parents has Hc⁢Mc≍NH_{\mathrm{c}}M_{\mathrm{c}}\asymp N and N.50≪Hc≪N.54N^{.50}\ll H_{\mathrm{c}}\ll N^{.54} with fixed constants. There are O⁢(L2)O(L^{2}) such pairs. Lemma 6.4 gives (6.34) for the tested arrays at these parents.

Restriction. Let ana_{n} be a tested array on its parent and JJ an interval. On the same parent, an⁢𝟏J⁢(n)a_{n}\mathbf{1}_{J}(n) satisfies Δa⁢𝟏J⁢(I;k,b;h)=Δa⁢(I∩J;k,b;h)\Delta_{a\mathbf{1}_{J}}(I;k,b;h)=\Delta_{a}(I\cap J;k,b;h) for every interval II. It therefore satisfies (6.34) with the same constants, measured at the original parent. The other array may be restricted to any interval.

Mesh. Put δ=L−Dm\delta=L^{-D_{\mathrm{m}}}. Divide each parent into O⁢(δ−1)O(\delta^{-1}) intervals with endpoint ratio at most 1+δ1+\delta. All unary cut points of the row are endpoints. For fixed uu, call a cell complete if it lies inside {N/4<n⁢m≤u}\{N/4<nm\leq u\}. Any other cell meeting this region has all its products within a factor (1+δ)2(1+\delta)^{2} of N/4N/4 or of uu. The part of the region it covers lies in the set ℰu\mathcal{E}_{u} of integers e∈(N/4,(1−ε)⁢N]e\in(N/4,(1-\varepsilon)N] with |e−N/4|≤3⁢δ⁢N|e-N/4|\leq 3\delta N or |e−u|≤3⁢δ⁢N|e-u|\leq 3\delta N. Here #⁢ℰu≪δ⁢N+1\#\mathcal{E}_{u}\ll\delta N+1. For a complete cell apply Lemma 6.9 with x=Nx=N, saving TsaveT_{\mathrm{save}}, the restricted arrays, b=Nmodrb=N\bmod r and a=Nmodr⁢sa=N\bmod rs. Both classes are reduced since (r⁢s,N)=1(rs,N)=1, and a≡b(modr)a\equiv b\pmod{r}. Thus

|∑r,sF⁢(r,s)⁢𝒟cell⁢(r⁢s,N)|≤∑r∼Q1max(b,r)=1⁢∑s∼Q2μ⁢(r⁢s)2=1,(r⁢s,N)=1maxamodr⁢sa≡b⁢(r)(a,r⁢s)=1⁡|𝒟cell⁢(r⁢s,a)|≪TsaveN⁢L−Tsave.\Bigl{|}\sum_{r,s}F(r,s)\mathcal{D}_{\mathrm{cell}}(rs,N)\Bigr{|}\leq\sum_{r% \sim Q_{1}}\max_{(b,r)=1}\sum_{\begin{subarray}{c}s\sim Q_{2}\\ \mu(rs)^{2}=1,\ (rs,N)=1\end{subarray}}\max_{\begin{subarray}{c}a\bmod rs\\ a\equiv b\ (r)\\ (a,rs)=1\end{subarray}}|\mathcal{D}_{\mathrm{cell}}(rs,a)|\ll_{T_{\mathrm{save% }}}NL^{-T_{\mathrm{save}}}.

There are O⁢(L2⁢Dm+4)O(L^{2D_{\mathrm{m}}+4}) choices of cell and shell pair, so the complete cells contribute O⁢(N⁢L−Tsave+2⁢Dm+4)O(NL^{-T_{\mathrm{save}}+2D_{\mathrm{m}}+4}).

Strips. Sum the incomplete cells together before expanding the modulus coefficient. For fixed ee, the factorizations e=n⁢me=nm in the row carry total normalized weight at most d⁢(e)d(e). Also (6.26) bounds the modulus sum by d⁢(N−e)+O⁢(L)d(N-e)+O(L). Their contribution is therefore

≪∑e∈ℰud⁢(e)⁢{d⁢(N−e)+L}≪(#⁢ℰu)1/2⁢N1/2⁢L15/2≪(N⁢δ1/2+N1/2)⁢L15/2,\ll\sum_{e\in\mathcal{E}_{u}}d(e)\{d(N-e)+L\}\ll(\#\mathcal{E}_{u})^{1/2}N^{1/% 2}L^{15/2}\ll\bigl{(}N\delta^{1/2}+N^{1/2}\bigr{)}L^{15/2},

by Cauchy’s inequality twice, d⁢(n)4≤d16⁢(n)d(n)^{4}\leq d_{16}(n) and ∑n≤Nd16⁢(n)≪N⁢L15\sum_{n\leq N}d_{16}(n)\ll NL^{15}. This is (6.51).

Conclusion. With Dm=2⁢A+40D_{\mathrm{m}}=2A+40 and Tsave>A+Ctensor+2⁢Dm+40T_{\mathrm{save}}>A+C_{\mathrm{tensor}}+2D_{\mathrm{m}}+40, the two contributions are O⁢(N⁢L−A−Ctensor−36)O(NL^{-A-C_{\mathrm{tensor}}-36}) and O⁢(N⁢L−A−25/2+N1/2⁢L15/2)O(NL^{-A-25/2}+N^{1/2}L^{15/2}), uniformly in uu. This proves (6.53). Since ‖w‖∞+VarIH⁡(w)=O⁢(1)\|w\|_{\infty}+\operatorname{Var}_{I_{H}}(w)=O(1), Stieltjes summation against 𝒮\mathcal{S} gives the weighted bound, with the sign of T2T_{2} kept. ∎

6.5. The main coefficient

For primes ℓ∤2⁢N\ell\nmid 2N, set gN⁢(ℓ)=1/(ℓ−1)g_{N}(\ell)=1/(\ell-1), and put gN⁢(ℓ)=0g_{N}(\ell)=0 for ℓ∣2⁢N\ell\mid 2N. Extend gNg_{N} multiplicatively to squarefree integers, with gN⁢(ℓj)=0g_{N}(\ell^{j})=0 for j≥2j\geq 2. For primes e≡N(modp)e\equiv N\pmod{p} in the fixed reduced class modulo pp, and primes ℓ∤2⁢N⁢p\ell\nmid 2Np, the condition ℓ∣(N−e)/p\ell\mid(N-e)/p has density 1/φ⁢(ℓ)=gN⁢(ℓ)1/\varphi(\ell)=g_{N}(\ell). Put

(6.54) VN⁢(zs)=∏2<ℓ<zsℓ∤N(1−1ℓ−1)=2⁢e−γ⁢C⁢(N)α⁢L⁢(1+o⁢(1)),V_{N}(z_{s})=\prod_{\begin{subarray}{c}2<\ell<z_{s}\\ \ell\nmid N\end{subarray}}\left(1-\frac{1}{\ell-1}\right)=\frac{2e^{-\gamma}C(% N)}{\alpha L}(1+o(1)),

with C⁢(N)C(N) as in Paper II, (1.2). For a marked prime p∈NKp\in N^{K} and a level RR, put D=R/pD=R/p and sp=log⁡D/(α⁢L)s_{p}=\log D/(\alpha L). Let P=PN⁢(zs)P=P_{N}(z_{s}) be the product of the primes ℓ<zs\ell<z_{s} with ℓ∤2⁢N\ell\nmid 2N.

Lemma 6.11 (Upper-sieve application).
  1. (a)

    The comparison (6.9) holds.

  2. (b)

    There is an absolute constant KdimK_{\mathrm{dim}} such that, for every even NN,

    (6.55) ∏w≤ℓ<z(1−gN⁢(ℓ))−1≤log⁡zlog⁡w⁢(1+Kdimlog⁡w)(z>w≥2).\prod_{w\leq\ell<z}(1-g_{N}(\ell))^{-1}\leq\frac{\log z}{\log w}\left(1+\frac{% K_{\mathrm{dim}}}{\log w}\right)\quad(z>w\geq 2).
  3. (c)

    For the three pairs (R,K)∈{(RL,J),(Rtail,Jtail),(Q,Jt)}(R,K)\in\{(R_{L},J),(R_{\mathrm{tail}},J_{\mathrm{tail}}),(Q,J_{t})\}, uniformly in the mark and in even NN,

    (6.56) ∑d∣Pμd+⁢(R/p)φ⁢(d)≤VN⁢(zs)⁢{F⁢(sp)+O⁢(L−1/3)},\sum_{d\mid P}\frac{\mu_{d}^{+}(R/p)}{\varphi(d)}\leq V_{N}(z_{s})\{F(s_{p})+O% (L^{-1/3})\},

    and, with R=Nr⁢L−BrR=N^{r}L^{-B_{r}},

    (6.57) ∑qcR,K⁢(q)φ⁢(q)≤2⁢e−γ⁢C⁢(N)α⁢L⁢{∫KF⁢(r−tα)⁢d⁢tt+o⁢(1)}.\sum_{q}\frac{c_{R,K}(q)}{\varphi(q)}\leq\frac{2e^{-\gamma}C(N)}{\alpha L}% \left\{\int_{K}F\left(\frac{r-t}{\alpha}\right)\frac{dt}{t}+o(1)\right\}.
Proof.

We use Iwaniec’s upper bound for the linear sieve [13]. Let 𝒜\mathcal{A} be a finite sequence and D>1D>1 a level. Let P⁢(z)P(z) be the product of the sifting primes below zz. The upper weight μd+\mu_{d}^{+} of [13, p. 313] is (−1)k(-1)^{k} when d=ℓ1⁢⋯⁢ℓk∣P⁢(z)d=\ell_{1}\cdots\ell_{k}\mid P(z), ℓ1>⋯>ℓk\ell_{1}>\cdots>\ell_{k}, and ℓ1⁢⋯⁢ℓ2⁢l⁢ℓ2⁢l+13<D\ell_{1}\cdots\ell_{2l}\ell_{2l+1}^{3}<D for every 0≤l≤(k−1)/20\leq l\leq(k-1)/2. Otherwise it is 0. With j=2⁢l+1j=2l+1 these are the gates of (6.3), so (6.3) is this weight on d∣Pd\mid P. By the definition of W+W^{+} [13, p. 310] and Lemma 2 there [13, p. 313],

∑d∣P⁢(z)μd+⁢|𝒜d|=W+≥S⁢(𝒜,P,z)\sum_{d\mid P(z)}\mu_{d}^{+}|\mathcal{A}_{d}|=W^{+}\geq S(\mathcal{A},P,z)

for every D>1D>1, since W+W^{+} is S⁢(𝒜,P,z)S(\mathcal{A},P,z) plus nonnegative sifted counts. If the density satisfies (6.55) with a constant KK and z≤Dz\leq D, Lemma 3, (12), of [13, p. 313] gives, with s=log⁡D/log⁡zs=\log D/\log z,

∑d∣P⁢(z)μd+⁢g⁢(d)≤V⁢(z)⁢{F⁢(s)+O⁢(eK−s⁢(log⁡D)−1/3)}.\sum_{d\mid P(z)}\mu_{d}^{+}g(d)\leq V(z)\{F(s)+O(e^{\sqrt{K}-s}(\log D)^{-1/3% })\}.

(a) Let ee be a prime in one of the pieces (6.7) and pp a mark with p⁢m=N−epm=N-e. If P−⁢(m)≥zsP^{-}(m)\geq z_{s}, then (m,P)=1(m,P)=1. The inequality W+≥SW^{+}\geq S for the one-term sequence {m}\{m\} at level D=R/pD=R/p gives

(6.58) ∑d∣Pd∣mμd+⁢(D)≥𝟏(m,P)=1≥𝟏P−⁢(m)≥zs.\sum_{\begin{subarray}{c}d\mid P\\ d\mid m\end{subarray}}\mu_{d}^{+}(D)\geq\mathbf{1}_{(m,P)=1}\geq\mathbf{1}_{P^% {-}(m)\geq z_{s}}.

This holds for every D>1D>1, in particular when sp=383/200<2s_{p}=383/200<2. Omitting (m,N⁢p)=1(m,Np)=1 in (6.2) only enlarges the count. The condition d∣md\mid m is e≡N(modp⁢d)e\equiv N\pmod{pd}, and cR,K⁢(p⁢d)=μd+⁢(R/p)c_{R,K}(pd)=\mu_{d}^{+}(R/p) by (6.5). The pieces (6.7) partition [2,(1−ε)⁢N)×J[2,(1-\varepsilon)N)\times J. The point e=N/4e=N/4 lies in ILI_{L} and t=1/3−ηmt=1/3-\eta_{\mathrm{m}} lies in JtailJ_{\mathrm{tail}}. Summing (6.58) over ee and pp, each mark with its multiplicity, gives S6≤AmixS_{6}\leq A_{\mathrm{mix}} by (6.8).

(b) For odd ℓ\ell,

(1−1ℓ−1)−1=(1−1ℓ)−1⁢(1−1(ℓ−1)2)−1.\Bigl{(}1-\frac{1}{\ell-1}\Bigr{)}^{-1}=\Bigl{(}1-\frac{1}{\ell}\Bigr{)}^{-1}% \Bigl{(}1-\frac{1}{(\ell-1)^{2}}\Bigr{)}^{-1}.

The factors with ℓ∣2⁢N\ell\mid 2N equal one. Omitting them only lowers the product. Mertens’ theorem, with its uniform error term, bounds the product of the first factors over w≤ℓ<zw\leq\ell<z by (log⁡z/log⁡w)⁢(1+K1/log⁡w)(\log z/\log w)(1+K_{1}/\log w). The product of the second factors over ℓ≥max⁡(w,3)\ell\geq\max(w,3) is at most 1+K2/log⁡w1+K_{2}/\log w. The constants K1,K2K_{1},K_{2} are absolute. This gives (6.55) with one KdimK_{\mathrm{dim}}, independent of NN and of ω⁢(N)\omega(N).

(c) The limiting ranges of sps_{p} for the three pairs are

(383200,126394480],(383200,19161491000000],(544243250000,4314839714000000],\Bigl{(}\frac{383}{200},\frac{12639}{4480}\Bigr{]},\qquad\Bigl{(}\frac{383}{20% 0},\frac{1916149}{1000000}\Bigr{]},\qquad\Bigl{(}\frac{544243}{250000},\frac{4% 3148397}{14000000}\Bigr{]},

all inside [383/200,3.083)⊂(1,∞)[383/200,3.083)\subset(1,\infty). The factors L−BrL^{-B_{r}} move sps_{p} by O⁢(log⁡L/L)O(\log L/L). Hence zs≤Dz_{s}\leq D and log⁡D≍L\log D\asymp L for N≥N0⁢(Br)N\geq N_{0}(B_{r}). Then (12) gives (6.56), with an error O⁢(L−1/3)O(L^{-1/3}) uniform in the mark, the pair and NN. For (6.54), use the factorization in (b) for odd ℓ<zs\ell<z_{s} and restore the factors with ℓ∣N\ell\mid N. The primes ℓ∣N\ell\mid N with ℓ≥zs\ell\geq z_{s} number at most 1/α1/\alpha and change the product by a factor 1+O⁢(1/zs)1+O(1/z_{s}). By (6.5),

∑qcR,K⁢(q)φ⁢(q)=∑p∈NKp∤N1p−1⁢∑d∣Pμd+⁢(R/p)φ⁢(d).\sum_{q}\frac{c_{R,K}(q)}{\varphi(q)}=\sum_{\begin{subarray}{c}p\in N^{K}\\ p\nmid N\end{subarray}}\frac{1}{p-1}\sum_{d\mid P}\frac{\mu_{d}^{+}(R/p)}{% \varphi(d)}.

The outer weights are positive, so (6.56) may be summed termwise. Since FF is Lipschitz on the compact range above, the prime number theorem and partial summation give (6.57). Marks dividing NN number at most 1/t01/t_{0}, and endpoint atoms and the logarithmic buffers contribute o⁢(1)o(1). ∎

The delayed branch sp>3s_{p}>3 of FF occurs only for ctrimc_{\mathrm{trim}}, when t<tRAt<t_{\mathrm{RA}}, where tRA=vRA−3⁢αt_{\mathrm{RA}}=v_{\mathrm{RA}}-3\alpha.

Define

(6.59) JK⁢(r)=12⁢eγ⁢α⁢∫KF⁢(r−tα)⁢d⁢tt.J_{K}(r)=\frac{1}{2e^{\gamma}\alpha}\int_{K}F\left(\frac{r-t}{\alpha}\right)% \frac{dt}{t}.

The rational endpoint J¯6\overline{J}_{6} is as in Paper II [27, (A.13)]:

(6.60) J¯6=131485819591573215335132472767822853107587704688862376195851058,JJ⁢(1/2)=2⁢log⁡(110/57)≤J¯6.\begin{gathered}\overline{J}_{6}=\frac{131485819591573215335132472767822853107% 58770468886237619585}{10^{58}},\\ J_{J}(1/2)=2\log(110/57)\leq\overline{J}_{6}.\end{gathered}

The inequality is certified by outward interval evaluation. No central approximation is rounded. Since W=4⁢(1−ε)⁢C⁢(N)⁢N/L2W=4(1-\varepsilon)C(N)N/L^{2}, the interval masses give

(6.61) MmixW\displaystyle\frac{M_{\mathrm{mix}}}{W} ≤wL⁢JJ⁢(1/2)+wH⁢{JJtail⁢(1/2)+JJt⁢(vRA)}+o⁢(1),\displaystyle\leq w_{L}J_{J}(1/2)+w_{H}\{J_{J_{\mathrm{tail}}}(1/2)+J_{J_{t}}(% v_{\mathrm{RA}})\}+o(1),
wL\displaystyle w_{L} =25009999,wH=74999999.\displaystyle=\frac{2500}{9999},\qquad w_{H}=\frac{7499}{9999}.

Here wL+wH=1w_{L}+w_{H}=1. No mark multiplicity or singular-series factor is suppressed.

On JtailJ_{\mathrm{tail}}, the explicit upper-sieve formula gives

(6.62) 0\displaystyle 0 ≤wH⁢{JJtail⁢(1/2)−JJtail⁢(vRA)}\displaystyle\leq w_{H}\{J_{J_{\mathrm{tail}}}(1/2)-J_{J_{\mathrm{tail}}}(v_{% \mathrm{RA}})\}
=wH⁢∫1/3−ηm1/3vRA−1/2t⁢(1/2−t)⁢(vRA−t)⁢𝑑t\displaystyle=w_{H}\int_{1/3-\eta_{\mathrm{m}}}^{1/3}\frac{v_{\mathrm{RA}}-1/2% }{t(1/2-t)(v_{\mathrm{RA}}-t)}\,dt
≤wH⁢ηm⁢(vRA−1/2)(1/3)⁢(1/2−1/3)⁢(vRA−1/3)\displaystyle\leq\frac{w_{H}\eta_{\mathrm{m}}(v_{\mathrm{RA}}-1/2)}{(1/3)(1/2-% 1/3)(v_{\mathrm{RA}}-1/3)}
=:dm=510681931557955000.\displaystyle=:d_{\mathrm{m}}=\frac{5106819}{31557955000}.

The last integrand is increasing on this interval. Put

(6.63) 𝔤RA=wH⁢{JJ⁢(1/2)−JJ⁢(vRA)}−dm.\mathfrak{g}_{\mathrm{RA}}=w_{H}\{J_{J}(1/2)-J_{J}(v_{\mathrm{RA}})\}-d_{% \mathrm{m}}.

Combining (6.61) with (6.60) gives

(6.64) MmixW≤J¯6−𝔤RA+o⁢(1).\frac{M_{\mathrm{mix}}}{W}\leq\overline{J}_{6}-\mathfrak{g}_{\mathrm{RA}}+o(1).

The remaining integral is elementary. The linear-sieve functions FF and ff are as in [14, (1.8)–(1.9), pp. 172–173]. Set tRA=vRA−3⁢αt_{\mathrm{RA}}=v_{\mathrm{RA}}-3\alpha. On the ranges here,

(6.65) F⁢(s)2⁢eγ={1/s,1≤s≤3,1s⁢{1+∫2s−1log⁡(ξ−1)ξ⁢𝑑ξ},3<s<5.\frac{F(s)}{2e^{\gamma}}=\begin{cases}1/s,&1\leq s\leq 3,\\[2.0pt] \displaystyle\frac{1}{s}\left\{1+\int_{2}^{s-1}\frac{\log(\xi-1)}{\xi}\,d\xi% \right\},&3<s<5.\end{cases}

This is the linear-sieve normalization [14, p. 202][26, (2.23)]. Write the delayed contribution as

(6.66) ℐRA=∫t0tRAd⁢tt⁢(vRA−t)⁢∫2(vRA−t)/α−1log⁡(ξ−1)ξ⁢𝑑ξ.\mathcal{I}_{\mathrm{RA}}=\int_{t_{0}}^{t_{\mathrm{RA}}}\frac{dt}{t(v_{\mathrm% {RA}}-t)}\int_{2}^{(v_{\mathrm{RA}}-t)/\alpha-1}\frac{\log(\xi-1)}{\xi}\,d\xi.

Substitution gives

(6.67) 𝔤RA+dm=wH{\displaystyle\mathfrak{g}_{\mathrm{RA}}+d_{\mathrm{m}}=w_{H}\Bigg{\{} ∫t01/3(1t⁢(1/2−t)−1t⁢(vRA−t))⁢𝑑t\displaystyle\int_{t_{0}}^{1/3}\left(\frac{1}{t(1/2-t)}-\frac{1}{t(v_{\mathrm{% RA}}-t)}\right)dt
−ℐRA}.\displaystyle-\mathcal{I}_{\mathrm{RA}}\Bigg{\}}.

Swap the order in (6.66) to obtain

(6.68) ℐRA\displaystyle\mathcal{I}_{\mathrm{RA}} =1vRA⁢∫3smaxh⁢(ζ)⁢𝑑ζ,smax=vRA−t0α,\displaystyle=\frac{1}{v_{\mathrm{RA}}}\int_{3}^{s_{\max}}h(\zeta)\,d\zeta,% \qquad s_{\max}=\frac{v_{\mathrm{RA}}-t_{0}}{\alpha},
h⁢(ζ)\displaystyle h(\zeta) =log⁡(ζ−2)ζ−1⁢log⁡(vRA−α⁢ζ)⁢(vRA−t0)α⁢ζ⁢t0.\displaystyle=\frac{\log(\zeta-2)}{\zeta-1}\log\frac{(v_{\mathrm{RA}}-\alpha% \zeta)(v_{\mathrm{RA}}-t_{0})}{\alpha\zeta t_{0}}.

For n=20000n=20000, set d=(smax−3)/nd=(s_{\max}-3)/n. The composite midpoint sum has error at most

|∫3smaxh⁢(ζ)⁢𝑑ζ−d⁢∑j=0n−1h⁢(3+(j+1/2)⁢d)|≤(smax−3)⁢d224⁢sup|h′′|.\left|\int_{3}^{s_{\max}}h(\zeta)\,d\zeta-d\sum_{j=0}^{n-1}h(3+(j+1/2)d)\right% |\leq\frac{(s_{\max}-3)d^{2}}{24}\sup|h^{\prime\prime}|.

Directed interval differentiation on 400400 covering boxes gives sup|h′′|≤0.720711111\sup|h^{\prime\prime}|\leq 0.720711111. An independent directed-interval replay encloses 𝔤RA\mathfrak{g}_{\mathrm{RA}} in [0.09895983533531812,0.09895983533543704][0.09895983533531812,0.09895983533543704]. Outward rounding therefore gives

(6.69) 0.0989598353353≤𝔤RA≤0.0989598353355.0.0989598353353\leq\mathfrak{g}_{\mathrm{RA}}\leq 0.0989598353355.

Thus we may use the certified rational floor

(6.70) gRA,lo=9895983531010=0.0989598353,𝔤RA≥gRA,lo.g_{\mathrm{RA,lo}}=\frac{989598353}{10^{10}}=0.0989598353,\qquad\mathfrak{g}_{% \mathrm{RA}}\geq g_{\mathrm{RA,lo}}.

The exact integral 𝔤RA\mathfrak{g}_{\mathrm{RA}} and its certified floor gRA,log_{\mathrm{RA,lo}} are distinct.

Proposition 6.12 (Sixth-sum source applications).

On the exact arrays above, the following hold.

  1. (1)

    The comparison (6.9), and the density bound (6.57) for the three pairs (R,K)(R,K).

  2. (2)

    The three low discrepancy bounds (6.20).

  3. (3)

    For every fixed A>0A>0, each of the nine rows of Table 6.1, with its exact weight, is OA⁢(N⁢L−A)O_{A}(NL^{-A}). Consequently the high-coefficient estimate (6.27) holds.

Proof.

Items 1 and 2 are Lemmas 6.11 and 6.1. For item 3 fix AA. Choose in this order: Dm=2⁢A+40D_{\mathrm{m}}=2A+40; Tsave>A+Ctensor+2⁢Dm+40T_{\mathrm{save}}>A+C_{\mathrm{tensor}}+2D_{\mathrm{m}}+40; the saving A+CtensorA+C_{\mathrm{tensor}} in Lemma 6.8 and the saving TsaveT_{\mathrm{save}} in Lemma 6.9. Then fix the Siegel–Walfisz precisions that these require, the buffers (6.19) and BB, and the constant KdimK_{\mathrm{dim}}. Choose the common threshold last. The rows partition T1+T2+TIIT_{1}+T_{2}+T_{\mathrm{II}}: T1T_{1} is all of a≤Ua\leq U. The sums T2T_{2} in cc and TIIT_{\mathrm{II}} in a>Ua>U are split at N.46N^{.46}, N.50N^{.50} and N.54N^{.54}. Each boundary goes to the interval on its right.

Direct rows. These are T1T_{1} and the part of T2T_{2} with c≥N.54c\geq N^{.54}. Fix the outer variable aa, respectively tt. Terms with (a,q)>1(a,q)>1, respectively (t,q)>1(t,q)>1, vanish in 𝒦q\mathcal{K}_{q}. Otherwise 𝒦q⁢(a⁢c)\mathcal{K}_{q}(ac) is the kernel of (6.28) for cc in the reduced class N⁢a¯modqN\bar{a}\bmod q, and similarly for tt. The parent is H=N/aH=N/a, respectively H=N/tH=N/t. The free variable runs over H/4<c<(1−ε)⁢HH/4<c<(1-\varepsilon)H, intersected with c≥N.54c\geq N^{.54} in the T2T_{2}-row and with any prefix cut. This interval lies in (0,2⁢H](0,2H]. Condition (W1) holds. For a≤Ua\leq U we have N2/3≤H≤NN^{2/3}\leq H\leq N. If the right T2T_{2}-row is nonempty, then N.54<N/t=H≤NN^{.54}<N/t=H\leq N, since N.54≤c<(1−ε)⁢N/tN^{.54}\leq c<(1-\varepsilon)N/t. Thus Lemma 6.2 applies with this HH. (Equivalently, split at H/2H/2 into (H/4,H/2](H/4,H/2] and (H/2,(1−ε)⁢H)(H/2,(1-\varepsilon)H). Each lies inside a dyadic parent (H′,2⁢H′](H^{\prime},2H^{\prime}] with H′∈{H/4,H/2}≥N.54/4H^{\prime}\in\{H/4,H/2\}\geq N^{.54}/4. This only doubles the constant.) The weights log⁡c/log⁡(a⁢c)\log c/\log(ac) and 𝒞⁢(t)/log⁡(t⁢c)\mathcal{C}(t)/\log(tc) are bounded and monotone in cc. Partial summation and (6.31) with Tsave>A+2T_{\mathrm{save}}>A+2 bound both rows by O⁢(N⁢L−A)O(NL^{-A}).

Convolution rows. These are T2T_{2} with c<N.46c<N^{.46} (tested ℛ⁢(c)\mathcal{R}(c), c>N1/3/4c>N^{1/3}/4), TIIT_{\mathrm{II}} with a<N.46a<N^{.46} (tested 𝒜⁢(a)\mathcal{A}(a), a>N1/3a>N^{1/3}), and TIIT_{\mathrm{II}} with a≥N.54a\geq N^{.54} (tested ℬ⁢(s)/(2⁢L)\mathcal{B}(s)/(2L), N1/3<s<2⁢N.46+O⁢(1/L)N^{1/3}<s<2N^{.46+O(1/L)}). Each tested array contains the strict roughness factor ℛ⁢(n)=1P−⁢(n)>z\mathcal{R}(n)=1_{P^{-}(n)>z}. This is explicit for ℛ⁢(c)\mathcal{R}(c). It follows from 𝒜⁢(a)=μ⁢(a)⁢ℛ⁢(a)\mathcal{A}(a)=\mu(a)\mathcal{R}(a) and from ℬ⁢(s)=ℛ⁢(s)⁢∑b⁢∣s,b>⁢VΛ⁢(b)\mathcal{B}(s)=\mathcal{R}(s)\sum_{b\mid s,\ b>V}\Lambda(b). Lemma 6.4 gives (6.34) on these original parents. Write ∑qΓ⁢(q)⁢Φ⁢(q)=∑r,sFH⁢(r,s)⁢Φ⁢(r⁢s)\sum_{q}\Gamma(q)\Phi(q)=\sum_{r,s}F_{H}(r,s)\Phi(rs) as in (6.40). Lemma 6.6 places the joint support in (6.39). Discard a dyadic shell pair r∼U1r\sim U_{1}, s∼V1s\sim V_{1} if FHF_{H} vanishes identically there. Otherwise a supported pair in it satisfies U1⁢V1<r⁢s<QU_{1}V_{1}<rs<Q, U1<D1U_{1}<D_{1}, and V1<D2V_{1}<D_{2}. Hence this occupied shell satisfies all scale conditions of Lemma 6.8. Lemma 6.7 expands FHF_{H} on the whole Cartesian shell into rank-one terms with ∑ν|cν|≪L79\sum_{\nu}|c_{\nu}|\ll L^{79}. The unary caps and coprimality are kept. Each rank-one term is estimated on that whole shell. Its factors need not preserve the joint condition r⁢s<Qrs<Q or the condition (r,s)=1(r,s)=1, since Lemma 6.8 imposes neither. Apply Lemma 6.8 with saving A+CtensorA+C_{\mathrm{tensor}} to each term on each occupied shell pair and each product prefix I=(N/4,u]I=(N/4,u]. Since Ctensor≥83C_{\mathrm{tensor}}\geq 83, the total is O⁢(N⁢L−A)O(NL^{-A}), uniformly in uu. The factor ww is then restored by Stieltjes summation, as in (6.50).

Central rows. The four central rows are bounded by Lemma 6.10.

Proper powers. By (6.25) and (6.26), PIH⁢(Γ)=T1+T2+TII+O⁢(N1/2+ν⁢L2)P_{I_{H}}(\Gamma)=T_{1}+T_{2}+T_{\mathrm{II}}+O(N^{1/2+\nu}L^{2}). This proves (6.27). ∎

Proposition 6.13 (Sixth-sum estimate).

Fix σ\sigma in the range stated above before taking N→∞N\to\infty. Then, along even integers,

(6.71) S6W≤J¯6−𝔤RA+o⁢(1).\frac{S_{6}}{W}\leq\overline{J}_{6}-\mathfrak{g}_{\mathrm{RA}}+o(1).

In particular, the certified floor in (6.70) gives

(6.72) S6W≤J¯6−gRA,lo+ERA⁢(N;σ),ERA⁢(N;σ)≥0,ERA⁢(N;σ)⟶0.\frac{S_{6}}{W}\leq\overline{J}_{6}-g_{\mathrm{RA,lo}}+E_{\mathrm{RA}}(N;% \sigma),\qquad E_{\mathrm{RA}}(N;\sigma)\geq 0,\qquad E_{\mathrm{RA}}(N;\sigma% )\longrightarrow 0.
Proof.

By Proposition 6.12(1), S6≤AmixS_{6}\leq A_{\mathrm{mix}}. Use (6.14), obtained from (6.12) and (6.13). Fix A>2A>2, so that N⁢L−A=o⁢(W)NL^{-A}=o(W). The three low discrepancies are O⁢(N⁢L−A−10)O(NL^{-A-10}) by Proposition 6.12(2). The term (6.15) is OA⁢(N⁢L−A)O_{A}(NL^{-A}). Also PIH⁢(Γ)=OA⁢(N⁢L−A)P_{I_{H}}(\Gamma)=O_{A}(NL^{-A}) by Proposition 6.12(3). Hence S6/W≤Mmix/W+o⁢(1)S_{6}/W\leq M_{\mathrm{mix}}/W+o(1), and (6.64) gives (6.71). Enlarge the vanishing error to make it nonnegative. The certified floor (6.70) gives (6.72). ∎

The precisions are fixed in the order (6.52). All constants precede the common threshold. Their dependence through prime Siegel–Walfisz may be ineffective. The final section uses only (6.72). It uses the certified rational floor in (9.2). Its gain is independent of the common coefficient used in the balanced-semiprime and switched comparisons.

7. The balanced semiprime term

We bound the complete occurrence sum Bb⁢(N)B_{b}(N). The two prime orientations keep their multiplicities. In this section, fix

(7.1) 13<b<12,ε=ηL=10−4,u=1500,μ∗=25128,L=log⁡N,0<σ≤10−10,τ=σ9,ρ=1+τ,N′=N⁢(1−L−333),𝒩K=(1−ε)⁢UC=W⁢(N)4,I⁢(b)=∫b1/2d⁢tt⁢(1−t)=log⁡1−bb.\begin{gathered}\frac{1}{3}<b<\frac{1}{2},\qquad\varepsilon=\eta_{L}=10^{-4},% \qquad u=\frac{1}{500},\qquad\mu_{*}=\frac{25}{128},\qquad L=\log N,\\ 0<\sigma\leq 10^{-10},\qquad\tau=\sigma^{9},\qquad\rho=1+\tau,\\ N^{\prime}=N(1-L^{-333}),\\ \mathcal{N}_{K}=(1-\varepsilon)U_{C}=\frac{W(N)}{4},\\ I(b)=\int_{b}^{1/2}\frac{dt}{t(1-t)}\\ =\log\frac{1-b}{b}.\end{gathered}

The final argument uses (1.2). Every limit below fixes bb and σ\sigma first. For row three, write ℓ0=53/412−ηL/2=264897/2060000>0\ell_{0}=53/412-\eta_{L}/2=264897/2060000>0. This is the fixed floor of Paper I, §3.1.

7.1. The convolution source

Define

(7.2) Ab⁢(e)\displaystyle A_{b}(e) =#⁢{(m,p′)∈ℙ2:Nb≤m≤N,ε⁢N<m⁢p′=e≤N′},\displaystyle=\#\{(m,p^{\prime})\in\mathbb{P}^{2}:N^{b}\leq m\leq\sqrt{N},% \quad\varepsilon N<mp^{\prime}=e\leq N^{\prime}\},
Xb\displaystyle X_{b} =∑eAb⁢(e),Bb′=∑eAb⁢(e)⁢1N−e∈ℙ,\displaystyle=\sum_{e}A_{b}(e),\qquad B_{b}^{\prime}=\sum_{e}A_{b}(e)1_{N-e\in% \mathbb{P}},
Etop\displaystyle E_{\mathrm{top}} =Bb−Bb′,0≤Ab⁢(e)≤2,0≤Etop≤2⁢(N⁢L−333+1).\displaystyle=B_{b}-B_{b}^{\prime},\qquad 0\leq A_{b}(e)\leq 2,\qquad 0\leq E_% {\mathrm{top}}\leq 2(NL^{-333}+1).

The last bound counts integers in the removed interval. A prime square contributes one occurrence. No new ordering or coprimality restriction is imposed.

For a finite sequence FF, put

(7.3) ΔF⁢(q,a)=∑eF⁢(e)⁢(1e≡a⁢(q)−1(e,q)=1φ⁢(q)),(a,q)=1.\Delta_{F}(q,a)=\sum_{e}F(e)\left(1_{e\equiv a\ (q)}-\frac{1_{(e,q)=1}}{% \varphi(q)}\right),\qquad(a,q)=1.

Both terms use the full support. For this source, PNT and partial summation give

(7.4) Xb=(1−ε)⁢NL⁢I⁢(b)+ob⁢(N/L).X_{b}=\frac{(1-\varepsilon)N}{L}I(b)+o_{b}(N/L).

This is the calculation of Paper II, [27, (5.44)–(5.51)]. The moving top removes at most 2⁢(N⁢L−333+1)2(NL^{-333}+1) mass.

The required convolution estimate is

(7.5) ∑q≤Qmax(a,q)=1⁡|ΔAb⁢(q,a)|≪A,bN⁢L−A,Q≤N1/2⁢L−BBV⁢(A,b),\sum_{q\leq Q}\max_{(a,q)=1}|\Delta_{A_{b}}(q,a)|\ll_{A,b}NL^{-A},\qquad Q\leq N% ^{1/2}L^{-B_{\mathrm{BV}}(A,b)},

for every fixed A>0A>0. Its proof keeps the complete occurrence source and the moving top. Fix a top T∈{N,N′}T\in\{N,N^{\prime}\}. Before the discrepancy estimate, compare the exact cell sources (7.10) with their upper and lower convolutions. Each signed child keeps the natural coprimality comparator 1(e,q)=1/φ⁢(q)1_{(e,q)=1}/\varphi(q). It is not replaced after summing the blocks. The step from T=NT=N to T=N′T=N^{\prime} costs the endpoint bands (7.11). It also costs the removed top mass in (7.2). The actual moving-top application is proved below.

We use the following convolution input. Let am,bna_{m},b_{n} have supports m∼M,n∼Ym\sim M,n\sim Y. Put x=M⁢Y≥3x=MY\geq 3, and fix η,Bdiv>0\eta,B_{\mathrm{div}}>0. Assume

(7.6) xη≤M,Y≤x1−η,|∑n≡l⁢(k)(n,h)=1bn−1φ⁢(k)⁢∑(n,h⁢k)=1bn|≪A2‖b‖2⁢Y1/2⁢d⁢(h)Bdiv⁢(log⁡(2⁢Y))−A2\begin{gathered}x^{\eta}\leq M,Y\leq x^{1-\eta},\\ \left|\sum_{\begin{subarray}{c}n\equiv l\ (k)\\ (n,h)=1\end{subarray}}b_{n}-\frac{1}{\varphi(k)}\sum_{(n,hk)=1}b_{n}\right|\ll% _{A_{2}}\|b\|_{2}Y^{1/2}d(h)^{B_{\mathrm{div}}}(\log(2Y))^{-A_{2}}\end{gathered}

uniformly for every fixed A2>0A_{2}>0, h,k≥1h,k\geq 1, and (l,k)=1(l,k)=1. Here d⁢(n)d(n) is the divisor function. Then Fact 3.3 gives

(7.7) ∑q≤Qmax(a,q)=1⁡|Δa∗b⁢(q,a)|≪A‖a‖2⁢‖b‖2⁢x1/2⁢(log⁡x)−A,Q≤x1/2⁢(log⁡x)−BBV.\sum_{q\leq Q}\max_{(a,q)=1}|\Delta_{a*b}(q,a)|\ll_{A}\|a\|_{2}\|b\|_{2}x^{1/2% }(\log x)^{-A},\qquad Q\leq x^{1/2}(\log x)^{-B_{\mathrm{BV}}}.

The constants depend on all family constants in (7.6). This specializes Fact 3.3. It is Paper II, Lemma 5.1 [27, (5.23)–(5.28)]. It applies to complete rectangular supports.

We make the interval reduction explicit. Fix a target A>2A>2, and put Hg=A+4H_{g}=A+4. Choose

(7.8) Rg=⌈(1/2−b)⁢Llog⁡(1+L−Hg)⌉,ξ=N(1/2−b)/Rg,yj=Nb⁢ξj,Jj=[yj−1,yj),Yj=yj.\begin{gathered}R_{g}=\left\lceil\frac{(1/2-b)L}{\log(1+L^{-H_{g}})}\right% \rceil,\qquad\xi=N^{(1/2-b)/R_{g}},\qquad y_{j}=N^{b}\xi^{j},\\ J_{j}=[y_{j-1},y_{j}),\qquad Y_{j}=y_{j}.\end{gathered}

Close the final upper endpoint. For the fixed top T∈{N,N′}T\in\{N,N^{\prime}\}, put

(7.9) bj⁢(m)\displaystyle b_{j}(m) =1m∈ℙ∩Jj,\displaystyle=1_{m\in\mathbb{P}\cap J_{j}},
aj,T+⁢(p′)\displaystyle a_{j,T}^{+}(p^{\prime}) =1p′∈ℙ⁢1ε⁢N/Yj≤p′≤T⁢ξ/Yj,\displaystyle=1_{p^{\prime}\in\mathbb{P}}1_{\varepsilon N/Y_{j}\leq p^{\prime}% \leq T\xi/Y_{j}},
aj,T−⁢(p′)\displaystyle a_{j,T}^{-}(p^{\prime}) =1p′∈ℙ⁢1ε⁢N⁢ξ/Yj<p′<T/Yj.\displaystyle=1_{p^{\prime}\in\mathbb{P}}1_{\varepsilon N\xi/Y_{j}<p^{\prime}<% T/Y_{j}}.

For F,GF,G on the positive integers write (F∗G)⁢(e)=∑m⁢n=eF⁢(m)⁢G⁢(n)(F*G)(e)=\sum_{mn=e}F(m)G(n), and put Aj,T±=aj,T±∗bjA_{j,T}^{\pm}=a_{j,T}^{\pm}*b_{j}. The exact cell source is

(7.10) Aj,T⁢(e)=1ε⁢N<e≤T⁢∑m∈ℙ∩Jj,p′∈ℙm⁢p′=e1.A_{j,T}(e)=1_{\varepsilon N<e\leq T}\sum_{\begin{subarray}{c}m\in\mathbb{P}% \cap J_{j},\ p^{\prime}\in\mathbb{P}\\ mp^{\prime}=e\end{subarray}}1.

The definitions give the pointwise envelopes Aj,T−≤Aj,T≤Aj,T+A_{j,T}^{-}\leq A_{j,T}\leq A_{j,T}^{+}. Their difference is supported in multiplicative boundary bands at ε⁢N\varepsilon N and TT. Put ℰQ⁢(F)=∑q≤Qmax(a,q)=1⁡|ΔF⁢(q,a)|\mathcal{E}_{Q}(F)=\sum_{q\leq Q}\max_{(a,q)=1}|\Delta_{F}(q,a)|. Let BT⁢(e)=∑j(Aj,T+⁢(e)−Aj,T−⁢(e))B_{T}(e)=\sum_{j}(A_{j,T}^{+}(e)-A_{j,T}^{-}(e)). Then BT≥0B_{T}\geq 0, with support in [ε⁢N/ξ,ε⁢N⁢ξ]∪[T/ξ,T⁢ξ][\varepsilon N/\xi,\varepsilon N\xi]\cup[T/\xi,T\xi]. Each integer has at most two ordered factorizations into primes. Since 1<ξ≤1+L−Hg1<\xi\leq 1+L^{-H_{g}} and T∈{N,N′}T\in\{N,N^{\prime}\} satisfies T≤NT\leq N,

∑eBT⁢(e)≤2⁢{ε⁢N⁢(ξ−ξ−1)+T⁢(ξ−ξ−1)+4}≪N⁢L−Hg+1.\sum_{e}B_{T}(e)\leq 2\{\varepsilon N(\xi-\xi^{-1})+T(\xi-\xi^{-1})+4\}\ll NL^% {-H_{g}}+1.

Since ξ−ξ−1≤2⁢(ξ−1)≤2⁢L−Hg\xi-\xi^{-1}\leq 2(\xi-1)\leq 2L^{-H_{g}}, counting integers in the two complete boundary bands gives the displayed mass bound. Paper II, (5.47), gives the aggregate boundary discrepancy

(7.11) ℰQ⁢(∑j(Aj,T+−Aj,T−))≪N⁢L−Hg+1+Q.\mathcal{E}_{Q}\!\left(\sum_{j}(A_{j,T}^{+}-A_{j,T}^{-})\right)\ll NL^{-H_{g}+% 1}+Q.

The QQ term includes the bounded-multiplicity changes at exact endpoints. Split the second factor into dyadic blocks (M,2⁢M](M,2M]:

aj,T,M±⁢(p′)=aj,T±⁢(p′)⁢1M<p′≤2⁢M.a_{j,T,M}^{\pm}(p^{\prime})=a_{j,T}^{\pm}(p^{\prime})1_{M<p^{\prime}\leq 2M}.

For each block meeting the support, ε⁢N/(2⁢Yj)<M≤T⁢ξ/Yj\varepsilon N/(2Y_{j})<M\leq T\xi/Y_{j}, so M≍εN/YjM\asymp_{\varepsilon}N/Y_{j}, with only Oε⁢(1)O_{\varepsilon}(1) blocks. Here n∼Zn\sim Z means Z<n≤2⁢ZZ<n\leq 2Z, as in Section 3. For the short factor, the theorem-scale parent is Y=Yj/2Y=Y_{j}/2; since ξ<2\xi<2 eventually, Jj⊂(Yj/2,Yj]J_{j}\subset(Y_{j}/2,Y_{j}] lies in that parent. The norms are

(7.12) ‖aj,T,M+‖2≪M,‖aj,T,M−‖2≤‖aj,T,M+‖2,‖bj‖2≪Yj⁢L−(Hg+1)/2.\|a_{j,T,M}^{+}\|_{2}\ll\sqrt{M},\qquad\|a_{j,T,M}^{-}\|_{2}\leq\|a_{j,T,M}^{+% }\|_{2},\qquad\|b_{j}\|_{2}\ll\sqrt{Y_{j}}L^{-(H_{g}+1)/2}.

The prime number theorem on these intervals also gives a matching lower bound. It is ‖bj‖2≫Yj⁢L−(Hg+1)/2\|b_{j}\|_{2}\gg\sqrt{Y_{j}}L^{-(H_{g}+1)/2} for all sufficiently large NN. This lower bound normalizes the conversion of the absolute prime Siegel–Walfisz error to (7.6). The prime-interval form of (7.6) holds uniformly in j,T,Mj,T,M. For a fixed target A>2A>2, write KSW⁢(A)K_{\mathrm{SW}}(A) for the chosen logarithmic level. For auxiliary moduli k≤LKSW⁢(A)k\leq L^{K_{\mathrm{SW}}(A)}, this is prime Siegel–Walfisz at arbitrarily high fixed logarithmic precision. The divisor loss from excluding primes dividing the auxiliary integers is absorbed into d⁢(h)Bdivd(h)^{B_{\mathrm{div}}}. For k>LKSW⁢(A)k>L^{K_{\mathrm{SW}}(A)}, use

|Δ|≤|J|/k+1+π⁢(J)/φ⁢(k)|\Delta|\leq|J|/k+1+\pi(J)/\varphi(k)

and supk>LKSW⁢(A)φ⁢(k)−1≪L−KSW⁢(A)⁢log⁡log⁡(3⁢LKSW⁢(A))\sup_{k>L^{K_{\mathrm{SW}}(A)}}\varphi(k)^{-1}\ll L^{-K_{\mathrm{SW}}(A)}\log% \log(3L^{K_{\mathrm{SW}}(A)}), taking KSW⁢(A)K_{\mathrm{SW}}(A) larger than the requested saving. For every fixed target A>2A>2, choose Hg=A+4H_{g}=A+4. The grid has Ob⁢(LHg+1)O_{b}(L^{H_{g}+1}) intervals. The prime number theorem gives the norm bounds (7.12). With Ablock=A+Hg/2+2A_{\mathrm{block}}=A+H_{g}/2+2, Fact 3.3 and Paper II, (5.23)–(5.28), bound the rectangular blocks by OA,b⁢(N⁢L−A−3/2)O_{A,b}(NL^{-A-3/2}). The boundary term in (7.11) is O⁢(N⁢L−A−3+Q)O(NL^{-A-3}+Q). Increasing the single fixed logarithmic level buffer absorbs the x≍bNx\asymp_{b}N constants. Thus the complete moving-top source, including the actual top T=N′T=N^{\prime}, satisfies (7.5). No fixed-width truncation estimate is substituted.

7.2. Four directed sieve rows

Let 𝒫N={p∈ℙ:p∤2⁢N}\mathcal{P}_{N}=\{p\in\mathbb{P}:p\nmid 2N\}. Put

(7.13) Sb⁢(d;z)=∑d∣N−eAb⁢(e)⁢ 1((N−e)/d,PN⁢(z))=1,PN⁢(z)=∏p<z,p∈𝒫Np.S_{b}(d;z)=\sum_{d\mid N-e}A_{b}(e)\,1_{((N-e)/d,\,P_{N}(z))=1},\qquad P_{N}(z% )=\prod_{p<z,\ p\in\mathcal{P}_{N}}p.

There is no prefix–cofactor coprimality condition. Both source primes exceed Nμ∗N^{\mu_{*}} eventually. Thus, for every supported modulus dd,

(7.14) ∑d∣N−eAb⁢(e)=Xbφ⁢(d)+ΔAb⁢(d,N),(d,2⁢N)=1,P+⁢(d)<Nμ∗.\sum_{d\mid N-e}A_{b}(e)=\frac{X_{b}}{\varphi(d)}+\Delta_{A_{b}}(d,N),\qquad(d% ,2N)=1,\quad P^{+}(d)<N^{\mu_{*}}.

Here P+⁢(d)P^{+}(d) is the largest prime factor, with P+⁢(1)=1P^{+}(1)=1. For the squarefree sieve divisors, use the multiplicative density

(7.15) g⁢(p)=1p−1(p∈𝒫N),g⁢(pj)=0(j≥2),g⁢(p)=0(p∉𝒫N).g(p)=\frac{1}{p-1}\quad(p\in\mathcal{P}_{N}),\qquad g(p^{j})=0\quad(j\geq 2),% \qquad g(p)=0\quad(p\notin\mathcal{P}_{N}).

This is the squarefree-divisor density of the linear-sieve application. That input requires its zero prime-power tail. The full arithmetic density is g⁢(pj)=1/φ⁢(pj)g(p^{j})=1/\varphi(p^{j}) for p∈𝒫Np\in\mathcal{P}_{N} and j≥1j\geq 1. No estimate uses its prime-power tail. The two densities agree at active primes. These are the only local factors used by the main-mass calculation. In Paper I, Theorem 2.6 notation, this density is

ω⁢(p)=pp−1(p∈𝒫N),ω⁢(p)=0(p∉𝒫N),ω⁢(pa)=0(a≥2).\omega(p)=\frac{p}{p-1}\quad(p\in\mathcal{P}_{N}),\qquad\omega(p)=0\quad(p% \notin\mathcal{P}_{N}),\qquad\omega(p^{a})=0\quad(a\geq 2).

Thus ω⁢(p)/p=g⁢(p)\omega(p)/p=g(p), and condition (2) has zero left side. For p≥3p\geq 3,

(1−1p−1)−1=(1−1p)−1⁢(1+1p⁢(p−2)).\left(1-\frac{1}{p-1}\right)^{-1}=\left(1-\frac{1}{p}\right)^{-1}\left(1+\frac% {1}{p(p-2)}\right).

The product of the second factors over p≥wp\geq w is 1+O⁢(1/w)=1+O⁢(1/log⁡w)1+O(1/w)=1+O(1/\log w). Hence Mertens’ product estimate gives condition (1) with exponent one and one fixed Kdim≥2K_{\mathrm{dim}}\geq 2. We may take Lω=2L_{\omega}=2. These are the dimension and prime-power inputs of Iwaniec’s linear sieve [13].

If N−eN-e is prime, it is at least N⁢L−333NL^{-333}. It therefore exceeds Nμ∗N^{\mu_{*}} eventually. Hence

(7.16) Bb′≤Sb⁢(1;Nμ∗).B_{b}^{\prime}\leq S_{b}(1;N^{\mu_{*}}).

Use the ordered primes Nu≤aj<⋯<a1<Nμ∗N^{u}\leq a_{j}<\cdots<a_{1}<N^{\mu_{*}} in 𝒫N\mathcal{P}_{N}. The exact decomposition of (4.26)–(4.30) gives

(7.17) Bb≤Etop+T0−T1+T2−R3+P3.B_{b}\leq E_{\mathrm{top}}+T_{0}-T_{1}+T_{2}-R_{3}+P_{3}.

Here

(7.18) T0\displaystyle T_{0} =Sb⁢(1;Nu),\displaystyle=S_{b}(1;N^{u}),
Tj\displaystyle T_{j} =∑Nu≤aj<⋯<a1<Nμ∗Sb⁢(a1⁢⋯⁢aj;Nu)(j=1,2),\displaystyle=\sum_{N^{u}\leq a_{j}<\cdots<a_{1}<N^{\mu_{*}}}S_{b}(a_{1}\cdots a% _{j};N^{u})\quad(j=1,2),
R3\displaystyle R_{3} =∑retSb⁢(a1⁢a2⁢a3;Nt3),\displaystyle=\sum_{\mathrm{ret}}S_{b}(a_{1}a_{2}a_{3};N^{t_{3}}),
P3\displaystyle P_{3} =∑ret∑Nt3≤r<a3r∈𝒫NSb⁢(a1⁢a2⁢a3⁢r;Nt3).\displaystyle=\sum_{\mathrm{ret}}\sum_{\begin{subarray}{c}N^{t_{3}}\leq r<a_{3% }\\ r\in\mathcal{P}_{N}\end{subarray}}S_{b}(a_{1}a_{2}a_{3}r;N^{t_{3}}).

Every prime in these sums belongs to 𝒫N\mathcal{P}_{N}. The last sum keeps the half-open cells it inherits. The symbol ∑ret\sum_{\mathrm{ret}} restricts by

(7.19) Θ𝔠=inf𝔠¯H,ℓ𝔠=Θ𝔠−ηL−t1−t2−t3,ℓ𝔠≥2⁢ρ⁢t3.\Theta_{\mathfrak{c}}=\inf_{\overline{\mathfrak{c}}}H,\qquad\ell_{\mathfrak{c}% }=\Theta_{\mathfrak{c}}-\eta_{L}-t_{1}-t_{2}-t_{3},\qquad\ell_{\mathfrak{c}}% \geq 2\rho t_{3}.

Here HH is the full eight-branch packing function, (3.29). The infimum uses the complete closed ordered cell. It does not use a quadrature node.

The four directed applications are

(7.20) termrow signsieve directionlevel exponentT0+upper ⁢F1/2−ηLT1−lower ⁢f1/2−ηL−ρ⁢t1T2+upper ⁢F1/2−ηL−ρ⁢(t1+t2)R3−lower ⁢fℓ𝔠\begin{array}[]{c|c|c|c}\text{term}&\text{row sign}&\text{sieve direction}&% \text{level exponent}\\ \hline\cr T_{0}&+&\text{upper }F&1/2-\eta_{L}\\ T_{1}&-&\text{lower }f&1/2-\eta_{L}-\rho t_{1}\\ T_{2}&+&\text{upper }F&1/2-\eta_{L}-\rho(t_{1}+t_{2})\\ R_{3}&-&\text{lower }f&\ell_{\mathfrak{c}}\end{array}

The first three cutoffs are NuN^{u}. The fourth cutoff is Nt3N^{t_{3}}. The canonical functions are Iwaniec’s linear-sieve functions [13]. Extend ff by zero for s≤2s\leq 2. No shifted beta-sieve profile is substituted.

For each prefix product hh, let 𝒜h\mathcal{A}_{h} be the cofactor sequence indexed by n=(N−e)/hn=(N-e)/h, with multiplicity Ab⁢(e)A_{b}(e) when h∣N−eh\mid N-e. Put Xh=Xb/φ⁢(h)X_{h}=X_{b}/\varphi(h). Write zhz_{h} for the row cutoff, DhD_{h} for its level, and sh=log⁡Dh/log⁡zhs_{h}=\log D_{h}/\log z_{h}. Every prefix prime is at least zhz_{h}, and each squarefree sieve modulus t∣PN⁢(zh)t\mid P_{N}(z_{h}) has prime factors below zhz_{h}. Thus (h,t)=1(h,t)=1, and the local identity (7.14) gives the exact remainder identity

(7.21) r⁢(𝒜h,t)=ΔAb⁢(h⁢t,N).r(\mathcal{A}_{h},t)=\Delta_{A_{b}}(ht,N).

Since ω⁢(t)/t=1/φ⁢(t)\omega(t)/t=1/\varphi(t) and (h,t)=1(h,t)=1, the local main term is Xh⁢ω⁢(t)/t=Xb/φ⁢(h⁢t)X_{h}\omega(t)/t=X_{b}/\varphi(ht), as required by Theorem 2.6. For rows j=0,1,2j=0,1,2, put S=t1+⋯+tjS=t_{1}+\cdots+t_{j}, with S=0S=0 for row zero, and θ=1/2−ηL\theta=1/2-\eta_{L}. The clipped exponent cells give

h≤Nρ⁢S,Dh=Nθ−ρ⁢S,S≤2⁢μ∗.h\leq N^{\rho S},\qquad D_{h}=N^{\theta-\rho S},\qquad S\leq 2\mu_{*}.

Hence log⁡Dh/log⁡N≥θ−2⁢ρ⁢μ∗>0.1092>2⁢u\log D_{h}/\log N\geq\theta-2\rho\mu_{*}>0.1092>2u. The upper rows satisfy Nu≤DhN^{u}\leq D_{h}. The lower row satisfies Nu≤Dh1/2N^{u}\leq D_{h}^{1/2}. For sufficiently large NN, with σ\sigma fixed, Dh≥2D_{h}\geq 2. Apply Paper I, Theorem 2.6, (2.30), with density g⁢(p)=1/(p−1)g(p)=1/(p-1) on 𝒫N\mathcal{P}_{N}, g⁢(pa)=0g(p^{a})=0 for a≥2a\geq 2, and sieve parameter ϵs=σ\epsilon_{s}=\sigma. With E¯=2⁢CAA37⁢σ\overline{E}=2C_{\mathrm{AA37}}\sigma, the resulting directed inequalities are

(7.22) S⁢(𝒜h,zh)\displaystyle S(\mathcal{A}_{h},z_{h}) ≤Xh⁢VN⁢(zh)⁢{F⁢(sh)+Esh+}+R1+⁢(h)+R+⁢(h),\displaystyle\leq X_{h}V_{N}(z_{h})\{F(s_{h})+E^{+}_{s_{h}}\}+R_{1}^{+}(h)+R^{% +}(h),
S⁢(𝒜h,zh)\displaystyle S(\mathcal{A}_{h},z_{h}) ≥Xh⁢VN⁢(zh)⁢{f⁢(sh)−Esh−}−R1−⁢(h)−R−⁢(h),\displaystyle\geq X_{h}V_{N}(z_{h})\{f(s_{h})-E^{-}_{s_{h}}\}-R_{1}^{-}(h)-R^{% -}(h),
|Esh±|\displaystyle|E^{\pm}_{s_{h}}| ≤E¯.\displaystyle\leq\overline{E}.

Only the upper bound |Esh±|≤E¯|E^{\pm}_{s_{h}}|\leq\overline{E} is used. No sign of Esh±E^{\pm}_{s_{h}} is assumed. Since Xh⁢VN⁢(zh)≥0X_{h}V_{N}(z_{h})\geq 0, replacing Esh±E^{\pm}_{s_{h}} by E¯\overline{E} weakens each inequality. The actual dimension and prime-power constants, the level lower bound, and the fixed-σ\sigma threshold are in (7.40).

The superscript AA\mathrm{AA} below marks errors from this linear-sieve theorem. It does not denote a separate family of profiles. For row jj, sum over its actual prefix set ℋj\mathcal{H}_{j}. Let ℱj\mathcal{F}_{j} be FF on the upper rows and ff on the lower rows. The definitions used in the signed equalities are

(7.23) mj\displaystyle m_{j} =∑h∈ℋjXh⁢VN⁢(zh)⁢ℱj⁢(sh),\displaystyle=\sum_{h\in\mathcal{H}_{j}}X_{h}V_{N}(z_{h})\mathcal{F}_{j}(s_{h}),
𝔐j\displaystyle\mathfrak{M}_{j} =∑h∈ℋjXh⁢VN⁢(zh),\displaystyle=\sum_{h\in\mathcal{H}_{j}}X_{h}V_{N}(z_{h}),
𝒜jAA\displaystyle\mathcal{A}_{j}^{\mathrm{AA}} =E¯⁢𝔐j,\displaystyle=\overline{E}\,\mathfrak{M}_{j},
rj\displaystyle r_{j} =∑h∈ℋj{R1νj⁢(h)+Rνj⁢(h)},νj=+ on upper rows,νj=− on lower rows,\displaystyle=\sum_{h\in\mathcal{H}_{j}}\{R_{1}^{\nu_{j}}(h)+R^{\nu_{j}}(h)\},% \qquad\nu_{j}=+\text{ on upper rows},\quad\nu_{j}=-\text{ on lower rows},
zj\displaystyle z_{j} =mj+𝒜jAA+rj−Tjon upper rows,\displaystyle=m_{j}+\mathcal{A}_{j}^{\mathrm{AA}}+r_{j}-T_{j}\quad\text{on % upper rows},
zj\displaystyle z_{j} =Tj−mj+𝒜jAA+rjon lower row ⁢j=1,\displaystyle=T_{j}-m_{j}+\mathcal{A}_{j}^{\mathrm{AA}}+r_{j}\quad\text{on % lower row }j=1,
z3\displaystyle z_{3} =R3−m3+𝒜3AA+r3.\displaystyle=R_{3}-m_{3}+\mathcal{A}_{3}^{\mathrm{AA}}+r_{3}.

Summing (7.22) over prefixes proves zj≥0z_{j}\geq 0. Also 𝔐j≥0\mathfrak{M}_{j}\geq 0, so 𝒜jAA≥0\mathcal{A}_{j}^{\mathrm{AA}}\geq 0. These nonnegativity statements are proved at source level for the exact signed remainders in (7.21). No sign of these remainders is assumed. Write the directed equalities as

(7.24) T0\displaystyle T_{0} =m0+𝒜0AA+r0−z0,\displaystyle=m_{0}+\mathcal{A}_{0}^{\mathrm{AA}}+r_{0}-z_{0}, T1\displaystyle T_{1} =m1−𝒜1AA−r1+z1,\displaystyle=m_{1}-\mathcal{A}_{1}^{\mathrm{AA}}-r_{1}+z_{1},
T2\displaystyle T_{2} =m2+𝒜2AA+r2−z2,\displaystyle=m_{2}+\mathcal{A}_{2}^{\mathrm{AA}}+r_{2}-z_{2}, R3\displaystyle R_{3} =m3−𝒜3AA−r3+z3,𝒜jAA,zj≥0.\displaystyle=m_{3}-\mathcal{A}_{3}^{\mathrm{AA}}-r_{3}+z_{3},\qquad\mathcal{A% }_{j}^{\mathrm{AA}},z_{j}\geq 0.
Lemma 7.1 (Signed row identity).

With MK=m0−m1+m2−m3M_{K}=m_{0}-m_{1}+m_{2}-m_{3},

Δarith:=T0−T1+T2−R3−MK=∑j=03𝒜jAA+∑j=03rj−∑j=03zj,\Delta_{\mathrm{arith}}:=T_{0}-T_{1}+T_{2}-R_{3}-M_{K}=\sum_{j=0}^{3}\mathcal{% A}_{j}^{\mathrm{AA}}+\sum_{j=0}^{3}r_{j}-\sum_{j=0}^{3}z_{j},

and every 𝒜jAA\mathcal{A}_{j}^{\mathrm{AA}} occurs with coefficient +1+1.

Proof.

Substitute (7.24). The lower rows carry the row sign −-, which turns −𝒜jAA−rj+zj-\mathcal{A}_{j}^{\mathrm{AA}}-r_{j}+z_{j} into +𝒜jAA+rj−zj+\mathcal{A}_{j}^{\mathrm{AA}}+r_{j}-z_{j}. ∎

For rows j=0,1,2j=0,1,2, the total moduli in these remainders fit the level of (7.5). A tail tuple satisfies ∏iDi<Dh\prod_{i}D_{i}<D_{h}. In the parity ending in a defining cubic condition, remove two copies of the last label. In the other parity, use the preceding cubic condition and the ordering of the last two labels. The empty and one-label cases follow from the tuple definitions. Each pip_{i} lies in the interval Di≤pi<min⁡(Diρ,zh)D_{i}\leq p_{i}<\min(D_{i}^{\rho},z_{h}), and d<Dhσd<D_{h}^{\sigma}. Thus, with the same S,θS,\theta as above,

q=h⁢d⁢∏ipi≤h⁢Dhσ+ρ≤Nρ⁢S+(σ+ρ)⁢(θ−ρ⁢S)=Nθ+(σ+τ)⁢(θ−ρ⁢S)≤Nθ+(σ+τ)⁢θ<N1/2−ηL/2.q=hd\prod_{i}p_{i}\leq hD_{h}^{\sigma+\rho}\leq N^{\rho S+(\sigma+\rho)(\theta% -\rho S)}=N^{\theta+(\sigma+\tau)(\theta-\rho S)}\leq N^{\theta+(\sigma+\tau)% \theta}<N^{1/2-\eta_{L}/2}.

This power buffer is below N1/2⁢L−BN^{1/2}L^{-B} for every fixed BB, once NN is large enough.

The factors of such a modulus that are at least zhz_{h} are exactly the ordered prefix primes. They determine hh and its clipped cell. Factoring the remaining part at Dhσ2D_{h}^{\sigma^{2}} determines the squarefree smooth divisor and the tail-prime multiset. The number of tail labels is at most Jσ=⌈σ−2⌉J_{\sigma}=\lceil\sigma^{-2}\rceil. Equal-label permutations contribute at most Jσ!J_{\sigma}!. Each AA coefficient has modulus at most one. The number of label vectors is less than exp⁡(8⁢σ−3)\exp(8\sigma^{-3}). Hence the total coefficient at each modulus is at most CK2,σ=1+exp⁡(8⁢σ−3)⁢Jσ!C_{\mathrm{K2},\sigma}=1+\exp(8\sigma^{-3})J_{\sigma}!, independent of NN. Apply (7.5) with target A=4A=4. Divide by 𝒩K=(1−ε)⁢C⁢(N)⁢N/L2\mathcal{N}_{K}=(1-\varepsilon)C(N)N/L^{2}; here C⁢(N)≥C2>0C(N)\geq C_{2}>0 by Paper II, (1.2). This proves

(7.25) |r0|+|r1|+|r2|𝒩K≪b,σL−2.\frac{|r_{0}|+|r_{1}|+|r_{2}|}{\mathcal{N}_{K}}\ll_{b,\sigma}L^{-2}.

The low-row bound uses Fact 3.3, the prime Siegel–Walfisz theorem, the prime number theorem and the Paper II convolution inputs. It gives no estimate for the principal masses or row three.

The mjm_{j} are the directed main terms. The rjr_{j} are signed arithmetic remainders. Thus, with MK=m0−m1+m2−m3M_{K}=m_{0}-m_{1}+m_{2}-m_{3},

(7.26) Bb≤\displaystyle B_{b}\leq{} Etop+P3+MK+∑j=03𝒜jAA+∑j=03rj−∑j=03zj\displaystyle E_{\mathrm{top}}+P_{3}+M_{K}+\sum_{j=0}^{3}\mathcal{A}_{j}^{% \mathrm{AA}}+\sum_{j=0}^{3}r_{j}-\sum_{j=0}^{3}z_{j}
≤\displaystyle\leq{} Etop+P3+MK+∑j=03𝒜jAA+∑j=03|rj|.\displaystyle E_{\mathrm{top}}+P_{3}+M_{K}+\sum_{j=0}^{3}\mathcal{A}_{j}^{% \mathrm{AA}}+\sum_{j=0}^{3}|r_{j}|.

This step is finite algebra. The directed source comparisons are proved separately.

The canonical row masses are explicit. For a prefix cell 𝔠\mathfrak{c}, put

Hj⁢(𝔠)=∑a1>⋯>ajai⁢ in the cell1φ⁢(a1⁢⋯⁢aj).H_{j}(\mathfrak{c})=\sum_{\begin{subarray}{c}a_{1}>\cdots>a_{j}\\ a_{i}\text{ in the cell}\end{subarray}}\frac{1}{\varphi(a_{1}\cdots a_{j})}.

Since the prefix primes exceed every sieve prime, the product over sieve primes at each row is VN⁢(zh)V_{N}(z_{h}). With the ordered cell sets DjD_{j} from (7.31),

(7.27) m0\displaystyle m_{0} =Xb⁢VN⁢(Nu)⁢F⁢(s0),\displaystyle=X_{b}V_{N}(N^{u})F(s_{0}),
m1\displaystyle m_{1} =Xb⁢VN⁢(Nu)⁢∑𝔠∈D1H1⁢(𝔠)⁢f⁢(s1⁢(𝔠)),\displaystyle=X_{b}V_{N}(N^{u})\sum_{\mathfrak{c}\in D_{1}}H_{1}(\mathfrak{c})% f(s_{1}(\mathfrak{c})),
m2\displaystyle m_{2} =Xb⁢VN⁢(Nu)⁢∑𝔠∈D2H2⁢(𝔠)⁢F⁢(s2⁢(𝔠)),\displaystyle=X_{b}V_{N}(N^{u})\sum_{\mathfrak{c}\in D_{2}}H_{2}(\mathfrak{c})% F(s_{2}(\mathfrak{c})),
m3\displaystyle m_{3} =Xb⁢∑𝔠∈D3χ𝔠⁢VN⁢(Nt3)⁢H3⁢(𝔠)⁢f⁢(ℓ𝔠/t3).\displaystyle=X_{b}\sum_{\mathfrak{c}\in D_{3}}\chi_{\mathfrak{c}}V_{N}(N^{t_{% 3}})H_{3}(\mathfrak{c})f(\ell_{\mathfrak{c}}/t_{3}).

The masses 𝔐j\mathfrak{M}_{j} are these sums with FF and ff replaced by 11. In particular, the row-three retention indicator χ𝔠\chi_{\mathfrak{c}} appears in both sums.

7.3. The principal functional

We display the numerical functional used for MKM_{K}. Set

(7.28) v1⁢(s)\displaystyle v_{1}(s) =min⁡{1+s2,32−34⁢s39,5764−32⁢s},\displaystyle=\min\left\{\frac{1+s}{2},\frac{32-34s}{39},\frac{57}{64}-\frac{3% }{2}s\right\},
v⁢(s)\displaystyle v(s) =v1⁢(s)−u,ψ⁢(x,y)=x⁢1x≥y,\displaystyle=v_{1}(s)-u,\qquad\psi(x,y)=x1_{x\geq y},
Θ∗⁢(x,y,z)\displaystyle\Theta_{*}(x,y,z) =max{v(x),v(y),v(x+y),v(x+y+z),\displaystyle=\max\{v(x),v(y),v(x+y),v(x+y+z),
ψ(v(x+z),x+2y+z),ψ(v(y+z),2x+y+z)}.\displaystyle\hskip 79.66771pt\psi(v(x+z),x+2y+z),\psi(v(y+z),2x+y+z)\}.

The subtraction of uu precedes both guards. This is Paper II, (4.70)–(4.72) [27, (4.70)–(4.72)]. Put

(7.29) Hlog\displaystyle H_{\log} =log⁡(μ∗/u),\displaystyle=\log(\mu_{*}/u),
Rup\displaystyle R_{\mathrm{up}} =500⁢(F⁢(30)−1)+500⁢Hlog⁢(1−f⁢(30))+250⁢Hlog2⁢(F⁢(30)−1),\displaystyle=500(F(30)-1)+500H_{\log}(1-f(30))+250H_{\log}^{2}(F(30)-1),
J∗\displaystyle J_{*} =∫uμ∗d⁢xx⁢∫uxd⁢yy⁢∫uy1−f⁢((Θ∗⁢(x,y,z)−x−y−z)/z)z2⁢𝑑z,\displaystyle=\int_{u}^{\mu_{*}}\frac{dx}{x}\int_{u}^{x}\frac{dy}{y}\int_{u}^{% y}\frac{1-f((\Theta_{*}(x,y,z)-x-y-z)/z)}{z^{2}}\,dz,
G∗\displaystyle G_{*} =1μ∗+Rup+J∗.\displaystyle=\frac{1}{\mu_{*}}+R_{\mathrm{up}}+J_{*}.

We keep the true delay-function tail. Paper II, (4.73)–(4.75), gives the constant cancellation

(7.30) 1−Hlog+Hlog2/2u−∫uμ∗d⁢xx⁢∫uxd⁢yy⁢∫uyd⁢zz2=1μ∗.\frac{1-H_{\log}+H_{\log}^{2}/2}{u}-\int_{u}^{\mu_{*}}\frac{dx}{x}\int_{u}^{x}% \frac{dy}{y}\int_{u}^{y}\frac{dz}{z^{2}}=\frac{1}{\mu_{*}}.

The finite-parent comparison also needs its direction. Fix a finite clipped partition Π\Pi of [u,μ∗)[u,\mu_{*}). Its cells have endpoint ratios at most ρ\rho. Each clipped cell is a product of half-open exponent intervals [ti,ti′)[t_{i},t_{i}^{\prime}) with ti′≤ρ⁢tit_{i}^{\prime}\leq\rho t_{i}. Here tit_{i} is the lower endpoint, so Nti≤ai<Nρ⁢tiN^{t_{i}}\leq a_{i}<N^{\rho t_{i}}, i.e. ti≤xi<ρ⁢tit_{i}\leq x_{i}<\rho t_{i}. The closure 𝔠¯\overline{\mathfrak{c}} is used only for infima and lower bounds. The cutoffs Nt3N^{t_{3}} in R3,P3R_{3},P_{3} and the factors ρ⁢t1,ρ⁢(t1+t2)\rho t_{1},\rho(t_{1}+t_{2}) in s1,s2s_{1},s_{2} use this convention. For a clipped cell 𝔠\mathfrak{c}, let w𝔠=∫𝔠∏id⁢xi/xiw_{\mathfrak{c}}=\int_{\mathfrak{c}}\prod_{i}dx_{i}/x_{i}. Define

(7.31) s0\displaystyle s_{0} =(1/2−ηL)/u,\displaystyle=(1/2-\eta_{L})/u,
s1⁢(𝔠)\displaystyle s_{1}(\mathfrak{c}) =(1/2−ηL−ρ⁢t1)/u,\displaystyle=(1/2-\eta_{L}-\rho t_{1})/u,
s2⁢(𝔠)\displaystyle s_{2}(\mathfrak{c}) =(1/2−ηL−ρ⁢(t1+t2))/u,\displaystyle=(1/2-\eta_{L}-\rho(t_{1}+t_{2}))/u,
EΠ\displaystyle E_{\Pi} =F⁢(s0)−1u+∑𝔠∈D1w𝔠u⁢(1−f⁢(s1⁢(𝔠)))\displaystyle=\frac{F(s_{0})-1}{u}+\sum_{\mathfrak{c}\in D_{1}}\frac{w_{% \mathfrak{c}}}{u}(1-f(s_{1}(\mathfrak{c})))
+∑𝔠∈D2w𝔠u⁢(F⁢(s2⁢(𝔠))−1),\displaystyle\qquad+\sum_{\mathfrak{c}\in D_{2}}\frac{w_{\mathfrak{c}}}{u}(F(s% _{2}(\mathfrak{c}))-1),
PΠ\displaystyle P_{\Pi} =1−Hlog+Hlog2/2u+EΠ−∑𝔠∈D3w𝔠⁢1ℓ𝔠≥2⁢ρ⁢t3⁢f⁢(ℓ𝔠/t3)t3.\displaystyle=\frac{1-H_{\log}+H_{\log}^{2}/2}{u}+E_{\Pi}-\sum_{\mathfrak{c}% \in D_{3}}w_{\mathfrak{c}}1_{\ell_{\mathfrak{c}}\geq 2\rho t_{3}}\frac{f(\ell_% {\mathfrak{c}}/t_{3})}{t_{3}}.

Here Dj={u≤xj<⋯<x1<μ∗}D_{j}=\{u\leq x_{j}<\cdots<x_{1}<\mu_{*}\}. Each cell is intersected with this ordered domain. Its weight includes the actual ordered multiplicity. The required comparisons are

(7.32) 0≤EΠ≤Rup,PΠ≤1μ∗+EΠ+J∗≤G∗.0\leq E_{\Pi}\leq R_{\mathrm{up}},\qquad P_{\Pi}\leq\frac{1}{\mu_{*}}+E_{\Pi}+% J_{*}\leq G_{*}.

The last line is an upper comparison. It asserts no equality between finite sums and integrals.

Compare the six canonical branches of Θ∗\Theta_{*} with their matching branches among the eight parent branches of the packing function HH in (3.29). Adding uu to an unguarded canonical branch gives the matching parent branch. For an active canonical guarded branch, the parent guard is also active, and adding uu again gives the matching parent branch. An inactive canonical guarded branch is zero and cannot maximize the canonical ceiling, since its first unguarded branch is positive on the ordered domain. The two extra parent branches can only increase HH. Hence H⁢(x,y,z)≥Θ∗⁢(x,y,z)+uH(x,y,z)\geq\Theta_{*}(x,y,z)+u pointwise on that domain. On a closed anchored cell, each coordinate moves by at most μ∗⁢τ\mu_{*}\tau. Fix a point and a maximizing canonical branch there, and use its matching parent branch. If it is guarded, its guard has reserve u−7⁢μ∗⁢τ>0u-7\mu_{*}\tau>0 throughout the cell. This selected branch changes by at most (9/2)⁢μ∗⁢τ(9/2)\mu_{*}\tau across the cell. Therefore

(7.33) Θ𝔠\displaystyle\Theta_{\mathfrak{c}} ≥Θ∗⁢(x,y,z)+u−(9/2)⁢μ∗⁢τ,\displaystyle\geq\Theta_{*}(x,y,z)+u-(9/2)\mu_{*}\tau,
ℓ𝔠\displaystyle\ell_{\mathfrak{c}} ≥Θ∗⁢(x,y,z)−x−y−z+g,\displaystyle\geq\Theta_{*}(x,y,z)-x-y-z+g,
g\displaystyle g =u−ηL−(9/2)⁢μ∗⁢τ>2⁢μ∗⁢τ.\displaystyle=u-\eta_{L}-(9/2)\mu_{*}\tau>2\mu_{*}\tau.

Monotonicity of f⁢(s)f(s), together with this reserve, gives the directed kernel comparison

(7.34) χ𝔠⁢f⁢(ℓ𝔠/t3)t3≥f⁢((Θ∗⁢(x,y,z)−x−y−z)/z)z.\chi_{\mathfrak{c}}\frac{f(\ell_{\mathfrak{c}}/t_{3})}{t_{3}}\geq\frac{f((% \Theta_{*}(x,y,z)-x-y-z)/z)}{z}.

Summing over cells gives the upper comparison in (7.32). It does not identify a finite sum with the integral.

Put [x]+=max⁡{x,0}[x]_{+}=\max\{x,0\}. We need the arithmetic-to-integral estimate

(7.35) [MK−𝒩K⁢ 2⁢e−γ⁢I⁢(b)⁢G∗]+𝒩K=ob,σ⁢(1).\frac{[M_{K}-\mathcal{N}_{K}\,2e^{-\gamma}I(b)G_{*}]_{+}}{\mathcal{N}_{K}}=o_{% b,\sigma}(1).

The quantity MKM_{K} contains only the canonical values of FF and ff. The linear-sieve errors Esh±E^{\pm}_{s_{h}} and the remainders rjr_{j} lie outside it. They are paid in (7.38) and (7.47). Fix (b,σ)(b,\sigma). Three inputs enter. The first is the two-orientation arithmetic-mass estimate for the source (7.2). The second is its four signed canonical AA main masses (7.27). The third is the finite functional PΠP_{\Pi} in (7.31). For all sufficiently large even NN they give

MK/𝒩K≤2⁢e−γ⁢I⁢(b)⁢G∗+ob,σ⁢(1).M_{K}/\mathcal{N}_{K}\leq 2e^{-\gamma}I(b)G_{*}+o_{b,\sigma}(1).

Here the error tends to zero with b,σb,\sigma and the cell count fixed, as NN tends to infinity. This estimate is for the finite functional in (7.31). It gives (7.35) directly, so Nmass⁢(b,σ)N_{\mathrm{mass}}(b,\sigma) can be the threshold of this fixed-(b,σ)(b,\sigma) statement. This bound controls only the principal-mass term. It does not control the AA remainders, the optional numerical certificate, the complete exterior comparison or the endpoint terms. No sharper arithmetic-mass estimate is used here.

For the exterior comparison we use the common G0G_{0} coefficient

(7.36) G0=6088440363109,G∗≤G0,2⁢e−γ⁢G0≤cK⁢2,G⁢0:=68368251638755177562868463216507543729310946891045.\begin{gathered}G_{0}=\frac{6088440363}{10^{9}},\qquad G_{*}\leq G_{0},\\ 2e^{-\gamma}G_{0}\leq c_{K2,G0}:=\frac{683682516387551775628684632165075437293% 1094689}{10^{45}}.\end{gathered}

For G∗≤G0G_{*}\leq G_{0}, use the tight endpoint J∗≤0.967120J_{*}\leq 0.967120 of Paper II, (A.10a). It holds for the exact profile (7.29) [27, (4.73), (4.75), (A.10a)]. Its weaker displayed endpoint is not used. The Taylor-model delay certificate is used for this coefficient comparison and is not an input to the shifted replay itself. It gives the explicit bounds

0≤F⁢(30)−1<3⋅10−49,0≤1−f⁢(30)<3⋅10−49.0\leq F(30)-1<3\cdot 10^{-49},\qquad 0\leq 1-f(30)<3\cdot 10^{-49}.

Since 0<Hlog=log⁡(3125/32)<50<H_{\log}=\log(3125/32)<5, (7.29) then gives

Rup<(500+500⋅5+250⋅25)⁢3⋅10−49<10−44,G∗<12825+967120106+10−44<6088440363109=G0.R_{\mathrm{up}}<(500+500\cdot 5+250\cdot 25)3\cdot 10^{-49}<10^{-44},\qquad G_% {*}<\frac{128}{25}+\frac{967120}{10^{6}}+10^{-44}<\frac{6088440363}{10^{9}}=G_% {0}.

The finite delay calculation and this rational budget do not replace the source-to-profile comparison or its fixed-parameter hypotheses. For the scalar inequality, define

(7.37) γ−:=577215664901532860606512090082402431042159335939921050,γ+:=577215664901532860606512090082402431042159335939931050,γ−<γ<γ+,cK⁢2,G⁢0−2⁢G0⁢∑j=060(−γ−)jj!>753071050>0.\begin{gathered}\gamma_{-}:=\frac{57721566490153286060651209008240243104215933% 593992}{10^{50}},\\ \gamma_{+}:=\frac{57721566490153286060651209008240243104215933593993}{10^{50}}% ,\\ \gamma_{-}<\gamma<\gamma_{+},\\ c_{K2,G0}-2G_{0}\sum_{j=0}^{60}\frac{(-\gamma_{-})^{j}}{j!}>\frac{75307}{10^{5% 0}}>0.\end{gathered}

The rational enclosure follows from Euler–Maclaurin for HnH_{n} at n=105n=10^{5}, through B16B_{16}. The next-term remainder is bounded by |B18|/(18⁢n18)|B_{18}|/(18n^{18}). Both log⁡n\log n and HnH_{n} are enclosed outwards by the certified exact-input record. For 0<x<10<x<1, the even Taylor partial sum of e−xe^{-x} is an upper bound. Thus the exact rational comparison in (7.37) proves 2⁢e−γ⁢G0<cK⁢2,G⁢02e^{-\gamma}G_{0}<c_{K2,G0}.

The switched comparison uses the same coefficient. At b=2999993/7000000b=2999993/7000000, the common final-margin inequality (9.24) has slack 0.000228954311267289⁢…>1/50000.000228954311267289\ldots>1/5000 on the stated route g6:=0g_{6}:=0. Both comparisons use the same G0G_{0} bound. Scalar positivity does not establish the required source estimates.

7.4. The complete error bound

The analytic hypotheses are stated below. The sums are over the original applications. The four principal linear-sieve errors satisfy

(7.38) ∑j=03𝒜jAA𝒩K≤AK⁢(b)⁢CAA⁢σ,AK⁢(b)=2⁢e−γ⁢I⁢(b)⁢WAA,WAA=500⁢(1+Hlog+Hlog22+Hlog36).\begin{gathered}\frac{\sum_{j=0}^{3}\mathcal{A}_{j}^{\mathrm{AA}}}{\mathcal{N}% _{K}}\leq A_{K}(b)C_{\mathrm{AA}}\sigma,\\ A_{K}(b)=2e^{-\gamma}I(b)W_{\mathrm{AA}},\qquad W_{\mathrm{AA}}=500\left(1+H_{% \log}+\frac{H_{\log}^{2}}{2}+\frac{H_{\log}^{3}}{6}\right).\end{gathered}

Let CAA37C_{\mathrm{AA37}} be the absolute constant in Paper I, Theorem 2.6, (2.31), and define

(7.39) CAA=4⁢CAA37.C_{\mathrm{AA}}=4C_{\mathrm{AA37}}.

The coefficient four is the factor two in (7.43) times the factor two in the common bound |Es±|≤2⁢CAA37⁢σ|E_{s}^{\pm}|\leq 2C_{\mathrm{AA37}}\sigma. The sum over the four rows is already included in WAAW_{\mathrm{AA}}. It is independent of σ,N\sigma,N. It is unrelated to the global tensor constant in (6.40). All four actual levels satisfy D≥N1/250D\geq N^{1/250}. We use (2.31) with the actual fixed dimension constant KdimK_{\mathrm{dim}}. For the squarefree density in (7.15), the left side of (2.27) is zero. Hence the actual prime-power constant is Lω=2L_{\omega}=2. This value is used in the exponential below.

(7.40) |Es±|≤CAA37⁢{σ+σ−8⁢eKdim+2⁢(log⁡D)−1/3}≤2⁢CAA37⁢σ|E_{s}^{\pm}|\leq C_{\mathrm{AA37}}\{\sigma+\sigma^{-8}e^{K_{\mathrm{dim}}+2}(% \log D)^{-1/3}\}\leq 2C_{\mathrm{AA37}}\sigma

once L≥250⁢exp⁡(3⁢(Kdim+2))⁢σ−27L\geq 250\exp(3(K_{\mathrm{dim}}+2))\sigma^{-27}. Name the corresponding even threshold

NAA,dec⁢(σ):=2⁢⌈12⁢exp⁡(250⁢exp⁡(3⁢(Kdim+2))⁢σ−27)⌉.N_{\mathrm{AA,dec}}(\sigma):=2\left\lceil\frac{1}{2}\exp\!\left(250\exp(3(K_{% \mathrm{dim}}+2))\sigma^{-27}\right)\right\rceil.

It is chosen at fixed σ\sigma. Every N≥NAA,dec⁢(σ)N\geq N_{\mathrm{AA,dec}}(\sigma) satisfies the displayed decay bound. The four ordered harmonic row masses, before the common Euler and source factor, are bounded by

(7.41) 1u,Hlogu,Hlog22⁢u,row-3 mass≤ρ⁢∫uμ∗d⁢xx⁢∫uxd⁢yy⁢∫uyd⁢zz2≤ρ⁢Hlog22⁢u<Hlog36⁢u.\begin{gathered}\frac{1}{u},\qquad\frac{H_{\log}}{u},\qquad\frac{H_{\log}^{2}}% {2u},\\ \text{row-3 mass}\leq\rho\int_{u}^{\mu_{*}}\frac{dx}{x}\int_{u}^{x}\frac{dy}{y% }\int_{u}^{y}\frac{dz}{z^{2}}\leq\frac{\rho H_{\log}^{2}}{2u}<\frac{H_{\log}^{% 3}}{6u}.\end{gathered}

For the last inequality use 3⁢ρ<Hlog=log⁡(3125/32)3\rho<H_{\log}=\log(3125/32). The factor ρ\rho allows the anchored-bin endpoint enlargement. The first three identities are the volumes of ordered logarithmic simplexes. For the fourth, bound ∫uy𝑑z/z2≤1/u\int_{u}^{y}dz/z^{2}\leq 1/u and integrate over the ordered (x,y)(x,y) simplex. The sum of the four displayed upper envelopes is WAAW_{\mathrm{AA}}, the four-row envelope used here. It is distinct from Paper II’s coarser global sieve-error bound. Let H=Hlog=log⁡(3125/32)H=H_{\log}=\log(3125/32). PNT and Mertens’ theorems, uniformly over the finitely many fixed-σ\sigma cells, give

VN⁢(Na)=2⁢e−γ⁢C⁢(N)a⁢L⁢(1+o⁢(1)),Hj⁢(𝔠)=w𝔠+o⁢(1).V_{N}(N^{a})=\frac{2e^{-\gamma}C(N)}{aL}(1+o(1)),\qquad H_{j}(\mathfrak{c})=w_% {\mathfrak{c}}+o(1).

For the retained row, 1/t3≤ρ/x31/t_{3}\leq\rho/x_{3} on each cell. Dropping the retention restriction only increases its mass. Consequently

(7.42) ∑j=03𝔐j𝒩K\displaystyle\frac{\sum_{j=0}^{3}\mathfrak{M}_{j}}{\mathcal{N}_{K}} ≤2⁢e−γ⁢I⁢(b)⁢{1u+Hu+H22⁢u+ρ⁢J4}+o⁢(1),\displaystyle\leq 2e^{-\gamma}I(b)\left\{\frac{1}{u}+\frac{H}{u}+\frac{H^{2}}{% 2u}+\rho J_{4}\right\}+o(1),
J4\displaystyle J_{4} =H2/2−H+1u−1μ∗≤H22⁢u.\displaystyle=\frac{H^{2}/2-H+1}{u}-\frac{1}{\mu_{*}}\leq\frac{H^{2}}{2u}.

The bracket is smaller than WAA=u−1⁢(1+H+H2/2+H3/6)W_{\mathrm{AA}}=u^{-1}(1+H+H^{2}/2+H^{3}/6), with relative gap greater than 0.28420.2842 for 0<σ≤10−100<\sigma\leq 10^{-10}. The coarser bound ρ⁢J4≤ρ⁢H2/(2⁢u)\rho J_{4}\leq\rho H^{2}/(2u) still leaves relative gap greater than 0.17230.1723. Consequently, for each fixed b,σb,\sigma, there is a threshold NAA,dens⁢(b,σ)N_{\mathrm{AA,dens}}(b,\sigma) such that, for every even N≥NAA,dens⁢(b,σ)N\geq N_{\mathrm{AA,dens}}(b,\sigma), ∑j𝔐j≤𝒩K⁢ 2⁢e−γ⁢I⁢(b)⁢WAA\sum_{j}\mathfrak{M}_{j}\leq\mathcal{N}_{K}\,2e^{-\gamma}I(b)W_{\mathrm{AA}}. Define

NAA⁢(b,σ):=max⁡{NAA,dens⁢(b,σ),NAA,dec⁢(σ)}.N_{\mathrm{AA}}(b,\sigma):=\max\{N_{\mathrm{AA,dens}}(b,\sigma),N_{\mathrm{AA,% dec}}(\sigma)\}.

Thus both the density estimate and (7.40) hold above NAA⁢(b,σ)N_{\mathrm{AA}}(b,\sigma), as required for (7.38). The maxima defining TKT_{K} and TrT_{r} below include this combined threshold. The displayed source-density bound below is weaker by a factor of two. Let 𝔐j\mathfrak{M}_{j} be the nonnegative principal mass multiplying the relative sieve error in row jj. The resulting bound is

(7.43) ∑j=03𝔐j≤2⁢𝒩K⁢ 2⁢e−γ⁢I⁢(b)⁢WAA.\sum_{j=0}^{3}\mathfrak{M}_{j}\leq 2\mathcal{N}_{K}\,2e^{-\gamma}I(b)W_{% \mathrm{AA}}.

Multiplying it by 2⁢CAA37⁢σ2C_{\mathrm{AA37}}\sigma gives (7.38) with (7.39). The Euler factors and the actual-source mass identification are included above. The secondary decay is paid once.

The positive peel is bounded by the two-form argument of Paper II, [27, (4.46)–(4.56)], applied to the original source. Put ℬm={e:m∣N−e}\mathcal{B}_{m}=\{e:\ m\mid N-e\} with multiplicity Ab⁢(e)A_{b}(e). For m=a1⁢a2⁢a3⁢rm=a_{1}a_{2}a_{3}r in P3P_{3}, put E=Nt3E=N^{t_{3}} and w=Nu≤Ew=N^{u}\leq E. Write Ab=∑h=121{Ab≥h}A_{b}=\sum_{h=1}^{2}1_{\{A_{b}\geq h\}}. Every ee in the support is a product of two primes at least NbN^{b}. Hence ee is odd and ww-rough. Write N−e=m⁢kN-e=mk. Then kk is odd. A prime p<wp<w dividing kk and NN would divide ee, which is impossible. Hence both forms kk and N−m⁢kN-mk are free of all primes below ww. Therefore Sb⁢(m;E)S_{b}(m;E) is at most the two-form Selberg majorant of [27, (4.48)–(4.53)] on 1≤k≤N/m1\leq k\leq N/m, once for each layer. All prime factors of mm are at least E≥wE\geq w and lie in 𝒫N\mathcal{P}_{N}. Hence (m,N)=1(m,N)=1, and νN⁢(p)\nu_{N}(p) is as in [27, (4.48)]. Retention gives, as in [27, (4.55)],

(7.44) logN⁡m≤ρ⁢(t1+t2+2⁢t3)≤ρ⁢(Θ𝔠−ηL)<153256+2⁢τ,logN⁡(w2⁢m)<1−0.0116,logN⁡w=u≥21001.\log_{N}m\leq\rho(t_{1}+t_{2}+2t_{3})\leq\rho(\Theta_{\mathfrak{c}}-\eta_{L})<% \tfrac{153}{256}+2\tau,\qquad\log_{N}(w^{2}m)<1-0.0116,\qquad\log_{N}w=u\geq% \tfrac{2}{1001}.

Consequently [27, (4.47), (4.53), (4.54)] give, eventually and uniformly in mm,

(7.45) Sb⁢(m;E)≤2⋅4.002u2⋅UCm≤2008008⁢UCm,maxh⁡Mh≤2⁢τ,∑hMh≤459100,S_{b}(m;E)\leq 2\cdot\frac{4.002}{u^{2}}\cdot\frac{U_{C}}{m}\leq\frac{2008008% \,U_{C}}{m},\qquad\max_{h}M_{h}\leq 2\tau,\qquad\sum_{h}M_{h}\leq\frac{459}{10% 0},

since one layer is at most (N/m)/𝒢N⁢(w)+O⁢(w2⁢log5⁡w)(N/m)/\mathcal{G}_{N}(w)+O(w^{2}\log^{5}w) with 𝒢N⁢(w)=(1+o⁢(1))⁢u2⁢L2/(4⁢C⁢(N))\mathcal{G}_{N}(w)=(1+o(1))u^{2}L^{2}/(4C(N)), and 4.002/u2=1000500<1004004=2⋅5020024.002/u^{2}=1000500<1004004=2\cdot 502002. The bin sums are [27, (4.56)]: log⁡(μ∗/u)=log⁡(3125/32)<4.59\log(\mu_{*}/u)=\log(3125/32)<4.59, and a3,ra_{3},r lie in one parent bin. Therefore

(7.46) P3UC≤2008008⋅2⁢(459100)3⁢τ=2427244403157962500⁢τ<388400000⁢σ9,\frac{P_{3}}{U_{C}}\leq 2008008\cdot 2\left(\frac{459}{100}\right)^{3}\tau=% \frac{24272444031579}{62500}\tau<388400000\,\sigma^{9},

and P3/𝒩K≤PK⁢σ9P_{3}/\mathcal{N}_{K}\leq P_{K}\sigma^{9} with PK=388400000/(1−ε)=3884000000000/9999P_{K}=388400000/(1-\varepsilon)=3884000000000/9999, for N≥Npeel⁢(σ)N\geq N_{\rm peel}(\sigma). The coefficient 20080082008008 includes the two layers. No orientation factor is added.

The remaining estimates are

(7.47) |r0|+|r1|+|r2|𝒩K\displaystyle\frac{|r_{0}|+|r_{1}|+|r_{2}|}{\mathcal{N}_{K}} ≪b,σL−2,\displaystyle\ll_{b,\sigma}L^{-2},
|r3|𝒩K\displaystyle\frac{|r_{3}|}{\mathcal{N}_{K}} ≪b,σN−ℓ0⁢σ2⁢L3+N−b/4⁢L7+L−260+L−120+L−2+N−cσ⁢L4024+C=Ob,σ⁢(L−2).\displaystyle\ll_{b,\sigma}N^{-\ell_{0}\sigma^{2}}L^{3}+N^{-b/4}L^{7}+L^{-260}% +L^{-120}+L^{-2}+N^{-c_{\sigma}}L^{4024+C}=O_{b,\sigma}(L^{-2}).

The first line is (7.25). The second is Proposition 7.3 below. Its displayed terms come, in order, from the squareful mask, proper powers, logarithm freezing and the boundary. The last two are the combined logarithmic Type-II and Type-I-2 bound and the Type-II power-saving term.

7.5. The row-three remainder

We bound the complete third-row remainder of the actual source (7.2) by Paper I, Theorem 3.2. Every other contribution is bounded separately. Fix b,σb,\sigma. Write Ξ3♯\Xi^{\sharp}_{3} for the retained cells 𝔠∈D3\mathfrak{c}\in D_{3} with χ𝔠=1\chi_{\mathfrak{c}}=1. Its size is Oσ⁢(1)O_{\sigma}(1). For 𝔠∈Ξ3♯\mathfrak{c}\in\Xi^{\sharp}_{3} put D𝔠=Nℓ𝔠D_{\mathfrak{c}}=N^{\ell_{\mathfrak{c}}}, z𝔠=Nt3z_{\mathfrak{c}}=N^{t_{3}} and u𝔠=D𝔠σ2u_{\mathfrak{c}}=D_{\mathfrak{c}}^{\sigma^{2}}. Let IiI_{i} be the actual half-open exponent interval of coordinate ii of the clipped cell. Then 𝔠⊂I1×I2×I3\mathfrak{c}\subset I_{1}\times I_{2}\times I_{3}. Put 𝒫i={a∈𝒫N:logN⁡a∈Ii}\mathcal{P}_{i}=\{a\in\mathcal{P}_{N}:\log_{N}a\in I_{i}\}. For every ai∈𝒫ia_{i}\in\mathcal{P}_{i}, Nti≤ai<Nρ⁢tiN^{t_{i}}\leq a_{i}<N^{\rho t_{i}} and ai<Nμ∗a_{i}<N^{\mu_{*}}, also for a clipped interval. Write ti′≤min⁡(ρ⁢ti,μ∗)t_{i}^{\prime}\leq\min(\rho t_{i},\mu_{*}) for the upper endpoint of IiI_{i}. On 𝔠¯\overline{\mathfrak{c}} the actual coordinates satisfy x1≥x2≥x3≥ux_{1}\geq x_{2}\geq x_{3}\geq u. Two of the intervals are equal or disjoint.

Exact occurrence map.

By (7.21) and Paper I, (2.30), (2.32)–(2.33), applied to 𝒜h\mathcal{A}_{h} at level D𝔠D_{\mathfrak{c}}, cutoff z𝔠≤D𝔠1/2z_{\mathfrak{c}}\leq D_{\mathfrak{c}}^{1/2} and ϵs=σ\epsilon_{s}=\sigma,

(7.48) r3=∑𝔠∈Ξ3♯∑k∈𝒦𝔠∑qO𝔠,k⁢(q)⁢ΔAb⁢(q,N),𝒦𝔠={R1}∪𝒟−⁢(D𝔠),r_{3}=\sum_{\mathfrak{c}\in\Xi^{\sharp}_{3}}\ \sum_{k\in\mathcal{K}_{\mathfrak% {c}}}\sum_{q}O_{\mathfrak{c},k}(q)\,\Delta_{A_{b}}(q,N),\qquad\mathcal{K}_{% \mathfrak{c}}=\{\mathrm{R1}\}\cup\mathcal{D}^{-}(D_{\mathfrak{c}}),
O𝔠,k⁢(q)=∑a1>a2>a3ai∈𝒫i∑d<D𝔠σd∣PN⁢(u𝔠)λd(k)⁢∑(pj)j≤ρkpj∈𝒬k,jpi≠pj⁢((i,j)∈I⁢(𝐃))1q=a1⁢a2⁢a3⁢d⁢p1⁢⋯⁢pρk.O_{\mathfrak{c},k}(q)=\sum_{\begin{subarray}{c}a_{1}>a_{2}>a_{3}\\ a_{i}\in\mathcal{P}_{i}\end{subarray}}\sum_{\begin{subarray}{c}d<D_{\mathfrak{% c}}^{\sigma}\\ d\mid P_{N}(u_{\mathfrak{c}})\end{subarray}}\lambda^{(k)}_{d}\sum_{\begin{% subarray}{c}(p_{j})_{j\leq\rho_{k}}\\ p_{j}\in\mathcal{Q}_{k,j}\\ p_{i}\neq p_{j}\ ((i,j)\in I(\mathbf{D}))\end{subarray}}1_{q=a_{1}a_{2}a_{3}d% \,p_{1}\cdots p_{\rho_{k}}}.

Here λd(R1)=ϕd−\lambda^{(\mathrm{R1})}_{d}=\phi_{d}^{-} with no tail (ρR1=0\rho_{\mathrm{R1}}=0). For k=𝐃k=\mathbf{D}, λd(k)=λd−⁢(𝐃)\lambda^{(k)}_{d}=\lambda_{d}^{-}(\mathbf{D}) and 𝒬k,j=𝒫N∩[Dj,min⁡(Dj1+τ,z𝔠))\mathcal{Q}_{k,j}=\mathcal{P}_{N}\cap[D_{j},\min(D_{j}^{1+\tau},z_{\mathfrak{c% }})). All coefficients have modulus at most one and depend only on (𝔠,k)(\mathfrak{c},k). The identity is exact at every supported modulus. Let M𝔠∈{1,2,6}M_{\mathfrak{c}}\in\{1,2,6\} be the number of orderings of the equal intervals among I1,I2,I3I_{1},I_{2},I_{3}. Let Γ𝔠,k\Gamma_{\mathfrak{c},k} be M𝔠−1M_{\mathfrak{c}}^{-1} times the same sum, with ai∈𝒫ia_{i}\in\mathcal{P}_{i} independent and no tail distinctness. Then

(7.49) O𝔠,k=Γ𝔠,k−ΞT,𝔠,k−ΞP,𝔠,k,O_{\mathfrak{c},k}=\Gamma_{\mathfrak{c},k}-\Xi_{T,\mathfrak{c},k}-\Xi_{P,% \mathfrak{c},k},

where ΞT\Xi_{T} collects unrestricted terms with pi=pjp_{i}=p_{j} for some forbidden pair (i,j)∈I⁢(𝐃)(i,j)\in I(\mathbf{D}). ΞP\Xi_{P} collects the remaining unrestricted terms with ai=aja_{i}=a_{j} for an equal-interval pair Ii=IjI_{i}=I_{j}. A prefix prime is at least z𝔠z_{\mathfrak{c}}, and every tail prime is below it. The primes of dd are below u𝔠≤Dju_{\mathfrak{c}}\leq D_{j}. Unequal grid intervals are disjoint. Hence every modulus in the support of ΞT\Xi_{T} or ΞP\Xi_{P} is divisible by p2p^{2} for a prime p≥u𝔠≥u0p\geq u_{\mathfrak{c}}\geq u_{0}. Here u0=Nℓ0⁢σ2u_{0}=N^{\ell_{0}\sigma^{2}}.

Support, cutoffs and constants.

Every supported modulus is coprime to 2⁢N2N. The cells are clipped to [u,μ∗)[u,\mu_{*}), and vpk⁢(x)=(1+x)/2v_{\rm pk}(x)=(1+x)/2 on [0,μ∗][0,\mu_{*}]. Thus Θ𝔠≥(1+t1)/2\Theta_{\mathfrak{c}}\geq(1+t_{1})/2. The actual coordinate bound x1≥x3≥ux_{1}\geq x_{3}\geq u on 𝔠¯\overline{\mathfrak{c}} also gives Θ𝔠≥(1+u)/2\Theta_{\mathfrak{c}}\geq(1+u)/2. Hence

(7.50) ℓ𝔠≥max⁡{A3−t3,2⁢ρ⁢t3}≥23⁢A3=33109240000,A3=12−ηL−32⁢μ∗,\ell_{\mathfrak{c}}\geq\max\{A_{3}-t_{3},2\rho t_{3}\}\geq\tfrac{2}{3}A_{3}=% \tfrac{33109}{240000},\qquad A_{3}=\tfrac{1}{2}-\eta_{L}-\tfrac{3}{2}\mu_{*},

and ℓ𝔠−ℓ0≥231463/24720000\ell_{\mathfrak{c}}-\ell_{0}\geq 231463/24720000. By the cubic tail conditions, ∑jsj<ℓ𝔠\sum_{j}s_{j}<\ell_{\mathfrak{c}} for sj=logN⁡Djs_{j}=\log_{N}D_{j}. Thus every supported modulus satisfies

(7.51) q<Nρ⁢(t1+t2+t3)+σ⁢ℓ𝔠+ρ⁢ℓ𝔠≤NeQ,eQ=(ρ+σ)⁢(Hmax−ηL)<35,Hmax=153256.q<N^{\rho(t_{1}+t_{2}+t_{3})+\sigma\ell_{\mathfrak{c}}+\rho\ell_{\mathfrak{c}}% }\leq N^{e_{Q}},\qquad e_{Q}=(\rho+\sigma)(H_{\max}-\eta_{L})<\tfrac{3}{5},% \qquad H_{\max}=\tfrac{153}{256}.

Since the cell ceiling gives 0<ℓ𝔠≤Hmax=153/256<10<\ell_{\mathfrak{c}}\leq H_{\max}=153/256<1 and 0<σ≤10−100<\sigma\leq 10^{-10}, ℓ𝔠⁢σ2<σ2<u=1/500\ell_{\mathfrak{c}}\sigma^{2}<\sigma^{2}<u=1/500. Thus u𝔠=Nℓ𝔠⁢σ2<Nuu_{\mathfrak{c}}=N^{\ell_{\mathfrak{c}}\sigma^{2}}<N^{u}. The cutoff comparison uses only this exponent inequality.

Every labelled prime is at least u𝔠u_{\mathfrak{c}}, so the number of labels is below 3/(5⁢ℓ0⁢σ2)3/(5\ell_{0}\sigma^{2}). With Mσ=⌈3/(5⁢ℓ0⁢σ2)⌉M_{\sigma}=\lceil 3/(5\ell_{0}\sigma^{2})\rceil and the vector count exp⁡(8⁢σ−3)\exp(8\sigma^{-3}), one has |Γ𝔠,k|,|ΞT|,|ΞP|≤Mσ!|\Gamma_{\mathfrak{c},k}|,|\Xi_{T}|,|\Xi_{P}|\leq M_{\sigma}!, and ∑𝔠,k(|Γ𝔠,k|+|ΞT|+|ΞP|)≤CK2,σ′\sum_{\mathfrak{c},k}\bigl{(}|\Gamma_{\mathfrak{c},k}|+|\Xi_{T}|+|\Xi_{P}|% \bigr{)}\leq C^{\prime}_{\mathrm{K2},\sigma}.

The squareful terms.

Since |ΔAb⁢(q,N)|≤2⁢(N/q+1)+2⁢N/φ⁢(q)|\Delta_{A_{b}}(q,N)|\leq 2(N/q+1)+2N/\varphi(q), Paper I, (B.5), with Y=u0Y=u_{0} and Qsupp=NeQQ_{\rm supp}=N^{e_{Q}} gives

(7.52) ∑𝔠,k∑q|ΞT,𝔠,k⁢(q)+ΞP,𝔠,k⁢(q)|⁢|ΔAb⁢(q,N)|≪σN1−ℓ0⁢σ2⁢L.\sum_{\mathfrak{c},k}\sum_{q}|\Xi_{T,\mathfrak{c},k}(q)+\Xi_{P,\mathfrak{c},k}% (q)|\,|\Delta_{A_{b}}(q,N)|\ll_{\sigma}N^{1-\ell_{0}\sigma^{2}}L.
Prime detection and the two Heath–Brown expansions.

Put z1=N1/(log⁡L)3z_{1}=N^{1/(\log L)^{3}}, so z1≥z0⁢(X)z_{1}\geq z_{0}(X) for every occurring box scale ε⁢N/2≤X≤N\varepsilon N/2\leq X\leq N. Both source primes exceed z1z_{1}. Apply Paper I, (B.7), to 1ℙ⁢(m)1_{\mathbb{P}}(m) and to 1ℙ⁢(p′)1_{\mathbb{P}}(p^{\prime}). Apply Paper I, (B.9), with roughness z1z_{1}, to Λz1⁢(m)\Lambda_{z_{1}}(m) with cap U1=2⁢N1/6U_{1}=2N^{1/6} and to Λz1⁢(p′)\Lambda_{z_{1}}(p^{\prime}) with cap U2=2⁢N(1−b)/3U_{2}=2N^{(1-b)/3}. The identities apply since m≤N1/2<U13m\leq N^{1/2}<U_{1}^{3} and p′≤N1−b<U23p^{\prime}\leq N^{1-b}<U_{2}^{3}. For patterns j,j′∈{1,2,3}j,j^{\prime}\in\{1,2,3\} the tested index is a labelled tuple 𝐯=(𝐯(1),𝐯(2))∈ℛz12⁢j+2⁢j′\mathbf{v}=(\mathbf{v}^{(1)},\mathbf{v}^{(2)})\in\mathcal{R}_{z_{1}}^{2j+2j^{% \prime}}, at most twelve coordinates, with

m=∏𝐯(1),p′=∏𝐯(2),e=m⁢p′,Nb≤m≤N1/2,ε⁢N<e≤N′,m=\textstyle\prod\mathbf{v}^{(1)},\quad p^{\prime}=\prod\mathbf{v}^{(2)},\quad e% =mp^{\prime},\quad N^{b}\leq m\leq N^{1/2},\quad\varepsilon N<e\leq N^{\prime},

the Möbius coordinates of 𝐯(i)\mathbf{v}^{(i)} at most UiU_{i}, and coefficient cj⁢(𝐯(1))⁢cj′⁢(𝐯(2))/(log⁡m⁢log⁡p′)c_{j}(\mathbf{v}^{(1)})c_{j^{\prime}}(\mathbf{v}^{(2)})/(\log m\log p^{\prime}). Here cjc_{j} is the coefficient after (B.10). For a fixed product ee, put

(7.53) 𝒮e⁢(q;N):=Δδe⁢(q,N)=1e≡N⁢(q)−1(e,q)=1φ⁢(q).\mathcal{S}_{e}(q;N):=\Delta_{\delta_{e}}(q,N)=1_{e\equiv N\ (q)}-\frac{1_{(e,% q)=1}}{\varphi(q)}.

Thus the Heath–Brown tuple map uses the point-mass discrepancy 𝒮e⁢(q;N)\mathcal{S}_{e}(q;N). The exact weighted point-mass expansion is

ΔAb⁢(q,N)=∑eAb⁢(e)⁢𝒮e⁢(q;N).\Delta_{A_{b}}(q,N)=\sum_{e}A_{b}(e)\mathcal{S}_{e}(q;N).

The weight Ab⁢(e)A_{b}(e) keeps both eligible ordered orientations, as in (7.2). A prime square is counted once. The proper-power remainder ℰpp\mathcal{E}_{\rm pp} consists of the pairs in which mm or p′p^{\prime} is a proper prime power. For every fixed (𝔠,k)(\mathfrak{c},k),

(7.54) ∑qΓ𝔠,k⁢(q)⁢ΔAb⁢(q,N)=ℰpp+∑j,j′∑𝐯cj⁢(𝐯(1))⁢cj′⁢(𝐯(2))log⁡m⁢log⁡p′⁢∑qΓ𝔠,k⁢(q)⁢𝒮e⁢(q;N),\sum_{q}\Gamma_{\mathfrak{c},k}(q)\Delta_{A_{b}}(q,N)=\mathcal{E}_{\rm pp}+% \sum_{j,j^{\prime}}\sum_{\mathbf{v}}\frac{c_{j}(\mathbf{v}^{(1)})c_{j^{\prime}% }(\mathbf{v}^{(2)})}{\log m\log p^{\prime}}\sum_{q}\Gamma_{\mathfrak{c},k}(q)% \mathcal{S}_{e}(q;N),

exactly. Each tuple keeps the natural discrepancy of its own product. The per-cell coefficient bound is the factorial bound above; the sum over cells uses the separate aggregate bound defined there. Since e<Ne<N, |cj⁢cj′|/(log⁡m⁢log⁡p′)≤9|c_{j}c_{j^{\prime}}|/(\log m\log p^{\prime})\leq 9 and ∑q|Γ⁢(q)|⁢|𝒮e⁢(q;N)|≤CK2,σ⁢F⁢(e)\sum_{q}|\Gamma(q)||\mathcal{S}_{e}(q;N)|\leq C_{\mathrm{K2},\sigma}F(e) with F⁢(e)=τ⁢(N−e)+2⁢(1+L)F(e)=\tau(N-e)+2(1+L). The tuple multiplicity is at most τ12⁢(e)\tau_{12}(e). The divisor bounds τ122≤τ144\tau_{12}^{2}\leq\tau_{144}, τ4≤τ16\tau^{4}\leq\tau_{16} and Cauchy–Schwarz give

(7.55) ∑e<Nτ12⁢(e)⁢F⁢(e)≪N⁢L73,∑e<Nτ12⁢(e)⁢F⁢(e)2≪N⁢L79.\sum_{e<N}\tau_{12}(e)F(e)\ll NL^{73},\qquad\sum_{e<N}\tau_{12}(e)F(e)^{2}\ll NL% ^{79}.

There are ≪N1−b/2⁢L\ll N^{1-b/2}L proper-power pairs, and ∑e<Nτ⁢(e)⁢F⁢(e)2≪N⁢L9\sum_{e<N}\tau(e)F(e)^{2}\ll NL^{9}. Therefore

(7.56) |ℰpp|≪σ(N1−b/2⁢L)1/2⁢(N⁢L9)1/2=N1−b/4⁢L5.|\mathcal{E}_{\rm pp}|\ll_{\sigma}(N^{1-b/2}L)^{1/2}(NL^{9})^{1/2}=N^{1-b/4}L^% {5}.
Boxes, logarithm freezing and faces (H6).

Put δ=L−334\delta=L^{-334}. Use the equal-ratio mesh of Paper I, (B.12), with δX\delta_{X} replaced by δ\delta, on every ambient coordinate axis. Keep {1}\{1\} as an atom. A box ℬ\mathcal{B} is a Cartesian product of cells. Its lower endpoints are ViV_{i}, and X=∏iViX=\prod_{i}V_{i}. Let λ1,λ2\lambda_{1},\lambda_{2} be the sums of log⁡Vi\log V_{i} over the two sides. Then ε⁢N/2≤X≤N\varepsilon N/2\leq X\leq N on every box meeting the source, so Kscale=1K_{\rm scale}=1. Replacing 1/(log⁡m⁢log⁡p′)1/(\log m\log p^{\prime}) by 1/(λ1⁢λ2)1/(\lambda_{1}\lambda_{2}) changes the weight by O⁢(L−335)O(L^{-335}), since λ1≥b⁢L/2\lambda_{1}\geq bL/2. By (7.55),

(7.57) |ELOG|≪σN⁢L72−334.|E_{\rm LOG}|\ll_{\sigma}NL^{72-334}.

The faces are m=Nbm=N^{b}, m=N1/2m=N^{1/2}, e=ε⁢Ne=\varepsilon N, e=N′e=N^{\prime}, and the cap faces vi=U1v_{i}=U_{1}, vi=U2v_{i}=U_{2} on Möbius coordinates. All are singletons. On each, an active coordinate is at least N1/20N^{1/20}. Paper I, Lemma (B.14), with s≤12s\leq 12, Kγ=1K_{\gamma}=1 and ηdist≤12⁢δ\eta_{\rm dist}\leq 12\delta, gives at most ≪N⁢L11−334\ll NL^{11-334} boundary tuples. Cauchy–Schwarz with (7.55) gives

(7.58) |Ebdry|≪σN⁢L45−334/2.|E_{\rm bdry}|\ll_{\sigma}NL^{45-334/2}.

Thus (H6) holds with clog=72c_{\log}=72, cR=45c_{R}=45. On a nonboundary box every source cut and cap is constant. The coefficient is the outer scalar cℬ=(−1)j+j′⁢(3j)⁢(3j′)⁢(log⁡X)2/(λ1⁢λ2)c_{\mathcal{B}}=(-1)^{j+j^{\prime}}\binom{3}{j}\binom{3}{j^{\prime}}(\log X)^{% 2}/(\lambda_{1}\lambda_{2}), times w⁢(𝐯)=∏iwi⁢(vi)w(\mathbf{v})=\prod_{i}w_{i}(v_{i}) with wi∈{μz1,1ℛz1,(log⁡v/log⁡X)⁢1ℛz1}w_{i}\in\{\mu_{z_{1}},1_{\mathcal{R}_{z_{1}}},(\log v/\log X)1_{\mathcal{R}_{z% _{1}}}\}. Each side carries exactly one logarithmic coordinate, and (log⁡X)2/(λ1⁢λ2)≤1/(b⁢(1−b))+o⁢(1)≤4.5+o⁢(1)(\log X)^{2}/(\lambda_{1}\lambda_{2})\leq 1/(b(1-b))+o(1)\leq 4.5+o(1), hence the scalar norm bound ∥cℬ∥∞≤45\lVert c_{\mathcal{B}}\rVert_{\infty}\leq 45. Each coordinate meets at most 2⁢L3352L^{335} cells, so

(7.59) ∑𝔠,k∑j,j′∑ℬ|cℬ|≪σL4020≤L4022,K0=4022≤24⁢Cbox+26=8042.\sum_{\mathfrak{c},k}\sum_{j,j^{\prime}}\sum_{\mathcal{B}}|c_{\mathcal{B}}|\ll% _{\sigma}L^{4020}\leq L^{4022},\qquad K_{0}=4022\leq 24C_{\rm box}+26=8042.
Classification.

Let ei=logN⁡Vie_{i}=\log_{N}V_{i}, 𝒲=[60⁢σ,1/3+14⁢σ]\mathcal{W}=[60\sigma,1/3+14\sigma], and κ=(log⁡2+12⁢log⁡(1+δ))/L≤σ/202\kappa=(\log 2+12\log(1+\delta))/L\leq\sigma/202. A box is Type II if some ei∈𝒲e_{i}\in\mathcal{W}. Select the largest such eie_{i}, breaking ties by the fixed coordinate order. Otherwise every Möbius coordinate is small, since 1/6+κ1/6+\kappa and (1−b)/3+κ(1-b)/3+\kappa are below 1/3+14⁢σ1/3+14\sigma. On the mm-side, ∑ei≥b−κ>360⁢σ\sum e_{i}\geq b-\kappa>360\sigma. On the p′p^{\prime}-side, ∑ei≥1/2−κ−log⁡(1/ε)/L>360⁢σ\sum e_{i}\geq 1/2-\kappa-\log(1/\varepsilon)/L>360\sigma. These are the only side bounds needed to rule out an all-small side. Together with the global Heath–Brown sum bound ∑ei<1+κ\sum e_{i}<1+\kappa, the threshold 1/3+14⁢σ1/3+14\sigma permits at most two large variables. Hence each side has exactly one large smooth coordinate. Every other box has exactly two large smooth coordinates N1≥N2≥X1/3N_{1}\geq N_{2}\geq X^{1/3}. It has at most ten small coordinates, of product MM, with

(7.60) logX⁡M≤(600+1/202)⁢σ1−σ/101<6.02⋅10−8,N1⁢N2⁢M≤230⁢X,q<X0.5977.\log_{X}M\leq\frac{(600+1/202)\sigma}{1-\sigma/101}<6.02\cdot 10^{-8},\qquad N% _{1}N_{2}M\leq 2^{30}X,\qquad q<X^{0.5977}.

There are no Type-I-1 boxes.

Type-II boxes: Paper I, (H1)–(H5) and LEN.

Fix (𝔠,k)(\mathfrak{c},k) and a Type-II box. Let its selected lower endpoint be TT, put ξ=logN⁡T\xi=\log_{N}T, and let the other lower endpoints have product M=X/TM=X/T.

H1.:

Cℬ=Γ𝔠,kC_{\mathcal{B}}=\Gamma_{\mathfrak{c},k} has the form (3.4). Here JJ is the three prefix labels and the tail labels. The prime sets are 𝒫i\mathcal{P}_{i} and 𝒬k,j\mathcal{Q}_{k,j}, uL=u𝔠≥u0u_{L}=u_{\mathfrak{c}}\geq u_{0}, and d∣PN⁢(u𝔠)d\mid P_{N}(u_{\mathfrak{c}}) is squarefree. Repeated primes are kept. We have q≤X0.6q\leq X^{0.6} by (7.51) once (3/5−eQ)⁢L≥(3/5)⁢log⁡(2/ε)(3/5-e_{Q})L\geq(3/5)\log(2/\varepsilon). Also (q,2⁢N)=1(q,2N)=1. The selector χ𝔠\chi_{\mathfrak{c}} is constant on the block. The removed corrections are ΞT,ΞP\Xi_{T},\Xi_{P} and ℰpp\mathcal{E}_{\rm pp}. There is no comparator correction, since the comparator is natural on every tuple.

H2.:

Take the upper exponents t1′≥t2′≥t3′t_{1}^{\prime}\geq t_{2}^{\prime}\geq t_{3}^{\prime} and min⁡(ρ⁢sj,t3)\min(\rho s_{j},t_{3}). For d∗=ρ⁢(Θ𝔠−ηL)d_{*}=\rho(\Theta_{\mathfrak{c}}-\eta_{L}), the merged list satisfies WF⁢(d∗)\mathrm{WF}(d_{*}). The reserves are ρ⁢(1/2−ηL−3⁢μ∗/2)=33109⁢ρ/160000\rho(1/2-\eta_{L}-3\mu_{*}/2)=33109\rho/160000, ρ⁢(1/2−ηL−5⁢μ∗/2)=1859⁢ρ/160000\rho(1/2-\eta_{L}-5\mu_{*}/2)=1859\rho/160000, ρ⁢(ℓ𝔠−t3)≥ρ⁢(2⁢ρ−1)⁢t3\rho(\ell_{\mathfrak{c}}-t_{3})\geq\rho(2\rho-1)t_{3}. For a tail rank, the reserve is ρ\rho times the strict inequality ∑i<jsi+2⁢sj<ℓ𝔠\sum_{i<j}s_{i}+2s_{j}<\ell_{\mathfrak{c}} from the 𝒟−\mathcal{D}^{-} conditions. Put h=d∗+60⁢σh=d_{*}+60\sigma, δpk=30⁢σ\delta_{\rm pk}=30\sigma, g=ξ−30⁢σg=\xi-30\sigma. Then h−1/2≥9⋅10−4h-1/2\geq 9\cdot 10^{-4}, Θ𝔠−h>0.0000999939\Theta_{\mathfrak{c}}-h>0.0000999939, h≤Hmaxh\leq H_{\max},

30⁢σ≤g≤1/3−16⁢σ,δpk=30⁢σ,g≤1/3−δpk/2.30\sigma\leq g\leq 1/3-16\sigma,\qquad\delta_{\rm pk}=30\sigma,\qquad g\leq 1/% 3-\delta_{\rm pk}/2.

The upper requirement has reserve at least σ\sigma, since (1/3−15⁢σ)−(1/3−16⁢σ)=σ(1/3-15\sigma)-(1/3-16\sigma)=\sigma. Also h≤Θ𝔠≤H~⁢(t1′,t2′,t3′)h\leq\Theta_{\mathfrak{c}}\leq\widetilde{H}(t_{1}^{\prime},t_{2}^{\prime},t_{3% }^{\prime}) because (t1′,t2′,t3′)∈𝔠¯(t_{1}^{\prime},t_{2}^{\prime},t_{3}^{\prime})\in\overline{\mathfrak{c}} and t1′≤μ∗t_{1}^{\prime}\leq\mu_{*}. Paper I, Theorem 4.1, gives J=J1⊔J2⊔J3J=J_{1}\sqcup J_{2}\sqcup J_{3}. Put dd in slot one, with γs\gamma_{s} as in Paper I, (3.5). The tuple map gives Γ𝔠,k=M𝔠−1⁢Cslot⁢(γ1∗γ2∗γ3)\Gamma_{\mathfrak{c},k}=M_{\mathfrak{c}}^{-1}C_{\rm slot}(\gamma_{1}*\gamma_{2% }*\gamma_{3}), Cslot≤Mσ!C_{\rm slot}\leq M_{\sigma}!, |γs|≤1|\gamma_{s}|\leq 1. Slots two and three are u0u_{0}-rough, and empty slots carry the atom 1v=11_{v=1}. The scalar M𝔠−1M_{\mathfrak{c}}^{-1} is an outer coefficient.

H3.:

Let Q,R,SQ,R,S be the scales of γ1,γ3,γ2\gamma_{1},\gamma_{3},\gamma_{2}. The loads (4.3), the slot-one load σ⁢ℓ𝔠≤σ⁢Hmax\sigma\ell_{\mathfrak{c}}\leq\sigma H_{\max} of dd, and A0=X1+σ/20A_{0}=X^{1+\sigma/20} give reductions (7527/256, 60, 114421/1280, 26247/256)⁢σ(7527/256,\,60,\,114421/1280,\,26247/256)\sigma. They are, in turn, in Q/TQ/T, T2⁢R2⁢ST^{2}R^{2}S, A07/32⁢T⁢Q⁢R2⁢S5A_{0}^{7/32}TQR^{2}S^{5}, (T⁢R/S)7/16⁢T⁢Q⁢R2⁢S5(TR/S)^{7/16}TQR^{2}S^{5}. The required reductions are 29,8,15,1529,8,15,15, with losses at most 2⁢ω2\omega, ω=logN⁡(N/X)≤σ/202\omega=\log_{N}(N/X)\leq\sigma/202. We also have logN⁡(Q⁢R⁢S)≤eQ\log_{N}(QRS)\leq e_{Q}, so Q⁢R⁢S<MI⁢X−89⁢σQRS<M_{I}X^{-89\sigma} with reserve >0.0691>0.0691. Next, NI≥Q⁢Xσ/3N_{I}\geq QX^{\sigma/3} with reserve 29.069⁢σ29.069\sigma, and MI≥X1/2M_{I}\geq X^{1/2}. Thus (3.6)–(3.7) hold. The selected coefficient is αn=wsel⁢(n)⁢1IT⁢(n)∈{μ⁢(n),1,log⁡n/log⁡X}⁢1P−⁢(n)≥z1⁢1IT⁢(n)\alpha_{n}=w_{\rm sel}(n)1_{I_{T}}(n)\in\{\mu(n),1,\log n/\log X\}1_{P^{-}(n)% \geq z_{1}}1_{I_{T}}(n), with ζ=z1≥z0⁢(X)\zeta=z_{1}\geq z_{0}(X) and IT=(T,(1+Δ)⁢T]I_{T}=(T,(1+\Delta)T]. The complementary coefficient βm♯\beta_{m^{\sharp}}, the product of the other at most eleven weights, satisfies |βm♯|≤τ11⁢(m♯)≤τ23⁢(m♯)|\beta_{m^{\sharp}}|\leq\tau_{11}(m^{\sharp})\leq\tau_{23}(m^{\sharp}). Here τ23=d23\tau_{23}=d_{23} is the 23-fold divisor function, with d23⁢(n)=∑n=n1⁢⋯⁢n231d_{23}(n)=\sum_{n=n_{1}\cdots n_{23}}1. As in Paper I, (B.22)–(B.23), with at most eleven complementary cells, NI≥T/(6⁢L334)N_{I}\geq T/(6L^{334}), MI=M⁢((1+Δ)r−1)≍M⁢L−334M_{I}=M((1+\Delta)^{r}-1)\asymp ML^{-334}, m0=M⁢(1+(1+Δ)r)/2≤2⁢X/Tm_{0}=M(1+(1+\Delta)^{r})/2\leq 2X/T, so Cctr=2C_{\rm ctr}=2. On the doubled support, m⁢n≤X⁢(1+Δ)⁢(1+32⁢((1+Δ)11−1))≤N′⁢(1+20⁢δ)mn\leq X(1+\Delta)(1+\tfrac{3}{2}((1+\Delta)^{11}-1))\leq N^{\prime}(1+20\delta), because X≤e≤N′X\leq e\leq N^{\prime} for every tested product of the box. Hence N−m⁢n≥N⁢L−334⁢(L−20)≥1N-mn\geq NL^{-334}(L-20)\geq 1 and |m⁢n−N|≤N<X3|mn-N|\leq N<X^{3}, which is (3.10). The integer convention of ITI_{T} is that of Paper I, Lemma B.22, since the mesh and the roughness are the same. LEN follows from the condition

(7.61) σ⁢L≥2130⁢(335)⁢(log⁡L+1).\sigma L\geq 2^{130}(335)(\log L+1).

It gives T2−126≥12⁢L334T^{2^{-126}}\geq 12L^{334} and NI≥(2⁢T)1−2−126N_{I}\geq(2T)^{1-2^{-126}}.

H4.:

a=Na=N, 0<N≤X⁢L≤A00<N\leq XL\leq A_{0}, and every supported modulus is coprime to 2⁢N2N.

H5.:

N60⁢σ≤T≤N1/3+14⁢σN^{60\sigma}\leq T\leq N^{1/3+14\sigma}, and (3.99) gives T≤X1/3+15⁢σT\leq X^{1/3+15\sigma} and T<X1/2T<X^{1/2}.

The selected-factor Siegel–Walfisz bound is Paper I, (3.25). It is proved for these three coefficient classes with any ζ≥z0\zeta\geq z_{0}. In the large-norm case of Paper I, (3.48), the zero mode uses Lemma 6.5(ii) in place of [3, Theorem 0(a)]. Its premises (3.1), (3.2), (3.6), (3.8) with LEN, (3.11) and (3.25)–(3.27) are those verified above. Theorem 2.8 of Paper I enters only inside the proof of Theorem 3.2, with the dictionary

(7.62) rT=z,sT=p0,nT=p0⁢m,aT=εy⁢N,NT=8⁢p0⁢H∗⁢S⁢F,AT=A0,r_{T}=z,\quad s_{T}=p_{0},\quad n_{T}=p_{0}m,\quad a_{T}=\varepsilon_{y}N,% \quad N_{T}=8p_{0}H_{*}SF,\quad A_{T}=A_{0},

both signs, all nine smooth weights and the full bracket. Paper I, Theorem 3.2, (3.13), gives, uniformly in the box, the block and the cell,

(7.63) |SℬPSDT|≪σ,A′X⁢L−A′+X1−cσ⁢LC,SℬPSDT=∑qΓ𝔠,k⁢(q)⁢∑𝐯∈ℬw⁢(𝐯)⁢𝒮e⁢(q;N).|S_{\mathcal{B}}^{\rm PSDT}|\ll_{\sigma,A^{\prime}}XL^{-A^{\prime}}+X^{1-c_{% \sigma}}L^{C},\qquad S_{\mathcal{B}}^{\rm PSDT}=\sum_{q}\Gamma_{\mathfrak{c},k% }(q)\sum_{\mathbf{v}\in\mathcal{B}}w(\mathbf{v})\mathcal{S}_{e}(q;N).

With A=4A=4, Cbox=334C_{\rm box}=334, A′=A+24⁢Cbox+31=8051A^{\prime}=A+24C_{\rm box}+31=8051 and (7.59), Paper I, (3.92), gives

(7.64) EII=∑|cℬ|⁢|SℬPSDT|≪b,σN⁢L4022−8051+N1−cσ⁢L4022+C.E_{\rm II}=\sum|c_{\mathcal{B}}|\,|S_{\mathcal{B}}^{\rm PSDT}|\ll_{b,\sigma}NL% ^{4022-8051}+N^{1-c_{\sigma}}L^{4022+C}.

Here SℬPSDTS_{\mathcal{B}}^{\rm PSDT} already contains Γ𝔠,k\Gamma_{\mathfrak{c},k}, hence its factor M𝔠−1M_{\mathfrak{c}}^{-1} from (7.49). The coefficient norm (7.59) sums only |cℬ||c_{\mathcal{B}}|, so the orbit factor is paid exactly once.

Lemma 7.2 (Relaxed Type-I-2 estimate).

The source hypotheses are the Type-I-2 conditions (SH1)–(SH5) stated in Paper I:

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)

    The tested geometric source and cap restrictions are constant on each nonboundary box; the roughness sieve is separate as in (SH3). 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.

Assume (SH1)–(SH5) for a nonboundary K2 box. Let the two large smooth variables have nonnegative weights w1,w2w_{1},w_{2} and N1,N2≥X1/3N_{1},N_{2}\geq X^{1/3}. Let the remaining small variables, at most ten, have product MM. Assume

M≤X6.02⋅10−8,N1⁢N2⁢M≤230⁢X,q<X0.5977,M\leq X^{6.02\cdot 10^{-8}},\qquad N_{1}N_{2}M\leq 2^{30}X,\qquad q<X^{0.5977},

and |αm|≪τ10⁢(m)≤τ⁢(m)9|\alpha_{m}|\ll\tau_{10}(m)\leq\tau(m)^{9}. Then, for every fixed A>0A>0, uniformly in the supported unit residues,

∑q≍Q|γ⁢(q)|⁢|∑mαm⁢∑ni∈Ii,P−⁢(ni)≥z∗w1⁢(n1)⁢w2⁢(n2)⁢𝒮m⁢n1⁢n2⁢(q;a)|≪σ,AX⁢L−A.\sum_{q\asymp Q}|\gamma(q)|\left|\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)% \right|\ll_{\sigma,A}XL^{-A}.

The same statement holds for a fixed finite sum of signed weights. Split each bounded real weight into its two nonnegative parts.

Proof.

Restrict first to (m,q)=1(m,q)=1, and write Δ=C−Mq\Delta=C-M_{q} for the positive congruence and comparator functionals. In the K2 application the inner product is e=m⁢n1⁢n2e=mn_{1}n_{2}, the residue is NN, and (q,N)=1(q,N)=1. If (m,q)>1(m,q)>1, then (e,q)>1(e,q)>1, so both 1e≡N⁢(q)1_{e\equiv N\ (q)} and the comparator 1(e,q)=1/φ⁢(q)1_{(e,q)=1}/\varphi(q) vanish. The omitted range contributes zero. Apply the Brun–Bonferroni sandwich of Paper I, (3.102)–(3.104), at Df=XϵI/2D_{f}=X^{\epsilon_{I}/2}, ϵI=7.5⁢σ\epsilon_{I}=7.5\sigma. For a requested fixed logarithmic precision AsvA_{\rm sv}, put

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

and increase the common threshold until J≥max⁡{2,e2⁢E,Asv⁢log⁡L}J\geq\max\{2,e^{2}E,A_{\rm sv}\log L\}. Since sf≍σ⁢(log⁡log⁡N)3s_{f}\asymp\sigma(\log\log N)^{3} and E=O⁢(log⁡log⁡N)E=O(\log\log N), this is eventual at fixed σ\sigma, and EJ/J!≤L−AsvE^{J}/J!\leq L^{-A_{\rm sv}}.

For the two large factors put Ri=1P−⁢(ni)≥z∗R_{i}=1_{P^{-}(n_{i})\geq z^{*}} and Gi=Ψi+−Ψi−≥0G_{i}=\Psi_{i}^{+}-\Psi_{i}^{-}\geq 0. Positivity gives

Ψ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}^{+},

so the three signed gaps and the two nonnegative comparator gaps bound |Δ⁢(R1⁢R2)||\Delta(R_{1}R_{2})|, as in Paper I, (3.113). Expand the three gaps over di≤Dfd_{i}\leq D_{f}. The completed hyperbola estimate (3.109) gives OϵX⁢(Df2⁢q1/2⁢XϵX)O_{\epsilon_{X}}(D_{f}^{2}q^{1/2}X^{\epsilon_{X}}). Here we fix ϵX=10−4\epsilon_{X}=10^{-4}. Squareful moduli are included by the full-modulus Weil–Estermann bound.

The two one-dimensional sieve gaps satisfy

∑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},% \qquad\sum_{n\in I_{i}}\Psi_{i}^{+}(n)w_{i}(n)\ll N_{i}+D_{f}.

Thus the total is bounded by

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

The ten-variable check uses the following upper bound. The expression is increasing throughout 0<σ≤10−100<\sigma\leq 10^{-10}, so its maximum is evaluated at σ=10−10\sigma=10^{-10}:

600⁢σ+κ1−ω≤(600+1/202)⁢σ1−σ/101≤(600+1/202)⁢10−101−10−10/101=1212012019999999998≈6.0000495049564356926⋅10−8<6.02⋅10−8,\frac{600\sigma+\kappa}{1-\omega}\leq\frac{(600+1/202)\sigma}{1-\sigma/101}% \leq\frac{(600+1/202)10^{-10}}{1-10^{-10}/101}=\frac{121201}{2019999999998}% \approx 6.0000495049564356926\cdot 10^{-8}<6.02\cdot 10^{-8},

where ω,κ≤σ/202\omega,\kappa\leq\sigma/202 absorb all fixed dyadic factors, so 1−ω≥1−σ/202≥1−σ/1011-\omega\geq 1-\sigma/202\geq 1-\sigma/101, consistently with (7.60). Eleven small variables would give 1333212019999999998≈6.600049504957030⋅10−8\frac{133321}{2019999999998}\approx 6.600049504957030\cdot 10^{-8}, which exceeds the allowed bound. With q<X0.5977q<X^{0.5977}, the first exponent in (I-2’) is at most

6.02⋅10−8+7.5⋅10−10+1.5⁢(0.5977)+ϵX=0.89665006095<0.897,6.02\cdot 10^{-8}+7.5\cdot 10^{-10}+1.5(0.5977)+\epsilon_{X}=0.89665006095<0.8% 97,

leaving slack 0.000349939050.00034993905. Also, using N1⁢N2⁢M≤230⁢XN_{1}N_{2}M\leq 2^{30}X, N1≥N2≥X1/3N_{1}\geq N_{2}\geq X^{1/3}, and Df=X3.75⁢σD_{f}=X^{3.75\sigma},

M⁢Df⁢(N1+N2)≤231⁢Df⁢X/N2≪X2/3+3.75⋅10−10<X0.668,M⁢Df2≤X6.02⋅10−8+7.5⋅10−10<X0.668.MD_{f}(N_{1}+N_{2})\leq 2^{31}D_{f}X/N_{2}\ll X^{2/3+3.75\cdot 10^{-10}}<X^{0.% 668},\qquad MD_{f}^{2}\leq X^{6.02\cdot 10^{-8}+7.5\cdot 10^{-10}}<X^{0.668}.

The coefficient bound uses τ10⁢(m)≤τ⁢(m)9\tau_{10}(m)\leq\tau(m)^{9}, so B0=9B_{0}=9 is fixed. Finally, a family of at most Oσ⁢(LK)O_{\sigma}(L^{K}) boxes is absorbed by requesting Asv≥K+A+5A_{\rm sv}\geq K+A+5, after all fixed logarithmic losses. This proves the lemma. ∎

Type-I-2 boxes: the complementary estimate.

Lemma 7.2 is a relaxed form of Paper I, (3.111), for this source. Below we check each displayed hypothesis against the actual K2 source.

For the present K2 Type-I-2 box, the nontrivial SH2 check is the display

(7.65) 1≤v≤X,w⁢(v)∈{1,log⁡vlog⁡X},P−⁢(ni)≥z∗⁢is a separate tested condition,sup|1|+V⁢(1)=1,sup|log⁡vlog⁡X|+V⁢(log⁡vlog⁡X)≤1+2⁢log⁡(1+L−334)log⁡X=O⁢(1).\begin{gathered}1\leq v\leq X,\qquad w(v)\in\left\{1,\frac{\log v}{\log X}% \right\},\qquad P^{-}(n_{i})\geq z^{*}\ \text{is a separate tested condition},% \\ \sup|1|+V(1)=1,\qquad\sup\left|\frac{\log v}{\log X}\right|+V\!\left(\frac{% \log v}{\log X}\right)\leq 1+\frac{2\log(1+L^{-334})}{\log X}=O(1).\end{gathered}

Thus the two tested large factors have the required nonnegative weights and bounded supremum plus variation. The roughness condition is not hidden inside the weight.

For the Type-I-2 boxes above, (SH1) has γ=Γ𝔠,k\gamma=\Gamma_{\mathfrak{c},k}. The support and bound are (7.51) and (7.49), eQ<153/256e_{Q}<153/256, and the residue is the unit a=Na=N. The partition construction proves the geometric constancy in (SH2) on each nonboundary box. In this two-large-variable case the two tested large factors are the selected smooth factors. The roughness restriction is kept as the separate condition P−⁢(ni)≥z∗P^{-}(n_{i})\geq z^{*} in the inner sum. Their smooth weights are then individually 11 or log⁡v/log⁡X\log v/\log X, not μz1\mu_{z_{1}}. Hence they are nonnegative with sup|w|+V⁢(w)≪1\sup|w|+V(w)\ll 1 as required by (SH2). The μz1\mu_{z_{1}} factor occurs only among the complementary small factors. Condition (SH3) is z1≥z0⁢(X)z_{1}\geq z_{0}(X). Condition (SH4) is the natural full-product discrepancy fixed above. Condition (SH5) is the priority in the preceding boundary and Type-II classification.

On a large-coordinate cell (V,(1+δ)⁢V](V,(1+\delta)V], δ=L−334\delta=L^{-334}, one has 1≤V≤X1\leq V\leq X. The smooth weight w⁢(v)=1w(v)=1 has supremum plus variation equal to 1. The alternative w⁢(v)=log⁡v/log⁡Xw(v)=\log v/\log X is nonnegative and increasing, with

sup|w|+V⁢(w)≤1+2⁢log⁡(1+δ)log⁡X=O⁢(1).\sup|w|+V(w)\leq 1+\frac{2\log(1+\delta)}{\log X}=O(1).

The roughness restriction remains a separate tested condition under (SH3) and inside the sieve, and it is not claimed to be constant on a box.

Thus the relaxed estimate of this chapter applies with z∗=z1z^{*}=z_{1}, the two large smooth weights nonnegative, and

|αm♯|≤τ10⁢(m♯)≤τ⁢(m♯)9.|\alpha_{m^{\sharp}}|\leq\tau_{10}(m^{\sharp})\leq\tau(m^{\sharp})^{9}.

Each of the at most ten small labels contributes one factor. Normalized logarithmic weights log⁡v/log⁡X\log v/\log X are at most one on the support. Thus the coefficient hypothesis uses the fixed divisor exponent B0=9B_{0}=9, independent of NN. The first term of (I-2’) uses the following values. The slack is 0.000349939050.00034993905 at exponent 0.896650060950.89665006095. The two final terms have the bound 2/3+3.75⋅10−102/3+3.75\cdot 10^{-10}. The absorption is ω,κ≤σ/202\omega,\kappa\leq\sigma/202, and the divisor bound is τ10\tau_{10} with B0=9B_{0}=9. By (7.60), Lemma 7.2 applies to every K2 Type-I-2 box. Requesting AI=K+A+5A_{I}=K+A+5 for the fixed Oσ⁢(LK)O_{\sigma}(L^{K}) box family (here K=4022K=4022) gives

(7.66) EI2≪b,σN⁢L−A=N⁢L−4.E_{\rm I2}\ll_{b,\sigma}NL^{-A}=NL^{-4}.
Proposition 7.3 (Row-three remainder).

Fix b∈(1/3,1/2)b\in(1/3,1/2) and 0<σ≤10−100<\sigma\leq 10^{-10}. Under Paper I, Theorems 2.8 and 3.2, with the relaxed Type-I-2 Lemma 7.2 and Lemma 6.5(ii) at (3.48),

|r3|𝒩K≪b,σN−ℓ0⁢σ2⁢L3+N−b/4⁢L7+L−260+L−120+L−2+N−cσ⁢L4024+C.\frac{|r_{3}|}{\mathcal{N}_{K}}\ll_{b,\sigma}N^{-\ell_{0}\sigma^{2}}L^{3}+N^{-% b/4}L^{7}+L^{-260}+L^{-120}+L^{-2}+N^{-c_{\sigma}}L^{4024+C}.
Proof.

By (7.48) and (7.49), r3r_{3} is the Γ\Gamma-sum minus the squareful sum (7.52). By (7.54), the Γ\Gamma-sum is ℰpp\mathcal{E}_{\rm pp} plus the tuple sum. Every tuple lies in exactly one box. The boundary tuples give (7.58). On the other boxes logarithm freezing costs (7.57). Each box is of Type II or Type I-2. Sum (7.52), (7.56), (7.57), (7.58), (7.64) and (7.66), with Oσ⁢(1)O_{\sigma}(1) pairs (𝔠,k)(\mathfrak{c},k). Dividing by 𝒩K=(1−ε)⁢C⁢(N)⁢N/L2≥(1−ε)⁢C2⁢N/L2≫bN/L2\mathcal{N}_{K}=(1-\varepsilon)C(N)N/L^{2}\geq(1-\varepsilon)C_{2}N/L^{2}\gg_{% b}N/L^{2} gives the claim. ∎

Proposition 7.4 (Exterior source estimates).

Fix b,σb,\sigma before NN. For the source (7.2):

  1. (1)

    (7.32) and (7.35) hold for the two-orientation source and four signed AA main terms in (7.27) and (7.31);

  2. (2)

    (7.43) and (7.38) hold for N≥NAA⁢(b,σ)N\geq N_{\mathrm{AA}}(b,\sigma);

  3. (3)

    (7.46) holds for N≥Npeel⁢(σ)N\geq N_{\rm peel}(\sigma);

  4. (4)

    (7.47) holds.

Proof.

Item 1 is (7.33)–(7.34) and the derivation after (7.35). Item 2 is (7.40)–(7.42). Item 3 is (7.44)–(7.46). Item 4 is (7.25) and Proposition 7.3. ∎

Proposition 7.5 (Exterior comparison).

For fixed b,σb,\sigma there is a nonnegative rK⁢(N;b,σ)→0r_{K}(N;b,\sigma)\to 0 such that, for N≥Tr⁢(b,σ)N\geq T_{r}(b,\sigma) with TrT_{r} as defined below,

(7.67) 4⁢Bb⁢(N)W⁢(N)\displaystyle\frac{4B_{b}(N)}{W(N)} ≤cK⁢2,G⁢0⁢I⁢(b)+AK⁢(b)⁢CAA⁢σ+PK⁢σ9+rK⁢(N;b,σ),\displaystyle\leq c_{K2,G0}I(b)+A_{K}(b)C_{\mathrm{AA}}\sigma+P_{K}\sigma^{9}+% r_{K}(N;b,\sigma),
PK\displaystyle P_{K} =3884000001−ε=38840000000009999.\displaystyle=\frac{388400000}{1-\varepsilon}=\frac{3884000000000}{9999}.

Here TK=max⁡{Nmass⁢(b,σ),NAA⁢(b,σ),Npeel⁢(σ),Tlen}T_{K}=\max\{N_{\mathrm{mass}}(b,\sigma),N_{\mathrm{AA}}(b,\sigma),N_{\rm peel}% (\sigma),T_{\mathrm{len}}\}. The threshold NmassN_{\mathrm{mass}} is from the fixed-parameter estimate at (7.35). NAAN_{\mathrm{AA}} is from item 2 of Proposition 7.4. Both exist with b,σb,\sigma fixed. Finally, TlenT_{\mathrm{len}} is the named length and application threshold of Section 2. In addition,

(7.68) rK=Etop+[MK−𝒩K⁢2⁢e−γ⁢I⁢(b)⁢G∗]++∑j=03|rj|𝒩K=ob,σ⁢(1).r_{K}=\frac{E_{\rm top}+[M_{K}-\mathcal{N}_{K}2e^{-\gamma}I(b)G_{*}]_{+}+\sum_% {j=0}^{3}|r_{j}|}{\mathcal{N}_{K}}=o_{b,\sigma}(1).

In particular, let T^r\widehat{T}_{r} be the least even threshold above which rK≤δerr/10r_{K}\leq\delta_{\rm err}/10, and set Tr=max⁡{Nmass⁢(b,σ),NAA⁢(b,σ),TK,T^r}T_{r}=\max\{N_{\mathrm{mass}}(b,\sigma),N_{\mathrm{AA}}(b,\sigma),T_{K},% \widehat{T}_{r}\}. These thresholds exist at fixed b,σb,\sigma.

Remark 7.6 (Single payment of each error).

In [26, Theorem 2.6, (2.30)] the three summands X⁢V⁢EsXVE_{s}, R1νR_{1}^{\nu} and RνR^{\nu} are distinct. The first is paid only by (7.38), the other two only by (7.47). The decaying part of (7.40) and the o⁢(1)o(1) in (7.42) are absorbed by thresholds at fixed σ\sigma. The peel term P3P_{3} contains no linear-sieve application. Thus

rK=Etop+∑j|rj|+[MK−𝒩K⁢2⁢e−γ⁢I⁢(b)⁢G∗]+𝒩K,r_{K}=\frac{E_{\mathrm{top}}+\sum_{j}|r_{j}|+[M_{K}-\mathcal{N}_{K}2e^{-\gamma% }I(b)G_{*}]_{+}}{\mathcal{N}_{K}},

and no error is counted twice.

Proof.

Use (7.26) and divide by 𝒩K=W/4\mathcal{N}_{K}=W/4. The principal term is bounded by 𝒩K⁢2⁢e−γ⁢I⁢(b)⁢G∗\mathcal{N}_{K}2e^{-\gamma}I(b)G_{*} plus its positive part. Also 2⁢e−γ⁢G∗≤cK⁢2,G⁢02e^{-\gamma}G_{*}\leq c_{K2,G0} by (7.36)–(7.37). Proposition 7.4(2),(3) pay the sieve and peel terms above TrT_{r}. By definition, TrT_{r} includes Nmass⁢(b,σ)N_{\mathrm{mass}}(b,\sigma), NAA⁢(b,σ)N_{\mathrm{AA}}(b,\sigma) and TKT_{K}. The remaining terms form rKr_{K}. First, Etop/𝒩K≪L−331E_{\rm top}/\mathcal{N}_{K}\ll L^{-331}. The positive part contributes ob,σ⁢(1)o_{b,\sigma}(1) by (7.35). The row remainders are Ob,σ⁢(L−2)O_{b,\sigma}(L^{-2}) by (7.47). Hence rK=ob,σ⁢(1)r_{K}=o_{b,\sigma}(1). The convergence is ineffective through Siegel–Walfisz, so TrT_{r} exists but is not computed. ∎

8. The switched sum

We estimate the single term −Ssw/W-S_{\mathrm{sw}}/W. The normalization is (2.2). Fix σ\sigma as in (2.4). Put

(8.1) ηL=10−4,ε=10−4,Hmax=153256,ℓ0=2648972060000,ℓ1=1091000,Ncut=N⁢(1−L−333),𝒫N={p∈ℙ:p∤2⁢N}.\begin{gathered}\eta_{L}=10^{-4},\quad\varepsilon=10^{-4},\qquad H_{\max}=% \frac{153}{256},\qquad\ell_{0}=\frac{264897}{2060000},\qquad\ell_{1}=\frac{109% }{1000},\\ N_{\mathrm{cut}}=N(1-L^{-333}),\qquad\mathcal{P}_{N}=\{p\in\mathbb{P}:p\nmid 2% N\}.\end{gathered}

All limits in this section fix σ\sigma first.

8.1. A common nonnegative source

We use the prime-coordinate cells of Paper II [27, (5.29a)–(5.31)]. Their rules are

(8.2) I1=[α,β),I2=[β,λ),I3=[λ,1/3),I4=[1/3,1],CL3=5764−u−11⁢α5=64082419192000,vβ=2⁢(CL3−β)5,k1+k2+k3+k4=k,5≤k≤11,k1≥m1≥⋯≥mk2≥0,vj≤vβ⟹mj=k1,vj>vβ⟹xmj<CL3−52⁢vj≤xmj+1,wC=3+1k1=0−2⁢k1−2⁢k2−k3+(k12)+∑j=1k2mj.\begin{gathered}I_{1}=[\alpha,\beta),\quad I_{2}=[\beta,\lambda),\quad I_{3}=[% \lambda,1/3),\quad I_{4}=[1/3,1],\\ C_{\mathrm{L3}}=\frac{57}{64}-u-\frac{11\alpha}{5}=\frac{6408241}{9192000},% \qquad v_{\beta}=\frac{2(C_{\mathrm{L3}}-\beta)}{5},\\ k_{1}+k_{2}+k_{3}+k_{4}=k,\quad 5\leq k\leq 11,\quad k_{1}\geq m_{1}\geq\cdots% \geq m_{k_{2}}\geq 0,\\ v_{j}\leq v_{\beta}\ \Longrightarrow\ m_{j}=k_{1},\\ v_{j}>v_{\beta}\ \Longrightarrow\ x_{m_{j}}<C_{\mathrm{L3}}-\frac{5}{2}v_{j}% \leq x_{m_{j}+1},\\ w_{C}=3+1_{k_{1}=0}-2k_{1}-2k_{2}-k_{3}+\binom{k_{1}}{2}+\sum_{j=1}^{k_{2}}m_{% j}.\end{gathered}

The xix_{i} and vjv_{j} increase in I1I_{1} and I2I_{2}. The outer sentinels are infinite. Let 𝒞+\mathcal{C}_{+} contain the cells with wC>0w_{C}>0. For such a cell, put

(8.3) aC⁢(e)\displaystyle a_{C}(e) =1e=p1⁢⋯⁢pk,Nα≤p1<⋯<pk(logN⁡p1,…,logN⁡pk)∈C,\displaystyle=1_{\begin{subarray}{c}e=p_{1}\cdots p_{k},\ N^{\alpha}\leq p_{1}% <\cdots<p_{k}\\ (\log_{N}p_{1},\ldots,\log_{N}p_{k})\in C\end{subarray}},
A⁢(e)\displaystyle A(e) =∑C∈𝒞+wC⁢aC⁢(e)⁢1ε⁢N<e<Ncut,\displaystyle=\sum_{C\in\mathcal{C}_{+}}w_{C}a_{C}(e)1_{\varepsilon N<e<N_{% \mathrm{cut}}}, 0≤A⁢(e)\displaystyle 0\leq A(e) ≤36,\displaystyle\leq 36,
XA\displaystyle X_{A} =∑eA⁢(e),\displaystyle=\sum_{e}A(e), YA⁢(q)\displaystyle Y_{A}(q) =∑(e,q)=1A⁢(e),\displaystyle=\sum_{(e,q)=1}A(e),
CA⁢(q;N)\displaystyle C_{A}(q;N) =∑eA⁢(e)⁢1q∣N−e.\displaystyle=\sum_{e}A(e)1_{q\mid N-e}.

Since ∑jmj≤k1⁢k2\sum_{j}m_{j}\leq k_{1}k_{2}, we have

wC≤3+1k1=0−2⁢k1−2⁢k2−k3+k1⁢(k1−1)2+k1⁢k2≤36.w_{C}\leq 3+1_{k_{1}=0}-2k_{1}-2k_{2}-k_{3}+\frac{k_{1}(k_{1}-1)}{2}+k_{1}k_{2% }\leq 36.

For k1≥2k_{1}\geq 2, maximize at k3=0k_{3}=0, k2=11−k1k_{2}=11-k_{1}; the resulting concave quadratic has maximum 3636 at k1=10,11k_{1}=10,11. The cases k1=0,1k_{1}=0,1 give at most 4,14,1. The strict cells are disjoint, so this proves the bound for AA. Every prime is permitted in AA. In particular, AA has no factor 1(e,2⁢N)=11_{(e,2N)=1}. Keep the selector 1Ω⁢(e)≥31_{\Omega(e)\geq 3} in the switched source. The required pointwise comparison is

(8.4) 1Ω⁢(e)≥3⁢(W13⁢(e))+≤A⁢(e)(μMob⁢(e)2=1,P−⁢(e)≥Nα,ε⁢N<e<Ncut).1_{\Omega(e)\geq 3}(W_{13}(e))_{+}\leq A(e)\quad\left(\begin{gathered}\mu_{% \mathrm{Mob}}(e)^{2}=1,\quad P^{-}(e)\geq N^{\alpha},\\ \varepsilon N<e<N_{\mathrm{cut}}\end{gathered}\right).

Here μMob\mu_{\mathrm{Mob}} denotes the Möbius function. Paper II gives zero positive part when Ω⁢(e)=3,4\Omega(e)=3,4 [27, (1.7), (4.9), (5.29a)–(5.31)].

Proof of (8.4).

Let ee satisfy the side conditions and write e=p1⁢⋯⁢pke=p_{1}\cdots p_{k}, p1<⋯<pkp_{1}<\cdots<p_{k}, xi=logN⁡pix_{i}=\log_{N}p_{i}. If (e,N)>1(e,N)>1, every occurrence in (4.3) vanishes, because it requires (d,N)=1(d,N)=1 and (n/d,N⁢d)=1(n/d,Nd)=1 [27, (1.7)]. Then W13⁢(e)=0W_{13}(e)=0. Assume (e,N)=1(e,N)=1. Since Nk⁢α≤e<NN^{k\alpha}\leq e<N and 12⁢α=1200/1149>112\alpha=1200/1149>1, we have k≤11k\leq 11. If k≤2k\leq 2, the selector vanishes. If k∈{3,4}k\in\{3,4\}, Paper II, (4.9), gives W13⁢(e)≤0W_{13}(e)\leq 0. Its hypotheses are exactly squarefree ee, (e,N)=1(e,N)=1, ε⁢N<e<N\varepsilon N<e<N and P−⁢(e)≥NαP^{-}(e)\geq N^{\alpha} [27, (4.9)]. Let 5≤k≤115\leq k\leq 11. The table after Paper II, (5.29a), shows that the three negative pair counts vanish, so

W13⁢(e)=3+1k1=0−2⁢k1−2⁢k2−k3+(k12)+∑j=1k2mB⁢(vj),W_{13}(e)=3+1_{k_{1}=0}-2k_{1}-2k_{2}-k_{3}+\binom{k_{1}}{2}+\sum_{j=1}^{k_{2}% }m_{B}(v_{j}),

where mB⁢(v)m_{B}(v) counts first-band coordinates below BO1⁢(v)B_{\mathrm{O1}}(v) [27, (5.29a), (5.30)]. The bins determine k1,…,k4k_{1},\ldots,k_{4}. If vj≤vβv_{j}\leq v_{\beta}, then BO1⁢(vj)=βB_{\mathrm{O1}}(v_{j})=\beta exceeds every first-band coordinate, so mB⁢(vj)=k1m_{B}(v_{j})=k_{1}. If vj>vβv_{j}>v_{\beta}, then BO1⁢(vj)=CL3−52⁢vjB_{\mathrm{O1}}(v_{j})=C_{\mathrm{L3}}-\frac{5}{2}v_{j}, and mB⁢(vj)m_{B}(v_{j}) is the unique mjm_{j} with xmj<CL3−52⁢vj≤xmj+1x_{m_{j}}<C_{\mathrm{L3}}-\frac{5}{2}v_{j}\leq x_{m_{j}+1} (infinite sentinels). It is nonincreasing in jj. Thus xx lies in exactly one cell CC of (8.2), and W13⁢(e)=wCW_{13}(e)=w_{C} [27, (5.31)]. If wC≤0w_{C}\leq 0, the left side of (8.4) is zero. Otherwise C∈𝒞+C\in\mathcal{C}_{+} and aC⁢(e)=1a_{C}(e)=1, so the left side equals wC=A⁢(e)w_{C}=A(e). This proves (8.4). The same argument, without the upper cut, gives

(8.5) 1Ω⁢(e)≥3⁢(W13⁢(e))+≤A0⁢(e):=∑C∈𝒞+wC⁢aC⁢(e)≤361_{\Omega(e)\geq 3}(W_{13}(e))_{+}\leq A^{0}(e):=\sum_{C\in\mathcal{C}_{+}}w_{% C}a_{C}(e)\leq 36

for squarefree ee with P−⁢(e)≥NαP^{-}(e)\geq N^{\alpha} and ε⁢N<e<N\varepsilon N<e<N.

Put

(8.6) bA⁢(n)=A⁢(N−n),PN⁢(z)=∏p<zp∈𝒫Np,Sv⁢(z)=∑n≥1v∣nbA⁢(n)⁢1(n,PN⁢(z))=1,SA=S1⁢(Nμ∗),Esrc=(Ssw−SA)+,Zsrc=(SA−Ssw)+.\begin{gathered}b_{A}(n)=A(N-n),\qquad P_{N}(z)=\prod_{\begin{subarray}{c}p<z% \\ p\in\mathcal{P}_{N}\end{subarray}}p,\\ S_{v}(z)=\sum_{\begin{subarray}{c}n\geq 1\\ v\mid n\end{subarray}}b_{A}(n)1_{(n,P_{N}(z))=1},\qquad S_{A}=S_{1}(N^{\mu_{*}% }),\\ E_{\mathrm{src}}=(S_{\mathrm{sw}}-S_{A})_{+},\qquad Z_{\mathrm{src}}=(S_{A}-S_% {\mathrm{sw}})_{+}.\end{gathered}

The definitions give the finite identity

(8.7) Ssw=SA+Esrc−Zsrc,Esrc,Zsrc≥0.S_{\mathrm{sw}}=S_{A}+E_{\mathrm{src}}-Z_{\mathrm{src}},\qquad E_{\mathrm{src}% },Z_{\mathrm{src}}\geq 0.

Under (8.4), the required bound is

(8.8) Esrc≤910⁢N1−α+36⁢(N⁢L−333+1)+36⁢Nμ∗.E_{\mathrm{src}}\leq 910N^{1-\alpha}+36(NL^{-333}+1)+36N^{\mu_{*}}.

There are at most 2⁢N1−α2N^{1-\alpha} rough squareful integers. Each costs at most 455455, by the pointwise weight bound of Paper II, proof of Lemma 1.1, immediately after (1.11) [27, Lemma 1.1, proof after (1.11)]. The last two terms cover the top strip and small primes.

Proof of (8.8).

Write e=N−pe=N-p for p∈ℙp\in\mathbb{P}, p<(1−ε)⁢Np<(1-\varepsilon)N. Every prime p≥Nμ∗p\geq N^{\mu_{*}} has (p,PN⁢(Nμ∗))=1(p,P_{N}(N^{\mu_{*}}))=1, and A≥0A\geq 0. Hence SA≥∑p≥Nμ∗A⁢(N−p)S_{A}\geq\sum_{p\geq N^{\mu_{*}}}A(N-p), and

Ssw−SA≤∑p≥Nμ∗(ssw⁢(e)−A⁢(e))++∑p<Nμ∗ssw⁢(e).S_{\mathrm{sw}}-S_{A}\leq\sum_{p\geq N^{\mu_{*}}}\bigl{(}s_{\mathrm{sw}}(e)-A(% e)\bigr{)}_{+}+\sum_{p<N^{\mu_{*}}}s_{\mathrm{sw}}(e).

Here ssw⁢(e)=0s_{\mathrm{sw}}(e)=0 unless (e,N)=1(e,N)=1 and P−⁢(e)≥NαP^{-}(e)\geq N^{\alpha}, and always 0≤ssw⁢(e)≤|W13⁢(e)|≤4550\leq s_{\mathrm{sw}}(e)\leq|W_{13}(e)|\leq 455 [27, Lemma 1.1, proof after (1.11)]. Split the summands into three classes; overlaps only enlarge the bound. (i) Non-squarefree e<Ne<N with P−⁢(e)≥NαP^{-}(e)\geq N^{\alpha} number at most ∑ℓ≥NαN/ℓ2≤2⁢N1−α\sum_{\ell\geq N^{\alpha}}N/\ell^{2}\leq 2N^{1-\alpha}; they cost at most 455⋅2⁢N1−α=910⁢N1−α455\cdot 2N^{1-\alpha}=910N^{1-\alpha}. (ii) Squarefree ee with Ncut≤e<NN_{\mathrm{cut}}\leq e<N number at most N⁢L−333+1NL^{-333}+1; by (8.5) they cost at most 36⁢(N⁢L−333+1)36(NL^{-333}+1). (iii) The primes p<Nμ∗p<N^{\mu_{*}} with squarefree ee cost at most 36⁢Nμ∗36N^{\mu_{*}}, again by (8.5). For the remaining squarefree ee with ε⁢N<e<Ncut\varepsilon N<e<N_{\mathrm{cut}} and p≥Nμ∗p\geq N^{\mu_{*}}, (8.4) gives a zero summand. This proves (8.8). Since W≫N/L2W\gg N/L^{2}, Esrc/W≪L−331E_{\mathrm{src}}/W\ll L^{-331}.

8.2. Four rows and the lower-sieve cutoff

Use the clipped intervals [Nt,Nρ⁢t)∩[Nu,Nμ∗)[N^{t},N^{\rho t})\cap[N^{u},N^{\mu_{*}}). Let 𝒜j\mathcal{A}_{j} comprise the ordered prefixes

Nu≤aj<⋯<a1<Nμ∗,ai∈𝒫N.N^{u}\leq a_{j}<\cdots<a_{1}<N^{\mu_{*}},\qquad a_{i}\in\mathcal{P}_{N}.

Write v=a1⁢⋯⁢ajv=a_{1}\cdots a_{j}. The empty prefix has v=1v=1. Define

(8.9) T0=S1⁢(Nu),T1=∑𝒜1Sa1⁢(Nu),T2=∑𝒜2Sa1⁢a2⁢(Nu),T3dyn=∑𝒜3Sa1⁢a2⁢a3⁢(a3),SA=T0−T1+T2−T3dyn.\begin{gathered}T_{0}=S_{1}(N^{u}),\quad T_{1}=\sum_{\mathcal{A}_{1}}S_{a_{1}}% (N^{u}),\quad T_{2}=\sum_{\mathcal{A}_{2}}S_{a_{1}a_{2}}(N^{u}),\\ T_{3}^{\mathrm{dyn}}=\sum_{\mathcal{A}_{3}}S_{a_{1}a_{2}a_{3}}(a_{3}),\qquad S% _{A}=T_{0}-T_{1}+T_{2}-T_{3}^{\mathrm{dyn}}.\end{gathered}

This is Buchstab’s finite identity [27, (4.18)]. Its coefficient is 1−k+(k2)−(k−12)=01-k+\binom{k}{2}-\binom{k-1}{2}=0 for k≥1k\geq 1. At k=0k=0 it equals 11.

At depth three, let Θc\Theta_{c} be the infimum of H~\widetilde{H} on the closed clipped parent. The underlying prime cells stay half-open. The closure is used only for this infimum. Use the whole anatomy function before choosing a branch [27, (2.17d)–(2.17e), (4.19)]. Set

(8.10) ℓc=Θc−ηL−t1−t2−t3,Dc=Nℓc,zc=Nt3,χc=1ℓc≥2⁢ρ⁢t3.\ell_{c}=\Theta_{c}-\eta_{L}-t_{1}-t_{2}-t_{3},\quad D_{c}=N^{\ell_{c}},\quad z% _{c}=N^{t_{3}},\quad\chi_{c}=1_{\ell_{c}\geq 2\rho t_{3}}.

Retained prefixes have χc=1\chi_{c}=1. For these prefixes define

(8.11) B3\displaystyle B_{3} =∑𝒜3:χc=1Sv⁢(zc),\displaystyle=\sum_{\mathcal{A}_{3}:\chi_{c}=1}S_{v}(z_{c}), D−\displaystyle D_{-} =∑𝒜3:χc=0Sv⁢(a3),\displaystyle=\sum_{\mathcal{A}_{3}:\chi_{c}=0}S_{v}(a_{3}),
D+\displaystyle D_{+} =∑𝒜3:χc=1{Sv⁢(zc)−Sv⁢(a3)},\displaystyle=\sum_{\mathcal{A}_{3}:\chi_{c}=1}\{S_{v}(z_{c})-S_{v}(a_{3})\}, P3\displaystyle P_{3} =∑𝒜3:χc=1∑r∈𝒫Nzc≤r<a3Sv⁢r⁢(zc),\displaystyle=\sum_{\mathcal{A}_{3}:\chi_{c}=1}\sum_{\begin{subarray}{c}r\in% \mathcal{P}_{N}\\ z_{c}\leq r<a_{3}\end{subarray}}S_{vr}(z_{c}),
Zpeel\displaystyle Z_{\mathrm{peel}} =D−+P3−D+≥0.\displaystyle=D_{-}+P_{3}-D_{+}\geq 0.

The union bound gives D+≤P3D_{+}\leq P_{3}. Therefore

(8.12) SA=T0−T1+T2−B3+P3−Zpeel.S_{A}=T_{0}-T_{1}+T_{2}-B_{3}+P_{3}-Z_{\mathrm{peel}}.

The favorable term enters exactly once [27, (4.45)].

8.3. Capping the first three levels

At depths j=0,1,2j=0,1,2, replace the relative level by

(8.13) Tc=∑i=1jti,ℓc=12−ηL−ρ⁢Tc,Dc=Nℓc,zj,c=Nu.T_{c}=\sum_{i=1}^{j}t_{i},\quad\ell_{c}=\frac{1}{2}-\eta_{L}-\rho T_{c},\quad D% _{c}=N^{\ell_{c}},\quad z_{j,c}=N^{u}.

Here Tc=0T_{c}=0 at depth zero. Depth three keeps (8.10), with z3,c=zcz_{3,c}=z_{c}. The elementary bounds are

(8.14) ℓc≥12−ηL−j⁢ρ⁢μ∗≥ℓ1,sc=ℓc/u≥54.6375−10−87>30,continuum reference values for depths ⁢0,1,2⁢ (the first three rows) at ⁢(ηL,ρ)=(0,1):250,487532,87516,q<Nρ⁢Tc⁢Dcρ+σ≤N1/2−ηL+(σ+τ)/2<N1/2−9⋅10−5.\begin{gathered}\ell_{c}\geq\frac{1}{2}-\eta_{L}-j\rho\mu_{*}\geq\ell_{1},% \qquad s_{c}=\ell_{c}/u\geq 54.6375-10^{-87}>30,\\ \text{continuum reference values for depths }0,1,2\text{ (the first three rows% )}\text{ at }(\eta_{L},\rho)=(0,1):250,\ \frac{4875}{32},\ \frac{875}{16},\\ q<N^{\rho T_{c}}D_{c}^{\rho+\sigma}\leq N^{1/2-\eta_{L}+(\sigma+\tau)/2}<N^{1/% 2-9\cdot 10^{-5}}.\end{gathered}

The modulus includes the smooth divisor and every tail prime. The exponent ρ+σ\rho+\sigma is kept. The cap changes no row-three level.

The lower floor changes the repeated-prime argument. Put

(8.15) u1=Nℓ1⁢σ2,Mσ=⌈35⁢ℓ0⁢σ2⌉,CL3,σ=Mσ!.u_{1}=N^{\ell_{1}\sigma^{2}},\qquad M_{\sigma}=\left\lceil\frac{3}{5\ell_{0}% \sigma^{2}}\right\rceil,\qquad C_{\mathrm{L3},\sigma}=M_{\sigma}!.
(P2.8b) Rough-coordinate and repeated-prime bounds.

Assume the support and rough-coordinate hypotheses stated below. These are the capped version of Paper II’s Lemmas B.1–B.4. The coefficients and masks are defined in (8.30). Every rough coordinate is at least uc=Dcσ2≥u1u_{c}=D_{c}^{\sigma^{2}}\geq u_{1}. On an active block, count these coordinates by mcm_{c}. The capped modulus bound gives

(8.16) u1mc≤q<N1/2,mc<500109⁢σ2≤35⁢ℓ0⁢σ2,mc!Mc≤CL3,σ.u_{1}^{m_{c}}\leq q<N^{1/2},\qquad m_{c}<\frac{500}{109\sigma^{2}}\leq\frac{3}% {5\ell_{0}\sigma^{2}},\qquad\frac{m_{c}!}{M_{c}}\leq C_{\mathrm{L3},\sigma}.

The prefix orbit size is Mc∈{1,2,6}M_{c}\in\{1,2,6\}. The small-prime part of qq fixes the smooth divisor. The rough multiset fills at most mc!m_{c}! labelled positions. Thus

(8.17) |C𝔟⁢(q)|Mc≤CL3,σ.\frac{|C_{\mathfrak{b}}(q)|}{M_{c}}\leq C_{\mathrm{L3},\sigma}.

Define ℋ1={q⁢<N1/2:p2∣⁢q⁢ for some ⁢p≥u1}\mathcal{H}_{1}=\{q<N^{1/2}:p^{2}\mid q\text{ for some }p\geq u_{1}\}. The forbidden and allowed-repeat masks satisfy

(8.18) |ΞU,𝔟⁢(q)|+|ΞA,𝔟⁢(q)|≤CL3,σ⁢1ℋ1⁢(q).|\Xi_{U,\mathfrak{b}}(q)|+|\Xi_{A,\mathfrak{b}}(q)|\leq C_{\mathrm{L3},\sigma}% 1_{\mathcal{H}_{1}}(q).

Writing q=v⁢p2q=vp^{2} and overcounting gives

(8.19) ∑q∈ℋ11q≤2⁢(1+L)u1,#⁢ℋ1≤2⁢N1/2u1.\sum_{q\in\mathcal{H}_{1}}\frac{1}{q}\leq\frac{2(1+L)}{u_{1}},\qquad\#\mathcal% {H}_{1}\leq\frac{2N^{1/2}}{u_{1}}.

The tested measure has 0≤A≤360\leq A\leq 36 and support below NN. For N≥NdomN\geq N_{\mathrm{dom}}, q/φ⁢(q)≤1+Lq/\varphi(q)\leq 1+L throughout q<N1/2q<N^{1/2}. Consequently

(8.20) |ΔP⁢(q)|,|dA⁢(q)|≤36⁢(Nq+1+Nφ⁢(q))≤36⁢(N⁢(2+L)q+1).|\Delta_{P}(q)|,\ |d_{A}(q)|\leq 36\left(\frac{N}{q}+1+\frac{N}{\varphi(q)}% \right)\leq 36\left(\frac{N(2+L)}{q}+1\right).

Per block, these bounds give

(8.21) ∑q(|ΞU⁢(q)⁢ΔP⁢(q)|+|ΞA⁢(q)⁢dA⁢(q)|)≤216⁢CL3,σ⁢N⁢(1+L)2u1.\sum_{q}\bigl{(}|\Xi_{U}(q)\Delta_{P}(q)|+|\Xi_{A}(q)d_{A}(q)|\bigr{)}\leq% \frac{216C_{\mathrm{L3},\sigma}N(1+L)^{2}}{u_{1}}.

There are finitely many blocks at fixed σ\sigma. Division by W≫N/L2W\gg N/L^{2} proves the conditional estimate

(8.22) |Esq|/W=Oσ⁢(N−ℓ1⁢σ2⁢L4).|E_{\mathrm{sq}}|/W=O_{\sigma}(N^{-\ell_{1}\sigma^{2}}L^{4}).

These are Paper II, Lemmas B.1–B.4 and (B.3)–(B.7), with u0u_{0} replaced by u1u_{1} on rows 0,1,20,1,2 [27, Appendix B.1, Lemmas B.1–B.4, (B.3)–(B.7)]. Row three keeps u0=Nℓ0⁢σ2u_{0}=N^{\ell_{0}\sigma^{2}}, since its level floor in (8.43) exceeds ℓ0\ell_{0}.

Verification for the capped rows.

Fix a block in row j≤2j\leq 2. Prefix primes lie in [Nti,Nρ⁢ti)∩[Nu,Nμ∗)[N^{t_{i}},N^{\rho t_{i}})\cap[N^{u},N^{\mu_{*}}), so their product is below Nρ⁢TcN^{\rho T_{c}}. The tail tuple satisfies ∏iDi<Dc\prod_{i}D_{i}<D_{c} by its last cubic constraint, and the tail primes are below DiρD_{i}^{\rho}; also d<Dcσd<D_{c}^{\sigma}. Thus

logN⁡q<ρ⁢Tc+(ρ+σ)⁢ℓc=(ρ+σ)⁢(12−ηL)−ρ⁢(ρ+σ−1)⁢Tc≤(ρ+σ)⁢(12−ηL)<12−9⋅10−5.\log_{N}q<\rho T_{c}+(\rho+\sigma)\ell_{c}=(\rho+\sigma)(\tfrac{1}{2}-\eta_{L}% )-\rho(\rho+\sigma-1)T_{c}\leq(\rho+\sigma)(\tfrac{1}{2}-\eta_{L})<\tfrac{1}{2% }-9\cdot 10^{-5}.

Every prime of qq lies in 𝒫N\mathcal{P}_{N} and d∣PN⁢(uc)d\mid P_{N}(u_{c}), so (q,2⁢N)=1(q,2N)=1. Tail primes are at least Di≥Dcσ2=ucD_{i}\geq D_{c}^{\sigma^{2}}=u_{c}. Prefix primes are at least Nu>ucN^{u}>u_{c}, because ℓc⁢σ2<u\ell_{c}\sigma^{2}<u. Also uc=Nℓc⁢σ2≥Nℓ1⁢σ2=u1u_{c}=N^{\ell_{c}\sigma^{2}}\geq N^{\ell_{1}\sigma^{2}}=u_{1}. For an active block choose a nonzero realization. Then u1mc≤q<N1/2u_{1}^{m_{c}}\leq q<N^{1/2}, so mc<1/(2⁢ℓ1⁢σ2)=500/(109⁢σ2)m_{c}<1/(2\ell_{1}\sigma^{2})=500/(109\sigma^{2}), and 1/(2⁢ℓ1)≤3/(5⁢ℓ0)1/(2\ell_{1})\leq 3/(5\ell_{0}). This is (8.16). The primes of qq below ucu_{c} determine dd. The rough multiset fills the mcm_{c} labelled positions in at most mc!m_{c}! ways, and |λd|≤1|\lambda_{d}|\leq 1. This gives (8.17). It also gives (8.18). A forbidden tuple repeats a prime ≥uc\geq u_{c}. An allowed non-squarefree tuple has p2∣qp^{2}\mid q with p≥ucp\geq u_{c}, since dd is squarefree and coprime to the rough part. The grid count of Paper II, Lemma B.1(4), gives finitely many blocks at fixed σ\sigma. These are Paper II, Lemmas B.1–B.2, with (u0,N3/5)(u_{0},N^{3/5}) replaced by (u1,N1/2)(u_{1},N^{1/2}) [27, Appendix B.1, Lemmas B.1–B.2]. Lemma B.4 with u1u_{1} and Q=N1/2Q=N^{1/2} gives (8.19). Lemma B.3, with A≤36<AmaxA\leq 36<A_{\max}, support in [1,N)[1,N) and q/φ⁢(q)≤1+log2⁡q≤1+Lq/\varphi(q)\leq 1+\log_{2}q\leq 1+L, gives (8.20). Then ∑q∈ℋ1(N⁢(2+L)/q+1)≤6⁢N⁢(1+L)2/u1\sum_{q\in\mathcal{H}_{1}}(N(2+L)/q+1)\leq 6N(1+L)^{2}/u_{1} gives (8.21). Row three is Paper II, Lemmas B.1–B.4 as printed: its modulus bound q<NeQ<N3/5q<N^{e_{Q}}<N^{3/5} and floor ℓc>ℓ0\ell_{c}>\ell_{0} are (8.43). Hence (8.22) holds for all four rows.

8.4. The signed sieve identity

Put νj=(−1)j\nu_{j}=(-1)^{j}. For all four rows, define

(8.23) sc=ℓclogN⁡zj,c={ℓc/u,j=0,1,2,ℓc/t3,j=3.s_{c}=\frac{\ell_{c}}{\log_{N}z_{j,c}}=\begin{cases}\ell_{c}/u,&j=0,1,2,\\ \ell_{c}/t_{3},&j=3.\end{cases}

Let Kj=FK_{j}=F for even jj, and Kj=fK_{j}=f for odd jj. For a prefix vv, set

(8.24) 𝒳v=XA/φ⁢(v),ωv⁢(p)=pp−1⁢1p∈𝒫N,ωv⁢(ph)=0(h≥2),VN⁢(z)=∏p<zp∈𝒫N(1−1p−1),Δ0⁢(q)=CA⁢(q;N)−XAφ⁢(q).\begin{gathered}\mathcal{X}_{v}=X_{A}/\varphi(v),\qquad\omega_{v}(p)=\frac{p}{% p-1}1_{p\in\mathcal{P}_{N}},\qquad\omega_{v}(p^{h})=0\quad(h\geq 2),\\ V_{N}(z)=\prod_{\begin{subarray}{c}p<z\\ p\in\mathcal{P}_{N}\end{subarray}}\left(1-\frac{1}{p-1}\right),\qquad\Delta_{0% }(q)=C_{A}(q;N)-\frac{X_{A}}{\varphi(q)}.\end{gathered}

All cutoff primes lie below the prefix primes. Thus the density product on the sieve support is VNV_{N}. The squarefree remainder is Δ0⁢(v⁢d)\Delta_{0}(vd). Apply Fact 3.17 with ϵs=σ\epsilon_{s}=\sigma, δs=τ\delta_{s}=\tau, and Lω=2L_{\omega}=2. Choose a common nonnegative majorant

(8.25) Es,c:=CE⁢{σ+σ−8⁢eKM+2⁢(ℓc⁢L)−1/3}.E_{s,c}:=C_{E}\{\sigma+\sigma^{-8}e^{K_{\mathrm{M}}+2}(\ell_{c}L)^{-1/3}\}.

The signed sieve error satisfies |Es|≤Es,c|E_{s}|\leq E_{s,c}.

Verification of the sieve data.

Fix a row, a cell and a prefix vv, and sieve the finite multiset {n:v∣n}\{n:v\mid n\} with multiplicity bA⁢(n)≥0b_{A}(n)\geq 0 by 𝒫N\mathcal{P}_{N} below z=zj,cz=z_{j,c}. Every prefix prime is at least zz: on rows 0,1,20,1,2 it is at least Nu=zN^{u}=z, and on row three a3≥Nt3=zca_{3}\geq N^{t_{3}}=z_{c}. Hence (d,v)=1(d,v)=1 for d∣PN⁢(z)d\mid P_{N}(z). In particular ωv⁢(d)=∏p∣dp/(p−1)\omega_{v}(d)=\prod_{p\mid d}p/(p-1) for these dd; the primes p∣vp\mid v are all ≥z\geq z and are never sifted. For squarefree such dd,

|𝒜d|=∑eA⁢(e)⁢1v⁢d∣N−e=CA⁢(v⁢d;N),ωv⁢(d)d⁢𝒳v=XAφ⁢(v)⁢φ⁢(d)=XAφ⁢(v⁢d),|\mathcal{A}_{d}|=\sum_{e}A(e)1_{vd\mid N-e}=C_{A}(vd;N),\qquad\frac{\omega_{v% }(d)}{d}\mathcal{X}_{v}=\frac{X_{A}}{\varphi(v)\varphi(d)}=\frac{X_{A}}{% \varphi(vd)},

so r⁢(𝒜,d)=Δ0⁢(v⁢d)r(\mathcal{A},d)=\Delta_{0}(vd). Each remainder modulus in (8.26) is squarefree. Here dd uses primes below Dcσ2D_{c}^{\sigma^{2}}. Tail primes are at least Dcσ2D_{c}^{\sigma^{2}} and distinct (equal labels by the mask, unequal grid intervals disjoint). Prefix primes are at least zz. Next, 0<ωv⁢(p)=p/(p−1)<p0<\omega_{v}(p)=p/(p-1)<p for every p∈𝒫Np\in\mathcal{P}_{N} (all such pp are odd), ωv=0\omega_{v}=0 off 𝒫N\mathcal{P}_{N}, and ωv⁢(ph)=0\omega_{v}(p^{h})=0 for h≥2h\geq 2. Hence the second condition in (3.19) holds with Lω=2L_{\omega}=2. For the first, (1−ωv⁢(p)/p)−1=(1−1/(p−1))−1(1-\omega_{v}(p)/p)^{-1}=(1-1/(p-1))^{-1}, and Paper II, (5.5), gives

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

with one absolute KK, uniformly in NN [27, (5.5)]. Take KMK_{\mathrm{M}} in (8.25) to be the maximum of this KK and the constant of (3.25). It remains absolute and is fixed before σ\sigma. The product V⁢(z)V(z) of Fact 3.17 is then VN⁢(z)V_{N}(z). The levels satisfy z≤Dcz\leq D_{c} on rows 0,20,2 (sc>30s_{c}>30) and z≤Dc1/2z\leq D_{c}^{1/2} on rows 1,31,3 (sc>30s_{c}>30, resp. χc=1\chi_{c}=1, i.e. ℓc≥2⁢ρ⁢t3\ell_{c}\geq 2\rho t_{3}). Fact 3.17 with ϵs=σ\epsilon_{s}=\sigma, δs=τ\delta_{s}=\tau, D=DcD=D_{c} therefore applies to every actual sequence, and (8.28) follows with Es≤Es,cE_{s}\leq E_{s,c}, log⁡Dc=ℓc⁢L\log D_{c}=\ell_{c}L.

For each cell fix one coefficient construction. Use it for every prefix realization in that cell. Write its remainders as

(8.26) R1,vν\displaystyle R_{1,v}^{\nu} =∑d<Dcσd∣PN⁢(Dcσ2)ϕdν⁢Δ0⁢(v⁢d),\displaystyle=\sum_{\begin{subarray}{c}d<D_{c}^{\sigma}\\ d\mid P_{N}(D_{c}^{\sigma^{2}})\end{subarray}}\phi_{d}^{\nu}\Delta_{0}(vd),
Rvν\displaystyle R_{v}^{\nu} =∑𝐃∈𝒟ν⁢(Dc)∑d<Dcσd∣PN⁢(Dcσ2)λdν⁢(𝐃)⁢∑Di≤pi<min⁡(Diρ,zj,c)pi∈𝒫N,equal-label entries distinctΔ0⁢(v⁢d⁢∏ipi).\displaystyle=\sum_{\mathbf{D}\in\mathcal{D}^{\nu}(D_{c})}\sum_{\begin{% subarray}{c}d<D_{c}^{\sigma}\\ d\mid P_{N}(D_{c}^{\sigma^{2}})\end{subarray}}\lambda_{d}^{\nu}(\mathbf{D})% \sum_{\begin{subarray}{c}D_{i}\leq p_{i}<\min(D_{i}^{\rho},z_{j,c})\\ p_{i}\in\mathcal{P}_{N},\ \text{equal-label entries distinct}\end{subarray}}% \Delta_{0}(vd\textstyle\prod_{i}p_{i}).

The coefficients satisfy |ϕdν|,|λdν⁢(𝐃)|≤1|\phi_{d}^{\nu}|,|\lambda_{d}^{\nu}(\mathbf{D})|\leq 1 [26, Theorem 2.6, (2.29)–(2.33b)]. Define the finite quantities

(8.27) Mj\displaystyle M_{j} =∑c∑v∈cXAφ⁢(v)⁢VN⁢(zj,c)⁢Kj⁢(sc),\displaystyle=\sum_{c}\sum_{v\in c}\frac{X_{A}}{\varphi(v)}V_{N}(z_{j,c})K_{j}% (s_{c}),
Ej\displaystyle E_{j} =∑c∑v∈cXAφ⁢(v)⁢VN⁢(zj,c)⁢Es,c,Rj=∑c∑v∈c(R1,vνj+Rvνj),\displaystyle=\sum_{c}\sum_{v\in c}\frac{X_{A}}{\varphi(v)}V_{N}(z_{j,c})E_{s,% c},\qquad R_{j}=\sum_{c}\sum_{v\in c}(R_{1,v}^{\nu_{j}}+R_{v}^{\nu_{j}}),
Qj\displaystyle Q_{j} =Mj+νj⁢Ej+νj⁢Rj,(S0,S1,S2,S3)=(T0,T1,T2,B3),\displaystyle=M_{j}+\nu_{j}E_{j}+\nu_{j}R_{j},\qquad(S_{0},S_{1},S_{2},S_{3})=% (T_{0},T_{1},T_{2},B_{3}),
ZAA\displaystyle Z_{\mathrm{AA}} =∑j=03νj⁢(Qj−Sj),Mprin=∑j=03νj⁢Mj,\displaystyle=\sum_{j=0}^{3}\nu_{j}(Q_{j}-S_{j}),\qquad M_{\mathrm{prin}}=\sum% _{j=0}^{3}\nu_{j}M_{j},
Merr\displaystyle M_{\mathrm{err}} =∑j=03Ej,Radv=∑j=03Rj.\displaystyle=\sum_{j=0}^{3}E_{j},\qquad R_{\mathrm{adv}}=\sum_{j=0}^{3}R_{j}.

The sums keep strict prefix order. Under the stated sieve hypotheses,

(8.28) Q0≥S0,Q1≤S1,Q2≥S2,Q3≤S3,ZAA≥0.Q_{0}\geq S_{0},\quad Q_{1}\leq S_{1},\quad Q_{2}\geq S_{2},\quad Q_{3}\leq S_% {3},\quad Z_{\mathrm{AA}}\geq 0.

Multiplying the signs gives

(8.29) ∑j=03νj⁢Sj=Mprin+Merr+Radv−ZAA.\sum_{j=0}^{3}\nu_{j}S_{j}=M_{\mathrm{prin}}+M_{\mathrm{err}}+R_{\mathrm{adv}}% -Z_{\mathrm{AA}}.

Every remainder in RadvR_{\mathrm{adv}} has sign +1+1.

8.5. The natural coprime comparator

A block 𝔟=(j,c,f,𝐃)\mathfrak{b}=(j,c,f,\mathbf{D}) fixes a row, a cell, and either remainder type ff. The tail vector is empty for R1R_{1}. Prefix realizations stay inside the coefficient. Let KP,KTK_{P},K_{T} impose prefix and tail distinctness. Let C𝔟C_{\mathfrak{b}} be the unrestricted labelled coefficient. Define

(8.30) C𝔟⁢(q)\displaystyle C_{\mathfrak{b}}(q) =∑full⁢labelled⁢tuplesλ~d⁢1q=d⁢∏pi,\displaystyle=\sum_{\mathrm{full\ labelled\ tuples}}\widetilde{\lambda}_{d}1_{% q=d\prod p_{i}},
O𝔟⁢(q)\displaystyle O_{\mathfrak{b}}(q) =1Mc⁢∑full⁢labelled⁢tuplesλ~d⁢KP⁢KT⁢1q=d⁢∏pi,\displaystyle=\frac{1}{M_{c}}\sum_{\mathrm{full\ labelled\ tuples}}\widetilde{% \lambda}_{d}K_{P}K_{T}1_{q=d\prod p_{i}},
ΞU,𝔟⁢(q)\displaystyle\Xi_{U,\mathfrak{b}}(q) =1Mc⁢∑full⁢labelled⁢tuplesλ~d⁢(1−KP⁢KT)⁢1q=d⁢∏pi,\displaystyle=\frac{1}{M_{c}}\sum_{\mathrm{full\ labelled\ tuples}}\widetilde{% \lambda}_{d}(1-K_{P}K_{T})1_{q=d\prod p_{i}},
O𝔟\displaystyle O_{\mathfrak{b}} =C𝔟/Mc−ΞU,𝔟,ΞA,𝔟=O𝔟⁢1q⁢not⁢squarefree.\displaystyle=C_{\mathfrak{b}}/M_{c}-\Xi_{U,\mathfrak{b}},\qquad\Xi_{A,% \mathfrak{b}}=O_{\mathfrak{b}}1_{q\ \mathrm{not\ squarefree}}.

The two comparator discrepancies are

(8.31) ΔP⁢(q)=CA⁢(q;N)−YA⁢(q)φ⁢(q),dA⁢(q)=Δ0⁢(q)−ΔP⁢(q)=−XA−YA⁢(q)φ⁢(q).\Delta_{P}(q)=C_{A}(q;N)-\frac{Y_{A}(q)}{\varphi(q)},\qquad d_{A}(q)=\Delta_{0% }(q)-\Delta_{P}(q)=-\frac{X_{A}-Y_{A}(q)}{\varphi(q)}.

For ⟨f,g⟩=∑qf⁢(q)⁢g⁢(q)\langle f,g\rangle=\sum_{q}f(q)g(q), put

(8.32) Edisp,f\displaystyle E_{\mathrm{disp},f} =∑𝔟:type=f⟨C𝔟,ΔP⟩Mc(f=1,2),\displaystyle=\sum_{\mathfrak{b}:\mathrm{type}=f}\frac{\langle C_{\mathfrak{b}% },\Delta_{P}\rangle}{M_{c}}\quad(f=1,2),
Esq\displaystyle E_{\mathrm{sq}} =∑𝔟{−⟨ΞU,𝔟,ΔP⟩+⟨ΞA,𝔟,dA⟩},\displaystyle=\sum_{\mathfrak{b}}\{-\langle\Xi_{U,\mathfrak{b}},\Delta_{P}% \rangle+\langle\Xi_{A,\mathfrak{b}},d_{A}\rangle\},
Enc\displaystyle E_{\mathrm{nc}} =∑𝔟∑q⁢squarefreeO𝔟⁢(q)⁢dA⁢(q),\displaystyle=\sum_{\mathfrak{b}}\sum_{q\ \mathrm{squarefree}}O_{\mathfrak{b}}% (q)d_{A}(q),
Radv\displaystyle R_{\mathrm{adv}} =Edisp,1+Edisp,2+Esq+Enc.\displaystyle=E_{\mathrm{disp},1}+E_{\mathrm{disp},2}+E_{\mathrm{sq}}+E_{% \mathrm{nc}}.

This is a finite coefficient identity [27, (4.22)–(4.26), Appendix B.1–B.4]. All moduli satisfy (q,2⁢N)=1(q,2N)=1. That restriction does not puncture AA.

8.6. The full-support bilinear application

Split each prime coordinate into relative-width L−334L^{-334} intervals. An interior box has constant order and descriptor predicates. For B=∏i[Ai,Bi)B=\prod_{i}[A_{i},B_{i}), put

(8.33) T=⌈A1⌉−1,UJ=⌈B1⌉−1,IT=(T,UJ],X=∏iAi,an=1ℙ⁢(n)⁢1IT⁢(n),bm=∑p2<⋯<pkpi∈[Ai,Bi)1m=p2⁢⋯⁢pk,bm∈{0,1},Nα/2≤T<N1/5,ε⁢N≤X≤N.\begin{gathered}T=\lceil A_{1}\rceil-1,\quad U_{J}=\lceil B_{1}\rceil-1,\quad I% _{T}=(T,U_{J}],\quad X=\prod_{i}A_{i},\\ a_{n}=1_{\mathbb{P}}(n)1_{I_{T}}(n),\qquad b_{m}=\sum_{\begin{subarray}{c}p_{2% }<\cdots<p_{k}\\ p_{i}\in[A_{i},B_{i})\end{subarray}}1_{m=p_{2}\cdots p_{k}},\\ b_{m}\in\{0,1\},\qquad N^{\alpha}/2\leq T<N^{1/5},\qquad\varepsilon N\leq X% \leq N.\end{gathered}

The box contributes exactly wC⁢an⁢bmw_{C}a_{n}b_{m}. For T>250T>2^{50} and UJ≤2⁢TU_{J}\leq 2T,

(8.34) an=1P−⁢(n)≥T51/100⁢1IT⁢(n).a_{n}=1_{P^{-}(n)\geq T^{51/100}}1_{I_{T}}(n).

A composite n≤2⁢Tn\leq 2T has a smaller prime divisor. This is Paper I, (3.8), option 1 [26, (3.8)–(3.9)]. Its logarithmic replacement error is zero.

Define the full-support discrepancy

(8.35) ΔB⁢(q,N)\displaystyle\Delta_{B}(q,N) =∑n⁢m≡N⁢(q)an⁢bm−1φ⁢(q)⁢∑(n⁢m,q)=1an⁢bm,\displaystyle=\sum_{nm\equiv N\ (q)}a_{n}b_{m}-\frac{1}{\varphi(q)}\sum_{(nm,q% )=1}a_{n}b_{m},
𝒮B⁢(𝔟)\displaystyle\mathcal{S}_{B}(\mathfrak{b}) =∑qC𝔟⁢(q)⁢ΔB⁢(q,N).\displaystyle=\sum_{q}C_{\mathfrak{b}}(q)\Delta_{B}(q,N).

There is no condition n⁢m≤Xnm\leq X in these sums. The exact interior decomposition is

(8.36) Dint(j)\displaystyle D_{\mathrm{int}}^{(j)} =∑𝔟:row=j1Mc⁢∑C∑B⊂C⁢interiorwC⁢𝒮B⁢(𝔟),\displaystyle=\sum_{\mathfrak{b}:\mathrm{row}=j}\frac{1}{M_{c}}\sum_{C}\sum_{B% \subset C\ \mathrm{interior}}w_{C}\mathcal{S}_{B}(\mathfrak{b}),
Edisp,1+Edisp,2\displaystyle E_{\mathrm{disp},1}+E_{\mathrm{disp},2} =∑j=03Dint(j)+Dbdry.\displaystyle=\sum_{j=0}^{3}D_{\mathrm{int}}^{(j)}+D_{\mathrm{bdry}}.

For rows 0,1,20,1,2, apply Fact 3.3. Its Siegel–Walfisz sequence must be the selected prime sequence. The dictionary with Fact 3.3 is bnF2:=anb_{n}^{\mathrm{F2}}:=a_{n}, amF2:=bma_{m}^{\mathrm{F2}}:=b_{m}, and Y:=TY:=T. Thus the prime sequence carries the Siegel–Walfisz hypothesis. We need Paper I, (3.25), in the form

(8.37) ∑n∈In≡l⁢(k)(n,d)=11ℙ⁢(n)−1φ⁢(k)⁢∑n∈I(n,d⁢k)=11ℙ⁢(n)≪ASWT⁢τ⁢(d)⁢L−ASW,(l,k)=1,I⊂IT.\sum_{\begin{subarray}{c}n\in I\\ n\equiv l\ (k)\\ (n,d)=1\end{subarray}}1_{\mathbb{P}}(n)-\frac{1}{\varphi(k)}\sum_{\begin{% subarray}{c}n\in I\\ (n,dk)=1\end{subarray}}1_{\mathbb{P}}(n)\ll_{A_{\mathrm{SW}}}T\tau(d)L^{-A_{% \mathrm{SW}}},\qquad(l,k)=1,\quad I\subset I_{T}.

The normalized hypothesis also needs

(8.38) ‖a‖2⁢T1/2≫T⁢L−168.\|a\|_{2}T^{1/2}\gg TL^{-168}.

Use Fact 3.1, specifically (3.2). Its endpoint estimate gives, for every fixed A>335A>335,

(8.39) π⁢(UJ)−π⁢(T)=Li⁡(UJ)−Li⁡(T)+OA⁢(T⁢L−A).\pi(U_{J})-\pi(T)=\operatorname{Li}(U_{J})-\operatorname{Li}(T)+O_{A}(TL^{-A}).

Full mesh intervals satisfy UJ−T≫T⁢L−334U_{J}-T\gg TL^{-334}. Thus #⁢(IT∩ℙ)≫T⁢L−335\#(I_{T}\cap\mathbb{P})\gg TL^{-335} uniformly. This implies (8.38). The k=1k=1 discrepancy in (8.37) is identically zero. The counting input is the endpoint estimate just displayed.

Proof of (8.37) and (8.38).

Let Nα/2≤T<N1/5N^{\alpha}/2\leq T<N^{1/5}, UJ≤2⁢TU_{J}\leq 2T, (l,k)=1(l,k)=1, and let I=(y1,y2]⊂ITI=(y_{1},y_{2}]\subset I_{T} be an arbitrary subinterval, so T≤y1≤y2≤UJT\leq y_{1}\leq y_{2}\leq U_{J}. (Paper I, (3.25), is quantified over all such II [26, (3.25)].) The condition (n,d)=1(n,d)=1 removes at most ω⁢(d)\omega(d) primes from each sum. If k≤LA+2k\leq L^{A+2}, apply (3.2) at y=y2y=y_{2} and y=y1y=y_{1}, with C=A+3C=A+3. Since T≤y≤2⁢TT\leq y\leq 2T, log⁡y≍L\log y\asymp L and the error is OA⁢(T⁢L−A)O_{A}(TL^{-A}) at each endpoint. Hence π⁢(y2;k,l)−π⁢(y1;k,l)=(Li⁡(y2)−Li⁡(y1))/φ⁢(k)+OA⁢(T⁢L−A)\pi(y_{2};k,l)-\pi(y_{1};k,l)=(\operatorname{Li}(y_{2})-\operatorname{Li}(y_{1% }))/\varphi(k)+O_{A}(TL^{-A}). The same holds for the unrestricted count divided by φ⁢(k)\varphi(k), up to the ω⁢(k)\omega(k) primes dividing kk. If k>LA+2k>L^{A+2}, since y2−y1≤Ty_{2}-y_{1}\leq T both terms are at most T/k+1+T/φ⁢(k)≪T⁢L−AT/k+1+T/\varphi(k)\ll TL^{-A}, using φ⁢(k)≫k/log⁡log⁡k\varphi(k)\gg k/\log\log k. This proves (8.37) with τ⁢(d)\tau(d), ineffectively, uniformly in I⊂ITI\subset I_{T}. For the norm, UJ−T≥A1⁢L−334−1≥T⁢L−334/2U_{J}-T\geq A_{1}L^{-334}-1\geq TL^{-334}/2 on a full mesh interval, and (8.39) with A=336A=336 gives #⁢(IT∩ℙ)≥T⁢L−335/4\#(I_{T}\cap\mathbb{P})\geq TL^{-335}/4 eventually. Hence ‖a‖2⁢T1/2≥T⁢L−335/2/2≥T⁢L−168\|a\|_{2}T^{1/2}\geq TL^{-335/2}/2\geq TL^{-168}. Both bounds are uniform over all interior boxes, since only TT enters.

Assume (8.37) and (8.38) uniformly. Taking ASW=A0+168A_{\mathrm{SW}}=A_{0}+168 verifies (3.4) with divisor exponent one. Both factor lengths exceed xB1/12x_{B}^{1/12} eventually. Split each of the k−1k-1 complementary prime intervals at any dyadic boundary. This gives at most 2k−12^{k-1} pieces. Localize each resulting product on m∼MBm\sim M_{B}. Since (1+L−334)k−1<2(1+L^{-334})^{k-1}<2 eventually, there are at most two product dyadic intervals per piece. This bounded splitting changes no logarithmic exponent. Set xB=T⁢MB≍Nx_{B}=TM_{B}\asymp N. There are at most TT selected integers in (T,2⁢T](T,2T] and at most 2⁢MB2M_{B} integers in a product dyadic interval. Unique factorization gives ‖a‖2⁢‖b‖2≤2⁢xB\|a\|_{2}\|b\|_{2}\leq\sqrt{2x_{B}}. The required application is

(8.40) |C𝔟⁢(q)|Mc≤CL3,σ,Q<N1/2−9⋅10−5≤xB1/2⁢(log⁡xB)−BBV,‖a‖2⁢‖b‖2≤2⁢xB1/2,|𝒮B⁢(𝔟)|/Mc≪σN⁢L−3692.\begin{gathered}\frac{|C_{\mathfrak{b}}(q)|}{M_{c}}\leq C_{\mathrm{L3},\sigma}% ,\qquad Q<N^{1/2-9\cdot 10^{-5}}\leq x_{B}^{1/2}(\log x_{B})^{-B_{\mathrm{BV}}% },\\ \|a\|_{2}\|b\|_{2}\leq\sqrt{2}\,x_{B}^{1/2},\qquad|\mathcal{S}_{B}(\mathfrak{b% })|/M_{c}\ll_{\sigma}NL^{-3692}.\end{gathered}

Use A=3692A=3692, B=1B=1, ϵ=1/12\epsilon=1/12 and BBV=BBV⁢(3692,1,1/12)B_{\mathrm{BV}}=B_{\mathrm{BV}}(3692,1,1/12) in (3.5). The source has Oσ⁢(L3689)O_{\sigma}(L^{3689}) weighted boxes. There are finitely many blocks at fixed σ\sigma. Since W≫N/L2W\gg N/L^{2}, summation gives

(8.41) |Dint(0)|+|Dint(1)|+|Dint(2)|W≪σL−1.\frac{|D_{\mathrm{int}}^{(0)}|+|D_{\mathrm{int}}^{(1)}|+|D_{\mathrm{int}}^{(2)% }|}{W}\ll_{\sigma}L^{-1}.
Verification of (8.40).

The coefficient bound is (8.17), proved above, and the modulus range is (8.14). Every supported qq is prime to 2⁢N2N, so a=Na=N is a reduced class and the maximum in (3.5) covers it. The selected sequence ana_{n} is supported in (T,2⁢T](T,2T], and bmb_{m}, after at most two dyadic pieces, in (MB,2⁢MB](M_{B},2M_{B}]. For xB=T⁢MBx_{B}=TM_{B}, xB∈[ε⁢N/8,2⁢N]x_{B}\in[\varepsilon N/8,2N] and log⁡T/log⁡xB∈[α−o⁢(1),1/5+o⁢(1)]⊂[1/12,11/12]\log T/\log x_{B}\in[\alpha-o(1),1/5+o(1)]\subset[1/12,11/12], because α−1/12=17/4596>0\alpha-1/12=17/4596>0. The hypothesis (3.4) holds with B=1B=1 by (8.37), (8.38) and ASW=A0+168A_{\mathrm{SW}}=A_{0}+168. Interior boxes have constant order predicates, so n⁢m=enm=e has one labelled representation and bm∈{0,1}b_{m}\in\{0,1\}. Thus ‖a‖2⁢‖b‖2≤(2⁢xB)1/2\|a\|_{2}\|b\|_{2}\leq(2x_{B})^{1/2}. On each interior box, 𝒮B⁢(𝔟)=∑qC𝔟⁢(q)⁢ΔB⁢(q,N)\mathcal{S}_{B}(\mathfrak{b})=\sum_{q}C_{\mathfrak{b}}(q)\Delta_{B}(q,N) with ΔB=∑piecesΔfs\Delta_{B}=\sum_{\mathrm{pieces}}\Delta_{\mathrm{fs}}, and Fact 3.3 gives |𝒮B⁢(𝔟)|/Mc≪σN⁢L−3692|\mathcal{S}_{B}(\mathfrak{b})|/M_{c}\ll_{\sigma}NL^{-3692}. Fact 3.3 is the full-support bilinear estimate derived from Bombieri–Friedlander–Iwaniec, Theorem 0(b). We verified its hypotheses above for this source.

8.7. The source-level row-three estimate

Row three keeps the full anatomy level. Its factorization keeps every labelled occurrence. The smooth divisor stays in the first factor. For d∗=ρ⁢(Θc−ηL)d_{*}=\rho(\Theta_{c}-\eta_{L}) and ei=ρ⁢tie_{i}=\rho t_{i}, the prefix inequalities are

(8.42) d∗−2⁢e1\displaystyle d_{*}-2e_{1} ≥33109160000⁢ρ,\displaystyle\geq\frac{33109}{160000}\rho,
d∗−e1−2⁢e2\displaystyle d_{*}-e_{1}-2e_{2} ≥1859160000⁢ρ,\displaystyle\geq\frac{1859}{160000}\rho,
d∗−e1−e2−2⁢e3\displaystyle d_{*}-e_{1}-e_{2}-2e_{3} ≥33109480000⁢ρ(χc=1).\displaystyle\geq\frac{33109}{480000}\rho\quad(\chi_{c}=1).

The anatomy branch gives Θc≥(1+t1)/2\Theta_{c}\geq(1+t_{1})/2. The condition χc=1\chi_{c}=1 gives the last inequality. In particular, with A3=33109/160000A_{3}=33109/160000,

(8.43) ℓc≥max⁡{A3−t3,2⁢ρ⁢t3}≥33109240000,ℓc−ℓ0≥23146324720000=0.0093633899676⁢…,Θc≤Hmax=153256,eQ=(ρ+σ)⁢(153/256−ηL)<35,35−eQ≥391160000−95609160000⁢(σ+τ)>0.0024437499.\begin{gathered}\ell_{c}\geq\max\{A_{3}-t_{3},2\rho t_{3}\}\geq\frac{33109}{24% 0000},\qquad\ell_{c}-\ell_{0}\geq\frac{231463}{24720000}=0.0093633899676\ldots% ,\\ \Theta_{c}\leq H_{\max}=\frac{153}{256},\qquad e_{Q}=(\rho+\sigma)(153/256-% \eta_{L})<\frac{3}{5},\\ \frac{3}{5}-e_{Q}\geq\frac{391}{160000}-\frac{95609}{160000}(\sigma+\tau)>0.00% 24437499.\end{gathered}

Here eQe_{Q} bounds the full modulus exponent ρ⁢(t1+t2+t3)+(ρ+σ)⁢ℓc\rho(t_{1}+t_{2}+t_{3})+(\rho+\sigma)\ell_{c}. The inherited anatomy and rough-factor estimates are Paper II, (4.20) and Appendix B, Lemma B.1(1)–(2) [27, (4.20), Appendix B, Lemma B.1(1)–(2)]. For the tail exponents sis_{i}, the cubic conditions give

(8.44) ∑i<lsi+2⁢sl<ℓc,h=d∗+60⁢σ,Θc−h≥ηL−τ⁢Hmax−60⁢σ>0.\sum_{i<l}s_{i}+2s_{l}<\ell_{c},\qquad h=d_{*}+60\sigma,\qquad\Theta_{c}-h\geq% \eta_{L}-\tau H_{\max}-60\sigma>0.

Theorem 4.1 of Paper I then supplies the load surpluses

(8.45) (7527256, 60,1144211280,26247256)⁢σ.\left(\frac{7527}{256},\ 60,\ \frac{114421}{1280},\ \frac{26247}{256}\right)\sigma.

The required length data are

(8.46) 1≤|m⁢n−N|≤N<X3,NI≥T6⁢L334≥(2⁢T)1−2−126,X60⁢σ≤T≤X1/3+15⁢σ,Q⁢Xσ/3≤NI,Q⁢R⁢S<MI⁢X−89⁢σ,MI≥X1/2.\begin{gathered}1\leq|mn-N|\leq N<X^{3},\quad N_{I}\geq\frac{T}{6L^{334}}\geq(% 2T)^{1-2^{-126}},\\ X^{60\sigma}\leq T\leq X^{1/3+15\sigma},\quad QX^{\sigma/3}\leq N_{I},\quad QRS% <M_{I}X^{-89\sigma},\quad M_{I}\geq X^{1/2}.\end{gathered}

Here NIN_{I} is the selected integer interval length. The complement has length scale MIM_{I}. The letters Q,R,SQ,R,S are the three factor scales. Each condition holds only above its fixed-σ\sigma application threshold. The floor 2⁢⌈e2150/2⌉2\lceil e^{2^{150}}/2\rceil is imposed separately. See Paper I, (3.6)–(3.9) and (4.9) [26, (3.6)–(3.9), Theorem 4.1, (4.9)]. We verify them for this source below.

The remaining analytic estimate is

(8.47) |𝒮B⁢(𝔟)|≪σ,AlocX⁢L−Aloc+X1−ℓ0⁢σ2/4⁢LCloc(𝔟⁢ in row ⁢3).|\mathcal{S}_{B}(\mathfrak{b})|\ll_{\sigma,A_{\mathrm{loc}}}XL^{-A_{\mathrm{% loc}}}+X^{1-\ell_{0}\sigma^{2}/4}L^{C_{\mathrm{loc}}}\quad(\mathfrak{b}\text{ % in row }3).

It is uniform over the permitted boxes and blocks. Here Aloc>0A_{\mathrm{loc}}>0 is arbitrary; ClocC_{\mathrm{loc}} is fixed by the local theorem. Paper I, Theorem 3.2, (3.13), supplies the local dispersion theorem. Its Theorem 2.8 enters only in the inner spectral stage. There we use the form (P1.7), Fact 3.22, with the full bracket (3.38). The inner substitution is

(8.48) rT=z,sT=p0,nT=p0⁢m,aT=ϵy⁢N(ϵy=±1),AT=X1+σ/20.r_{T}=z,\quad s_{T}=p_{0},\quad n_{T}=p_{0}m,\quad a_{T}=\epsilon_{y}N\quad(% \epsilon_{y}=\pm 1),\quad A_{T}=X^{1+\sigma/20}.

The auxiliary zz and p0p_{0} are those of Paper I’s dispersion proof. Both signs and the mixed cusp pair are kept. Let χ\chi be smooth, zero below zero and one above one. For the fixed bump ψ0\psi_{0}, define

(8.49) ψ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}. Their strict dyadic windows are (0.45,0.90](0.45,0.90], (0.80,1.60](0.80,1.60], and (1.40,2.80](1.40,2.80]. The two smooth modulus coordinates use all nine products ψ0,i⁢(b/D)⁢ψ0,j⁢(c/C)\psi_{0,i}(b/D)\psi_{0,j}(c/C), 1≤i,j≤31\leq i,j\leq 3. Multiply each by the fixed cutoffs on the supported nT,z,p0n_{T},z,p_{0}. These cutoffs equal one on the actual coefficient support. The derivative hypothesis is (3.36) with ϵ0=σ/2000\epsilon_{0}=\sigma/2000 and ϵ=σ/100\epsilon=\sigma/100.

Write θsp=7/32\theta_{\mathrm{sp}}=7/32 and Vsp=T4⁢R4⁢S6V_{\mathrm{sp}}=T^{4}R^{4}S^{6}. The coefficient in (P1.7) is zero outside the actual indices nT=p0⁢mn_{T}=p_{0}m, rT=zr_{T}=z, sT=p0s_{T}=p_{0}. Use its supported norm

(8.50) ∑n′′∣N∞(n′′)θsp⁢‖b~⁢(n′′)‖22,‖b~⁢(n′′)‖22=∑n′,r,s(n′,N)=1|bn′⁢n′′,r,s|2.\begin{gathered}\sum_{n^{\prime\prime}\mid N^{\infty}}(n^{\prime\prime})^{% \theta_{\mathrm{sp}}}\|\widetilde{b}(n^{\prime\prime})\|_{2}^{2},\\ \|\widetilde{b}(n^{\prime\prime})\|_{2}^{2}=\sum_{\begin{subarray}{c}n^{\prime% },r,s\\ (n^{\prime},N)=1\end{subarray}}|b_{n^{\prime}n^{\prime\prime},r,s}|^{2}.\end{gathered}

Here bn,r,sb_{n,r,s} is the coefficient of (P1.7). It is distinct from the complementary sequence bmb_{m}. The norm includes no coefficients outside that support. After substitution, the four bracket contributions divided by VspV_{\mathrm{sp}} are bounded by

(8.51) KA\displaystyle K_{A} =ATθsp⁢T⁢Q⁢R2⁢S5X2,\displaystyle=A_{T}^{\theta_{\mathrm{sp}}}\frac{TQR^{2}S^{5}}{X^{2}}, K2\displaystyle K_{2} =ATX⁢KA,\displaystyle=\frac{A_{T}}{X}K_{A},
KR\displaystyle K_{R} =(T⁢RS)2⁢θsp⁢T⁢Q⁢R2⁢S5X2,\displaystyle=\left(\frac{TR}{S}\right)^{2\theta_{\mathrm{sp}}}\frac{TQR^{2}S^% {5}}{X^{2}}, K4\displaystyle K_{4} =T⁢Q⁢R2⁢S5X2⁢T2⁢R2X.\displaystyle=\frac{TQR^{2}S^{5}}{X^{2}}\frac{T^{2}R^{2}}{X}.

Only uniform Xo⁢(1)X^{o(1)} factors and powers of p0p_{0} are suppressed. These are precisely Paper I, (3.81), (3.85), and (3.87) [26, (3.69), (3.81)–(3.87)]. Each term carries the actual-use hypotheses.

8.8. The row-three local dispersion estimate

The source-wide estimate also has boundary and comparator contributions. The local argument gives only its interior row-three block.

We treat one row-three block with χc=1\chi_{c}=1 and one full interior prime-coordinate mesh box. We do not assert the source-wide boundary, comparator, or row-zero-to-two estimates. Fix σ>0\sigma>0, τ=σ9\tau=\sigma^{9}, ρ=1+τ\rho=1+\tau, and a retained closed clipped parent cc, used only for the displayed infimum and endpoint checks. The actual prime cells are half-open. Keep its inherited labels t1≥t2≥t3t_{1}\geq t_{2}\geq t_{3}, Θc=infcH~\Theta_{c}=\inf_{c}\widetilde{H}, ℓc=Θc−ηL−t1−t2−t3\ell_{c}=\Theta_{c}-\eta_{L}-t_{1}-t_{2}-t_{3}, Dc=NℓcD_{c}=N^{\ell_{c}}, zc=Nt3z_{c}=N^{t_{3}} and uc=Dcσ2u_{c}=D_{c}^{\sigma^{2}}. On the whole block χc=1\chi_{c}=1. The inequalities (8.42)–(8.43) apply with the inherited labels, including clipped endpoints. Here an interior source box is a full relative-width x=(log⁡N)−334x=(\log N)^{-334} mesh box whose closure lies on one side of every source, order and descriptor face. A clipped terminal mesh fragment belongs to the boundary contribution. LEN is not applied to it.

The prefix constants can be checked without an unclipped replacement. Put A3=33109/160000A_{3}=33109/160000. Since t1,t2≤25/128t_{1},t_{2}\leq 25/128 and Θc≥(1+t1)/2\Theta_{c}\geq(1+t_{1})/2, the first two gaps are at least ρ⁢(1/2−3⁢(25/128)/2−ηL)=ρ⁢A3\rho(1/2-3(25/128)/2-\eta_{L})=\rho A_{3} and ρ⁢(1/2−5⁢(25/128)/2−ηL)=ρ⁢ 1859/160000\rho(1/2-5(25/128)/2-\eta_{L})=\rho\,1859/160000. For the third, ℓc−t3≥A3−2⁢t3\ell_{c}-t_{3}\geq A_{3}-2t_{3} and retention gives ℓc−t3≥(2⁢ρ−1)⁢t3\ell_{c}-t_{3}\geq(2\rho-1)t_{3}; their maximum is at least A3/3A_{3}/3. Likewise ℓc≥max⁡{A3−t3,2⁢ρ⁢t3}≥2⁢A3/3>ℓ0\ell_{c}\geq\max\{A_{3}-t_{3},2\rho t_{3}\}\geq 2A_{3}/3>\ell_{0}. Thus all three prefix WF inequalities have strict room. The whole anatomy infimum is taken before this branch bound is used.

Exact coefficient and labelled factorization (H1–H2).

Write 𝔟=(3,c,f,𝐃)\mathfrak{b}=(3,c,f,\mathbf{D}). Give the three prefix occurrences their independent prime sets [Nti,Nρ⁢ti)∩[Nu,Nμ∗)∩𝒫N[N^{t_{i}},N^{\rho t_{i}})\cap[N^{u},N^{\mu_{*}})\cap\mathcal{P}_{N}. For f=2f=2, append each tail occurrence, independently, with prime set [Dj,min⁡(Djρ,zc))∩𝒫N[D_{j},\min(D_{j}^{\rho},z_{c}))\cap\mathcal{P}_{N}. For f=1f=1 the tail list is empty. In both cases put JJ equal to this complete labelled list, and set λd=λd−⁢(𝐃)\lambda_{d}=\lambda_{d}^{-}(\mathbf{D}) or ϕd−\phi_{d}^{-}, respectively. Thus, exactly,

C𝔟⁢(q)=∑d<Dcσd∣PN⁢(uc)λd⁢∑(pj)j∈J1q=d⁢∏j∈Jpj,|λd|≤1.C_{\mathfrak{b}}(q)=\sum_{\begin{subarray}{c}d<D_{c}^{\sigma}\\ d\mid P_{N}(u_{c})\end{subarray}}\lambda_{d}\sum_{(p_{j})_{j\in J}}1_{q=d\prod% _{j\in J}p_{j}},\qquad|\lambda_{d}|\leq 1.

Neither distinctness mask is inserted here. The orbit divisor McM_{c}, the source weight wCw_{C}, and the two distinctness corrections remain outside this coefficient, as in (8.30)–(8.32). In particular its supports include repeated-prime moduli, and (q,2⁢N)=1(q,2N)=1. The prime sets are the actual clipped sets, not their unclipped parents. All labelled primes are at least uc≥u0u_{c}\geq u_{0} with u0=Nℓ0⁢σ2u_{0}=N^{\ell_{0}\sigma^{2}}, since ℓc>ℓ0\ell_{c}>\ell_{0} and ℓc⁢σ2<u\ell_{c}\sigma^{2}<u.

For packing use the actual upper exponents of the clipped prime sets. The first three are at most ρ⁢ti\rho t_{i}; all tail upper exponents are at most t3t_{3}. The prefix masks in (8.42) and the tail masks ∑i<jsi+2⁢sj<ℓc\sum_{i<j}s_{i}+2s_{j}<\ell_{c} show that their merged decreasing list satisfies WF⁢(d∗)\mathrm{WF}(d_{*}), where d∗=ρ⁢(Θc−ηL)d_{*}=\rho(\Theta_{c}-\eta_{L}). For a tail rank, this follows after adding at most ρ⁢(t1+t2+t3)\rho(t_{1}+t_{2}+t_{3}) to its tail inequality. The top three upper exponents are the prefix endpoints, belonging to the closed clipped parent. Hence their anatomy value is at least Θc\Theta_{c}. Put h=d∗+60⁢σh=d_{*}+60\sigma, δ=30⁢σ\delta=30\sigma and g=logN⁡T−δg=\log_{N}T-\delta. Every point 𝐱\mathbf{x} of the closed clipped parent satisfies u≤x1≤μ∗=25/128u\leq x_{1}\leq\mu_{*}=25/128. On this interval the vpk⁢(x1)v_{\rm pk}(x_{1}) branch of Paper I gives H~⁢(𝐱)≥vpk⁢(x1)=(1+x1)/2\widetilde{H}(\mathbf{x})\geq v_{\rm pk}(x_{1})=(1+x_{1})/2; hence Θc≥(1+u)/2\Theta_{c}\geq(1+u)/2. Therefore h≥Θc−ηL+60⁢σ≥1+u2−ηL>12h\geq\Theta_{c}-\eta_{L}+60\sigma\geq\frac{1+u}{2}-\eta_{L}>\frac{1}{2}; also h<Θc≤153/256h<\Theta_{c}\leq 153/256, since Θc−h≥ηL−τ⁢Hmax−60⁢σ>0\Theta_{c}-h\geq\eta_{L}-\tau H_{\max}-60\sigma>0. Theorem 4.1 of Paper I applies to this same labelled list, with δ≤g≤1/3−δ/2\delta\leq g\leq 1/3-\delta/2. Let its partition be J=J1⊔J2⊔J3J=J_{1}\sqcup J_{2}\sqcup J_{3}, with the smooth divisor attached to slot one. Define, using precisely the preceding prime sets,

γ1⁢(v)=1|J1|!⁢∑d,(pj)J1λd⁢1v=d⁢∏J1pj,γs⁢(v)=1|Js|!⁢∑(pj)Js1v=∏Jspj(s=2,3).\gamma_{1}(v)=\frac{1}{|J_{1}|!}\sum_{d,(p_{j})_{J_{1}}}\lambda_{d}1_{v=d\prod% _{J_{1}}p_{j}},\qquad\gamma_{s}(v)=\frac{1}{|J_{s}|!}\sum_{(p_{j})_{J_{s}}}1_{% v=\prod_{J_{s}}p_{j}}\quad(s=2,3).

Empty slots two and three mean the atom 1v=11_{v=1}. Slot one always keeps the dd sum, even if J1J_{1} is empty. The finite tuple map gives

C𝔟=Cslot⁢(γ1∗γ2∗γ3),Cslot=∏s|Js|!,|γs|≤1.C_{\mathfrak{b}}=C_{\rm slot}(\gamma_{1}*\gamma_{2}*\gamma_{3}),\qquad C_{\rm slot% }=\prod_{s}|J_{s}|!,\qquad|\gamma_{s}|\leq 1.

The primes below ucu_{c} determine dd uniquely. At most |Js|!|J_{s}|! assignments have a fixed slot product. The count allows repeated primes. The rough coordinate count is less than 3/(5⁢ℓ0⁢σ2)3/(5\ell_{0}\sigma^{2}), so Cslot=Oσ⁢(1)C_{\rm slot}=O_{\sigma}(1) and |C𝔟⁢(q)|/Mc≤Mσ!|C_{\mathfrak{b}}(q)|/M_{c}\leq M_{\sigma}!, with Mσ=⌈3/(5⁢ℓ0⁢σ2)⌉M_{\sigma}=\lceil 3/(5\ell_{0}\sigma^{2})\rceil. For the tested boxes below, take Cctr=2C_{\rm ctr}=2. Uniformly for sufficiently large NN,

NIT⁢L−334∈[1/2,2],MI(X/T)⁢L−334∈[2,20].\frac{N_{I}}{TL^{-334}}\in[1/2,2],\qquad\frac{M_{I}}{(X/T)L^{-334}}\in[2,20].
The same tested box (H3–H5).

Use exactly (8.33) and (8.35): X=∏iAiX=\prod_{i}A_{i}, T=⌈A1⌉−1T=\lceil A_{1}\rceil-1, UJ=⌈B1⌉−1U_{J}=\lceil B_{1}\rceil-1, and αn=1ℙ⁢(n)⁢1T<n≤UJ\alpha_{n}=1_{\mathbb{P}}(n)1_{T<n\leq U_{J}}. No product truncation is added to ΔB\Delta_{B}. Take Cbox=334C_{\rm box}=334; log⁡X=log⁡N+O⁢(1)\log X=\log N+O(1) throughout this family. For sufficiently large NN, T>250T>2^{50} and UJ≤2⁢TU_{J}\leq 2T, so

αn=1P−⁢(n)≥T51/100⁢1T<n≤UJ.\alpha_{n}=1_{P^{-}(n)\geq T^{51/100}}1_{T<n\leq U_{J}}.

Thus (3.8), option 11, holds with ζ=T51/100≥z0⁢(X)\zeta=T^{51/100}\geq z_{0}(X). The complementary sequence is the actual bm∈{0,1}b_{m}\in\{0,1\} of (8.33); in particular |bm|≤τ23⁢(m)|b_{m}|\leq\tau_{23}(m). There is no Heath–Brown expansion, logarithm freezing, or proper-power replacement error for this selected direct-prime representation. The selected-factor Siegel–Walfisz bound is Paper I (3.25), uniform in this stronger cutoff and every endpoint and auxiliary coprimality. Its relative-norm alternative is kept as in (3.48). We assume no lower bound on any coprimality-truncated selected norm. In the large-norm case of (3.48), use Lemma 6.5(ii). Its premises (3.1), (3.2), (3.6), (3.8) with LEN, (3.11), (3.25), (3.26) and (3.27) are the data verified in this subsection.

Let M=∏i=2kAiM=\prod_{i=2}^{k}A_{i}, M+=∏i=2kBiM_{+}=\prod_{i=2}^{k}B_{i}, MI=M+−MM_{I}=M_{+}-M, m0=(M+M+)/2m_{0}=(M+M_{+})/2, and ψI⁢(m)=ϕ0⁢((m−m0)/MI)\psi_{I}(m)=\phi_{0}((m-m_{0})/M_{I}), with the fixed bump of Paper I (3.9). Then ψI=1\psi_{I}=1 on the full complementary product interval. Since 5≤k≤115\leq k\leq 11 and the mesh boxes are full, MI≍M⁢L−334M_{I}\asymp ML^{-334}, m0≤2⁢X/Tm_{0}\leq 2X/T, and NI=UJ−T≥T/(6⁢L334)N_{I}=U_{J}-T\geq T/(6L^{334}), where L=log⁡NL=\log N. For fixed σ\sigma enlarge the threshold so that σ⁢L≥2130⁢(log⁡L+1)\sigma L\geq 2^{130}(\log L+1); then

NI≥(2⁢T)1−2−126,X60⁢σ≤T≤X1/3+15⁢σ,MI≥X1/2.N_{I}\geq(2T)^{1-2^{-126}},\quad X^{60\sigma}\leq T\leq X^{1/3+15\sigma},\quad M% _{I}\geq X^{1/2}.

These follow from Nα/2≤T<N1/5N^{\alpha}/2\leq T<N^{1/5} and ε⁢N≤X≤N\varepsilon N\leq X\leq N. The integer convention is (T,UJ](T,U_{J}]; no continuous interval length replaces NIN_{I}.

The doubled support lies in [M−MI/2,M++MI/2][M-M_{I}/2,M_{+}+M_{I}/2]. Since k−1≤10k-1\leq 10, (1+x)k−1−1≤11⁢x(1+x)^{k-1}-1\leq 11x eventually. On this entire support and for every selected integer, m⁢n≤Ncut+25⁢x⁢Nmn\leq N_{\rm cut}+25xN. Consequently

1≤N−m⁢n,N−m⁢n≥(L−25)⁢N⁢L−334>0,|m⁢n−N|≤N<X3.1\leq N-mn,\qquad N-mn\geq(L-25)NL^{-334}>0,\qquad|mn-N|\leq N<X^{3}.

This verifies nonresonance on the full doubled rectangle, including both Cauchy–Schwarz copies. Checking only where bm≠0b_{m}\neq 0 would not suffice.

After localization, Q,R,SQ,R,S denote the scales of γ1,γ3,γ2\gamma_{1},\gamma_{3},\gamma_{2}, respectively. Theorem 4.1 gives, before fixed dyadic rounding and base conversion, reductions

(7527/256, 60, 114421/1280, 26247/256)⁢σ(7527/256,\ 60,\ 114421/1280,\ 26247/256)\sigma

in Q/TQ/T, T2⁢R2⁢ST^{2}R^{2}S, A07/32⁢T⁢Q⁢R2⁢S5A_{0}^{7/32}TQR^{2}S^{5} and (T⁢R/S)7/16⁢T⁢Q⁢R2⁢S5(TR/S)^{7/16}TQR^{2}S^{5}, respectively, relative to their bounds 1,N,N2,N21,N,N^{2},N^{2}. Here A0=X1+σ/20A_{0}=X^{1+\sigma/20}. The first slot includes the additional load σ⁢ℓc≤σ⁢Hmax\sigma\ell_{c}\leq\sigma H_{\max}. Each listed reduction strictly exceeds the required losses 29,8,15,1529,8,15,15. Hence fixed dyadic constants and logN⁡(N/X)=O⁢(1/L)\log_{N}(N/X)=O(1/L) are absorbed for fixed σ\sigma. In particular the exact requirements (3.6)–(3.7) hold:

Q<T⁢X−29⁢σ,NI≥Q⁢Xσ/3,Q⁢R⁢S<MI⁢X−89⁢σ,MI≥X1/2,Q<TX^{-29\sigma},\quad N_{I}\geq QX^{\sigma/3},\quad QRS<M_{I}X^{-89\sigma},% \quad M_{I}\geq X^{1/2},
T2⁢R2⁢S<X1−8⁢σ,A07/32⁢T⁢Q⁢R2⁢S5<X2−15⁢σ,(T⁢R/S)7/16⁢T⁢Q⁢R2⁢S5<X2−15⁢σ.T^{2}R^{2}S<X^{1-8\sigma},\quad A_{0}^{7/32}TQR^{2}S^{5}<X^{2-15\sigma},\quad(% TR/S)^{7/16}TQR^{2}S^{5}<X^{2-15\sigma}.

For Q⁢R⁢S<MI⁢X−89⁢σQRS<M_{I}X^{-89\sigma} use the positive fixed gap 4/5−153/2564/5-153/256 and MI≫N4/5⁢L−334M_{I}\gg N^{4/5}L^{-334}. The complete modulus, including dd and all labelled primes, obeys

q<NeQ,eQ=(ρ+σ)⁢(153/256−ηL)<3/5.q<N^{e_{Q}},\qquad e_{Q}=(\rho+\sigma)(153/256-\eta_{L})<3/5.

Because X≥ε⁢NX\geq\varepsilon N, impose (3/5−eQ)⁢log⁡N≥(3/5)⁢log⁡(1/ε)(3/5-e_{Q})\log N\geq(3/5)\log(1/\varepsilon) to obtain q≤X3/5q\leq X^{3/5}. Take the moving frequency a=Na=N and Kscale=1K_{\rm scale}=1: eventually 0<N≤X⁢log⁡N≤A00<N\leq X\log N\leq A_{0} and every supported modulus is prime to 2⁢a2a. This proves H1–H5 with the support relaxation of Paper I Theorem 3.2.

Application and restoration.

Apply Paper I Theorem 3.2, (3.13), to this full unrestricted coefficient and this full-support natural-coprime discrepancy. For every fixed Aloc>0A_{\rm loc}>0 it gives exactly

|𝒮B⁢(𝔟)|≪σ,AlocX⁢(log⁡X)−Aloc+X1−ℓ0⁢σ2/4⁢(log⁡X)Cloc.|\mathcal{S}_{B}(\mathfrak{b})|\ll_{\sigma,A_{\rm loc}}X(\log X)^{-A_{\rm loc}% }+X^{1-\ell_{0}\sigma^{2}/4}(\log X)^{C_{\rm loc}}.

Constants are uniform in these boxes and in blocks with χc=1\chi_{c}=1 after fixing σ\sigma and source constants. The threshold is ineffective. Theorem 3.1’s smaller abstract support class is not used. The proof includes all local restorations (3.32)–(3.50): with ϵ=ℓ0⁢σ2/8\epsilon=\ell_{0}\sigma^{2}/8 and Awork=Aloc+4A_{\rm work}=A_{\rm loc}+4,

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}\}.

Keep both terms in braces. They come from restoring the five cross-copy gcd failures of (3.30), the close-pair set, and the zero-mode main-term cancellation. The spectral estimate alone does not give them. The z0z_{0} term joins the arbitrary logarithmic saving, and the remaining terms have savings exceeding ℓ0⁢σ2/4\ell_{0}\sigma^{2}/4.

Theorem 2.8 enters only at Paper I (3.69)–(3.90). In that inner stage, with p0=min⁡{p:p∤2⁢N}p_{0}=\min\{p:p\nmid 2N\}, set rT=zr_{T}=z, sT=p0s_{T}=p_{0}, nT=p0⁢mn_{T}=p_{0}m, aT=εy⁢Na_{T}=\varepsilon_{y}N, NT=8⁢p0⁢H∗⁢S⁢FN_{T}=8p_{0}H_{*}SF and AT=A0A_{T}=A_{0}. Both signs are kept. The coefficient is exactly βz,mχ,εy\beta_{z,m}^{\chi,\varepsilon_{y}} of (3.68) on these indices and zero elsewhere. In particular

∑n′′∣N∞(n′′)7/32⁢‖b~⁢(n′′)‖22≪Xo⁢(1)⁢(H∗⁢S)2⁢F,‖b~⁢(n′′)‖22=∑n′,r,s(n′,N)=1|bn′⁢n′′,r,s|2,\sum_{n^{\prime\prime}\mid N^{\infty}}(n^{\prime\prime})^{7/32}\|\widetilde{b}% (n^{\prime\prime})\|_{2}^{2}\ll X^{o(1)}(H_{*}S)^{2}F,\quad\|\widetilde{b}(n^{% \prime\prime})\|_{2}^{2}=\sum_{\begin{subarray}{c}n^{\prime},r,s\\ (n^{\prime},N)=1\end{subarray}}|b_{n^{\prime}n^{\prime\prime},r,s}|^{2},

with no coefficients added outside that support. The unweighted norm has the same bound. These are the endpoint norm bounds (3.70)–(3.81). When slot two is a unit, S=1/2S=1/2 and every nonzero-frequency block is empty. Otherwise (3.82)–(3.85) identify the exact phase, permit p0∣cp_{0}\mid c, and use all nine dyadic weights from (8.49), with ϵ0=σ/2000\epsilon_{0}=\sigma/2000 and ϵ=σ/100\epsilon=\sigma/100. The full bracket of (3.38), including its moving-frequency and mixed-cusp terms, yields all four quantities in (8.51). No bracket term is discarded. The full bounds (3.87)–(3.90) then control the inner spectral term. After that, the restoration terms above and CslotC_{\rm slot} are put back.

Finally, this estimate concerns C𝔟⁢ΔBC_{\mathfrak{b}}\Delta_{B}. The outer identity is still

Radv=Edisp,1+Edisp,2+Esq+Enc.R_{\rm adv}=E_{\rm disp,1}+E_{\rm disp,2}+E_{\rm sq}+E_{\rm nc}.

Thus Mc−1M_{c}^{-1} and wCw_{C} enter once. The forbidden and allowed-repeat masks remain in EsqE_{\rm sq}. The natural-to-XAX_{A} comparator remains in EncE_{\rm nc}. The source cutoff, peel, boundary and terminal-mesh restorations, capped rows zero to two, and complete-family coefficient counts require their own estimates. This local estimate alone gives neither the complete L3 bound nor the RSW bound.

The outer application of Theorem 3.2 above supplies (8.47). The scoped spectral implications in Section 3 do not by themselves give it.

8.9. The complete box family

The required complete-family bounds are

(8.52) #⁢ℰbdry≪N⁢L−334,Dbdry≪σN⁢L−331/2,∑B|wB|≪σL3689.\#\mathcal{E}_{\mathrm{bdry}}\ll NL^{-334},\qquad D_{\mathrm{bdry}}\ll_{\sigma% }NL^{-331/2},\qquad\sum_{B}|w_{B}|\ll_{\sigma}L^{3689}.

There are at most 122122 face families per kk. Their integer normals have maximum coefficient five. Their coefficient sums are at most eleven.

Proof of the complete-family bounds.

Use the unclipped geometric mesh [A(j),A(j+1))[A^{(j)},A^{(j+1)}), A(j)=(Nα/2)⁢(1+L−334)jA^{(j)}=(N^{\alpha}/2)(1+L^{-334})^{j}, j≥0j\geq 0, in every coordinate. Boxes with a coordinate ≥N1−4⁢α\geq N^{1-4\alpha} carry no source mass, since k≥5k\geq 5 and every prime is at least NαN^{\alpha}. So there are no terminal fragments, and every interior box is a full mesh box. Box count. Each coordinate has at most ((1−α)⁢L+1)⁢(L334+1)+1≤L335((1-\alpha)L+1)(L^{334}+1)+1\leq L^{335} mesh intervals for L≥24L\geq 24. With k≤11k\leq 11, finitely many cells and wC≤36w_{C}\leq 36, ∑B|wB|≤36⁢|𝒞+|⁢∑k=511L335⁢k≪L3685≤L3689\sum_{B}|w_{B}|\leq 36|\mathcal{C}_{+}|\sum_{k=5}^{11}L^{335k}\ll L^{3685}\leq L% ^{3689}. Boundary count. Let h′=log⁡(1+L−334)/L≤L−335h^{\prime}=\log(1+L^{-334})/L\leq L^{-335}. A source integer ee in a boundary box has its vector within h′h^{\prime} in each coordinate of a face. A radial face forces ee into [y⁢(1+L−334)−11,y⁢(1+L−334)11][y(1+L^{-334})^{-11},y(1+L^{-334})^{11}] with y∈{ε⁢N,Ncut}y\in\{\varepsilon N,N_{\mathrm{cut}}\}. There are at most 2⁢(23⁢N⁢L−334+1)2(23NL^{-334}+1) such ee. Every other face is ci⁢xi+cj⁢xj=θc_{i}x_{i}+c_{j}x_{j}=\theta with integers |ci|,|cj|≤5|c_{i}|,|c_{j}|\leq 5, ci≠0c_{i}\neq 0 [27, (5.29a)–(5.31) and the facet discussion after (5.40)]. Write e=pi⁢m′e=p_{i}m^{\prime}. For fixed m′m^{\prime}, pip_{i} lies in an interval of relative width at most 21⁢L−33421L^{-334} below N/m′N/m^{\prime}, which contains at most 21⁢L−334⁢N/m′+121L^{-334}N/m^{\prime}+1 integers. Here m′m^{\prime} is a product of at most ten primes in [Nα,N)[N^{\alpha},N), and m′<N1−αm^{\prime}<N^{1-\alpha}. By Mertens, ∑m′1/m′≤exp⁡(∑Nα≤p<N1/p)≤e/α<32\sum_{m^{\prime}}1/m^{\prime}\leq\exp(\sum_{N^{\alpha}\leq p<N}1/p)\leq e/% \alpha<32 eventually. Hence one face family contributes at most 700⁢N⁢L−334+N1−α700NL^{-334}+N^{1-\alpha}. The number of face families is finite (≤122\leq 122 for each kk). Thus #⁢ℰbdry≤Cbd⁢N⁢L−334\#\mathcal{E}_{\mathrm{bdry}}\leq C_{\mathrm{bd}}NL^{-334} with an absolute CbdC_{\mathrm{bd}}. No numerical value is required below. Boundary discrepancy. Let AbdA_{\mathrm{bd}} be AA restricted to boundary boxes. Then Dbdry=∑𝔟Mc−1⁢⟨C𝔟,ΔP,bd⟩D_{\mathrm{bdry}}=\sum_{\mathfrak{b}}M_{c}^{-1}\langle C_{\mathfrak{b}},\Delta% _{P,\mathrm{bd}}\rangle. By |C𝔟|/Mc≤CL3,σ|C_{\mathfrak{b}}|/M_{c}\leq C_{\mathrm{L3},\sigma}, ∑q1q∣N−e≤τ⁢(N−e)\sum_{q}1_{q\mid N-e}\leq\tau(N-e), Cauchy–Schwarz, τ2≤τ4\tau^{2}\leq\tau_{4}, ∑n≤Nτ4⁢(n)≤N⁢(1+L)3\sum_{n\leq N}\tau_{4}(n)\leq N(1+L)^{3} and ∑q≤N1/φ⁢(q)≤2⁢(1+L)\sum_{q\leq N}1/\varphi(q)\leq 2(1+L),

|Dbdry|≪σ36⁢(#⁢ℰbdry)1/2⁢(N⁢(1+L)3)1/2+36⁢#⁢ℰbdry⁢(1+L)≪σN⁢L−331/2,|D_{\mathrm{bdry}}|\ll_{\sigma}36(\#\mathcal{E}_{\mathrm{bdry}})^{1/2}(N(1+L)^% {3})^{1/2}+36\,\#\mathcal{E}_{\mathrm{bdry}}(1+L)\ll_{\sigma}NL^{-331/2},

with finitely many blocks at fixed σ\sigma. This proves (8.52), with the first bound in the form #⁢ℰbdry≪N⁢L−334\#\mathcal{E}_{\mathrm{bdry}}\ll NL^{-334}. Under (8.47), take Aloc≥3692A_{\mathrm{loc}}\geq 3692. The L3689L^{3689} box count and W≫N/L2W\gg N/L^{2} then leave L−1L^{-1}. Equations (8.41) and (8.52) then give

(8.53) (Radv)+/W=oσ⁢(1),(R_{\mathrm{adv}})_{+}/W=o_{\sigma}(1),

provided (8.22) and the coprime-comparator bound hold.

8.10. The principal term and its price

(P2.8d) The source-independent profile comparison.

We use Paper II, (4.70)–(4.75), in the following form. Put

(8.54) v1⁢(s)\displaystyle v_{1}(s) =min⁡{1+s2,32−34⁢s39,5764−32⁢s},\displaystyle=\min\left\{\frac{1+s}{2},\frac{32-34s}{39},\frac{57}{64}-\frac{3% }{2}s\right\},
v∗⁢(s)\displaystyle v_{*}(s) =v1⁢(s)−u,ψ∗⁢(x,y)={x,x≥y,−∞,x<y,\displaystyle=v_{1}(s)-u,\qquad\psi_{*}(x,y)=\begin{cases}x,&x\geq y,\\ -\infty,&x<y,\end{cases}
Θ∗⁢(x,y,z)\displaystyle\Theta_{*}(x,y,z) =max{v∗(x),v∗(y),v∗(x+y),v∗(x+y+z),\displaystyle=\max\{v_{*}(x),v_{*}(y),v_{*}(x+y),v_{*}(x+y+z),
ψ∗(v∗(x+z),x+2y+z),ψ∗(v∗(y+z),2x+y+z)}.\displaystyle\hskip 39.83385pt\psi_{*}(v_{*}(x+z),x+2y+z),\psi_{*}(v_{*}(y+z),% 2x+y+z)\}.

The subtraction of uu precedes both guards. This is the same guard convention as equation B.14. It agrees with Paper II’s zero guard because an unguarded branch is positive, as explained immediately after that display. Define

(8.55) Hlog=log⁡(μ∗/u),a3⁢(𝐭)=Θ∗⁢(𝐭)−t1−t2−t3t3,J∗=∫uμ∗d⁢t1t1⁢∫ut1d⁢t2t2⁢∫ut21−f⁢(a3⁢(𝐭))t32⁢𝑑t3,Rup=500⁢(F⁢(30)−1)+500⁢Hlog⁢(1−f⁢(30))+250⁢Hlog2⁢(F⁢(30)−1),G∗=1μ∗+Rup+J∗.\begin{gathered}H_{\log}=\log(\mu_{*}/u),\qquad a_{3}(\mathbf{t})=\frac{\Theta% _{*}(\mathbf{t})-t_{1}-t_{2}-t_{3}}{t_{3}},\\ J_{*}=\int_{u}^{\mu_{*}}\frac{dt_{1}}{t_{1}}\int_{u}^{t_{1}}\frac{dt_{2}}{t_{2% }}\int_{u}^{t_{2}}\frac{1-f(a_{3}(\mathbf{t}))}{t_{3}^{2}}\,dt_{3},\\ R_{\mathrm{up}}=500(F(30)-1)+500H_{\log}(1-f(30))+250H_{\log}^{2}(F(30)-1),\\ G_{*}=\frac{1}{\mu_{*}}+R_{\mathrm{up}}+J_{*}.\end{gathered}

Extend ff by zero below two. These are Paper II, (4.70)–(4.75) [27, (4.70)–(4.75)]. Their source-independent comparison uses

(8.56) g=(u−ηL)−92⁢μ∗⁢τ>0.001899>2⁢μ∗⁢τ.g=(u-\eta_{L})-\frac{9}{2}\mu_{*}\tau>0.001899>2\mu_{*}\tau.

Hence a positive canonical lower term lies in a cell with χc=1\chi_{c}=1. The capped rows still satisfy sc>30s_{c}>30. Their residuals are bounded by the same RupR_{\mathrm{up}}. Thus the cap changes neither G∗G_{*} nor its price.

Let 𝒫Π\mathcal{P}_{\Pi} be the signed prefix profile:

(8.57) 𝒫Π=\displaystyle\mathcal{P}_{\Pi}={} 1u⁢F⁢(s0)−1u⁢∑c:j=1volc⁡f⁢(sc)+1u⁢∑c:j=2volc⁡F⁢(sc)\displaystyle\frac{1}{u}F(s_{0})-\frac{1}{u}\sum_{c:j=1}\operatorname{vol}_{c}% f(s_{c})+\frac{1}{u}\sum_{c:j=2}\operatorname{vol}_{c}F(s_{c})
−∑c:j=3,χc=1volct3⁢f⁢(ℓc/t3),volc=∫c∏id⁢titi.\displaystyle-\sum_{c:j=3,\chi_{c}=1}\frac{\operatorname{vol}_{c}}{t_{3}}f(% \ell_{c}/t_{3}),\qquad\operatorname{vol}_{c}=\int_{c}\prod_{i}\frac{dt_{i}}{t_% {i}}.

The required mass and comparison statements are

(8.58) XA≤NL⁢{(1−ε)⁢IHL+O⁢(L−1)},Mprin=XA⁢2⁢e−γ⁢C⁢(N)L⁢(𝒫Π+oσ⁢(1)),𝒫Π≤G∗+oσ⁢(1).\begin{gathered}X_{A}\leq\frac{N}{L}\{(1-\varepsilon)I_{\mathrm{HL}}+O(L^{-1})% \},\\ M_{\mathrm{prin}}=X_{A}\frac{2e^{-\gamma}C(N)}{L}(\mathcal{P}_{\Pi}+o_{\sigma}% (1)),\qquad\mathcal{P}_{\Pi}\leq G_{*}+o_{\sigma}(1).\end{gathered}

The first bound is Paper II, (5.34)–(5.42). The last comparison uses (4.72)–(4.75) [27, (4.72)–(4.75), (5.34)–(5.42)].

Proof of (8.58).

Mass. The cells 𝒞+\mathcal{C}_{+} are Paper II’s cells with wC≥1w_{C}\geq 1, and the radial range ε⁢N<e<N\varepsilon N<e<N is Paper II’s. The outer-box majorant f+f^{+} of Paper II, (5.34), counts labelled factorizations into all primes in [Nα,N)[N^{\alpha},N), and c⁢(𝐣)≥wCc(\mathbf{j})\geq w_{C} for the box 𝐣\mathbf{j} containing the ordered factor vector of ee, which lies in CNC_{N}. Hence A≤f+A\leq f^{+} pointwise directly (no comparison with the intermediate gg is used). Paper II, (5.34)–(5.42), then gives XA≤X+=NL⁢{(1−ε)⁢IHL+O⁢(L−1)}X_{A}\leq X^{+}=\frac{N}{L}\{(1-\varepsilon)I_{\mathrm{HL}}+O(L^{-1})\} [27, (5.32), (5.34), (5.42)]. In particular XA≤N/LX_{A}\leq N/L eventually, since IHL≤H¯<1I_{\mathrm{HL}}\leq\overline{H}<1. Principal term. As in Paper II, Lemma B.9, VN⁢(z)=(1+o⁢(1))⁢2⁢e−γ⁢C⁢(N)/log⁡zV_{N}(z)=(1+o(1))2e^{-\gamma}C(N)/\log z uniformly for z≥Nhz\geq N^{h}, h=1/1000h=1/1000 [27, (B.9) and its proof]. The proof of (B.9) gives an exact factorization. Mertens’ theorem gives the asymptotic. The primes p∣Np\mid N with p≥zp\geq z change the product by 1+O⁢(ω⁢(N)/z)1+O(\omega(N)/z). Every actual cutoff is at least Nu/ρ3>NhN^{u/\rho^{3}}>N^{h} [27, Lemma B.8]. At fixed σ\sigma the cells are finitely many, with fixed exponent boxes. Mertens gives ∑v∈c1/φ⁢(v)=volc+o⁢(1)\sum_{v\in c}1/\varphi(v)=\operatorname{vol}_{c}+o(1), the primes dividing 2⁢N2N costing O⁢(ω⁢(N)⁢N−u)O(\omega(N)N^{-u}). Also Kj⁢(sc)K_{j}(s_{c}) is bounded. Summing νj⁢Mj\nu_{j}M_{j} gives Mprin=XA⁢2⁢e−γ⁢C⁢(N)L⁢(𝒫Π+oσ⁢(1))M_{\mathrm{prin}}=X_{A}\frac{2e^{-\gamma}C(N)}{L}(\mathcal{P}_{\Pi}+o_{\sigma}% (1)), with logN⁡z3,c=t3\log_{N}z_{3,c}=t_{3} supplying the factor 1/t31/t_{3}. Profile comparison. Write F=1+(F−1)F=1+(F-1), f=1−(1−f)f=1-(1-f). On rows 0,1,20,1,2, sc>30s_{c}>30, and FF decreases and ff increases. With ∑j=1volc=Hlog\sum_{j=1}\operatorname{vol}_{c}=H_{\log} and ∑j=2volc=Hlog2/2\sum_{j=2}\operatorname{vol}_{c}=H_{\log}^{2}/2, the residuals are at most RupR_{\mathrm{up}} [27, (4.73)]. For row three, if f⁢(a3⁢(𝐱))>0f(a_{3}(\mathbf{x}))>0 at an actual point 𝐱\mathbf{x} of a cell, then (8.56) gives χc=1\chi_{c}=1 and ℓc≥Θ∗⁢(𝐱)−x1−x2−x3\ell_{c}\geq\Theta_{*}(\mathbf{x})-x_{1}-x_{2}-x_{3} [27, (4.72) and the two paragraphs after it]. For x3∈[t3,ρ⁢t3]x_{3}\in[t_{3},\rho t_{3}], monotonicity of s⁢f⁢(s)sf(s) at fixed numerator ℓc\ell_{c} gives f⁢(ℓc/t3)/t3≥f⁢(ℓc/x3)/x3≥f⁢(a3⁢(𝐱))/x3f(\ell_{c}/t_{3})/t_{3}\geq f(\ell_{c}/x_{3})/x_{3}\geq f(a_{3}(\mathbf{x}))/x% _{3}. Integrating over each retained cell, ∑j=3,χc=1volc⁡f⁢(ℓc/t3)/t3≥∫∫∫f⁢(a3)⁢𝑑t1⁢𝑑t2⁢𝑑t3/(t1⁢t2⁢t32)\sum_{j=3,\chi_{c}=1}\operatorname{vol}_{c}f(\ell_{c}/t_{3})/t_{3}\geq\int\!\!% \int\!\!\int f(a_{3})\,dt_{1}dt_{2}dt_{3}/(t_{1}t_{2}t_{3}^{2}). The constant parts give 1/μ∗1/\mu_{*} by [27, (4.74)]. Hence 𝒫Π≤1/μ∗+Rup+J∗+oσ⁢(1)=G∗+oσ⁢(1)\mathcal{P}_{\Pi}\leq 1/\mu_{*}+R_{\mathrm{up}}+J_{*}+o_{\sigma}(1)=G_{*}+o_{% \sigma}(1), which is [27, (4.75)] for this source.

Use the same coefficient bound as the exterior comparison:

(8.59) G∗≤G0=6088440363109,2⁢e−γ⁢G0≤cK⁢2,G⁢0=68368251638755177562868463216507543729310946891045,IHL≤H¯=3892535000000.\begin{gathered}G_{*}\leq G_{0}=\frac{6088440363}{10^{9}},\qquad 2e^{-\gamma}G% _{0}\leq c_{K2,G0}=\frac{6836825163875517756286846321650754372931094689}{10^{4% 5}},\\ I_{\mathrm{HL}}\leq\overline{H}=\frac{389253}{5000000}.\end{gathered}

The functional bound G∗≤G0G_{*}\leq G_{0} is Paper II, [27, (4.73), (4.75), (4.79), (A.10a)], for the identical canonical functional (8.55). Its scalar rounding is the same as (7.36). The mass bound is Paper II, (A.11) [27, (A.11)]. The optional unshifted certificate in the unshifted-comparison subsection of Appendix B is outside this proof.

The constant cO1c_{\mathrm{O1}} is optional, non-certified appendix material outside the L3 proof. In the optional scalar comparisons below, cc denotes the rational from (1.6). No functional comparison with cO1c_{\mathrm{O1}} is needed here. Its rational definition is

(8.60) cO1=∑i=07ni⁢Bi∑i=07di⁢Bi,B=1025,c_{\mathrm{O1}}=\frac{\sum_{i=0}^{7}n_{i}B^{i}}{\sum_{i=0}^{7}d_{i}B^{i}},% \qquad B=10^{25},

with the integers in Table 8.1.

Table 8.1. Exact certificate constant
ii nin_{i} did_{i}
0 4790995369589327356095267 5033118760359274030825472
1 6963256824825772577191322 8266496527677353149933429
2 8996423827217290029713216 9138360880901719297497815
3 4916164251930472277375479 4671424972330288696699300
4 329572634628519073712385 939590108467331323910141
5 9317769528669888650546075 5634060699913223990647374
6 8280830054071768648850166 2330146450712536415611653
7 389762593301325772 57030507720277440

The exact rational comparison of cc and cO1c_{\mathrm{O1}} is in Section 9, (9.5). It uses no exponential comparison. It is independent of the coarse enclosure for U0U_{0}. The mass-integral bound is Paper II, (A.11) [27, (A.11)]. Put

(8.61) msw=e−γ2⁢IHL⁢G∗,Δcert=cK⁢2,G⁢04⁢H¯−msw≥0,Csw=6500000001111⁢CE,Psw=4854488806315827775,asw=Csw⁢σ,psw=Psw⁢σ9.\begin{gathered}m_{\mathrm{sw}}=\frac{e^{-\gamma}}{2}I_{\mathrm{HL}}G_{*},% \qquad\Delta_{\mathrm{cert}}=\frac{c_{K2,G0}}{4}\overline{H}-m_{\mathrm{sw}}% \geq 0,\\ C_{\mathrm{sw}}=\frac{650000000}{1111}C_{E},\qquad P_{\mathrm{sw}}=\frac{48544% 888063158}{27775},\\ a_{\mathrm{sw}}=C_{\mathrm{sw}}\sigma,\qquad p_{\mathrm{sw}}=P_{\mathrm{sw}}% \sigma^{9}.\end{gathered}

The remaining required estimates are

(8.62) (Mprin/W−msw)+=oσ⁢(1),Merr/W≤Csw⁢σ+oσ⁢(1),P3/W≤Psw⁢σ9+oσ⁢(1),|Enc|/W=Oσ⁢(N−α⁢L4).\begin{gathered}(M_{\mathrm{prin}}/W-m_{\mathrm{sw}})_{+}=o_{\sigma}(1),\\ M_{\mathrm{err}}/W\leq C_{\mathrm{sw}}\sigma+o_{\sigma}(1),\qquad P_{3}/W\leq P% _{\mathrm{sw}}\sigma^{9}+o_{\sigma}(1),\\ |E_{\mathrm{nc}}|/W=O_{\sigma}(N^{-\alpha}L^{4}).\end{gathered}

The exact numerical multipliers are

(8.63) 4000⋅5854⁢(1−10−4)=6500000001111,36⋅502002⁢(459/100)31−10−4=4854488806315827775.\frac{4000\cdot 585}{4(1-10^{-4})}=\frac{650000000}{1111},\qquad\frac{36\cdot 5% 02002(459/100)^{3}}{1-10^{-4}}=\frac{48544888063158}{27775}.
(P2.8c) Density product and prefix sums.

Put h=1/1000h=1/1000 and HN=∑Nh≤p≤N(p−1)−1H_{N}=\sum_{N^{h}\leq p\leq N}(p-1)^{-1}. The two bounds used in the first multiplier are

(8.64) VN⁢(z)≤4⁢C⁢(N)log⁡z≤4000⁢C⁢(N)L(z≥Nh),∑actual prefixes ⁢v1φ⁢(v)≤∑j=03HNj≤1+8+64+512=585.\begin{gathered}V_{N}(z)\leq\frac{4C(N)}{\log z}\leq\frac{4000C(N)}{L}\quad(z% \geq N^{h}),\\ \sum_{\text{actual prefixes }v}\frac{1}{\varphi(v)}\leq\sum_{j=0}^{3}H_{N}^{j}% \leq 1+8+64+512=585.\end{gathered}

These are Paper II, Appendix B, Lemmas B.9 and B.11, (B.9) and (B.11) [27, Appendix B, Lemmas B.9, B.11, (B.9), (B.11)]. Each half-open prefix cell is counted once. Using XA≤N/LX_{A}\leq N/L from (P2.8d) now gives

(8.65) Merr≤XA⁢4000⁢C⁢(N)L⁢ 585⁢{CE⁢σ+oσ⁢(1)}.M_{\mathrm{err}}\leq\frac{X_{A}4000C(N)}{L}\,585\{C_{E}\sigma+o_{\sigma}(1)\}.

Division by W=4⁢(1−ε)⁢C⁢(N)⁢N/L2W=4(1-\varepsilon)C(N)N/L^{2} gives CswC_{\mathrm{sw}}.

(P2.8e) The upper mass and the peel.

The source mass is (8.58), Paper II, (5.34)–(5.42). The native lower-sieve cutoff uses the finite peel (8.11) and the estimate

(8.66) P3W≤36⋅502002⁢(459/100)31−ε⁢τ+oσ⁢(1).\frac{P_{3}}{W}\leq\frac{36\cdot 502002(459/100)^{3}}{1-\varepsilon}\tau+o_{% \sigma}(1).

For the uniform two-form calculation, put m=v⁢rm=vr and w=min⁡(zc,Nα)w=\min(z_{c},N^{\alpha}). The required ranges are

(8.67) logN⁡m≤153/256+2⁢τ,logN⁡w≥2/1001,w2⁢m≤N253/256+(153/64)⁢τ<N1−0.0116.\begin{gathered}\log_{N}m\leq 153/256+2\tau,\qquad\log_{N}w\geq 2/1001,\\ w^{2}m\leq N^{253/256+(153/64)\tau}<N^{1-0.0116}.\end{gathered}

For each sieve prime p<wp<w, every prime factor of m=v⁢rm=vr is at least zc≥wz_{c}\geq w, so p∤mp\nmid m. The local two-form root count is then νN⁢(p)=1\nu_{N}(p)=1 for p∣Np\mid N, and νN⁢(p)=2\nu_{N}(p)=2 otherwise. For squarefree dd, define gN⁢(d)g_{N}(d) multiplicatively by gN⁢(p)=νN⁢(p)/(p−νN⁢(p))g_{N}(p)=\nu_{N}(p)/(p-\nu_{N}(p)). The denominator and one-layer bound are

(8.68) 𝒢N⁢(w)=∑d≤wd∣P⁢(w)gN⁢(d)=log2⁡w4⁢C⁢(N)⁢(1+o⁢(1)),Sm(1)⁢(w)≤N/m𝒢N⁢(w)+O⁢(w2⁢log5⁡w)≤502002⁢2⁢C⁢(N)⁢Nm⁢L2.\begin{gathered}\mathcal{G}_{N}(w)=\sum_{\begin{subarray}{c}d\leq w\\ d\mid P(w)\end{subarray}}g_{N}(d)=\frac{\log^{2}w}{4C(N)}(1+o(1)),\\ S^{(1)}_{m}(w)\leq\frac{N/m}{\mathcal{G}_{N}(w)}+O(w^{2}\log^{5}w)\leq 502002% \,\frac{2C(N)N}{mL^{2}}.\end{gathered}

Here P⁢(w)P(w) is the product of all primes below ww. The last step uses 2.001/(2/1001)2=501251.00025<5020022.001/(2/1001)^{2}=501251.00025<502002. The exponent saving in (8.67) absorbs its remainder. There are at most 3636 source layers. For the parent-bin prime sums MhM_{h}, the needed estimates are

(8.69) Mh=∑p⁢in⁢bin⁢h1p≤2⁢τ,∑hMh≤459100,∑a1,a2,a3,r1a1⁢a2⁢a3⁢r≤2⁢(459100)3⁢τ.M_{h}=\sum_{p\ \mathrm{in\ bin}\ h}\frac{1}{p}\leq 2\tau,\qquad\sum_{h}M_{h}% \leq\frac{459}{100},\qquad\sum_{a_{1},a_{2},a_{3},r}\frac{1}{a_{1}a_{2}a_{3}r}% \leq 2\left(\frac{459}{100}\right)^{3}\tau.

The pair a3,ra_{3},r belongs to one parent bin. Multiplication of (8.68) by 3636 and this sum, then division by WW, gives (8.66). These are the exact steps of Paper II, (4.45)–(4.56), with the layer ceiling changed from three to 3636 [27, (4.45)–(4.56), (5.34)–(5.42)]. The uniform two-form estimates are proved here under the stated ranges.

Proof of (8.62).

Principal. Since 𝒫Π≤G∗+oσ⁢(1)\mathcal{P}_{\Pi}\leq G_{*}+o_{\sigma}(1) and G∗>0G_{*}>0, the mass bound gives Mprin/W≤(1−ε)⁢IHL⁢2⁢e−γ⁢(G∗+o⁢(1))4⁢(1−ε)=msw+oσ⁢(1)M_{\mathrm{prin}}/W\leq\frac{(1-\varepsilon)I_{\mathrm{HL}}2e^{-\gamma}(G_{*}+% o(1))}{4(1-\varepsilon)}=m_{\mathrm{sw}}+o_{\sigma}(1). Secondary sieve. Es,c≤CE⁢σ+oσ⁢(1)E_{s,c}\leq C_{E}\sigma+o_{\sigma}(1) uniformly, since ℓc≥ℓ1\ell_{c}\geq\ell_{1}. Lemma B.9, Lemma B.11 and XA≤N/LX_{A}\leq N/L give (8.65). Every prefix lies in one row, so the four depths together contribute at most 585585 [27, (B.9), (B.11)]. Peel. For m=v⁢rm=vr in P3P_{3}, all primes of mm are at least zcz_{c}, (m,N)=1(m,N)=1 and zc∈[Nu/ρ3,Nρ⁢μ∗]z_{c}\in[N^{u/\rho^{3}},N^{\rho\mu_{*}}]. Since χc=1\chi_{c}=1, logN⁡m≤ρ⁢(t1+t2+2⁢t3)≤ρ⁢(153/256−ηL)<153/256+2⁢τ\log_{N}m\leq\rho(t_{1}+t_{2}+2t_{3})\leq\rho(153/256-\eta_{L})<153/256+2\tau [27, (4.55)]. Write A=∑h=1361{A≥h}A=\sum_{h=1}^{36}1_{\{A\geq h\}}. Each layer consists of NαN^{\alpha}-rough ee. With N−e=m⁢kN-e=mk, both kk and N−m⁢kN-mk are ww-rough, w=min⁡(zc,Nα)w=\min(z_{c},N^{\alpha}). A prime p<wp<w dividing kk and NN would divide ee, and kk is odd. The two-form Selberg bound [27, (4.48)–(4.54)] gives (8.68) for each layer, with remainder absorbed by (8.67). The prime sums (8.69) are [27, (4.56)], since rr and a3a_{3} lie in one parent bin. Multiplying by 3636 gives (8.66). Comparator. For squarefree qq, |dA⁢(q)|=φ⁢(q)−1⁢∑(e,q)>1A⁢(e)|d_{A}(q)|=\varphi(q)^{-1}\sum_{(e,q)>1}A(e). A common prime ℓ\ell of ee and qq is at least NαN^{\alpha}, so with q=ℓ⁢rq=\ell r,

∑q⁢sf|O𝔟⁢(q)⁢dA⁢(q)|≤CL3,σ⁢∑ℓ≥Nα36⁢Nℓ⁢(ℓ−1)⁢∑r≤N1φ⁢(r)≪σN1−α⁢L.\sum_{q\ \mathrm{sf}}|O_{\mathfrak{b}}(q)d_{A}(q)|\leq C_{\mathrm{L3},\sigma}% \sum_{\ell\geq N^{\alpha}}\frac{36N}{\ell(\ell-1)}\sum_{r\leq N}\frac{1}{% \varphi(r)}\ll_{\sigma}N^{1-\alpha}L.

Summing finitely many blocks and dividing by WW gives |Enc|/W=Oσ⁢(N−α⁢L3)|E_{\mathrm{nc}}|/W=O_{\sigma}(N^{-\alpha}L^{3}), which implies the stated Oσ⁢(N−α⁢L4)O_{\sigma}(N^{-\alpha}L^{4}). This is the coprime-comparator bound used in (8.53).

8.11. The finite signed identity and its consequence

(P2.8a) Finite signed identities.

For the finite source (8.3) and stated sieve data, combine (8.7), (8.12) and (8.29). Their conditional signed identity is

(8.70) Ssw=Esrc+P3+Mprin+Merr+Radv−(Zsrc+ZAA+Zpeel).S_{\mathrm{sw}}=E_{\mathrm{src}}+P_{3}+M_{\mathrm{prin}}+M_{\mathrm{err}}+R_{% \mathrm{adv}}-(Z_{\mathrm{src}}+Z_{\mathrm{AA}}+Z_{\mathrm{peel}}).

Define

(8.71) δP\displaystyle\delta_{P} =P3/W−psw,δA=Merr/W−asw,δM=Mprin/W−msw,\displaystyle=P_{3}/W-p_{\mathrm{sw}},\qquad\delta_{A}=M_{\mathrm{err}}/W-a_{% \mathrm{sw}},\qquad\delta_{M}=M_{\mathrm{prin}}/W-m_{\mathrm{sw}},
Rsw\displaystyle R_{\mathrm{sw}} =Esrc/W+δP+δA+δM+Radv/W,\displaystyle=E_{\mathrm{src}}/W+\delta_{P}+\delta_{A}+\delta_{M}+R_{\mathrm{% adv}}/W,
Vsw\displaystyle V_{\mathrm{sw}} =(Rsw)+≤Esrc/W+(δP)++(δA)++(δM)++(Radv)+/W.\displaystyle=(R_{\mathrm{sw}})_{+}\leq E_{\mathrm{src}}/W+(\delta_{P})_{+}+(% \delta_{A})_{+}+(\delta_{M})_{+}+(R_{\mathrm{adv}})_{+}/W.

Under the stated sieve hypotheses, all three ZZ terms are nonnegative. Consequently

(8.72) −SswW\displaystyle-\frac{S_{\mathrm{sw}}}{W} =−msw−asw−psw−Rsw+Zsrc+ZAA+ZpeelW\displaystyle=-m_{\mathrm{sw}}-a_{\mathrm{sw}}-p_{\mathrm{sw}}-R_{\mathrm{sw}}% +\frac{Z_{\mathrm{src}}+Z_{\mathrm{AA}}+Z_{\mathrm{peel}}}{W}
≥−cK⁢2,G⁢04⁢H¯−Csw⁢σ−Psw⁢σ9−Vsw.\displaystyle\geq-\frac{c_{K2,G0}}{4}\overline{H}-C_{\mathrm{sw}}\sigma-P_{% \mathrm{sw}}\sigma^{9}-V_{\mathrm{sw}}.

The favorable ZpeelZ_{\mathrm{peel}} is used once. Every adverse remainder remains in (8.71).

Assume all estimates stated above for the same AA. Then (8.8), (8.53) and (8.62) imply

(8.73) Vsw=oσ⁢(1).V_{\mathrm{sw}}=o_{\sigma}(1).
Proof of (8.73).

All estimates above are proved for the same AA, the same cells and the same blocks. By (8.8), Esrc/W≪L−331E_{\mathrm{src}}/W\ll L^{-331}. By (8.62), (δM)+,(δA)+,(δP)+(\delta_{M})_{+},(\delta_{A})_{+},(\delta_{P})_{+} are oσ⁢(1)o_{\sigma}(1). For RadvR_{\mathrm{adv}}, (8.32) and (8.36) give

|Radv|W≤|Dint(0)|+|Dint(1)|+|Dint(2)|+|Dint(3)|+|Dbdry|+|Esq|+|Enc|W.\frac{|R_{\mathrm{adv}}|}{W}\leq\frac{|D^{(0)}_{\mathrm{int}}|+|D^{(1)}_{% \mathrm{int}}|+|D^{(2)}_{\mathrm{int}}|+|D^{(3)}_{\mathrm{int}}|+|D_{\mathrm{% bdry}}|+|E_{\mathrm{sq}}|+|E_{\mathrm{nc}}|}{W}.

The terms are Oσ⁢(L−1)O_{\sigma}(L^{-1}) by (8.41); Oσ⁢(L−1)O_{\sigma}(L^{-1}) by (8.47) with Aloc=3692A_{\mathrm{loc}}=3692, |wC|/Mc≤36|w_{C}|/M_{c}\leq 36 and ∑B|wB|≤L3689\sum_{B}|w_{B}|\leq L^{3689}; Oσ⁢(L−327/2)O_{\sigma}(L^{-327/2}) by (8.52); and Oσ⁢(N−ℓ1⁢σ2⁢L4)O_{\sigma}(N^{-\ell_{1}\sigma^{2}}L^{4}), Oσ⁢(N−α⁢L4)O_{\sigma}(N^{-\alpha}L^{4}). Hence Vsw=oσ⁢(1)V_{\mathrm{sw}}=o_{\sigma}(1). After fixing σ∗\sigma_{*}, choose the eventual threshold so that

(8.74) Vsw≤1200000.V_{\mathrm{sw}}\leq\frac{1}{200000}.

That threshold may be ineffective. It also covers

(8.75) Ndom=2⁢⌈12⁢exp⁡(max⁡{104,2⁢log⁡2/(ℓ1⁢σ∗2)})⌉,Nz,0=2⁢⌈12⁢exp⁡(2⁢exp⁡((ℓ1⁢σ∗2)−1/3))⌉,NLEN,app⁢(σ∗).\begin{gathered}N_{\mathrm{dom}}=2\left\lceil\frac{1}{2}\exp\!\left(\max\{10^{% 4},2\log 2/(\ell_{1}\sigma_{*}^{2})\}\right)\right\rceil,\\ N_{z,0}=2\left\lceil\frac{1}{2}\exp\!\left(2\exp((\ell_{1}\sigma_{*}^{2})^{-1/% 3})\right)\right\rceil,\qquad N_{\mathrm{LEN,app}}(\sigma_{*}).\end{gathered}

These structural thresholds alone do not imply (8.74).

Relative to the comparison −Ssw/W≥−2⁢H¯-S_{\mathrm{sw}}/W\geq-2\overline{H}, the constant difference is

(8.76) Δ⁢DL⁢3\displaystyle\Delta D_{L3} =(2−cK⁢2,G⁢04)⁢H¯\displaystyle=\left(2-\frac{c_{K2,G0}}{4}\right)\overline{H}
=0.022638464724298154340603⁢….\displaystyle=0.022638464724298154340603\ldots.

The exact cost of using the common coefficient instead of the optional coefficient is

H¯4⁢(cK⁢2,G⁢0−c)=0.000049489563023753677508253183146688036059673516909.\frac{\overline{H}}{4}(c_{K2,G0}-c)=0.0000494895630237536775082531831466880360% 59673516909.

This is scalar arithmetic. Its use in the final count requires (8.72) and the common error bounds. The capped-row application is (8.40)–(8.41). The row-three estimate is (8.47), proved in the row-three subsection. All errors use the common source (8.3). The inputs are Paper I, Theorem 2.8; Fact 3.3; Lemma 6.5(ii) for (3.48); and the prime estimates of Fact 3.1. Hence (8.72) holds at the threshold of (8.74). The constant (8.76) is a gross coefficient difference. It enters the final count only together with the switched error Csw⁢σ∗+Psw⁢σ∗9+VswC_{\mathrm{sw}}\sigma_{*}+P_{\mathrm{sw}}\sigma_{*}^{9}+V_{\mathrm{sw}} of (8.72). In the final count this error is bounded by the caps (9.14) (Csw⁢σ∗≤10−5C_{\mathrm{sw}}\sigma_{*}\leq 10^{-5}, Psw⁢σ∗9≤10−5P_{\mathrm{sw}}\sigma_{*}^{9}\leq 10^{-5}) and by (8.74), in total at most 1/400001/40000.

9. The final bound

We keep the notation of Sections 1 and 2. All error terms below are nonnegative. The analytic inputs are (A1)–(A5) of Table 1.2.

9.1. Addition of the comparisons

Put δerr=10−4\delta_{\mathrm{err}}=10^{-4}. The constant of (1.14) is

(9.1) DB=\displaystyle D_{B}={} DII+5719106+M5,internal+gRA,lo\displaystyle D_{\mathrm{II}}+\frac{5719}{10^{6}}+M_{5,\mathrm{internal}}+g_{% \mathrm{RA,lo}}
−δerr+(2−cK⁢2,G⁢04)⁢H¯,H¯=3892535000000.\displaystyle-\delta_{\mathrm{err}}+\left(2-\frac{c_{K2,G0}}{4}\right)% \overline{H},\qquad\overline{H}=\frac{389253}{5000000}.

Here DIID_{\mathrm{II}} is Paper II’s original lower constant [27, (6.3a)]. The six endpoint gains g6g_{6} of (5.18) are not used. The two profile gains enter separately. In particular,

(9.2) DII\displaystyle D_{\mathrm{II}} =4584991633800917059325000000000000000000,\displaystyle=\frac{45849916338009170593}{25000000000000000000},
M5,internal\displaystyle M_{5,\mathrm{internal}} =−Khi⁢6073714261109−LG⁢1,\displaystyle=-K_{\mathrm{hi}}\frac{6073714261}{10^{9}}-L_{G1},
gRA,lo\displaystyle g_{\mathrm{RA,lo}} =9895983531010=0.0989598353.\displaystyle=\frac{989598353}{10^{10}}=0.0989598353.

The last line is the conservative rational floor for the integral gain 𝔤RA\mathfrak{g}_{\mathrm{RA}}. It is not a central estimate. Section 6 separates it from the integral gain. The certified integral enclosure is [0.0989598353353,0.0989598353355][0.0989598353353,0.0989598353355]. We take KhiK_{\mathrm{hi}} and LG⁢1L_{G1} as defined in [27, (A.10d), (4.84)]. Their exact values are

(9.3) Khi\displaystyle K_{\mathrm{hi}} =39894807910705784663904430098309337537484429474781101122231058,\displaystyle=\frac{3989480791070578466390443009830933753748442947478110112223% }{10^{58}},
LG⁢1\displaystyle L_{G1} =−243950428265194656254206921939947762868871361874409552095097100433627766186892221372630771322662657637687111424552206336.\displaystyle=-\frac{243950428265194656254206921939947762868871361874409552095% 097}{100433627766186892221372630771322662657637687111424552206336}.

Thus M5,internal=Mn/MdM_{5,\mathrm{internal}}=M_{n}/M_{d} exactly, where

(9.4) Mn=∑i=05mi⁢1020⁢i,Md=∑i=05di⁢1020⁢i.M_{n}=\sum_{i=0}^{5}m_{i}10^{20i},\qquad M_{d}=\sum_{i=0}^{5}d_{i}10^{20i}.

The coefficients are printed in Table 9.1.

Table 9.1. Exact shifted-profile gain
ii mim_{i} did_{i}
0 66922148532305907989 0
1 34893223604885136721 0
2 3973350097562772509 0
3 87266878234046404033 48635364229120000000
4 28374567121249055735 73384187692692674921
5 3998 680564

The exact rational cO1c_{\mathrm{O1}} is defined in (8.60) and Table 8.1. It records only the coefficient from the historical, non-certified sharper comparison. The main count uses cK⁢2,G⁢0c_{K2,G0} in both comparisons. The common functional comparison is (8.59). For comparison with the optional sharper coefficient, exact rational arithmetic gives

(9.5) 0<c−cO1<4.081⋅10−46,0<c−cO14⁢H¯<7.943⋅10−48.0<c-c_{\mathrm{O1}}<4.081\cdot 10^{-46},\qquad 0<\frac{c-c_{\mathrm{O1}}}{4}% \overline{H}<7.943\cdot 10^{-48}.

This is a rational comparison only. It gives no bound for 2⁢e−γ⁢U02e^{-\gamma}U_{0}. The further cost of the common coefficient relative to cc is exactly

cK⁢2,G⁢0−c4⁢H¯=0.000049489563023753677508253183146688036059673516909.\frac{c_{K2,G0}-c}{4}\overline{H}=0.000049489563023753677508253183146688036059% 673516909.

The resulting main switched gain is exactly

Δ⁢DL⁢3=0.02263846472429815434060381043792394540367262995113415.\Delta D_{L3}=0.02263846472429815434060381043792394540367262995113415.

The optional sharper comparisons are not required for (9.1). Each gain is proved on the original arithmetic source of its comparison. The gains 5719/1065719/10^{6} and M5,internalM_{5,\mathrm{internal}} come from Proposition 5.10, through Propositions B.1 and B.2. The gain gRA,log_{\mathrm{RA,lo}} comes from Proposition 6.13, and Δ⁢DL⁢3\Delta D_{L3} from (8.72). Table 9.4 lists the bindings.

Table 9.2 itemizes the constant. Its decimal column gives approximations only. The defining formulas determine the exact sum.

Table 9.2. The six terms in DBD_{B}
Term Value
DIID_{\mathrm{II}} 1.833996653520366823721.83399665352036682372
5719/1065719/10^{6} 0.0057190.005719
M5,internalM_{5,\mathrm{internal}} 0.005874949945026357⁢…0.005874949945026357\ldots
gRA,log_{\mathrm{RA,lo}} 0.09895983530.0989598353
−δerr-\delta_{\mathrm{err}} −0.0001-0.0001
Δ⁢DL⁢3=(2−cK⁢2,G⁢0/4)⁢H¯\Delta D_{L3}=(2-c_{K2,G0}/4)\overline{H} 0.022638464724298154⁢…0.022638464724298154\ldots
DBD_{B} 1.967088903489691335⁢…1.967088903489691335\ldots

Adding (1.10) and (1.13) cancels the sixth endpoint:

(9.6) J¯6−J¯6=0,2⁢H¯−cK⁢2,G⁢04⁢H¯=(2−cK⁢2,G⁢04)⁢H¯.\overline{J}_{6}-\overline{J}_{6}=0,\qquad 2\overline{H}-\frac{c_{K2,G0}}{4}% \overline{H}=\left(2-\frac{c_{K2,G0}}{4}\right)\overline{H}.

Thus their conditional consequence is

(9.7) 4⁢Gb⁢(N)W⁢(N)≥DB+δerr−cK⁢2,G⁢0⁢I⁢(b)−ℰB⁢(N;b,σ).\frac{4G_{b}(N)}{W(N)}\geq D_{B}+\delta_{\mathrm{err}}-c_{K2,G0}I(b)-\mathcal{% E}_{B}(N;b,\sigma).

This uses the complete S2S_{2} of Paper II. The finite identities keep their original signs and multiplicities. The fixed errors in Paper II are subtracted once [27, (6.4)–(6.6)], and not again in (9.1).

9.2. Ten error allocations

Use the exterior error from (9.8). For the table below, a conservative majorant is convenient:

(9.8) EK⁢(N;b,σ)\displaystyle E_{K}(N;b,\sigma) =AK⁢(b)⁢CAA⁢σ+38840000000009999⁢σ9+rK⁢(N;b,σ)\displaystyle=A_{K}(b)C_{\mathrm{AA}}\sigma+\frac{3884000000000}{9999}\sigma^{% 9}+r_{K}(N;b,\sigma)
≤4⁢AK⁢(b)⁢CAA⁢σ+38840000000009999⁢σ9+rK⁢(N;b,σ),\displaystyle\leq 4A_{K}(b)C_{\mathrm{AA}}\sigma+\frac{3884000000000}{9999}% \sigma^{9}+r_{K}(N;b,\sigma),
AK⁢(b)\displaystyle A_{K}(b) =2⁢e−γ⁢I⁢(b)⁢WAA,K,PK=38840000000009999,\displaystyle=2e^{-\gamma}I(b)W_{\mathrm{AA},K},\qquad P_{K}=\frac{38840000000% 00}{9999},
rK⁢(N;b,σ)\displaystyle r_{K}(N;b,\sigma) =ob,σ⁢(1).\displaystyle=o_{b,\sigma}(1).

Here WAA,KW_{\mathrm{AA},K} is the exterior remainder-weight bound. It belongs to the source in Section 7. The extra factor four only enlarges this nonnegative error. It leaves the principal constant unchanged. Similarly, the switched comparison requires

(9.9) Esw⁢(N;σ)\displaystyle E_{\mathrm{sw}}(N;\sigma) ≤6500000001111⁢CE⁢σ+4854488806315827775⁢σ9+Vsw⁢(N;σ),\displaystyle\leq\frac{650000000}{1111}C_{E}\sigma+\frac{48544888063158}{27775% }\sigma^{9}+V_{\mathrm{sw}}(N;\sigma),
Vsw⁢(N;σ)\displaystyle V_{\mathrm{sw}}(N;\sigma) =oσ⁢(1).\displaystyle=o_{\sigma}(1).

Here VswV_{\mathrm{sw}} is the positive part in (8.71). The conditional limit is (8.73). These two limits concern the actual sums stated there. Both majorants are the error terms of (7.67) under (A3) and of (8.72) under (A4), with CswC_{\mathrm{sw}} from (8.61). By (A5), CAAC_{\mathrm{AA}} and CEC_{E} do not depend on σ\sigma. The exterior weight WAA,KW_{\mathrm{AA},K} is WAAW_{\mathrm{AA}} of (7.38):

(9.10) AK⁢(b)=2⁢e−γ⁢I⁢(b)⁢WAA,K,WAA,K=500⁢(1+Hlog+Hlog22+Hlog36),Hlog=log⁡μ∗u=log⁡312532>0.\begin{gathered}A_{K}(b)=2e^{-\gamma}I(b)W_{\mathrm{AA},K},\qquad W_{\mathrm{% AA},K}=500\Bigl{(}1+H_{\log}+\frac{H_{\log}^{2}}{2}+\frac{H_{\log}^{3}}{6}% \Bigr{)},\\ H_{\log}=\log\frac{\mu_{*}}{u}=\log\frac{3125}{32}>0.\end{gathered}

Since I⁢(b)>0I(b)>0, this gives 0<AK⁢(b)<∞0<A_{K}(b)<\infty. In particular AK⁢(b)⁢CAA⁢σ≤4⁢AK⁢(b)⁢CAA⁢σA_{K}(b)C_{\mathrm{AA}}\sigma\leq 4A_{K}(b)C_{\mathrm{AA}}\sigma.

The retained and Root–A comparisons require

(9.11) E′⁢(N;σ)=oσ⁢(1),ERA⁢(N;σ)=oσ⁢(1).E^{\prime}(N;\sigma)=o_{\sigma}(1),\qquad E_{\mathrm{RA}}(N;\sigma)=o_{\sigma}% (1).

For Root–A, use ERA⁢(N;σ)E_{\mathrm{RA}}(N;\sigma) from (6.72). The first includes every conversion and the saved-array contribution ∑j∈ℋ|Λj,N0|\sum_{j\in\mathcal{H}}|\Lambda^{0}_{j,N}| in (1.12); that contribution is not charged again. The pointwise error may use the coarser bound

(9.12) Eexc⁢(N)=4⁢Ept⁢(N)W⁢(N)≤2197⁢N1−αW⁢(N)=o⁢(1).E_{\mathrm{exc}}(N)=\frac{4E_{\mathrm{pt}}(N)}{W(N)}\leq\frac{2197N^{1-\alpha}% }{W(N)}=o(1).

Here EptE_{\mathrm{pt}} is defined in (4.12). The explicit pointwise argument in Section 4 gives Ept=0E_{\mathrm{pt}}=0 for N≥NptN\geq N_{\mathrm{pt}}. The coarser majorant retains the same error bound. The inequality follows from (4.13), using both the pointwise bound and the exceptional-set cardinality. Since C⁢(N)≥C2>0C(N)\geq C_{2}>0 and α>0\alpha>0, the coarser majorant tends to zero: N−α⁢(log⁡N)2→0N^{-\alpha}(\log N)^{2}\to 0. No sharper exceptional coefficient is needed. Proposition 5.10 gives E′⁢(N;σ)→0E^{\prime}(N;\sigma)\to 0, and Proposition 6.13 gives ERA⁢(N;σ)→0E_{\mathrm{RA}}(N;\sigma)\to 0 under (A2), each at fixed σ\sigma. Lemma 4.1 gives Eexc⁢(N)=0E_{\mathrm{exc}}(N)=0 for N≥NptN\geq N_{\mathrm{pt}}.

Fix bb, all absolute constants, and the source geometry first. Choose positive absolute constants CEL3C_{E}^{\mathrm{L3}} and CEIIC_{E}^{\mathrm{II}} for the Section 8 and Paper II sieve bounds. Define

(9.13) CE:=max⁡{CEL3,CEII}.C_{E}:=\max\{C_{E}^{\mathrm{L3}},C_{E}^{\mathrm{II}}\}.

By (A5), these constants are independent of σ\sigma and NN. Here CAA=4⁢CAA37C_{\mathrm{AA}}=4C_{\mathrm{AA37}} by (7.39). The constant CEC_{E} dominates the absolute constant of (3.22) used in (8.25). The underlying sieve bounds come from Paper I, Theorem 2.6, (2.31) [26, Theorem 2.6, (2.31)]. Choose one rational σ∗>0\sigma_{*}>0 satisfying

(9.14) 0<σ∗\displaystyle 0<\sigma_{*} ≤10−10,\displaystyle\leq 10^{-10},
σ∗\displaystyle\sigma_{*} ≤713332625⋅1021⁢CE,\displaystyle\leq\frac{713332}{625\cdot 10^{21}C_{E}},
σ∗\displaystyle\sigma_{*} ≤1400000⁢AK⁢(b)⁢CAA,\displaystyle\leq\frac{1}{400000A_{K}(b)C_{\mathrm{AA}}},
σ∗\displaystyle\sigma_{*} ≤(9999388400000000000000)1/9,\displaystyle\leq\left(\frac{9999}{388400000000000000}\right)^{1/9},
σ∗\displaystyle\sigma_{*} ≤111165000000000000⁢CE,\displaystyle\leq\frac{1111}{65000000000000C_{E}},
σ∗\displaystyle\sigma_{*} ≤(277754854488806315800000)1/9,\displaystyle\leq\left(\frac{27775}{4854488806315800000}\right)^{1/9},
τ∗\displaystyle\tau_{*} =(σ∗)9.\displaystyle=(\sigma_{*})^{9}.

By (9.10) and (A5), every right side in (9.14) is positive and independent of σ\sigma. Hence such a rational σ∗\sigma_{*} exists. The second restriction preserves Paper II’s fixed error bound. It is exactly

(9.15) σ∗≤4⁢gAACE⁢W∗,gAA=1783336250000000,W∗=1014[27, (1.26), (1.27), (6.6)].\sigma_{*}\leq\frac{4g_{\mathrm{AA}}}{C_{E}W_{*}},\qquad g_{\mathrm{AA}}=\frac% {178333}{6250000000},\qquad W_{*}=10^{14}\quad\text{\cite[cite]{[\@@bibref{}{% PaperII}{}{}, (1.26), (1.27), (6.6)]}}.

The other four restrictions control new fixed errors. Freeze every finite partition and logarithmic precision next. Only then choose the common threshold.

The ten allocations are printed in Table 9.3. The two zero rows are unused capacity.

Table 9.3. The error bound δerr=10−4\delta_{\mathrm{err}}=10^{-4}
Error term Allocation
1 4⁢AK⁢(b)⁢CAA⁢σ∗4A_{K}(b)C_{\mathrm{AA}}\sigma_{*} δerr/10\delta_{\mathrm{err}}/10
2 38840000000009999⁢τ∗\tfrac{3884000000000}{9999}\tau_{*} δerr/10\delta_{\mathrm{err}}/10
3 6500000001111⁢CE⁢σ∗\tfrac{650000000}{1111}C_{E}\sigma_{*} δerr/10\delta_{\mathrm{err}}/10
4 4854488806315827775⁢τ∗\tfrac{48544888063158}{27775}\tau_{*} δerr/10\delta_{\mathrm{err}}/10
5 E′⁢(N;σ∗)+Vsw⁢(N;σ∗)E^{\prime}(N;\sigma_{*})+V_{\mathrm{sw}}(N;\sigma_{*}) δerr20+δerr20\tfrac{\delta_{\mathrm{err}}}{20}+\tfrac{\delta_{\mathrm{err}}}{20}
6 0 δerr/10\delta_{\mathrm{err}}/10
7 ERA⁢(N;σ∗)E_{\mathrm{RA}}(N;\sigma_{*}) δerr/10\delta_{\mathrm{err}}/10
8 rK⁢(N;b,σ∗)r_{K}(N;b,\sigma_{*}) δerr/10\delta_{\mathrm{err}}/10
9 Eexc⁢(N)E_{\mathrm{exc}}(N) δerr/10\delta_{\mathrm{err}}/10
10 0 δerr/10\delta_{\mathrm{err}}/10

Its capacities sum exactly:

(9.16) 4⁢δerr10+(δerr20+δerr20)+5⁢δerr10=δerr.4\frac{\delta_{\mathrm{err}}}{10}+\left(\frac{\delta_{\mathrm{err}}}{20}+\frac% {\delta_{\mathrm{err}}}{20}\right)+5\frac{\delta_{\mathrm{err}}}{10}=\delta_{% \mathrm{err}}.

The first four bounds follow from (9.14). The five remaining nonzero bounds follow from the stated limits. Each limit is taken at fixed σ∗\sigma_{*}.

Proposition 9.1 (Error budget).

Assume (A1)–(A5), and let σ∗\sigma_{*} be rational with (9.14). Then every even N≥N0∗⁢(σ∗)N\geq N_{0}^{*}(\sigma_{*}) satisfies

(9.17) ℰB⁢(N;b,σ∗)≤810⁢δerr<δerr.\mathcal{E}_{B}(N;b,\sigma_{*})\leq\frac{8}{10}\delta_{\mathrm{err}}<\delta_{% \mathrm{err}}.
Proof.

Rows 1 and 3. The third and fifth lines of (9.14) give

4⁢AK⁢(b)⁢CAA⁢σ∗≤4400000=δerr10,6500000001111⁢CE⁢σ∗≤65000000065000000000000=δerr10.4A_{K}(b)C_{\mathrm{AA}}\sigma_{*}\leq\frac{4}{400000}=\frac{\delta_{\mathrm{% err}}}{10},\qquad\frac{650000000}{1111}C_{E}\sigma_{*}\leq\frac{650000000}{650% 00000000000}=\frac{\delta_{\mathrm{err}}}{10}.

Rows 2 and 4. The first line gives τ∗≤10−90\tau_{*}\leq 10^{-90}. This is below 9999/3884000000000000009999/388400000000000000 and 27775/485448880631580000027775/4854488806315800000, so the fourth and sixth lines hold, and

38840000000009999⁢τ∗≤δerr10,4854488806315827775⁢τ∗≤δerr10.\frac{3884000000000}{9999}\tau_{*}\leq\frac{\delta_{\mathrm{err}}}{10},\qquad% \frac{48544888063158}{27775}\tau_{*}\leq\frac{\delta_{\mathrm{err}}}{10}.

Rows 5, 7 and 8. At the fixed σ∗\sigma_{*}, E′→0E^{\prime}\to 0 by (A1), Vsw→0V_{\mathrm{sw}}\to 0 by (8.73) under (A4), ERA→0E_{\mathrm{RA}}\to 0 by (A2), and rK→0r_{K}\to 0 by (A3). By (2.6), the thresholds TE′,TV,TERA,Tr,TEexcT_{E^{\prime}},T_{V},T_{E_{\mathrm{RA}}},T_{r},T_{E_{\mathrm{exc}}} of (2.5) exist, and above them E′≤δerr/20E^{\prime}\leq\delta_{\mathrm{err}}/20, Vsw≤δerr/20V_{\mathrm{sw}}\leq\delta_{\mathrm{err}}/20, ERA≤δerr/10E_{\mathrm{RA}}\leq\delta_{\mathrm{err}}/10 and rK≤δerr/10r_{K}\leq\delta_{\mathrm{err}}/10. Row 9. Lemma 4.1 gives Eexc⁢(N)=0E_{\mathrm{exc}}(N)=0 for N≥NptN\geq N_{\mathrm{pt}}, so TEexc≤NptT_{E_{\mathrm{exc}}}\leq N_{\mathrm{pt}}. Rows 6 and 10 are zero. Every threshold used is bounded by the common maximum in (2.5). Also Npt<NtrN_{\mathrm{pt}}<N_{\mathrm{tr}} by Lemma 9.2. Hence all of them hold for N≥N0∗⁢(σ∗)N\geq N_{0}^{*}(\sigma_{*}). By (1.11), (9.8) and (9.9),

ℰB≤\displaystyle\mathcal{E}_{B}\leq{} (E′+Vsw)+ERA+(6500000001111⁢CE⁢σ∗+4854488806315827775⁢τ∗)\displaystyle\bigl{(}E^{\prime}+V_{\mathrm{sw}}\bigr{)}+E_{\mathrm{RA}}+\Bigl{% (}\frac{650000000}{1111}C_{E}\sigma_{*}+\frac{48544888063158}{27775}\tau_{*}% \Bigr{)}
+(4⁢AK⁢CAA⁢σ∗+38840000000009999⁢τ∗+rK)+Eexc.\displaystyle+\Bigl{(}4A_{K}C_{\mathrm{AA}}\sigma_{*}+\frac{3884000000000}{999% 9}\tau_{*}+r_{K}\Bigr{)}+E_{\mathrm{exc}}.

The bounds above give at most δerr10+δerr10+2⁢δerr10+3⁢δerr10+0\frac{\delta_{\mathrm{err}}}{10}+\frac{\delta_{\mathrm{err}}}{10}+\frac{2% \delta_{\mathrm{err}}}{10}+\frac{3\delta_{\mathrm{err}}}{10}+0, which is below the nonzero allocations 8⁢δerr10\frac{8\delta_{\mathrm{err}}}{10} of Table 9.3. ∎

Take the named source, application and error thresholds listed in Section 2. The Section 7 definitions of TKT_{K} and TrT_{r} already include the main-mass threshold Nmass⁢(b,σ∗)N_{\mathrm{mass}}(b,\sigma_{*}) and the AA threshold NAA⁢(b,σ∗)N_{\mathrm{AA}}(b,\sigma_{*}). Thus the common maximum in 𝒯∗\mathcal{T}_{*} below includes both requirements at the fixed b,σ∗b,\sigma_{*}. The common threshold is the single definition

(9.18) N0∗⁢(σ∗)as defined in (2.5).N_{0}^{*}(\sigma_{*})\quad\text{as defined in \eqref{eq:not-common-threshold}}.

Its existence depends on all those estimates. The floor alone supplies none of them. By its definition and Lemma 9.2, N0∗⁢(σ∗)≥max⁡{Ntr,N6}>NptN_{0}^{*}(\sigma_{*})\geq\max\{N_{\mathrm{tr}},N_{6}\}>N_{\mathrm{pt}}. The Section 2 threshold definitions include NptN_{\mathrm{pt}} through TsrcT_{\mathrm{src}} and N6N_{6} through TRAT_{\mathrm{RA}}. The bound NtrN_{\mathrm{tr}} enters directly in the common maximum. Lemma 4.1 holds for N≥NptN\geq N_{\mathrm{pt}} and Lemma 4.2 for N≥N6N\geq N_{6}. Thus the order is

(9.19) constants⟶σ∗⟶finite choices⟶N0∗⁢(σ∗)⟶N.\text{constants}\ \longrightarrow\ \sigma_{*}\ \longrightarrow\ \text{finite % choices}\ \longrightarrow\ N_{0}^{*}(\sigma_{*})\ \longrightarrow\ N.

No parameter σ∗⁢(N)\sigma_{*}(N) is used.

Proposition 9.1 gives

(9.20) ℰB⁢(N;b,σ∗)≤δerr(N≥N0∗⁢(σ∗),N∈2⁢ℤ).\mathcal{E}_{B}(N;b,\sigma_{*})\leq\delta_{\mathrm{err}}\qquad(N\geq N_{0}^{*}% (\sigma_{*}),\ N\in 2\mathbb{Z}).

Combining (9.7) and (9.20) gives

(9.21) 4⁢Gb⁢(N)W⁢(N)≥DB−cK⁢2,G⁢0I(b).\boxed{\displaystyle\frac{4G_{b}(N)}{W(N)}\geq D_{B}-c_{K2,G0}I(b).}

It holds for every even N≥N0∗⁢(σ∗)N\geq N_{0}^{*}(\sigma_{*}) under (A1)–(A5).

9.3. The numerical margin

All constants in (9.1) have exact definitions. The exterior price uses the G0 coefficient in (7.36). The same coefficient prices L3. No G∗,U0G_{*},U_{0} sharper domination is used in this arithmetic or in the main-count hypotheses. The constants have the following outward enclosures:

(9.22) 1.967088903489691335582703173494<DB,DB<1.967088903489691335582703173495,1.966859949178424046530804965343<cK⁢2,G⁢0⁢I⁢(b),cK⁢2,G⁢0⁢I⁢(b)<1.966859949178424046530804965344,0.000228954311267289051898208151<DB−cK⁢2,G⁢0⁢I⁢(b),DB−cK⁢2,G⁢0⁢I⁢(b)<0.000228954311267289051898208152.\begin{gathered}1.967088903489691335582703173494<D_{B},\\ D_{B}<1.967088903489691335582703173495,\\[2.0pt] 1.966859949178424046530804965343<c_{K2,G0}I(b),\\ c_{K2,G0}I(b)<1.966859949178424046530804965344,\\[2.0pt] 0.000228954311267289051898208151<D_{B}-c_{K2,G0}I(b),\\ D_{B}-c_{K2,G0}I(b)<0.000228954311267289051898208152.\end{gathered}

Here

(9.23) cK⁢2,G⁢0=68368251638755177562868463216507543729310946891045,I⁢(b)=log⁡40000072999993.c_{K2,G0}=\frac{6836825163875517756286846321650754372931094689}{10^{45}},% \qquad I(b)=\log\frac{4000007}{2999993}.

The coefficient is defined in (7.36). The final comparison is (7.67). Hence

(9.24) DB−cK⁢2,G⁢0⁢I⁢(b)>0.0002289>15000>0.D_{B}-c_{K2,G0}I(b)>0.0002289>\frac{1}{5000}>0.

The table below identifies each exact constant by its defining display and lists the comparisons that use it unchanged.

Table 9.4. Constants and the comparisons that use them
Constant Definition Comparison
DIID_{\mathrm{II}} (1.8), [27, (6.3a)] Proposition 5.10, by (5.13)
5719/1065719/10^{6} (5.25) Proposition 5.10, by Proposition B.1
M5,internalM_{5,\mathrm{internal}}, KhiK_{\mathrm{hi}}, LG⁢1L_{G1} (9.3), Table 9.1 Proposition 5.10, by Proposition B.2
gRA,log_{\mathrm{RA,lo}} (6.70) Proposition 6.13, (6.72)
H¯\overline{H}, cK⁢2,G⁢0c_{K2,G0} (9.1), (7.36) (8.72), with (8.61)
cK⁢2,G⁢0c_{K2,G0}, I⁢(b)I(b) (9.23) Proposition 7.5, (7.67)
AK⁢(b)A_{K}(b), CAAC_{\mathrm{AA}}, PKP_{K} (9.10), (7.39), (7.67) Table 9.3, rows 1 and 2
CswC_{\mathrm{sw}}, PswP_{\mathrm{sw}} (8.61) Table 9.3, rows 3 and 4
δerr\delta_{\mathrm{err}} (9.1) Proposition 9.1

No other constant enters DBD_{B} or the error budget.

The logarithm enclosure uses rational arithmetic. Put tlog=500007/3500000t_{\log}=500007/3500000 and

(9.25) Sm=2⁢∑k=0mtlog2⁢k+12⁢k+1,Sm<I⁢(b)<Sm+2⁢tlog2⁢m+3(2⁢m+3)⁢(1−tlog2).S_{m}=2\sum_{k=0}^{m}\frac{t_{\log}^{2k+1}}{2k+1},\qquad S_{m}<I(b)<S_{m}+% \frac{2t_{\log}^{2m+3}}{(2m+3)(1-t_{\log}^{2})}.

Here I⁢(b)=2⁢arctanh⁡tlogI(b)=2\operatorname{arctanh}t_{\log} and 0<tlog<10<t_{\log}<1. Bounding each remaining denominator by 2⁢m+32m+3 proves the upper bound. Taking m=24m=24 gives (9.22). Thus no rounded logarithm enters the margin test.

For reference, put ζ=10−6\zeta=10^{-6} and 𝔈∗=exp⁡(DB/cK⁢2,G⁢0)\mathfrak{E}_{*}=\exp(D_{B}/c_{K2,G0}). The buffered critical exponent is

(9.26) abuf∗=𝔈∗+1(1−ζ)⁢𝔈∗−ζ.a_{\mathrm{buf}}^{*}=\frac{\mathfrak{E}_{*}+1}{(1-\zeta)\mathfrak{E}_{*}-\zeta}.

To derive it, write b∗=1/(1+𝔈∗)+ζb_{*}=1/(1+\mathfrak{E}_{*})+\zeta. The equation a⁢(1−b∗)=1a(1-b_{*})=1 gives (9.26). For the present constants,

(9.27) 1.749974884137892433433207484622<abuf∗<1.749974884137892433433207484623<74.1.749974884137892433433207484622<a_{\mathrm{buf}}^{*}<1.7499748841378924334332% 07484623<\frac{7}{4}.

This enclosure also uses rational bounds. For x=DB/cK⁢2,G⁢0x=D_{B}/c_{K2,G0} and m=36m=36, put

(9.28) Tm=∑k=0mxkk!,Tm<ex<Tm+xm+1(m+1)!⁢11−x/(m+2).T_{m}=\sum_{k=0}^{m}\frac{x^{k}}{k!},\qquad T_{m}<e^{x}<T_{m}+\frac{x^{m+1}}{(% m+1)!}\frac{1}{1-x/(m+2)}.

Here 0<x<10<x<1. The tail ratio is at most x/(m+2)x/(m+2). The function in (9.26) decreases with 𝔈∗\mathfrak{E}_{*}. Substitution of the two rational bounds proves (9.27).

The endpoint in (9.27) is equivalent to the positive scalar margin at this fixed bb. It supplies no theorem at a smaller aa without new comparisons at the corresponding cutoff. If the optional Lemma 5.3 is used, DBD_{B} increases by g6=0.0020549454896034927680⁢…g_{6}=0.0020549454896034927680\ldots of (5.18). The margin then becomes 0.0022838998008707818199⁢…0.0022838998008707818199\ldots, and abuf∗a_{\mathrm{buf}}^{*} becomes 1.7497494980881623276859⁢…1.7497494980881623276859\ldots. Theorem 1 does not use this.

For an optional arithmetic comparison, define DB,c=DB+(cK⁢2,G⁢0−c)⁢H¯/4D_{B,c}=D_{B}+(c_{K2,G0}-c)\overline{H}/4. Using cc in both K2 and L3 would require two further inputs. This paragraph concerns the optional scalar comparison at the same fixed cutoff; it supplies no new cutoff-dependent estimate. The first is the separate sharper functional domination G∗≤U0G_{*}\leq U_{0} from equation B.28. The second is a certified 2⁢e−γ⁢U0≤c2e^{-\gamma}U_{0}\leq c. It does not follow from the coarse interval in equation B.27. The main proof uses neither. Its scalar endpoint is

(9.29) Ec=exp⁡(DB,c/c),abuf,c∗=Ec+1(1−ζ)⁢Ec−ζ.E_{c}=\exp(D_{B,c}/c),\qquad a^{*}_{\mathrm{buf},c}=\frac{E_{c}+1}{(1-\zeta)E_% {c}-\zeta}.

The same rational Taylor enclosure gives

(9.30) 1.749889173139093190128834678<abuf,c∗<1.749889173139093190128834679<74.1.749889173139093190128834678<a^{*}_{\mathrm{buf},c}<1.74988917313909319012883% 4679<\frac{7}{4}.

Thus, on the optional sharper branch, abuf,c∗a^{*}_{\mathrm{buf},c} is 1.7498891731390⁢…1.7498891731390\ldots. The main theorem uses the explicitly certified G0 coefficient defined and bounded in (7.36); the display above is only the optional exponent endpoint.

9.4. The transfer

Lemma 9.2 (Transfer).

The parameters (2.3) satisfy

(9.31) κtr=34⁢(1−b)−b=74000000,Ntr=1012000000/7>1012+1=Npt.\kappa_{\mathrm{tr}}=\frac{3}{4}(1-b)-b=\frac{7}{4000000},\qquad N_{\mathrm{tr% }}=10^{12000000/7}>10^{12}+1=N_{\mathrm{pt}}.

For even N≥NtrN\geq N_{\mathrm{tr}}, every n=r⁢q∈𝒜Nn=rq\in\mathcal{A}_{N} with primes r≤qr\leq q and r<Nbr<N^{b} satisfies

(9.32) q>ε⁢N1−b,q3/4>ε3/4⁢Nb+κtr≥Nb>r.q>\varepsilon N^{1-b},\qquad q^{3/4}>\varepsilon^{3/4}N^{b+\kappa_{\mathrm{tr}% }}\geq N^{b}>r.
Proof.

Since a=7/4a=7/4, a⁢(1−b)−1=34⁢(1−b)−ba(1-b)-1=\frac{3}{4}(1-b)-b, and b=2999993/7000000b=2999993/7000000 gives 7/40000007/4000000. Also ε−(a−1)/κtr=104⋅3000000/7\varepsilon^{-(a-1)/\kappa_{\mathrm{tr}}}=10^{4\cdot 3000000/7}, and 12000000/7>1312000000/7>13. For n=r⁢q∈𝒜Nn=rq\in\mathcal{A}_{N} we have n>ε⁢Nn>\varepsilon N, so q=n/r>ε⁢N1−bq=n/r>\varepsilon N^{1-b} and q3/4>ε3/4⁢N3⁢(1−b)/4=ε3/4⁢Nb+κtrq^{3/4}>\varepsilon^{3/4}N^{3(1-b)/4}=\varepsilon^{3/4}N^{b+\kappa_{\mathrm{tr% }}}. Finally Nκtr≥ε−3/4N^{\kappa_{\mathrm{tr}}}\geq\varepsilon^{-3/4} exactly when N≥NtrN\geq N_{\mathrm{tr}}. ∎

Proof of Theorem 1

Use the established inputs (A1)–(A5) and fix a rational σ∗\sigma_{*} satisfying (9.14). Let N≥N0∗⁢(σ∗)N\geq N_{0}^{*}(\sigma_{*}) be even. Then N≥max⁡{Ntr,N6}>NptN\geq\max\{N_{\mathrm{tr}},N_{6}\}>N_{\mathrm{pt}}. Lemma 4.1 gives the first line of (1.10). At σ=σ∗\sigma=\sigma_{*}, the established comparisons (A1), (A2) and (A4) give its other three lines, and (A3) gives (1.13). The zero-gain combination Lemma 4.3 adds these four comparisons to (9.7). Proposition 9.1 gives (9.20), hence (9.21). Equation (9.24) then gives Gb⁢(N)>0G_{b}(N)>0, since W⁢(N)>0W(N)>0 by (2.2). Hence the set in (1.3) is nonempty.

Choose one counted integer n=N−pn=N-p. If nn is prime, take q=nq=n and r=1r=1. Otherwise n=r⁢qn=rq with primes r≤qr\leq q and r<Nbr<N^{b}, and Lemma 9.2 gives r<q3/4r<q^{3/4}. Therefore N=p+r⁢qN=p+rq and r≤q3/4r\leq q^{3/4}. □\square

Appendices

Appendix A proves three auxiliary estimates. Appendix B records finite calculations, numerical certificates, and exact arithmetic. All cross-references to these appendices are internal to this document.

Appendix A Proofs of three estimates of Section 6

This section proves Lemmas 6.5, 6.8 and 6.9. Numbers (6.kk) and 6.kk refer to Section 6. Numbers (A.1) and later refer to this section. The only inputs are Papers I and II and the classical results cited at the point of use. Throughout, τj\tau_{j} is the jj-fold divisor function and τ=τ2\tau=\tau_{2}. Let ω⁢(n)\omega(n) be the number of distinct prime divisors of nn. Let P+⁢(n)P^{+}(n) and P−⁢(n)P^{-}(n) be its largest and least prime factors. The sum ∑bmodk∗\sum^{*}_{b\bmod k} runs over reduced residues.

A.1. Elementary inequalities

For integers j≥1j\geq 1, k≥1k\geq 1 and Y≥1Y\geq 1,

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

The first is multiplicative. At a prime power it is (a+1)j≤(a+2j−12j−1)(a+1)^{j}\leq\binom{a+2^{j}-1}{2^{j}-1}, which follows by induction on jj from

(a+1)⁢(a+k−1k−1)≤(a+2⁢k−12⁢k−1).(a+1)\binom{a+k-1}{k-1}\leq\binom{a+2k-1}{2k-1}.

The right side is the coefficient of pap^{a} in the convolution of two kk-fold divisor functions. Each of its a+1a+1 terms is at least the left factor (a+k−1k−1)\binom{a+k-1}{k-1}, since (j′+i)⁢(a−j′+i)≥i⁢(a+i)(j^{\prime}+i)(a-j^{\prime}+i)\geq i(a+i) for 0≤j′≤a0\leq j^{\prime}\leq a. The two sums in (A.1) follow by writing n=n1⁢⋯⁢nkn=n_{1}\cdots n_{k}, enlarging the constraint to ni≤Yn_{i}\leq Y, and summing one factor last. Also

(A.2) nφ⁢(n)≤τ⁢(n),φ⁢(m⁢n)≥φ⁢(m)⁢φ⁢(n),τ⁢(m⁢n)≤τ⁢(m)⁢τ⁢(n),\frac{n}{\varphi(n)}\leq\tau(n),\qquad\varphi(mn)\geq\varphi(m)\varphi(n),% \qquad\tau(mn)\leq\tau(m)\tau(n),

prime power by prime power, and τ⁢(n)≪ϵnϵ\tau(n)\ll_{\epsilon}n^{\epsilon}.

For a finitely supported sequence ξ\xi, a modulus kk and an integer h≥1h\geq 1, put

(A.3) Δξ⁢(k,b;h)=∑n≡b⁢(k)(n,h)=1ξn−1φ⁢(k)⁢∑(n,k⁢h)=1ξn,Δξ⁢(k,b)=Δξ⁢(k,b;1),\Delta_{\xi}(k,b;h)=\sum_{\begin{subarray}{c}n\equiv b\ (k)\\ (n,h)=1\end{subarray}}\xi_{n}-\frac{1}{\varphi(k)}\sum_{(n,kh)=1}\xi_{n},% \qquad\Delta_{\xi}(k,b)=\Delta_{\xi}(k,b;1),
(A.4) V⁢(k;ξ)=∑bmodk∗|Δξ⁢(k,b)|2.V(k;\xi)=\sum_{b\bmod k}^{*}|\Delta_{\xi}(k,b)|^{2}.

If ξ\xi is supported in an interval of length at most YY, then

(A.5) V⁢(k;ξ)≤∑bmodk|∑n≡b⁢(k)ξn|2≤(Yk+1)⁢‖ξ‖22.V(k;\xi)\leq\sum_{b\bmod k}\Bigl{|}\sum_{n\equiv b\ (k)}\xi_{n}\Bigr{|}^{2}% \leq\Bigl{(}\frac{Y}{k}+1\Bigr{)}\|\xi\|_{2}^{2}.

Here Δξ⁢(k,b)\Delta_{\xi}(k,b) is the deviation of the reduced class sums from their mean. The variance is at most the second moment. Cauchy’s inequality in each class gives the second bound.

The sequence en=𝟏H<n≤2⁢He_{n}=\mathbf{1}_{H<n\leq 2H} satisfies, for all k,h≥1k,h\geq 1 and (b,k)=1(b,k)=1,

(A.6) |Δe⁢(k,b;h)|≤3⁢τ⁢(h).|\Delta_{e}(k,b;h)|\leq 3\tau(h).

By inclusion–exclusion over d∣hd\mid h, (d,k)=1(d,k)=1, the class count equals (H/k)⁢∏p∣h,p∤k(1−1/p)+O⁢(τ⁢(h))(H/k)\prod_{p\mid h,\,p\nmid k}(1-1/p)+O(\tau(h)), with error at most τ⁢(h)\tau(h) in absolute value. The comparator has the same main term and error at most τ⁢(h)⁢τ⁢(k)/φ⁢(k)≤2⁢τ⁢(h)\tau(h)\tau(k)/\varphi(k)\leq 2\tau(h).

Let ℓ=log⁡log⁡N\ell=\log\log N, z=N1/ℓ3z=N^{1/\ell^{3}} and y=N1/ℓy=N^{1/\ell}. Here NN is the large parameter of the lemma at hand. For each fixed C≥0C\geq 0, Rankin’s method gives

(A.7) ∑d>yP+⁢(d)≤zτ⁢(d)Cd≪C(log⁡N)KC⁢e−ℓ2\sum_{\begin{subarray}{c}d>y\\ P^{+}(d)\leq z\end{subarray}}\frac{\tau(d)^{C}}{d}\ll_{C}(\log N)^{K_{C}}e^{-% \ell^{2}}

with a fixed KCK_{C}. With λ=1/log⁡z\lambda=1/\log z, the left side is at most

y−λ⁢∏p≤z(1+∑e≥1(e+1)C⁢p−e⁢(1−λ)),y−λ=e−ℓ2.y^{-\lambda}\prod_{p\leq z}\Bigl{(}1+\sum_{e\geq 1}(e+1)^{C}p^{-e(1-\lambda)}% \Bigr{)},\qquad y^{-\lambda}=e^{-\ell^{2}}.

For p≤zp\leq z one has pλ≤ep^{\lambda}\leq e and 1−λ≥1/21-\lambda\geq 1/2, so the factor at pp is 1+OC⁢(1/p)1+O_{C}(1/p). Mertens’ theorem gives ∑p≤z1/p≤ℓ+O⁢(1)\sum_{p\leq z}1/p\leq\ell+O(1). Hence the product is ≪(log⁡N)KC\ll(\log N)^{K_{C}}. Since e−ℓ2=(log⁡N)−ℓe^{-\ell^{2}}=(\log N)^{-\ell}, the right side of (A.7) is OC,A⁢((log⁡N)−A)O_{C,A}((\log N)^{-A}) for every fixed AA.

A.2. Lemma 6.5

Recall the setting of Section 6. Let ξ\xi be complex, supported in [1,Z][1,Z], Z≥3Z\geq 3, and fix Bdiv≥0B_{\mathrm{div}}\geq 0. The hypothesis (6.35) is that, for every P>0P>0, uniformly in h,k≥1h,k\geq 1 and reduced bmodkb\bmod k,

(6.35) |∑n≡b⁢(k)(n,h)=1ξn−1φ⁢(k)⁢∑(n,k⁢h)=1ξn|≪P‖ξ‖2⁢Z1/2⁢τ⁢(h)Bdiv⁢(log⁡(2⁢Z))−P,\left|\sum_{\begin{subarray}{c}n\equiv b\ (k)\\ (n,h)=1\end{subarray}}\xi_{n}-\frac{1}{\varphi(k)}\sum_{(n,kh)=1}\xi_{n}\right% |\ll_{P}\|\xi\|_{2}Z^{1/2}\tau(h)^{B_{\mathrm{div}}}(\log(2Z))^{-P},

with constants common to the family of pairs (Z,ξ)(Z,\xi). The conclusion (6.36) is

(6.36) ∑k≤Z⁢(log⁡Z)−B1⁢(A)∑bmodk∗|Δξ⁢(k,b)|2≪A‖ξ‖22⁢Z⁢(log⁡Z)−A.\sum_{k\leq Z(\log Z)^{-B_{1}(A)}}\sum_{b\bmod k}^{*}|\Delta_{\xi}(k,b)|^{2}% \ll_{A}\|\xi\|_{2}^{2}Z(\log Z)^{-A}.

In the selected-factor form of Paper I, (3.48), ξn=αn⁢1(n,r)=1\xi_{n}=\alpha_{n}1_{(n,r)=1}, Z=⌈2⁢T⌉Z=\lceil 2T\rceil, and (6.37) reads

(6.37) ∑q≤3⁢Q∑bmodq∗|Δξ⁢(q,b)|2≪Nℐ⁢T⁢L−A3,3⁢Q≤Z⁢(log⁡Z)−BF,BF=A3+15,\sum_{q\leq 3Q}\sum_{b\bmod q}^{*}|\Delta_{\xi}(q,b)|^{2}\ll N_{\mathcal{I}}TL% ^{-A_{3}},\qquad 3Q\leq Z(\log Z)^{-B_{F}},\quad B_{F}=A_{3}+15,

where NℐN_{\mathcal{I}} is the interval mass in Paper I, (3.8).

Lemma 6.5 (Transferred mean-square estimate). 

  1. (i)

    If (6.35) holds, then (6.36) holds for every fixed A>0A>0. Here B1⁢(A)B_{1}(A) and the implied constant depend only on AA, BdivB_{\mathrm{div}} and the common constants.

  2. (ii)

    Assume the hypotheses (3.1), (3.2), (3.6), (3.8) with its length condition, (3.11) and (3.25)–(3.27) of Paper I. Then the estimate (6.37) holds uniformly over the parameter boxes and selected factors of Paper I, Theorem 3.2. Hence that theorem holds with this input in place of [3, Theorem 0(a)] at (3.48).

Proof of (i).

Put E=‖ξ‖22E=\|\xi\|_{2}^{2}, λ=log⁡(2⁢Z)\lambda=\log(2Z) and, for 1≤Q≤Z1\leq Q\leq Z,

S⁢(Q)=∑k≤QV⁢(k;ξ).S(Q)=\sum_{k\leq Q}V(k;\xi).

Since 2⁢Z≤Z22Z\leq Z^{2}, log⁡Z≤λ≤2⁢log⁡Z\log Z\leq\lambda\leq 2\log Z.

Characters. Orthogonality on the reduced classes gives Δξ⁢(k,b)=φ⁢(k)−1⁢∑χ≠χ0χ¯⁢(b)⁢∑nξn⁢χ⁢(n)\Delta_{\xi}(k,b)=\varphi(k)^{-1}\sum_{\chi\neq\chi_{0}}\overline{\chi}(b)\sum% _{n}\xi_{n}\chi(n). The centring removes exactly the principal character. Hence

(A.8) S⁢(Q)=∑k≤Q1φ⁢(k)⁢∑χmodkχ≠χ0|∑nξn⁢χ⁢(n)|2.S(Q)=\sum_{k\leq Q}\frac{1}{\varphi(k)}\sum_{\begin{subarray}{c}\chi\bmod k\\ \chi\neq\chi_{0}\end{subarray}}\Bigl{|}\sum_{n}\xi_{n}\chi(n)\Bigr{|}^{2}.

Each χ≠χ0\chi\neq\chi_{0} modulo kk is induced by a unique primitive ψmodf\psi\bmod f with f∣kf\mid k, f>1f>1. Write k=f⁢ek=fe. Then χ⁢(n)=ψ⁢(n)⁢𝟏(n,e)=1\chi(n)=\psi(n)\mathbf{1}_{(n,e)=1}, since ψ\psi already vanishes on primes of ff. The pair (e,ψ)(e,\psi) determines (k,χ)(k,\chi), and φ⁢(f⁢e)≥φ⁢(f)⁢φ⁢(e)\varphi(fe)\geq\varphi(f)\varphi(e) by (A.2). Therefore

(A.9) S⁢(Q)≤∑e≤Q1φ⁢(e)⁢∑1<f≤Q/e1φ⁢(f)⁢∑ψmodfprim|Ce⁢(ψ)|2,Ce⁢(ψ)=∑(n,e)=1ξn⁢ψ⁢(n).S(Q)\leq\sum_{e\leq Q}\frac{1}{\varphi(e)}\sum_{1<f\leq Q/e}\frac{1}{\varphi(f% )}\sum_{\psi\bmod f}^{\rm prim}|C_{e}(\psi)|^{2},\qquad C_{e}(\psi)=\sum_{(n,e% )=1}\xi_{n}\psi(n).

Small conductors. Let F≥1F\geq 1 and 1<f≤F1<f\leq F. Since ∑b∗ψ⁢(b)=0\sum_{b}^{*}\psi(b)=0,

Ce⁢(ψ)=∑bmodf∗ψ⁢(b)⁢{∑n≡b⁢(f)(n,e)=1ξn−1φ⁢(f)⁢∑(n,e⁢f)=1ξn}.C_{e}(\psi)=\sum_{b\bmod f}^{*}\psi(b)\Bigl{\{}\sum_{\begin{subarray}{c}n% \equiv b\ (f)\\ (n,e)=1\end{subarray}}\xi_{n}-\frac{1}{\varphi(f)}\sum_{(n,ef)=1}\xi_{n}\Bigr{% \}}.

The bracket is the left side of (6.35) with k=fk=f and h=eh=e. For a fixed a>0a>0 it is at most Ca⁢E1/2⁢Z1/2⁢τ⁢(e)Bdiv⁢λ−aC_{a}E^{1/2}Z^{1/2}\tau(e)^{B_{\rm div}}\lambda^{-a}. There are at most φ⁢(f)\varphi(f) primitive characters modulo ff, so

(A.10) ∑1<f≤F1φ⁢(f)⁢∑ψprim|Ce⁢(ψ)|2≤Ca2⁢E⁢Z⁢τ⁢(e)2⁢Bdiv⁢λ−2⁢a⁢∑f≤Fφ⁢(f)2≤Ca2⁢E⁢Z⁢τ⁢(e)2⁢Bdiv⁢F3⁢λ−2⁢a.\sum_{1<f\leq F}\frac{1}{\varphi(f)}\sum_{\psi}^{\rm prim}|C_{e}(\psi)|^{2}% \leq C_{a}^{2}EZ\tau(e)^{2B_{\rm div}}\lambda^{-2a}\sum_{f\leq F}\varphi(f)^{2% }\leq C_{a}^{2}EZ\tau(e)^{2B_{\rm div}}F^{3}\lambda^{-2a}.

Large conductors. The multiplicative large sieve, Paper I, (2.19), applied to cn=ξn⁢𝟏(n,e)=1c_{n}=\xi_{n}\mathbf{1}_{(n,e)=1} with support in [1,Z][1,Z] and ‖c‖22≤E\|c\|_{2}^{2}\leq E, gives

∑f≤2⁢V∑ψprim|Ce⁢(ψ)|2≪(V2+Z)⁢E.\sum_{f\leq 2V}\sum_{\psi}^{\rm prim}|C_{e}(\psi)|^{2}\ll(V^{2}+Z)E.

If p1<⋯<psp_{1}<\cdots<p_{s} are the primes of ff, then pi≥i+1p_{i}\geq i+1 and f/φ⁢(f)≤∏i(i+1)/i=s+1≤1+log⁡f/log⁡2f/\varphi(f)\leq\prod_{i}(i+1)/i=s+1\leq 1+\log f/\log 2. Thus 1/φ⁢(f)≤3⁢λ/V1/\varphi(f)\leq 3\lambda/V for V<f≤2⁢VV<f\leq 2V, and

∑V<f≤2⁢V1φ⁢(f)⁢∑ψprim|Ce⁢(ψ)|2≪λ⁢E⁢(V+ZV).\sum_{V<f\leq 2V}\frac{1}{\varphi(f)}\sum_{\psi}^{\rm prim}|C_{e}(\psi)|^{2}% \ll\lambda E\Bigl{(}V+\frac{Z}{V}\Bigr{)}.

Summing over V=2j⁢F<QV=2^{j}F<Q gives, uniformly in ee,

(A.11) ∑F<f≤Q/e1φ⁢(f)⁢∑ψprim|Ce⁢(ψ)|2≪λ⁢E⁢(Q+ZF).\sum_{F<f\leq Q/e}\frac{1}{\varphi(f)}\sum_{\psi}^{\rm prim}|C_{e}(\psi)|^{2}% \ll\lambda E\Bigl{(}Q+\frac{Z}{F}\Bigr{)}.

If F≥QF\geq Q, this range is empty.

Summation over ee. Let r=⌈2⁢Bdiv+1⌉r=\lceil 2B_{\rm div}+1\rceil and m=2rm=2^{r}. By (A.2) and (A.1),

∑e≤Qτ⁢(e)2⁢Bdivφ⁢(e)≤∑e≤Qτ⁢(e)re≤(1+log⁡Q)m,∑e≤Q1φ⁢(e)≤(1+log⁡Q)2.\sum_{e\leq Q}\frac{\tau(e)^{2B_{\rm div}}}{\varphi(e)}\leq\sum_{e\leq Q}\frac% {\tau(e)^{r}}{e}\leq(1+\log Q)^{m},\qquad\sum_{e\leq Q}\frac{1}{\varphi(e)}% \leq(1+\log Q)^{2}.

Inserting (A.10) and (A.11) in (A.9) gives

(A.12) S⁢(Q)≪aE⁢λm+3⁢(Z⁢F3⁢λ−2⁢a+ZF+Q).S(Q)\ll_{a}E\lambda^{m+3}\Bigl{(}ZF^{3}\lambda^{-2a}+\frac{Z}{F}+Q\Bigr{)}.

Put

(A.13) B1⁢(A)=A+2⌈2⁢Bdiv+1⌉+7,F=λB1,a=2⁢B1.B_{1}(A)=A+2^{\lceil 2B_{\rm div}+1\rceil}+7,\qquad F=\lambda^{B_{1}},\qquad a% =2B_{1}.

For Q≤Z⁢(log⁡Z)−B1≤2B1⁢Z⁢λ−B1Q\leq Z(\log Z)^{-B_{1}}\leq 2^{B_{1}}Z\lambda^{-B_{1}} each term in (A.12) is ≪E⁢Z⁢λm+3−B1≤E⁢Z⁢λ−A\ll EZ\lambda^{m+3-B_{1}}\leq EZ\lambda^{-A}. This is (6.36). The constants depend only on AA, BdivB_{\rm div} and the constant C2⁢B1C_{2B_{1}} of (6.35). For Bdiv=1B_{\rm div}=1 one has r=3r=3, m=8m=8 and B1⁢(A)=A+15B_{1}(A)=A+15. ∎

Proof of (ii).

Fix a box and a selected factor rr of Paper I, (3.26). Put ξn=αn⁢𝟏(n,r)=1\xi_{n}=\alpha_{n}\mathbf{1}_{(n,r)=1}, with α\alpha as in Paper I, (3.8). Then ξ\xi is supported in IT⊂(T,2⁢T]⊂[1,Z]I_{T}\subset(T,2T]\subset[1,Z], Z=⌈2⁢T⌉Z=\lceil 2T\rceil, |ξn|≤1|\xi_{n}|\leq 1, and E=‖ξ‖22≤Nℐ+1E=\|\xi\|_{2}^{2}\leq N_{\mathcal{I}}+1. Its discrepancy (A.3) at h=1h=1 is Δ⁢(α(r);q,b)\Delta(\alpha^{(r)};q,b) of Paper I, (3.46). The support of ψ0\psi_{0} in Paper I, (3.27), gives q≤5⁢Q/2<3⁢Qq\leq 5Q/2<3Q.

Low norm. If E≤Nℐ⁢L−A3−1E\leq N_{\mathcal{I}}L^{-A_{3}-1}, then (A.5), Q<TQ<T and log⁡(3⁢Q)≤L\log(3Q)\leq L give

∑q≤3⁢QV⁢(q;ξ)≤(Nℐ⁢(1+log⁡3⁢Q)+3⁢Q)⁢E≪T⁢L⁢E≤Nℐ⁢T⁢L−A3.\sum_{q\leq 3Q}V(q;\xi)\leq(N_{\mathcal{I}}(1+\log 3Q)+3Q)E\ll TLE\leq N_{% \mathcal{I}}TL^{-A_{3}}.

This is the first case of Paper I, (3.48).

High norm. Let E>Nℐ⁢L−A3−1E>N_{\mathcal{I}}L^{-A_{3}-1}. For d,k≥1d,k\geq 1 and (l,k)=1(l,k)=1,

Δξ⁢(k,l;d)=∑n∈IT,n≡l⁢(k)(n,d⁢r)=1αn−1φ⁢(k)⁢∑n∈IT(n,d⁢k⁢r)=1αn,\Delta_{\xi}(k,l;d)=\sum_{\begin{subarray}{c}n\in I_{T},\ n\equiv l\ (k)\\ (n,dr)=1\end{subarray}}\alpha_{n}-\frac{1}{\varphi(k)}\sum_{\begin{subarray}{c% }n\in I_{T}\\ (n,dkr)=1\end{subarray}}\alpha_{n},

which is the discrepancy of Paper I, (3.25), with I=ITI=I_{T} and auxiliary divisor d⁢rdr. Hence, for each ASW>0A_{\rm SW}>0,

(A.14) |Δξ⁢(k,l;d)|≪ASWT⁢τ⁢(d)⁢τ⁢(r)⁢L−ASW.|\Delta_{\xi}(k,l;d)|\ll_{A_{\rm SW}}T\tau(d)\tau(r)L^{-A_{\rm SW}}.

By Paper I, (3.26), rr is u0u_{0}-rough and r≤X0.6≤N0.6r\leq X^{0.6}\leq N^{0.6}. With log⁡u0=ℓ0⁢σ2⁢log⁡N\log u_{0}=\ell_{0}\sigma^{2}\log N from Paper I, (3.2), the number Ω⁢(r)\Omega(r) of prime factors with multiplicity satisfies Ω⁢(r)≤0.6/(ℓ0⁢σ2)\Omega(r)\leq 0.6/(\ell_{0}\sigma^{2}), so

τ⁢(r)≤2Ω⁢(r)=Oσ⁢(1).\tau(r)\leq 2^{\Omega(r)}=O_{\sigma}(1).

By Paper I, (3.8), Nℐ≍T⁢L−CboxN_{\mathcal{I}}\asymp TL^{-C_{\rm box}}, hence

E1/2⁢Z1/2≫T⁢L−(Cbox+A3+1)/2.E^{1/2}Z^{1/2}\gg TL^{-(C_{\rm box}+A_{3}+1)/2}.

By Paper I, (3.11), T≥X60⁢σT\geq X^{60\sigma}, so log⁡(2⁢Z)≍σL\log(2Z)\asymp_{\sigma}L. Take ASW=P+(Cbox+A3+1)/2A_{\rm SW}=P+(C_{\rm box}+A_{3}+1)/2 in (A.14). This gives (6.35) for ξ\xi with Bdiv=1B_{\rm div}=1, at every precision PP. The constants depend only on σ\sigma, CboxC_{\rm box}, A3A_{3}, PP and the constants of Paper I, (3.25). These are common to all boxes and selected factors.

By part (i) with Bdiv=1B_{\rm div}=1 and A=A3A=A_{3}, the range parameter is B1⁢(A3)=A3+15=BFB_{1}(A_{3})=A_{3}+15=B_{F}. Paper I, (3.6), gives Q<T⁢X−29⁢σQ<TX^{-29\sigma}, hence

3⁢Q<3⁢T⁢X−29⁢σ≤Z⁢(log⁡Z)−BF3Q<3TX^{-29\sigma}\leq Z(\log Z)^{-B_{F}}

for all sufficiently large XX. Part (i) yields

∑q≤3⁢QV⁢(q;ξ)≪E⁢Z⁢(log⁡Z)−A3≪Nℐ⁢T⁢L−A3.\sum_{q\leq 3Q}V(q;\xi)\ll EZ(\log Z)^{-A_{3}}\ll N_{\mathcal{I}}TL^{-A_{3}}.

This is (6.37), uniformly in the box and the selected factor.

In the proof of Paper I, Theorem 3.2, [3, Theorem 0(a)] is used only to obtain the second case of (3.48). See the list of inputs after the statement of that theorem in Paper I. The two cases above give (3.48) for every box and selected factor, with the same constants and quantifiers. The rest of that proof is unchanged. ∎

A.3. Lemma 6.8

Recall the notation of Section 6. Put L=log⁡NL=\log N, ℓ=log⁡log⁡N\ell=\log\log N,

z=N1/ℓ3,y=N1/ℓ,v=vRA=522710000,w=91000,σp=10−6,θ=732,z=N^{1/\ell^{3}},\qquad y=N^{1/\ell},\qquad v=v_{\mathrm{RA}}=\frac{5227}{1000% 0},\qquad w=\frac{9}{1000},\qquad\sigma_{\mathrm{p}}=10^{-6},\qquad\theta=% \frac{7}{32},

and, for an integer qq and a residue ee,

(6.21) 𝒦q⁢(e)=𝟏e≡N⁢(q)−𝟏(e,q)=1φ⁢(q)\mathcal{K}_{q}(e)=\mathbf{1}_{e\equiv N\ (q)}-\frac{\mathbf{1}_{(e,q)=1}}{% \varphi(q)}

(the last line of (6.21)). For a parent (H,2⁢H](H,2H] with N1/3/8≤H≤2⁢N.46+O⁢(1/L)N^{1/3}/8\leq H\leq 2N^{.46+O(1/L)}, (6.38) defines

(6.38) D1=H⁢N−σp,D2=Q⁢Nw+σp/H,Q=Nv⁢L−B.D_{1}=HN^{-\sigma_{\mathrm{p}}},\qquad D_{2}=QN^{w+\sigma_{\mathrm{p}}}/H,% \qquad Q=N^{v}L^{-B}.

For a sequence ff on (H,2⁢H](H,2H], (6.32) defines Δf⁢(I;k,b;h)\Delta_{f}(I;k,b;h) as (A.3) with nn restricted to the interval II. Then (6.34) is the bound

(6.34) |Δf⁢(I;k,b;h)|≪PH⁢τ⁢(h)⁢L−P,(b,k)=1,|\Delta_{f}(I;k,b;h)|\ll_{P}H\tau(h)L^{-P},\qquad(b,k)=1,

uniformly for I⊂(H,2⁢H]I\subset(H,2H] and k,h≥1k,h\geq 1.

Lemma 6.8 (Two-factor convolution estimate).  Let N1/3/8≤H≤2⁢N.46+O⁢(1/L)N^{1/3}/8\leq H\leq 2N^{.46+O(1/L)} and H⁢M≍NHM\asymp N. Let ana_{n}, n∼Hn\sim H, be one-bounded, supported on P−⁢(n)>zP^{-}(n)>z, and satisfy (6.34) at the original parent HH, where z=N1/(log⁡log⁡N)3z=N^{1/(\log\log N)^{3}}. Let bmb_{m}, m∼Mm\sim M, be one-bounded. Let U1,V1U_{1},V_{1} be dyadic modulus scales, allowing the singleton scale 1/21/2 for the integer 11, such that

U1≤D1,V1≤D2,U1⁢V1≤NvRA.U_{1}\leq D_{1},\qquad V_{1}\leq D_{2},\qquad U_{1}V_{1}\leq N^{v_{\mathrm{RA}% }}.

Let f⁢(r)f(r), r∼U1r\sim U_{1}, and g⁢(s)g(s), s∼V1s\sim V_{1}, be arbitrary one-bounded arrays, with the unary restrictions r<D1r<D_{1}, s<D2s<D_{2}, (r,N)=(s,N)=1(r,N)=(s,N)=1 in force. Neither a pointwise condition r⁢s<Qrs<Q nor a joint condition (r,s)=1(r,s)=1 is imposed on the pair. Then, for every fixed A>0A>0, uniformly in these occupied-parent scales, ff, gg, unary interval cuts of ana_{n} and bmb_{m}, and intervals I⊂[N/8,2⁢N]I\subset[N/8,2N],

(6.45) ∑r,sf⁢(r)⁢g⁢(s)⁢∑n,mn⁢m∈Ian⁢bm⁢𝒦r⁢s⁢(n⁢m)≪AN⁢L−A.\sum_{r,s}f(r)g(s)\sum_{\begin{subarray}{c}n,m\\ nm\in I\end{subarray}}a_{n}b_{m}\mathcal{K}_{rs}(nm)\ll_{A}NL^{-A}.

Write H=NhH=N^{h}. Fixed-factor enlargements of the parents change hh by O⁢(1/L)O(1/L), so

(A.15) 13−o⁢(1)≤h≤2350+o⁢(1),M≫N.54−o⁢(1).\tfrac{1}{3}-o(1)\leq h\leq\tfrac{23}{50}+o(1),\qquad M\gg N^{.54-o(1)}.

All implied constants below may depend on AA, on the fixed comparison constants and on the constants in (6.34). They do not depend on NN, HH, ff, gg, aa or bb. All fixed precisions are chosen before the final threshold for NN.

Step 0: reductions

A unary cut an⁢𝟏J⁢(n)a_{n}\mathbf{1}_{J}(n) satisfies (6.34) with the same constants, since Δa⁢𝟏J⁢(I;k,b;h)=Δa⁢(I∩J;k,b;h)\Delta_{a\mathbf{1}_{J}}(I;k,b;h)=\Delta_{a}(I\cap J;k,b;h). The error is still measured at HH. A unary cut of bmb_{m} keeps it one-bounded. The product cut n⁢m∈Inm\in I is removed in Step 9. Until then we prove, for every fixed A>0A>0,

(A.16) 𝒮:=∑r∼U1,s∼V1f⁢(r)⁢g⁢(s)⁢∑n∼H,m∼Man⁢bm⁢𝒦r⁢s⁢(n⁢m)≪AN⁢L−A.\mathcal{S}:=\sum_{r\sim U_{1},\ s\sim V_{1}}f(r)g(s)\sum_{n\sim H,\ m\sim M}a% _{n}b_{m}\mathcal{K}_{rs}(nm)\ll_{A}NL^{-A}.

Step 1: a shifted divisor moment and the mean square

For each fixed jj and each interval JJ of length O⁢(M)O(M) in (M/2,4⁢M](M/2,4M],

(A.17) ∑n∼H,m∈Jm⁢n≠Nτ⁢(|m⁢n−N|)j≪jM⁢H⁢LCj.\sum_{\begin{subarray}{c}n\sim H,\ m\in J\\ mn\neq N\end{subarray}}\tau(|mn-N|)^{j}\ll_{j}MHL^{C_{j}}.

Let 1≤u≤N31\leq u\leq N^{3}. Its prime factors above N1/8N^{1/8} have total multiplicity at most 2424. Group the others greedily into at most 2525 factors, each at most N1/4N^{1/4}. Submultiplicativity of τ\tau gives

τ⁢(u)j≤224⁢j⁢∑d∣ud≤N1/4τ⁢(d)25⁢j.\tau(u)^{j}\leq 2^{24j}\sum_{\begin{subarray}{c}d\mid u\\ d\leq N^{1/4}\end{subarray}}\tau(d)^{25j}.

For fixed nn and dd, put h0=(d,n)h_{0}=(d,n). The congruence d∣m⁢n−Nd\mid mn-N has no solution unless h0∣Nh_{0}\mid N, and otherwise O⁢(M⁢h0/d+1)O(Mh_{0}/d+1) solutions m∈Jm\in J. Using (d,n)≤∑e∣(d,n)e(d,n)\leq\sum_{e\mid(d,n)}e and (A.1),

∑d≤N1/4τ⁢(d)25⁢j⁢(M⁢(d,n)d+1)≪LC⁢(M⁢τ⁢(n)25⁢j+1+N1/4).\sum_{d\leq N^{1/4}}\tau(d)^{25j}\Bigl{(}\frac{M(d,n)}{d}+1\Bigr{)}\ll L^{C}% \bigl{(}M\tau(n)^{25j+1}+N^{1/4}\bigr{)}.

Summing over nn with (A.1), and using N1/4≤MN^{1/4}\leq M, proves (A.17).

Put ZH=⌈2⁢H⌉Z_{H}=\lceil 2H\rceil. For each fixed P>0P>0 and every K′≤H⁢N−σp/2K^{\prime}\leq HN^{-\sigma_{\mathrm{p}}/2},

(A.18) ∑k≤5⁢K′τ⁢(k)⁢V⁢(k;a)≪PH2⁢L−P.\sum_{k\leq 5K^{\prime}}\tau(k)V(k;a)\ll_{P}H^{2}L^{-P}.

First let R>0R>0 be fixed. If ‖a‖22≤H⁢L−R\|a\|_{2}^{2}\leq HL^{-R}, then (A.5) gives ∑k≤5⁢K′V⁢(k;a)≪(H⁢(1+log⁡5⁢K′)+K′)⁢‖a‖22≪H2⁢L1−R\sum_{k\leq 5K^{\prime}}V(k;a)\ll(H(1+\log 5K^{\prime})+K^{\prime})\|a\|_{2}^{% 2}\ll H^{2}L^{1-R}. If ‖a‖22>H⁢L−R\|a\|_{2}^{2}>HL^{-R}, then ‖a‖2⁢ZH1/2≥H⁢L−R/2\|a\|_{2}Z_{H}^{1/2}\geq HL^{-R/2}. Taking I=(H,2⁢H]I=(H,2H] in (6.34) at precision P′+R/2P^{\prime}+R/2 gives (6.35) for ξ=a\xi=a with Z=ZHZ=Z_{H}, Bdiv=1B_{\rm div}=1 and common constants, since log⁡(2⁢ZH)≍L\log(2Z_{H})\asymp L. This argument is uniform at every requested precision PP (after choosing P′P^{\prime} accordingly). Lemma 6.5(i) with A=P′A=P^{\prime} and B1⁢(P′)=P′+15B_{1}(P^{\prime})=P^{\prime}+15 gives

∑k≤ZH⁢(log⁡ZH)−P′−15V⁢(k;a)≪‖a‖22⁢ZH⁢(log⁡ZH)−P′≪H2⁢L−P′.\sum_{k\leq Z_{H}(\log Z_{H})^{-P^{\prime}-15}}V(k;a)\ll\|a\|_{2}^{2}Z_{H}(% \log Z_{H})^{-P^{\prime}}\ll H^{2}L^{-P^{\prime}}.

The range contains k≤5⁢K′k\leq 5K^{\prime}, because 5⁢K′/H≤5⁢N−σp/25K^{\prime}/H\leq 5N^{-\sigma_{\mathrm{p}}/2} beats every fixed power of LL. Thus in both cases ∑k≤5⁢K′V⁢(k;a)≪H2⁢L−min⁡(R−1,P′)\sum_{k\leq 5K^{\prime}}V(k;a)\ll H^{2}L^{-\min(R-1,P^{\prime})}. To insert τ⁢(k)\tau(k), split at τ⁢(k)=LR′\tau(k)=L^{R^{\prime}}. Below the split the cost is LR′L^{R^{\prime}}. Above it, τ⁢(k)≤L−R′⁢τ⁢(k)2\tau(k)\leq L^{-R^{\prime}}\tau(k)^{2}, and V⁢(k;a)≤(2⁢H/k+1)⁢(H+1)V(k;a)\leq(2H/k+1)(H+1) by (A.5); hence by (A.1)

∑k≤5⁢K′τ⁢(k)>LR′τ⁢(k)⁢V⁢(k;a)≪L−R′⁢H2⁢∑k≤5⁢K′τ⁢(k)2k≪H2⁢L4−R′.\sum_{\begin{subarray}{c}k\leq 5K^{\prime}\\ \tau(k)>L^{R^{\prime}}\end{subarray}}\tau(k)V(k;a)\ll L^{-R^{\prime}}H^{2}\sum% _{k\leq 5K^{\prime}}\frac{\tau(k)^{2}}{k}\ll H^{2}L^{4-R^{\prime}}.

Choosing R′=P+4R^{\prime}=P+4 and then R,P′≥P+R′+1R,P^{\prime}\geq P+R^{\prime}+1 proves (A.18).

For a zz-rough integer t≤NCt\leq N^{C} put an(t)=an⁢𝟏(n,t)=1a^{(t)}_{n}=a_{n}\mathbf{1}_{(n,t)=1}. Since ω⁢(t)≤log⁡t/log⁡z≪ℓ3\omega(t)\leq\log t/\log z\ll\ell^{3} and each prime p∣tp\mid t exceeds zz,

‖a−a(t)‖22≤∑p∣t(2⁢Hp+1)≪H⁢Lz,\|a-a^{(t)}\|_{2}^{2}\leq\sum_{p\mid t}\Bigl{(}\frac{2H}{p}+1\Bigr{)}\ll\frac{% HL}{z},

and by (A.5) and (A.1), uniformly in tt,

(A.19) ∑k≤5⁢K′τ⁢(k)⁢V⁢(k;a−a(t))≪H2⁢L3z.\sum_{k\leq 5K^{\prime}}\tau(k)V(k;a-a^{(t)})\ll\frac{H^{2}L^{3}}{z}.

Step 2: large smooth parts

Write s=d⁢ts=dt with P+⁢(d)≤z<P−⁢(t)P^{+}(d)\leq z<P^{-}(t). Consider the pairs (r,s)(r,s) with d>yd>y. Then the zz-smooth part of q=r⁢sq=rs exceeds yy. A modulus qq has at most τ⁢(q)\tau(q) factorizations q=r⁢sq=rs, and q≤4⁢U1⁢V1≤4⁢Nvq\leq 4U_{1}V_{1}\leq 4N^{v}. For (q,N)=1(q,N)=1, counting mm for each nn coprime to qq gives

|∑n,man⁢bm⁢𝒦q⁢(n⁢m)|≪Nq+H+Nφ⁢(q).\Bigl{|}\sum_{n,m}a_{n}b_{m}\mathcal{K}_{q}(nm)\Bigr{|}\ll\frac{N}{q}+H+\frac{% N}{\varphi(q)}.

By (A.2), the contribution of these pairs to 𝒮\mathcal{S} is

≪N⁢∑q≤4⁢Nvq=d′⁢h′,d′>y,P+⁢(d′)≤zτ⁢(q)2q+H⁢∑q≤4⁢Nvτ⁢(q)≪N⁢LC⁢∑d′>yP+⁢(d′)≤zτ⁢(d′)2d′+H⁢Nv⁢L.\ll N\sum_{\begin{subarray}{c}q\leq 4N^{v}\\ q=d^{\prime}h^{\prime},\ d^{\prime}>y,\ P^{+}(d^{\prime})\leq z\end{subarray}}% \frac{\tau(q)^{2}}{q}+H\sum_{q\leq 4N^{v}}\tau(q)\ll NL^{C}\sum_{\begin{% subarray}{c}d^{\prime}>y\\ P^{+}(d^{\prime})\leq z\end{subarray}}\frac{\tau(d^{\prime})^{2}}{d^{\prime}}+% HN^{v}L.

Here τ⁢(q)2≤τ⁢(d′)2⁢τ⁢(h′)2\tau(q)^{2}\leq\tau(d^{\prime})^{2}\tau(h^{\prime})^{2} and the sum over h′h^{\prime} is bounded by (A.1). By (A.7) the first term is OA⁢(N⁢L−A)O_{A}(NL^{-A}). The second is at most N.9827+o⁢(1)N^{.9827+o(1)}, since h+v≤.46+.5227+o⁢(1)h+v\leq.46+.5227+o(1). It remains to treat d≤yd\leq y.

Step 3: the first Cauchy square

Split dd and tt into dyadic shells d∼Dd\sim D, t∼St\sim S, with D≤yD\leq y, D⁢S≍V1DS\asymp V_{1}. There are O⁢(L)O(L) choices of DD and O⁢(1)O(1) of SS. Put

λd⁢(t)=g⁢(d⁢t)⁢𝟏d⁢t∼V1⁢𝟏P−⁢(t)>z⁢𝟏P+⁢(d)≤z,K=U1⁢D,k=r⁢d.\lambda_{d}(t)=g(dt)\mathbf{1}_{dt\sim V_{1}}\mathbf{1}_{P^{-}(t)>z}\mathbf{1}% _{P^{+}(d)\leq z},\qquad K=U_{1}D,\qquad k=rd.

Then |λd⁢(t)|≤1|\lambda_{d}(t)|\leq 1, r⁢s=k⁢trs=kt, and (k⁢t,N)=1(kt,N)=1 on the supports. One block of 𝒮\mathcal{S} is

𝒮0=∑r,d,mf⁢(r)⁢bm⁢∑tλd⁢(t)⁢∑nan⁢𝒦k⁢t⁢(m⁢n).\mathcal{S}_{0}=\sum_{r,d,m}f(r)b_{m}\sum_{t}\lambda_{d}(t)\sum_{n}a_{n}% \mathcal{K}_{kt}(mn).

Fix a smooth ψ≥0\psi\geq 0 supported in [1/2,5/2][1/2,5/2], equal to 11 on [1,2][1,2]. Cauchy’s inequality in (r,d,m)(r,d,m) gives

(A.20) |𝒮0|2≤C⁢K⁢M⁢𝒮′,𝒮′=∑r,dψ⁢(rU1)⁢𝟏(r⁢d,N)=1⁢𝟏d∼D⁢∑mψ⁢(mM)⁢|∑tλd⁢(t)⁢∑nan⁢𝒦k⁢t⁢(m⁢n)|2.|\mathcal{S}_{0}|^{2}\leq CKM\,\mathcal{S}^{\prime},\qquad\mathcal{S}^{\prime}% =\sum_{r,d}\psi\Bigl{(}\frac{r}{U_{1}}\Bigr{)}\mathbf{1}_{(rd,N)=1}\mathbf{1}_% {d\sim D}\sum_{m}\psi\Bigl{(}\frac{m}{M}\Bigr{)}\Bigl{|}\sum_{t}\lambda_{d}(t)% \sum_{n}a_{n}\mathcal{K}_{kt}(mn)\Bigr{|}^{2}.

The indicator 𝟏(r⁢d,N)=1\mathbf{1}_{(rd,N)=1} is part of the original support and is kept. The scale conditions and (A.15) give, for large NN,

(A.21) KH≤N−σp/2,K⁢SM≤N−.0172,M≫N.54−o⁢(1),\frac{K}{H}\leq N^{-\sigma_{\mathrm{p}}/2},\qquad\frac{KS}{M}\leq N^{-.0172},% \qquad M\gg N^{.54-o(1)},

because K≤D1⁢yK\leq D_{1}y, K⁢S≍U1⁢V1≤NvKS\asymp U_{1}V_{1}\leq N^{v} and v−.54=−.0173v-.54=-.0173. In particular k⁢t=o⁢(M)kt=o(M) and K=o⁢(H)K=o(H).

Expand 𝒮′=𝒮3−2⁢Re⁡𝒮2+𝒮1\mathcal{S}^{\prime}=\mathcal{S}_{3}-2\operatorname{Re}\mathcal{S}_{2}+% \mathcal{S}_{1} over tuples 𝐭=(r,d,t1,t2,n1,n2)\mathbf{t}=(r,d,t_{1},t_{2},n_{1},n_{2}) with coefficient

c⁢(𝐭)=ψ⁢(r/U1)⁢𝟏(r⁢d,N)=1⁢𝟏d∼D⁢λd⁢(t1)⁢λd⁢(t2)¯⁢an1⁢an2¯,ω⁢(𝐭)=𝟏(n1,k⁢t1)=(n2,k⁢t2)=1:c(\mathbf{t})=\psi(r/U_{1})\mathbf{1}_{(rd,N)=1}\mathbf{1}_{d\sim D}\lambda_{d% }(t_{1})\overline{\lambda_{d}(t_{2})}a_{n_{1}}\overline{a_{n_{2}}},\qquad% \omega(\mathbf{t})=\mathbf{1}_{(n_{1},kt_{1})=(n_{2},kt_{2})=1}:
𝒮3\displaystyle\mathcal{S}_{3} =∑𝐭c⁢∑mψ⁢(m/M)⁢𝟏k⁢t1∣m⁢n1−N⁢𝟏k⁢t2∣m⁢n2−N,\displaystyle=\sum_{\mathbf{t}}c\sum_{m}\psi(m/M)\mathbf{1}_{kt_{1}\mid mn_{1}% -N}\mathbf{1}_{kt_{2}\mid mn_{2}-N},
𝒮2\displaystyle\mathcal{S}_{2} =∑𝐭c⁢∑mψ⁢(m/M)⁢𝟏k⁢t1∣m⁢n1−N⁢𝟏(m⁢n2,k⁢t2)=1φ⁢(k⁢t2),\displaystyle=\sum_{\mathbf{t}}c\sum_{m}\psi(m/M)\mathbf{1}_{kt_{1}\mid mn_{1}% -N}\frac{\mathbf{1}_{(mn_{2},kt_{2})=1}}{\varphi(kt_{2})},
𝒮1\displaystyle\mathcal{S}_{1} =∑𝐭c⁢∑mψ⁢(m/M)⁢𝟏(m⁢n1,k⁢t1)=1⁢𝟏(m⁢n2,k⁢t2)=1φ⁢(k⁢t1)⁢φ⁢(k⁢t2).\displaystyle=\sum_{\mathbf{t}}c\sum_{m}\psi(m/M)\frac{\mathbf{1}_{(mn_{1},kt_% {1})=1}\mathbf{1}_{(mn_{2},kt_{2})=1}}{\varphi(kt_{1})\varphi(kt_{2})}.

In 𝒮3\mathcal{S}_{3} the factor ω\omega is automatic, since (k⁢ti,N)=1(kt_{i},N)=1.

Step 4: restoration before the Chinese remainder theorem

Call a tuple gcd-bad if one of

(A.22) (n1,n2)>1,(t1,t2)>1,(n1,t2)>1,(n2,t1)>1,(k,t1⁢t2)>1(n_{1},n_{2})>1,\quad(t_{1},t_{2})>1,\quad(n_{1},t_{2})>1,\quad(n_{2},t_{1})>1% ,\quad(k,t_{1}t_{2})>1

holds. Call a tuple near-diagonal if |n1−n2|<H⁢L−CM|n_{1}-n_{2}|<HL^{-C_{M}}; this condition is charged separately below. On the other tuples k,t1,t2k,t_{1},t_{2} are pairwise coprime. For a set ℬ\mathcal{B} of tuples define the formal terms

(A.23) M⁢T⁢(ℬ)=∑ℬc⁢ω⁢M⁢ψ^⁢(0)k⁢t1⁢t2⁢φ⁢(k),𝒵⁢(ℬ)=∑ℬc⁢ω⁢ 1n1≡n2⁢(k)⁢M⁢ψ^⁢(0)k⁢t1⁢t2.MT(\mathcal{B})=\sum_{\mathcal{B}}\frac{c\,\omega\,M\hat{\psi}(0)}{kt_{1}t_{2}% \varphi(k)},\qquad\mathcal{Z}(\mathcal{B})=\sum_{\mathcal{B}}\frac{c\,\omega\,% \mathbf{1}_{n_{1}\equiv n_{2}\ (k)}M\hat{\psi}(0)}{kt_{1}t_{2}}.

We show

(A.24) 𝒮′=M⁢ℰ+𝒵⁢(all)−M⁢T⁢(all)+O⁢(R0),R0≪PM⁢H2K⁢L−P+M⁢H⁢LC⁢[Hz⁢K+1]+No⁢(1)⁢[H2K+H2⁢S]+No⁢(1)⁢(H+K⁢S)2K,\begin{gathered}\mathcal{S}^{\prime}=M\mathcal{E}+\mathcal{Z}(\mathrm{all})-MT% (\mathrm{all})+O(R_{0}),\\ R_{0}\ll_{P}\frac{MH^{2}}{K}L^{-P}+MHL^{C}\Bigl{[}\frac{H}{zK}+1\Bigr{]}+N^{o(% 1)}\Bigl{[}\frac{H^{2}}{K}+H^{2}S\Bigr{]}+N^{o(1)}\frac{(H+KS)^{2}}{K},\end{gathered}

where ℰ\mathcal{E} is the nonzero-frequency sum on good tuples defined in Step 6. The exponent CC is fixed after PP and the truncation parameters.

Resonant mm. If m⁢ni=Nmn_{i}=N, then m∣Nm\mid N. There are τ⁢(N)=No⁢(1)\tau(N)=N^{o(1)} such mm. For fixed (r,d)(r,d) and such mm, the congruence terms over (t,n)(t,n) number at most ∑t(2⁢H/(k⁢t)+1)≪H/K+S\sum_{t}(2H/(kt)+1)\ll H/K+S. The comparator terms are ≪LC⁢H/K\ll L^{C}H/K. Hence these mm contribute ≪No⁢(1)⁢K⁢(H/K+S)2\ll N^{o(1)}K(H/K+S)^{2} to 𝒮1,𝒮2,𝒮3\mathcal{S}_{1},\mathcal{S}_{2},\mathcal{S}_{3} and to every subset of tuples below. This is the last term of R0R_{0}.

Divisor truncation. For the other mm put ui=|m⁢ni−N|≥1u_{i}=|mn_{i}-N|\geq 1. Let Σ∗\Sigma^{*} be the event τ⁢(u1),τ⁢(u2)≤LCΣ\tau(u_{1}),\tau(u_{2})\leq L^{C_{\Sigma}}. On the part of the complement with τ⁢(u1)≥τ⁢(u2)\tau(u_{1})\geq\tau(u_{2}), the triples (r,d,t1)(r,d,t_{1}) with k⁢t1∣u1kt_{1}\mid u_{1} number at most τ⁢(u1)3\tau(u_{1})^{3}. The t2∣u2t_{2}\mid u_{2} number at most τ⁢(u1)\tau(u_{1}), and n2n_{2} lies in one class modulo kk, with O⁢(H/K)O(H/K) choices. With 𝟏τ⁢(u1)>LCΣ≤τ⁢(u1)⁢L−CΣ\mathbf{1}_{\tau(u_{1})>L^{C_{\Sigma}}}\leq\tau(u_{1})L^{-C_{\Sigma}}, (A.17) gives a contribution to 𝒮3\mathcal{S}_{3} of

(A.25) ≪L−CΣ⁢HK⁢∑m,n1ψ⁢(m/M)⁢τ⁢(u1)5≪M⁢H2K⁢LC5−CΣ.\ll L^{-C_{\Sigma}}\frac{H}{K}\sum_{m,n_{1}}\psi(m/M)\tau(u_{1})^{5}\ll\frac{% MH^{2}}{K}L^{C_{5}-C_{\Sigma}}.

The other part is symmetric. Choose CΣ≥C5+PC_{\Sigma}\geq C_{5}+P.

Bad tuples in 𝒮3\mathcal{S}_{3}. In this paragraph, “bad” means Σ∗\Sigma^{*} intersected with the five gcd failures in (A.22); the near-diagonal set is not included in this term and is charged separately below. On Σ∗\Sigma^{*} fix (m,n1)(m,n_{1}). There are at most L3⁢CΣL^{3C_{\Sigma}} triples (r,d,t1)(r,d,t_{1}) and at most O⁢(L)O(L) candidate primes pp for a failure in (A.22). Once n2n_{2} is fixed, there are at most LCΣL^{C_{\Sigma}} choices of t2t_{2}. Every witnessing prime exceeds zz: it divides a zz-rough nin_{i} or tit_{i}. Since (k,N)=1(k,N)=1 and k∣m⁢n1−Nk\mid mn_{1}-N, we have (m,k)=(n1,k)=1(m,k)=(n_{1},k)=1 and n2≡n1(modk)n_{2}\equiv n_{1}\pmod{k}. Each failure places n2n_{2} in one class modulo k⁢pkp:

  • •

    p∣(n1,n2)p\mid(n_{1},n_{2}): p∤kp\nmid k; combine n2≡0⁢(p)n_{2}\equiv 0\ (p) with n2≡n1⁢(k)n_{2}\equiv n_{1}\ (k).

  • •

    p∣(t1,t2)p\mid(t_{1},t_{2}), p∤kp\nmid k: p∤mp\nmid m, since p∣m⁢n1−Np\mid mn_{1}-N and p∤Np\nmid N; combine m⁢n2≡N⁢(p)mn_{2}\equiv N\ (p) with n2≡n1⁢(k)n_{2}\equiv n_{1}\ (k). If p∣kp\mid k, then k⁢t2∣m⁢n2−Nkt_{2}\mid mn_{2}-N and p∣t2p\mid t_{2} give k⁢p∣m⁢n2−Nkp\mid mn_{2}-N.

  • •

    p∣(n1,t2)p\mid(n_{1},t_{2}): p∤kp\nmid k and p∤mp\nmid m; combine m⁢n2≡N⁢(p)mn_{2}\equiv N\ (p) with n2≡n1⁢(k)n_{2}\equiv n_{1}\ (k).

  • •

    p∣(n2,t1)p\mid(n_{2},t_{1}): p∤kp\nmid k; combine n2≡0⁢(p)n_{2}\equiv 0\ (p) with n2≡n1⁢(k)n_{2}\equiv n_{1}\ (k).

  • •

    p∣(k,t1⁢t2)p\mid(k,t_{1}t_{2}): since p>z≥P+⁢(d)p>z\geq P^{+}(d), p∣rp\mid r. If p∣t2p\mid t_{2}, then k⁢t2∣m⁢n2−Nkt_{2}\mid mn_{2}-N gives k⁢p∣m⁢n2−Nkp\mid mn_{2}-N. If p∣t1p\mid t_{1} only, exchange the two copies first.

The number of n2n_{2} in one class modulo k⁢pkp is O⁢(H/(z⁢K)+1)O(H/(zK)+1). Hence

(A.26) 𝒮3⁢(bad)≪M⁢H⁢L4⁢CΣ+1⁢[Hz⁢K+1].\mathcal{S}_{3}(\text{bad})\ll MHL^{4C_{\Sigma}+1}\Bigl{[}\frac{H}{zK}+1\Bigr{% ]}.

The near-diagonal |n1−n2|<H⁢L−CM|n_{1}-n_{2}|<HL^{-C_{M}} is counted in the same way, with H/zH/z replaced by H⁢L−CMHL^{-C_{M}}. Choose CM≥P+4⁢CΣ+1C_{M}\geq P+4C_{\Sigma}+1. This gives the first two terms of R0R_{0}. No joint condition (r,s)=1(r,s)=1 has been used. A prime p≤zp\leq z dividing (r,s)(r,s) divides dd and only enlarges kk. A prime p>zp>z dividing (r,s)(r,s) divides kk and some tit_{i}. This is the last case of (A.22).

Bad tuples in the density terms. For 𝒮1\mathcal{S}_{1}, 𝒮2\mathcal{S}_{2} and M⁢TMT, dropping coprimality leaves the positive density

≪LCφ⁢Mk2⁢t1⁢t2,\ll L^{C_{\varphi}}\frac{M}{k^{2}t_{1}t_{2}},

since k⁢t1=o⁢(M)kt_{1}=o(M) and q/φ⁢(q)≤LCφq/\varphi(q)\leq L^{C_{\varphi}} for q≤NO⁢(1)q\leq N^{O(1)}. (In 𝒮2\mathcal{S}_{2} the mm-sum is nonzero only if n1n_{1} is invertible modulo k⁢t1kt_{1}, by (k,N)=(t1,N)=1(k,N)=(t_{1},N)=1 and k⁢t1∣m⁢n1−Nkt_{1}\mid mn_{1}-N. Then mm lies in one class modulo k⁢t1kt_{1}.) For 𝒵\mathcal{Z} retain ω\omega and n2≡n1⁢(k)n_{2}\equiv n_{1}\ (k), with weight M/(k⁢t1⁢t2)M/(kt_{1}t_{2}). In particular (n1,k)=(n2,k)=1(n_{1},k)=(n_{2},k)=1 there. Without the bad condition these weights sum to ≪LCφ⁢M⁢H2/K\ll L^{C_{\varphi}}MH^{2}/K and ≪M⁢H2/K\ll MH^{2}/K, using ∑t∼S1/t≤1\sum_{t\sim S}1/t\leq 1, k=r⁢d≍Kk=rd\asymp K and, in 𝒵\mathcal{Z}, O⁢(H/K)O(H/K) values of n2n_{2} in one class modulo kk. As in 𝒮3\mathcal{S}_{3} every witnessing prime pp exceeds zz. In each case below the prime pp divides n1n_{1} or t1t_{1}, which is fixed first together with pp. Since ω⁢(n1),ω⁢(t1)≪L\omega(n_{1}),\omega(t_{1})\ll L, there are O⁢(L)O(L) choices of pp. We use

#⁢{n2∼H:p∣n2}≤Hp+1,∑t2∼Sp∣t21t2≤1S⋅2⁢Sp=2p,#⁢{r≤52⁢U1:p∣r}≤5⁢U12⁢p;\begin{gathered}\#\{n_{2}\sim H:\ p\mid n_{2}\}\leq\frac{H}{p}+1,\qquad\sum_{% \begin{subarray}{c}t_{2}\sim S\\ p\mid t_{2}\end{subarray}}\frac{1}{t_{2}}\leq\frac{1}{S}\cdot\frac{2S}{p}=% \frac{2}{p},\\ \#\{r\leq\tfrac{5}{2}U_{1}:\ p\mid r\}\leq\frac{5U_{1}}{2p};\end{gathered}

the last two have no +1+1, because they count multiples of pp in [1,2⁢S][1,2S] and [1,52⁢U1][1,\frac{5}{2}U_{1}].

  • •

    p∣(n1,n2)p\mid(n_{1},n_{2}): fix n1n_{1} and p∣n1p\mid n_{1}. In 𝒮1,𝒮2,M⁢T\mathcal{S}_{1},\mathcal{S}_{2},MT there are ≤H/z+1\leq H/z+1 values of n2n_{2}. In 𝒵\mathcal{Z}, p∤kp\nmid k since (n1,k)=1(n_{1},k)=1; combining n2≡0⁢(p)n_{2}\equiv 0\ (p) with n2≡n1⁢(k)n_{2}\equiv n_{1}\ (k) leaves O⁢(H/(z⁢K)+1)O(H/(zK)+1) values of n2n_{2}.

  • •

    p∣(t1,t2)p\mid(t_{1},t_{2}): fix t1t_{1} and p∣t1p\mid t_{1}; the t2t_{2}-sum is at most 2/p≤2/z2/p\leq 2/z. The n2n_{2}-count is unchanged; p∣kp\mid k is allowed.

  • •

    p∣(n1,t2)p\mid(n_{1},t_{2}): fix n1n_{1} and p∣n1p\mid n_{1}; the t2t_{2}-sum is at most 2/z2/z, and the n2n_{2}-count is unchanged.

  • •

    p∣(n2,t1)p\mid(n_{2},t_{1}): fix t1t_{1} and p∣t1p\mid t_{1}. In 𝒮1,𝒮2,M⁢T\mathcal{S}_{1},\mathcal{S}_{2},MT there are ≤H/z+1\leq H/z+1 values of n2n_{2}. In 𝒵\mathcal{Z}, p∣kp\mid k would contradict (n2,k)=1(n_{2},k)=1, so p∤kp\nmid k; combining n2≡0⁢(p)n_{2}\equiv 0\ (p) with n2≡n1⁢(k)n_{2}\equiv n_{1}\ (k) leaves O⁢(H/(z⁢K)+1)O(H/(zK)+1) values of n2n_{2}.

  • •

    p∣(k,t1⁢t2)p\mid(k,t_{1}t_{2}): the weights are symmetric in the two copies, so let p∣t1p\mid t_{1}; fix t1t_{1} and p∣t1p\mid t_{1}. Since p>z≥P+⁢(d)p>z\geq P^{+}(d), p∣rp\mid r, and there are at most 5⁢U1/(2⁢p)≤5⁢U1/(2⁢z)5U_{1}/(2p)\leq 5U_{1}/(2z) values of rr. The dd-, t2t_{2}- and nn-counts are unchanged.

In every case the bad part of each density term is ≪M⁢H⁢LCφ+1⁢[H/(z⁢K)+1]\ll MHL^{C_{\varphi}+1}[H/(zK)+1]. This is part of R0R_{0}. The near-diagonal is counted in the same way, with H/zH/z replaced by H⁢L−CMHL^{-C_{M}}. There are O⁢(H⁢L−CM+1)O(HL^{-C_{M}}+1) values of n2n_{2}, and O⁢(H⁢L−CM/K+1)O(HL^{-C_{M}}/K+1) in one class modulo kk. Hence the near-diagonal is ≪M⁢H2⁢LCφ−CM/K+M⁢H⁢LCφ\ll MH^{2}L^{C_{\varphi}-C_{M}}/K+MHL^{C_{\varphi}}. This is part of R0R_{0} once also CM≥P+CφC_{M}\geq P+C_{\varphi}. Thus all bad tuples may be removed from 𝒮1,𝒮2,𝒮3,𝒵,M⁢T\mathcal{S}_{1},\mathcal{S}_{2},\mathcal{S}_{3},\mathcal{Z},MT at the cost R0R_{0}.

Good tuples. On good tuples the two congruences in 𝒮3\mathcal{S}_{3} are compatible exactly on the support ω⁢(𝐭)=1\omega(\mathbf{t})=1 and n1≡n2(modk)n_{1}\equiv n_{2}\pmod{k}. Then mm lies in one class μ\mu modulo k⁢t1⁢t2kt_{1}t_{2}, with

(A.27) μk⁢t1⁢t2≡N⁢n1⁢t2¯k⁢t1+N⁢n2⁢k⁢t1¯t2(mod1).\frac{\mu}{kt_{1}t_{2}}\equiv\frac{N\overline{n_{1}t_{2}}}{kt_{1}}+\frac{N% \overline{n_{2}kt_{1}}}{t_{2}}\pmod{1}.

Poisson summation gives

(A.28) ∑m≡μ⁢(k⁢t1⁢t2)ψ⁢(mM)=Mk⁢t1⁢t2⁢∑h∈ℤψ^⁢(h⁢Mk⁢t1⁢t2)⁢e⁢(h⁢μk⁢t1⁢t2).\sum_{m\equiv\mu\ (kt_{1}t_{2})}\psi\Bigl{(}\frac{m}{M}\Bigr{)}=\frac{M}{kt_{1% }t_{2}}\sum_{h\in\mathbb{Z}}\hat{\psi}\Bigl{(}\frac{hM}{kt_{1}t_{2}}\Bigr{)}e% \Bigl{(}\frac{h\mu}{kt_{1}t_{2}}\Bigr{)}.

The term h=0h=0 gives 𝒵⁢(good)\mathcal{Z}(\mathrm{good}). All three expanded summands vanish unless ω⁢(𝐭)=1\omega(\mathbf{t})=1. The following main-term computations are on that support. For 𝒮1\mathcal{S}_{1} the smooth coprime mm-sum is M⁢ψ^⁢(0)⁢φ⁢(k⁢t1⁢t2)/(k⁢t1⁢t2)+O⁢(τ⁢(k⁢t1⁢t2))M\hat{\psi}(0)\varphi(kt_{1}t_{2})/(kt_{1}t_{2})+O(\tau(kt_{1}t_{2})). Division by φ⁢(k⁢t1)⁢φ⁢(k⁢t2)=φ⁢(k)2⁢φ⁢(t1)⁢φ⁢(t2)\varphi(kt_{1})\varphi(kt_{2})=\varphi(k)^{2}\varphi(t_{1})\varphi(t_{2}) gives M⁢T⁢(good)MT(\mathrm{good}) with total error No⁢(1)⁢H2/KN^{o(1)}H^{2}/K. For 𝒮2\mathcal{S}_{2} expand 𝟏(m,t2)=1\mathbf{1}_{(m,t_{2})=1} by Möbius inversion. The main term is M⁢ψ^⁢(0)⁢φ⁢(t2)/(k⁢t1⁢t2)M\hat{\psi}(0)\varphi(t_{2})/(kt_{1}t_{2}), with error O⁢(τ⁢(t2))O(\tau(t_{2})). Division by φ⁢(k⁢t2)=φ⁢(k)⁢φ⁢(t2)\varphi(kt_{2})=\varphi(k)\varphi(t_{2}) gives M⁢T⁢(good)MT(\mathrm{good}) with total error No⁢(1)⁢H2⁢SN^{o(1)}H^{2}S. Completing 𝒵\mathcal{Z} and M⁢TMT back to all tuples costs R0R_{0}. This proves (A.24).

Step 5: the zero mode

Expanding the centred class counts gives the exact identity, valid for all tuples including those with gcd failures,

(A.29) 𝒵⁢(all)−M⁢T⁢(all)=M⁢ψ^⁢(0)⁢∑r,d,t1,t2ψ⁢(r/U1)⁢𝟏(r⁢d,N)=1⁢λd⁢(t1)⁢λd⁢(t2)¯k⁢t1⁢t2⁢∑bmodk∗Δa(t1)⁢(k,b)⁢Δa(t2)⁢(k,b)¯.\mathcal{Z}(\mathrm{all})-MT(\mathrm{all})=M\hat{\psi}(0)\sum_{r,d,t_{1},t_{2}% }\frac{\psi(r/U_{1})\mathbf{1}_{(rd,N)=1}\lambda_{d}(t_{1})\overline{\lambda_{% d}(t_{2})}}{kt_{1}t_{2}}\sum_{b\bmod k}^{*}\Delta_{a^{(t_{1})}}(k,b)\overline{% \Delta_{a^{(t_{2})}}(k,b)}.

For fixed (k,t1,t2)(k,t_{1},t_{2}) both sides equal

∑bmodk∗A1⁢(b)⁢A2⁢(b)¯−1φ⁢(k)⁢∑bmodk∗A1⁢(b)⁢∑bmodk∗A2⁢(b)¯,Ai⁢(b)=∑n≡b⁢(k)(n,ti)=1an.\sum_{b\bmod k}^{*}A_{1}(b)\overline{A_{2}(b)}-\frac{1}{\varphi(k)}\sum_{b% \bmod k}^{*}A_{1}(b)\sum_{b\bmod k}^{*}\overline{A_{2}(b)},\qquad A_{i}(b)=% \sum_{\begin{subarray}{c}n\equiv b\ (k)\\ (n,t_{i})=1\end{subarray}}a_{n}.

Use |u⁢v¯|≤(|u|2+|v|2)/2|u\bar{v}|\leq(|u|^{2}+|v|^{2})/2 and

V⁢(k;a(t))≤2⁢V⁢(k;a)+2⁢V⁢(k;a−a(t)).V(k;a^{(t)})\leq 2V(k;a)+2V(k;a-a^{(t)}).

The sums ∑t∼S1/t\sum_{t\sim S}1/t are O⁢(1)O(1), a given kk has at most τ⁢(k)\tau(k) factorizations k=r⁢dk=rd, and k≤5⁢Kk\leq 5K. By (A.18) with K′=KK^{\prime}=K and (A.19),

(A.30) |𝒵⁢(all)−M⁢T⁢(all)|≪PM⁢H2K⁢[L−P+L3z].|\mathcal{Z}(\mathrm{all})-MT(\mathrm{all})|\ll_{P}\frac{MH^{2}}{K}\Bigl{[}L^{% -P}+\frac{L^{3}}{z}\Bigr{]}.

Only |λd|≤1|\lambda_{d}|\leq 1 is used, so λd\lambda_{d} may vary with dd. The factor 1/K1/K is cancelled by K⁢MKM in (A.20).

By (A.20), (A.24), (A.30) and (A.21), the contributions to |𝒮0||\mathcal{S}_{0}| of all terms except M⁢ℰM\mathcal{E} are

(A.31) ≪N⁢L−P/2+N⁢LC⁢[z−1/2+(KH)1/2]+N1+o⁢(1)⁢[M−1/2+(K⁢SM)1/2]+N.857.\ll NL^{-P/2}+NL^{C}\Bigl{[}z^{-1/2}+\Bigl{(}\frac{K}{H}\Bigr{)}^{1/2}\Bigr{]}% +N^{1+o(1)}\Bigl{[}M^{-1/2}+\Bigl{(}\frac{KS}{M}\Bigr{)}^{1/2}\Bigr{]}+N^{.857}.

For the last term, M1/2⁢(H+K⁢S)≤N(1+h)/2+o⁢(1)+N(1−h)/2+v+o⁢(1)M^{1/2}(H+KS)\leq N^{(1+h)/2+o(1)}+N^{(1-h)/2+v+o(1)}, and (1+h)/2≤.73+o⁢(1)(1+h)/2\leq.73+o(1), (1−h)/2+v≤.856034(1-h)/2+v\leq.856034.

Step 6: nonzero frequencies

Fix d∼Dd\sim D and let ℰd\mathcal{E}_{d} be the part of ℰ\mathcal{E} with this dd:

ℰd=∑good ⁢𝐭,ω⁢(𝐭)=1n1≡n2⁢(k)c⁢(𝐭)k⁢t1⁢t2⁢∑h≠0ψ^⁢(h⁢Mk⁢t1⁢t2)⁢e⁢(h⁢μk⁢t1⁢t2).\mathcal{E}_{d}=\sum_{\begin{subarray}{c}\text{good }\mathbf{t},\ \omega(% \mathbf{t})=1\\ n_{1}\equiv n_{2}\ (k)\end{subarray}}\frac{c(\mathbf{t})}{kt_{1}t_{2}}\sum_{h% \neq 0}\hat{\psi}\Bigl{(}\frac{hM}{kt_{1}t_{2}}\Bigr{)}e\Bigl{(}\frac{h\mu}{kt% _{1}t_{2}}\Bigr{)}.

Put η=10−9\eta=10^{-9} and

(A.32) H∗=C⁢K⁢S2⁢NηM,H_{*}=C\frac{KS^{2}N^{\eta}}{M},

with CC larger than every k⁢t1⁢t2/(K⁢S2)kt_{1}t_{2}/(KS^{2}). Since |ψ^⁢(ξ)|≪j|ξ|−j|\hat{\psi}(\xi)|\ll_{j}|\xi|^{-j}, the terms |h|>H∗|h|>H_{*} contribute O⁢(N−90)O(N^{-90}) in total, taking j>200/ηj>200/\eta. If H∗<1H_{*}<1, ℰd\mathcal{E}_{d} is negligible. This covers t=1t=1, S=1/2S=1/2, where H∗≪K⁢Nη/M≤N−.07H_{*}\ll KN^{\eta}/M\leq N^{-.07}. Hence we may assume S≥1S\geq 1 and H∗≥1H_{*}\geq 1.

Reciprocity. For coprime u,vu,v, u¯/v+v¯/u≡1/(u⁢v)(mod1)\bar{u}/v+\bar{v}/u\equiv 1/(uv)\pmod{1}. Applied to the first term of (A.27), with u=n1⁢t2u=n_{1}t_{2} and v=k⁢t1v=kt_{1}, it gives

e⁢(h⁢μk⁢t1⁢t2)=e⁢(N⁢h⁢(n1−n2)⁢n2⁢k⁢t1¯n1⁢t2)⁢e⁢(N⁢hk⁢t1⁢t2⁢n1).e\Bigl{(}\frac{h\mu}{kt_{1}t_{2}}\Bigr{)}=e\Bigl{(}\frac{Nh(n_{1}-n_{2})% \overline{n_{2}kt_{1}}}{n_{1}t_{2}}\Bigr{)}e\Bigl{(}\frac{Nh}{kt_{1}t_{2}n_{1}% }\Bigr{)}.

Put f0=(n1−n2)/kf_{0}=(n_{1}-n_{2})/k, a nonzero integer on good tuples. Cancelling kk,

(A.33) e⁢(N⁢h⁢f0⁢n2⁢t1¯n1⁢t2).e\Bigl{(}\frac{Nhf_{0}\overline{n_{2}t_{1}}}{n_{1}t_{2}}\Bigr{)}.

The conditions on t1t_{1} are

(A.34) (t1,N⁢c)=1,(t1,J)=1,b=n2,c=n1⁢t2,J=k⁢n2.(t_{1},Nc)=1,\qquad(t_{1},J)=1,\qquad b=n_{2},\quad c=n_{1}t_{2},\quad J=kn_{2}.

The first is kept. To separate the second, colour every prime in [z,N3][z,N^{3}] blue or red independently with probability 1/21/2. Since t1t_{1} is zz-rough,

(A.35) 𝟏(t1,J)=1=𝔼col⁢[2ω⁢(t1)+ωz⁢(J)⁢𝟏all primes of ⁢t1⁢ blue⁢ 1all primes≥z⁢ of ⁢J⁢ red],\mathbf{1}_{(t_{1},J)=1}=\mathbb{E}_{\rm col}\Bigl{[}2^{\omega(t_{1})+\omega_{% z}(J)}\mathbf{1}_{\text{all primes of }t_{1}\text{ blue}}\,\mathbf{1}_{\text{% all primes}\ \geq z\text{ of }J\text{ red}}\Bigr{]},

where ωz⁢(J)\omega_{z}(J) counts the primes ≥z\geq z of JJ. A shared prime makes the event empty. Otherwise its probability is the reciprocal of the power of 22. Both counts are O⁢(ℓ3)O(\ell^{3}), so the multipliers are exp⁡(O⁢(ℓ3))=No⁢(1)\exp(O(\ell^{3}))=N^{o(1)}. Fix one colouring.

Split f0f_{0} and hh into signed dyadic blocks |f0|∼F|f_{0}|\sim F and h=ε⁢h+,h+∼H0>0h=\varepsilon h_{+},\ h_{+}\sim H_{0}>0, with F≪H/KF\ll H/K and H0≤H∗H_{0}\leq H_{*}. Below, h+h_{+} is renamed h>0h>0. Fix dd, this block, a sign ε\varepsilon, and one prime colouring from (A.35). The outer tuple is 𝐨=(r,n1,n2,t2)\mathbf{o}=(r,n_{1},n_{2},t_{2}), with k=r⁢dk=rd, b=n2b=n_{2}, c=n1⁢t2c=n_{1}t_{2} and f0=(n1−n2)/kf_{0}=(n_{1}-n_{2})/k. Its support contains k∣n1−n2k\mid n_{1}-n_{2}, the near-diagonal exclusion, and the conditions on (r,d,n1,n2,t2)(r,d,n_{1},n_{2},t_{2}) inherited from the good tuples and ω=1\omega=1. It also requires every prime ≥z\geq z of J=k⁢n2J=kn_{2} to be red. The remaining t1t_{1}-conditions are (t1,N⁢c)=1(t_{1},Nc)=1, t1∼St_{1}\sim S and all primes of t1t_{1} blue. The colouring enforces (t1,J)=1(t_{1},J)=1. Write

u=h⁢SH0⁢t1,Y2⁢(𝐨)=ε⁢H0⁢Mk⁢t2⁢S,Y1⁢(𝐨)=ε⁢N⁢H0k⁢t2⁢n1⁢S,W𝐨⁢(u)=w0⁢(u)⁢ψ^⁢(Y2⁢(𝐨)⁢u)⁢e⁢(Y1⁢(𝐨)⁢u),u=\frac{hS}{H_{0}t_{1}},\quad Y_{2}(\mathbf{o})=\frac{\varepsilon H_{0}M}{kt_{% 2}S},\quad Y_{1}(\mathbf{o})=\frac{\varepsilon NH_{0}}{kt_{2}n_{1}S},\quad W_{% \mathbf{o}}(u)=w_{0}(u)\hat{\psi}(Y_{2}(\mathbf{o})u)e(Y_{1}(\mathbf{o})u),

where w0w_{0} is a fixed smooth cutoff supported in (1/4,4)(1/4,4) and equal to 11 on [1/2,2][1/2,2]. Since H0≤H∗H_{0}\leq H_{*}, k≍Kk\asymp K, t2≍St_{2}\asymp S, and N/(n1⁢M)≍1N/(n_{1}M)\asymp 1, uniformly in all outer tuples, |Y1⁢(𝐨)|+|Y2⁢(𝐨)|≪Nη|Y_{1}(\mathbf{o})|+|Y_{2}(\mathbf{o})|\ll N^{\eta}. On the original support, the remaining Fourier weight is exactly W𝐨⁢(h⁢S/(H0⁢t1))W_{\mathbf{o}}(hS/(H_{0}t_{1})). Define the Mellin transform and its uniform majorant by

W~𝐨⁢(i⁢t)=∫0∞W𝐨⁢(u)⁢ui⁢t⁢d⁢uu,m⁢(t)=Cψ,w0⁢min⁡{1,N2⁢η⁢(1+|t|)−2}.\widetilde{W}_{\mathbf{o}}(it)=\int_{0}^{\infty}W_{\mathbf{o}}(u)u^{it}\,\frac% {du}{u},\qquad m(t)=C_{\psi,w_{0}}\min\{1,N^{2\eta}(1+|t|)^{-2}\}.

The compact support, two integrations by parts, and the bounds on Y1,Y2Y_{1},Y_{2} give

sup𝐨,t|W~𝐨⁢(i⁢t)|m⁢(t)≤1,∫ℝm⁢(t)⁢𝑑t≪ψ,w0Nη,\sup_{\mathbf{o},t}\frac{|\widetilde{W}_{\mathbf{o}}(it)|}{m(t)}\leq 1,\qquad% \int_{\mathbb{R}}m(t)\,dt\ll_{\psi,w_{0}}N^{\eta},

with the fixed constant Cψ,w0C_{\psi,w_{0}} chosen large enough. Mellin inversion is the outer-dependent identity

W𝐨⁢(h⁢SH0⁢t1)=12⁢π⁢∫ℝm⁢(t)⁢(H0S)i⁢t⁢W~𝐨⁢(i⁢t)m⁢(t)⏟outer coefficient⁢h−i⁢t⁢t1i⁢t⏟inner factors⁢𝑑t.W_{\mathbf{o}}\Bigl{(}\frac{hS}{H_{0}t_{1}}\Bigr{)}=\frac{1}{2\pi}\int_{% \mathbb{R}}m(t)\underbrace{\Bigl{(}\frac{H_{0}}{S}\Bigr{)}^{it}\frac{% \widetilde{W}_{\mathbf{o}}(it)}{m(t)}}_{\text{outer coefficient}}\underbrace{h% ^{-it}t_{1}^{it}}_{\text{inner factors}}\,dt.

In particular W~𝐨⁢(i⁢t)/m⁢(t)\widetilde{W}_{\mathbf{o}}(it)/m(t) is not an inner t1t_{1}-weight: it depends on k,t2,n1k,t_{2},n_{1} and the fixed sign and block.

The tt-integral precedes Cauchy. Let Bin≥supt12ω⁢(t1)B_{\rm in}\geq\sup_{t_{1}}2^{\omega(t_{1})} and Bout≥sup𝐨2ωz⁢(k⁢n2)B_{\rm out}\geq\sup_{\mathbf{o}}2^{\omega_{z}(kn_{2})} on this block, with Bin⁢Bout=exp⁡(O⁢(ℓ3))=No⁢(1)B_{\rm in}B_{\rm out}=\exp(O(\ell^{3}))=N^{o(1)}. For fixed real Mellin parameter tt set

λv′⁢(t)\displaystyle\lambda^{\prime}_{v}(t) =Sv⁢λd⁢(v)⁢2ω⁢(v)Bin⁢𝟏all primes of ⁢v⁢ blue⁢vi⁢t,\displaystyle=\frac{S}{v}\lambda_{d}(v)\frac{2^{\omega(v)}}{B_{\rm in}}\mathbf% {1}_{\text{all primes of }v\text{ blue}}\,v^{it},
ηh⁢(t)\displaystyle\eta_{h}(t) =h−i⁢t⁢𝟏h∼H0⁢𝟏h≤H∗,\displaystyle=h^{-it}\mathbf{1}_{h\sim H_{0}}\mathbf{1}_{h\leq H_{*}},
A𝐨⁢(t)\displaystyle A_{\mathbf{o}}(t) =K⁢Sk⁢t2⁢ψ⁢(r/U1)⁢λd⁢(t2)¯⁢an1⁢an2¯⁢2ωz⁢(k⁢n2)Bout⁢𝟏all primes ≥z⁢ of ⁢k⁢n2⁢ red⁢(H0S)i⁢t⁢W~𝐨⁢(i⁢t)m⁢(t).\displaystyle=\frac{KS}{kt_{2}}\,\psi(r/U_{1})\overline{\lambda_{d}(t_{2})}a_{% n_{1}}\overline{a_{n_{2}}}\frac{2^{\omega_{z}(kn_{2})}}{B_{\rm out}}\mathbf{1}% _{\text{all primes }\geq z\text{ of }kn_{2}\text{ red}}\,\Bigl{(}\frac{H_{0}}{% S}\Bigr{)}^{it}\frac{\widetilde{W}_{\mathbf{o}}(it)}{m(t)}.

The factor 𝟏h≤H∗\mathbf{1}_{h\leq H_{*}} is the one-bounded mask on a terminal frequency block; it is independent of the outer tuple. The sum over 𝐨\mathbf{o} is restricted to the outer support just specified. Choose the fixed cutoff ψ\psi with 0≤ψ≤10\leq\psi\leq 1. On the dyadic support K⁢S/(k⁢t2)≤2KS/(kt_{2})\leq 2. By the definitions of mm, BinB_{\rm in} and BoutB_{\rm out}, every other factor above has modulus at most one. Hence |A𝐨⁢(t)|≤2|A_{\mathbf{o}}(t)|\leq 2 and |λv′⁢(t)|,|ηh⁢(t)|≤1|\lambda^{\prime}_{v}(t)|,|\eta_{h}(t)|\leq 1, uniformly in the real tt and all original outer parameters. Using 1/(k⁢t1⁢t2)=(K⁢S2)−1⁢(K⁢S/(k⁢t2))⁢(S/t1)1/(kt_{1}t_{2})=(KS^{2})^{-1}(KS/(kt_{2}))(S/t_{1}), the contribution of this block and colouring to ℰd\mathcal{E}_{d} is

Bin⁢Bout2⁢π⁢K⁢S2⁢∫ℝm⁢(t)⁢∑𝐨A𝐨⁢(t)⁢∑v∼S(v,N⁢c)=1∑h∼H0λv′⁢(t)⁢ηh⁢(t)⁢e⁢(ε⁢N⁢h⁢f0⁢b⁢v¯c)⁢d⁢t.\frac{B_{\rm in}B_{\rm out}}{2\pi KS^{2}}\int_{\mathbb{R}}m(t)\sum_{\mathbf{o}% }A_{\mathbf{o}}(t)\sum_{\begin{subarray}{c}v\sim S\\ (v,Nc)=1\end{subarray}}\ \sum_{h\sim H_{0}}\lambda^{\prime}_{v}(t)\eta_{h}(t)e% \Bigl{(}\frac{\varepsilon Nhf_{0}\overline{bv}}{c}\Bigr{)}\,dt.

Here (b,c)=1(b,c)=1 on the good support. The colour average and the O⁢(L2)O(L^{2}) signed dyadic blocks are taken after the estimate. Their cost is No⁢(1)N^{o(1)}.

Second square, pointwise in tt. Group the outer tuples by (b,c,f0)(b,c,f_{0}). For fixed (b,c,f0)(b,c,f_{0}), the factorization n1⁢t2=cn_{1}t_{2}=c has at most τ⁢(c)=No⁢(1)\tau(c)=N^{o(1)} choices. Then k=(n1−b)/f0k=(n_{1}-b)/f_{0} and r=k/dr=k/d are determined. The number of outer tuples is ≪No⁢(1)⁢H2⁢S\ll N^{o(1)}H^{2}S. Let ρ≥0\rho\geq 0 be a smooth majorant, at least 11 on their ranges b≪Hb\ll H, c≪H⁢Sc\ll HS. Since b=n2b=n_{2} is zz-rough, (b,p0)=1(b,p_{0})=1 for the least prime p0p_{0} not dividing NN, as p0≪log⁡N<zp_{0}\ll\log N<z. Define, for each real tt,

(A.36) W4⁢(t)\displaystyle W_{4}(t) =∑(b,c)=1(b,p0)=1ρ⁢(b,c)⁢∑f0∼F|∑v∼S(v,N⁢c)=1∑h∼H0λv′⁢(t)⁢ηh⁢(t)⁢e⁢(ε⁢N⁢h⁢f0⁢b⁢v¯c)|2,\displaystyle=\sum_{\begin{subarray}{c}(b,c)=1\\ (b,p_{0})=1\end{subarray}}\rho(b,c)\sum_{f_{0}\sim F}\Bigl{|}\sum_{\begin{% subarray}{c}v\sim S\\ (v,Nc)=1\end{subarray}}\sum_{h\sim H_{0}}\lambda^{\prime}_{v}(t)\eta_{h}(t)e% \Bigl{(}\frac{\varepsilon Nhf_{0}\overline{bv}}{c}\Bigr{)}\Bigr{|}^{2},
|ℰd|\displaystyle|\mathcal{E}_{d}| ≪No⁢(1)⁢HK⁢S3/2⁢∫ℝm⁢(t)⁢W4⁢(t)1/2⁢𝑑t≤Nη+o⁢(1)⁢HK⁢S3/2⁢(W4∗)1/2,\displaystyle\ll N^{o(1)}\frac{H}{KS^{3/2}}\int_{\mathbb{R}}m(t)W_{4}(t)^{1/2}% \,dt\leq N^{\eta+o(1)}\frac{H}{KS^{3/2}}(W_{4}^{*})^{1/2},
W4∗\displaystyle W_{4}^{*} =supsigned⁢blocks,colouringst∈ℝW4⁢(t).\displaystyle=\sup_{\begin{subarray}{c}\mathrm{signed\ blocks},\ \mathrm{% colourings}\\ t\in\mathbb{R}\end{subarray}}W_{4}(t).

Here W4⁢(t)W_{4}(t) is formed with a fixed block and colouring; the supremum is taken afterwards. The displayed bound for the full ℰd\mathcal{E}_{d} follows from the colour expectation and the sum over the O⁢(L2)O(L^{2}) blocks. Their cost is a uniform No⁢(1)N^{o(1)}. Thus no outer coefficient is moved through Cauchy or the tt-integral. Cauchy is applied inside the integral for each tt. No outer-dependent Mellin factor appears in λv′⁢(t)\lambda^{\prime}_{v}(t).

For every fixed tt, expand the square with z1=v⁢v′z_{1}=vv^{\prime}, k0=h1⁢v′−h2⁢vk_{0}=h_{1}v^{\prime}-h_{2}v and y1=f0⁢k0y_{1}=f_{0}k_{0}. Since |λv′⁢(t)|,|ηh⁢(t)|≤1|\lambda^{\prime}_{v}(t)|,|\eta_{h}(t)|\leq 1, the diagonal k0=0k_{0}=0 obeys, uniformly in tt,

(A.37) Wdiag⁢(t)≤No⁢(1)⁢H∗⁢S⋅H⋅F⋅H⁢S≤Nη+o⁢(1)⁢H4⁢S4N.W_{\rm diag}(t)\leq N^{o(1)}H_{*}S\cdot H\cdot F\cdot HS\leq N^{\eta+o(1)}% \frac{H^{4}S^{4}}{N}.

For k0≠0k_{0}\neq 0, write m=|y1|≪F⁢H∗⁢Sm=|y_{1}|\ll FH_{*}S and separate the two signs of y1y_{1}. The off-diagonal is a sum of expressions

(A.38) ∑z1,mbz1,m±⁢(t)⁢∑(b,c)=(b,p0)=(z1,c)=1ρ⁢(b,c)⁢e⁢(±N⁢m⁢z1⁢b¯c),\sum_{z_{1},m}b^{\pm}_{z_{1},m}(t)\sum_{\begin{subarray}{c}(b,c)=(b,p_{0})=(z_% {1},c)=1\end{subarray}}\rho(b,c)e\Bigl{(}\pm\frac{Nm\overline{z_{1}b}}{c}\Bigr% {)},

where bz1,m±⁢(t)b^{\pm}_{z_{1},m}(t) depends only on (d,S,F,H0,ε,colouring,t;z1,m)(d,S,F,H_{0},\varepsilon,\text{colouring},t;z_{1},m), and not on (b,c,f0)(b,c,f_{0}) or the original outer tuple. Its summands are products of the one-bounded weights λv′⁢(t),ηh⁢(t)\lambda^{\prime}_{v}(t),\eta_{h}(t), and |bz1,m±⁢(t)|≤Bz1,±m|b^{\pm}_{z_{1},m}(t)|\leq B_{z_{1},\pm m} for the counting majorant defined below. The support has (z1,N⁢p0)=1(z_{1},Np_{0})=1.

Coefficient norm. Fix C>0C>0. For 1≤S≤NC1\leq S\leq N^{C}, 1≤H′≤S1\leq H^{\prime}\leq S and 1/2≤F≤NC1/2\leq F\leq N^{C} let Bz1,y1B_{z_{1},y_{1}} count t,t′∼St,t^{\prime}\sim S, (t⁢t′,N)=1(tt^{\prime},N)=1, 1≤|h1|,|h2|≤H′1\leq|h_{1}|,|h_{2}|\leq H^{\prime}, f0∼Ff_{0}\sim F, with t⁢t′=z1tt^{\prime}=z_{1} and f0⁢(h1⁢t′−h2⁢t)=y1≠0f_{0}(h_{1}t^{\prime}-h_{2}t)=y_{1}\neq 0. Write yNy_{N} for the largest divisor of yy composed of primes dividing NN. Then

(A.39) ∑z1,y1≠0Bz1,y12⁢(y1,N)θ≤No⁢(1)⁢F⁢H′⁣2⁢S2.\sum_{z_{1},y_{1}\neq 0}B_{z_{1},y_{1}}^{2}(y_{1,N})^{\theta}\leq N^{o(1)}FH^{% \prime 2}S^{2}.

At fixed (z1,y1)(z_{1},y_{1}) there are at most τ⁢(z1)⁢τ⁢(|y1|)=No⁢(1)\tau(z_{1})\tau(|y_{1}|)=N^{o(1)} choices of (t,t′,f0)(t,t^{\prime},f_{0}). By Cauchy’s inequality the left side is at most

No⁢(1)⁢[∑f≤2⁢FfNθ]⁢𝒬,𝒬=∑t,t′∑k0≠0(k0,N)θ⁢𝒩t,t′⁢(k0)2,N^{o(1)}\Bigl{[}\sum_{f\leq 2F}f_{N}^{\theta}\Bigr{]}\mathcal{Q},\qquad% \mathcal{Q}=\sum_{t,t^{\prime}}\sum_{k_{0}\neq 0}(k_{0,N})^{\theta}\mathcal{N}% _{t,t^{\prime}}(k_{0})^{2},

where 𝒩t,t′⁢(k0)\mathcal{N}_{t,t^{\prime}}(k_{0}) counts (h1,h2)(h_{1},h_{2}) with h1⁢t′−h2⁢t=k0h_{1}t^{\prime}-h_{2}t=k_{0}. Since fNθ≤∑d∣f,d∣N∞dθf_{N}^{\theta}\leq\sum_{d\mid f,\ d\mid N^{\infty}}d^{\theta}, the ff-sum is at most 2⁢F⁢P02FP_{0}, with P0=∏p∣N(1−pθ−1)−1P_{0}=\prod_{p\mid N}(1-p^{\theta-1})^{-1}.

Write g0=(t,t′)g_{0}=(t,t^{\prime}), t=g0⁢ut=g_{0}u, t′=g0⁢vt^{\prime}=g_{0}v and S′=S/g0S^{\prime}=S/g_{0}. A fibre of (h1,h2)↦k0(h_{1},h_{2})\mapsto k_{0} is an arithmetic progression with step (u,v)(u,v). It has at most 1+2⁢H′/S′1+2H^{\prime}/S^{\prime} points, and at most one if S′≥2⁢H′S^{\prime}\geq 2H^{\prime}. Also

(k0,N)θ=∑d∣k0,d∣N∞ϕθ⁢(d),0≤ϕθ⁢(d)≤dθ,(k_{0,N})^{\theta}=\sum_{d\mid k_{0},\ d\mid N^{\infty}}\phi_{\theta}(d),% \qquad 0\leq\phi_{\theta}(d)\leq d^{\theta},

by telescoping each prime power. Let Ad⁢(t,t′)A_{d}(t,t^{\prime}) count (h1,h2)(h_{1},h_{2}) with k0≠0k_{0}\neq 0 and d∣k0d\mid k_{0}. Then

(A.40) 𝒬≤∑d∣N∞d≤4⁢H′⁢Sdθ⁢[∑t,t′Ad⁢(t,t′)+∑t,t′:S′<2⁢H′2⁢H′S′⁢Ad⁢(t,t′)].\mathcal{Q}\leq\sum_{\begin{subarray}{c}d\mid N^{\infty}\\ d\leq 4H^{\prime}S\end{subarray}}d^{\theta}\Bigl{[}\sum_{t,t^{\prime}}A_{d}(t,% t^{\prime})+\sum_{t,t^{\prime}:\,S^{\prime}<2H^{\prime}}\frac{2H^{\prime}}{S^{% \prime}}A_{d}(t,t^{\prime})\Bigr{]}.

For the first sum write (h1,h2)=e⁢𝐰(h_{1},h_{2})=e\,\mathbf{w} with 𝐰\mathbf{w} primitive, ‖𝐰‖∞=j≤H′\|\mathbf{w}\|_{\infty}=j\leq H^{\prime}. There are at most 8⁢j8j such 𝐰\mathbf{w} and e≤H′/je\leq H^{\prime}/j. Put de=d/(d,e)d_{e}=d/(d,e). Since t⁢t′tt^{\prime} is prime to dd, a contributing 𝐰\mathbf{w} has (w1,de)=1(w_{1},d_{e})=1 (and w1=0w_{1}=0 forces de=1d_{e}=1). Counting tt and then t′t^{\prime} in one class modulo ded_{e}, and using ∑e≤E(d,e)≤τ⁢(d)⁢E\sum_{e\leq E}(d,e)\leq\tau(d)E,

(A.41) ∑t,t′Ad⁢(t,t′)≤C⁢[τ⁢(d)⁢H′⁣2⁢S2d+H′⁣2⁢S].\sum_{t,t^{\prime}}A_{d}(t,t^{\prime})\leq C\Bigl{[}\tau(d)\frac{H^{\prime 2}S% ^{2}}{d}+H^{\prime 2}S\Bigr{]}.

For the second sum (g0,d)=1(g_{0},d)=1. There are O⁢(H′⁢S′/d)O(H^{\prime}S^{\prime}/d) nonzero levels of h1⁢v−h2⁢uh_{1}v-h_{2}u divisible by dd. Each has O⁢(H′/S′)O(H^{\prime}/S^{\prime}) points, so Ad≤C⁢H′⁣2/dA_{d}\leq CH^{\prime 2}/d. Summing over g0g_{0}, with ∑g0≤2⁢S(S/g0+1)2⁢(g0/S)≤S⁢(8+log⁡2⁢S)\sum_{g_{0}\leq 2S}(S/g_{0}+1)^{2}(g_{0}/S)\leq S(8+\log 2S),

(A.42) ∑t,t′:S′<2⁢H′2⁢H′S′⁢Ad≤C⁢(1+log⁡2⁢S)⁢H′⁣3⁢Sd≤C⁢(1+log⁡2⁢S)⁢H′⁣2⁢S2d.\sum_{t,t^{\prime}:\,S^{\prime}<2H^{\prime}}\frac{2H^{\prime}}{S^{\prime}}A_{d% }\leq C(1+\log 2S)\frac{H^{\prime 3}S}{d}\leq C(1+\log 2S)\frac{H^{\prime 2}S^% {2}}{d}.

Finally

∑d∣N∞τ⁢(d)⁢dθ−1=P02,∑d∣N∞d≤4⁢H′⁢Sdθ≤(4⁢H′⁢S)1/2⁢P2,P2=∏p∣N(1−pθ−1/2)−1.\sum_{d\mid N^{\infty}}\tau(d)d^{\theta-1}=P_{0}^{2},\qquad\sum_{\begin{% subarray}{c}d\mid N^{\infty}\\ d\leq 4H^{\prime}S\end{subarray}}d^{\theta}\leq(4H^{\prime}S)^{1/2}P_{2},% \qquad P_{2}=\prod_{p\mid N}(1-p^{\theta-1/2})^{-1}.

Since H′≤SH^{\prime}\leq S, H′⁣2⁢S⁢(H′⁢S)1/2≤H′⁣2⁢S2H^{\prime 2}S(H^{\prime}S)^{1/2}\leq H^{\prime 2}S^{2}. Both P0P_{0} and P2P_{2} are No⁢(1)N^{o(1)}: with the primes of NN in increasing order, log⁡P2≪∑i≤ω⁢(N)piθ−1/2≪(log⁡N)θ+1/2\log P_{2}\ll\sum_{i\leq\omega(N)}p_{i}^{\theta-1/2}\ll(\log N)^{\theta+1/2}. This proves (A.39).

With H′=H∗H^{\prime}=H_{*} we have H∗/S≪K⁢S⁢Nη/M≤N−.0171H_{*}/S\ll KSN^{\eta}/M\leq N^{-.0171} by (A.21). For every real Mellin parameter tt, fixed d,S,F,H0,εd,S,F,H_{0},\varepsilon and colouring, the coefficient sequences bz1,m±⁢(t)b^{\pm}_{z_{1},m}(t) in (A.38) satisfy the uniform weighted estimate

∑z1,m≥1(mN)θ⁢|bz1,m±⁢(t)|2≤∑z1,y1≠0Bz1,y12⁢(y1,N)θ≪No⁢(1)⁢F⁢H∗2⁢S2.\sum_{z_{1},m\geq 1}(m_{N})^{\theta}|b^{\pm}_{z_{1},m}(t)|^{2}\leq\sum_{z_{1},% y_{1}\neq 0}B_{z_{1},y_{1}}^{2}(y_{1,N})^{\theta}\ll N^{o(1)}FH_{*}^{2}S^{2}.

This follows from (A.39), since the inner complex weights have modulus at most one. In particular the implied constant is independent of tt and of all original outer data (r,k,n1,n2,t2,b,c,f0)(r,k,n_{1},n_{2},t_{2},b,c,f_{0}). The dependence on these data was placed in A𝐨⁢(t)A_{\mathbf{o}}(t) before Cauchy. Writing b~t±⁢(j)\widetilde{b}_{t}^{\pm}(j) for the slices of Paper I, (2.43), with nT=p0⁢mn_{T}=p_{0}m and aT=±Na_{T}=\pm N, gives

(A.43) supt∈ℝ∑j∣N∞jθ⁢‖b~t±⁢(j)‖22≪No⁢(1)⁢F⁢(H∗⁢S)2,supt∈ℝ‖bt±‖22≪No⁢(1)⁢F⁢(H∗⁢S)2.\sup_{t\in\mathbb{R}}\sum_{j\mid N^{\infty}}j^{\theta}\|\widetilde{b}_{t}^{\pm% }(j)\|_{2}^{2}\ll N^{o(1)}F(H_{*}S)^{2},\qquad\sup_{t\in\mathbb{R}}\|b_{t}^{% \pm}\|_{2}^{2}\ll N^{o(1)}F(H_{*}S)^{2}.

Since (p0,N)=1(p_{0},N)=1, the NN-part of nT=p0⁢mn_{T}=p_{0}m is precisely mNm_{N}. This is the norm required by Paper I, (2.42)–(2.43), for every tt, without any Mellin factor in the inner coefficients.

Application of Paper I, Theorem 2.8. In (A.38) put

(A.44) rT=z1∼Z1,sT=p0,RT=Z1,ST=p0/2,dT=b,cT=c,nT=p0⁢m,Y:=F⁢H∗⁢S,NT=C⁢p0⁢Y≤No⁢(1)⁢Y,p0≪log⁡N,aT=±N,\begin{gathered}r_{T}=z_{1}\sim Z_{1},\quad s_{T}=p_{0},\quad R_{T}=Z_{1},% \quad S_{T}=p_{0}/2,\\ d_{T}=b,\quad c_{T}=c,\quad n_{T}=p_{0}m,\quad Y:=FH_{*}S,\quad N_{T}=Cp_{0}Y% \leq N^{o(1)}Y,\quad p_{0}\ll\log N,\quad a_{T}=\pm N,\end{gathered}

with A=NA=N. Since t,t′∼St,t^{\prime}\sim S, z1=t⁢t′∈(S2,4⁢S2]z_{1}=tt^{\prime}\in(S^{2},4S^{2}], which meets two dyadic windows. Split the z1z_{1}-sum into z1∈(S2,2⁢S2]z_{1}\in(S^{2},2S^{2}] and z1∈(2⁢S2,4⁢S2]z_{1}\in(2S^{2},4S^{2}]. Apply the theorem to each, with Z1=S2Z_{1}=S^{2} and Z1=2⁢S2Z_{1}=2S^{2} respectively. This costs a factor 22 in the final bound, and Z1≍S2Z_{1}\asymp S^{2} in both windows. Then sT∈(ST,2⁢ST]s_{T}\in(S_{T},2S_{T}] and ST≥3/2S_{T}\geq 3/2, since NN is even and p0≥3p_{0}\geq 3. The support has (aT,rT⁢sT)=1(a_{T},r_{T}s_{T})=1. The domain of the theorem is exactly

(z1⁢b,p0⁢c)=1⇔(b,c)=(z1,c)=(z1,p0)=(b,p0)=1,(z_{1}b,p_{0}c)=1\iff(b,c)=(z_{1},c)=(z_{1},p_{0})=(b,p_{0})=1,

and (z1,p0)=1(z_{1},p_{0})=1 holds by roughness. Exactly as in Paper I, (3.82)–(3.84), reducing the inverse modulo cc gives

e⁢(aT⁢nT⁢z1⁢b¯p0⁢c)=e⁢(±N⁢m⁢z1⁢b¯c),e\Bigl{(}\frac{a_{T}n_{T}\overline{z_{1}b}}{p_{0}c}\Bigr{)}=e\Bigl{(}\pm\frac{% Nm\overline{z_{1}b}}{c}\Bigr{)},

also when p0∣cp_{0}\mid c. Split ρ\rho into finitely many smooth pieces on strict dyadic windows in (b,c)(b,c). Multiply by fixed smooth cutoffs equal to 11 on the supported nT,z1,p0n_{T},z_{1},p_{0}. At nT≥1n_{T}\geq 1 use a cutoff vanishing below 1/21/2. All derivatives satisfy Paper I, (2.39), with uniform seminorms. Take ϵ=ϵ0=10−12\epsilon=\epsilon_{0}=10^{-12}. All parameters lie in [1,N10][1,N^{10}], so 𝒳=2+A⁢C⁢D⁢N⁢R⁢S≤3⁢N60\mathcal{X}=2+ACDNRS\leq 3N^{60} in Paper I, (2.41). The prefactor there satisfies 𝒳ϵ+18⁢ϵ0=𝒳19⋅10−12≤N1.2⋅10−9\mathcal{X}^{\epsilon+18\epsilon_{0}}=\mathcal{X}^{19\cdot 10^{-12}}\leq N^{1.% 2\cdot 10^{-9}} for large NN. Write δX=1.2⋅10−9\delta_{X}=1.2\cdot 10^{-9} for this fixed loss. This loss and the factors Nη=N10−9N^{\eta}=N^{10^{-9}} are far below three power savings obtained below. These are N−.00829N^{-.00829}, N−.1317N^{-.1317} and N−.2914N^{-.2914}, one for each term of the bound. It leaves the final saving N−.001N^{-.001} intact. Powers of p0p_{0} are No⁢(1)N^{o(1)}.

Put B=HB=H and Caux=H⁢SC_{\mathrm{aux}}=HS. Then Y≪Z1Y\ll Z_{1}, since Y/Z1≪Nη⁢H2⁢S/N≤N−.008Y/Z_{1}\ll N^{\eta}H^{2}S/N\leq N^{-.008} (see (A.47)). On a nonempty f0f_{0}-block the near-diagonal removal gives F≥c⁢H⁢L−CM/KF\geq cHL^{-C_{M}}/K, hence N⁢Y≥c⁢H2⁢S3⁢Nη⁢L−CM≥Caux⁢B⁢Z1NY\geq cH^{2}S^{3}N^{\eta}L^{-C_{M}}\geq C_{\mathrm{aux}}BZ_{1}. All exponents of B,CauxB,C_{\mathrm{aux}} in Paper I, (2.42), are nonnegative. By (2.42) and (A.43),

J∗2≤No⁢(1)⁢[Nθ⁢(Caux⁢B⁢Z1+N⁢Y)+Caux⁢B⁢Z1⁢(Caux/Z1)2⁢θ+B2⁢Y]⁢Z1⁢F⁢(H∗⁢S)2;J_{*}^{2}\leq N^{o(1)}\bigl{[}N^{\theta}(C_{\mathrm{aux}}BZ_{1}+NY)+C_{\mathrm% {aux}}BZ_{1}(C_{\mathrm{aux}}/Z_{1})^{2\theta}+B^{2}Y\bigr{]}Z_{1}F(H_{*}S)^{2};

the regular spectral product is Caux⁢(Caux⁢B⁢Z1)2⁢θ⁢Z11−θ⁢(B⁢Z1)1−2⁢θ=Caux1+2⁢θ⁢B⁢Z12−2⁢θC_{\mathrm{aux}}(C_{\mathrm{aux}}B\sqrt{Z_{1}})^{2\theta}Z_{1}^{1-\theta}(BZ_{% 1})^{1-2\theta}=C_{\mathrm{aux}}^{1+2\theta}BZ_{1}^{2-2\theta}. With B2<NB^{2}<N, F≪H/KF\ll H/K and (A.32),

(A.45) J∗2H4⁢S6≤N3⁢η+o⁢(1)⁢[LA+LR],LA=Nθ⁢H⁢K⁢S5N2,LR=(HS)2⁢θ⁢H⁢K⁢S5N2.\frac{J_{*}^{2}}{H^{4}S^{6}}\leq N^{3\eta+o(1)}[L_{A}+L_{R}],\qquad L_{A}=% \frac{N^{\theta}HKS^{5}}{N^{2}},\qquad L_{R}=\Bigl{(}\frac{H}{S}\Bigr{)}^{2% \theta}\frac{HKS^{5}}{N^{2}}.

Fix a real tt. Apply the diagonal bound (A.37), Paper I, Theorem 2.8 with the uniform coefficient norm (A.43), and (A.45). The resulting estimate is the same for every real tt. Thus their supremum W4∗W_{4}^{*} satisfies

(A.46) |ℰd|≪Nη+o⁢(1)⁢HK⁢S3/2⁢(W4∗)1/2,W4∗H2⁢S3≪Nη+o⁢(1)⁢H2⁢SN+N3⁢η/2+δX+o⁢(1)⁢(LA+LR)1/2.|\mathcal{E}_{d}|\ll N^{\eta+o(1)}\frac{H}{KS^{3/2}}(W_{4}^{*})^{1/2},\qquad% \frac{W_{4}^{*}}{H^{2}S^{3}}\ll N^{\eta+o(1)}\frac{H^{2}S}{N}+N^{3\eta/2+% \delta_{X}+o(1)}(L_{A}+L_{R})^{1/2}.

All Mellin and colouring costs remain Nη+o⁢(1)N^{\eta+o(1)} as recorded in (A.36). No outer-dependent coefficient enters the norm.

Step 7: exponent reserves

With S≪V1/DS\ll V_{1}/D, K=U1⁢DK=U_{1}D and the three scale conditions, H2⁢S≤H2⁢V1H^{2}S\leq H^{2}V_{1}, K⁢S5≤U1⁢V15KS^{5}\leq U_{1}V_{1}^{5} and H2⁢θ⁢K⁢S5−2⁢θ≤H2⁢θ⁢U1⁢V15−2⁢θH^{2\theta}KS^{5-2\theta}\leq H^{2\theta}U_{1}V_{1}^{5-2\theta}. The smooth part DD only helps. Using U1≤H⁢N−σpU_{1}\leq HN^{-\sigma_{\mathrm{p}}}, V1≤Nv+w+σp/HV_{1}\leq N^{v+w+\sigma_{\mathrm{p}}}/H and U1⁢V1≤NvU_{1}V_{1}\leq N^{v},

(A.47) 1−v−h−σp−w\displaystyle 1-v-h-\sigma_{\mathrm{p}}-w ≥82991000000,\displaystyle\geq\tfrac{8299}{1000000},
2−θ−5⁢v+3⁢h−4⁢(σp+w)\displaystyle 2-\theta-5v+3h-4(\sigma_{\mathrm{p}}+w) ≥65873500000,\displaystyle\geq\tfrac{65873}{500000},
2−(5−2⁢θ)⁢v+(3−4⁢θ)⁢h−(4−2⁢θ)⁢(σp+w)\displaystyle 2-(5-2\theta)v+(3-4\theta)h-(4-2\theta)(\sigma_{\mathrm{p}}+w) ≥1398952948000000,\displaystyle\geq\tfrac{13989529}{48000000},

on 1/3≤h≤23/501/3\leq h\leq 23/50. The first minimum is at h=.46h=.46, the other two at h=1/3h=1/3. These are the savings of H2⁢S/NH^{2}S/N, LAL_{A} and LRL_{R}. Hence H2⁢S/N≤N−.00829H^{2}S/N\leq N^{-.00829}, LA≤N−.1317L_{A}\leq N^{-.1317}, LR≤N−.2914L_{R}\leq N^{-.2914}, and (A.46) gives

(A.48) |ℰd|≤C⁢H2K⁢N−.001.|\mathcal{E}_{d}|\leq C\frac{H^{2}}{K}N^{-.001}.

Summing over the O⁢(D)O(D) values of dd, |ℰ|≤C⁢D⁢H2⁢N−.001/K|\mathcal{E}|\leq CDH^{2}N^{-.001}/K. Its contribution to |𝒮0||\mathcal{S}_{0}| through (A.20) is

[K⁢M⋅M⋅D⁢H2⁢N−.001/K]1/2≤C⁢N⁢D1/2⁢N−.0005≤N1−.0004,\bigl{[}KM\cdot M\cdot DH^{2}N^{-.001}/K\bigr{]}^{1/2}\leq CND^{1/2}N^{-.0005}% \leq N^{1-.0004},

since D≤y=No⁢(1)D\leq y=N^{o(1)}.

Step 8: parameter order and conclusion of (A.16)

Fix AA. Choose P≥2⁢A+20P\geq 2A+20; then CΣC_{\Sigma}; then CM≥max⁡(P+4⁢CΣ+1,P+Cφ)C_{M}\geq\max(P+4C_{\Sigma}+1,\,P+C_{\varphi}). Here CφC_{\varphi} is the absolute exponent with q/φ⁢(q)≤LCφq/\varphi(q)\leq L^{C_{\varphi}}. The smooth weights, η\eta, ϵ\epsilon and ϵ0\epsilon_{0} are fixed numbers. Choose the threshold for NN last. By (A.31) and Step 7,

|𝒮0|≪N⁢L−A−3+N1−σp/8⁢LC,|\mathcal{S}_{0}|\ll NL^{-A-3}+N^{1-\sigma_{\mathrm{p}}/8}L^{C},

since (K/H)1/2≤N−σp/4(K/H)^{1/2}\leq N^{-\sigma_{\mathrm{p}}/4} and z−1/2z^{-1/2} beats every power of LL. Sum over the O⁢(L)O(L) shells of DD and the O⁢(1)O(1) shells of SS, and add Step 2. This proves (A.16), uniformly in f,g,a,bf,g,a,b and the scales. Of ff and gg we used only one-boundedness and the unary support (r⁢s,N)=1(rs,N)=1.

Step 9: the product interval

Let I⊂[N/8,2⁢N]I\subset[N/8,2N] and Cgrid≥1C_{\mathrm{grid}}\geq 1. Divide (H,2⁢H](H,2H] and (M,2⁢M](M,2M] into O⁢(LCgrid)O(L^{C_{\mathrm{grid}}}) consecutive intervals of relative length at most L−CgridL^{-C_{\mathrm{grid}}}. Call a rectangle J1×J2J_{1}\times J_{2} interior if J1⁢J2⊂IJ_{1}J_{2}\subset I, exterior if J1⁢J2∩I=∅J_{1}J_{2}\cap I=\emptyset, and boundary otherwise. On each interior rectangle apply (A.16) to an⁢𝟏J1⁢(n)a_{n}\mathbf{1}_{J_{1}}(n) and bm⁢𝟏J2⁢(m)b_{m}\mathbf{1}_{J_{2}}(m), with saving A+2⁢CgridA+2C_{\mathrm{grid}}. By Step 0 the first array satisfies (6.34) at the original parent HH. For fixed nn, the mm in boundary rectangles lie in O⁢(1)O(1) intervals of total length O⁢(M⁢L−Cgrid)O(ML^{-C_{\mathrm{grid}}}). A modulus q≤4⁢Nvq\leq 4N^{v} has at most τ⁢(q)\tau(q) factorizations q=r⁢sq=rs. Counting mm for each nn,

∑q≤4⁢Nvτ⁢(q)⁢∑n∼H[M⁢L−Cgridq+1+M⁢L−Cgridφ⁢(q)]≪N⁢LC1−Cgrid+H⁢Nv⁢L,\sum_{q\leq 4N^{v}}\tau(q)\sum_{n\sim H}\Bigl{[}\frac{ML^{-C_{\mathrm{grid}}}}% {q}+1+\frac{ML^{-C_{\mathrm{grid}}}}{\varphi(q)}\Bigr{]}\ll NL^{C_{1}-C_{% \mathrm{grid}}}+HN^{v}L,

with a fixed C1C_{1}. The last term saves a fixed power, since h+v≤.9827+o⁢(1)h+v\leq.9827+o(1). Taking Cgrid=A+C1C_{\mathrm{grid}}=A+C_{1} proves (6.45). ∎

A.4. Lemma 6.9

Recall (6.47):

(6.47) Hc⁢Mc≍N,N.50≪Hc≪N.54,Q1≪N.4545,Q2≪N.0682.H_{\mathrm{c}}M_{\mathrm{c}}\asymp N,\qquad N^{.50}\ll H_{\mathrm{c}}\ll N^{.5% 4},\qquad Q_{1}\ll N^{.4545},\qquad Q_{2}\ll N^{.0682}.

Lemma 6.9 (Central rectangular distribution).  Let xx be even and Hc⁢Mc≍xH_{\mathrm{c}}M_{\mathrm{c}}\asymp x. Let the bounds in (6.47) hold with NN replaced by xx, with fixed comparison constants. Let an,bma_{n},b_{m} be one-bounded on the complete dyadic rectangle n∼Hc,m∼Mcn\sim H_{\mathrm{c}},m\sim M_{\mathrm{c}}. Let the tested ana_{n} satisfy (6.34) at its original parent, with one fixed divisor exponent and uniform constants at every requested precision. Write

𝒟⁢(q,a)=∑n∼Hc,m∼Mcan⁢bm⁢(1n⁢m≡a⁢(q)−1(n⁢m,q)=1φ⁢(q)).\mathcal{D}(q,a)=\sum_{n\sim H_{\mathrm{c}},m\sim M_{\mathrm{c}}}a_{n}b_{m}% \left(1_{nm\equiv a\ (q)}-\frac{1_{(nm,q)=1}}{\varphi(q)}\right).

Then, for every fixed A>0A>0,

(6.48) ∑r∼Q1max(b,r)=1⁢∑s∼Q2μ⁢(r⁢s)2=1,(r⁢s,x)=1maxamodr⁢s,(a,r⁢s)=1a≡b⁢(r)⁡|𝒟⁢(r⁢s,a)|≪Ax⁢(log⁡x)−A.\sum_{r\sim Q_{1}}\max_{(b,r)=1}\sum_{\begin{subarray}{c}s\sim Q_{2}\\ \mu(rs)^{2}=1,\ (rs,x)=1\end{subarray}}\max_{\begin{subarray}{c}a\bmod rs,\ (a% ,rs)=1\\ a\equiv b\ (r)\end{subarray}}|\mathcal{D}(rs,a)|\ll_{A}x(\log x)^{-A}.

The constant is uniform over these families, rectangles, squarefree modulus supports and unary interval restrictions of ana_{n} and bmb_{m}. All errors are measured at the original parents. One outer residue bb is chosen before ss varies. In the application it is NmodrN\bmod r.

Write H=HcH=H_{\mathrm{c}}, M=McM=M_{\mathrm{c}}, L=log⁡xL=\log x, ℓ=log⁡log⁡x\ell=\log\log x, z=x1/ℓ3z=x^{1/\ell^{3}}, y=x1/ℓy=x^{1/\ell}. Let c0≥0c_{0}\geq 0 be the fixed divisor exponent in the hypothesis, so that for every D>0D>0, uniformly in intervals I⊂(H,2⁢H]I\subset(H,2H], k,h≥1k,h\geq 1 and (u,k)=1(u,k)=1,

(A.49) |Δa⁢(I;k,u;h)|≤CD⁢H⁢τ⁢(h)c0⁢L−D.|\Delta_{a}(I;k,u;h)|\leq C_{D}H\tau(h)^{c_{0}}L^{-D}.

Since Δa⁢𝟏J⁢(I;k,u;h)=Δa⁢(I∩J;k,u;h)\Delta_{a\mathbf{1}_{J}}(I;k,u;h)=\Delta_{a}(I\cap J;k,u;h), a unary restriction of aa satisfies (A.49) with the same constants. A unary restriction of bb keeps it one-bounded. We may therefore assume that aa and bb are the restricted arrays. We keep (r⁢s,x)=1(rs,x)=1 in (6.48) and throughout the signed residue-difference argument. The individual maxima in (6.48) are nonnegative, but the signed differences in Step 2 are not. Enlarging their support does not preserve order. Every selected coefficient below is extended by zero outside μ⁢(r⁢s)2=1\mu(rs)^{2}=1 and (r⁢s,x)=1(rs,x)=1. On this support (r,s)=1(r,s)=1 and φ⁢(r⁢s)=φ⁢(r)⁢φ⁢(s)\varphi(rs)=\varphi(r)\varphi(s). Throughout, r⁢s≤4⁢Q1⁢Q2≤C⁢xvrs\leq 4Q_{1}Q_{2}\leq Cx^{v} with v=.5227v=.5227, and M≫x.46M\gg x^{.46}.

Step 1: the projected comparator

For t=r⁢st=rs and reduced a≡b(modr)a\equiv b\pmod{r} put St⁢(a)=∑n,man⁢bm⁢𝟏n⁢m≡a⁢(t)S_{t}(a)=\sum_{n,m}a_{n}b_{m}\mathbf{1}_{nm\equiv a\ (t)} and

Δ⁢(a,b;r,s)\displaystyle\Delta(a,b;r,s) =St⁢(a)−φ⁢(r)φ⁢(t)⁢∑(n⁢m,t)=1n⁢m≡b⁢(r)an⁢bm,\displaystyle=S_{t}(a)-\frac{\varphi(r)}{\varphi(t)}\sum_{\begin{subarray}{c}(% nm,t)=1\\ nm\equiv b\ (r)\end{subarray}}a_{n}b_{m},
ℱ⁢(b;r,s)\displaystyle\mathcal{F}(b;r,s) =φ⁢(r)φ⁢(t)⁢∑(n⁢m,t)=1an⁢bm⁢[𝟏n⁢m≡b⁢(r)−1φ⁢(r)].\displaystyle=\frac{\varphi(r)}{\varphi(t)}\sum_{(nm,t)=1}a_{n}b_{m}\Bigl{[}% \mathbf{1}_{nm\equiv b\ (r)}-\frac{1}{\varphi(r)}\Bigr{]}.

Then exactly

(A.50) 𝒟⁢(t,a)=Δ⁢(a,b;r,s)+ℱ⁢(b;r,s).\mathcal{D}(t,a)=\Delta(a,b;r,s)+\mathcal{F}(b;r,s).

With an(s)=an⁢𝟏(n,s)=1a^{(s)}_{n}=a_{n}\mathbf{1}_{(n,s)=1},

(A.51) ℱ⁢(b;r,s)=1φ⁢(s)⁢∑m∼M(m,r⁢s)=1bm⁢Δa(s)⁢(r,b⁢m¯).\mathcal{F}(b;r,s)=\frac{1}{\varphi(s)}\sum_{\begin{subarray}{c}m\sim M\\ (m,rs)=1\end{subarray}}b_{m}\Delta_{a^{(s)}}(r,b\overline{m}).

Mean square for a(s)a^{(s)}. The identity Δa(s)⁢(I;k,u;h)=Δa⁢(I;k,u;s⁢h)\Delta_{a^{(s)}}(I;k,u;h)=\Delta_{a}(I;k,u;sh) and (A.2) give

|Δa(s)⁢(I;k,u;h)|≤CD⁢H⁢τ⁢(s)c0⁢τ⁢(h)c0⁢L−D.|\Delta_{a^{(s)}}(I;k,u;h)|\leq C_{D}H\tau(s)^{c_{0}}\tau(h)^{c_{0}}L^{-D}.

Put hs=a(s)/τ⁢(s)c0h_{s}=a^{(s)}/\tau(s)^{c_{0}}, which is one-bounded, and en=𝟏H<n≤2⁢He_{n}=\mathbf{1}_{H<n\leq 2H}. By the parallelogram identity ‖hs+e‖2+‖hs−e‖2≥2⁢‖e‖2\|h_{s}+e\|^{2}+\|h_{s}-e\|^{2}\geq 2\|e\|^{2}, there is εs∈{±1}\varepsilon_{s}\in\{\pm 1\} with

gs=hs+εs⁢e,‖gs‖22≥‖e‖22≥H/2,‖gs‖22≤4⁢‖e‖22≤8⁢H.g_{s}=h_{s}+\varepsilon_{s}e,\qquad\|g_{s}\|_{2}^{2}\geq\|e\|_{2}^{2}\geq H/2,% \qquad\|g_{s}\|_{2}^{2}\leq 4\|e\|_{2}^{2}\leq 8H.

Let Z=⌈2⁢H⌉Z=\lceil 2H\rceil and c1=max⁡(c0,1)c_{1}=\max(c_{0},1). By (A.49) for hsh_{s}, by (A.6) for ee, and since H≤21/2⁢‖gs‖2⁢Z1/2H\leq 2^{1/2}\|g_{s}\|_{2}Z^{1/2} and ‖e‖2⁢Z1/2≥H/2\|e\|_{2}Z^{1/2}\geq H/2, both gsg_{s} and ee satisfy (6.35) with Bdiv=c1B_{\rm div}=c_{1}. The constants are independent of ss, the sign and the restriction. Here log⁡(2⁢Z)≍L\log(2Z)\asymp L, as H≫x.50H\gg x^{.50}. Lemma 6.5(i) applies to both. Since Δa(s)=τ⁢(s)c0⁢(Δgs−εs⁢Δe)\Delta_{a^{(s)}}=\tau(s)^{c_{0}}(\Delta_{g_{s}}-\varepsilon_{s}\Delta_{e}) and |u−w|2≤2⁢|u|2+2⁢|w|2|u-w|^{2}\leq 2|u|^{2}+2|w|^{2}, for every fixed S0>0S_{0}>0,

(A.52) ∑k≤2⁢Q1V⁢(k;a(s))≪S0τ⁢(s)2⁢c0⁢H2⁢L−S0.\sum_{k\leq 2Q_{1}}V(k;a^{(s)})\ll_{S_{0}}\tau(s)^{2c_{0}}H^{2}L^{-S_{0}}.

The range condition 2⁢Q1≤Z⁢(log⁡Z)−B1⁢(S0)2Q_{1}\leq Z(\log Z)^{-B_{1}(S_{0})} holds for large xx, because Q1/H≪x.4545−.50Q_{1}/H\ll x^{.4545-.50}.

Bound for ℱ\mathcal{F}. Each reduced class modulo rr contains at most M/r+1M/r+1 values m∼Mm\sim M. The map m↦b⁢m¯m\mapsto b\overline{m} permutes the reduced classes. Cauchy’s inequality in (A.51) gives, uniformly in bb,

|∑mbm⁢Δa(s)⁢(r,b⁢m¯)|2≤2⁢M⁢(Mr+1)⁢V⁢(r;a(s)).\Bigl{|}\sum_{m}b_{m}\Delta_{a^{(s)}}(r,b\overline{m})\Bigr{|}^{2}\leq 2M\Bigl% {(}\frac{M}{r}+1\Bigr{)}V(r;a^{(s)}).

Cauchy’s inequality over r∼Q1r\sim Q_{1} and (A.52) then give

∑r∼Q1maxb⁡|∑mbm⁢Δa(s)⁢(r,b⁢m¯)|≪[Q1⁢M⁢(M/Q1+1)⁢τ⁢(s)2⁢c0⁢H2⁢L−S0]1/2≪τ⁢(s)c0⁢H⁢M⁢L−S0/2,\sum_{r\sim Q_{1}}\max_{b}\Bigl{|}\sum_{m}b_{m}\Delta_{a^{(s)}}(r,b\overline{m% })\Bigr{|}\ll\bigl{[}Q_{1}M(M/Q_{1}+1)\tau(s)^{2c_{0}}H^{2}L^{-S_{0}}\bigr{]}^% {1/2}\ll\tau(s)^{c_{0}}HML^{-S_{0}/2},

since Q1≤MQ_{1}\leq M by a fixed power. Summing over ss with (A.2) and (A.1),

(A.53) ∑r∼Q1max(b,r)=1⁢∑s∼Q2|ℱ⁢(b;r,s)|≪x⁢L−S0/2⁢∑s≤2⁢Q2τ⁢(s)c0φ⁢(s)≪Ax⁢L−A,\sum_{r\sim Q_{1}}\max_{(b,r)=1}\sum_{s\sim Q_{2}}|\mathcal{F}(b;r,s)|\ll xL^{% -S_{0}/2}\sum_{s\leq 2Q_{2}}\frac{\tau(s)^{c_{0}}}{\varphi(s)}\ll_{A}xL^{-A},

choosing S0S_{0} after AA (the full order is fixed in Step 8).

Step 2: residue differences

For coprime r,sr,s there are exactly φ⁢(s)\varphi(s) reduced lifts a′modta^{\prime}\bmod t of bmodrb\bmod r. Every n⁢mnm coprime to tt with n⁢m≡b⁢(r)nm\equiv b\ (r) lies in exactly one of them. Hence

(A.54) Δ⁢(a,b;r,s)=1φ⁢(s)⁢∑a′modt,(a′,t)=1a′≡b⁢(r)[St⁢(a)−St⁢(a′)].\Delta(a,b;r,s)=\frac{1}{\varphi(s)}\sum_{\begin{subarray}{c}a^{\prime}\bmod t% ,\ (a^{\prime},t)=1\\ a^{\prime}\equiv b\ (r)\end{subarray}}\bigl{[}S_{t}(a)-S_{t}(a^{\prime})\bigr{% ]}.

For each rr, choose one reduced class br(modr)b_{r}\pmod{r} maximizing the masked sum of the projected differences, before ss varies. For each ss with μ⁢(r⁢s)2=1\mu(rs)^{2}=1 and (r⁢s,x)=1(rs,x)=1, choose a reduced lift ar,sa_{r,s} maximizing |Δ⁢(a,br;r,s)||\Delta(a,b_{r};r,s)|. By (A.54) and the triangle inequality, some reduced lift ar,s′≡br(modr)a^{\prime}_{r,s}\equiv b_{r}\pmod{r} satisfies

|Sr⁢s⁢(ar,s)−Sr⁢s⁢(ar,s′)|≥|Δ⁢(ar,s,br;r,s)|.|S_{rs}(a_{r,s})-S_{rs}(a^{\prime}_{r,s})|\geq|\Delta(a_{r,s},b_{r};r,s)|.

Choose |γr,s|=1|\gamma_{r,s}|=1 to make this difference nonnegative real, and put γr,s=0\gamma_{r,s}=0 outside the masked squarefree support. By (A.50), (A.53) and (A.54), it suffices to prove, uniformly for all these residues and phases,

(A.55) 𝒵0(x)=∑r∼Q1∑s∼Q2μ⁢(r⁢s)2=1(r⁢s,x)=1γr,s⁢[Sr⁢s⁢(ar,s)−Sr⁢s⁢(ar,s′)]≪Ax⁢L−A.\mathcal{Z}_{0}^{(x)}=\sum_{r\sim Q_{1}}\sum_{\begin{subarray}{c}s\sim Q_{2}\\ \mu(rs)^{2}=1\\ (rs,x)=1\end{subarray}}\gamma_{r,s}\bigl{[}S_{rs}(a_{r,s})-S_{rs}(a^{\prime}_{% r,s})\bigr{]}\ll_{A}xL^{-A}.

This signed sum keeps the original mask.

Step 3: large smooth parts and large divisor functions

We quote the completed-hyperbola lemma of Paper I:

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 Weil–Estermann bound [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).

For (A.56), set the lemma’s q=t=r⁢sq=t=rs, J1=(H,2⁢H]∩ℤJ_{1}=(H,2H]\cap\mathbb{Z}, J2=(M,2⁢M]∩ℤJ_{2}=(M,2M]\cap\mathbb{Z}, and take c=ac=a or c=a′c=a^{\prime}. Both are units modulo tt by the reduced-lift condition. Here Ji∗={u∈Ji:(u,t)=1}J_{i}^{*}=\{u\in J_{i}:(u,t)=1\}. The source’s 𝒟\mathcal{D} is an unweighted counting discrepancy. It differs from our weighted 𝒟⁢(t,a)\mathcal{D}(t,a). Define

Ct⁢(c)=#⁢{(n,m)∈J1×J2:n⁢m≡c(modt)}.C_{t}(c)=\#\{(n,m)\in J_{1}\times J_{2}:nm\equiv c\pmod{t}\}.

The quoted lemma gives Ct⁢(c)≤#⁢J1∗⁢#⁢J2∗/φ⁢(t)+O⁢(Et)C_{t}(c)\leq\#J_{1}^{*}\#J_{2}^{*}/\varphi(t)+O(E_{t}), where Et=τ⁢(t)⁢t1/2⁢log2⁡(2⁢t)+τ⁢(t)2⁢log2⁡(2⁢t)/φ⁢(t)E_{t}=\tau(t)t^{1/2}\log^{2}(2t)+\tau(t)^{2}\log^{2}(2t)/\varphi(t). Since |an|,|bm|≤1|a_{n}|,|b_{m}|\leq 1, one has |St⁢(c)|≤Ct⁢(c)|S_{t}(c)|\leq C_{t}(c). This is the only passage from unweighted counts to the arbitrary complex arrays. Every pair counted has (n⁢m,t)=1(nm,t)=1 automatically because cc is a unit. No coprimality hypothesis on the arrays is inferred. Consequently,

(A.56) |St⁢(a)−St⁢(a′)|≤Ct⁢(a)+Ct⁢(a′)≤2⁢#⁢J1∗⁢#⁢J2∗φ⁢(t)+O⁢(Et)≤8⁢C⁢xφ⁢(t)+O⁢(Et),|S_{t}(a)-S_{t}(a^{\prime})|\leq C_{t}(a)+C_{t}(a^{\prime})\leq\frac{2\#J_{1}^% {*}\#J_{2}^{*}}{\varphi(t)}+O(E_{t})\leq\frac{8Cx}{\varphi(t)}+O(E_{t}),

using H⁢M≤C⁢xHM\leq Cx. The mask (t,x)=1(t,x)=1 remains on the summation support but is not a hypothesis of Lemma 3.4. In the smooth-part and divisor-function eliminations below, we first take absolute values termwise. Only then are the nonnegative majorants enlarged. Write s=k⁢ϱs=k\varrho with P+⁢(k)≤z<P−⁢(ϱ)P^{+}(k)\leq z<P^{-}(\varrho). If k≥yk\geq y, then the zz-smooth part of tt is at least yy. A given tt has at most τ⁢(t)\tau(t) factorizations t=r⁢st=rs. By (A.56), (A.2), (A.1) and (A.7), the sum of the absolute values of these masked terms in 𝒵0(x)\mathcal{Z}_{0}^{(x)} is at most

≪x⁢∑h′≤C⁢xvτ⁢(h′)2h′⁢∑d′≥yP+⁢(d′)≤zτ⁢(d′)2d′+∑t≤C⁢xvτ⁢(t)⁢Et≪Ax⁢L−A+x3⁢v/2⁢LK,\ll x\sum_{h^{\prime}\leq Cx^{v}}\frac{\tau(h^{\prime})^{2}}{h^{\prime}}\sum_{% \begin{subarray}{c}d^{\prime}\geq y\\ P^{+}(d^{\prime})\leq z\end{subarray}}\frac{\tau(d^{\prime})^{2}}{d^{\prime}}+% \sum_{t\leq Cx^{v}}\tau(t)E_{t}\ll_{A}xL^{-A}+x^{3v/2}L^{K},

and 3⁢v/2=.78405<13v/2=.78405<1. In the same way the pairs with τ⁢(r⁢s)>LDτ\tau(rs)>L^{D_{\tau}} contribute

≪x⁢L−Dτ⁢∑t≤C⁢xvτ⁢(t)3t+x3⁢v/2⁢LK≪x⁢LK′−Dτ+x3⁢v/2⁢LK.\ll xL^{-D_{\tau}}\sum_{t\leq Cx^{v}}\frac{\tau(t)^{3}}{t}+x^{3v/2}L^{K}\ll xL% ^{K^{\prime}-D_{\tau}}+x^{3v/2}L^{K}.

Choose Dτ=Dτ⁢(A)≥K′+AD_{\tau}=D_{\tau}(A)\geq K^{\prime}+A after the requested precision AA. From now on k<yk<y, and every remaining modulus and every divisor of it has τ≤LDτ\tau\leq L^{D_{\tau}}.

Step 4: the first Cauchy square

Rename the outer modulus rr as q∼Q:=Q1q\sim Q:=Q_{1} and write the inner one as s=k⁢rs=kr, with k∼K≤yk\sim K\leq y smooth and r∼Rr\sim R squarefree and zz-rough. Then K⁢R≍Q2KR\asymp Q_{2}. On the support of (A.55), q,k,rq,k,r are pairwise coprime and squarefree, (q⁢k⁢r,x)=1(qkr,x)=1, and Q⁢K⁢R≪xvQKR\ll x^{v}. There are O⁢(L2)O(L^{2}) choices of (K,R)(K,R). Extend the selected coefficients by zero and put

Γq⁢k⁢r=γq,k⁢r⁢ 1μ⁢(q⁢k⁢r)2=1⁢𝟏(q⁢k⁢r,x)=1,|Γq⁢k⁢r|≤1.\Gamma_{qkr}=\gamma_{q,kr}\,\mathbf{1}_{\mu(qkr)^{2}=1}\mathbf{1}_{(qkr,x)=1},% \qquad|\Gamma_{qkr}|\leq 1.

The Γq⁢k⁢r\Gamma_{qkr} are identical in both choices a,a′a,a^{\prime} of residue. For one shell the masked signed sum is

𝒵(x)=∑q∼Q,k∼K(q⁢k,x)=1∑mbm⁢∑r∼R,n(r,x)=1Γq⁢k⁢r⁢an⁢[𝟏m⁢n≡aq⁢k⁢r⁢(q⁢k⁢r)−𝟏m⁢n≡aq⁢k⁢r′⁢(q⁢k⁢r)],\mathcal{Z}^{(x)}=\sum_{\begin{subarray}{c}q\sim Q,\ k\sim K\\ (qk,x)=1\end{subarray}}\sum_{m}b_{m}\sum_{\begin{subarray}{c}r\sim R,\ n\\ (r,x)=1\end{subarray}}\Gamma_{qkr}a_{n}\bigl{[}\mathbf{1}_{mn\equiv a_{qkr}\ (% qkr)}-\mathbf{1}_{mn\equiv a^{\prime}_{qkr}\ (qkr)}\bigr{]},

where aq⁢k⁢r≡aq⁢k⁢r′≡bq(modq)a_{qkr}\equiv a^{\prime}_{qkr}\equiv b_{q}\pmod{q} and bqb_{q} does not depend on k,rk,r. Put

ℱq⁢k(x)⁢(m)=∑r∼R,n(r,x)=1Γq⁢k⁢r⁢an⁢[𝟏m⁢n≡aq⁢k⁢r⁢(q⁢k⁢r)−𝟏m⁢n≡aq⁢k⁢r′⁢(q⁢k⁢r)].\mathcal{F}^{(x)}_{qk}(m)=\sum_{\begin{subarray}{c}r\sim R,\ n\\ (r,x)=1\end{subarray}}\Gamma_{qkr}a_{n}\bigl{[}\mathbf{1}_{mn\equiv a_{qkr}\ (% qkr)}-\mathbf{1}_{mn\equiv a^{\prime}_{qkr}\ (qkr)}\bigr{]}.

With ψ\psi as in Step 3 of the proof of Lemma 6.8,

(A.57) |𝒵(x)|2≪Q⁢K⁢M⁢∑q∼Q,k∼K(q⁢k,x)=1∑mψ⁢(m/M)⁢|ℱq⁢k(x)⁢(m)|2.|\mathcal{Z}^{(x)}|^{2}\ll QKM\sum_{\begin{subarray}{c}q\sim Q,\ k\sim K\\ (qk,x)=1\end{subarray}}\sum_{m}\psi(m/M)|\mathcal{F}^{(x)}_{qk}(m)|^{2}.

For Ai=Ai⁢(q,k,ri)A_{i}=A_{i}(q,k,r_{i}) chosen from aq⁢k⁢ri,aq⁢k⁢ri′a_{qkr_{i}},a^{\prime}_{qkr_{i}}, the four correlations, with signs +,−,−,++,-,-,+, are precisely

𝒞x⁢(A1,A2)=\displaystyle\mathcal{C}_{x}(A_{1},A_{2})={} ∑q∼Q,k∼K(q⁢k,x)=1∑mψ⁢(m/M)⁢∑r1,r2∼R(r1⁢r2,x)=1Γq⁢k⁢r1⁢Γq⁢k⁢r2¯\displaystyle\sum_{\begin{subarray}{c}q\sim Q,\ k\sim K\\ (qk,x)=1\end{subarray}}\sum_{m}\psi(m/M)\sum_{\begin{subarray}{c}r_{1},r_{2}% \sim R\\ (r_{1}r_{2},x)=1\end{subarray}}\Gamma_{qkr_{1}}\overline{\Gamma_{qkr_{2}}}
×∑n1,n2an1an2¯𝟏m⁢n1≡A1⁢(q⁢k⁢r1)𝟏m⁢n2≡A2⁢(q⁢k⁢r2).\displaystyle\qquad\times\sum_{n_{1},n_{2}}a_{n_{1}}\overline{a_{n_{2}}}% \mathbf{1}_{mn_{1}\equiv A_{1}\ (qkr_{1})}\mathbf{1}_{mn_{2}\equiv A_{2}\ (qkr% _{2})}.

We prove at arbitrary fixed precision P>0P>0 that

(A.58) 𝒞x⁢(A1,A2)=M⁢Tx+OP⁢(M⁢H2Q⁢K⁢LP),\mathcal{C}_{x}(A_{1},A_{2})=MT_{x}+O_{P}\Bigl{(}\frac{MH^{2}}{QKL^{P}}\Bigr{)},

where M⁢TxMT_{x} contains the same mask and selected coefficients. It is independent of the choices of A1,A2A_{1},A_{2}. Since the coefficients and support are the same in all four correlations, their main terms cancel. Equation (A.57) then gives |𝒵(x)|≪x⁢L−P/2|\mathcal{Z}^{(x)}|\ll xL^{-P/2} before the O⁢(L2)O(L^{2}) shell sum.

Write g=(r1,r2)g=(r_{1},r_{2}), r1=g⁢ur_{1}=gu, r2=g⁢vr_{2}=gv, (u,v)=1(u,v)=1, with g∼Gg\sim G dyadic. Put d0=q⁢k⁢gd_{0}=qkg and U=R/GU=R/G. Then q,k,g,u,vq,k,g,u,v are pairwise coprime. The product of the two Γ\Gamma-supports imposes (q⁢k⁢g⁢u⁢v,x)=1(qkguv,x)=1. This modulus-only restriction remains in the correlation and its zero mode. It may be omitted only from a termwise absolute-value majorant. It may not be omitted from a signed expression or from an inner sum before squaring. The two congruences m⁢n1≡A1⁢(d0⁢u)mn_{1}\equiv A_{1}\ (d_{0}u), m⁢n2≡A2⁢(d0⁢v)mn_{2}\equiv A_{2}\ (d_{0}v) are soluble exactly when

(A.59) n2≡A2⁢A1¯⁢n1(modd0),(n1,d0⁢u)=(n2,d0⁢v)=1,n_{2}\equiv A_{2}\overline{A_{1}}\,n_{1}\pmod{d_{0}},\qquad(n_{1},d_{0}u)=(n_{% 2},d_{0}v)=1,

and then mm lies in one reduced class modulo l=d0⁢u⁢vl=d_{0}uv. Modulo qq both residues equal bqb_{q}, so n2≡n1(modq)n_{2}\equiv n_{1}\pmod{q}.

Step 5: large common factor

Let G≥H/(Q⁢K⁢LCg)G\geq H/(QKL^{C_{g}}), with CgC_{g} fixed later. The target is ℬ=M⁢H2/(Q⁢K)≍x⁢H/(Q⁢K)\mathcal{B}=MH^{2}/(QK)\asymp xH/(QK). In the large-GG estimate we first take absolute values of each weighted correlation term. Hence its nonnegative counting majorant may be enlarged to all (q,k,g,u,v)(q,k,g,u,v), while 𝒞x\mathcal{C}_{x} itself stays masked. For fixed (q,k,g,u,v)(q,k,g,u,v) the pairs (n1,n2)(n_{1},n_{2}) in (A.59) lie in a congruence lattice of determinant d0d_{0}. Let 𝐰\mathbf{w} be a shortest nonzero vector. If the line ℝ⁢𝐰\mathbb{R}\mathbf{w} meets the positive rectangle, choose its sign so its coordinates are positive; otherwise the β=0\beta=0 contribution is empty. Complete it to a reduced basis (𝐰,𝐰′)(\mathbf{w},\mathbf{w}^{\prime}). The component of 𝐰′\mathbf{w}^{\prime} orthogonal to 𝐰\mathbf{w} has length h⟂=d0/|𝐰|≥3⁢|𝐰|/2h_{\perp}=d_{0}/|\mathbf{w}|\geq\sqrt{3}|\mathbf{w}|/2. In a disc of radius C⁢HCH the points α⁢𝐰+β⁢𝐰′\alpha\mathbf{w}+\beta\mathbf{w}^{\prime} with β≠0\beta\neq 0 have |β|≪H/h⟂|\beta|\ll H/h_{\perp} and, for fixed β\beta, O⁢(H/|𝐰|+1)O(H/|\mathbf{w}|+1) values of α\alpha. Such points exist only if h⟂≪Hh_{\perp}\ll H. Then |𝐰|≪h⟂≪H|\mathbf{w}|\ll h_{\perp}\ll H and (H/h⟂)2≪H2/d0(H/h_{\perp})^{2}\ll H^{2}/d_{0}, so they number O⁢(H2/d0)O(H^{2}/d_{0}). Each such pair has O⁢(M/l+1)O(M/l+1) values of mm. Hence these points contribute

≪Q⁢K⁢G⁢U2⋅H2Q⁢K⁢G⁢(1+MQ⁢K⁢G⁢U2)=H2⁢U2+M⁢H2Q⁢K⁢G.\ll QKGU^{2}\cdot\frac{H^{2}}{QKG}\Bigl{(}1+\frac{M}{QKGU^{2}}\Bigr{)}=H^{2}U^% {2}+\frac{MH^{2}}{QKG}.

For β=0\beta=0, (n1,n2)=α⁢𝐰(n_{1},n_{2})=\alpha\mathbf{w} with α≥1\alpha\geq 1, and the two congruences fix α⁢m≤C⁢x\alpha m\leq Cx in one unit class c(modl)c\pmod{l}. Here l=d0⁢u⁢v=q⁢k⁢g⁢u⁢v≥1l=d_{0}uv=qkguv\geq 1, and cc is a unit. Each original congruence has a unit right-hand side AiA_{i}. Hence mm and α\alpha are units modulo every factor of ll on this line. For X≤C⁢xX\leq Cx, cover the positive integer hyperbola α⁢m≤X\alpha m\leq X by the O⁢(L)O(L) integer rectangles J1,0={1}J_{1,0}=\{1\}, J2,0=[1,⌊X⌋]J_{2,0}=[1,\lfloor X\rfloor], and, for j≥1j\geq 1 with 2j−1<X2^{j-1}<X,

J1,j=(2j−1,2j]∩ℤ,J2,j=[1,⌊X/2j−1⌋]∩ℤ.J_{1,j}=(2^{j-1},2^{j}]\cap\mathbb{Z},\qquad J_{2,j}=[1,\lfloor X/2^{j-1}% \rfloor]\cap\mathbb{Z}.

These rectangles may overcount. This is harmless for the positive quantity ∑e≤X,e≡c⁢(l)τ⁢(e)\sum_{e\leq X,e\equiv c\ (l)}\tau(e). Each has #⁢J1,j⁢#⁢J2,j≪X\#J_{1,j}\#J_{2,j}\ll X, and their number is O⁢(L)O(L). Apply the quoted Paper I, Lemma 3.4 with its modulus q=lq=l, unit cc, and these two integer intervals. Empty intervals contribute zero. The positive counts give, uniformly in cc and XX,

(A.60) ∑e≤Xe≡c⁢(l)τ⁢(e)≪X⁢Lφ⁢(l)+[τ⁢(l)⁢l1/2+τ⁢(l)2φ⁢(l)]⁢L3\sum_{\begin{subarray}{c}e\leq X\\ e\equiv c\ (l)\end{subarray}}\tau(e)\ll\frac{XL}{\varphi(l)}+\Bigl{[}\tau(l)l^% {1/2}+\frac{\tau(l)^{2}}{\varphi(l)}\Bigr{]}L^{3}

uniformly in the unit cc and X≤C⁢xX\leq Cx. A modulus ll has at most τ5⁢(l)≤τ⁢(l)4\tau_{5}(l)\leq\tau(l)^{4} representations l=q⁢k⁢g⁢u⁢vl=qkguv. Summing (A.60) with (A.1),

≪x⁢LC+(Q⁢K⁢G⁢U2)3/2⁢LC.\ll xL^{C}+(QKGU^{2})^{3/2}L^{C}.

With W=Q⁢K≤x.4545+o⁢(1)W=QK\leq x^{.4545+o(1)}, R≪x.0682R\ll x^{.0682} and W⁢R≪x.5227WR\ll x^{.5227}, on this range of GG,

M⁢H2/(Q⁢K⁢G)ℬ=1G≤x−.0455+o⁢(1),H2⁢U2ℬ≪W3⁢R2⁢L2⁢Cgx⁢H≤x−.0001+o⁢(1),xℬ≤x−.0455+o⁢(1),\frac{MH^{2}/(QKG)}{\mathcal{B}}=\frac{1}{G}\leq x^{-.0455+o(1)},\quad\frac{H^% {2}U^{2}}{\mathcal{B}}\ll\frac{W^{3}R^{2}L^{2C_{g}}}{xH}\leq x^{-.0001+o(1)},% \quad\frac{x}{\mathcal{B}}\leq x^{-.0455+o(1)},

and (Q⁢K⁢G⁢U2)3/2≤(W2⁢R2⁢LCg/H)3/2≤x.8181+o⁢(1)(QKGU^{2})^{3/2}\leq(W^{2}R^{2}L^{C_{g}}/H)^{3/2}\leq x^{.8181+o(1)}, while ℬ≥x1.0455−o⁢(1)\mathcal{B}\geq x^{1.0455-o(1)}. So the large-GG part of 𝒞x\mathcal{C}_{x} is O⁢(ℬ⁢L−P)O(\mathcal{B}L^{-P}) at any requested fixed precision PP. The mask was removed only after taking absolute values.

Step 6: small common factor, Poisson and the zero mode

Let G<H/(Q⁢K⁢LCg)G<H/(QKL^{C_{g}}). For one class cmodlc\bmod l,

(A.61) ∑m≡c⁢(l)ψ⁢(mM)=Ml⁢∑h∈ℤψ^⁢(h⁢Ml)⁢e⁢(h⁢cl),\sum_{m\equiv c\ (l)}\psi\Bigl{(}\frac{m}{M}\Bigr{)}=\frac{M}{l}\sum_{h\in% \mathbb{Z}}\hat{\psi}\Bigl{(}\frac{hM}{l}\Bigr{)}e\Bigl{(}\frac{hc}{l}\Bigr{)},

and the terms |h|>xη⁢l/M|h|>x^{\eta}l/M contribute O⁢(x−100)O(x^{-100}) per tuple. We take η=10−8\eta=10^{-8}.

The zero mode is M⁢ψ^⁢(0)/lM\hat{\psi}(0)/l times the weighted number of compatible (n1,n2)(n_{1},n_{2}). It still carries the product of the two Γ\Gamma-supports, and thus (q⁢k⁢g⁢u⁢v,x)=1(qkguv,x)=1. After taking absolute values of the error, its positive majorant can be enlarged. This is the only use of the unmasked range in (A.62). Put fv=a⁢𝟏(n,v)=1f_{v}=a\mathbf{1}_{(n,v)=1}. For fixed n1n_{1}, the n2n_{2}-sum in (A.59) is a sum of fv¯\overline{f_{v}} over one reduced class c⁢(n1)c(n_{1}) modulo d0d_{0}. Replace it by φ⁢(d0)−1⁢∑(n2,d0⁢v)=1an2¯\varphi(d_{0})^{-1}\sum_{(n_{2},d_{0}v)=1}\overline{a_{n_{2}}}. The error is Δfv⁢(d0,c⁢(n1))¯\overline{\Delta_{f_{v}}(d_{0},c(n_{1}))}. The map n1↦c⁢(n1)n_{1}\mapsto c(n_{1}) hits each reduced class O⁢(H/d0)O(H/d_{0}) times, so Cauchy’s inequality gives

∑n1|Δfv⁢(d0,c⁢(n1))|≪H⁢d0−1/2⁢V⁢(d0;fv)1/2.\sum_{n_{1}}|\Delta_{f_{v}}(d_{0},c(n_{1}))|\ll Hd_{0}^{-1/2}V(d_{0};f_{v})^{1% /2}.

A given d0d_{0} has at most τ3⁢(d0)≤L2⁢Dτ\tau_{3}(d_{0})\leq L^{2D_{\tau}} representations, and d0≍D0=Q⁢K⁢Gd_{0}\asymp D_{0}=QKG. Multiplying by M/(d0⁢u⁢v)M/(d_{0}uv) and summing over u,vu,v, the zero-mode error is

(A.62) ≪M⁢HD0⁢L2⁢Dτ⁢supv[∑d0≤C′⁢D0V⁢(d0;fv)]1/2.\ll\frac{MH}{D_{0}}L^{2D_{\tau}}\sup_{v}\Bigl{[}\sum_{d_{0}\leq C^{\prime}D_{0% }}V(d_{0};f_{v})\Bigr{]}^{1/2}.

Since vv divides a remaining modulus, τ⁢(v)≤LDτ\tau(v)\leq L^{D_{\tau}}. The identity Δfv⁢(I;k,u;h)=Δa⁢(I;k,u;v⁢h)\Delta_{f_{v}}(I;k,u;h)=\Delta_{a}(I;k,u;vh) and (A.49) show that fvf_{v} satisfies (A.49) at precision D−c0⁢DτD-c_{0}D_{\tau}. As in Step 1, add εv⁢e\varepsilon_{v}e to make the norm at least (H/2)1/2(H/2)^{1/2}. Both sequences satisfy (6.35) with Bdiv=c1B_{\rm div}=c_{1} and uniform constants. Lemma 6.5(i) and linearity give, uniformly in vv,

∑d0≤C′⁢D0V⁢(d0;fv)≪S0H2⁢L−S0,\sum_{d_{0}\leq C^{\prime}D_{0}}V(d_{0};f_{v})\ll_{S_{0}}H^{2}L^{-S_{0}},

because C′⁢D0≤C′⁢H/LCg≤Z⁢(log⁡Z)−B1⁢(S0)C^{\prime}D_{0}\leq C^{\prime}H/L^{C_{g}}\leq Z(\log Z)^{-B_{1}(S_{0})} once Cg>B1⁢(S0)+1C_{g}>B_{1}(S_{0})+1. With Dτ=Dτ⁢(A)D_{\tau}=D_{\tau}(A) fixed in Step 3, choose first S0>4⁢Dτ+2⁢AS_{0}>4D_{\tau}+2A, then Cg>B1⁢(S0)+1C_{g}>B_{1}(S_{0})+1, then the threshold for xx. Since D0≥c⁢Q⁢KD_{0}\geq cQK, (A.62) is O⁢(ℬ⁢L2⁢Dτ−S0/2)=O⁢(ℬ⁢L−A)O(\mathcal{B}L^{2D_{\tau}-S_{0}/2})=O(\mathcal{B}L^{-A}).

What remains of the zero mode is the masked main term

(A.63) M⁢Tx,G=M⁢ψ^⁢(0)⁢∑q,k,g,u,v(q⁢k⁢g⁢u⁢v,x)=1Γq⁢k⁢g⁢u⁢Γq⁢k⁢g⁢v¯⁢[∑(n1,d0⁢u)=1an1]⁢[∑(n2,d0⁢v)=1an2¯]d0⁢u⁢v⁢φ⁢(d0),MT_{x,G}=M\hat{\psi}(0)\sum_{\begin{subarray}{c}q,k,g,u,v\\ (qkguv,x)=1\end{subarray}}\Gamma_{qkgu}\overline{\Gamma_{qkgv}}\frac{\bigl{[}% \sum_{(n_{1},d_{0}u)=1}a_{n_{1}}\bigr{]}\bigl{[}\sum_{(n_{2},d_{0}v)=1}% \overline{a_{n_{2}}}\bigr{]}}{d_{0}uv\varphi(d_{0})},

with the previously imposed coprime/squarefree and dyadic conditions understood. This expression depends on the modulus support and Γ\Gamma, but not on A1,A2A_{1},A_{2}. Put M⁢Tx=∑G⁢smallM⁢Tx,GMT_{x}=\sum_{G\ \rm small}MT_{x,G}.

Step 7: the second square

It remains to bound the frequencies h≠0h\neq 0 in the masked correlation. Write

Ml=MQ⁢K⁢G⁢U2⋅Q⁢K⁢G⁢U2q⁢k⁢g⁢u⁢v;\frac{M}{l}=\frac{M}{QKGU^{2}}\cdot\frac{QKGU^{2}}{qkguv};

the second factor is a product of bounded weights in (q,k,g)(q,k,g), in uu and in vv. The mask factors exactly as

𝟏(q⁢k⁢g⁢u⁢v,x)=1=𝟏(q⁢k⁢g,x)=1⁢𝟏(u,x)=1⁢𝟏(v,x)=1.\mathbf{1}_{(qkguv,x)=1}=\mathbf{1}_{(qkg,x)=1}\mathbf{1}_{(u,x)=1}\mathbf{1}_% {(v,x)=1}.

Keep the first factor with the outer (q,k,g,n1,n2)(q,k,g,n_{1},n_{2}) data and the last two with the (u,v,h)(u,v,h)-sum, together with Γq⁢k⁢g⁢u⁢Γq⁢k⁢g⁢v¯\Gamma_{qkgu}\overline{\Gamma_{qkgv}}. No masked term is reintroduced into a signed sum.

Every zz-rough u,v≤x2u,v\leq x^{2} has O⁢(ℓ3)O(\ell^{3}) prime factors. Colour each prime below x2x^{2} red or blue independently. A coprime pair (u,v)(u,v) is covered if all primes of uu are red and all of vv blue. This has probability at least 2−O⁢(ℓ3)2^{-O(\ell^{3})}. With J0=⌈2O⁢(ℓ3)⁢(10⁢log⁡x+1)⌉J_{0}=\lceil 2^{O(\ell^{3})}(10\log x+1)\rceil independent colourings, the probability that one of the at most x4x^{4} pairs is never covered is <1<1. Fix such a list and assign each pair to its first covering colouring. This partitions the coprime pairs into J≤J0=xo⁢(1)J\leq J_{0}=x^{o(1)} classes, and (u⁢u′,v⁢v′)=1(uu^{\prime},vv^{\prime})=1 for any two pairs in one class.

On one class let 𝒴\mathcal{Y} be the sum over compatible (n1,n2)(n_{1},n_{2}), (u,v)(u,v) and 0<|h|≤𝖥0<|h|\leq\mathsf{F}, after removing M/(Q⁢K⁢G⁢U2)M/(QKGU^{2}), where

(A.64) 𝖥=C⁢xη⁢Q⁢K⁢G⁢U2/M.\mathsf{F}=Cx^{\eta}QKGU^{2}/M.

If 𝖥<1\mathsf{F}<1 there is nothing to bound. By CRT the class of mm in the phase is

cl≡A1⁢n1¯⁢v¯d0⁢u+A2⁢n2¯⁢d0⁢u¯v(mod1).\frac{c}{l}\equiv\frac{A_{1}\overline{n_{1}}\,\overline{v}}{d_{0}u}+\frac{A_{2% }\overline{n_{2}}\,\overline{d_{0}u}}{v}\pmod{1}.

Cauchy’s inequality over the masked outer data (q,k,g,n1,n2)(q,k,g,n_{1},n_{2}), (q⁢k⁢g,x)=1(qkg,x)=1, with n2≡n1⁢(q)n_{2}\equiv n_{1}\ (q) removes aa and gives

(A.65) |𝒴|2≪H2⁢K⁢G⁢𝒟3,|\mathcal{Y}|^{2}\ll H^{2}KG\,\mathcal{D}_{3},

since there are at most Q⁢K⁢G⋅O⁢(H⁢(H/Q+1))≪H2⁢K⁢GQKG\cdot O(H(H/Q+1))\ll H^{2}KG outer tuples (Q<HQ<H). Here 𝒴\mathcal{Y} and 𝒟3\mathcal{D}_{3} keep the xx-mask. The sum 𝒟3\mathcal{D}_{3} runs over (q⁢k⁢g,x)=1(qkg,x)=1 and n2≡n1⁢(q)n_{2}\equiv n_{1}\ (q). Its terms are a smooth majorant times the square of the (u,v,h)(u,v,h)-sum. This inner sum contains 𝟏(u,x)=1⁢𝟏(v,x)=1\mathbf{1}_{(u,x)=1}\mathbf{1}_{(v,x)=1} and the selected Γ\Gamma coefficients. The congruence modulo k⁢gkg stays inside the square. In the expansion of this square each pair of copies keeps its zero–one masks. The later diagonal, Weil and Ramanujan bounds are termwise bounds after taking absolute values of the expanded contributions. Hence they may discard zero–one factors. We do not use the false inequality |∑(u⁢v,x)=1zu⁢v|2≤|∑u,vzu⁢v|2|\sum_{(uv,x)=1}z_{uv}|^{2}\leq|\sum_{u,v}z_{uv}|^{2}.

Expanding gives (u,v,h)(u,v,h) and (u′,v′,h′)(u^{\prime},v^{\prime},h^{\prime}) with 0<|h|,|h′|≤𝖥0<|h|,|h^{\prime}|\leq\mathsf{F}. Put A=A1⁢(u)A=A_{1}(u), A′=A1⁢(u′)A^{\prime}=A_{1}(u^{\prime}), B=A2⁢(v)B=A_{2}(v), B′=A2⁢(v′)B^{\prime}=A_{2}(v^{\prime}) and

Δ=h⁢u′⁢v′−h′⁢u⁢v.\Delta=hu^{\prime}v^{\prime}-h^{\prime}uv.

The two congruences modulo k⁢gkg must agree, or the term vanishes. Let t≡B⁢A¯(modd0)t\equiv B\overline{A}\pmod{d_{0}}. The (n1,n2)(n_{1},n_{2})-sum is

𝒦=∑n2≡t⁢n1⁢(d0)(n1,d0⁢u⁢u′)=1,(n2,v⁢v′)=1ψ⁢(n1H)⁢ψ⁢(n2H)⁢e⁢(c1⁢n1¯d0⁢u⁢u′)⁢e⁢(c2⁢n2¯v⁢v′),\mathcal{K}=\sum_{\begin{subarray}{c}n_{2}\equiv tn_{1}\ (d_{0})\\ (n_{1},d_{0}uu^{\prime})=1,\ (n_{2},vv^{\prime})=1\end{subarray}}\psi\Bigl{(}% \frac{n_{1}}{H}\Bigr{)}\psi\Bigl{(}\frac{n_{2}}{H}\Bigr{)}e\Bigl{(}\frac{c_{1}% \overline{n_{1}}}{d_{0}uu^{\prime}}\Bigr{)}e\Bigl{(}\frac{c_{2}\overline{n_{2}% }}{vv^{\prime}}\Bigr{)},
c1≡(A⁢h⁢u′⁢v′−A′⁢h′⁢u⁢v)⁢v⁢v′¯(modd0⁢u⁢u′),c2≡(B⁢h⁢u′⁢v′−B′⁢h′⁢u⁢v)⁢d0⁢u⁢u′¯(modv⁢v′).c_{1}\equiv(Ahu^{\prime}v^{\prime}-A^{\prime}h^{\prime}uv)\overline{vv^{\prime% }}\pmod{d_{0}uu^{\prime}},\qquad c_{2}\equiv(Bhu^{\prime}v^{\prime}-B^{\prime}% h^{\prime}uv)\overline{d_{0}uu^{\prime}}\pmod{vv^{\prime}}.

All inverses exist, since (u⁢u′,v⁢v′)=1(uu^{\prime},vv^{\prime})=1 and both are prime to d0d_{0}. Completing first in n2n_{2} and then in n1n_{1},

(A.66) 𝒦=H2d02⁢u⁢u′⁢v⁢v′⁢∑ℓ1,ℓ2∈ℤψ^⁢(ℓ2⁢Hd0⁢v⁢v′)⁢ψ^⁢(ℓ1⁢Hd0⁢u⁢u′)⁢S⁢(c2,ℓ2⁢d0¯;v⁢v′)⁢S⁢(c1,ℓ1+ℓ2⁢c3;d0⁢u⁢u′),\mathcal{K}=\frac{H^{2}}{d_{0}^{2}uu^{\prime}vv^{\prime}}\sum_{\ell_{1},\ell_{% 2}\in\mathbb{Z}}\hat{\psi}\Bigl{(}\frac{\ell_{2}H}{d_{0}vv^{\prime}}\Bigr{)}% \hat{\psi}\Bigl{(}\frac{\ell_{1}H}{d_{0}uu^{\prime}}\Bigr{)}S(c_{2},\ell_{2}% \overline{d_{0}};vv^{\prime})\,S(c_{1},\ell_{1}+\ell_{2}c_{3};d_{0}uu^{\prime}),

with c3≡u⁢u′⁢t⁢v⁢v′¯(modd0⁢u⁢u′)c_{3}\equiv uu^{\prime}t\,\overline{vv^{\prime}}\pmod{d_{0}uu^{\prime}} and the Kloosterman sum S⁢(a,b;m)S(a,b;m) of Paper I, (2.35). The first completion produces the phase e⁢(ℓ2⁢t⁢n1⁢v⁢v′¯/d0)e(\ell_{2}tn_{1}\overline{vv^{\prime}}/d_{0}), which combines with the n1n_{1}-phase to give c3c_{3}. Let

(A.67) Λ=C1⁢xη⁢Q⁢K⁢G⁢U2/H.\Lambda=C_{1}x^{\eta}QKGU^{2}/H.

Frequencies with |ℓi|>Λ|\ell_{i}|>\Lambda contribute O⁢(x−100)O(x^{-100}) per tuple. If Λ<1\Lambda<1, only (ℓ1,ℓ2)=(0,0)(\ell_{1},\ell_{2})=(0,0) remains.

The target for 𝒟3\mathcal{D}_{3} is T3=H2⁢U4⁢G/KT_{3}=H^{2}U^{4}G/K. By (A.65), a bound 𝒟3≪T3⁢x−ρ\mathcal{D}_{3}\ll T_{3}x^{-\rho} gives |𝒴|≪H2⁢U2⁢G⁢x−ρ/2|\mathcal{Y}|\ll H^{2}U^{2}Gx^{-\rho/2}.

Diagonal Δ=0\Delta=0. Then u⁢v∣h⁢u′⁢v′uv\mid hu^{\prime}v^{\prime}, so for fixed (h,u′,v′)(h,u^{\prime},v^{\prime}) there are xo⁢(1)x^{o(1)} choices of (h′,u,v)(h^{\prime},u,v). Bounding 𝒦\mathcal{K} trivially by O⁢(H2/d0)O(H^{2}/d_{0}), as d0<Hd_{0}<H,

𝒟3diag≪xo⁢(1)⁢H2⁢𝖥⁢U2,𝒟3diagT3≪xη+o⁢(1)⁢Q⁢K2⁢Hx≤x−.0055+η+o⁢(1).\mathcal{D}_{3}^{\rm diag}\ll x^{o(1)}H^{2}\mathsf{F}U^{2},\qquad\frac{% \mathcal{D}_{3}^{\rm diag}}{T_{3}}\ll x^{\eta+o(1)}\frac{QK^{2}H}{x}\leq x^{-.% 0055+\eta+o(1)}.

The divisor-counting bound xo⁢(1)x^{o(1)} for the tuple count immediately above is loose. Only this xo⁢(1)x^{o(1)} factor is used in the estimate for 𝒟3diag\mathcal{D}_{3}^{\rm diag}.

Gcd bound. Put e=(u,u′)e=(u,u^{\prime}), f=(v,v′)f=(v,v^{\prime}), u0=u/eu_{0}=u/e, u1=u′/eu_{1}=u^{\prime}/e, v0=v/fv_{0}=v/f, v1=v′/fv_{1}=v^{\prime}/f. Then

(A.68) (c1,u⁢u′)⁢(c2,v⁢v′)≤(h,u0⁢v0)⁢(h′,u1⁢v1)⁢(c1,e2)⁢(c2,f2).(c_{1},uu^{\prime})(c_{2},vv^{\prime})\leq(h,u_{0}v_{0})(h^{\prime},u_{1}v_{1}% )(c_{1},e^{2})(c_{2},f^{2}).

The four factors are supported on disjoint sets of primes. If p∣up\mid u, p∤u′p\nmid u^{\prime}, then c1≡A⁢h⁢u′⁢v′⁢v⁢v′¯(modp)c_{1}\equiv Ahu^{\prime}v^{\prime}\overline{vv^{\prime}}\pmod{p} with a unit multiplier, so (c1,p)=(h,p)(c_{1},p)=(h,p). The cases p∣u′p\mid u^{\prime} only, p∣vp\mid v only and p∣v′p\mid v^{\prime} only are identical, with (h′,p)(h^{\prime},p), (h,p)(h,p) and (h′,p)(h^{\prime},p). If p∣ep\mid e, the numerator of c1c_{1} is p⁢(A⁢h⁢a′⁢v′−A′⁢h′⁢a′′⁢v)p(Aha^{\prime}v^{\prime}-A^{\prime}h^{\prime}a^{\prime\prime}v) with u=p⁢a′′u=pa^{\prime\prime}, u′=p⁢a′u^{\prime}=pa^{\prime}. Thus the pp-part of (c1,e2)(c_{1},e^{2}) is at most p2p^{2}. The case p∣fp\mid f is similar. Modulo qq all four residues equal bqb_{q}, so c1≡bq⁢v⁢v′¯⁢Δ(modq)c_{1}\equiv b_{q}\overline{vv^{\prime}}\Delta\pmod{q} and (c1,q)=(Δ,q)(c_{1},q)=(\Delta,q). For p∣k⁢gp\mid kg we use only (c1,k⁢g)≤k⁢g(c_{1},kg)\leq kg. Hence

(A.69) (c1,d0⁢u⁢u′)⁢(c2,v⁢v′)≤k⁢g⁢(Δ,q)⁢(h,u⁢v)⁢(h′,u′⁢v′)⁢(u,u′)2⁢(v,v′)2.(c_{1},d_{0}uu^{\prime})(c_{2},vv^{\prime})\leq kg\,(\Delta,q)\,(h,uv)(h^{% \prime},u^{\prime}v^{\prime})(u,u^{\prime})^{2}(v,v^{\prime})^{2}.

Long dual range, Λ≥1\Lambda\geq 1, Δ≠0\Delta\neq 0. There are O⁢(Λ2)O(\Lambda^{2}) pairs (ℓ1,ℓ2)(\ell_{1},\ell_{2}). Paper I, (2.35), gives

|S⁢(a,b;m)|≤τ⁢(m)⁢m1/2⁢(a,m)1/2.|S(a,b;m)|\leq\tau(m)m^{1/2}(a,m)^{1/2}.

Use the square root of (A.69) and (k⁢g)1/2⁢(Q⁢K⁢G)1/2≪Q1/2⁢K⁢G(kg)^{1/2}(QKG)^{1/2}\ll Q^{1/2}KG. Then

|𝒦|≪x2⁢η+o⁢(1)⁢Q1/2⁢K⁢G⁢U2×(h,u⁢v)1/2⁢(h′,u′⁢v′)1/2⁢(u,u′)⁢(v,v′)⁢(Δ,q)1/2.\begin{multlined}|\mathcal{K}|\ll x^{2\eta+o(1)}Q^{1/2}KGU^{2}\\ \times(h,uv)^{1/2}(h^{\prime},u^{\prime}v^{\prime})^{1/2}(u,u^{\prime})(v,v^{% \prime})(\Delta,q)^{1/2}.\end{multlined}|\mathcal{K}|\ll x^{2\eta+o(1)}Q^{1/2}% KGU^{2}\\ \times(h,uv)^{1/2}(h^{\prime},u^{\prime}v^{\prime})^{1/2}(u,u^{\prime})(v,v^{% \prime})(\Delta,q)^{1/2}.

The averages

∑1≤|h|≤𝖥(h,a)≤2⁢𝖥⁢τ⁢(a),∑q∼Q(Δ,q)≤C⁢Q⁢τ⁢(|Δ|),∑u,u′∼U(u,u′)≪U2⁢log⁡(2⁢U)\sum_{1\leq|h|\leq\mathsf{F}}(h,a)\leq 2\mathsf{F}\tau(a),\qquad\sum_{q\sim Q}% (\Delta,q)\leq CQ\tau(|\Delta|),\qquad\sum_{u,u^{\prime}\sim U}(u,u^{\prime})% \ll U^{2}\log(2U)

follow from (h,a)=∑d∣(h,a)φ⁢(d)(h,a)=\sum_{d\mid(h,a)}\varphi(d) and counting multiples. Summing over the O⁢(K⁢G)O(KG) choices of (k,g)(k,g),

𝒟3long≪x2⁢η+o⁢(1)⁢Q3/2⁢K2⁢G2⁢U6⁢𝖥2,𝒟3longT3≪x4⁢η+o⁢(1)⁢Q7/2⁢K5⁢R6G3⁢x2≤x−.00005+4⁢η+o⁢(1),\mathcal{D}_{3}^{\rm long}\ll x^{2\eta+o(1)}Q^{3/2}K^{2}G^{2}U^{6}\mathsf{F}^{% 2},\qquad\frac{\mathcal{D}_{3}^{\rm long}}{T_{3}}\ll x^{4\eta+o(1)}\frac{Q^{7/% 2}K^{5}R^{6}}{G^{3}x^{2}}\leq x^{-.00005+4\eta+o(1)},

using U=R/GU=R/G, G≥12G\geq\tfrac{1}{2}, K≤yK\leq y; the possible absolute factor G−3≤8G^{-3}\leq 8 is absorbed in the implied constant and in xo⁢(1)x^{o(1)}, and then

2−72⁢(.4545)−6⁢(.0682)=.00005.2-\tfrac{7}{2}(.4545)-6(.0682)=.00005.

Short dual range, Λ<1\Lambda<1, Δ≠0\Delta\neq 0. Now

𝒦=H2⁢ψ^⁢(0)2d02⁢u⁢u′⁢v⁢v′⁢cv⁢v′⁢(c2)⁢cd0⁢u⁢u′⁢(c1)+O⁢(x−100),\mathcal{K}=\frac{H^{2}\hat{\psi}(0)^{2}}{d_{0}^{2}uu^{\prime}vv^{\prime}}\,c_% {vv^{\prime}}(c_{2})\,c_{d_{0}uu^{\prime}}(c_{1})+O(x^{-100}),

with Ramanujan sums cm⁢(a)=S⁢(a,0;m)c_{m}(a)=S(a,0;m), and |cm⁢(a)|≤(a,m)|c_{m}(a)|\leq(a,m). By (A.69) each term is

≪H2Q2⁢K⁢G⁢U4⁢(Δ,q)⁢(h,u⁢v)⁢(h′,u′⁢v′)⁢(u,u′)2⁢(v,v′)2.\ll\frac{H^{2}}{Q^{2}KGU^{4}}(\Delta,q)(h,uv)(h^{\prime},u^{\prime}v^{\prime})% (u,u^{\prime})^{2}(v,v^{\prime})^{2}.

With ∑u,u′∼U(u,u′)2≪U3\sum_{u,u^{\prime}\sim U}(u,u^{\prime})^{2}\ll U^{3} and the averages above,

𝒟3short≪xo⁢(1)⁢H2⁢𝖥2⁢U2Q,𝒟3shortT3≪x2⁢η+o⁢(1)⁢H2⁢Q⁢K3⁢R2G⁢x2≤x−.3291+2⁢η+o⁢(1),\mathcal{D}_{3}^{\rm short}\ll x^{o(1)}\frac{H^{2}\mathsf{F}^{2}U^{2}}{Q},% \qquad\frac{\mathcal{D}_{3}^{\rm short}}{T_{3}}\ll x^{2\eta+o(1)}\frac{H^{2}QK% ^{3}R^{2}}{Gx^{2}}\leq x^{-.3291+2\eta+o(1)},

since 2⁢(.54)+.4545+2⁢(.0682)−2=−.32912(.54)+.4545+2(.0682)-2=-.3291.

Step 8: conclusion

After the xo⁢(1)x^{o(1)} factors the three ratios are at most x−.00005+5⁢ηx^{-.00005+5\eta}. These factors include JJ, the divisor bounds, K≤yK\leq y and fixed powers of LL. Take ρ=10−6\rho=10^{-6}. Then |𝒴|≪H2⁢U2⁢G⁢x−ρ/2|\mathcal{Y}|\ll H^{2}U^{2}Gx^{-\rho/2} on each masked colouring class. Restoring M/(Q⁢K⁢G⁢U2)M/(QKGU^{2}) and the J=xo⁢(1)J=x^{o(1)} classes, the nonzero frequencies contribute ≪ℬ⁢x−ρ/3\ll\mathcal{B}x^{-\rho/3} to each small-GG block of 𝒞x\mathcal{C}_{x}. The modulus mask was preserved through both Cauchy squares. Only termwise absolute-value majorants were enlarged. There are O⁢(L)O(L) common-factor blocks. Together with Steps 5 and 6 this proves (A.58) with the same masked M⁢TxMT_{x} in each of its four choices of residues. Their signed combination is M⁢Tx−M⁢Tx−M⁢Tx+M⁢Tx=0MT_{x}-MT_{x}-MT_{x}+MT_{x}=0. Fix a requested final exponent AA. First choose the correlation precision P>2⁢A+10P>2A+10. Then choose Dτ=Dτ⁢(P)≥K′+PD_{\tau}=D_{\tau}(P)\geq K^{\prime}+P (Step 3). Then choose S0>4⁢Dτ+2⁢PS_{0}>4D_{\tau}+2P, also large enough to make (A.53) smaller than x⁢L−A−10xL^{-A-10}. Next take Cg>B1⁢(S0)+1C_{g}>B_{1}(S_{0})+1, and finally the threshold for xx. Equation (A.57) gives 𝒵(x)≪x⁢L−P/2\mathcal{Z}^{(x)}\ll xL^{-P/2} on each shell. Sum over its O⁢(L2)O(L^{2}) choices of (K,R)(K,R) and add the masked Step 1 and Step 3 errors. This proves exactly (6.48), with (r⁢s,x)=1(rs,x)=1 as stated. Every constant depends only on AA, the comparison constants in (6.47) and the constants in (A.49). ∎

Appendix B Finite calculations

This appendix gives the finite quantities used above. Each terminating decimal denotes an exact rational number. All decimal interval endpoints are rounded outwards; decimal approximations in explanatory prose are not additional certified bounds. The comparisons with prime sums occur in the main text.

B.1. Series bounds

For |z|<1|z|<1,

(B.1) |arctanh⁡z−∑k=0m−1z2⁢k+12⁢k+1|≤|z|2⁢m+1(2⁢m+1)⁢(1−z2).\left|\operatorname{arctanh}z-\sum_{k=0}^{m-1}\frac{z^{2k+1}}{2k+1}\right|\leq% \frac{|z|^{2m+1}}{(2m+1)(1-z^{2})}.

Write any positive rational as t=2a⁢vt=2^{a}v, where 2/3≤v<4/32/3\leq v<4/3. Then use

(B.2) log⁡t=a⁢log⁡2+2⁢arctanh⁡v−1v+1,log⁡2=2⁢arctanh⁡(1/3).\log t=a\log 2+2\operatorname{arctanh}\frac{v-1}{v+1},\qquad\log 2=2% \operatorname{arctanh}(1/3).

Also, for 0≤z<10\leq z<1,

(B.3) 0≤Li2⁡(z)−∑n=1mznn2≤zm+1(m+1)2⁢(1−z).0\leq\operatorname{Li}_{2}(z)-\sum_{n=1}^{m}\frac{z^{n}}{n^{2}}\leq\frac{z^{m+% 1}}{(m+1)^{2}(1-z)}.

These inequalities enclose the elementary functions below. Integer comparisons then give the printed rational bounds.

B.2. Four profile differences

Put

α=1001149,β=50309,μ∗=25128,λ=93400,hG=95000,K=5764−1500,\displaystyle\alpha=\frac{100}{1149},\quad\beta=\frac{50}{309},\quad\mu_{*}=% \frac{25}{128},\quad\lambda=\frac{93}{400},\quad h_{G}=\frac{9}{5000},\quad K=% \frac{57}{64}-\frac{1}{500},
(B.4) δh=hGα,C=K−115⁢α,B⁢(x)=min⁡{β,max⁡{α,C−5⁢x/2}}.\displaystyle\delta_{h}=\frac{h_{G}}{\alpha},\qquad C=K-\frac{11}{5}\alpha,% \qquad B(x)=\min\{\beta,\max\{\alpha,C-5x/2\}\}.

Define the elementary functions

f^⁢(s)\displaystyle\widehat{f}(s) =log⁡(s−1)s\displaystyle=\frac{\log(s-1)}{s} (2≤s≤4),\displaystyle(2\leq s\leq 4),
(B.5) F^⁢(s)\displaystyle\widehat{F}(s) =1s\displaystyle=\frac{1}{s} (1<s≤3),\displaystyle(1<s\leq 3),
(B.6) s⁢F^⁢(s)\displaystyle s\widehat{F}(s) =1+log⁡(s−2)⁢log⁡(s−1)−Li2⁡(s−2s−1)\displaystyle=1+\log(s-2)\log(s-1)-\operatorname{Li}_{2}\!\left(\frac{s-2}{s-1% }\right)
−log2⁡(s−1)2+Li2⁡(1/2)+log2⁡22\displaystyle\quad-\frac{\log^{2}(s-1)}{2}+\operatorname{Li}_{2}(1/2)+\frac{% \log^{2}2}{2} (3<s<5),\displaystyle(3<s<5),

The two sieve normalizations satisfy

F^=F/(2⁢eγ),f^=f/(2⁢eγ).\widehat{F}=F/(2e^{\gamma}),\qquad\widehat{f}=f/(2e^{\gamma}).

The raw multiplier 2/(eγ⁢α)2/(e^{\gamma}\alpha), a signed row coefficient ±1/4\pm 1/4, and F=2⁢eγ⁢F^F=2e^{\gamma}\widehat{F} or f=2⁢eγ⁢f^f=2e^{\gamma}\widehat{f} combine to the displayed 1/α1/\alpha factor. The directed integrals below use these hatted functions. No further 1/41/4 or 2⁢eγ2e^{\gamma} factor is applied. Also Li2⁡(t)=∑n≥1tn/n2\operatorname{Li}_{2}(t)=\sum_{n\geq 1}t^{n}/n^{2} for 0≤t<10\leq t<1. Write

DF⁢(s)=F^⁢(s)−F^⁢(s+δh),Df⁢(s)=f^⁢(s+δh)−f^⁢(s).D_{F}(s)=\widehat{F}(s)-\widehat{F}(s+\delta_{h}),\qquad D_{f}(s)=\widehat{f}(% s+\delta_{h})-\widehat{f}(s).

For the three intervals in Table B.1, put

(B.7) Δj\displaystyle\Delta_{j} =1α⁢∫IjDF⁢(K−5⁢x/2α)⁢d⁢xx(j=4,5,7),\displaystyle=\frac{1}{\alpha}\int_{I_{j}}D_{F}\!\left(\frac{K-5x/2}{\alpha}% \right)\frac{dx}{x}\quad(j=4,5,7),
(B.8) Δ10\displaystyle\Delta_{10} =1α⁢∫μ∗λ∫αB⁢(x)Df⁢(K−5⁢x/2−yα)⁢d⁢y⁢d⁢xx⁢y.\displaystyle=\frac{1}{\alpha}\int_{\mu_{*}}^{\lambda}\int_{\alpha}^{B(x)}D_{f% }\!\left(\frac{K-5x/2-y}{\alpha}\right)\frac{dy\,dx}{xy}.

These Δj\Delta_{j} are those of equation (5.22). Closed or half-open interval endpoints have measure zero. The curved domain is that of [27, (2.38)–(2.40)].

Proposition B.1.

A directed interval computation certifies the following outward enclosure of the four elementary integrals:

(B.9) 572004108<Δ4+Δ5+Δ7+Δ10<606486108.\frac{572004}{10^{8}}<\Delta_{4}+\Delta_{5}+\Delta_{7}+\Delta_{10}<\frac{60648% 6}{10^{8}}.

In particular, their sum minus 10−2010^{-20} exceeds 5719/1065719/10^{6}. Also,

(B.10) log⁡34⁢α2⁢(52⁢λ+β)⁢λ−μ∗μ∗<211372545161976874120000000000000<51371000<214<17925.\frac{\log 3}{4\alpha^{2}}\left(\frac{5}{2}\lambda+\beta\right)\frac{\lambda-% \mu_{*}}{\mu_{*}}<\frac{21137254516197687}{4120000000000000}<\frac{5137}{1000}% <\frac{21}{4}<\frac{179}{25}.
Table B.1. Outward decimal bounds from the directed computation. Every endpoint is an exact terminating rational.
jj IjI_{j} lower bound upper bound
44 [25/128,1/4][25/128,1/4] 0.001620680.00162068 0.001695390.00169539
55 [1/4,7109/28000][1/4,7109/28000] 0.000403270.00040327 0.000413250.00041325
77 [25/128,93/400][25/128,93/400] 0.000564630.00056463 0.000590510.00059051
1010 curved domain 0.003131450.00313145 0.003365720.00336572
sum 0.005720030.00572003 0.006064870.00606487
Proof.

The profiles are evaluated with directed interval arithmetic. An independent verifier rechecks the directed output. Put hG=9/5000h_{G}=9/5000, p⁢(s)=−F^′⁢(s)p(s)=-\widehat{F}^{\prime}(s), and let dd be the right-branch derivative profile for f^\widehat{f}, so d⁢(s)=f^′⁢(s)d(s)=\widehat{f}^{\prime}(s) for 2<s<42<s<4 and d⁢(2)=1/2d(2)=1/2 by continuous extension. The three one-dimensional rows each use 2048 equal cells:

xk=aj+k⁢(bj−aj)2048(0≤k≤2048).x_{k}=a_{j}+\frac{k(b_{j}-a_{j})}{2048}\qquad(0\leq k\leq 2048).

For a cell [x0,x1]=[xk,xk+1][x_{0},x_{1}]=[x_{k},x_{k+1}], define

s−=K−5⁢x1/2α,s+=K−5⁢x0/2+hGα.s_{-}=\frac{K-5x_{1}/2}{\alpha},\qquad s_{+}=\frac{K-5x_{0}/2+h_{G}}{\alpha}.

Since DF⁢(s)=∫0hG/αp⁢(s+t)⁢𝑑tD_{F}(s)=\int_{0}^{h_{G}/\alpha}p(s+t)\,dt, the code’s lower and upper cell contributions are exactly

(B.11) L=hGα2⁢x1−x0x1⁢p⁢(s+),U=hGα2⁢x1−x0x0⁢p⁢(s−).L=\frac{h_{G}}{\alpha^{2}}\frac{x_{1}-x_{0}}{x_{1}}p(s_{+}),\qquad U=\frac{h_{% G}}{\alpha^{2}}\frac{x_{1}-x_{0}}{x_{0}}p(s_{-}).

These hold because s−≤(K−5⁢x/2)/α+t≤s+s_{-}\leq(K-5x/2)/\alpha+t\leq s_{+} for every x∈[x0,x1]x\in[x_{0},x_{1}] and 0≤t≤hG/α0\leq t\leq h_{G}/\alpha; also x0≤x≤x1x_{0}\leq x\leq x_{1}.

For the fourth integral, split at

xB=5068488232366940000.x_{B}=\frac{506848823}{2366940000}.

On each piece [a,b][a,b] of [μ∗,xB]∪[xB,λ][\mu_{*},x_{B}]\cup[x_{B},\lambda], the S10 routine uses xi=a+i⁢(b−a)/96x_{i}=a+i(b-a)/96 and zj=j/96z_{j}=j/96 for 0≤i,j≤960\leq i,j\leq 96. For a cell [xi,xi+1]×[zj,zj+1][x_{i},x_{i+1}]\times[z_{j},z_{j+1}], with 0≤i,j<960\leq i,j<96, put

b0=B⁢(xi),b1=B⁢(xi+1),y−=α+(b1−α)⁢zj,y+=α+(b0−α)⁢zj+1,b_{0}=B(x_{i}),\quad b_{1}=B(x_{i+1}),\quad y_{-}=\alpha+(b_{1}-\alpha)z_{j},% \quad y_{+}=\alpha+(b_{0}-\alpha)z_{j+1},
q−=K−5⁢xi+1/2−y+α,q+=K−5⁢xi/2−y−+hGα.q_{-}=\frac{K-5x_{i+1}/2-y_{+}}{\alpha},\qquad q_{+}=\frac{K-5x_{i}/2-y_{-}+h_% {G}}{\alpha}.

The substitution is y=α+(B⁢(x)−α)⁢zy=\alpha+(B(x)-\alpha)z. Its executed lower and upper contributions are

(B.12) L=hGα2⁢(xi+1−xi)⁢(zj+1−zj)⁢b1−αxi+1⁢y+⁢d⁢(q+),U=hGα2⁢(xi+1−xi)⁢(zj+1−zj)⁢b0−αxi⁢y−⁢d⁢(q−).L=\frac{h_{G}}{\alpha^{2}}(x_{i+1}-x_{i})(z_{j+1}-z_{j})\frac{b_{1}-\alpha}{x_% {i+1}y_{+}}d(q_{+}),\qquad U=\frac{h_{G}}{\alpha^{2}}(x_{i+1}-x_{i})(z_{j+1}-z% _{j})\frac{b_{0}-\alpha}{x_{i}y_{-}}d(q_{-}).

For every point in this cell and 0≤t≤hG/α0\leq t\leq h_{G}/\alpha, q−≤(K−5⁢x/2−y)/α+t≤q+q_{-}\leq(K-5x/2-y)/\alpha+t\leq q_{+}, and

b1−αxi+1⁢y+≤B⁢(x)−αx⁢y≤b0−αxi⁢y−.\frac{b_{1}-\alpha}{x_{i+1}y_{+}}\leq\frac{B(x)-\alpha}{xy}\leq\frac{b_{0}-% \alpha}{x_{i}y_{-}}.

Hence the two positive factors are bounded separately, as in the code. The two rectangular grids contain 2⋅9622\cdot 96^{2} cells. The total executed cell count is

3⋅2048+2⋅96⋅96=24576.3\cdot 2048+2\cdot 96\cdot 96=24576.

The endpoint bounds use the following branch formulas. For 2<s<42<s<4,

d⁢(s)=s/(s−1)−log⁡(s−1)s2>0,d′⁢(s)=−1s⁢(s−1)2−2⁢{s/(s−1)−log⁡(s−1)}s3<0.d(s)=\frac{s/(s-1)-\log(s-1)}{s^{2}}>0,\qquad d^{\prime}(s)=-\frac{1}{s(s-1)^{% 2}}-\frac{2\{s/(s-1)-\log(s-1)\}}{s^{3}}<0.

They extend continuously to s=2s=2 with d⁢(2)=1/2d(2)=1/2 and right derivative d+′⁢(2)=−1d^{\prime}_{+}(2)=-1. Thus the branch profile is positive and decreasing on [2,4][2,4]. For positivity: the numerator decreases, and at s=4s=4 it is 4/3−log⁡3>04/3-\log 3>0, since e4/3>1+4/3+(4/3)2/2+(4/3)3/6>3e^{4/3}>1+4/3+(4/3)^{2}/2+(4/3)^{3}/6>3. For s>3s>3, put A⁢(s)=F^⁢(s)−f^⁢(s−1)A(s)=\widehat{F}(s)-\widehat{f}(s-1). Then

(s⁢A⁢(s))′=−s⁢f^′⁢(s−1)<0,p⁢(s)=A⁢(s)/s,p′⁢(s)=−2⁢A⁢(s)/s2−f^′⁢(s−1)/s.(sA(s))^{\prime}=-s\,\widehat{f}^{\prime}(s-1)<0,\qquad p(s)=A(s)/s,\qquad p^{% \prime}(s)=-2A(s)/s^{2}-\widehat{f}^{\prime}(s-1)/s.

At s=3s=3 the two pieces give p⁢(3)=1/9p(3)=1/9, so pp is continuous there; the displayed differential identities are used on s>3s>3. The exact directed evaluation at smax=73930107/16000000s_{\max}=73930107/16000000 gives A⁢(smax)>1597/100000>0A(s_{\max})>1597/100000>0. Hence A⁢(s)>0A(s)>0 throughout the required range 3<s≤smax3<s\leq s_{\max}, and there p>0p>0 and p′<0p^{\prime}<0. For s≤3s\leq 3, p⁢(s)=1/s2p(s)=1/s^{2} is also positive and decreasing. The S10 mixed-corner range is

173594152737910400000≤q−≤q+≤5793010716000000<4,173594152737910400000>219100.\frac{17359415273}{7910400000}\leq q_{-}\leq q_{+}\leq\frac{57930107}{16000000% }<4,\qquad\frac{17359415273}{7910400000}>\frac{219}{100}.

These inequalities justify using the decreasing positive dd in (B.12). The lower bound refers only to the executed mixed-corner interval.

The code evaluates the formulas by rational geometry and 256-bit Arb ball arithmetic. In profile_direct.py, logarithms use Arb’s log() operation. Put w=s−2w=s-2. The dilogarithm uses Arb’s polylog(2) operation at the negative argument −w-w, together with π2/12\pi^{2}/12. These are the code’s evaluations of (B.5). By the Landen identity

Li2⁡(−w)=−Li2⁡(w1+w)−12⁢log2⁡(1+w),Li2⁡(1/2)+12⁢log2⁡2=π212\operatorname{Li}_{2}(-w)=-\operatorname{Li}_{2}\!\left(\frac{w}{1+w}\right)-% \frac{1}{2}\log^{2}(1+w),\qquad\operatorname{Li}_{2}(1/2)+\frac{1}{2}\log^{2}2% =\frac{\pi^{2}}{12}

the Arb expression equals the displayed formula. Arb supplies outward ball enclosures. The code does not use the atanh and dilogarithm tail inequalities above. The exact directed rational endpoints are written to the result record. The terminating decimals in the table are outward projections of each row’s directed endpoint. Their displayed column sums are 0.005720030.00572003 and 0.006064870.00606487. The sharper bound (B.9) adds the unrounded rational endpoints in RESULT.json before decimal projection. Summing before rounding proves the stated integer comparisons. Finally, 64 terms of log⁡3=2⁢∑n≥02−(2⁢n+1)/(2⁢n+1)\log 3=2\sum_{n\geq 0}2^{-(2n+1)}/(2n+1) and its geometric remainder give log⁡3<10987/10000\log 3<10987/10000. This proves (B.10). ∎

Proposition B.1 concerns elementary integrals and one strip coefficient. Its application to the prime sums requires the source comparisons, uniform errors and a single charge of the strip.

B.3. The shifted three-variable integral

Here F,fF,f are the linear-sieve functions. Their normalization is

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

These classical properties are the inputs to this calculation. Put u=1/500u=1/500, μ∗=25/128\mu_{*}=25/128 and hG=9/5000h_{G}=9/5000. Define

(B.14) v1⁢(s)\displaystyle v_{1}(s) =min⁡(1+s2,32−34⁢s39,5764−3⁢s2),\displaystyle=\min\left(\frac{1+s}{2},\frac{32-34s}{39},\frac{57}{64}-\frac{3s% }{2}\right), v⁢(s)\displaystyle v(s) =v1⁢(s)−u,\displaystyle=v_{1}(s)-u,
ψ⁢(x,y)\displaystyle\psi(x,y) ={x,x≥y,−∞,x<y,\displaystyle=\begin{cases}x,&x\geq y,\\ -\infty,&x<y,\end{cases}
Θ∗⁢(x,y,z)\displaystyle\Theta_{*}(x,y,z) =max{v(x),v(y),v(x+y),v(x+y+z),\displaystyle=\max\{v(x),v(y),v(x+y),v(x+y+z),
ψ(v(x+z),x+2y+z),ψ(v(y+z),2x+y+z)}.\displaystyle\hskip 27.0pt\psi(v(x+z),x+2y+z),\psi(v(y+z),2x+y+z)\}.

The unguarded branches include v⁢(x)>0v(x)>0 for u≤x≤μ∗u\leq x\leq\mu_{*}. Thus replacing the inactive value −∞-\infty by 0 leaves this maximum unchanged. For d=0,hGd=0,h_{G}, put

(B.15) Jd\displaystyle J_{d} =∫u≤z≤y≤x≤μ∗1−f⁢((Θ∗⁢(x,y,z)+d−x−y−z)/z)x⁢y⁢z2⁢𝑑x⁢𝑑y⁢𝑑z,\displaystyle=\int_{u\leq z\leq y\leq x\leq\mu_{*}}\frac{1-f((\Theta_{*}(x,y,z% )+d-x-y-z)/z)}{xyz^{2}}\,dx\,dy\,dz,
Hlog\displaystyle H_{\log} =log⁡(μ∗/u),\displaystyle=\log(\mu_{*}/u),
Rup\displaystyle R_{\mathrm{up}} =500⁢(F⁢(30)−1)+500⁢Hlog⁢(1−f⁢(30))+250⁢Hlog2⁢(F⁢(30)−1),\displaystyle=500(F(30)-1)+500H_{\log}(1-f(30))+250H_{\log}^{2}(F(30)-1),
𝒢d\displaystyle\mathcal{G}_{d} =1/μ∗+Rup+Jd.\displaystyle=1/\mu_{*}+R_{\mathrm{up}}+J_{d}.

The unshifted d=0d=0 profile and functional come from [27, (4.70)–(4.75)]. The parameter dd and the shifted functional 𝒢d\mathcal{G}_{d} are defined in this paper. The retained-side argument uses the instance d=hGd=h_{G}, constructed in (5.52). Paper II’s (5.4)–(5.5) are not the source of this shifted functional.

Proposition B.2.

The shifted scalar satisfies

(B.16) 0≤𝒢hG≤Uh<6073714261109.0\leq\mathcal{G}_{h_{G}}\leq U_{h}<\frac{6073714261}{10^{9}}.

Let Fh+≥F⁢(30)F_{h}^{+}\geq F(30), fh−≤f⁢(30)f_{h}^{-}\leq f(30), and Hh+≥HlogH_{h}^{+}\geq H_{\log} be the directed table endpoints. Define

(B.17) ℛ⁢(X,Y,Z)\displaystyle\mathcal{R}(X,Y,Z) =500⁢(X−1)+500⁢Z⁢(1−Y)+250⁢Z2⁢(X−1),\displaystyle=500(X-1)+500Z(1-Y)+250Z^{2}(X-1),
Rh\displaystyle R_{h} =ℛ⁢(Fh+,fh−,Hh+),\displaystyle=\mathcal{R}(F_{h}^{+},f_{h}^{-},H_{h}^{+}),
Uh\displaystyle U_{h} =1/μ∗+Rh+Jh+.\displaystyle=1/\mu_{*}+R_{h}+J_{h}^{+}.

The construction has Fh+≥1F_{h}^{+}\geq 1, fh−≤1f_{h}^{-}\leq 1. Thus Rup≤RhR_{\mathrm{up}}\leq R_{h}. This directed endpoint comparison is the monotonicity step of [27, §4.6, (4.73)]. Table B.2 encloses these finite upper bounds. The constants KhiK_{\mathrm{hi}} and LG⁢1L_{G1} are printed exactly in (5.48) and (5.49), with their Paper II locators. The normalization identities are

(B.18) M5,internal\displaystyle M_{5,\mathrm{internal}} =−Khi⁢6073714261109−LG⁢1,\displaystyle=-K_{\mathrm{hi}}\frac{6073714261}{10^{9}}-L_{G1},
M5,internal+Khi⁢(6073714261109−Uh)\displaystyle M_{5,\mathrm{internal}}+K_{\mathrm{hi}}\left(\frac{6073714261}{1% 0^{9}}-U_{h}\right) =−Khi⁢Uh−LG⁢1.\displaystyle=-K_{\mathrm{hi}}U_{h}-L_{G1}.
Table B.2. Directed bounds for the shifted profile with nmesh=512n_{\mathrm{mesh}}=512.
Quantity lower endpoint upper endpoint
RhR_{h} 0.0000043732369550.000004373236955 0.0000043732369560.000004373236956
Jh+J_{h}^{+} 0.9537098867768910.953709886776891 0.9537098867768920.953709886776892
UhU_{h} 6.0737142600138476.073714260013847 6.0737142600138486.073714260013848
6073714261/109−Uh6073714261/10^{9}-U_{h} 0.0000000009861520.000000000986152 0.0000000009861530.000000000986153
Proof.

For the outer partition put n=512n=512, x0=ux_{0}=u, xn=μ∗x_{n}=\mu_{*}, and

(B.19) xi=2−48⁢⌊248⁢(u+(μ∗−u)⁢i/n)⌋(1≤i<n).x_{i}=2^{-48}\left\lfloor 2^{48}\left(u+(\mu_{*}-u)\sqrt{i/n}\right)\right% \rfloor\quad(1\leq i<n).

It is strictly increasing. For the inner integral write

(B.20) gd⁢(x,y)=∫uy1−f⁢((Θ∗⁢(x,y,z)+d−x−y−z)/z)z2⁢𝑑z.g_{d}(x,y)=\int_{u}^{y}\frac{1-f((\Theta_{*}(x,y,z)+d-x-y-z)/z)}{z^{2}}\,dz.

Each branch residual decreases in x,yx,y. Each guard’s active set is a down-set. Thus gdg_{d} is nondecreasing in x,yx,y, guard jumps included.

Let wiw_{i} be an outward upper bound for log⁡(xi/xi−1)\log(x_{i}/x_{i-1}), on the 2−1282^{-128} lattice. Let vi⁢jv_{ij} enclose ghG⁢(xi,xj)g_{h_{G}}(x_{i},x_{j}) upwards on that lattice. The diagonal cell has half the logarithmic square’s area. Hence

(B.21) JhG≤Jh+=∑i=1nwi⁢(∑j<iwj⁢vi⁢j+12⁢wi⁢vi⁢i).J_{h_{G}}\leq J_{h}^{+}=\sum_{i=1}^{n}w_{i}\left(\sum_{j<i}w_{j}v_{ij}+\frac{1% }{2}w_{i}v_{ii}\right).

Split the inner interval at every affine crossing. Include every guard crossing and each branch kink. On each resulting interval the argument is A/z+BA/z+B. If Φ⁢(t)=∫1t(1−f⁢(s))⁢𝑑s\Phi(t)=\int_{1}^{t}(1-f(s))\,ds, then

(B.22) ∫pq1−f⁢(A/z+B)z2⁢𝑑z=Φ⁢(A/p+B)−Φ⁢(A/q+B)A(A≠0).\int_{p}^{q}\frac{1-f(A/z+B)}{z^{2}}\,dz=\frac{\Phi(A/p+B)-\Phi(A/q+B)}{A}% \quad(A\neq 0).

The trivial bound is 1/p−1/q1/p-1/q. The smaller of the two upper bounds may be used. For A=0A=0, the argument is constant.

The delay equations give the primitive explicitly:

(B.23) P⁢(t)=t⁢F⁢(t)2⁢eγ,Φ⁢(t)=t−1−2⁢eγ⁢(P⁢(t+1)−1)(t≥0).P(t)=\frac{tF(t)}{2e^{\gamma}},\qquad\Phi(t)=t-1-2e^{\gamma}(P(t+1)-1)\quad(t% \geq 0).

For t≥30t\geq 30, monotonicity gives

(B.24) Φ⁢(30)≤Φ⁢(t)≤Φ⁢(30)+(t−30)⁢(1−f⁢(30)).\Phi(30)\leq\Phi(t)\leq\Phi(30)+(t-30)(1-f(30)).

We bound the trapezoid error. If gg is either FF or ff and [a,a+h0]⊂[1,30][a,a+h_{0}]\subset[1,30] is one mesh panel, then

(B.25) ∫aa+h0g⁢(s)⁢𝑑s−h02⁢(g⁢(a)+g⁢(a+h0))=−h0312⁢g′′⁢(ξ),a<ξ<a+h0,\int_{a}^{a+h_{0}}g(s)\,ds-{h_{0}\over 2}\bigl{(}g(a)+g(a+h_{0})\bigr{)}=-{h_{% 0}^{3}\over 12}g^{\prime\prime}(\xi),\qquad a<\xi<a+h_{0},

with one-sided interpretations at the integer breakpoints. The mesh has h0=1/65536h_{0}=1/65536 and every breakpoint is a mesh node. We prove the derivative bound independently of the quadrature table. Write C=2⁢eγC=2e^{\gamma}. The elementary inequality γ≤H6−log⁡6\gamma\leq H_{6}-\log 6 and the first three positive terms of the atanh series give

log⁡2>8421215,log⁡3>263240,γ<1285319440<23<log⁡2.\log 2>\frac{842}{1215},\qquad\log 3>\frac{263}{240},\qquad\gamma<\frac{12853}% {19440}<\frac{2}{3}<\log 2.

Thus 0<C<40<C<4 and log⁡2<1\log 2<1. The defining functions satisfy

F⁢(s)=C/s⁢(1≤s≤3),f⁢(s)=0⁢(1≤s≤2),f⁢(s)=C⁢log⁡(s−1)/s⁢(2<s≤3),F(s)=C/s\ (1\leq s\leq 3),\quad f(s)=0\ (1\leq s\leq 2),\quad f(s)=C\log(s-1)/% s\ (2<s\leq 3),
s⁢F⁢(s)=C+∫1s−1f⁢(t)⁢𝑑t,s⁢f⁢(s)=∫1s−1F⁢(t)⁢𝑑t(s>3).sF(s)=C+\int_{1}^{s-1}f(t)\,dt,\qquad sf(s)=\int_{1}^{s-1}F(t)\,dt\quad(s>3).

Induction on unit intervals gives 0≤F,f≤C0\leq F,f\leq C. If the delayed functions are in this range, the integrals have length s−2s-2, so F⁢(s)≤C⁢(s−1)/s≤CF(s)\leq C(s-1)/s\leq C and f⁢(s)≤C⁢(s−2)/s≤Cf(s)\leq C(s-2)/s\leq C. For either companion pair (g,h)=(F,f)(g,h)=(F,f) or (f,F)(f,F), differentiating on open unit intervals gives

g′⁢(s)=h⁢(s−1)−g⁢(s)s,g′′⁢(s)=h′⁢(s−1)s+2⁢(g⁢(s)−h⁢(s−1))s2(s>3).g^{\prime}(s)=\frac{h(s-1)-g(s)}{s},\qquad g^{\prime\prime}(s)=\frac{h^{\prime% }(s-1)}{s}+\frac{2(g(s)-h(s-1))}{s^{2}}\quad(s>3).

For ff, the first-derivative delay identity holds already for t>2t>2. For FF on 2<t<32<t<3, use F′⁢(t)=−C/t2F^{\prime}(t)=-C/t^{2}. Hence |F′⁢(t)|,|f′⁢(t)|≤C/t|F^{\prime}(t)|,|f^{\prime}(t)|\leq C/t for t>2t>2. Since g⁢(s),h⁢(s−1)∈[0,C]g(s),h(s-1)\in[0,C], for s>3s>3

|g′′⁢(s)|≤Cs⁢(s−1)+2⁢Cs2≤7⁢C18<149<12.|g^{\prime\prime}(s)|\leq\frac{C}{s(s-1)}+\frac{2C}{s^{2}}\leq\frac{7C}{18}<% \frac{14}{9}<12.

On the initial intervals,

F′′⁢(s)=2⁢C/s3⁢(1<s<3),f′′⁢(s)=0⁢(1<s<2),F^{\prime\prime}(s)=2C/s^{3}\ (1<s<3),\quad f^{\prime\prime}(s)=0\ (1<s<2),
f′′⁢(s)=C⁢(2⁢log⁡(s−1)s3−1s⁢(s−1)2−2s2⁢(s−1))⁢(2<s<3).f^{\prime\prime}(s)=C\left(\frac{2\log(s-1)}{s^{3}}-\frac{1}{s(s-1)^{2}}-\frac% {2}{s^{2}(s-1)}\right)\ (2<s<3).

The formulas imply 0≤F′′≤80\leq F^{\prime\prime}\leq 8 on [1,2][1,2], 0≤F′′≤10\leq F^{\prime\prime}\leq 1 on [2,3][2,3], and −4≤f′′≤log⁡2<1-4\leq f^{\prime\prime}\leq\log 2<1 on [2,3][2,3]. Inside the last parentheses each negative term has magnitude at most 1/21/2. The positive term is at most log⁡2/4\log 2/4. Therefore |g′′|≤8<12|g^{\prime\prime}|\leq 8<12 on all smooth panel interiors of [1,30][1,30], with one-sided limits at the integer breakpoints.

The archived outward intervals and the independently computed exact rational intervals are recorded with the reproducibility materials. The derivative check starts from the proved invariant and then rebuilds the delay table. It checks every computed unit-interval enclosure against the archived coarse intervals. It confirms that the computed global bound is ≤12\leq 12, the recorded value:

rangeF′′f′′[1,2][0,8][0,0][2,3][−8,8][−4,4][3,30][−12,12][−12,12]\begin{array}[]{c|cc}\text{range}&F^{\prime\prime}&f^{\prime\prime}\\ \hline\cr[1,2]&[0,8]&[0,0]\\ {}[2,3]&[-8,8]&[-4,4]\\ {}[3,30]&[-12,12]&[-12,12]\end{array}

The computed bound is 8. Hence the absolute local remainder is at most 8⁢h03/12=(2/3)⁢h03≤h038h_{0}^{3}/12=(2/3)h_{0}^{3}\leq h_{0}^{3}. The verifier checks this radius against the h03h_{0}^{3} panel allowance before it accepts the regenerated table. The M5 computation builds the delay table with DEN=65536, S=128, 160-bit Arb interval arithmetic, and 1,900,545 generated nodes. The shifted computation then evaluates the exact nmesh=512n_{\mathrm{mesh}}=512 triangular grid, with 512⋅513/2=131,328512\cdot 513/2=131,328 inner-grid evaluations. It stores one aggregated row per outer index. Hence SHIFT-N512-fresh.json contains 512 rows for the 131,328 evaluations. The M5 computation uses no Taylor model and no width-1/321/32 step. The historical Taylor certificate provides background information and is not an input to this calculation. The table and shifted rows are regenerated before the directed inclusion check. The verifier compares recorded JSON fields and exact row values. It also checks SHA-256 hashes of the canonical compact-JSON integer arrays used by the real-inclusion verifier. These canonical-array hashes differ from hashes of regenerated JSON files. File formatting is not used as a certificate. Directed summation gives Table B.2. The positive last row proves the strict cap. The 512 aggregated rows give the exact 131328-term sum used for Jh+J_{h}^{+}. The directed real-inclusion result records the directed tail and the cap check. The reproducibility report documents the execution boundary. The two normalization identities follow by expansion. ∎

The proposition concerns the scalar functional only. The prime-sum comparison is required separately in Section 5.

B.4. Unshifted comparison (historical and not used)

Status: historical and non-certified.

This historical unshifted comparison records an earlier n=8192n=8192 calculation for context only. No current computation reproduces it. None of its values, table, constants or comparison is an input to the main proof. The comparison concerns the unshifted functional G∗:=𝒢0G_{*}:=\mathcal{G}_{0}. It is distinct from the main-line coefficient bound G0=6088440363/109G_{0}=6088440363/10^{9}. The main K2 and L3 comparisons use the latter via [27, (4.73), (4.75), (4.79), (A.10a)]. They do not use U0U_{0}. The cited bound G∗≤G0G_{*}\leq G_{0} is the coefficient used in the main argument. It does not assert the separate, sharper G∗≤U0G_{*}\leq U_{0} comparison. This appendix proves that comparison only conditionally, as an optional one. Its historical delay table was constructed separately, but no such table or producer is part of the current proof package. The panel width is h0=1/65536h_{0}=1/65536. At 192-bit precision, each trapezoid receives radius h03h_{0}^{3}. On smooth panel interiors, |F′′|,|f′′|<12|F^{\prime\prime}|,|f^{\prime\prime}|<12. The panels meet the integer breakpoints. This bounds each local truncation remainder. The endpoint enclosures pass through the delay recursion in Arb ball arithmetic. Accumulated input radii are thus kept before outward rounding. All table endpoints are then rounded outwards to 2−1282^{-128}. The primitive and true tail use (B.24). This table gives a historical directed bound for RupR_{\mathrm{up}}. It is kept only to reproduce the earlier non-certified calculation. The separate earlier Taylor models are not part of the M5 computation. Let F0+≥F⁢(30)F_{0}^{+}\geq F(30), f0−≤f⁢(30)f_{0}^{-}\leq f(30), and H0+≥HlogH_{0}^{+}\geq H_{\log} be these directed endpoints. Define

(B.26) R0=ℛ⁢(F0+,f0−,H0+)≥Rup.R_{0}=\mathcal{R}(F_{0}^{+},f_{0}^{-},H_{0}^{+})\geq R_{\mathrm{up}}.

The earlier finite calculation used n=8192n=8192 in (B.19). The outer sum has n⁢(n+1)/2=33558528n(n+1)/2=33558528 nodes. Write J0+J_{0}^{+} for that upper-corner sum. Table B.3 groups its eight consecutive row ranges. Each row lists a lower and upper bound for the sum. The diagonal half-weights are already included.

Table B.3. Historical non-certified contributions to the unshifted sum.
Rows nodes lower endpoint upper endpoint
11–10241024 524800 0.000002727813799350 0.000002727813799351
10251025–20482048 1573376 0.001226034866061399 0.001226034866061400
20492049–30723072 2621952 0.019651743682986805 0.019651743682986806
30733073–40964096 3670528 0.080548405705743750 0.080548405705743751
40974097–51205120 4719104 0.146720281588383935 0.146720281588383936
51215121–61446144 5767680 0.200161682376550457 0.200161682376550458
61456145–71687168 6816256 0.242188572133550572 0.242188572133550573
71697169–81928192 7864832 0.275672089024516687 0.275672089024516688

The earlier, non-certified calculation reported

(B.27) J0+\displaystyle J_{0}^{+} <0.966171537191592960294580903427,\displaystyle<0.966171537191592960294580903427,
R0\displaystyle R_{0} <0.000004373236943357822206406687,\displaystyle<0.000004373236943357822206406687,
U0\displaystyle U_{0} =1/μ∗+R0+J0++12⋅1085\displaystyle=1/\mu_{*}+R_{0}+J_{0}^{+}+\frac{1}{2\cdot 10^{85}}
∈[6.086175910428536318116787310112545656706640625,\displaystyle\in[6.086175910428536318116787310112545656706640625,
6.086175910428536318116787310112545656706640626].\displaystyle\hskip 23.99997pt6.086175910428536318116787310112545656706640626].

The term 1/(2⋅1085)1/(2\cdot 10^{85}) bounds directed outer-sum rounding. The shifted computation does not use this interval. The comparison with the continuous functional is one-sided:

(B.28) Historical comparison (not certified): ⁢G∗=𝒢0≤U0.\text{Historical comparison (not certified): }G_{*}=\mathcal{G}_{0}\leq U_{0}.

No claim 2⁢e−γ⁢U0≤c2e^{-\gamma}U_{0}\leq c follows from the printed interval. The finite row sums alone prove no prime-sum estimate. The source comparison and its error terms remain required.

B.5. The sixth-sum constant

The certified finite enclosure is

(B.29) 𝔤RA∈[0.0989598353353, 0.0989598353355].\mathfrak{g}_{\mathrm{RA}}\in[0.0989598353353,\ 0.0989598353355].

Here 𝔤RA\mathfrak{g}_{\mathrm{RA}} denotes the integral quantity in Section 6. The constant used in the final bound is

(B.30) gRA,lo=9895983531010=0.0989598353.g_{\mathrm{RA,lo}}=\frac{989598353}{10^{10}}=0.0989598353.

Thus the certified enclosure gives

(B.31) 74999999⁢(JJ⁢(1/2)−JJ⁢(5227/10000))−510681931557955000=𝔤RA>gRA,lo.\frac{7499}{9999}\left(J_{J}(1/2)-J_{J}(5227/10000)\right)-\frac{5106819}{3155% 7955000}=\mathfrak{g}_{\mathrm{RA}}>g_{\mathrm{RA,lo}}.

Only this conservative lower constant enters the final bound.

B.6. Computer checks

Table B.6 lists the supplementary scripts. The second column states what each one checks. The partitions and defining formulas are printed above. The exact-arithmetic checks use Python’s integer and fraction types. Environment and timing details are recorded in the reproducibility materials. They are not theorem inputs. A full numerical regeneration is distinguished from a compact check. The certificate bundle is available at the location given in the Data availability statement; its SHA-256 manifest hash is 81fc00441c3a3f0924995cd41263feddece827d9b40376dae531191c86f90ed3. The recorded M5 regeneration agrees with the exact 512-row certificate. The reproducibility certificate set is independent. It consists of the H6 RESULT.json, the 512-row M5 output, the Root–A enclosure, and the verifier scripts for those records. Each record is checked against the source hashes and the manifest. None replaces an analytic estimate.

Table B.4. Scripts and finite checks.
Script Statements checked Time
Reproducibility replay verifier manifests, source hashes, TeX structure, finite consistency checks, and the producer verification run replay
H6/M5 producer verification executes the H6 computation and M5 nmesh=512n_{\mathrm{mesh}}=512 table, shifted probe and real-inclusion verifier, computing the derivative enclosure and comparing regenerated outputs replayed
H6 directed verifier regenerates the directed H6 rows from the source inputs and Arb runtime replayed
M5 derivative verifier exact rational unit-interval bounds for F′′F^{\prime\prime} and f′′f^{\prime\prime} and the panel radius replayed
M5 table, shift and inclusion verifiers regenerates the D⁢E⁢N=65536DEN=65536 delay table, nmesh=512n_{\mathrm{mesh}}=512 rows, and real inclusion replayed
Finite consistency verifier exact finite arithmetic, orbit, and sign checks for the patches replayed

The reproducibility verifier checks the recorded inputs and then runs the producer verification. That run regenerates the H6 output, the M5 delay table, the shifted rows and the real inclusion on the recorded platform. The earlier unshifted calculation used Python 3.12.3 and python-flint 0.9.0, with four workers. Its slowest worker took 76397639 seconds, rounded upwards. The historical unshifted comparison is optional and not certified. The main proof does not use it, and it does not affect the shifted computation. Neither these scripts nor their agreement establishes a uniform estimate. The final proof requires the analytic comparisons in Sections 5–8.

B.7. Rows of the retained side

The index set ℐ\mathcal{I} of Section 5 consists of Paper II’s nineteen original row chains and one outer chain. The outer chain T5\mathrm{T5} covers the upper part of S5S_{5}, Lemma 5.1. Sixteen of the row chains are listed below, each with its source parent and raw coefficient. The remaining three are Paper II’s single-prefix comparisons for S3S_{3}, S8S_{8} and S9S_{9}. They keep Paper II’s own sources, restorations and error entries unchanged. The four rows of ℋ\mathcal{H} are restored to their parents S4S_{4}, S5S_{5}, S7S_{7} and S10S_{10}. The lower part of S5S_{5} has no separate restoration address. The four joint rows are restored once to the joint source of G1G_{1} with weights (2,1,1)(2,1,1).

Row Parent Coefficient Row Parent Coefficient
S1-0 S1 33 S4 S4 −1-1
S1-1 S1 −3-3 S5-low S5 −1-1
S1-2 S1 33 S7 S7 −1-1
S1-3 S1 −3-3 S10-Ret S10 11
S2-0 S2 11 G1-0 G1 (2,1,1)(2,1,1) −1-1
S2-1 S2 −1-1 G1-1 G1 (2,1,1)(2,1,1) 11
S2-2 S2 11 G1-2 G1 (2,1,1)(2,1,1) −1-1
S2-3 S2 −1-1 G1-3 G1 (2,1,1)(2,1,1) 11

These sixteen rows, their seven source-parent restorations and four outer terms carry 9191 error addresses. Each address occurs exactly once. One outer term is the chain T5\mathrm{T5}. The others are the strict BV piece of S2S_{2}, inside its joint group, and two G1G_{1} comparator entries. The same table has seven further rows with 3838 addresses. They treat S3S_{3}, S8S_{8} and S9S_{9} another way, and this paper does not use them.

B.8. Statements for the sixth sum

The sixth-sum argument uses the following statements.

Statement
Lemma 6.2 (rough-factor distribution)
Lemma 6.4 (four-family Siegel–Walfisz); range N1/3/8≤HN^{1/3}/8\leq H
Lemmas 6.6 and 6.7 (selector and tensor, applied per shell pair)
Lemma 6.5 (transferred mean square)
Lemma 6.8 (two-factor convolution)
Lemma 6.9 (central rectangles)
Proper powers, (6.26)
Fact 3.2 (maximal prime estimates)
Paper I, (2.21), as used in Paper I, (3.25)

Use of AI tools

The author devised the method of proof. Codex (OpenAI, Astra 6) derived and checked the estimates, wrote the Python code for the certificates in Appendix B and ran blind reviews of the manuscript. Claude Code (Anthropic, Claude Fable 5) checked the proofs, the numerical certificates and the references. The author checked every step of the proof, every table and every reference, and takes full responsibility for the content of the paper.

Statements and declarations

Competing interests. The author has no competing interests.

Funding. No funding was received for this work.

Data availability. The supplementary scripts, exact inputs and compact outputs are archived as paper-iii-public-certificates-v1.tar.gz with release v1 at https://github.com/ryzfsu/goldbach-1plus1.75-theorem/releases/download/v1/paper-iii-public-certificates-v1.tar.gz.

The SHA-256 hash of the archive’s internal SHA256SUMS manifest is 81fc00441c3a3f0924995cd41263feddece827d9b40376dae531191c86f90ed3.

References