betaFeedback

WorksMathematics

Failure of the Li–Liu spectral hypothesis R under Dirichlet GRH

Abstract

Under Dirichlet GRH, the Li–Liu spectral hypothesis R fails. For every fixed D>0D>0 and 0<ε<10<\varepsilon<1, each sufficiently large interval [X,2X][X,2X] contains at least Xexp⁡(−(log⁡X)ε)X\exp(-(\log X)^\varepsilon) even integers NN for which N ∥TN∥>(log⁡N)D\sqrt N\,\|T_N\|>(\log N)^D. We construct these integers unconditionally and use GRH only at the modulus NN to obtain the norm bound. Each has at least (log⁡N)D(\log N)^D representations as a sum of two distinct primes. The proof isolates a matrix entry in which the continuous model cancels and the two arithmetic terms have different Buchstab densities.

Introduction

Li and Liu [5] attach a compact self-adjoint operator TNT_N to each even N>e10N > e^{10} satisfying GRH⁡(N)\operatorname{GRH}(N), the Riemann hypothesis for the primitive Dirichlet LL-functions of conductor dividing NN, including the Riemann zeta function. Their hypothesis R places every zero of an auxiliary spectral product on the line ℜs=1/2\Re s = 1/2 for every sufficiently large such NN. By their Theorem 6.1, this is equivalent at NN to

N∥TN∥≤(log⁡N)3/2G(N),G(N)=2∏p>2(1−1(p−1)2)∏p∣Np>2p−1p−2.(1)\sqrt{N}\|T_N\| \le(\log N)^{3/2}\sqrt{\mathcal{G}(N)}, \qquad\mathcal{G}(N)=2\prod_{p>2}\left(1-\frac{1}{(p-1)^2}\right)\prod_{\substack{p\mid N\\p>2}}\frac{p-1}{p-2}. \tag*{(1)}

Theorem 1.1. Fix D>0D > 0 and 0<ε<10 < \varepsilon< 1. There exists C=C(D,ε)C = C(D,\varepsilon) such that, for every sufficiently large XX, at least Xexp⁡(−(log⁡X)ε)X\exp(-(\log X)^\varepsilon) even integers N∈[X,2X]N \in[X,2X] have both of the following properties.

  1. NN has at least (log⁡N)D(\log N)^D distinct representations N=p+qN = p + q by primes p<qp < q with p≤(log⁡N)Cp \le(\log N)^C.

  1. If GRH⁡(N)\operatorname{GRH}(N) holds, then N∥TN∥>(log⁡N)D\sqrt{N}\|T_N\| > (\log N)^D.

Since G(N)≪N/φ(N)≪log⁡log⁡N\mathcal{G}(N) \ll N/\varphi(N) \ll\log\log N, taking D=2D = 2 contradicts (1) under global Dirichlet GRH. The first conclusion holds unconditionally on the same set of moduli.

Maier’s matrix method detects fluctuations of primes in short intervals [6]. Granville and Soundararajan developed the connection between intervals and progressions for general arithmetic sequences [3], and Pandey and Woo obtained related results for systems of prime linear forms [7]. Here the shifts N−mN-m and N+mN+m occur in the same matrix entry. Their continuous contributions agree, while their progression averages sample Buchstab’s function at two consecutive arguments.

Two opposite shifts

Write Λ\Lambda for the von Mangoldt function. For a smooth real weight bb supported in (0,N/10)(0,N/10), set

BN(b)=∑1≤m<N(m,N)=1Λ(m)b(m){Λ(N−m)−Λ(N+m)}.B_N(b)=\sum_{\substack{1\le m<N\\(m,N)=1}}\Lambda(m)b(m)\{\Lambda(N-m)-\Lambda(N+m)\}.

Lemma 2.1. Assume GRH(NN). Suppose 1≤H≤M<N/201 \le H \le M < N/20 and bb is supported in [M,2M][M,2M] and in an interval of length HH. If ∥b∥∞+H∥b′∥∞≤1\lVert b\rVert_{\infty} + H\lVert b'\rVert_{\infty} \le1, then

∣BN(b)∣≪MN/H∥TN∥.\lvert B_N(b)\rvert\ll M\sqrt{N/H}\lVert T_N\rVert.

