Contents

The Goldbach exceptional set: an exponent 11/20

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

We prove E⁢(X)≪εX11/20+εE(X)\ll_{\varepsilon}X^{11/20+\varepsilon} for every ε>0\varepsilon>0. Here E⁢(X)E(X) counts the positive even integers at most XX that are not sums of two primes. A four-level Harman decomposition gives a signed prime minorant. Exact rational bounds for four discarded families give a positive lower bound for its logarithmically weighted mass. We prove a Bombieri–Vinogradov estimate at level X9/20−ηX^{9/20-\eta}, with both maxima and a divisor weight. We also bound the exponential sum of the same weight on the minor arcs. The major arcs use classical zero-density estimates and the zero-free half-plane ℜ⁡s>7/8\Re s>7/8 of OpenAI [6, Theorem 1.1].

Key words and phrases:
Goldbach problem, exceptional set, Harman sieve, Bombieri–Vinogradov theorem, Dirichlet LL-functions
2020 Mathematics Subject Classification:
Primary 11P32; Secondary 11N35, 11M26

1. Introduction

Let ℙ\mathbb{P} denote the set of primes, and put

(1.1) E⁢(X)=#⁢{n∈ℕ:n≤X, 2∣n,n≠p+p′⁢ for all ⁢p,p′∈ℙ}.E(X)=\#\{n\in\mathbb{N}:n\leq X,\ 2\mid n,\ n\neq p+p^{\prime}\text{ for all }% p,p^{\prime}\in\mathbb{P}\}.

The two primes need not be distinct.

Theorem 1.

For every ε>0\varepsilon>0,

(1.2) E⁢(X)≪εX11/20+ε.E(X)\ll_{\varepsilon}X^{11/20+\varepsilon}.

Pintz and Althöfer obtain the exponent 7/127/12 from the zero-free theorem (2) below, and Pintz’s method gives 3/53/5 under H7/8H_{7/8}. Theorem 1 improves both exponents:

1120<712<35.\frac{11}{20}<\frac{7}{12}<\frac{3}{5}.

The hypothesis and the precise citations are stated below. The 7/87/8 zero-free theorem is an external input and is not reproved here.

1.1. The zero-free hypothesis

Hypothesis H7/8H_{7/8}. For every Dirichlet character χ\chi,

(H7/8H_{7/8}) L⁢(s,χ)≠0(ℜ⁡s>7/8).L(s,\chi)\neq 0\qquad(\Re s>7/8).

This includes the character modulo 11, whose LL-function is ζ⁢(s)\zeta(s). The functional equation then gives

(1.3) 18≤β≤78\frac{1}{8}\leq\beta\leq\frac{7}{8}

for every nontrivial zero ϱ=β+i⁢γ\varrho=\beta+i\gamma. An imprimitive character has the same nontrivial zeros as its inducing primitive character.

Theorem 2.

Assume H7/8H_{7/8}. For every ε>0\varepsilon>0,

(1.4) E⁢(X)≪εX11/20+ε.E(X)\ll_{\varepsilon}X^{11/20+\varepsilon}.

(F1)  [6, Theorem 1.1] Every Dirichlet LL-function, including ζ⁢(s)\zeta(s), is zero-free in ℜ⁡s>7/8\Re s>7/8.

(F2)  [8, Theorem 1 and Corollary 2] Theorem 1 assumes a common zero-free half-plane Hθ0H_{\theta_{0}}. Corollary 2 invokes [6, Theorem 1.1] and gives the exponent 7/127/12 without a hypothesis in its statement. The exponent obtained from Pintz’s method under H7/8H_{7/8} is 3/53/5; see [7, Sections 6–8].

Theorem 1 follows from Theorem 2 and (2); the short proof is in Section 11.

1.2. The method

We construct a signed minorant on I=(X/8,X/4]I=(X/8,X/4]. Every discarded term is nonnegative, and every negative term is retained or expanded. The loss of mass comes from four discarded families, and their rational upper bounds give

(1.5) ∑m∈I(log⁡m)⁢ρ⁢(m)≥(ccert8−o⁢(1))⁢X,ccert=3421554308992250000000000>320.\sum_{m\in I}(\log m)\rho(m)\geq\left(\frac{c_{\mathrm{cert}}}{8}-o(1)\right)X% ,\qquad c_{\mathrm{cert}}=\frac{342155430899}{2250000000000}>\frac{3}{20}.

Only a lower bound is asserted.

Put λ⁢(m)=(log⁡m)⁢ρ⁢(m)\lambda(m)=(\log m)\rho(m); this weight is used throughout. Its distribution estimate keeps both maxima inside the modulus sum and includes the factor 2ω⁢(d)2^{\omega(d)}. The minor-arc estimate is

supα∈𝔪|Sλ⁢(α)|≪X31/40+η/2⁢L9/2.\sup_{\alpha\in\mathfrak{m}}|S_{\lambda}(\alpha)|\ll X^{31/40+\eta/2}L^{9/2}.

Under H7/8H_{7/8} the major arcs contribute at least 0.025⁢X0.025X, and the resulting dyadic exceptional-set bound is

|ℰX|≪𝒮2⁢LX≪X31/20+η−1⁢L10=X11/20+η⁢L10=X1−t⁢L10.|\mathcal{E}_{X}|\ll\frac{\mathcal{S}^{2}L}{X}\ll X^{31/20+\eta-1}L^{10}=X^{11% /20+\eta}L^{10}=X^{1-t}L^{10}.

The major-arc argument follows [7, Section 8]. We derive the required mean square from zero-density estimates and do not use [7, (8.25)]. Heath-Brown’s 20/920/9 estimate limits this argument to levels t<9/20t<9/20. The mass, distribution and minor-arc estimates are all unconditional.

2. Notation and parameters

Write L=log⁡XL=\log X and e⁢(x)=e2⁢π⁢i⁢xe(x)=e^{2\pi ix}. Given ε>0\varepsilon>0, choose

(2.1) η=min⁡(ε/2,1/100),T=920,t=920−η,ε0=η10,X1=X1−ε0,εHB=η90.\begin{gathered}\eta=\min(\varepsilon/2,1/100),\qquad T=\frac{9}{20},\qquad t=% \frac{9}{20}-\eta,\\ \varepsilon_{0}=\frac{\eta}{10},\qquad X_{1}=X^{1-\varepsilon_{0}},\qquad% \varepsilon_{\mathrm{HB}}=\frac{\eta}{90}.\end{gathered}

The decomposition level TT is fixed, and the analysis level is tt. Put

(2.2) z=X1/10,A=X9/20,D=X11/20,I=(X/8,X/4].z=X^{1/10},\qquad A=X^{9/20},\qquad D=X^{11/20},\qquad I=(X/8,X/4].

Then

(2.3) A⁢z=D,A⁢D=X,z4<A<z5,z10=X.Az=D,\qquad AD=X,\qquad z^{4}<A<z^{5},\qquad z^{10}=X.

Let PP be any integer satisfying

(2.4) 12⁢Xt≤P≤Xt.\frac{1}{2}X^{t}\leq P\leq X^{t}.

All estimates are uniform in this choice. We keep the three parameters

(2.5) QP=X/P,QB=Xt,Q0=⌈2⁢X/P⌉Q_{P}=X/P,\qquad Q_{B}=X^{t},\qquad Q_{0}=\lceil 2X/P\rceil

distinct; they govern arc widths, distribution and Dirichlet approximation. The choice of ε0\varepsilon_{0} gives

(2.6) 1−ε0−209⁢t=19190⁢η>0.1-\varepsilon_{0}-\frac{20}{9}t=\frac{191}{90}\eta>0.

For large XX,

(2.7) 2⁢P2<X,D≤X/P≤2⁢X11/20+η,P<X1/2<X1≤X/8,A3/2=X27/40.\begin{gathered}2P^{2}<X,\qquad D\leq X/P\leq 2X^{11/20+\eta},\\ P<X^{1/2}<X_{1}\leq X/8,\qquad A^{3/2}=X^{27/40}.\end{gathered}

Implied constants may depend on fixed saving exponents and on η\eta. They are uniform in all variables within the stated ranges.

Let P−⁢(v)P^{-}(v) be the least prime factor of vv, with P−⁢(1)=+∞P^{-}(1)=+\infty, and put

ψ⁢(v,w)=𝟏P−⁢(v)≥w.\psi(v,w)=\mathbf{1}_{P^{-}(v)\geq w}.

Thus ψ⁢(1,w)=1\psi(1,w)=1, and we call vv with ψ⁢(v,w)=1\psi(v,w)=1 ww-rough. The function Ω⁢(v)\Omega(v) counts prime factors with multiplicity. In 2ω⁢(d)2^{\omega(d)} the function ω⁢(d)\omega(d) counts distinct prime factors; elsewhere ω⁢(u)\omega(u) denotes Buchstab’s function:

(2.8) ω⁢(u)=1/u(1≤u≤2),(u⁢ω⁢(u))′=ω⁢(u−1)(u>2).\omega(u)=1/u\quad(1\leq u\leq 2),\qquad(u\omega(u))^{\prime}=\omega(u-1)\quad% (u>2).

Buchstab’s function is continuous on [1,∞)[1,\infty).

For f:ℕ→ℂf:\mathbb{N}\to\mathbb{C}, put

(2.9) Δf⁢(d)=max(a,d)=1⁡maxy≤X⁡|∑m≤ym≡a(modd)f⁢(m)−1φ⁢(d)⁢∑m≤y(m,d)=1f⁢(m)|.\Delta_{f}(d)=\max_{(a,d)=1}\max_{y\leq X}\left|\sum_{\begin{subarray}{c}m\leq y% \\ m\equiv a\pmod{d}\end{subarray}}f(m)-\frac{1}{\varphi(d)}\sum_{\begin{subarray% }{c}m\leq y\\ (m,d)=1\end{subarray}}f(m)\right|.

Both maxima are part of this definition, and subadditivity and cutoff monotonicity give

(2.10) Δf⁢𝟏[1,Y]≤Δf,Δf⁢𝟏(Y1,Y2]≤2⁢Δf\Delta_{f\mathbf{1}_{[1,Y]}}\leq\Delta_{f},\qquad\Delta_{f\mathbf{1}_{(Y_{1},Y% _{2}]}}\leq 2\Delta_{f}

for endpoints at most XX.

Let ‖x‖\|x\| denote the distance to the nearest integer, and define

(2.11) 𝔐⁢(q,a)\displaystyle\mathfrak{M}(q,a) ={α∈ℝ/ℤ:‖α−a/q‖≤1/(q⁢QP)},\displaystyle=\{\alpha\in\mathbb{R}/\mathbb{Z}:\|\alpha-a/q\|\leq 1/(qQ_{P})\},
𝔐\displaystyle\mathfrak{M} =⋃q≤P⋃amodq(a,q)=1𝔐⁢(q,a),𝔪=(ℝ/ℤ)∖𝔐.\displaystyle=\bigcup_{q\leq P}\ \bigcup_{\begin{subarray}{c}a\bmod q\\ (a,q)=1\end{subarray}}\mathfrak{M}(q,a),\qquad\mathfrak{m}=(\mathbb{R}/\mathbb% {Z})\setminus\mathfrak{M}.

These arcs are disjoint, since distinct reduced fractions are at distance at least 1/(q⁢q′)1/(qq^{\prime}) and q+q′≤2⁢P<QPq+q^{\prime}\leq 2P<Q_{P}. Once λ\lambda is defined, put

(2.12) S⁢(α)=∑X1<p≤X(log⁡p)⁢e⁢(p⁢α),Sλ⁢(α)=∑m∈Iλ⁢(m)⁢e⁢(m⁢α).S(\alpha)=\sum_{X_{1}<p\leq X}(\log p)e(p\alpha),\qquad S_{\lambda}(\alpha)=% \sum_{m\in I}\lambda(m)e(m\alpha).

For 𝔅=𝔐\mathfrak{B}=\mathfrak{M} or 𝔪\mathfrak{m}, write

I𝔅⁢(n)=∫𝔅S⁢(α)⁢Sλ⁢(α)⁢e⁢(−n⁢α)⁢𝑑α.I_{\mathfrak{B}}(n)=\int_{\mathfrak{B}}S(\alpha)S_{\lambda}(\alpha)e(-n\alpha)% \,d\alpha.

Finally,

cq⁢(v)=∑amodq(a,q)=1e⁢(a⁢v/q).c_{q}(v)=\sum_{\begin{subarray}{c}a\bmod q\\ (a,q)=1\end{subarray}}e(av/q).

A star on a character sum restricts it to primitive characters.

3. The four-level Harman weight

3.1. Two exact identities

Lemma 3.1.

For every integer m>z2m>z^{2},

(3.1) 𝟏ℙ⁢(m)=ψ⁢(m,z)−∑p∣mp≥z,p2≤mψ⁢(m/p,p).\mathbf{1}_{\mathbb{P}}(m)=\psi(m,z)-\sum_{\begin{subarray}{c}p\mid m\\ p\geq z,\ p^{2}\leq m\end{subarray}}\psi(m/p,p).

For k≥1k\geq 1 and z≤yz\leq y,

(3.2) ψ⁢(k,y)=ψ⁢(k,z)−∑p∣kz≤p<yψ⁢(k/p,p).\psi(k,y)=\psi(k,z)-\sum_{\begin{subarray}{c}p\mid k\\ z\leq p<y\end{subarray}}\psi(k/p,p).
Proof.

If mm is prime, the sum in (3.1) is empty. If mm is composite and zz-rough, only p=P−⁢(m)p=P^{-}(m) contributes, and this prime satisfies p2≤mp^{2}\leq m. If P−⁢(m)<zP^{-}(m)<z, every term on the right vanishes; this case includes prime powers.

For (3.2), the case k=1k=1 is immediate. Otherwise put q=P−⁢(k)q=P^{-}(k). For q≥yq\geq y the sum is empty, and for z≤q<yz\leq q<y only p=qp=q contributes. For q<zq<z, every term vanishes. ∎

Both identities hold when their left sides vanish, so we expand zero-valued terms as well.

3.2. The stopping rule

For m∈Im\in I, a node of depth jj consists of primes

p1>p2>⋯>pj≥z,Pj:=p1⁢⋯⁢pj∣m,p12≤m.p_{1}>p_{2}>\dots>p_{j}\geq z,\qquad P_{j}:=p_{1}\cdots p_{j}\mid m,\qquad p_{% 1}^{2}\leq m.

It carries (−1)j⁢ψ⁢(m/Pj,pj)(-1)^{j}\psi(m/P_{j},p_{j}), and expanding it by (3.2) gives

(3.3) (−1)j⁢ψ⁢(m/Pj,pj)=(−1)j⁢ψ⁢(m/Pj,z)+∑pj+1∣m/Pjz≤pj+1<pj(−1)j+1⁢ψ⁢(m/Pj+1,pj+1).\begin{split}(-1)^{j}\psi(m/P_{j},p_{j})={}&(-1)^{j}\psi(m/P_{j},z)\\ &+\sum_{\begin{subarray}{c}p_{j+1}\mid m/P_{j}\\ z\leq p_{j+1}<p_{j}\end{subarray}}(-1)^{j+1}\psi(m/P_{j+1},p_{j+1}).\end{split}

The first term is a retained rough leaf, denoted RjR_{j}, and the root is R0⁢(m)=ψ⁢(m,z)R_{0}(m)=\psi(m,z).

At depth 11, stop when A≤p1≤DA\leq p_{1}\leq D, which gives the leaf B1B_{1}, and expand when p1<Ap_{1}<A. At depth 22, stop when A≤P2≤DA\leq P_{2}\leq D, which gives B2B_{2}. Discard the nodes with P2>DP_{2}>D, which form U2U_{2}, and expand every node with P2<AP_{2}<A. At depth 33, stop when A≤P3≤DA\leq P_{3}\leq D, giving B3B_{3}, and expand both ranges P3<AP_{3}<A and P3>DP_{3}>D. At depth 44, stop when A≤P4≤DA\leq P_{4}\leq D, giving B4B_{4}. Discard all other nodes; they form L4L_{4}, U4U_{4} and V4V_{4} as specified below.

Every depth-11 node has p1≤X/4<Dp_{1}\leq\sqrt{X/4}<D. Every depth-33 node has P2<AP_{2}<A, and therefore

(3.4) p3<p2<P21/2<A1/2,P3<A3/2=X27/40.p_{3}<p_{2}<P_{2}^{1/2}<A^{1/2},\qquad P_{3}<A^{3/2}=X^{27/40}.

If P3>DP_{3}>D, then every child has P4>DP_{4}>D, so B4B_{4} and L4L_{4} can arise only from P3<AP_{3}<A. There are no nodes of depth 55.

Table 3.1 defines every family. Each entry is summed over decreasing primes at least zz with Pj∣mP_{j}\mid m. The condition p12≤mp_{1}^{2}\leq m is imposed in every nonempty row. For p1<Ap_{1}<A, this condition is automatic on II:

(3.5) p12<X9/10<X/8<mp_{1}^{2}<X^{9/10}<X/8<m

for X>810X>8^{10}.

Table 3.1. Leaves of the decomposition.
Family Prefix conditions Residual Sign
R0R_{0} Empty prefix ψ⁢(m,z)\psi(m,z) ++
R1R_{1} p1<Ap_{1}<A ψ⁢(m/p1,z)\psi(m/p_{1},z) −-
R2R_{2} p1<Ap_{1}<A, P2<AP_{2}<A ψ⁢(m/P2,z)\psi(m/P_{2},z) ++
R3R_{3} p1<Ap_{1}<A, P2<AP_{2}<A, and P3<AP_{3}<A or P3>DP_{3}>D ψ⁢(m/P3,z)\psi(m/P_{3},z) −-
B1B_{1} A≤p1≤DA\leq p_{1}\leq D ψ⁢(m/p1,p1)\psi(m/p_{1},p_{1}) −-
B2B_{2} p1<Ap_{1}<A, A≤P2≤DA\leq P_{2}\leq D ψ⁢(m/P2,p2)\psi(m/P_{2},p_{2}) ++
B3B_{3} p1<Ap_{1}<A, P2<AP_{2}<A, A≤P3≤DA\leq P_{3}\leq D ψ⁢(m/P3,p3)\psi(m/P_{3},p_{3}) −-
B4B_{4} p1<Ap_{1}<A, P2<AP_{2}<A, P3<AP_{3}<A, A≤P4≤DA\leq P_{4}\leq D ψ⁢(m/P4,p4)\psi(m/P_{4},p_{4}) ++
U2U_{2} p1<Ap_{1}<A, P2>DP_{2}>D ψ⁢(m/P2,p2)\psi(m/P_{2},p_{2}) ++
L4L_{4} p1<Ap_{1}<A, P2<AP_{2}<A, P3<AP_{3}<A, P4<AP_{4}<A ψ⁢(m/P4,p4)\psi(m/P_{4},p_{4}) ++
U4U_{4} p1<Ap_{1}<A, P2<AP_{2}<A, P3<AP_{3}<A, P4>DP_{4}>D ψ⁢(m/P4,p4)\psi(m/P_{4},p_{4}) ++
V4V_{4} p1<Ap_{1}<A, P2<AP_{2}<A, P3>DP_{3}>D ψ⁢(m/P4,p4)\psi(m/P_{4},p_{4}) ++
Proposition 3.2.

For m∈Im\in I,

(3.6) 𝟏ℙ⁢(m)=R0−R1+R2−R3−B1+B2−B3+B4+U2+L4+U4+V4.\begin{split}\mathbf{1}_{\mathbb{P}}(m)={}&R_{0}-R_{1}+R_{2}-R_{3}-B_{1}+B_{2}% -B_{3}+B_{4}\\ &+U_{2}+L_{4}+U_{4}+V_{4}.\end{split}
Proof.

Start with (3.1) and apply (3.3) according to the stopping rule. The process terminates at depth 44, and Table 3.1 lists every terminal term with its sign. Every step is an exact identity. ∎

3.3. The weight and its support

On II, define

(3.7) ρ=R0−R1+R2−R3−B1+B2−B3+B4=𝟏ℙ−U2−L4−U4−V4.\begin{split}\rho&=R_{0}-R_{1}+R_{2}-R_{3}-B_{1}+B_{2}-B_{3}+B_{4}\\ &=\mathbf{1}_{\mathbb{P}}-U_{2}-L_{4}-U_{4}-V_{4}.\end{split}

Set ρ=0\rho=0 off II, and put

(3.8) λ⁢(m)=(log⁡m)⁢ρ⁢(m),Fλ=∑m∈Iλ⁢(m).\lambda(m)=(\log m)\rho(m),\qquad F_{\lambda}=\sum_{m\in I}\lambda(m).

Every discarded term is nonnegative. Hence

(3.9) ρ⁢(m)≤𝟏ℙ⁢(m),λ⁢(m)≤(log⁡m)⁢𝟏ℙ⁢(m).\rho(m)\leq\mathbf{1}_{\mathbb{P}}(m),\qquad\lambda(m)\leq(\log m)\mathbf{1}_{% \mathbb{P}}(m).

The weight may be negative. Every nonzero term is zz-rough, and since m≤X/4<z10m\leq X/4<z^{10}, its support satisfies

(3.10) Ω⁢(m)≤9.\Omega(m)\leq 9.

A node is determined by at most four distinct prime factors of mm, and it contributes at most one retained term. Thus

(3.11) |ρ⁢(m)|≤∑j=04(9j)=256,|λ⁢(m)|≤28⁢L.|\rho(m)|\leq\sum_{j=0}^{4}\binom{9}{j}=256,\qquad|\lambda(m)|\leq 2^{8}L.

For BjB_{j}, write u=Pju=P_{j} and v=m/uv=m/u; the product uu determines its ordered prime prefix. For B1B_{1} we have v>1v>1, since p1≤D<X/8p_{1}\leq D<X/8, and then ψ⁢(v,p1)=1\psi(v,p_{1})=1 forces v≥p1v\geq p_{1}. Thus p12≤mp_{1}^{2}\leq m is automatic here as well. Every balanced family has

(3.12) A≤u≤D,A/8<v≤D/4.A\leq u\leq D,\qquad A/8<v\leq D/4.

Its only roughness coupling is ψ⁢(v,P−⁢(u))\psi(v,P^{-}(u)), and no retained family is a bare prime sum.

4. The mass estimate

(F3)  [1, Chapters 7 and 18] We use the prime number theorem and Mertens’ estimate in the forms

π⁢(x)=xlog⁡x+O⁢(xlog2⁡x),π⁢(x)=li⁡(x)+O⁢(xlog3⁡x),\displaystyle\pi(x)=\frac{x}{\log x}+O\left(\frac{x}{\log^{2}x}\right),\qquad% \pi(x)=\operatorname{li}(x)+O\left(\frac{x}{\log^{3}x}\right),
θ⁢(x)=∑p≤xlog⁡p=x+O⁢(x⁢e−c⁢log⁡x),\displaystyle\theta(x)=\sum_{p\leq x}\log p=x+O(xe^{-c\sqrt{\log x}}),
∑y<p≤x1p=log⁡log⁡xlog⁡y+O⁢(1log⁡y)(x≥y≥2).\displaystyle\sum_{y<p\leq x}\frac{1}{p}=\log\frac{\log x}{\log y}+O\left(% \frac{1}{\log y}\right)\qquad(x\geq y\geq 2).

Here li⁡(x)=∫2x𝑑t/log⁡t\operatorname{li}(x)=\int_{2}^{x}dt/\log t.

4.1. A Buchstab envelope

Put Cω=71/125C_{\omega}=71/125 and