Proof. Put α=1/log⁡N\alpha= 1/\log N, β=1/8\beta= 1/8. For f∈Cc∞(0,∞)f \in C^\infty_c(0,\infty) write Φf(u)=uf(u)\Phi_f(u)=\sqrt{u}f(u) and Φ^f(s)=∫0∞Φf(u)us−1 du\widehat{\Phi}_f(s)=\int_0^\infty\Phi_f(u)u^{s-1}\,du. On the Hardy strip α<ℜs<β\alpha< \Re s < \beta, let vfv_f represent the functional

h⟼12πi∫(σ)Ns(1+s)Φ^f(s)h(s) ds,α<σ≤1/9.h\longmapsto\frac{1}{2\pi i}\int_{(\sigma)}N^s(1+s)\widehat{\Phi}_f(s)h(s)\,ds,\qquad\alpha<\sigma\le1/9.

With arc length on the two boundary lines, the norm formula of [5 Prop. 7.4] is

∥vf∥2=12π∫0∞(Nu)2α∣f(u)/2−uf′(u)∣21+(Nu)−2(β−α) du.(2)\lVert v_f\rVert^2=\frac{1}{2\pi}\int_0^\infty\frac{(Nu)^{2\alpha}\lvert f(u)/2-uf'(u)\rvert^2}{1+(Nu)^{-2(\beta-\alpha)}}\,du. \tag*{(2)}

Indeed, writing h(s)=∫ResxA(x) dxh(s)=\int_{\mathbb{R}}e^{sx}A(x)\,dx, the functional pairs A(x)A(x) with (Φf−uΦf′)(e−x/N)(\Phi_f-u\Phi_f')(e^{-x}/N). Parseval on the two boundary lines gives (2) for these supports.

Take f(u)=b(Nu)f(u)=b(Nu) and fix g∈Cc∞(4/5,6/5)g\in C^\infty_c(4/5,6/5) equal to one on [9/10,11/10][9/10,11/10]. We claim that

⟨TNvg,vf⟩=−BN(b)/N.(3)\langle T_Nv_g,v_f\rangle=-B_N(b)/N. \tag*{(3)}

To evaluate the entry, apply the two functionals to the reproducing kernel of [5 Prop. 5.4]. The factors 1+s1+s cancel its denominators. In the character term, move each contour to real part one and expand the logarithmic derivatives. The odd characters are nonprincipal, and GRH(NN) makes the shift pole-free. Mellin inversion gives N−1f(m/N)g(n/N)N^{-1}f(m/N)g(n/N). Orthogonality on units gives the equal residue class with a plus sign and the opposite class with a minus sign. The supports select n=N+mn=N+m and n=N−mn=N-m, respectively, and exclude the diagonal.

For the continuous term extend f,gf,g by zero and put

J(y)=∫0∞[f(u)g(u+y)+g(u)f(u+y)−f(u)g(y−u)] du.J(y)=\int_0^\infty[f(u)g(u+y)+g(u)f(u+y)-f(u)g(y-u)]\,du.

The three beta integrals in the Li–Liu kernel give this expression under Mellin inversion [5 Lemma 7.2]. For example, the first integral of the powers is ∫0∞u−1/2−s(u+y)−1/2−t du=y−s−tB(1/2−s,s+t)\int_0^\infty u^{-1/2-s}(u+y)^{-1/2-t}\,du=y^{-s-t}B(1/2-s,s+t). Interchanging s,ts,t gives the second, and integration over $0<u<y$ gives the third. Also ∫0∞J(y) dy=0\int_0^\infty J(y)\,dy=0, since the first two terms partition the double integral of f(u)g(v)f(u)g(v), which the third subtracts. The Mellin transform of JJ therefore cancels the pole at w=1w=1 of ∑k≥1S(kN)k−w\sum_{k\ge1}S(kN)k^{-w}. Moving the w=s+tw=s+t contour to $\Re w=3/2 and expanding gives ∑k≥1S(kN)J(k)\sum_{k\ge1}S(kN)J(k). The tests are smooth with compact support, so the Mellin integrals converge absolutely on the shifted lines. Only k=1k=1 can contribute, and g(1+u)=g(1−u)=1g(1+u)=g(1-u)=1 on the support of ff. Thus J(1)=0J(1)=0, proving (3).

Finally (2) gives ∥vg∥≪1\lVert v_g\rVert\ll1. The support of ff has length at most H/NH/N, and there Nu≤2MNu\le2M and ∣uf′(u)∣≤2M/H\lvert uf'(u)\rvert\le2M/H. Hence ∥vf∥≪M/NH\lVert v_f\rVert\ll M/\sqrt{NH}. Apply Cauchy–Schwarz to (3). ▫

The progression average

Put L=log⁡XL=\log X, d=ε/3d=\varepsilon/3, z=Ldz=L^d, and P=∏p≤zpP=\prod_{p\le z}p. We use an even divisor QQ of PP with two properties. First, for an absolute c>0c>0,

∑n≤yn≡r mod QΛ(n)=yφ(Q)+O(Xe−cL)(X/2≤y≤3X, (r,Q)=1).(4)\sum_{\substack{n\le y\\ n\equiv r\ \mathrm{mod}\ Q}}\Lambda(n)=\frac{y}{\varphi(Q)}+O(Xe^{-c\sqrt{L}})\qquad(X/2\le y\le3X,\ (r,Q)=1). \tag*{(4)}

@page 2/4 starts_mid=0 ends_mid=1 Put L=log⁡XL=\log X, d=ε/3d=\varepsilon/3, z=Ldz=L^d, and P=∏p≤zpP=\prod_{p\le z}p. We use an even divisor QQ of PP with two properties. First, for an absolute c>0c>0,

∑n≤yn≡r mod QΛ(n)=yφ(Q)+O(Xe−cL)(X/2≤y≤3X, (r,Q)=1).(5)\sum_{\substack{n\le y\\ n\equiv r\ \mathrm{mod}\ Q}}\Lambda(n)=\frac{y}{\varphi(Q)}+O(Xe^{-c\sqrt{L}})\qquad(X/2\le y\le3X,\ (r,Q)=1). \tag*{(5)}

Second, for fixed v>4v>4, c0>0c_0>0, and W∈Cc∞(0,∞)W\in C^\infty_c(0,\infty),

∑n≥1(n,Q)=1W(nc0zv)=c0zvlog⁡z(ω(v)∫0∞W(t) dt+o(1)),Qφ(Q)≍log⁡z.(6)\sum_{\substack{n\geq1\\(n,Q)=1}}W\left(\frac{n}{c_0z^v}\right)=\frac{c_0z^v}{\log z}\left(\omega(v)\int_0^\infty W(t)\,\mathrm{d}t+o(1)\right),\qquad\frac{Q}{\varphi(Q)}\asymp\log z. \tag*{(6)}

where ω\omega is Buchstab’s function.

To choose QQ, use the exceptional prime of Ford, Green, Konyagin, Maynard and Tao [2 Cor. 6 and (7.2)]. It is a number ℓ\ell equal to one or a prime ≫log⁡log⁡X\gg\log\log X. Take Q=P/(P,ℓ)Q=P/(P,\ell). Since log⁡Q≪z=o(L)\log Q\ll z=o(\sqrt{L}), their estimate (7.2) applies to each conductor r>1r>1 dividing QQ. Summing its primitive character bounds over r∣Qr\mid Q costs at most Q/φ(Q)≪log⁡zQ/\varphi(Q)\ll\log z, by ∑r∣Qφ(r)=Q\sum_{r\mid Q}\varphi(r)=Q. Orthogonality and the ordinary prime number theorem give (4), absorbing this factor in the exponential error. Passing from a primitive character to its induced character removes only prime powers above primes dividing QQ, of total weight O(log⁡Qlog⁡X)O(\log Q\log X).

Mertens’ theorem gives the product estimate in (6). For Q=PQ=P, the weighted estimate is partial summation from Buchstab’s asymptotic [1 (1.3)]. If a prime ℓ\ell is removed, write Φ(Y,z)=#{1≤n≤Y:(n,P)=1}\Phi(Y,z)=\#\{1\leq n\leq Y:(n,P)=1\}. For Y≍zvY\asymp z^v, the extra integers up to YY number at most

∑j≥1Φ(Y/ℓj,z)≪Yℓlog⁡z+Y=o(Y/log⁡z).\sum_{j\geq1}\Phi(Y/\ell^j,z)\ll\frac{Y}{\ell\log z}+\sqrt{Y}=o(Y/\log z).

For ℓj≤Y\ell^j\leq\sqrt{Y} use Buchstab’s bound Φ(t,z)≪t/log⁡z\Phi(t,z)\ll t/\log z for t≥z2t\geq z^2, and sum the remaining geometric tail trivially. This proves (6).

Proof of Theorem 1.1. Choose a fixed u>4u>4 so large that

ω(u)>ω(u+1),d(u/2−1)>D+2.(7)\omega(u)>\omega(u+1),\qquad d(u/2-1)>D+2. \tag*{(7)}

Such uu occur arbitrarily far out. If ω(t)≤ω(t+1)\omega(t)\leq\omega(t+1) eventually, the equation tω′(t)=ω(t−1)−ω(t)t\omega'(t)=\omega(t-1)-\omega(t) makes ω\omega nonincreasing on a tail. It must then be constant there. The same equation propagates a constant tail backwards to (1,2)(1,2), where ω(t)=1/t\omega(t)=1/t.

Set H=zuH=z^u and M=zHM=zH. Fix nonnegative w,v∈Cc∞(1,2)w,v\in C^\infty_c(1,2) of integral one. For each integer aa put

ba(m)=w(m/M)v((m−a)/H),Sa=∑m oddΛ(m)ba(m){1(a−m,Q)=1−1(a+m,Q)=1}.b_a(m)=w(m/M)v((m-a)/H),\qquad S_a=\sum_{m\ \mathrm{odd}}\Lambda(m)b_a(m)\{\mathbf{1}_{(a-m,Q)=1}-\mathbf{1}_{(a+m,Q)=1}\}.

Summing the first term over aa separates the mm-sum from the sum over h=m−ah=m-a. The prime number theorem and (6) at HH give (MH/log⁡z)(ω(u)+o(1))(MH/\log z)(\omega(u)+o(1)). For the second term put t=a+mt=a+m. Uniformly on its support 2M−2H≤t≤4M2M-2H\leq t\leq4M,

∑m oddΛ(m)w(m/M)v((2m−t)/H)=H2w(t/(2M))+o(H).\sum_{m\ \mathrm{odd}}\Lambda(m)w(m/M)v((2m-t)/H)=\frac{H}{2}w(t/(2M))+o(H).

Indeed H=Mu/(u+1)>M4/5H=M^{u/(u+1)}>M^{4/5}. Huxley’s prime number theorem in short intervals [4] gives ψ(y+s)−ψ(y)=s+o(H)\psi(y+s)-\psi(y)=s+o(H) uniformly for y≍My\asymp M, 0≤s≤2H0\leq s\leq2H: use his asymptotic for s≥M2/3s\geq M^{2/3} and the trivial bound below M2/3M^{2/3}. Partial summation against the smooth weight gives the formula, since H/M→0H/M\to0 and the powers of two cost O(log⁡M)O(\log M). There are O(M/log⁡z)O(M/\log z) admissible tt by (6). Summing over (t,Q)=1(t,Q)=1 and applying (6) at 2M2M gives the second term (MH/log⁡z)(ω(u+1)+o(1))(MH/\log z)(\omega(u+1)+o(1)). Thus

∑aSa=MHlog⁡z{ω(u)−ω(u+1)+o(1)}.\sum_a S_a=\frac{MH}{\log z}\{\omega(u)-\omega(u+1)+o(1)\}.

Only O(M)O(M) values of aa occur, and odd aa contribute zero because 2∣Q2 \mid Q. Fix an even aa with Sa≫H/log⁡zS_a \gg H/\log z.

Let A={N∈[X,2X]:N≡a(modQ)}\mathcal{A}=\{N\in[X,2X]:N\equiv a\pmod Q\}, so K=∣A∣=X/Q+O(1)K=|\mathcal{A}|=X/Q+O(1). For odd m=pjm=p^j in the support of bab_a, (4) gives

∑N∈A(m,N)=1Λ(N±m)=Xφ(Q)1(a±m,Q)=1+O(Xe−cL).\sum_{\substack{N\in\mathcal{A}\\(m,N)=1}}\Lambda(N\pm m)=\frac{X}{\varphi(Q)}1_{(a\pm m,Q)=1}+O\left(Xe^{-c\sqrt{L}}\right).

In a nonunit class every nonzero term is a power of a single prime dividing (a±m,Q)(a\pm m,Q). Terms removed by p∣Np\mid N are powers of pp. Each costs O(log⁡X)O(\log X) in total. Since ∑mΛ(m)ba(m)≪H\sum_m\Lambda(m)b_a(m)\ll H by the short-interval estimate, we obtain

1K∑N∈ABN(ba)=XKφ(Q)Sa+o(H)≫H.\frac{1}{K}\sum_{N\in\mathcal{A}}B_N(b_a)=\frac{X}{K\varphi(Q)}S_a+o(H)\gg H.

Here Qe−cL=o(1)Qe^{-c\sqrt{L}}=o(1). Pointwise ∣BN(ba)∣≪Hlog⁡X|B_N(b_a)|\ll H\log X, so BN(ba)≫HB_N(b_a)\gg H for ≫X/(Qlog⁡X)\gg X/(Q\log X) members of A\mathcal{A}, with a fixed positive lower-bound constant.

Discard any such NN within 2M2M of a proper prime power in [X/2,3X][X/2,3X]. This removes O(MXlog⁡X)O(M\sqrt{X}\log X) integers. Since log⁡Q≪Ld\log Q\ll L^d and d<εd<\varepsilon, at least Xexp⁡(−Lε)X\exp(-L^\varepsilon) moduli remain. For each of them the sum with Λ(N−m)\Lambda(N-m) alone has weight ≫H\gg H and every positive term has N−mN-m prime. Proper prime powers m≤2Mm\le2M contribute O(Mlog⁡2(2M)log⁡X)=o(H)O(\sqrt{M}\log^2(2M)\log X)=o(H) by (7). Each remaining pair contributes O(log⁡(2M)log⁡X)O(\log(2M)\log X), so there are at least (log⁡N)D(\log N)^D distinct prime pairs with smaller prime at most 2M≤(log⁡N)d(u+1)+12M\le(\log N)^{d(u+1)+1}.

Finally ∥ba∥∞+H∥ba′∥∞≪1\|b_a\|_\infty+H\|b'_a\|_\infty\ll1 uniformly in a,Xa,X. At each of these moduli satisfying GRH(N)(N), Lemma 2.1 and (7) give

N ∥TN∥≫H3/2M=(log⁡X)d(u/2−1)>(log⁡N)D.\sqrt{N}\,\|T_N\|\gg\frac{H^{3/2}}{M}=(\log X)^{d(u/2-1)}>(\log N)^D.

Acknowledgment. The author used OpenAI’s GPT-6.2 Astra to formulate the results, develop and review the proofs, and draft the manuscript.

References

  1. [1]K. Fan, Numerically explicit estimates for the distribution of rough numbers, J. Number Theory 260 (2024), 120–150.arxiv.org/abs/2306.03347
  2. [2]K. Ford, B. Green, S. Konyagin, J. Maynard and T. Tao, Long gaps between primes, J. Amer. Math. Soc. 31 (2018), 65–105.arxiv.org/abs/1412.5029
  3. [3]A. Granville and K. Soundararajan, An uncertainty principle for arithmetic sequences, Ann. of Math. (2) 165 (2007), 593–635.DOI
  4. [4]M. N. Huxley, On the difference between consecutive primes, Invent. Math. 15 (1972), 164–170.DOI
  5. [5]J. Li and J. Liu, A conditional proof of the Goldbach conjecture, preprint, 2026.
  6. [6]H. Maier, Primes in short intervals, Michigan Math. J. 32 (1985), 221–225.DOI
  7. [7]M. Pandey and K. Woo, Small-scale distribution of linear patterns of primes, J. Lond. Math. Soc. (2) 110 (2024), e13001.arxiv.org/abs/2304.14267

Paper details

vlnc:W_7yjuwkks
Version
v1 · latest
Published
Fresh — published within the last 30 days
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

OpenAI’s GPT-6.2 Astra

View statement
Looking for related papers…
Contents