(4.1) ω¯⁢(u)={1,u<1,max⁡(1/u,Cω),u≥1.\bar{\omega}(u)=\begin{cases}1,&u<1,\\ \max(1/u,C_{\omega}),&u\geq 1.\end{cases}
Lemma 4.1.

Let Ω0\Omega_{0} be the positive root of x⁢ex=1xe^{x}=1. Then

supu≥2ω⁢(u)=Ω0<Cω.\sup_{u\geq 2}\omega(u)=\Omega_{0}<C_{\omega}.

The function ω¯\bar{\omega} is continuous and non-increasing. For u≥max⁡(u0,1)u\geq\max(u_{0},1),

ω⁢(u)≤ω¯⁢(u0).\omega(u)\leq\bar{\omega}(u_{0}).

Also 0≤ω≤10\leq\omega\leq 1, and ω\omega is 11-Lipschitz.

Proof.

On [2,3][2,3], equation (2.8) gives

u⁢ω⁢(u)=1+log⁡(u−1)(2≤u≤3).u\omega(u)=1+\log(u-1)\qquad(2\leq u\leq 3).

With w=u−1w=u-1, differentiate (1+log⁡w)/(1+w)(1+\log w)/(1+w); its maximum occurs at log⁡w=1/w\log w=1/w and equals 1/w=Ω01/w=\Omega_{0}. For k≥3k\geq 3 put Mk=max[k,k+1]⁡ωM_{k}=\max_{[k,k+1]}\omega. Then, for k≤u≤k+1k\leq u\leq k+1,

u⁢ω⁢(u)=k⁢ω⁢(k)+∫kuω⁢(t−1)⁢𝑑t≤k⁢Mk−1+(u−k)⁢Mk−1=u⁢Mk−1.u\omega(u)=k\omega(k)+\int_{k}^{u}\omega(t-1)\,dt\leq kM_{k-1}+(u-k)M_{k-1}=uM% _{k-1}.

Thus Mk≤Mk−1M_{k}\leq M_{k-1}, and the rational inequality

(4.2) Cω⁢∑j=04Cωjj!=733930882351732421875000>1C_{\omega}\sum_{j=0}^{4}\frac{C_{\omega}^{j}}{j!}=\frac{733930882351}{73242187% 5000}>1

proves Ω0<Cω\Omega_{0}<C_{\omega}. The envelope now follows from ω⁢(u)=1/u\omega(u)=1/u on [1,2][1,2]. On this interval |ω′|≤1|\omega^{\prime}|\leq 1, and for u>2u>2,

|ω′⁢(u)|=|ω⁢(u−1)−ω⁢(u)|u≤12.|\omega^{\prime}(u)|=\frac{|\omega(u-1)-\omega(u)|}{u}\leq\frac{1}{2}.

Continuity then completes the Lipschitz assertion. ∎

4.2. Rough numbers through u=10u=10

Let

Φ⁢(x,y)=#⁢{1≤n≤x:p⁢∣n⇒p>⁢y}.\Phi(x,y)=\#\{1\leq n\leq x:\ p\mid n\Rightarrow p>y\}.

This count includes 11.

Lemma 4.2.

Uniformly for y≥2y\geq 2 and y≤x≤y10y\leq x\leq y^{10},

(4.3) Φ⁢(x,y)=x⁢ω⁢(u)−ylog⁡y+O⁢(xlog2⁡y),u=log⁡xlog⁡y.\Phi(x,y)=\frac{x\omega(u)-y}{\log y}+O\left(\frac{x}{\log^{2}y}\right),\qquad u% =\frac{\log x}{\log y}.

The implied constant is absolute.

Proof.

Let H⁢(k)\mathrm{H}(k) denote (4.3) for 1≤u≤k1\leq u\leq k. For 1≤u≤21\leq u\leq 2 no composite is counted, so

Φ⁢(x,y)=1+π⁢(x)−π⁢(y).\Phi(x,y)=1+\pi(x)-\pi(y).

Then (4) and ω⁢(u)=1/u\omega(u)=1/u prove H⁢(2)\mathrm{H}(2).

Assume H⁢(k)\mathrm{H}(k), where 2≤k≤92\leq k\leq 9, and take yk<x≤yk+1y^{k}<x\leq y^{k+1}. Decomposition by the least prime factor gives

(4.4) Φ⁢(x,y)=Φ⁢(x,x)+∑y<p≤xΦ⁢(x/p,p)+E1,0≤E1≤2⁢xy.\Phi(x,y)=\Phi(x,\sqrt{x})+\sum_{y<p\leq\sqrt{x}}\Phi(x/p,p)+E_{1},\qquad 0% \leq E_{1}\leq\frac{2x}{y}.

The error counts the residuals divisible by the selected prime, and it is O⁢(x/log2⁡y)O(x/\log^{2}y). The base case gives

Φ⁢(x,x)=xlog⁡x+O⁢(xlog2⁡y).\Phi(x,\sqrt{x})=\frac{x}{\log x}+O\left(\frac{x}{\log^{2}y}\right).

For y<p≤xy<p\leq\sqrt{x} the new parameter is at most kk. Hence

(4.5) Φ⁢(x/p,p)=g⁢(p)−plog⁡p+O⁢(Ck⁢xp⁢log2⁡p),g⁢(s)=xs⁢log⁡s⁢ω⁢(log⁡xlog⁡s−1).\Phi(x/p,p)=g(p)-\frac{p}{\log p}+O\left(\frac{C_{k}x}{p\log^{2}p}\right),% \quad g(s)=\frac{x}{s\log s}\omega\left(\frac{\log x}{\log s}-1\right).

Here CkC_{k} is the induction constant, and by (4),

∑p≤xplog⁡p≪xlog2⁡x,∑y<p≤xCk⁢xp⁢log2⁡p≤Ck⁢xlog2⁡y⁢(log⁡10+O⁢(1log⁡y)).\sum_{p\leq\sqrt{x}}\frac{p}{\log p}\ll\frac{x}{\log^{2}x},\qquad\sum_{y<p\leq% \sqrt{x}}\frac{C_{k}x}{p\log^{2}p}\leq C_{k}\frac{x}{\log^{2}y}\left(\log 10+O% \left(\frac{1}{\log y}\right)\right).

The function gg is absolutely continuous, and Lemma 4.1 gives, almost everywhere,

|g′⁢(s)|≤xs2⁢log⁡s⁢(1+1log⁡s)+xs⁢log⁡s⋅log⁡xs⁢log2⁡s≤xs2⁢log⁡s⁢(1+1+ulog⁡2)≤17⁢xs2⁢log⁡s.\begin{split}|g^{\prime}(s)|&\leq\frac{x}{s^{2}\log s}\left(1+\frac{1}{\log s}% \right)+\frac{x}{s\log s}\cdot\frac{\log x}{s\log^{2}s}\\ &\leq\frac{x}{s^{2}\log s}\left(1+\frac{1+u}{\log 2}\right)\leq\frac{17x}{s^{2% }\log s}.\end{split}

Stieltjes integration against π=li+R\pi=\operatorname{li}+R yields

∑y<p≤xg⁢(p)=∫yxg⁢(s)log⁡s⁢𝑑s+O⁢(xlog3⁡y).\sum_{y<p\leq\sqrt{x}}g(p)=\int_{y}^{\sqrt{x}}\frac{g(s)}{\log s}\,ds+O\left(% \frac{x}{\log^{3}y}\right).

With s=x1/vs=x^{1/v}, the integral equals

xlog⁡x⁢∫2uω⁢(v−1)⁢𝑑v\displaystyle\frac{x}{\log x}\int_{2}^{u}\omega(v-1)\,dv =xlog⁡x⁢(u⁢ω⁢(u)−1)\displaystyle=\frac{x}{\log x}\bigl{(}u\omega(u)-1\bigr{)}
=x⁢ω⁢(u)log⁡y−xlog⁡x.\displaystyle=\frac{x\omega(u)}{\log y}-\frac{x}{\log x}.

Insert this in (4.4). Since u>2u>2, the term y/log⁡yy/\log y is absorbed by the error, and this proves H⁢(k+1)\mathrm{H}(k+1). The recurrence Ck+1≪1+Ck⁢(1+log⁡10)C_{k+1}\ll 1+C_{k}(1+\log 10) gives an absolute C10C_{10}. ∎

The subtraction of yy in (4.3) is needed near x=yx=y, so we retain it in the interval estimate.

Lemma 4.3.

Let w≥3w\geq 3 be an integer and w′=w−1/2w^{\prime}=w-1/2. Uniformly for 1≤y1<y2≤(w′)101\leq y_{1}<y_{2}\leq(w^{\prime})^{10},

(4.6) N⁢(y1,y2;w):=#⁢{y1<v≤y2:v≥2,P−⁢(v)≥w}=1log⁡w′⁢∫max⁡(y1,w′)y2ω⁢(log⁡tlog⁡w′)⁢𝑑t+O⁢(y2log2⁡w).\begin{split}N(y_{1},y_{2};w)&:=\#\{y_{1}<v\leq y_{2}:v\geq 2,\ P^{-}(v)\geq w% \}\\ &=\frac{1}{\log w^{\prime}}\int_{\max(y_{1},w^{\prime})}^{y_{2}}\omega\left(% \frac{\log t}{\log w^{\prime}}\right)dt+O\left(\frac{y_{2}}{\log^{2}w}\right).% \end{split}

The integral is defined to be zero when y2≤w′y_{2}\leq w^{\prime}.

Proof.

For integer vv the conditions P−⁢(v)≥wP^{-}(v)\geq w and P−⁢(v)>w′P^{-}(v)>w^{\prime} coincide, so N=Φ⁢(y2,w′)−Φ⁢(y1,w′)N=\Phi(y_{2},w^{\prime})-\Phi(y_{1},w^{\prime}). If y2≤w′y_{2}\leq w^{\prime}, this is zero. If y1≥w′y_{1}\geq w^{\prime}, the two terms −w′-w^{\prime} cancel exactly. If y1<w′<y2y_{1}<w^{\prime}<y_{2}, then Φ⁢(y1,w′)=1\Phi(y_{1},w^{\prime})=1, and we use Lemma 4.2 and ω⁢(1)=1\omega(1)=1. In both of the last two cases, with ya=max⁡(y1,w′)y_{a}=\max(y_{1},w^{\prime}),

N⁢(y1,y2;w)=1log⁡w′⁢[y⁢ω⁢(log⁡ylog⁡w′)]yay2+O⁢(y2log2⁡w).N(y_{1},y_{2};w)=\frac{1}{\log w^{\prime}}\left[y\,\omega\left(\frac{\log y}{% \log w^{\prime}}\right)\right]_{y_{a}}^{y_{2}}+O\left(\frac{y_{2}}{\log^{2}w}% \right).

Almost everywhere,

dd⁢y⁢(y⁢ω⁢(log⁡ylog⁡w′))=ω⁢(u)+ω′⁢(u)log⁡w′,u=log⁡ylog⁡w′.\frac{d}{dy}\left(y\,\omega\left(\frac{\log y}{\log w^{\prime}}\right)\right)=% \omega(u)+\frac{\omega^{\prime}(u)}{\log w^{\prime}},\qquad u=\frac{\log y}{% \log w^{\prime}}.

Now Lemma 4.1 proves (4.6). ∎

4.3. Absolute mass and square mass

Lemma 4.4.

We have

(4.7) #⁢{m≤X:P−⁢(m)≥z}≤1+10⁢Cπ⁢XL⁢∑j=093j≪X/L,\#\{m\leq X:P^{-}(m)\geq z\}\leq 1+\frac{10C_{\pi}X}{L}\sum_{j=0}^{9}3^{j}\ll X% /L,

where π⁢(v)≤Cπ⁢v/log⁡v\pi(v)\leq C_{\pi}v/\log v for v≥2v\geq 2. Consequently,

(4.8) ∑m∈I|λ⁢(m)|≪X,∑m∈I|λ⁢(m)|2≪X⁢L.\sum_{m\in I}|\lambda(m)|\ll X,\qquad\sum_{m\in I}|\lambda(m)|^{2}\ll XL.
Proof.

For 1<m≤X1<m\leq X with P−⁢(m)≥zP^{-}(m)\geq z, write m=n⁢pm=np with p=P+⁢(m)p=P^{+}(m). Then Ω⁢(n)≤9\Omega(n)\leq 9 and X/n≥zX/n\geq z, and the map m↦(n,p)m\mapsto(n,p) is injective. The count is therefore at most

1+∑j=09∑n:Ω⁢(n)=j,P−⁢(n)≥zX/n≥zπ⁢(X/n)≤1+10⁢Cπ⁢XL⁢∑j=09(∑z≤q≤X1q)j.1+\sum_{j=0}^{9}\sum_{\begin{subarray}{c}n:\ \Omega(n)=j,\ P^{-}(n)\geq z\\ X/n\geq z\end{subarray}}\pi(X/n)\leq 1+\frac{10C_{\pi}X}{L}\sum_{j=0}^{9}\left% (\sum_{z\leq q\leq X}\frac{1}{q}\right)^{j}.

By (4), the inner sum is log⁡10+O⁢(1/L)≤3\log 10+O(1/L)\leq 3. This proves (4.7), and (3.11) then gives (4.8). ∎

4.4. The four loss regions

For ℱ∈{U2,L4,U4,V4}\mathcal{F}\in\{U_{2},L_{4},U_{4},V_{4}\}, let k=2k=2 for U2U_{2} and k=4k=4 otherwise. Let ℛℱ\mathcal{R}_{\mathcal{F}} consist of its prime prefixes in Table 3.1, without p12≤mp_{1}^{2}\leq m. For a prefix put

Π=Pk,w=pk,xi=log⁡piL,s=∑i=1kxi=log⁡ΠL,e=xk=log⁡wL.\Pi=P_{k},\quad w=p_{k},\quad x_{i}=\frac{\log p_{i}}{L},\quad s=\sum_{i=1}^{k% }x_{i}=\frac{\log\Pi}{L},\quad e=x_{k}=\frac{\log w}{L}.

Define

(4.9) ℛℱ∗={(p1,…,pk)∈ℛℱ:4⁢Π⁢w≤X}.\mathcal{R}_{\mathcal{F}}^{*}=\{(p_{1},\ldots,p_{k})\in\mathcal{R}_{\mathcal{F% }}:4\Pi w\leq X\}.

Put δ=1/10\delta=1/10 and sj=x1+⋯+xjs_{j}=x_{1}+\cdots+x_{j}. The four regions are

(4.10) 𝒟U2\displaystyle\mathcal{D}_{U_{2}} ={δ≤b<a<920,a+b>1120,a+2b≤1},\displaystyle=\{\delta\leq b<a<\tfrac{9}{20},\ a+b>\tfrac{11}{20},\ a+2b\leq 1\},
𝒟L4\displaystyle\mathcal{D}_{L_{4}} ={δ≤e<c<b<a,s4<920},\displaystyle=\{\delta\leq e<c<b<a,\ s_{4}<\tfrac{9}{20}\},
𝒟U4\displaystyle\mathcal{D}_{U_{4}} ={δ≤e<c<b<a,s3<920,s4>1120},\displaystyle=\{\delta\leq e<c<b<a,\ s_{3}<\tfrac{9}{20},\ s_{4}>\tfrac{11}{20% }\},
𝒟V4\displaystyle\mathcal{D}_{V_{4}} ={δ≤e<c<b<a,a+b<920,\displaystyle=\{\delta\leq e<c<b<a,\ a+b<\tfrac{9}{20},
s3>1120,s4+e≤1}.\displaystyle\hskip 96.73936pts_{3}>\tfrac{11}{20},\ s_{4}+e\leq 1\}.

Here a,b,c,ea,b,c,e are the ordered coordinates, and every tuple in (4.9) lies in its corresponding region. For

u⁢(x):=1−se,u(x):=\frac{1-s}{e},

the ranges are

(4.11) ℱU2L4U4V4u⁢(x)<9/244/9<u⁢(x)<68/3<u⁢(x)<9/2<7/2.\begin{array}[]{c|cccc}\mathcal{F}&U_{2}&L_{4}&U_{4}&V_{4}\\ \hline\cr u(x)&<9/2&44/9<u(x)<6&8/3<u(x)<9/2&<7/2.\end{array}

For example, s4>4⁢es_{4}>4e and e<9/80e<9/80 on 𝒟L4\mathcal{D}_{L_{4}}. On 𝒟U4\mathcal{D}_{U_{4}} we have s4<9/20+es_{4}<9/20+e and e<3/20e<3/20. These give the two lower bounds in (4.11), and the remaining upper bounds follow from (4.10).

Lemma 4.5.

For each discarded family,

(4.12) ∑m∈I(log⁡m)⁢ℱ⁢(m)≤X8⁢∑ℛℱ∗ω¯⁢(u∗)e⁢Π⁢(1+o⁢(1))+O⁢(X/L),\sum_{m\in I}(\log m)\mathcal{F}(m)\leq\frac{X}{8}\sum_{\mathcal{R}_{\mathcal{% F}}^{*}}\frac{\bar{\omega}(u_{*})}{e\,\Pi}(1+o(1))+O(X/L),

where

u∗:=max⁡(1,log⁡(X/(8⁢Π))log⁡(w−12)).u_{*}:=\max\left(1,\frac{\log(X/(8\Pi))}{\log(w-\frac{1}{2})}\right).

All errors are uniform over the indicated tuples.

Proof.

For U2U_{2} and V4V_{4} we have Π<A2\Pi<A^{2}, and for L4L_{4} we have Π<A\Pi<A. For U4U_{4}, the inequalities P3<AP_{3}<A and p4<P31/3p_{4}<P_{3}^{1/3} give Π<A4/3\Pi<A^{4/3}. Thus Π<X9/10\Pi<X^{9/10} in every case, and for large XX the residual v>X/(8⁢Π)v>X/(8\Pi) is at least 22. By (3.5),

(4.13) ∑m∈Iℱ⁢(m)=∑ℛℱN⁢(X8⁢Π,X4⁢Π;w).\sum_{m\in I}\mathcal{F}(m)=\sum_{\mathcal{R}_{\mathcal{F}}}N\left(\frac{X}{8% \Pi},\frac{X}{4\Pi};w\right).

If 4⁢Π⁢w>X4\Pi w>X, a counted residual would satisfy v≥w>X/(4⁢Π)v\geq w>X/(4\Pi). Its count is therefore exactly zero, and we delete these tuples before making any estimate.

For an actual tuple,

(4.14) log⁡(X/(c⁢Π))log⁡(w−1/2)=u⁢(x)−log⁡ce⁢L+O⁢(1z⁢L)(c=4,8).\frac{\log(X/(c\Pi))}{\log(w-1/2)}=u(x)-\frac{\log c}{eL}+O\left(\frac{1}{zL}% \right)\qquad(c=4,8).

By (4.11), X/(4⁢Π)≤(w−1/2)10X/(4\Pi)\leq(w-1/2)^{10} for large XX. Apply Lemma 4.3 to the remaining tuples. The integration interval has length at most X/(8⁢Π)X/(8\Pi), and Lemma 4.1 gives

N⁢(X8⁢Π,X4⁢Π;w)≤1log⁡(w−12)⋅X8⁢Π⁢ω¯⁢(u∗)+O⁢(XΠ⁢L2).N\left(\frac{X}{8\Pi},\frac{X}{4\Pi};w\right)\leq\frac{1}{\log(w-\frac{1}{2})}% \cdot\frac{X}{8\Pi}\,\bar{\omega}(u_{*})+O\left(\frac{X}{\Pi L^{2}}\right).

The summed error is O⁢(X/L2)O(X/L^{2}) by (4). Multiply by log⁡m≤L\log m\leq L on the nonnegative losses, and use L/log⁡(w−1/2)=(1+o⁢(1))/eL/\log(w-1/2)=(1+o(1))/e. ∎

4.5. Rectangle majorants

Fix n≥1n\geq 1 and k∈{2,4}k\in\{2,4\}. Put

𝔥:=9/20−1/10n=720⁢n,K=∏i=1k[xi,0,xi,1),xi,0=110+ji⁢𝔥,xi,1=xi,0+𝔥,\mathfrak{h}:=\frac{9/20-1/10}{n}=\frac{7}{20n},\quad K=\prod_{i=1}^{k}[x_{i,0% },x_{i,1}),\quad x_{i,0}=\frac{1}{10}+j_{i}\mathfrak{h},\quad x_{i,1}=x_{i,0}+% \mathfrak{h},

where n>j1≥⋯≥jk≥0n>j_{1}\geq\cdots\geq j_{k}\geq 0. Every point of a loss region lies in exactly one such cell. Define

(4.15) u0⁢(K)=1−∑ixi,1xk,1,W⁢(K)=ω¯⁢(u0⁢(K))⁢𝔥kx1,0⁢⋯⁢xk−1,0⁢xk,02.u_{0}(K)=\frac{1-\sum_{i}x_{i,1}}{x_{k,1}},\qquad W(K)=\frac{\bar{\omega}(u_{0% }(K))\mathfrak{h}^{k}}{x_{1,0}\cdots x_{k-1,0}x_{k,0}^{2}}.
Lemma 4.6.

For x∈Kx\in K with s+e≤1s+e\leq 1,

ω⁢(u⁢(x))x1⁢⋯⁢xk−1⁢e2≤ω¯⁢(u0⁢(K))x1,0⁢⋯⁢xk−1,0⁢xk,02.\frac{\omega(u(x))}{x_{1}\cdots x_{k-1}e^{2}}\leq\frac{\bar{\omega}(u_{0}(K))}% {x_{1,0}\cdots x_{k-1,0}x_{k,0}^{2}}.
Proof.

Write s′=x1+⋯+xk−1s^{\prime}=x_{1}+\cdots+x_{k-1}, so u=(1−s′)/e−1u=(1-s^{\prime})/e-1. First raise ee to xk,1x_{k,1}. The value decreases, since 1−s′≥2⁢e>01-s^{\prime}\geq 2e>0 at the starting point. Then raise the other coordinates to their upper endpoints; each has slope −1/xk,1-1/x_{k,1}. Thus u⁢(x)≥u0⁢(K)u(x)\geq u_{0}(K), and also u⁢(x)≥1u(x)\geq 1. Use the non-increasing envelope and the lower endpoints in the denominator. If u0⁢(K)<1u_{0}(K)<1, the envelope equals 11, so the same bound holds. ∎

For U2U_{2}, take n=256n=256 and retain cells satisfying

(4.16) a0<9/20,a1+b1>11/20,a0+2⁢b0≤1.a_{0}<9/20,\qquad a_{1}+b_{1}>11/20,\qquad a_{0}+2b_{0}\leq 1.

For V4V_{4}, take n=64n=64 and retain cells satisfying

(4.17) a0+b0<9/20,a1+b1+c1>11/20,a0+b0+c0+2⁢e0≤1.a_{0}+b_{0}<9/20,\qquad a_{1}+b_{1}+c_{1}>11/20,\qquad a_{0}+b_{0}+c_{0}+2e_{0% }\leq 1.

Write these cell sets as 𝒦U2\mathcal{K}_{U_{2}} and 𝒦V4\mathcal{K}_{V_{4}}. Each exclusion removes only cells disjoint from the corresponding region. Define

(4.18) 𝐔2=∑K∈𝒦U2W⁢(K),𝐕4=∑K∈𝒦V4W⁢(K).\mathbf{U}_{2}=\sum_{K\in\mathcal{K}_{U_{2}}}W(K),\qquad\mathbf{V}_{4}=\sum_{K% \in\mathcal{K}_{V_{4}}}W(K).

The exact rational arithmetic in Appendix A gives

(4.19) |𝒦U2|=11093,𝐔2≤7326614667771012,|𝒦V4|=18286,𝐕4≤980125083791012.\begin{gathered}|\mathcal{K}_{U_{2}}|=11093,\qquad\mathbf{U}_{2}\leq\frac{7326% 61466777}{10^{12}},\\ |\mathcal{K}_{V_{4}}|=18286,\qquad\mathbf{V}_{4}\leq\frac{98012508379}{10^{12}% }.\end{gathered}
Proposition 4.7.

We have

(4.20) ∑m∈I(log⁡m)⁢U2⁢(m)≤(𝐔2+o⁢(1))⁢X8,∑m∈I(log⁡m)⁢V4⁢(m)≤(𝐕4+o⁢(1))⁢X8.\sum_{m\in I}(\log m)U_{2}(m)\leq(\mathbf{U}_{2}+o(1))\frac{X}{8},\qquad\sum_{% m\in I}(\log m)V_{4}(m)\leq(\mathbf{V}_{4}+o(1))\frac{X}{8}.
Proof.

Group the tuples in (4.12) by cell. By (4.14) and Lemma 4.6,

u∗≥u0⁢(K)−10⁢log⁡8L−O⁢(1z).u_{*}\geq u_{0}(K)-\frac{10\log 8}{L}-O\left(\frac{1}{z}\right).

Uniform continuity of ω¯\bar{\omega} gives ω¯⁢(u∗)≤ω¯⁢(u0⁢(K))+o⁢(1)\bar{\omega}(u_{*})\leq\bar{\omega}(u_{0}(K))+o(1), and 1/e≤1/xk,01/e\leq 1/x_{k,0}. For each coordinate, (4) gives

∑Xx0≤p<Xx0+𝔥1p=log⁡x0+𝔥x0+O⁢(1L)≤𝔥x0+O⁢(1L).\sum_{X^{x_{0}}\leq p<X^{x_{0}+\mathfrak{h}}}\frac{1}{p}=\log\frac{x_{0}+% \mathfrak{h}}{x_{0}}+O\left(\frac{1}{L}\right)\leq\frac{\mathfrak{h}}{x_{0}}+O% \left(\frac{1}{L}\right).

Enlarge the sum to all prime tuples in the box product; every summand is nonnegative, including in diagonal cells. Each cell then contributes at most W⁢(K)+o⁢(1)W(K)+o(1). The number of cells is finite and independent of XX, so summing proves the proposition. ∎

4.6. The two volume bounds

Lemma 4.8.

We have

(4.21) ∑m∈I(log⁡m)⁢L4⁢(m)\displaystyle\sum_{m\in I}(\log m)L_{4}(m) ≤(71115200+o⁢(1))⁢X8,\displaystyle\leq\left(\frac{71}{115200}+o(1)\right)\frac{X}{8},
∑m∈I(log⁡m)⁢U4⁢(m)\displaystyle\sum_{m\in I}(\log m)U_{4}(m) ≤(21312800+o⁢(1))⁢X8.\displaystyle\leq\left(\frac{213}{12800}+o(1)\right)\frac{X}{8}.
Proof.

By (4.11) and (4.14), u∗>2u_{*}>2 for these two families. Hence ω¯⁢(u∗)=Cω\bar{\omega}(u_{*})=C_{\omega} and 1/e≤101/e\leq 10, and Lemma 4.5 gives the bound

∑m∈I(log⁡m)⁢ℱ⁢(m)≤X8⁢Cω⁢ 10⁢∑(pi)∈ℛℱ∗∏i=141pi⁢(1+o⁢(1))+O⁢(XL).\sum_{m\in I}(\log m)\mathcal{F}(m)\leq\frac{X}{8}\,C_{\omega}\,10\sum_{(p_{i}% )\in\mathcal{R}_{\mathcal{F}}^{*}}\prod_{i=1}^{4}\frac{1}{p_{i}}(1+o(1))+O% \left(\frac{X}{L}\right).

Cover the fixed region by cubes of side σ\sigma anchored at 1/101/10. By (4), each cube contributes at most 104⁢σ4+O⁢(1/L)10^{4}\sigma^{4}+O(1/L), and their total volume tends to vol⁡(𝒟ℱ)\operatorname{vol}(\mathcal{D}_{\mathcal{F}}) as σ→0\sigma\to 0. Letting first X→∞X\to\infty and then σ→0\sigma\to 0, we get

∑(pi)∈ℛℱ∗∏i1pi≤104⁢vol⁡(𝒟ℱ)+o⁢(1).\sum_{(p_{i})\in\mathcal{R}_{\mathcal{F}}^{*}}\prod_{i}\frac{1}{p_{i}}\leq 10^% {4}\operatorname{vol}(\mathcal{D}_{\mathcal{F}})+o(1).

Use the gap coordinates

e=δ+y4,c=e+y3,b=c+y2,a=b+y1.e=\delta+y_{4},\quad c=e+y_{3},\quad b=c+y_{2},\quad a=b+y_{1}.

The Jacobian is 11, with y1,y2,y3>0y_{1},y_{2},y_{3}>0 and y4≥0y_{4}\geq 0. For L4L_{4} the condition is

y1+2y2+3y3+4y4<920−4δ=120=:yL.y_{1}+2y_{2}+3y_{3}+4y_{4}<\frac{9}{20}-4\delta=\frac{1}{20}=:y_{L}.

Thus

(4.22) vol⁡(𝒟L4)=(1/20)4576.\operatorname{vol}(\mathcal{D}_{L_{4}})=\frac{(1/20)^{4}}{576}.

For U4U_{4}, put Y=y1+2⁢y2+3⁢y3Y=y_{1}+2y_{2}+3y_{3} and xU=3/20x_{U}=3/20; the two conditions become

Y+3y4<320=:xU,Y+4y4>1120−4δ=320=xU.Y+3y_{4}<\frac{3}{20}=:x_{U},\qquad Y+4y_{4}>\frac{11}{20}-4\delta=\frac{3}{20% }=x_{U}.

For 0<Y<xU0<Y<x_{U} the y4y_{4}-interval has length (xU−Y)/12(x_{U}-Y)/12, and the density in YY is Y2/12Y^{2}/12. Hence

(4.23) vol⁡(𝒟U4)=∫0xUY2⁢(xU−Y)144⁢𝑑Y=(3/20)41728.\operatorname{vol}(\mathcal{D}_{U_{4}})=\int_{0}^{x_{U}}\frac{Y^{2}(x_{U}-Y)}{% 144}\,dY=\frac{(3/20)^{4}}{1728}.

Multiplying these volumes by Cω⁢105C_{\omega}10^{5} gives 71/11520071/115200 and 213/12800213/12800, respectively. ∎

4.7. The mass lower bound

Proposition 4.9.

Put

(4.24) ccert=1−7326614667771012−71115200−21312800−980125083791012=3421554308992250000000000>320.\begin{split}c_{\mathrm{cert}}&=1-\frac{732661466777}{10^{12}}-\frac{71}{11520% 0}-\frac{213}{12800}-\frac{98012508379}{10^{12}}\\ &=\frac{342155430899}{2250000000000}>\frac{3}{20}.\end{split}

Then

(4.25) Fλ≥(ccert8−o⁢(1))⁢X,|Fλ|≤∑m∈I|λ⁢(m)|≪X.F_{\lambda}\geq\left(\frac{c_{\mathrm{cert}}}{8}-o(1)\right)X,\qquad|F_{% \lambda}|\leq\sum_{m\in I}|\lambda(m)|\ll X.
Proof.

By (4), the prime contribution is

θ⁢(X/4)−θ⁢(X/8)=X8+O⁢(X⁢e−c⁢L).\theta(X/4)-\theta(X/8)=\frac{X}{8}+O\left(Xe^{-c\sqrt{L}}\right).

Subtract the four nonnegative losses in (3.7), using Proposition 4.7, (4.19) and Lemma 4.8. This retains the exact weight log⁡m\log m on primes, and on the losses the upper bound log⁡m≤L\log m\leq L has the required direction. The absolute bound follows from Lemma 4.4. ∎

5. Duality

For even nn, put

(5.1) rλ⁢(n):=∑X1<p≤X(log⁡p)⁢λ⁢(n−p)=∫01S⁢(α)⁢Sλ⁢(α)⁢e⁢(−n⁢α)⁢𝑑α=I𝔐⁢(n)+I𝔪⁢(n).r_{\lambda}(n):=\sum_{X_{1}<p\leq X}(\log p)\,\lambda(n-p)=\int_{0}^{1}S(% \alpha)S_{\lambda}(\alpha)e(-n\alpha)\,d\alpha=I_{\mathfrak{M}}(n)+I_{% \mathfrak{m}}(n).

Both integrals are real, since the arcs are invariant under α↦−α\alpha\mapsto-\alpha and the coefficients are real. If nn is not a sum of two primes, then

(5.2) rλ⁢(n)≤0.r_{\lambda}(n)\leq 0.

This follows term by term from (3.9). For n∈(X/2,X]n\in(X/2,X] and m∈Im\in I we also have

(5.3) n−m∈[X/4,7⁢X/8]⊂(X1,X].n-m\in[X/4,7X/8]\subset(X_{1},X].
Proposition 5.1.

Let ℰX\mathcal{E}_{X} be the exceptional even integers in (X/2,X](X/2,X]. Suppose that I𝔐⁢(n)≥c1⁢XI_{\mathfrak{M}}(n)\geq c_{1}X for every even nn in this interval, and that supα∈𝔪|Sλ⁢(α)|≤𝒮\sup_{\alpha\in\mathfrak{m}}|S_{\lambda}(\alpha)|\leq\mathcal{S}. Then

|ℰX|≤c1−2⁢𝒮2⁢L/X.|\mathcal{E}_{X}|\leq c_{1}^{-2}\mathcal{S}^{2}L/X.
Proof.

Put Z⁢(α)=∑n∈ℰXe⁢(n⁢α)Z(\alpha)=\sum_{n\in\mathcal{E}_{X}}e(n\alpha). By (5.2),

c1⁢X≤I𝔐⁢(n)≤−I𝔪⁢(n)(n∈ℰX).c_{1}X\leq I_{\mathfrak{M}}(n)\leq-I_{\mathfrak{m}}(n)\qquad(n\in\mathcal{E}_{% X}).

Parseval gives ‖Z‖22=|ℰX|\|Z\|_{2}^{2}=|\mathcal{E}_{X}|, and by (4), ‖S‖22≤X⁢L\|S\|_{2}^{2}\leq XL for large XX. Squaring proves the assertion. ∎

6. Minor arcs

This section is unconditional. For intervals J⊂IJ\subset I put

Tρ⁢(α;J)=∑m∈Jρ⁢(m)⁢e⁢(m⁢α).T_{\rho}(\alpha;J)=\sum_{m\in J}\rho(m)e(m\alpha).

We first bound these sums uniformly in JJ.

6.1. Rational approximation and bilinear estimates

For α∈𝔪\alpha\in\mathfrak{m}, Dirichlet’s approximation theorem gives coprime a,sa,s with

(6.1) P<s≤Q0,|α−a/s|≤(s⁢Q0)−1≤s−2.P<s\leq Q_{0},\qquad|\alpha-a/s|\leq(sQ_{0})^{-1}\leq s^{-2}.

A denominator s≤Ps\leq P would place α\alpha on a major arc, since (s⁢Q0)−1≤P/(2⁢s⁢X)(sQ_{0})^{-1}\leq P/(2sX). Thus

(6.2) X/s<X/P≤2⁢X11/20+η,s≤3⁢X/P≤6⁢X11/20+η,D≤X/P.X/s<X/P\leq 2X^{11/20+\eta},\qquad s\leq 3X/P\leq 6X^{11/20+\eta},\qquad D\leq X% /P.

(F4)  [9, Lemma 2.2] If (a,s)=1(a,s)=1 and |α−a/s|≤s−2|\alpha-a/s|\leq s^{-2}, then

∑u≤Umin⁡(2⁢Xu,12⁢‖α⁢u‖)\displaystyle\sum_{u\leq U}\min\left(\frac{2X}{u},\frac{1}{2\|\alpha u\|}\right) ≪(X/s+U+s)⁢log⁡(2⁢X⁢s),\displaystyle\ll(X/s+U+s)\log(2Xs),
∑h≤Hmin⁡(Y,1‖α⁢h‖)\displaystyle\sum_{h\leq H}\min\left(Y,\frac{1}{\|\alpha h\|}\right) ≪(1+H/s)⁢(Y+s⁢log⁡s).\displaystyle\ll(1+H/s)(Y+s\log s).
Lemma 6.1.

Let |au|,|bv|≤1|a_{u}|,|b_{v}|\leq 1, and let J⊂(0,X]J\subset(0,X] be an interval. Then

(6.3) |∑u≤Uau⁢∑k:u⁢k∈Je⁢(α⁢u⁢k)|≪(X/s+U+s)⁢log⁡(2⁢X⁢s).\left|\sum_{u\leq U}a_{u}\sum_{k:uk\in J}e(\alpha uk)\right|\ll(X/s+U+s)\log(2% Xs).

If M⁢N≪XMN\ll X, then

(6.4) |∑M<u≤2⁢M∑v≤Nau⁢bv⁢𝟏J⁢(u⁢v)⁢e⁢(α⁢u⁢v)|≪X1/2⁢(X/s+M+N+s)1/2⁢L1/2.\left|\sum_{M<u\leq 2M}\sum_{v\leq N}a_{u}b_{v}\mathbf{1}_{J}(uv)e(\alpha uv)% \right|\ll X^{1/2}(X/s+M+N+s)^{1/2}L^{1/2}.
Proof.

The inner sum in (6.3) is a geometric progression with modulus at most min⁡(2⁢X/u,(2⁢‖α⁢u‖)−1)\min(2X/u,(2\|\alpha u\|)^{-1}), so (6.1) applies. For (6.4), apply Cauchy–Schwarz in uu. For fixed v,v′v,v^{\prime}, the conditions u⁢v,u⁢v′∈Juv,uv^{\prime}\in J restrict uu to an interval. Group the off-diagonal terms by h=|v−v′|h=|v-v^{\prime}|; the second estimate in (6.1) gives

|T|2\displaystyle|T|^{2} ≪M⁢N⁢(M+∑1≤h<Nmin⁡(2⁢M,1‖α⁢h‖))\displaystyle\ll MN\left(M+\sum_{1\leq h<N}\min\left(2M,\frac{1}{\|\alpha h\|}% \right)\right)
≪M⁢N⁢(M+(1+Ns)⁢(M+s⁢log⁡s))\displaystyle\ll MN\left(M+\left(1+\frac{N}{s}\right)(M+s\log s)\right)
≪M⁢N⁢(M⁢Ns+M+N+s)⁢L,\displaystyle\ll MN\left(\frac{MN}{s}+M+N+s\right)L,

where TT denotes the left side of (6.4). Since M⁢N≪XMN\ll X, this proves (6.4). ∎

By (6.2), the estimates needed below are

(6.5) U≤X27/40\displaystyle U\leq X^{27/40} :(6.3)≪X27/40⁢L,\displaystyle:\quad\text{\eqref{eq:type-I}}\ll X^{27/40}L,
(6.6) M,N≪X/P\displaystyle M,N\ll X/P :(6.4)≪X31/40+η/2⁢L1/2.\displaystyle:\quad\text{\eqref{eq:type-II}}\ll X^{31/40+\eta/2}L^{1/2}.

The first of these uses 11/20+η≤0.56<27/4011/20+\eta\leq 0.56<27/40.

6.2. Exact separation of comparisons

Let K=2⁢⌈X⌉+1K=2\lceil X\rceil+1, and let HH be the indicator of {0,…,⌈X⌉}\{0,\ldots,\lceil X\rceil\} modulo KK. Fourier inversion gives, for integers x∈[−X,X]x\in[-X,X],

(6.7) 𝟏⁢[x≥0]=∑gmodKH^⁢(g)⁢e⁢(g⁢x/K),∑g|H^⁢(g)|≤2+log⁡K≪L,\mathbf{1}[x\geq 0]=\sum_{g\bmod K}\widehat{H}(g)e(gx/K),\qquad\sum_{g}|% \widehat{H}(g)|\leq 2+\log K\ll L,

where H^⁢(g)=K−1⁢∑h=0⌈X⌉e⁢(−g⁢h/K)\widehat{H}(g)=K^{-1}\sum_{h=0}^{\lceil X\rceil}e(-gh/K). The norm bound follows from the geometric-sum bound |H^⁢(g)|≤min⁡(1,(2⁢K⁢‖g/K‖)−1)|\widehat{H}(g)|\leq\min(1,(2K\|g/K\|)^{-1}). Consequently, for 2≤u,v≤X2\leq u,v\leq X,

(6.8) ψ⁢(v,P−⁢(u))=∑gH^⁢(g)⁢e⁢(g⁢P−⁢(v)/K)⁢e⁢(−g⁢P−⁢(u)/K).\psi(v,P^{-}(u))=\sum_{g}\widehat{H}(g)e(gP^{-}(v)/K)e(-gP^{-}(u)/K).

If F⁢(u)∈[0,X]F(u)\in[0,X] is integer-valued, then

(6.9) 𝟏⁢[w≤F⁢(u)]=∑gH^⁢(g)⁢e⁢(g⁢F⁢(u)/K)⁢e⁢(−g⁢w/K)(1≤w≤X).\mathbf{1}[w\leq F(u)]=\sum_{g}\widehat{H}(g)e(gF(u)/K)e(-gw/K)\qquad(1\leq w% \leq X).

These identities include equality at each endpoint, and each separated comparison costs O⁢(L)O(L).

6.3. The stopped Legendre identity

Lemma 6.2.

Let r<Ar<A be a positive integer, and let k≥1k\geq 1. Then

(6.10) ψ⁢(k,z)=∑d∣k,d∣Π(z)r⁢d<Aμ⁢(d)+∑d∣k,d∣Π(z),d>1r⁢d≥A>r⁢d/P−⁢(d)μ⁢(d)⁢ψ⁢(k/d,P−⁢(d)),\begin{split}\psi(k,z)={}&\sum_{\begin{subarray}{c}d\mid k,\ d\mid\Pi(z)\\ rd<A\end{subarray}}\mu(d)\\ &+\sum_{\begin{subarray}{c}d\mid k,\ d\mid\Pi(z),\ d>1\\ rd\geq A>rd/P^{-}(d)\end{subarray}}\mu(d)\psi(k/d,P^{-}(d)),\end{split}

where Π⁢(z)=∏p<zp\Pi(z)=\prod_{p<z}p. Every term in the second sum has A≤r⁢d<A⁢z=DA\leq rd<Az=D.

Proof.

Iterate

ψ⁢(k′,y)=1−∑p<yp∣k′ψ⁢(k′/p,p).\psi(k^{\prime},y)=1-\sum_{\begin{subarray}{c}p<y\\ p\mid k^{\prime}\end{subarray}}\psi(k^{\prime}/p,p).

The selected primes decrease strictly, so their product dd is squarefree. Expand a node precisely when r⁢d<Ard<A. At a stopped node, q=P−⁢(d)<zq=P^{-}(d)<z and r⁢d/q<A≤r⁢d<A⁢q<A⁢zrd/q<A\leq rd<Aq<Az. The terminal terms give (6.10). The rule depends only on r,dr,d, and no restriction is placed on repeated prime factors of the residual. ∎

6.4. The eight retained families

Proposition 6.3.

Uniformly for α∈𝔪\alpha\in\mathfrak{m} and intervals J⊂IJ\subset I,

(6.11) |Tρ⁢(α;J)|≪X31/40+η/2⁢L7/2.|T_{\rho}(\alpha;J)|\ll X^{31/40+\eta/2}L^{7/2}.
Proof.

We use the eight terms in (3.7); the four discarded families require no exponential-sum estimate.

The families R0,R1,R2R_{0},R_{1},R_{2}. For j=0,1,2j=0,1,2 the sums have the form

∑m∈JRj⁢(m)⁢e⁢(α⁢m)=∑rcr⁢∑k:r⁢k∈Jψ⁢(k,z)⁢e⁢(α⁢r⁢k),\sum_{m\in J}R_{j}(m)e(\alpha m)=\sum_{r}c_{r}\sum_{k:\ rk\in J}\psi(k,z)e(% \alpha rk),

where r=Pj<Ar=P_{j}<A, with r=1r=1 when j=0j=0. Here cr∈{0,1}c_{r}\in\{0,1\} depends only on rr, which is zz-rough. Apply Lemma 6.2 and put u=r⁢du=rd. The rough and smooth parts of uu determine r,dr,d uniquely, so the resulting coefficients have modulus at most 11. The free terms have u<Au<A and contribute O⁢(X11/20+η⁢L)O(X^{11/20+\eta}L) by (6.3). The stopped terms are

∑A≤u<Dau′⁢∑k′:u⁢k′∈Jψ⁢(k′,P−⁢(u))⁢e⁢(α⁢u⁢k′),|au′|≤1,P−⁢(u)=P−⁢(d).\sum_{A\leq u<D}a^{\prime}_{u}\sum_{k^{\prime}:\ uk^{\prime}\in J}\psi(k^{% \prime},P^{-}(u))e(\alpha uk^{\prime}),\qquad|a^{\prime}_{u}|\leq 1,\quad P^{-% }(u)=P^{-}(d).

Here k′>X/(8⁢D)>2k^{\prime}>X/(8D)>2. Split uu into O⁢(L)O(L) intervals (M,2⁢M](M,2M] with A/2≤M<DA/2\leq M<D; then k′≤X/(4⁢M)k^{\prime}\leq X/(4M). By (6.8) and (6.6), the total is O⁢(X31/40+η/2⁢L5/2)O(X^{31/40+\eta/2}L^{5/2}).

The family R3R_{3}. Write r=P2=p1⁢p2<Ar=P_{2}=p_{1}p_{2}<A and w=p3w=p_{3}. The prime conditions are

p1>p2>w≥z,r⁢w⁢<A⁢or⁢r⁢w>⁢D.p_{1}>p_{2}>w\geq z,\qquad rw<A\ \text{or}\ rw>D.

Apply Lemma 6.2 with anchor r=P2r=P_{2} to the residual ψ⁢(k,z)\psi(k,z) in m=r⁢w⁢km=rwk; the anchor is not P3P_{3}. For free terms the outer variable is U=r⁢w⁢dU=rwd. Its rough part determines p1,p2,p3p_{1},p_{2},p_{3}, and its smooth part determines dd, so the coefficient is bounded by 11. The inner variable is free on J/UJ/U. Since w2<p22<r<Aw^{2}<p_{2}^{2}<r<A,

U=(r⁢d)⁢w<A3/2=X27/40.U=(rd)w<A^{3/2}=X^{27/40}.

These terms contribute O⁢(X27/40⁢L)O(X^{27/40}L), for both conditions on r⁢wrw.

For stopped terms, put u=r⁢d∈[A,D)u=rd\in[A,D), q=P−⁢(d)<zq=P^{-}(d)<z, and V=w⁢k′V=wk^{\prime}. Since w≥z>qw\geq z>q, we have ψ⁢(k′,q)=ψ⁢(V,q)\psi(k^{\prime},q)=\psi(V,q), and the sum becomes

(6.12) ∑A≤u<Dau⁢∑V:u⁢V∈Jψ⁢(V,P−⁢(u))⁢∑w∣V,w∈ℙ,w≥zϑ⁢(u,w)⁢e⁢(α⁢u⁢V).\sum_{A\leq u<D}a_{u}\sum_{V:uV\in J}\psi(V,P^{-}(u))\sum_{\begin{subarray}{c}% w\mid V,\ w\in\mathbb{P},\ w\geq z\end{subarray}}\vartheta(u,w)e(\alpha uV).

Here |au|≤1|a_{u}|\leq 1 includes the stopping condition, and the rough part of uu is r=p1⁢p2r=p_{1}p_{2}. Also

ϑ⁢(u,w)=𝟏⁢[w<p2]⁢(𝟏⁢[r⁢w<A]+𝟏⁢[r⁢w>D]).\vartheta(u,w)=\mathbf{1}[w<p_{2}]\bigl{(}\mathbf{1}[rw<A]+\mathbf{1}[rw>D]% \bigr{)}.

The correspondence is bijective, since k′=V/wk^{\prime}=V/w is determined by u,V,wu,V,w; this remains true when w2∣Vw^{2}\mid V. Put

F1⁢(u)\displaystyle F_{1}(u) =min⁡(p2−1,⌈A/r⌉−1),\displaystyle=\min\bigl{(}p_{2}-1,\left\lceil A/r\right\rceil-1\bigr{)},
F2⁢(u)\displaystyle F_{2}(u) =p2−1,\displaystyle=p_{2}-1,
F3⁢(u)\displaystyle F_{3}(u) =min⁡(p2−1,⌊D/r⌋).\displaystyle=\min(p_{2}-1,\lfloor D/r\rfloor).

In F1F_{1}, ⌈⋅⌉\lceil\cdot\rceil is the ceiling function, and 11 is subtracted after rounding up. Set these to zero where au=0a_{u}=0. All three are integers in [0,X][0,X], and

(6.13) ϑ⁢(u,w)=𝟏⁢[w≤F1⁢(u)]+𝟏⁢[w≤F2⁢(u)]−𝟏⁢[w≤F3⁢(u)].\vartheta(u,w)=\mathbf{1}[w\leq F_{1}(u)]+\mathbf{1}[w\leq F_{2}(u)]-\mathbf{1% }[w\leq F_{3}(u)].

Separate the roughness condition by (6.8) and each comparison by (6.9). For fixed g,g′,ig,g^{\prime},i, the two coefficients are

au⁢e⁢(−g⁢P−⁢(u)+g′⁢Fi⁢(u)K),bV⁢(g,g′):=e⁢(g⁢P−⁢(V)K)⁢∑w∣V,w⁢ prime,w≥ze⁢(−g′⁢wK).a_{u}e\Big{(}\frac{-gP^{-}(u)+g^{\prime}F_{i}(u)}{K}\Big{)},\quad b_{V}(g,g^{% \prime}):=e\Big{(}\frac{gP^{-}(V)}{K}\Big{)}\sum_{\begin{subarray}{c}w\mid V,% \ w\text{ prime},\ w\geq z\end{subarray}}e\Big{(}\frac{-g^{\prime}w}{K}\Big{)}.

Their moduli are at most 11 and 55, since V≤X/(4⁢A)<z6V\leq X/(4A)<z^{6}. With two Fourier norms and O⁢(L)O(L) dyadic intervals, (6.6) now gives O⁢(X31/40+η/2⁢L7/2)O(X^{31/40+\eta/2}L^{7/2}) for (6.12).

The families B1,B2,B3,B4B_{1},B_{2},B_{3},B_{4}. Each has the form

∑m∈JBj⁢(m)⁢e⁢(α⁢m)=∑A≤u≤D𝟏Ej⁢(u)⁢∑v:u⁢v∈Jψ⁢(v,P−⁢(u))⁢e⁢(α⁢u⁢v).\sum_{m\in J}B_{j}(m)e(\alpha m)=\sum_{A\leq u\leq D}\mathbf{1}_{E_{j}}(u)\sum% _{v:\ uv\in J}\psi(v,P^{-}(u))e(\alpha uv).

The ordered prime factorisation of uu determines the prefix conditions. For B1B_{1}, the condition p12≤mp_{1}^{2}\leq m follows from v≥p1v\geq p_{1}. The residual satisfies v>X/(8⁢D)>2v>X/(8D)>2, and one Fourier separation with O⁢(L)O(L) dyadic intervals gives O⁢(X31/40+η/2⁢L5/2)O(X^{31/40+\eta/2}L^{5/2}).

All Type I outer variables are below X27/40X^{27/40}. Both variables in every Type II piece are ≪D≤X/P\ll D\leq X/P, and the underlying products place them in [A/8,D][A/8,D] up to endpoint constants. Adding the eight estimates proves the proposition. ∎

Corollary 6.4.

Uniformly for α∈𝔪\alpha\in\mathfrak{m},

supα∈𝔪|Sλ⁢(α)|≪X31/40+η/2⁢L9/2=X1−t/2⁢L9/2.\sup_{\alpha\in\mathfrak{m}}|S_{\lambda}(\alpha)|\ll X^{31/40+\eta/2}L^{9/2}=X% ^{1-t/2}L^{9/2}.
Proof.

Partial summation gives

Sλ⁢(α)=log⁡X4⁢Tρ⁢(α;I)−∫X/8X/4Tρ⁢(α;(X/8,y])⁢d⁢yy.S_{\lambda}(\alpha)=\log\frac{X}{4}\,T_{\rho}(\alpha;I)-\int_{X/8}^{X/4}T_{% \rho}\big{(}\alpha;(X/8,y]\big{)}\frac{dy}{y}.

Its modulus is at most 2⁢L2L times the largest prefix sum, and Proposition 6.3 applies. ∎

7. Bilinear distribution with both maxima

Lemma B.

Let XX be large, L=log⁡XL=\log X, z=X1/10z=X^{1/10}, and 1≤Q<X1/21\leq Q<X^{1/2}. Let M,N≥1M,N\geq 1. Suppose that α,β\alpha,\beta satisfy the following conditions. Their supports lie in (M,2⁢M](M,2M] and (N,2⁢N](N,2N], respectively, and consist of zz-rough integers greater than 11. Their coefficients have modulus at most c0c_{0}. For some 𝒜≥1\mathcal{A}\geq 1, every d≤L𝒜d\leq L^{\mathcal{A}}, (b,d)=1(b,d)=1 and real uu satisfy

(7.1) |∑n≤un≡b(modd)βn−1φ⁢(d)⁢∑n≤u(n,d)=1βn|≤CSW⁢N⁢L−𝒜.\left|\sum_{\begin{subarray}{c}n\leq u\\ n\equiv b\pmod{d}\end{subarray}}\beta_{n}-\frac{1}{\varphi(d)}\sum_{\begin{% subarray}{c}n\leq u\\ (n,d)=1\end{subarray}}\beta_{n}\right|\leq C_{\mathrm{SW}}NL^{-\mathcal{A}}.

Put f=α∗βf=\alpha*\beta. For 1≤𝒟≤𝒜1\leq\mathcal{D}\leq\mathcal{A},

(7.2) ∑q≤QΔf⁢(q)≪X⁢L2⁢𝒟+1−𝒜+X9/10⁢L𝒟+1+X⁢L2−𝒟+X19/20⁢L3+Q⁢X1/2⁢L2.\begin{split}\sum_{q\leq Q}\Delta_{f}(q)\ll{}&XL^{2\mathcal{D}+1-\mathcal{A}}+% X^{9/10}L^{\mathcal{D}+1}+XL^{2-\mathcal{D}}\\ &+X^{19/20}L^{3}+QX^{1/2}L^{2}.\end{split}

The implied constant depends only on c0,CSWc_{0},C_{\mathrm{SW}}. In particular, for Q≤QBQ\leq Q_{B} and B′>0B^{\prime}>0, take 𝒟=B′+2\mathcal{D}=B^{\prime}+2 and 𝒜=3⁢B′+5\mathcal{A}=3B^{\prime}+5. Then the left side is O⁢(X⁢L−B′)O(XL^{-B^{\prime}}).

(F5)  [1, Chapter 17] For x>0x>0, x≠1x\neq 1, c>0c>0 and T≥1T\geq 1,

|12⁢π⁢i⁢∫c−i⁢Tc+i⁢Txss⁢𝑑s−𝟏⁢[x>1]|≪xc⁢min⁡(1,1T⁢|log⁡x|).\left|\frac{1}{2\pi i}\int_{c-iT}^{c+iT}\frac{x^{s}}{s}\,ds-\mathbf{1}[x>1]% \right|\ll x^{c}\min\left(1,\frac{1}{T|\log x|}\right).

(F6)  [4, Theorem 7.13] If cnc_{n} is supported on N′N^{\prime} consecutive integers, then

∑r≤R′rφ⁢(r)⁢∑χmodr∗|∑ncn⁢χ⁢(n)|2≤(N′+R′⁣2)⁢∑n|cn|2.\sum_{r\leq R^{\prime}}\frac{r}{\varphi(r)}\sum_{\chi\bmod r}^{*}\left|\sum_{n% }c_{n}\chi(n)\right|^{2}\leq(N^{\prime}+R^{\prime 2})\sum_{n}|c_{n}|^{2}.

The star restricts the sum to primitive characters.

Proof of Lemma B.

We may assume that both sequences are nonzero and M⁢N<XMN<X, since otherwise all prefix sums vanish. Roughness gives

(7.3) z/2≤M,N≤2⁢X/z=2⁢X9/10,‖α‖22≤2⁢c02⁢M,‖β‖22≤2⁢c02⁢N.z/2\leq M,N\leq 2X/z=2X^{9/10},\qquad\|\alpha\|_{2}^{2}\leq 2c_{0}^{2}M,\quad% \|\beta\|_{2}^{2}\leq 2c_{0}^{2}N.

For ℓ≤X\ell\leq X in the support, Ω⁢(ℓ)≤10\Omega(\ell)\leq 10, hence |f⁢(ℓ)|≤210⁢c02|f(\ell)|\leq 2^{10}c_{0}^{2}. Write

Sχ⁢(y;α′,β′)=∑m⁢n≤yαm′⁢βn′⁢χ⁢(m⁢n).S_{\chi}(y;\alpha^{\prime},\beta^{\prime})=\sum_{mn\leq y}\alpha^{\prime}_{m}% \beta^{\prime}_{n}\chi(mn).

Orthogonality and induction. The principal character gives the exact coprime mean in Δf\Delta_{f}. Therefore

(7.4) ∑q≤QΔf⁢(q)≤Σ:=∑q≤Q1φ⁢(q)⁢∑χmodqχ≠χ0maxy≤X⁡|Sχ⁢(y;α,β)|.\sum_{q\leq Q}\Delta_{f}(q)\leq\Sigma:=\sum_{q\leq Q}\frac{1}{\varphi(q)}\sum_% {\begin{subarray}{c}\chi\bmod q\\ \chi\neq\chi_{0}\end{subarray}}\max_{y\leq X}|S_{\chi}(y;\alpha,\beta)|.

Let χ\chi be induced by a primitive character χ1\chi_{1} modulo rr, and write q=r⁢kq=rk. For all integers ℓ\ell,

χ⁢(ℓ)=χ1⁢(ℓ)⁢𝟏(ℓ,k)=1.\chi(\ell)=\chi_{1}(\ell)\mathbf{1}_{(\ell,k)=1}.

No coprimality condition between r,kr,k is required. Put αm(k)=αm⁢𝟏(m,k)=1\alpha^{(k)}_{m}=\alpha_{m}\mathbf{1}_{(m,k)=1} and βn(k)=βn⁢𝟏(n,k)=1\beta^{(k)}_{n}=\beta_{n}\mathbf{1}_{(n,k)=1}. The induction is a bijection onto the pairs with r>1r>1, r⁢k≤Qrk\leq Q. Since φ⁢(r⁢k)≥φ⁢(r)⁢φ⁢(k)\varphi(rk)\geq\varphi(r)\varphi(k),

(7.5) Σ≤∑k≤Q1φ⁢(k)⁢∑1<r≤Q/k1φ⁢(r)⁢∑∗χ1modr∗⁢maxy≤X⁡|Sχ1⁢(y;α(k),β(k))|.\Sigma\leq\sum_{k\leq Q}\frac{1}{\varphi(k)}\sum_{1<r\leq Q/k}\frac{1}{\varphi% (r)}\sideset{}{{}^{*}}{\sum}_{\chi_{1}\bmod r}\max_{y\leq X}|S_{\chi_{1}}(y;% \alpha^{(k)},\beta^{(k)})|.

We split this sum at r=L𝒟r=L^{\mathcal{D}}.

Small conductors. Only here do we remove the restriction (m⁢n,k)=1(mn,k)=1. Since k≤Q<z5k\leq Q<z^{5}, at most four primes at least zz divide kk, and for each such prime at most X/zX/z products m⁢n≤Xmn\leq X occur. Thus, uniformly in all cutoffs,

|Sχ1⁢(y;α(k),β(k))−Sχ1⁢(y;α,β)|≤4⋅210⁢c02⁢X/z.\left|S_{\chi_{1}}(y;\alpha^{(k)},\beta^{(k)})-S_{\chi_{1}}(y;\alpha,\beta)% \right|\leq 4\cdot 2^{10}c_{0}^{2}X/z.

For 1<r≤L𝒟1<r\leq L^{\mathcal{D}}, expand β\beta by reduced residue classes. The primitive character is nonprincipal, so (7.1) gives

|∑n≤uβn⁢χ1⁢(n)|≤φ⁢(r)⁢CSW⁢N⁢L−𝒜.\left|\sum_{n\leq u}\beta_{n}\chi_{1}(n)\right|\leq\varphi(r)C_{\mathrm{SW}}NL% ^{-\mathcal{A}}.

Summing over mm gives |Sχ1⁢(y;α,β)|≤2⁢c0⁢CSW⁢r⁢X⁢L−𝒜|S_{\chi_{1}}(y;\alpha,\beta)|\leq 2c_{0}C_{\mathrm{SW}}rXL^{-\mathcal{A}}, and there are at most φ⁢(r)\varphi(r) primitive characters. Using ∑k≤Qφ⁢(k)−1≪L\sum_{k\leq Q}\varphi(k)^{-1}\ll L, we obtain

(7.6) Σsmall≪X⁢L2⁢𝒟+1−𝒜+X9/10⁢L𝒟+1.\Sigma_{\mathrm{small}}\ll XL^{2\mathcal{D}+1-\mathcal{A}}+X^{9/10}L^{\mathcal% {D}+1}.

Perron’s formula and the maximum in yy. Put c=1/Lc=1/L and T=X3T=X^{3}. Every prefix can be represented with a half-integer y=j+1/2y=j+1/2. The convolution is supported in (M⁢N,4⁢M⁢N]⊂[1,4⁢X](MN,4MN]\subset[1,4X], and its absolute mass is at most 4⁢c02⁢X4c_{0}^{2}X. For the relevant ℓ\ell, |log⁡(y/ℓ)|≥1/(10⁢X)|\log(y/\ell)|\geq 1/(10X) and (y/ℓ)c≤3(y/\ell)^{c}\leq 3, so (B) gives a uniform error O⁢(X−1)O(X^{-1}). Define

Ak⁢(s,χ)=∑mαm(k)⁢χ⁢(m)⁢m−s,Bk⁢(s,χ)=∑nβn(k)⁢χ⁢(n)⁢n−s.A_{k}(s,\chi)=\sum_{m}\alpha_{m}^{(k)}\chi(m)m^{-s},\qquad B_{k}(s,\chi)=\sum_% {n}\beta_{n}^{(k)}\chi(n)n^{-s}.

Then

maxy≤X⁡|Sχ⁢(y;α(k),β(k))|≤32⁢π⁢∫−TT|Ak⁢Bk⁢(c+i⁢t,χ)||c+i⁢t|⁢𝑑t+O⁢(X−1).\max_{y\leq X}|S_{\chi}(y;\alpha^{(k)},\beta^{(k)})|\leq\frac{3}{2\pi}\int_{-T% }^{T}\frac{|A_{k}B_{k}(c+it,\chi)|}{|c+it|}\,dt+O(X^{-1}).

Since ∫−TT|c+i⁢t|−1⁢𝑑t≤8⁢L\int_{-T}^{T}|c+it|^{-1}dt\leq 8L for large XX, any finite character family ℱ\mathcal{F} satisfies

(7.7) ∑χ∈ℱmaxy⁡|Sχ⁢(y)|≤4⁢L⁢sup|t|≤T∑χ∈ℱ|Ak⁢Bk⁢(c+i⁢t,χ)|+O⁢(|ℱ|/X).\sum_{\chi\in\mathcal{F}}\max_{y}|S_{\chi}(y)|\leq 4L\sup_{|t|\leq T}\sum_{% \chi\in\mathcal{F}}|A_{k}B_{k}(c+it,\chi)|+O(|\mathcal{F}|/X).

The same argument applies with positive character weights, and it keeps the maximum inside the sum over characters.

Large conductors. The intervals (Ri,2⁢Ri](R_{i},2R_{i}], where Ri=2i⁢L𝒟R_{i}=2^{i}L^{\mathcal{D}}, i≥0i\geq 0, cover every conductor greater than L𝒟L^{\mathcal{D}}. Fix kk, one such interval, and tt. Cauchy–Schwarz with weights r/φ⁢(r)r/\varphi(r), followed by (B), gives

∑R<r≤min⁡(2⁢R,Q/k)1φ⁢(r)⁢∑χ1modr∗|Ak⁢Bk|\displaystyle\sum_{R<r\leq\min(2R,Q/k)}\frac{1}{\varphi(r)}\sum_{\chi_{1}\bmod r% }^{*}|A_{k}B_{k}| ≤1R⁢((2⁢M+4⁢R2)⁢2⁢c02⁢M)1/2\displaystyle\leq\frac{1}{R}\big{(}(2M+4R^{2})2c_{0}^{2}M\big{)}^{1/2}
×((2⁢N+4⁢R2)⁢2⁢c02⁢N)1/2\displaystyle\qquad\times\big{(}(2N+4R^{2})2c_{0}^{2}N\big{)}^{1/2}
≪(X1/2R+M1/2+N1/2+R)⁢X1/2.\displaystyle\ll\Big{(}\frac{X^{1/2}}{R}+M^{1/2}+N^{1/2}+R\Big{)}X^{1/2}.

The weighted Perron error is O⁢(R/X)O(R/X). Sum (7.7) over kk and these intervals; the endpoint terms form geometric sums. Using (7.3), we get

Σlarge\displaystyle\Sigma_{\mathrm{large}} ≪L2⁢(X⁢L−𝒟+L⁢X1/2⁢(2⁢X9/10)1/2+Q⁢X1/2)\displaystyle\ll L^{2}\Big{(}XL^{-\mathcal{D}}+LX^{1/2}(2X^{9/10})^{1/2}+QX^{1% /2}\Big{)}
(7.8) ≪X⁢L2−𝒟+X19/20⁢L3+Q⁢X1/2⁢L2.\displaystyle\ll XL^{2-\mathcal{D}}+X^{19/20}L^{3}+QX^{1/2}L^{2}.

Equations (7.6) and (7.8) prove (7.2). With the stated choices of 𝒟,𝒜\mathcal{D},\mathcal{A}, both logarithmic terms are X⁢L−B′XL^{-B^{\prime}}, and the remaining three terms have a fixed power saving. ∎

7.1. Siegel–Walfisz estimates for prime boxes

(F7)  [1, Chapter 22] For every 𝒜>0\mathcal{A}>0, there is c𝒜>0c_{\mathcal{A}}>0 such that

|π⁢(w;d,b)−π⁢(w)φ⁢(d)|≪𝒜w⁢exp⁡(−c𝒜⁢log⁡w),\left|\pi(w;d,b)-\frac{\pi(w)}{\varphi(d)}\right|\ll_{\mathcal{A}}w\exp\big{(}% -c_{\mathcal{A}}\sqrt{\log w}\big{)},

uniformly for (b,d)=1(b,d)=1 and d≤(log⁡w)𝒜+1d\leq(\log w)^{\mathcal{A}+1}.

Lemma C.

Let 𝒜>0\mathcal{A}>0. For β=𝟏ℙ∩[U,V)\beta=\mathbf{1}_{\mathbb{P}\cap[U,V)}, where z≤U<V≤4⁢Uz\leq U<V\leq 4U, the left side of (7.1) is O𝒜⁢(U⁢e−c𝒜⁢L)O_{\mathcal{A}}(Ue^{-c_{\mathcal{A}}\sqrt{L}}), uniformly for d≤L𝒜d\leq L^{\mathcal{A}}, (b,d)=1(b,d)=1 and real uu.

Suppose β1\beta_{1} satisfies (7.1) with scale N1N_{1} and constant C1C_{1}. If γ\gamma is supported on (N2,2j⁢N2](N_{2},2^{j}N_{2}] and |γ|≤c|\gamma|\leq c, then β1∗γ\beta_{1}*\gamma satisfies it with scale N1⁢N2N_{1}N_{2} and constant C1⁢c⁢2j+1C_{1}c2^{j+1}. Restricting any such sequence to (N′,2⁢N′](N^{\prime},2N^{\prime}] multiplies its constant by at most 22.

Proof.

For large XX, d≤L𝒜<zd\leq L^{\mathcal{A}}<z, so every prime in [U,V)[U,V) is coprime to dd. Put E⁢(w)=π⁢(w;d,b)−π⁢(w)/φ⁢(d)E(w)=\pi(w;d,b)-\pi(w)/\varphi(d). The discrepancy is zero for u<Uu<U. For U≤u<VU\leq u<V it equals E⁢(u)−E⁢(U−)E(u)-E(U^{-}), and for u≥Vu\geq V it equals E⁢(V−)−E⁢(U−)E(V^{-})-E(U^{-}); the left limits preserve both half-open endpoints. All arguments satisfy log⁡w≥L/10\log w\geq L/10, so for large XX we have d≤(log⁡w)𝒜+1d\leq(\log w)^{\mathcal{A}+1}, and (7.1) applies.

For the convolution, fix n2n_{2} in the support of γ\gamma. If (n2,d)>1(n_{2},d)>1, neither the reduced residue sum nor its coprime mean contributes. Otherwise the residue for n1n_{1} is b⁢n2−1(modd)bn_{2}^{-1}\pmod{d}, and we apply (7.1) at the cutoff u/n2u/n_{2}. The errors sum to at most

C1⁢N1⁢L−𝒜⁢∑n2|γ⁢(n2)|≤C1⁢c⁢ 2j+1⁢N1⁢N2⁢L−𝒜.C_{1}N_{1}L^{-\mathcal{A}}\sum_{n_{2}}|\gamma(n_{2})|\leq C_{1}c\,2^{j+1}N_{1}% N_{2}L^{-\mathcal{A}}.

The main terms give the coprime mean of the complete convolution. Finally, a dyadic restriction is the difference of two prefix sums. ∎

8. Distribution of the signed weight

Proposition 8.1 (Distribution of the signed weight).

For every B>0B>0,

(8.1) ∑d≤QB2ω⁢(d)⁢Δλ⁢(d)≪B,ηX⁢L−B,QB=X9/20−η.\sum_{d\leq Q_{B}}2^{\omega(d)}\Delta_{\lambda}(d)\ll_{B,\eta}XL^{-B},\qquad Q% _{B}=X^{9/20-\eta}.

Both maxima in (2.9) remain inside the modulus sum. This estimate is unconditional.

8.1. Marked prefixes on the full support

Extend each discarded family to all positive integers mm. Use the prefix conditions in Table 3.1, including p12≤mp_{1}^{2}\leq m, and the residual ψ⁢(m/Pj,pj)\psi(m/P_{j},p_{j}). Write their sum as U~\widetilde{U}, and put

U~♭⁢(m):=U~⁢(m)⁢𝟏m≤X/4.\widetilde{U}^{\flat}(m):=\widetilde{U}(m)\mathbf{1}_{m\leq X/4}.

On II this equals the sum of the four losses. It is supported on zz-rough integers with Ω⁢(m)≤9\Omega(m)\leq 9, and

(8.2) 0≤U~♭⁢(m)≤(92)+(94)=162.0\leq\widetilde{U}^{\flat}(m)\leq\binom{9}{2}+\binom{9}{4}=162.

For each four-prime prefix, the three possibilities L4,U4,V4L_{4},U_{4},V_{4} are disjoint.

Let m=ℓ1⁢⋯⁢ℓrm=\ell_{1}\cdots\ell_{r} be squarefree, with ℓ1>⋯>ℓr≥z\ell_{1}>\cdots>\ell_{r}\geq z. Put ti=log⁡ℓi/Lt_{i}=\log\ell_{i}/L and s=∑itis=\sum_{i}t_{i}. A marked prefix has residual roughness at its smallest selected prime. This holds precisely when that prime is ℓr\ell_{r}, also when the residual is 11. Thus U~⁢(m)=Gr⁢(t)\widetilde{U}(m)=G_{r}(t), where

(8.3) Gr⁢(t)=∑i<r𝟏⁢[ti<9/20,ti+tr>11/20, 2⁢ti≤s]+∑i1<i2<i3<r𝟏⁢[ti1+ti2+ti3+tr<9/20, 2⁢ti1≤s]+∑i1<i2<i3<r𝟏[ti1+ti2+ti3<9/20,ti1+ti2+ti3+tr>11/20, 2ti1≤s]+∑i1<i2<i3<r𝟏⁢[ti1+ti2<9/20,ti1+ti2+ti3>11/20, 2⁢ti1≤s].\begin{split}G_{r}(t)={}&\sum_{i<r}\mathbf{1}[t_{i}<9/20,\ t_{i}+t_{r}>11/20,% \ 2t_{i}\leq s]\\ &+\sum_{i_{1}<i_{2}<i_{3}<r}\mathbf{1}[t_{i_{1}}+t_{i_{2}}+t_{i_{3}}+t_{r}<9/2% 0,\ 2t_{i_{1}}\leq s]\\ &+\sum_{i_{1}<i_{2}<i_{3}<r}\mathbf{1}[t_{i_{1}}+t_{i_{2}}+t_{i_{3}}<9/20,\\ &\hskip 68.2866ptt_{i_{1}}+t_{i_{2}}+t_{i_{3}}+t_{r}>11/20,\ 2t_{i_{1}}\leq s]% \\ &+\sum_{i_{1}<i_{2}<i_{3}<r}\mathbf{1}[t_{i_{1}}+t_{i_{2}}<9/20,t_{i_{1}}+t_{i% _{2}}+t_{i_{3}}>11/20,\ 2t_{i_{1}}\leq s].\end{split}

In particular, G1=0G_{1}=0 and U~⁢(1)=0\widetilde{U}(1)=0. For 2≤r≤92\leq r\leq 9, let ℋr\mathcal{H}_{r} consist of the hyperplanes

(8.4) ∑i∈Jti=9/20⁢or⁢ 11/20(1≤|J|≤4),2⁢ti=∑ktk,ti=tj(i≠j).\sum_{i\in J}t_{i}=9/20\ \text{or}\ 11/20\quad(1\leq|J|\leq 4),\quad 2t_{i}=% \sum_{k}t_{k},\quad t_{i}=t_{j}\quad(i\neq j).

These form a fixed finite rational arrangement. Off it, GrG_{r} is constant in each component of the strictly ordered cone, and the bound 162162 holds there for r≤9r\leq 9.

8.2. Initial reductions and single primes

Partial summation and (2.10) give

(8.5) Δλ⁢(d)≤2⁢L⁢Δρ⁢(d),Δρ⁢(d)≤Δ𝟏ℙ⁢𝟏I⁢(d)+ΔU~♭⁢𝟏I⁢(d).\Delta_{\lambda}(d)\leq 2L\Delta_{\rho}(d),\qquad\Delta_{\rho}(d)\leq\Delta_{% \mathbf{1}_{\mathbb{P}}\mathbf{1}_{I}}(d)+\Delta_{\widetilde{U}^{\flat}\mathbf% {1}_{I}}(d).

We split U~♭\widetilde{U}^{\flat} into squarefree and nonsquarefree parts and add the divisor weight last.

(F8)  [1, Chapter 28] For every H>0H>0, some K⁢(H)>0K(H)>0 satisfies

(8.6) ∑d≤X1/2⁢L−K⁢(H)max(a,d)=1⁡maxy≤X⁡|∑n≤yn≡a(modd)Λ⁢(n)−yφ⁢(d)|≪HX⁢L−H.\sum_{d\leq X^{1/2}L^{-K(H)}}\max_{(a,d)=1}\max_{y\leq X}\left|\sum_{\begin{% subarray}{c}n\leq y\\ n\equiv a\pmod{d}\end{subarray}}\Lambda(n)-\frac{y}{\varphi(d)}\right|\ll_{H}% XL^{-H}.

Since QB/(X1/2⁢L−K⁢(H))=X−1/20−η⁢LK⁢(H)→0Q_{B}/(X^{1/2}L^{-K(H)})=X^{-1/20-\eta}L^{K(H)}\to 0, this covers all required moduli. Prime powers contribute O⁢(X⁢L)O(\sqrt{X}L) per modulus. Partial summation converts prime logarithmic sums to prime counts and retains the maximum in yy. The modulus 11 case controls the corresponding total prime count. Removing primes that divide dd costs O⁢(ω⁢(d)/φ⁢(d))O(\omega(d)/\varphi(d)), so the three conversions have total cost

QB⁢X1/2⁢L+∑d≤QBω⁢(d)φ⁢(d)≪X19/20−η⁢L.Q_{B}X^{1/2}L+\sum_{d\leq Q_{B}}\frac{\omega(d)}{\varphi(d)}\ll X^{19/20-\eta}L.

Consequently, for every H>0H>0,

(8.7) ∑d≤QBΔ𝟏ℙ⁢(d)≪HX⁢L−H.\sum_{d\leq Q_{B}}\Delta_{\mathbf{1}_{\mathbb{P}}}(d)\ll_{H}XL^{-H}.

Single primes are handled by this estimate; Lemma B is not used for them.

8.3. Absolute-coordinate cubes

Fix C0>1C_{0}>1. Put

ϖ:=110⁢Nϖ,Nϖ=⌈LC0⌉,120⁢L−C0≤ϖ≤110⁢L−C0,1/10∈ϖ⁢ℤ.\varpi:=\frac{1}{10N_{\varpi}},\qquad N_{\varpi}=\lceil L^{C_{0}}\rceil,\qquad% \frac{1}{20}L^{-C_{0}}\leq\varpi\leq\frac{1}{10}L^{-C_{0}},\qquad 1/10\in% \varpi\mathbb{Z}.

For 2≤r≤92\leq r\leq 9, use cubes

(8.8) C=∏i=1r[ai,ai+ϖ),ai∈110+ϖ⁢ℤ≥0,ai<1,a1≥⋯≥ar.C=\prod_{i=1}^{r}[a_{i},a_{i}+\varpi),\qquad a_{i}\in\tfrac{1}{10}+\varpi% \mathbb{Z}_{\geq 0},\quad a_{i}<1,\quad a_{1}\geq\cdots\geq a_{r}.

Let ℬi⁢(C)=ℙ∩[Xai,Xai+ϖ)\mathcal{B}_{i}(C)=\mathbb{P}\cap[X^{a_{i}},X^{a_{i}+\varpi}) and

convC:=𝟏ℬ1⁢(C)∗⋯∗𝟏ℬr⁢(C).\operatorname{conv}_{C}:=\mathbf{1}_{\mathcal{B}_{1}(C)}*\cdots*\mathbf{1}_{% \mathcal{B}_{r}(C)}.

Every prime is at least zz, the box ratio is Xϖ≤exp⁡(L1−C0/10)≤2X^{\varpi}\leq\exp(L^{1-C_{0}}/10)\leq 2, and there are O⁢(L9⁢C0)O(L^{9C_{0}}) cubes. An interior cube has closure disjoint from all hyperplanes in ℋr\mathcal{H}_{r}, and every other cube is a boundary cube. Only dimensions 2≤r≤92\leq r\leq 9 are used, since the discarded weight vanishes when r≤1r\leq 1.

For an interior cube, the prime boxes are pairwise disjoint and ordered, so unique factorisation gives convC⁡(m)∈{0,1}\operatorname{conv}_{C}(m)\in\{0,1\}. It is 11 precisely for the squarefree integers with Ω⁢(m)=r\Omega(m)=r and t⁢(m)∈Ct(m)\in C. Let cC∈[0,162]∩ℤc_{C}\in[0,162]\cap\mathbb{Z} be the constant value of GrG_{r} on CC. Then, for every integer m≥1m\geq 1,

(8.9) U~♭⁢(m)⁢𝟏sqf⁢(m)⁢𝟏t⁢(m)∈C=cC⁢convC⁡(m)⁢𝟏m≤X/4.\widetilde{U}^{\flat}(m)\mathbf{1}_{\mathrm{sqf}}(m)\mathbf{1}_{t(m)\in C}=c_{% C}\operatorname{conv}_{C}(m)\mathbf{1}_{m\leq X/4}.

The cutoff on the right is retained, and cCc_{C} counts all admissible marked prefixes.

8.4. Distribution of each convolution

For any cube, including boundary cubes, split

convC=α∗β,α=𝟏ℬ1⁢(C),β=𝟏ℬ2⁢(C)∗⋯∗𝟏ℬr⁢(C).\mathrm{conv}_{C}=\alpha*\beta,\qquad\alpha=\mathbf{1}_{\mathcal{B}_{1}(C)},% \qquad\beta=\mathbf{1}_{\mathcal{B}_{2}(C)}*\cdots*\mathbf{1}_{\mathcal{B}_{r}% (C)}.

Both sequences are supported on rough integers greater than 11, and their coefficients are bounded by 11 and (r−1)!≤8!(r-1)!\leq 8!. Lemma C supplies (7.1) at every fixed level. For r=2r=2, use its prime-box assertion. For r>2r>2, convolve one prime box with the other r−2r-2 boxes; the latter convolution has coefficients at most 7!7! and bounded support ratio. All constants are uniform over the cubes.

We specify the dyadic endpoints. Put N⋆=∏i=2rXaiN_{\star}=\prod_{i=2}^{r}X^{a_{i}}. The support of β\beta lies in [N⋆,2r−1⁢N⋆)[N_{\star},2^{r-1}N_{\star}), and we use the rr intervals

(2j−1⁢N⋆,2j⁢N⋆],0≤j≤r−1.(2^{j-1}N_{\star},2^{j}N_{\star}],\qquad 0\leq j\leq r-1.

They begin at N⋆/2N_{\star}/2, so no integer at N⋆N_{\star} is omitted. Use two intervals anchored at Xa1/2X^{a_{1}}/2 for α\alpha. Lemma C controls each restriction, and changing to the dyadic scale costs at most a factor 292^{9}. Lemma B therefore gives, uniformly in CC,

(8.10) ∑d≤QBΔconvC⁡𝟏[1,X/4]⁢(d)≤∑d≤QBΔconvC⁢(d)≪B′X⁢L−B′.\sum_{d\leq Q_{B}}\Delta_{\operatorname{conv}_{C}\mathbf{1}_{[1,X/4]}}(d)\leq% \sum_{d\leq Q_{B}}\Delta_{\operatorname{conv}_{C}}(d)\ll_{B^{\prime}}XL^{-B^{% \prime}}.

The distribution estimate is applied to the full product mm before truncation, and the modulus remains dd throughout.

8.5. Boundary cubes and positive transfer

Define

ℰ⁢(m):=∑C⁢ boundaryU~♭⁢(m)⁢𝟏sqf⁢(m)⁢𝟏t⁢(m)∈C,\displaystyle\mathcal{E}(m):=\sum_{C\text{ boundary}}\widetilde{U}^{\flat}(m)% \mathbf{1}_{\mathrm{sqf}}(m)\mathbf{1}_{t(m)\in C},
W:=∑C⁢ boundaryconvC≥0,W♭:=W⁢𝟏[1,X/4].\displaystyle W:=\sum_{C\text{ boundary}}\mathrm{conv}_{C}\geq 0,\qquad W^{% \flat}:=W\mathbf{1}_{[1,X/4]}.

Then W≥0W\geq 0 and |ℰ|≤162⁢W♭|\mathcal{E}|\leq 162W^{\flat}. Every relevant sorted vector lies in exactly one cube. Hence

(8.11) U~♭⁢𝟏sqf=∑C⁢interiorcC⁢convC⁡𝟏[1,X/4]+ℰ.\widetilde{U}^{\flat}\mathbf{1}_{\mathrm{sqf}}=\sum_{C\ \mathrm{interior}}c_{C% }\operatorname{conv}_{C}\mathbf{1}_{[1,X/4]}+\mathcal{E}.
Lemma 8.2.

If |E|≤𝒞⁢W|E|\leq\mathcal{C}W and W≥0W\geq 0, then

ΔE⁢(d)≤𝒞⁢ΔW⁢(d)+2⁢𝒞φ⁢(d)⁢∑m≤XW⁢(m).\Delta_{E}(d)\leq\mathcal{C}\Delta_{W}(d)+\frac{2\mathcal{C}}{\varphi(d)}\sum_% {m\leq X}W(m).
Proof.

Bound each of the two terms defining the discrepancy of EE by its absolute value, and replace |E||E| by 𝒞⁢W\mathcal{C}W. The residue sum of WW is at most its coprime mean plus ΔW⁢(d)\Delta_{W}(d), and the two means are each bounded by φ⁢(d)−1⁢∑m≤XW⁢(m)\varphi(d)^{-1}\sum_{m\leq X}W(m). These bounds are uniform in the residue and the cutoff. ∎

By (8.10),

(8.12) ∑d≤QBΔW♭⁢(d)≪L9⁢C0⁢X⁢L−B′.\sum_{d\leq Q_{B}}\Delta_{W^{\flat}}(d)\ll L^{9C_{0}}XL^{-B^{\prime}}.

This includes cubes meeting the diagonals. For a term with r≤9r\leq 9 prime boxes, split off one box as α\alpha and put the remaining r−1r-1 boxes in β\beta. The β\beta coefficients are at most (r−1)!≤8!(r-1)!\leq 8!, which is the bound used by Lemma B. The full convolution can have coefficients up to r!≤9!r!\leq 9!. There are no one-dimensional boundary convolutions.

Lemma 8.3.

We have

∑m≤XW⁢(m)≪ϖ⁢L⁢X+X/z≪X⁢L1−C0+X9/10.\sum_{m\leq X}W(m)\ll\varpi LX+X/z\ll XL^{1-C_{0}}+X^{9/10}.
Proof.

A tuple in a boundary cube lies within distance ϖ\varpi, in the maximum norm, of some hyperplane c⋅t=c0c\cdot t=c_{0} in (8.4). Choose i0i_{0} with ci0≠0c_{i_{0}}\neq 0, and fix the other primes, whose product is M′≤X/zM^{\prime}\leq X/z. The remaining prime lies in

[T,T⁢eκ⁢ϖ⁢L]∩[z,X/M′][T,Te^{\kappa\varpi L}]\cap[z,X/M^{\prime}]

This interval contains O⁢(ϖ⁢L⁢X/M′+1)O(\varpi LX/M^{\prime}+1) integers, and by (4),

∑tuples1M′≤(∑z≤p≤X1p)r−1≤38\sum_{\text{tuples}}\frac{1}{M^{\prime}}\leq\left(\sum_{z\leq p\leq X}\frac{1}% {p}\right)^{r-1}\leq 3^{8}

for large XX. There are at most (r−1)!⁢⌊X/z⌋≤8!⁢X/z(r-1)!\lfloor X/z\rfloor\leq 8!X/z labelled tuples with product at most X/zX/z. The number of hyperplanes and dimensions is fixed, so summing proves the assertion. ∎

Using ∑d≤QBφ⁢(d)−1≪L\sum_{d\leq Q_{B}}\varphi(d)^{-1}\ll L, the last two lemmas give

(8.13) ∑d≤QBΔU~♭⁢𝟏sqf⁢(d)≪L9⁢C0⁢X⁢L−B′+L⁢(X⁢L1−C0+X9/10).\sum_{d\leq Q_{B}}\Delta_{\widetilde{U}^{\flat}\mathbf{1}_{\mathrm{sqf}}}(d)% \ll L^{9C_{0}}XL^{-B^{\prime}}+L(XL^{1-C_{0}}+X^{9/10}).

8.6. Repeated prime factors

The nonsquarefree part has modulus at most 162162, and it is supported on p2∣mp^{2}\mid m for some prime p≥zp\geq z. Fix (a,d)=1(a,d)=1. If p∣dp\mid d, this divisibility is impossible in the reduced residue class. If p∤dp\nmid d, the Chinese remainder theorem gives

#⁢{m≤X:m≡a(modd),p2∣m}≤X/(d⁢p2)+1.\#\{m\leq X:m\equiv a\pmod{d},\ p^{2}\mid m\}\leq X/(dp^{2})+1.

Summing over z≤p≤Xz\leq p\leq\sqrt{X} gives O⁢(X/(d⁢z)+X)O(X/(dz)+\sqrt{X}), and the coprime-average term is O⁢(X/(φ⁢(d)⁢z))O(X/(\varphi(d)z)). Therefore

(8.14) ∑d≤QBΔU~♭⁢𝟏nsqf⁢(d)≪X⁢L/z+QB⁢X=X9/10⁢L+X19/20−η.\sum_{d\leq Q_{B}}\Delta_{\widetilde{U}^{\flat}\mathbf{1}_{\mathrm{nsqf}}}(d)% \ll XL/z+Q_{B}\sqrt{X}=X^{9/10}L+X^{19/20-\eta}.

Repeated factors remain in the weight. This step counts multiples directly and needs no distribution estimate at modulus d⁢p2dp^{2}.

8.7. The divisor weight and the parameter choices

Since |λ|≤256⁢L|\lambda|\leq 256L,

Δλ⁢(d)≪X⁢L/φ⁢(d)+L.\Delta_{\lambda}(d)\ll XL/\varphi(d)+L.

The elementary divisor estimates

∑d≤Q4ω⁢(d)φ⁢(d)≪L4,∑d≤Q4ω⁢(d)≪Q⁢L3\sum_{d\leq Q}\frac{4^{\omega(d)}}{\varphi(d)}\ll L^{4},\qquad\sum_{d\leq Q}4^% {\omega(d)}\ll QL^{3}

give

(8.15) ∑d≤QB4ω⁢(d)⁢Δλ⁢(d)≪X⁢L5.\sum_{d\leq Q_{B}}4^{\omega(d)}\Delta_{\lambda}(d)\ll XL^{5}.

To prove them, expand 4ω⁢(d)4^{\omega(d)} over squarefree divisors and use φ⁢(a⁢b)≥φ⁢(a)⁢φ⁢(b)\varphi(ab)\geq\varphi(a)\varphi(b); the corresponding Euler products have logarithmic exponents 33 and 44. Cauchy–Schwarz yields

(8.16) ∑d≤QB2ω⁢(d)⁢Δλ⁢(d)≤(∑d≤QBΔλ⁢(d))1/2⁢(∑d≤QB4ω⁢(d)⁢Δλ⁢(d))1/2.\sum_{d\leq Q_{B}}2^{\omega(d)}\Delta_{\lambda}(d)\leq\left(\sum_{d\leq Q_{B}}% \Delta_{\lambda}(d)\right)^{1/2}\left(\sum_{d\leq Q_{B}}4^{\omega(d)}\Delta_{% \lambda}(d)\right)^{1/2}.
Proof of Proposition 8.1.

Given B>0B>0, choose, in this order,

H:=2⁢B+8,C0:=H+3,B′:=H+9⁢C0+1,H:=2B+8,\qquad C_{0}:=H+3,\qquad B^{\prime}:=H+9C_{0}+1,

then 𝒟=B′+2\mathcal{D}=B^{\prime}+2 and 𝒜=3⁢B′+5\mathcal{A}=3B^{\prime}+5, and finally take XX sufficiently large. Equations (8.7), (8.13), (8.14) and (8.5) give

∑d≤QBΔρ⁢(d)≪X⁢L−H,∑d≤QBΔλ⁢(d)≪X⁢L1−H.\sum_{d\leq Q_{B}}\Delta_{\rho}(d)\ll XL^{-H},\qquad\sum_{d\leq Q_{B}}\Delta_{% \lambda}(d)\ll XL^{1-H}.

Combining (8.15) and (8.16) gives X⁢L3−H/2=X⁢L−B−1XL^{3-H/2}=XL^{-B-1}, which proves (8.1). ∎

9. Major arcs

Only this section uses H7/8H_{7/8}. We first prove the prime-side mean square. The argument follows [7, Section 8], with the density exponents computed below.

9.1. Classical inputs

Let N∗⁢(σ,T,Q′)N^{*}(\sigma,T,Q^{\prime}) count, with multiplicity, the zeros ϱ=β+i⁢γ\varrho=\beta+i\gamma satisfying β≥σ\beta\geq\sigma and |γ|≤T|\gamma|\leq T, summed over primitive characters of conductor at most Q′Q^{\prime}.

(F9)  [3, Theorem 1, p. 231] For 11/14≤σ≤111/14\leq\sigma\leq 1,

N∗⁢(σ,T,Q′)≪ε(Q′⁣2⁢T)2⁢(1−σ)+ε.N^{*}(\sigma,T,Q^{\prime})\ll_{\varepsilon}(Q^{\prime 2}T)^{2(1-\sigma)+% \varepsilon}.

(F10)  [3, Theorem 2(3), p. 232]; [7, Lemma 4.17]. Uniformly for 1/2≤σ≤11/2\leq\sigma\leq 1,

N∗⁢(σ,T,Q′)≪ε(Q′⁣2⁢T6/5)(20/9)⁢(1−σ)+ε.N^{*}(\sigma,T,Q^{\prime})\ll_{\varepsilon}(Q^{\prime 2}T^{6/5})^{(20/9)(1-% \sigma)+\varepsilon}.

(F11)  [5, Theorem 12.2]; [7, Lemma 4.16]. For 1/2≤σ≤11/2\leq\sigma\leq 1,

N∗⁢(σ,T,Q′)≪(Q′⁣2⁢T)3⁢(1−σ)/(2−σ)⁢log9⁡(Q′⁢T).N^{*}(\sigma,T,Q^{\prime})\ll(Q^{\prime 2}T)^{3(1-\sigma)/(2-\sigma)}\log^{9}(% Q^{\prime}T).

(F12)  [2, Lemma 1]; [7, Lemma 4.11]. For a finite sequence ana_{n} and κ>0\kappa>0,

∫−κκ|∑nan⁢e⁢(n⁢β)|2⁢𝑑β≪κ2⁢∫|∑x<n≤x+1/(2⁢κ)an|2⁢𝑑x.\int_{-\kappa}^{\kappa}\left|\sum_{n}a_{n}e(n\beta)\right|^{2}d\beta\ll\kappa^% {2}\int\left|\sum_{x<n\leq x+1/(2\kappa)}a_{n}\right|^{2}dx.

(F13)  [4, Section 3.4]; [1, Chapter 9]. If χmodq\chi\bmod q is induced by a primitive character of conductor rr, then |τ⁢(χ)|2≤r|\tau(\chi)|^{2}\leq r. Also τ⁢(χ0,q)=μ⁢(q)\tau(\chi_{0,q})=\mu(q).

(F14)  [1, Chapters 15–19]; [7, Lemma 4.15]. The explicit formula for primitive Dirichlet characters has the uniform truncation error

O⁢(x⁢log2⁡(r⁢x⁢T)T+x1/4⁢log⁡x).O\!\left(\frac{x\log^{2}(rxT)}{T}+x^{1/4}\log x\right).

The number of zeros in a unit height interval is O⁢(log⁡(r⁢(|T|+2)))O(\log(r(|T|+2))).

9.2. The prime-side mean square

On 𝔐⁢(q,a)\mathfrak{M}(q,a), put

(9.1) 𝒯⁢(β)=∑X1<k≤Xe⁢(k⁢β),S1⁢(a/q+β)=S⁢(a/q+β)−μ⁢(q)φ⁢(q)⁢𝒯⁢(β).\mathcal{T}(\beta)=\sum_{X_{1}<k\leq X}e(k\beta),\qquad S_{1}(a/q+\beta)=S(a/q% +\beta)-\frac{\mu(q)}{\varphi(q)}\mathcal{T}(\beta).

The arcs are disjoint, so this defines S1S_{1} on 𝔐\mathfrak{M}.

Proposition 9.1.

Assume H7/8H_{7/8}. Let 0<η≤1/1000<\eta\leq 1/100, 0<ε0≤η/100<\varepsilon_{0}\leq\eta/10 and X1=X1−ε0X_{1}=X^{1-\varepsilon_{0}}. Uniformly for 2≤P≤X9/20−η2\leq P\leq X^{9/20-\eta},

(9.2) ∫𝔐|S1⁢(α)|2⁢𝑑α≪ηL18⁢X1−8⁢η/9+L8⁢P2≪ηL18⁢X1−8⁢η/9.\int_{\mathfrak{M}}|S_{1}(\alpha)|^{2}d\alpha\ll_{\eta}L^{18}X^{1-8\eta/9}+L^{% 8}P^{2}\ll_{\eta}L^{18}X^{1-8\eta/9}.
Proof.

Put ϑ=log⁡P/L\vartheta=\log P/L, Q=X/PQ=X/P and ϵ=η/90\epsilon=\eta/90, and write ϱ=1−δ+i⁢γ\varrho=1-\delta+i\gamma.

Character expansion. Every prime in SS is coprime to q≤Pq\leq P, since P<X<X1P<\sqrt{X}<X_{1}. For the character χ∗\chi^{*} inducing χmodq\chi\bmod q,

S⁢(a/q+β)=1φ⁢(q)⁢∑χmodqχ⁢(a)⁢τ⁢(χ¯)⁢∑X1<p≤Xχ∗⁢(p)⁢log⁡p⁢e⁢(β⁢p).S(a/q+\beta)=\frac{1}{\varphi(q)}\sum_{\chi\bmod q}\chi(a)\tau(\bar{\chi})\sum% _{X_{1}<p\leq X}\chi^{*}(p)\log p\,e(\beta p).

There is one exterior factor 1/φ⁢(q)1/\varphi(q). For primitive χmodr\chi\bmod r, put

S1⁢(χ∗,β)\displaystyle S_{1}(\chi^{*},\beta) =∑nan⁢(χ∗)⁢e⁢(n⁢β),\displaystyle=\sum_{n}a_{n}(\chi^{*})e(n\beta),
an⁢(χ∗)\displaystyle a_{n}(\chi^{*}) =𝟏X1<n≤X⁢(𝟏ℙ⁢(n)⁢χ∗⁢(n)⁢log⁡n−E⁢(χ∗)),\displaystyle=\mathbf{1}_{X_{1}<n\leq X}\bigl{(}\mathbf{1}_{\mathbb{P}}(n)\chi% ^{*}(n)\log n-E(\chi^{*})\bigr{)},
E⁢(χ∗)\displaystyle E(\chi^{*}) =𝟏⁢[r=1].\displaystyle=\mathbf{1}[r=1].

Orthogonality in aa, followed by (9.1), gives

(9.3) ∫𝔐|S1|2≪L2⁢∑r≤P∑∗χmodr∗⁢W1⁢(χ)2,W1⁢(χ)2=∫|β|≤1/(r⁢Q)|∑nan⁢(χ)⁢e⁢(n⁢β)|2⁢𝑑β.\begin{gathered}\int_{\mathfrak{M}}|S_{1}|^{2}\ll L^{2}\sum_{r\leq P}\;% \sideset{}{{}^{*}}{\sum}_{\chi\bmod r}W_{1}(\chi)^{2},\\ W_{1}(\chi)^{2}=\int_{|\beta|\leq 1/(rQ)}\left|\sum_{n}a_{n}(\chi)e(n\beta)% \right|^{2}d\beta.\end{gathered}

Here we used

∑q≤Pr∣q1φ⁢(q)≤1φ⁢(r)⁢∑l≤P/r1φ⁢(l)≪Lφ⁢(r),rφ⁢(r)≪L.\sum_{\begin{subarray}{c}q\leq P\\ r\mid q\end{subarray}}\frac{1}{\varphi(q)}\leq\frac{1}{\varphi(r)}\sum_{l\leq P% /r}\frac{1}{\varphi(l)}\ll\frac{L}{\varphi(r)},\qquad\frac{r}{\varphi(r)}\ll L.

This includes all moduli q≤Pq\leq P.

Short intervals. Apply (9.1) with Y=r⁢Q/2≤X/2Y=rQ/2\leq X/2, and let X2=max⁡(X1,6⁢Y)X_{2}=\max(X_{1},6Y). Then

(9.4) W1⁢(χ)2≪∫X1−YX|Y−1⁢∑x<n≤x+Yan⁢(χ)|2⁢𝑑x=I1+I2+I3.W_{1}(\chi)^{2}\ll\int_{X_{1}-Y}^{X}\left|Y^{-1}\sum_{x<n\leq x+Y}a_{n}(\chi)% \right|^{2}dx=I_{1}+I_{2}+I_{3}.

With empty intervals omitted, the three ranges are

I1=[X1−Y,min⁡(X2,X−Y)],I2=[X2,X−Y],I3=[X−Y,X].I_{1}=[X_{1}-Y,\min(X_{2},X-Y)],\qquad I_{2}=[X_{2},X-Y],\qquad I_{3}=[X-Y,X].

The first has length at most 7⁢Y7Y.

The explicit formula. Put T0=3⁢XT_{0}=3\sqrt{X} and Λℙ⁢(n)=𝟏ℙ⁢(n)⁢log⁡n\Lambda_{\mathbb{P}}(n)=\mathbf{1}_{\mathbb{P}}(n)\log n. By (9.1), uniformly for X1/2≤u1<u2≤9⁢XX_{1}/2\leq u_{1}<u_{2}\leq 9X,

(9.5) ∑u1<n≤u2(χ⁢(n)⁢Λℙ⁢(n)−E⁢(χ))=−∑ϱ:β≥1/2|γ|≤T0u2ϱ−u1ϱϱ+O⁢(X⁢L2).\sum_{u_{1}<n\leq u_{2}}\bigl{(}\chi(n)\Lambda_{\mathbb{P}}(n)-E(\chi)\bigr{)}% =-\sum_{\begin{subarray}{c}\varrho:\ \beta\geq 1/2\\ |\gamma|\leq T_{0}\end{subarray}}\frac{u_{2}^{\varrho}-u_{1}^{\varrho}}{% \varrho}+O(\sqrt{X}L^{2}).

Here prime powers cost O⁢(X⁢L)O(\sqrt{X}L), the zeros with β<1/2\beta<1/2 cost O⁢(X⁢L2)O(\sqrt{X}L^{2}), and the truncation costs O⁢(X⁢L2/T0+X1/4⁢L)O(XL^{2}/T_{0}+X^{1/4}L). The pole cancels the term E⁢(χ)E(\chi) up to O⁢(1)O(1). Constant terms cancel in the difference, and their logarithmic terms cost O⁢(L)O(L). Hypothesis H7/8H_{7/8} and the functional equation keep all nontrivial zeros in 1/8≤β≤7/81/8\leq\beta\leq 7/8, so every zero retained in (9.5) has

(9.6) 1/8≤δ≤1/2.1/8\leq\delta\leq 1/2.

The squared error in the two end ranges contributes at most

∑r≤Pr⁢Y−1⁢X⁢L4≪L4⁢P2.\sum_{r\leq P}rY^{-1}XL^{4}\ll L^{4}P^{2}.

The middle-range error is treated below.

Classes of zeros. Partition conductors into intervals R<r≤2⁢RR<r\leq 2R with dyadic RR, including the initial interval R=1/2R=1/2 to cover r=1r=1. For ℳ=2μ\mathcal{M}=2^{\mu}, μ≥0\mu\geq 0, use the height intervals

(ℳ−1)⁢P/R≤|γ|≤(2⁢ℳ−1)⁢P/R.(\mathcal{M}-1)P/R\leq|\gamma|\leq(2\mathcal{M}-1)P/R.

Shared endpoints are assigned once. Also use h−1/L<δ≤hh-1/L<\delta\leq h, with h∈L−1⁢ℤh\in L^{-1}\mathbb{Z}. There are O⁢(L3)O(L^{3}) classes, and O⁢(L2)O(L^{2}) for each character. By (9.6), only 1/8≤h≤1/2+1/L1/8\leq h\leq 1/2+1/L occur. Within a class,

X−δ≤e⁢X−h,X1−δ≤e⁢X1−h,|γ|≤Tℳ:=2⁢ℳ⁢P/R,Tℳ≥2.X^{-\delta}\leq eX^{-h},\qquad{X_{1}}^{-\delta}\leq e\,{X_{1}}^{-h},\qquad|% \gamma|\leq T_{\mathcal{M}}:=2\mathcal{M}P/R,\qquad T_{\mathcal{M}}\geq 2.

For one character the class contains O⁢((ℳ⁢P/R)⁢L)O((\mathcal{M}P/R)L) zeros, and over all characters it contains at most N∗⁢(σh,Tℳ,2⁢R)N^{*}(\sigma_{h},T_{\mathcal{M}},2R), where

(9.7) σh=max⁡(1−h,1/2),𝒦⁢(R,ℳ,h)=ℳ−1⁢N∗⁢(σh,2⁢ℳ⁢P/R,2⁢R)⁢X1−2⁢h.\sigma_{h}=\max(1-h,1/2),\qquad\mathcal{K}(R,\mathcal{M},h)=\mathcal{M}^{-1}N^% {*}(\sigma_{h},2\mathcal{M}P/R,2R)\,{X_{1}}^{-2h}.

For the terminal classes h>1/2h>1/2, the value σh=1/2\sigma_{h}=1/2 is valid because (9.5) already restricts to β≥1/2\beta\geq 1/2. We also have

(9.8) min⁡(1,2⁢Pr⁢|γ|)≤4ℳ.\min\left(1,\frac{2P}{r|\gamma|}\right)\leq\frac{4}{\mathcal{M}}.

The upper end range. For x∈[X−Y,X]x\in[X-Y,X], the zero term is bounded by

|Xϱ−xϱY⁢ϱ|≤min⁡(x−δ,2⁢X1−δY⁢|γ|)≪X−δ⁢min⁡(1,2⁢Pr⁢|γ|)≪X−hℳ.\left|\frac{X^{\varrho}-x^{\varrho}}{Y\varrho}\right|\leq\min\left(x^{-\delta}% ,\frac{2X^{1-\delta}}{Y|\gamma|}\right)\ll X^{-\delta}\min\left(1,\frac{2P}{r|% \gamma|}\right)\ll\frac{X^{-h}}{\mathcal{M}}.

Apply Cauchy–Schwarz first to the classes for one character and then to the zeros in one class. For fixed R,ℳ,hR,\mathcal{M},h, its contribution after summing characters is

L2⋅R⁢Q⋅X−2⁢hℳ2⋅ℳ⁢PR⁢L⋅N∗⁢(σh,Tℳ,2⁢R)=L3⁢X⁢ℳ−1⁢N∗⁢(σh,Tℳ,2⁢R)⁢X−2⁢h≤L4⁢X⁢𝒦⁢(R,ℳ,h).L^{2}\cdot RQ\cdot\frac{X^{-2h}}{\mathcal{M}^{2}}\cdot\frac{\mathcal{M}P}{R}L% \cdot N^{*}(\sigma_{h},T_{\mathcal{M}},2R)\\ =L^{3}X\mathcal{M}^{-1}N^{*}(\sigma_{h},T_{\mathcal{M}},2R)X^{-2h}\leq L^{4}X% \mathcal{K}(R,\mathcal{M},h).

Summing all classes gives O⁢(L7⁢X⁢max⁡𝒦)O(L^{7}X\max\mathcal{K}).

The lower end range. Here the window is (max⁡(x,X1),x+Y](\max(x,X_{1}),x+Y], and its zero term is at most

|(x+Y)ϱ−max(x,X1)ϱY⁢ϱ|≤min⁡(X1−δ,2⁢X1−δY⁢|γ|)≤X1−δ⁢min⁡(1,2⁢XY⁢|γ|)≪X1−hℳ.\left|\frac{(x+Y)^{\varrho}-\max(x,X_{1})^{\varrho}}{Y\varrho}\right|\leq\min% \left({X_{1}}^{-\delta},\frac{2X^{1-\delta}}{Y|\gamma|}\right)\\ \leq{X_{1}}^{-\delta}\min\left(1,\frac{2X}{Y|\gamma|}\right)\ll\frac{{X_{1}}^{% -h}}{\mathcal{M}}.

Here X1−δ{X_{1}}^{-\delta} is a power of X1=X1−ε0X_{1}=X^{1-\varepsilon_{0}} with exponent −δ-\delta. The numerator 2⁢X1−δ2X^{1-\delta} is a power of XX itself, with exponent 1−δ1-\delta.

The same calculation gives O⁢(L7⁢X⁢max⁡𝒦)O(L^{7}X\max\mathcal{K}). This range requires the factor X1−2⁢h{X_{1}}^{-2h} in place of X−2⁢hX^{-2h}.

The middle range. Partition it at xj=2j⁢X2x_{j}=2^{j}X_{2}, using xj,min⁡(2⁢xj,X−Y)x_{j},\min(2x_{j},X-Y). The final interval is truncated at X−YX-Y, and every window remains inside X1,XX_{1},X. Write

f⁢(u)=∑n≤u(χ⁢(n)⁢Λℙ⁢(n)−E⁢(χ)).f(u)=\sum_{n\leq u}\bigl{(}\chi(n)\Lambda_{\mathbb{P}}(n)-E(\chi)\bigr{)}.

For x≥X2≥6⁢Yx\geq X_{2}\geq 6Y, the following estimate also bounds a truncated interval:

(9.9) ∫x2⁢x|f⁢(u+Y)−f⁢(u)Y|2⁢𝑑u≤30Y2⁢maxY/(3⁢x)≤θ′≤3⁢Y/x⁢∫x3⁢x|f⁢(u+θ′⁢u)−f⁢(u)|2⁢𝑑u.\int_{x}^{2x}\left|\frac{f(u+Y)-f(u)}{Y}\right|^{2}du\leq\frac{30}{Y^{2}}\max_% {Y/(3x)\leq\theta^{\prime}\leq 3Y/x}\int_{x}^{3x}|f(u+\theta^{\prime}u)-f(u)|^% {2}du.

To prove it, for 2⁢Y≤v≤3⁢Y2Y\leq v\leq 3Y write

g⁢(u)=f⁢(u+Y)−f⁢(u)=[f⁢(u+v)−f⁢(u)]−[f⁢((u+Y)+(v−Y))−f⁢(u+Y)].g(u)=f(u+Y)-f(u)=\bigl{[}f(u+v)-f(u)\bigr{]}-\bigl{[}f((u+Y)+(v-Y))-f(u+Y)% \bigr{]}.

Average over vv and use Cauchy–Schwarz. In the first bracket substitute θ′=v/u\theta^{\prime}=v/u; its contribution is at most (2/Y)⁢(2⁢x)⁢(3⁢Y/x)=12(2/Y)(2x)(3Y/x)=12 times the maximum integral. In the second substitute θ′=(v−Y)/(u+Y)\theta^{\prime}=(v-Y)/(u+Y); its contribution is at most (2/Y)⁢(3⁢x)⁢(3⁢Y/x)=18(2/Y)(3x)(3Y/x)=18 times that maximum. The common range is Y/(3⁢x),3⁢Y/xY/(3x),3Y/x, and division by Y2Y^{2} proves (9.9).

Here θ′≤1\theta^{\prime}\leq 1, and by (9.5) the zero coefficient is

f⁢(u+θ′⁢u)−f⁢(u)=−∑ϱcϱ⁢uϱ+O⁢(X⁢L2),\displaystyle f(u+\theta^{\prime}u)-f(u)=-\sum_{\varrho}c_{\varrho}u^{\varrho}% +O(\sqrt{X}L^{2}),
cϱ=(1+θ′)ϱ−1ϱ,|cϱ|≤min⁡(θ′,3|ϱ|).\displaystyle c_{\varrho}=\frac{(1+\theta^{\prime})^{\varrho}-1}{\varrho},% \qquad|c_{\varrho}|\leq\min\left(\theta^{\prime},\frac{3}{|\varrho|}\right).

Also

|∫x3⁢xuϱ+ϱ¯′⁢𝑑u|≪x3−δ−δ′1+|γ−γ′|.\left|\int_{x}^{3x}u^{\varrho+\bar{\varrho}^{\prime}}\,du\right|\ll\frac{x^{3-% \delta-\delta^{\prime}}}{1+|\gamma-\gamma^{\prime}|}.

The unit-interval zero count in (9.1) gives ∑ϱ′(1+|γ−γ′|)−1≪L2\sum_{\varrho^{\prime}}(1+|\gamma-\gamma^{\prime}|)^{-1}\ll L^{2} for one character. The arithmetic-geometric mean inequality in each pair yields

1Y2⁢∫x3⁢x|∑ϱcϱ⁢uϱ|2⁢𝑑u\displaystyle\frac{1}{Y^{2}}\int_{x}^{3x}\left|\sum_{\varrho}c_{\varrho}u^{% \varrho}\right|^{2}du ≪L2Y2∑ϱx3−2⁢δmin(θ′,3/|ϱ|)2\displaystyle\ll\frac{L^{2}}{Y^{2}}\sum_{\varrho}x^{3-2\delta}\min(\theta^{% \prime},3/|\varrho|)^{2}
≪L2Y⁢∑ϱx2−2⁢δ⁢min⁡(θ′,3/|ϱ|).\displaystyle\ll\frac{L^{2}}{Y}\sum_{\varrho}x^{2-2\delta}\min(\theta^{\prime}% ,3/|\varrho|).

Each zero contributes at most

L2⁢x1−2⁢δ⁢min⁡(1,xY⁢|γ|)≪L2⁢X1−2⁢hℳ.L^{2}x^{1-2\delta}\min\left(1,\frac{x}{Y|\gamma|}\right)\ll L^{2}\frac{X^{1-2h% }}{\mathcal{M}}.

Here X1−2⁢h=X⋅X−2⁢hX^{1-2h}=X\cdot X^{-2h} is a power of XX itself. Since X1<XX_{1}<X, the factor X−2⁢hX^{-2h} is at most the separate class factor X1−2⁢h{X_{1}}^{-2h} in (9.7). We used 1−2⁢δ≥01-2\delta\geq 0 and Y≥R⁢X/(2⁢P)Y\geq RX/(2P). Summing the class counts and the O⁢(L)O(L) intervals gives the total zero contribution O⁢(L6⁢X⁢max⁡𝒦)O(L^{6}X\max\mathcal{K}). The error in (9.5) contributes, per interval, O⁢(X2⁢L4/Y2)O(X^{2}L^{4}/Y^{2}), and after the interval and character sums it is

∑r≤Pr⋅X2⁢L5Y2≪∑r≤Pr⋅X2⁢L5(r⁢X/(2⁢P))2≪L6⁢P2.\sum_{r\leq P}r\cdot\frac{X^{2}L^{5}}{Y^{2}}\ll\sum_{r\leq P}r\cdot\frac{X^{2}% L^{5}}{(rX/(2P))^{2}}\ll L^{6}P^{2}.

Combining the three ranges gives

(9.10) ∑r≤P∑∗χmodr∗⁢W1⁢(χ)2≪L7⁢X⁢max⁡𝒦+L6⁢P2.\sum_{r\leq P}\;\sideset{}{{}^{*}}{\sum}_{\chi\bmod r}W_{1}(\chi)^{2}\ll L^{7}% X\max\mathcal{K}+L^{6}P^{2}.

Density estimates for the classes. Recall ϑ≤9/20−η\vartheta\leq 9/20-\eta, ϵ=η/90\epsilon=\eta/90 and ε0≤η/10\varepsilon_{0}\leq\eta/10. First suppose 1/8≤h≤3/141/8\leq h\leq 3/14, and use (9.1) with Q′=2⁢RQ^{\prime}=2R and T=2⁢ℳ⁢P/RT=2\mathcal{M}P/R. Then Q′⁣2⁢T≤8⁢P2⁢ℳQ^{\prime 2}T\leq 8P^{2}\mathcal{M}, and the exponent 2⁢h+ϵ−12h+\epsilon-1 of ℳ\mathcal{M} is negative. Thus 𝒦≪X−s3⁢(h)\mathcal{K}\ll X^{-s_{3}(h)}, where

(9.11) s3⁢(h)=2⁢h⁢(1−ε0−2⁢ϑ)−2⁢ϑ⁢ϵ≥14⁢(110+2⁢η−ε0)−910⁢ϵ≥140+93200⁢η≥140.\begin{split}s_{3}(h)&=2h(1-\varepsilon_{0}-2\vartheta)-2\vartheta\epsilon\\ &\geq\frac{1}{4}\Bigl{(}\frac{1}{10}+2\eta-\varepsilon_{0}\Bigr{)}-\frac{9}{10% }\epsilon\geq\tfrac{1}{40}+\tfrac{93}{200}\eta\geq\tfrac{1}{40}.\end{split}

The exact positivity condition is 1−ε0−2⁢ϑ>ϑ⁢ϵ/h1-\varepsilon_{0}-2\vartheta>\vartheta\epsilon/h, and at h=1/8h=1/8 its right side is 8⁢ϑ⁢ϵ8\vartheta\epsilon.

Next suppose 3/14≤h≤3/8−ϵ3/14\leq h\leq 3/8-\epsilon, and use (9.1). Here

Q′⁣2⁢T6/5=4⋅26/5⁢R4/5⁢(ℳ⁢P)6/5≤10⁢P2⁢ℳ6/5.Q^{\prime 2}T^{6/5}=4\cdot 2^{6/5}R^{4/5}(\mathcal{M}P)^{6/5}\leq 10P^{2}% \mathcal{M}^{6/5}.

The exponent of ℳ\mathcal{M} is (8/3)⁢h+(6/5)⁢ϵ−1≤−22⁢ϵ/15<0(8/3)h+(6/5)\epsilon-1\leq-22\epsilon/15<0. Consequently 𝒦≪ϵX−s2⁢(h)\mathcal{K}\ll_{\epsilon}X^{-s_{2}(h)}, with

(9.12) s2⁢(h)=2⁢h⁢(1−ε0−209⁢ϑ)−2⁢ϑ⁢ϵ≥(37⁢19190−1100)⁢η≥89⁢η.\begin{split}s_{2}(h)&=2h\Bigl{(}1-\varepsilon_{0}-\frac{20}{9}\vartheta\Bigr{% )}-2\vartheta\epsilon\\ &\geq\Bigl{(}\frac{3}{7}\frac{191}{90}-\frac{1}{100}\Bigr{)}\eta\\ &\geq\frac{8}{9}\eta.\end{split}

The required margin is

(9.13) 1−ε0−(20/9)⁢ϑ≥191⁢η/90>0.1-\varepsilon_{0}-(20/9)\vartheta\geq 191\eta/90>0.

For 3/8−ϵ≤h≤1/23/8-\epsilon\leq h\leq 1/2, use (9.1). The exponent 3⁢h/(1+h)−13h/(1+h)-1 of ℳ\mathcal{M} is nonpositive, and we obtain 𝒦≪L9⁢X−s1⁢(h)\mathcal{K}\ll L^{9}X^{-s_{1}(h)}, where

(9.14) s1⁢(h)=2⁢h1+h⁢(1+h−3⁢ϑ−ε0⁢(1+h))≥2⁢h1+h⁢(140+3⁢η−ϵ−32⁢ε0)≥175.\begin{split}s_{1}(h)&=\frac{2h}{1+h}\Bigl{(}1+h-3\vartheta-\varepsilon_{0}(1+% h)\Bigr{)}\\ &\geq\frac{2h}{1+h}\Bigl{(}\frac{1}{40}+3\eta-\epsilon-\frac{3}{2}\varepsilon_% {0}\Bigr{)}\geq\frac{1}{75}.\end{split}

The threshold ϑ<11/24\vartheta<11/24 has margin 1/120+η1/120+\eta.

Finally, if 1/2<h≤1/2+1/L1/2<h\leq 1/2+1/L, then σh=1/2\sigma_{h}=1/2, and the elementary zero count gives

N∗⁢(1/2,T,Q′)≤N∗⁢(0,T,Q′)≪Q′⁣2⁢T⁢L=8⁢R⁢ℳ⁢P⁢L.N^{*}(1/2,T,Q^{\prime})\leq N^{*}(0,T,Q^{\prime})\ll Q^{\prime 2}TL=8R\mathcal% {M}PL.

Since 2⁢h>12h>1,

𝒦≪ℳ−1⋅8⁢R⁢ℳ⁢P⁢L9⋅X1−1≤8⁢L9⁢P2⁢X−(1−ε0)≪L9⁢X−1/10.\mathcal{K}\ll\mathcal{M}^{-1}\cdot 8R\mathcal{M}PL^{9}\cdot{X_{1}}^{-1}\leq 8% L^{9}P^{2}X^{-(1-\varepsilon_{0})}\ll L^{9}X^{-1/10}.

All classes have now been covered. For η≤1/100\eta\leq 1/100,

(9.15) max⁡𝒦≪ηL9⁢X−c⁢(η),c⁢(η)=min⁡(140,89⁢η,175,110)=89⁢η.\max\mathcal{K}\ll_{\eta}L^{9}X^{-c(\eta)},\qquad c(\eta)=\min\bigl{(}\tfrac{1% }{40},\tfrac{8}{9}\eta,\tfrac{1}{75},\tfrac{1}{10}\bigr{)}=\frac{8}{9}\eta.

Equations (9.3), (9.10) and (9.15) prove (9.2). The term L8⁢P2L^{8}P^{2} is absorbed because P2≤X9/10−2⁢ηP^{2}\leq X^{9/10-2\eta}. ∎

9.3. A variant without the first density estimate

One may omit (9.1) and use (9.1) throughout 1/8≤h≤3/8−ϵ1/8\leq h\leq 3/8-\epsilon. The minimum in (9.12) is then at h=1/8h=1/8, giving

s2≥14⋅19190⁢η−η100=0.5206⁢…⁢η≥η2.s_{2}\geq\frac{1}{4}\cdot\frac{191}{90}\eta-\frac{\eta}{100}=0.5206\ldots\eta% \geq\frac{\eta}{2}.

The mean-square saving is η/2\eta/2 in place of 8⁢η/98\eta/9, and the mixed error below becomes X1−η/4⁢L19/2X^{1-\eta/4}L^{19/2}. All other steps are unchanged.

9.4. The discrete pole and its kernel

Parseval and Lemma 4.4, together with Proposition 9.1, give

(9.16) |∫𝔐S1⁢(α)⁢Sλ⁢(α)⁢e⁢(−n⁢α)⁢𝑑α|≪X1−4⁢η/9⁢L19/2.\left|\int_{\mathfrak{M}}S_{1}(\alpha)S_{\lambda}(\alpha)e(-n\alpha)\,d\alpha% \right|\ll X^{1-4\eta/9}L^{19/2}.

Put V⁢(β)=∫X1Xe⁢(β⁢u)⁢𝑑uV(\beta)=\int_{X_{1}}^{X}e(\beta u)\,du.

(F15)  [9, Lemma 2.8] Euler–Maclaurin summation gives |𝒯⁢(β)−V⁢(β)|≪1+X⁢|β||\mathcal{T}(\beta)-V(\beta)|\ll 1+X|\beta|.

On 𝔐⁢(q,a)\mathfrak{M}(q,a) this is O⁢(1+P/q)O(1+P/q). Therefore

∫𝔐|μ⁢(q)φ⁢(q)⁢(𝒯−V)|2≪∑q≤P1φ⁢(q)⋅Pq⁢X⁢(1+Pq)2≪P3X.\int_{\mathfrak{M}}\left|\frac{\mu(q)}{\varphi(q)}(\mathcal{T}-V)\right|^{2}% \ll\sum_{q\leq P}\frac{1}{\varphi(q)}\cdot\frac{P}{qX}\left(1+\frac{P}{q}% \right)^{2}\ll\frac{P^{3}}{X}.

Its mixed contribution with SλS_{\lambda} is

(9.17) O⁢(P3/2⁢L1/2).O(P^{3/2}L^{1/2}).

Let Bq=P/(q⁢X)B_{q}=P/(qX) and Si⁡(t)=∫0t(sin⁡u)/u⁢𝑑u\operatorname{Si}(t)=\int_{0}^{t}(\sin u)/u\,du. The remaining pole term is

(9.18) Rpole⁢(n)\displaystyle R_{\mathrm{pole}}(n) =∑q≤Pμ⁢(q)φ⁢(q)⁢∑m∈Iλ⁢(m)⁢cq⁢(n−m)⁢Kq⁢(n−m),\displaystyle=\sum_{q\leq P}\frac{\mu(q)}{\varphi(q)}\sum_{m\in I}\lambda(m)c_% {q}(n-m)K_{q}(n-m),
(9.19) Kq⁢(v)\displaystyle K_{q}(v) =1π⁢[Si⁡(2⁢π⁢Bq⁢(X−v))+Si⁡(2⁢π⁢Bq⁢(v−X1))].\displaystyle=\frac{1}{\pi}\Bigl{[}\operatorname{Si}\bigl{(}2\pi B_{q}(X-v)% \bigr{)}+\operatorname{Si}\bigl{(}2\pi B_{q}(v-X_{1})\bigr{)}\Bigr{]}.

This follows by integrating V⁢(β)⁢e⁢(−β⁢v)V(\beta)e(-\beta v) over [−Bq,Bq][-B_{q},B_{q}]. By (5.3), both arguments have positive gaps at least X/8X/8. Here, since ε0>0\varepsilon_{0}>0 is fixed and X1/X=X−ε0→0X_{1}/X=X^{-\varepsilon_{0}}\to 0, we have X1≤X/8X_{1}\leq X/8 for all sufficiently large XX. Differentiating (9.19) gives

(9.20) Kq′⁢(v)=1π⁢(sin⁡(2⁢π⁢Bq⁢(v−X1))v−X1−sin⁡(2⁢π⁢Bq⁢(X−v))X−v).K_{q}^{\prime}(v)=\frac{1}{\pi}\left(\frac{\sin\bigl{(}2\pi B_{q}(v-X_{1})% \bigr{)}}{v-X_{1}}-\frac{\sin\bigl{(}2\pi B_{q}(X-v)\bigr{)}}{X-v}\right).

On [X/4,7⁢X/8][X/4,7X/8], each of X−vX-v and v−X1v-X_{1} ranges within [X/8,7⁢X/8][X/8,7X/8]. Hence

Var[X/4,7⁢X/8]⁡Kq=∫X/47⁢X/8|Kq′⁢(v)|⁢𝑑v≤2⁢log⁡7π<2.\operatorname{Var}_{[X/4,7X/8]}K_{q}=\int_{X/4}^{7X/8}|K_{q}^{\prime}(v)|\,dv% \leq\frac{2\log 7}{\pi}<2.

The elementary estimates |Si⁡(t)−π/2|≤2/t|\operatorname{Si}(t)-\pi/2|\leq 2/t and supt≥0Si⁡(t)<1.86\sup_{t\geq 0}\operatorname{Si}(t)<1.86 give

(9.21) Kq⁢(v)=1+O⁢(q/P),‖Kq‖∞≤1.19,Var[X/4,7⁢X/8]⁡Kq<2.K_{q}(v)=1+O(q/P),\qquad\|K_{q}\|_{\infty}\leq 1.19,\qquad\operatorname{Var}_{% [X/4,7X/8]}K_{q}<2.

We keep KqK_{q} until the residue-class calculation is done.

9.5. Reduced residue classes

Only squarefree moduli contribute to (9.18). All non-squarefree arcs are already included in (9.16), since there μ⁢(q)=0\mu(q)=0 and S1=SS_{1}=S. In the rest of the pole calculation, qq is squarefree.

For (r,q)=1(r,q)=1, partial summation and (9.21) give

(9.22) ∑m∈Im≡r(modq)λ⁢(m)⁢Kq⁢(n−m)=1φ⁢(q)⁢∑m∈I(m,q)=1λ⁢(m)⁢Kq⁢(n−m)+O⁢(7⁢Δλ⁢(q)).\begin{split}\sum_{\begin{subarray}{c}m\in I\\ m\equiv r\pmod{q}\end{subarray}}\lambda(m)K_{q}(n-m)={}&\frac{1}{\varphi(q)}% \sum_{\begin{subarray}{c}m\in I\\ (m,q)=1\end{subarray}}\lambda(m)K_{q}(n-m)\\ &+O(7\Delta_{\lambda}(q)).\end{split}

The bounded variation keeps a factor P/qP/q out of this estimate. For squarefree qq, multiplicativity gives

(9.23) ∑(r,q)=1cq⁢(n−r)=μ⁢(q)⁢cq⁢(n),∑(r,q)=1|cq⁢(n−r)|≤∑rmodq|cq⁢(n−r)|=2ω⁢(q)⁢φ⁢(q).\begin{split}\sum_{(r,q)=1}c_{q}(n-r)&=\mu(q)c_{q}(n),\\ \sum_{(r,q)=1}|c_{q}(n-r)|&\leq\sum_{r\bmod q}|c_{q}(n-r)|=2^{\omega(q)}% \varphi(q).\end{split}

For a prime pp, use cp⁢(n)=p−1c_{p}(n)=p-1 when p∣np\mid n, and cp⁢(n)=−1c_{p}(n)=-1 otherwise; the Chinese remainder theorem gives the product identities. Consequently, the coprime part of (9.18) is

(9.24) ∑q≤Pμ2⁢(q)⁢cq⁢(n)φ⁢(q)2⁢∑m∈I(m,q)=1λ⁢(m)⁢Kq⁢(n−m)+O⁢(∑q≤QB2ω⁢(q)⁢Δλ⁢(q)).\sum_{q\leq P}\frac{\mu^{2}(q)c_{q}(n)}{\varphi(q)^{2}}\sum_{\begin{subarray}{% c}m\in I\\ (m,q)=1\end{subarray}}\lambda(m)K_{q}(n-m)+O\left(\sum_{q\leq Q_{B}}2^{\omega(% q)}\Delta_{\lambda}(q)\right).

Proposition 8.1 bounds the error by O⁢(X⁢L−B)O(XL^{-B}), since it applies to this same weight, with both maxima, at level QB≥PQ_{B}\geq P.

9.6. Non-coprime classes

The non-coprime part satisfies

(9.25) |Rnc⁢(n)|≤∑q≤Pμ2⁢(q)φ⁢(q)⁢∑m∈I(m,q)>1|λ⁢(m)⁢cq⁢(n−m)⁢Kq⁢(n−m)|.|R_{\mathrm{nc}}(n)|\leq\sum_{q\leq P}\frac{\mu^{2}(q)}{\varphi(q)}\sum_{% \begin{subarray}{c}m\in I\\ (m,q)>1\end{subarray}}|\lambda(m)c_{q}(n-m)K_{q}(n-m)|.

If a summand is nonzero, some prime ℓ≥z\ell\geq z divides both m,qm,q. Since q<z5q<z^{5}, there are at most four such primes in qq. Write q=ℓ⁢sq=\ell s. Squarefreeness gives (ℓ,s)=1(\ell,s)=1 and

cq⁢(n−m)=cℓ⁢(n−m)⁢cs⁢(n−m)=cℓ⁢(n)⁢cs⁢(n−m).c_{q}(n-m)=c_{\ell}(n-m)c_{s}(n-m)=c_{\ell}(n)c_{s}(n-m).

Also |cs⁢(v)|≤(s,v)≤∑d∣s,d∣vd|c_{s}(v)|\leq(s,v)\leq\sum_{d\mid s,\ d\mid v}d. For d∣sd\mid s the conditions ℓ∣m\ell\mid m and d∣n−md\mid n-m are coprime, and their count up to X/4X/4 is at most X/(ℓ⁢d)+1X/(\ell d)+1. Thus, termwise in the absolute sum,

|∑m∈Iℓ∣mλ⁢(m)⁢cq⁢(n−m)⁢Kq⁢(n−m)|\displaystyle\left|\sum_{\begin{subarray}{c}m\in I\\ \ell\mid m\end{subarray}}\lambda(m)c_{q}(n-m)K_{q}(n-m)\right| ≪L⁢|cℓ⁢(n)|⁢∑d∣sd⁢(Xℓ⁢d+1)\displaystyle\ll L|c_{\ell}(n)|\sum_{d\mid s}d\left(\frac{X}{\ell d}+1\right)
=L⁢|cℓ⁢(n)|⁢(τ⁢(s)⁢Xℓ+σ⁢(s)).\displaystyle=L|c_{\ell}(n)|\left(\frac{\tau(s)X}{\ell}+\sigma(s)\right).
RHS of (9.25) ≪L⁢∑z≤ℓ≤P|cℓ⁢(n)|φ⁢(ℓ)⁢∑s≤P/ℓτ⁢(s)⁢X/ℓ+σ⁢(s)φ⁢(s)\displaystyle\ll L\sum_{z\leq\ell\leq P}\frac{|c_{\ell}(n)|}{\varphi(\ell)}% \sum_{s\leq P/\ell}\frac{\tau(s)X/\ell+\sigma(s)}{\varphi(s)}
≪L3⁢∑z≤ℓ≤P|cℓ⁢(n)|φ⁢(ℓ)⋅X+Pℓ\displaystyle\ll L^{3}\sum_{z\leq\ell\leq P}\frac{|c_{\ell}(n)|}{\varphi(\ell)% }\cdot\frac{X+P}{\ell}
≪X⁢L3z=X9/10⁢L3.\displaystyle\ll\frac{XL^{3}}{z}=X^{9/10}L^{3}.

Using ∑s≤Sτ⁢(s)/φ⁢(s)≪L2\sum_{s\leq S}\tau(s)/\varphi(s)\ll L^{2} and σ⁢(s)/φ⁢(s)≪L\sigma(s)/\varphi(s)\ll L, we obtain

(9.26) |Rnc⁢(n)|\displaystyle|R_{\mathrm{nc}}(n)| ≪L3⁢∑z≤ℓ≤P|cℓ⁢(n)|φ⁢(ℓ)⁢X+Pℓ≪X⁢L3/z=X9/10⁢L3.\displaystyle\ll L^{3}\sum_{z\leq\ell\leq P}\frac{|c_{\ell}(n)|}{\varphi(\ell)% }\frac{X+P}{\ell}\ll XL^{3}/z=X^{9/10}L^{3}.

If ℓ∤n\ell\nmid n, sum 1/(ℓ⁢φ⁢(ℓ))≪1/z1/(\ell\varphi(\ell))\ll 1/z. If ℓ∣n\ell\mid n, its contribution is at most 2⁢X/z2X/z, and at most ten primes at least zz divide n≤X=z10n\leq X=z^{10}. This proves uniformity in nn.

We next remove (m,q)=1(m,q)=1 from (9.24). On the support of λ\lambda, at most 4⁢(X/z+1)4(X/z+1) non-coprime integers occur. For squarefree qq, write d=(q,n)d=(q,n) and q=d⁢rq=dr. Then |cq⁢(n)|=φ⁢(d)|c_{q}(n)|=\varphi(d) and

(9.27) ∑qμ2⁢(q)⁢|cq⁢(n)|φ⁢(q)2≤∑d∣n1φ⁢(d)⁢∑r≥11φ⁢(r)2≪νXν.\sum_{q}\frac{\mu^{2}(q)|c_{q}(n)|}{\varphi(q)^{2}}\leq\sum_{d\mid n}\frac{1}{% \varphi(d)}\sum_{r\geq 1}\frac{1}{\varphi(r)^{2}}\ll_{\nu}X^{\nu}.

Together with |λ⁢Kq|≪L|\lambda K_{q}|\ll L, this bounds the removal error by

(9.28) Oν⁢(X9/10+ν)(ν>0).O_{\nu}(X^{9/10+\nu})\qquad(\nu>0).

The divisor-bound exponent is arbitrary, so it absorbs the logarithm.

9.7. Completion of the singular series

The same squarefree factorisation gives, for every ν>0\nu>0,

(9.29) ∑q≤Pμ2⁢(q)⁢q⁢|cq⁢(n)|φ⁢(q)2≪νXν,∑q>Pμ2⁢(q)⁢|cq⁢(n)|φ⁢(q)2≪νXν/P.\sum_{q\leq P}\frac{\mu^{2}(q)q|c_{q}(n)|}{\varphi(q)^{2}}\ll_{\nu}X^{\nu},% \qquad\sum_{q>P}\frac{\mu^{2}(q)|c_{q}(n)|}{\varphi(q)^{2}}\ll_{\nu}X^{\nu}/P.

For the first bound, use ∑r≤Yr/φ⁢(r)2≪log⁡(2⁢Y)\sum_{r\leq Y}r/\varphi(r)^{2}\ll\log(2Y) and sum d/φ⁢(d)d/\varphi(d) over d∣nd\mid n. For the second, use ∑r>Yφ⁢(r)−2≪1/Y\sum_{r>Y}\varphi(r)^{-2}\ll 1/Y. These elementary estimates follow by expanding the factors over squarefree divisors. The resulting Euler products converge after the indicated logarithmic factor is removed.

Both steps below use the absolute mass bound of Lemma 4.4, restated in (4.25):

∑m∈I|λ⁢(m)|≪X,|Fλ|≤∑m∈I|λ⁢(m)|≪X.\sum_{m\in I}|\lambda(m)|\ll X,\qquad|F_{\lambda}|\leq\sum_{m\in I}|\lambda(m)% |\ll X.

By (9.21), replacing KqK_{q} by 11 costs Oν⁢(X1+ν/P)O_{\nu}(X^{1+\nu}/P), since ∑m|λ⁢(m)|≪X\sum_{m}|\lambda(m)|\ll X. Completing the qq-sum has the same cost, since |Fλ|≪X|F_{\lambda}|\ll X. The completed series is

(9.30) 𝔖⁢(n)=∑q≥1μ2⁢(q)⁢cq⁢(n)φ⁢(q)2=2⁢∏p>2(1−1(p−1)2)⁢∏p∣np>2p−1p−2≥2⁢C2≥1.32(2∣n),\begin{split}\mathfrak{S}(n)&=\sum_{q\geq 1}\frac{\mu^{2}(q)c_{q}(n)}{\varphi(% q)^{2}}\\ &=2\prod_{p>2}\left(1-\frac{1}{(p-1)^{2}}\right)\prod_{\begin{subarray}{c}p% \mid n\\ p>2\end{subarray}}\frac{p-1}{p-2}\geq 2C_{2}\geq 1.32\qquad(2\mid n),\end{split}

where C2=∏p>2(1−(p−1)−2)C_{2}=\prod_{p>2}(1-(p-1)^{-2}) and 2⁢C2=1.3203⁢…2C_{2}=1.3203\ldots.

9.8. The major-arc asymptotic and positivity

Proposition 9.2.

Assume H7/8H_{7/8} and the parameter choices of Section 2. Let λ=(log⁡m)⁢ρ⁢(m)\lambda=(\log m)\rho(m) be the weight of Section 3. Thus it is supported on zz-rough m∈Im\in I, with |λ|≤256⁢L|\lambda|\leq 256L, ∑|λ|2≪X⁢L\sum|\lambda|^{2}\ll XL and ∑|λ|≪X\sum|\lambda|\ll X. Use Proposition 8.1 for this weight at QB≥PQ_{B}\geq P. For B>0B>0 and 0<ν≤1/200<\nu\leq 1/20, uniformly for even n∈(X/2,X]n\in(X/2,X],

(9.31) I𝔐(n)=𝔖(n)Fλ+Oη,B,ν(X1−4⁢η/9⁢L19/2+P3/2⁢L1/2+X⁢L−B+X9/10L3+X9/10+ν+X1+ν/P).\begin{split}I_{\mathfrak{M}}(n)=\mathfrak{S}(n)F_{\lambda}+O_{\eta,B,\nu}% \bigl{(}&X^{1-4\eta/9}L^{19/2}+P^{3/2}L^{1/2}+XL^{-B}\\ &+X^{9/10}L^{3}+X^{9/10+\nu}+X^{1+\nu}/P\bigr{)}.\end{split}

In particular, I𝔐⁢(n)=𝔖⁢(n)⁢Fλ+o⁢(X)I_{\mathfrak{M}}(n)=\mathfrak{S}(n)F_{\lambda}+o(X).

Proof.

Use (9.16) and (9.17), and evaluate the pole by (9.24) and (9.26). Then (9.28) and (9.29) give exactly the six errors in (9.31). At the stipulated PP,

P3/2⁢L1/2≤X27/40−3⁢η/2⁢L1/2,X9/10+ν≤X19/20,\displaystyle P^{3/2}L^{1/2}\leq X^{27/40-3\eta/2}L^{1/2},\qquad X^{9/10+\nu}% \leq X^{19/20},
X1+ν/P≤2⁢X11/20+η+ν≤2⁢X61/100.\displaystyle X^{1+\nu}/P\leq 2X^{11/20+\eta+\nu}\leq 2X^{61/100}.

Each error is o⁢(X)o(X), and this conclusion does not require a sign for FλF_{\lambda}. ∎

Corollary 9.3.

Assume H7/8H_{7/8}. For all large XX and every even n∈(X/2,X]n\in(X/2,X],

I𝔐⁢(n)≥0.025⁢X.I_{\mathfrak{M}}(n)\geq 0.025X.
Proof.

Proposition 4.9 gives Fλ≥0F_{\lambda}\geq 0 for large XX. By (9.30) and Proposition 9.2,

𝔖⁢(n)⁢Fλ≥1.32⁢Fλ≥1.32⁢(ccert8−o⁢(1))⁢X.\mathfrak{S}(n)F_{\lambda}\geq 1.32F_{\lambda}\geq 1.32\Bigl{(}\frac{c_{% \mathrm{cert}}}{8}-o(1)\Bigr{)}X.

The exact rational (4.24) satisfies 1.32⁢ccert/8=0.0250913982659⁢…>0.0251.32c_{\mathrm{cert}}/8=0.0250913982659\ldots>0.025, and the positive margin absorbs the error terms. ∎

10. Proof of Theorem 2

Proof of Theorem 2.

Let ε>0\varepsilon>0 and use (2.1). At each large scale XX, choose PP as in (2.4). Corollary 9.3 supplies c1=0.025c_{1}=0.025 in Proposition 5.1. Corollary 6.4 gives 𝒮≪X31/40+η/2⁢L9/2\mathcal{S}\ll X^{31/40+\eta/2}L^{9/2} at the same PP, and both use the same signed weight λ\lambda. Therefore

|ℰX|≪𝒮2⁢LX≪X31/20+η−1⁢L10=X11/20+η⁢L10=X1−t⁢L10.|\mathcal{E}_{X}|\ll\frac{\mathcal{S}^{2}L}{X}\ll X^{31/20+\eta-1}L^{10}=X^{11% /20+\eta}L^{10}=X^{1-t}L^{10}.

Choose X0=X0⁢(ε)X_{0}=X_{0}(\varepsilon) so that this holds at every scale at least X0X_{0}, and apply it to Y=X/2kY=X/2^{k} with its own cutoff P⁢(Y)P(Y). The constants are uniform, and the geometric sum gives

E⁢(X)≤X0+∑k≥0Cε⁢(X/2k)11/20+η⁢(log⁡X)10≪εX11/20+η⁢(log⁡X)10≪εX11/20+ε.E(X)\leq X_{0}+\sum_{k\geq 0}C_{\varepsilon}(X/2^{k})^{11/20+\eta}(\log X)^{10% }\ll_{\varepsilon}X^{11/20+\eta}(\log X)^{10}\ll_{\varepsilon}X^{11/20+% \varepsilon}.

Since η<ε\eta<\varepsilon, this is Oε⁢(X11/20+ε)O_{\varepsilon}(X^{11/20+\varepsilon}). ∎

11. Proof of Theorem 1

Proof of Theorem 1.

Theorem 2, together with the zero-free half-plane ℜ⁡s>7/8\Re s>7/8 in [6, Theorem 1.1], gives the assertion. ∎

Appendix A The exact rational mass certificate

This appendix gives the finite arithmetic for (4.19). The regions are exactly (4.10), and the cell tests are (4.16) and (4.17). No limiting numerical integration is used.

A.1. Integer form of the cell weights

For a cell of dimension kk on the grid of size nn, put

ri=2⁢n+7⁢ji,ri+=ri+7,qK=20⁢n−∑i=1kri+,sK=rk+.r_{i}=2n+7j_{i},\qquad r_{i}^{+}=r_{i}+7,\qquad q_{K}=20n-\sum_{i=1}^{k}r_{i}^% {+},\qquad s_{K}=r_{k}^{+}.

Thus xi,0=ri/(20⁢n)x_{i,0}=r_{i}/(20n) and u0⁢(K)=qK/sKu_{0}(K)=q_{K}/s_{K}. Write the rational envelope value as aK/bKa_{K}/b_{K}, using

(A.1) aKbK={1,qK<sK,sK/qK,qK≥sK⁢ and ⁢125⁢sK≥71⁢qK,71/125,qK≥sK⁢ and ⁢125⁢sK<71⁢qK.\frac{a_{K}}{b_{K}}=\begin{cases}1,&q_{K}<s_{K},\\ s_{K}/q_{K},&q_{K}\geq s_{K}\text{ and }125s_{K}\geq 71q_{K},\\ 71/125,&q_{K}\geq s_{K}\text{ and }125s_{K}<71q_{K}.\end{cases}

Reduction to lowest terms is unnecessary, and (4.15) is exactly

(A.2) W⁢(K)=AKBK,AK=7k⁢(20⁢n)⁢aK,BK=bK⁢r1⁢⋯⁢rk−1⁢rk2.W(K)=\frac{A_{K}}{B_{K}},\qquad A_{K}=7^{k}(20n)a_{K},\qquad B_{K}=b_{K}r_{1}% \cdots r_{k-1}r_{k}^{2}.

For U2U_{2}, take (n,k)=(256,2)(n,k)=(256,2) and n>j1≥j2≥0n>j_{1}\geq j_{2}\geq 0; the integer tests are

(A.3) r1<9⁢n,r1+r2+14>11⁢n,r1+2⁢r2≤20⁢n.r_{1}<9n,\qquad r_{1}+r_{2}+14>11n,\qquad r_{1}+2r_{2}\leq 20n.

For V4V_{4}, take (n,k)=(64,4)(n,k)=(64,4) and n>j1≥j2≥j3≥j4≥0n>j_{1}\geq j_{2}\geq j_{3}\geq j_{4}\geq 0; the integer tests are

(A.4) r1+r2<9⁢n,r1+r2+r3+21>11⁢n,r1+r2+r3+2⁢r4≤20⁢n.r_{1}+r_{2}<9n,\quad r_{1}+r_{2}+r_{3}+21>11n,\quad r_{1}+r_{2}+r_{3}+2r_{4}% \leq 20n.

These are the original rational cell tests after clearing denominators.

A.2. Readable rational upper sums

For each retained cell define the integer

(A.5) b⁢(K)=⌈1018⁢W⁢(K)⌉=⌊1018⁢AK+BK−1BK⌋.b(K)=\left\lceil 10^{18}W(K)\right\rceil=\left\lfloor\frac{10^{18}A_{K}+B_{K}-% 1}{B_{K}}\right\rfloor.

Every cell weight is rational and nonnegative, so W⁢(K)≤b⁢(K)/1018W(K)\leq b(K)/10^{18}. Tables A.1 and A.2 list sums of these integers, with rows that partition the first-coordinate index j1j_{1}. Each entry is obtained by the finite divisions and additions in (A.1)–(A.5).

Table A.1. The U2U_{2} upper sum. The final column has denominator 101810^{18}.
j1j_{1} Retained cells ∑b⁢(K)\sum b(K)
0–127127 0 0
128128–159159 10561056 5725092678194976657250926781949766
160160–191191 27732773 153887915136000733153887915136000733
192192–223223 33763376 212249038575035418212249038575035418
224224–255255 38883888 309273586283258073309273586283258073
Total 1109311093 732661466776243990732661466776243990
Table A.2. The V4V_{4} upper sum. The final column has denominator 101810^{18}.
j1j_{1} Retained cells ∑b⁢(K)\sum b(K)
0–77 0 0
88–1515 6060 307379357895441307379357895441
1616–2323 79197919 3854281140058579638542811400585796
2424–3131 82638263 4393266343942258243932663439422582
3232–3939 19261926 1393399020970005513933990209700055
4040–4747 118118 12956547520601971295654752060197
4848–6363 0 0
Total 1828618286 9801249915966407198012499159664071

The totals imply

(A.6) 𝐔2\displaystyle\mathbf{U}_{2} ≤7326614667762439901018<7326614667771012,\displaystyle\leq\frac{732661466776243990}{10^{18}}<\frac{732661466777}{10^{12% }},
𝐕4\displaystyle\mathbf{V}_{4} ≤980124991596640711018<980125083791012.\displaystyle\leq\frac{98012499159664071}{10^{18}}<\frac{98012508379}{10^{12}}.

The positive differences after multiplication by 101810^{18} are 756010756010 and 92193359299219335929. The final mass calculation uses the original upper bounds on the right; the slightly smaller table bounds are not used.

A.3. The four losses and the final subtraction

Table A.3 collects the rational coefficients of X/8X/8; the volume calculations for L4,U4L_{4},U_{4} are proved in Lemma 4.8.

Table A.3. Rational coefficients for the four discarded families.
Family Calculation Upper coefficient
U2U_{2} 256256-grid rectangle sum 7326614667771012\dfrac{732661466777}{10^{12}}
L4L_{4} Cω⁢105⁢(1/20)4/576C_{\omega}10^{5}(1/20)^{4}/576 71115200\dfrac{71}{115200}
U4U_{4} Cω⁢105⁢(3/20)4/1728C_{\omega}10^{5}(3/20)^{4}/1728 21312800\dfrac{213}{12800}
V4V_{4} 6464-grid rectangle sum 980125083791012\dfrac{98012508379}{10^{12}}

Exact subtraction gives

1−7326614667771012−71115200−21312800−980125083791012=3421554308992250000000000.1-\frac{732661466777}{10^{12}}-\frac{71}{115200}-\frac{213}{12800}-\frac{98012% 508379}{10^{12}}=\frac{342155430899}{2250000000000}.

In particular,

ccert−320=46554308992250000000000>0.c_{\mathrm{cert}}-\frac{3}{20}=\frac{4655430899}{2250000000000}>0.

The envelope inequality is also certified rationally:

71125⁢∑j=04(71/125)jj!=733930882351732421875000>1.\frac{71}{125}\sum_{j=0}^{4}\frac{(71/125)^{j}}{j!}=\frac{733930882351}{732421% 875000}>1.

The accompanying script cert1120.py evaluates the original cell sums with exact rational arithmetic. Its output confirms the cell counts, the two upper bounds, the two volume coefficients and the displayed value of ccertc_{\mathrm{cert}}. The analytic reduction to these finite sums is proved in Section 4. The script checks only the arithmetic and supplies no asymptotic estimate.

Statements and declarations

Competing interests. The author has no competing interests.

Funding. No funding was received for this work.

Data availability. The rational certificate is specified in Appendix A. The accompanying script cert1120.py and its output reproduce the finite sums.

References

  • [1] H. Davenport, Multiplicative Number Theory, 2nd ed., revised by H. L. Montgomery, Graduate Texts in Mathematics 74, Springer, New York, 1980.
  • [2] P. X. Gallagher, Invent. Math. 11 (1970), 329–339, Lemma 1.
  • [3] D. R. Heath-Brown, Canad. J. Math. 31 (1979), 231–240, Theorem 1 and Theorem 2(3).
  • [4] H. Iwaniec and E. Kowalski, Analytic Number Theory, Section 3.4 and Theorem 7.13.
  • [5] H. L. Montgomery, Topics in Multiplicative Number Theory, Lecture Notes in Mathematics 227, Theorem 12.2.
  • [6] OpenAI, The Quasi-Riemann Hypothesis: A Zero-Free Half-Plane ℜ⁡s>7/8\Re s>7/8, OpenAI Math Release preprint, 30 September 2026, family 003, Theorem 1.1. Primary source PDF: https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/The-Quasi-Riemann-Hypothesis-September-30-2026/paper.pdf,
    commit adc7f1241b42e322a6451854ab7e4b4c146bf78a;
    PDF SHA-256 8fe93046f8cf5ef1ba5969c89addc02d76311adc4ee907509ff9cd96f7ec99e7.
  • [7] J. Pintz, A new explicit formula in the additive theory of primes with applications I. The explicit formula for the Goldbach problem and the Generalized Twin Prime Problem, Acta Arith. 210 (2023), 53–94, doi:10.4064/aa220728-31-3. Equation and theorem numbers cited here are from the preprint version dated 16 April 2018.
  • [8] J. Pintz and I. Althöfer, The Goldbach exceptional set: an exponent 7/127/12 and conditional refinement, preprint, arXiv:2610.15559, version 1 (11 October 2026), Theorem 1 and Corollary 2.
  • [9] R. C. Vaughan, The Hardy–Littlewood Method, 2nd ed., Lemmas 2.2 and 2.8.