Skip to main content
Wiley Open Access Collection logoLink to Wiley Open Access Collection
. 2022 Apr 16;68(2):486–510. doi: 10.1112/mtk.12130

Extreme values of derivatives of the Riemann zeta function

Daodao Yang 1,
PMCID: PMC10234456  PMID: 37273419

Abstract

It is proved that if T is sufficiently large, then uniformly for all positive integers (logT)/(log2T), we have

maxTt2Tζ()1+iteγ··(+1)(+1)·log2Tlog3T+O(1)+1,

where γ is the Euler constant. We also establish lower bounds for maximum of |ζ()(σ+it)| when N and σ[1/2,1) are fixed.

1. INTRODUCTION

This paper establishes the following new results for extreme values of derivatives of the Riemann zeta function (in this paper, we use the short‐hand notations, log2T:=loglogT, and log3T:=logloglogT).

Theorem 1

If T is sufficiently large, then uniformly for all positive integers (logT)/(log2T), we have

maxTt2Tζ()1+iteγ··(+1)(+1)·log2Tlog3T+O(1)+1.

Remark 1

In our Theorem 1, ℓ does not have to be fixed. In particular, if =[(logT)/(log2T)], then for sufficiently large T, we have

maxTt2Tζ()(1+it)exp{logTlog2T(log3T)4logT(log2T)2(log3T)}.

This value is even larger than the conditional upper bound of extreme value of the Riemann zeta function on the 12‐line in the same interval [T,2T]. Recall that Littlewood [20] proved that the Riemann hypothesis (RH) implies the existence of a constant C such that for large T we have maxTt2T|ζ(12+it)| exp{C(logT) ·(log2T)1}. Chandee and Soundararajan [10] proved that on RH, one can take any constant C>(log2)/2.

Theorem 2

Let N and β[0,1) be fixed.

  • (A)
    Let c be a positive number less than 2(1β). If T is sufficiently large, then
    maxTβtTζ()12+itexp{clogTlog3Tlog2T}.
  • (B)
    Let σ(12,1) be given and κ be a positive number less than 1β. Then for sufficiently large T, we have
    maxTβtTζ()σ+itexp{c·κ1σ(1σ)·(logT)1σ(log2T)σ},
    where c is an absolute positive constant.

Remark 2

By Soundararajan's original resonance method [22], we can also establish lower bounds for the maximum of derivatives of the zeta function on the 12‐line on the shorter interval [T/2,T]. In this case we obtain maxT/2tT|ζ()(12+it)|exp{(1+o(1))logT/log2T}, losing a log3T factor compared to the above result on the longer interval [Tβ,T].

The research for extreme values of the Riemann zeta function has a long history. In 1910, Bohr and Landau first established the result ζ(1+it)=Ω(log2t) (see [23, Theorem 8.5]). In 1924, Littlewood (see [23, Theorem 8.9(A)]) was able to find an explicit constant in the Ω‐result of Bohr and Landau, by proving that lim¯t|ζ(1+it)|/(log2t)eγ. Littlewood's result was improved by Levinson [18] in 1972, and by Granville–Soundararajan [14] in 2005. The currently best‐known lower bound is established by Aistleitner–Mahatab–Munsch [3] in 2017, who proved that maxTtT|ζ(1+it)|eγ(log2T+log3TC), for some constant C.

On the other hand, when assuming the RH, Littlewood proved that |ζ(1+it)|(2eγ+o(1))log2t, for sufficiently large t (see [23, Theorem 14.9]). Furthermore, Littlewood conjectured that max1tT|ζ(1+it)|eγlog2T. In [14], Granville–Soundararajan made the stronger conjecture:  maxTt2T|ζ(1+it)|=eγ(log2T+log3T+C1)+o(1), for some constant C 1 which can be effectively computed.

Compared to the research on extreme values of the Riemann zeta function, much less is known about the extreme values of its derivatives. In [17], Kalmynin obtained Ω‐results for the Riemann zeta function and its derivatives in some regions inside the critical strip near the line (s) = 1. He also mentioned that his methods do not provide any non‐trivial results about the domains of the form σσ(t) with σ(t)=1o(logloglogt/loglogt). Note that Kalmynin did not obtain Ω‐results for |ζ()(σ+it)| when N and σ[1/2,1) are given.

It is still uncertain whether the methods of [3, 14, 18, 23] are able to establish the result in our Theorem 1, since those methods basically rely on the fact that the k‐divisors function dk(n) is multiplicative and/or the fact that the Riemann zeta function has an Euler product: ζ(s)=p(1ps)1, (s)>1. Note that the function f(n):=(logn) is not multiplicative and the derivative ζ()(s) does not have an Euler product.

We also emphasize that the key points in Theorem 1 are the range (logT)/(log2T) and the constant in front of (log2T)+1. In fact, one can use the method of Bohr–Landau to prove a much weaker result, that is, ζ()(1+it)=Ω((log2t)+1) when N is fixed. See Section 7 for such a short proof.

We will use Soundararajan's original resonance method [22] to prove Theorem 1. The new ingredient for the proof is the following Proposition 1.

Proposition 1

If T is sufficiently large, then uniformly for all positive numbers ℓ, we have

suprmk=nTr(m)r(n)¯k(logk)/nT|r(n)|2eγ·+1+1·log2Tlog3T+O(1)+1,

where the supremum is taken over all functions r:NC satisfying that the denominator is not equal to zero, when the parameter T is given.

The following Proposition 2 will not be used to prove our theorems. However, it is closely related to Proposition 1 and can be viewed as a “log‐type” greatest common divisor (GCD) sum, so we list it here for independent interest.

Proposition 2

Let (0,) and let c be a positive number less than 6e2γπ22(2+1)(2+1).  For sufficiently large N, we have

sup|M|=Nm,nM(m,n)[m,n]logm(m,n)logn(m,n)c·N·(log2N)2+2,

where the supremum is taken over all subsets MN with size N.

Remark 3

Actually we can also use Proposition 2 and Hilberdink's version of the resonance method [15] to prove a similar result to the one in Theorem 1. But the constant in front of (log2T)+1 will be much worse.

Soundararajan introduced his resonance method in [22] and proved that

maxTt2Tζ12+itexp(1+o(1))logTloglogT,

which improved earlier results of Montgomery and Balasubramanian–Ramachandra. Montgomery [21] proved it under RH and with the constant 1/20 instead of 1+o(1) in Soundararajan's result. Balasubramanian–Ramachandra [4] proved the result unconditionally but also with a smaller constant compared to Soundararajan's result.

By constructing large GCD sums, Aistleitner [1] used a modified version of Soundararajan's resonance method to establish lower bounds for maximum of |ζ(σ+it)| when σ(1/2,1) is fixed. His results improved early results of Voronin [24] and Hilberdink [15] via resonance methods. He proved that

max0tTζσ+itexpcσ(logT)1σ(loglogT)σ,

for large T, and one can take cσ=0.18(2σ1)1σ. The same result had been proved by Montgomery in [21] with a smaller value for cσ. In [9], Bondarenko and Seip improved the value cσ in Aistleitner's result.

By constructing large GCD sums, using a convolution formula for ζ in the resonance method, Bondarenko and Seip [7, 8] proved the following surprising result:

max1tTζ12+itexp(1+o(1))logTlog3Tlog2T.

After optimizing the GCD sums, de la Bretèche and Tenenbaum [11] improved the factor from (1+o(1)) to (2+o(1)) in the above result.

Following the work of Bondarenko–Seip and de la Bretèche–Tenenbaum, we use their modified versions of resonance methods to prove Theorem 2. The new ingredient is our convolution formula for 1+2s+(1)ζ()(s). Throughout the paper, define the function F(s) as follows:

F(s):=1+12s+(1)ζ()(s). (1)

Throughout the paper, also define the sequence {a(n)}n=1 as a(1)=1,a(2)=1+(log2), and a(n)=(logn) for n3. Then we have the following identity and the Dirichlet series converge absolutely:

F(s)=n=1a(n)ns,(s)>1. (2)

The reason why we add the part 1+2s is that we want to make a(n)1 for all n1. Since when σ[1/2,1), the factor (logn) has very small influence on the log‐type GCD sums compared to the case σ=1, we will simply use the fact that a(n)1 and then come to the situation of optimizing GCD sums.

Let σ(0,1] be given and let MN be a finite set. The GCDs sums Sσ(M) of M are defined as follows:

Sσ(M):=m,nM(m,n)σ[m,n]σ,

where (m,n) denotes the GCD of m and n and [m,n] denotes the least common multiple of m and n.

The case σ=1 was studied by Gál [13], who proved that

(log2N)2sup|M|=NS1(M)|M|(log2N)2. (3)

The asymptotically sharp constant in (3) is 6e2γπ2. This fact was proved by Lewko and Radziwiłł   in [19].

Bondarenko and Seip [6, 7] proved the following result for GCD sums when σ=12:

exp{1+o(1)logNlog3Nlog2N}sup|M|=NS12(M)|M|exp{7+o(1)logNlog3Nlog2N}.

Later, based on constructions of [6, 7], de la Bretèche and Tenenbaum [11] optimized the result of Bondarenko–Seip and obtained the following:

sup|M|=NS12(M)|M|=exp{22+o(1)logNlog3Nlog2N}. (4)

Aistleitner, Berkes, and Seip [2] proved the following essentially optimal result for GCD sums when σ(12,1), where cσ and Cσ are positive constants only depending on σ:

exp{cσ·(logN)1σ(log2N)σ}sup|M|=NSσ(M)|M|exp{Cσ·(logN)1σ(log2N)σ}. (5)

Moreover, in [2, p. 1526], they also gave an example (following ideas of [13]) for the lower bound when σ(12,1). Let N=2r and let M be the set of all square‐free integers composed of the first r primes. Then

Sσ(M)|M|exp{c1σ·(logN)1σ(log2N)σ} (6)

for some positive constant c. For simplicity, in our proof we will use this construction. For more constructions, see Bondarenko–Seip [9, pp. 131–136] and Z. Dong‐B.Wei [12, Theorem 1.2].

2. LEMMAS FOR THE RIEMANN ZETA FUNCTION

Lemma 1

Let σ0(0,1) be fixed. If T is sufficiently large, then uniformly for ε>0, t[T,2T], σ[σ0+ε,) and all positive integers ℓ, we have

(1)ζ()(σ+it)=nT(logn)nσ+it+O!ε·Tσ+ε, (7)

where the implied constant in big O(·) only depends on σ0.

It follows from Hardy–Littlewood's classical approximation formula (see [23, Theorem 4.11]) for ζ(s) and Cauchy's integral formula for derivatives.

Lemma 2

Let N and ε(0,1) be fixed. Then uniformly for all |t|1 and σ[ε,1+ε],

ζ()(σ+it)|t|1σ+3ε2, (8)

where the implied constant depends on ℓ and ε only.

It follows from classical convex estimates for ζ(s) and Cauchy's integral formula.

In the following, we will derive a “double version” convolution formula, similar to Lemma of 5.3 of de la Bretèche and Tenenbaum [11]. The proof is same as the proof of “single version” convolution formulas in Lemma 1 of Bondarenko and Seip [8].

Define the Fourier transform K^ of K as

K^(ξ):=K(x)eixξdx.

Lemma 3

Let N and σ[0,1) be fixed. Write z=x+iy. Assume that K(z) is a holomorphic function in the strip y=z[σ2,0], satisfying the growth condition

maxσ2y0|K(z)|=O(1x2+1). (9)

If tR{0}, then

F(σ+it+iy)F(σit+iy)K(y)dy=m,n1K^(lognm)nσ+it·mσita(n)a(m)2π(Δ++Δ)!, (10)

where

Δ+=m+n=m,n01m!n!(ddz)mF(z+it)|z=1+it·(ddz)nK(iσiz)|z=1+it (11)

and

Δ=m+n=m,n01m!n!(ddz)mF(zit)|z=1it·(ddz)nK(iσiz)|z=1it. (12)

Define h(z):=F(z+it)F(zit)K(iσiz). h(z) is a meromorphic function in the vertical strip σ(z)2, with two poles, namely, at z=1+it and z=1it. Let Y be large and consider straight line integrals for h(z). Set J1=σiY2iYh(z)dz,J2=2iY2+iYh(z)dz,J3=2+iYσ+iYh(z)dz,J4=σ+iYσiYh(z)dz.

Note that F(s)=!/(s1)+1+E(s), where E(s) is an entire function. The residue theorem gives that

J1+J2+J3+J4=2πi(Δ++Δ)!. (13)

By (2) and (9) and applying Cauchy's theorem term by term,

limYJ2=in=1m=1a(n)a(m)K^(lognm)nσ+it·mσit.

Clearly,

limY(J4)=iF(σ+it+iy)F(σit+iy)K(y)dy.

By the trivial estimate F(s)1+|ζ()(s)|, estimates for ζ()(s) (Lemma 2) and (9), we obtain

J1ε1Y21+σ1+ε(1+Y1x+3ε)dxε1Y21+Y1+3εσY2εlogY.

Take ε=1/6, then J11/(YlogY)0, as Y. Similarly for J 3.

The following results are due to Hadamard, Landau, and Schnee (also see [16]).

Lemma 4

(Hadamard, Landau, and Schnee) Let μ,νN and α1,α2(12,) be fixed. Suppose α1+α2>1, then

1Tζ(μ)(α1+it)ζ(ν)(α2it)dtζ(μ+ν)(α1+α2)T,asT.

Remark 4

In this paper, if it is not stated, the limit notations “∼” and “o()” are under the condition when the corresponding variable tends to infinity. Namely, as T, t, or N.

In particular, when N and σ(12,1) are fixed, one has

0T|ζ()(σ+it)|2dtζ(2)(2σ)T,asT. (14)

For σ=12, Ingham [16, p. 294, Theorem A″] has proved the following result on second moments of ζ()(s).

Lemma 5

(Ingham) Let N be fixed. Then

0Tζ()12+it2dtT2+1logT2π2+1,asT.

3. PROOF OF PROPOSITION 1

We will use the construction of Bondarenko and Seip in [9].

Let δ=·(+1)1. Given a positive number y and a positive integer b, define

P(y,b):=pypb1.

We will choose a number x and an integer b later to make P(x,b)T. Let M be the set of divisors of P(x,b) and Mδ be the set of divisors of P(xδ,b). Let Mδ¯ be the complement of Mδ in M. Note that both M and Mδ are divisor‐closed which means k|n,nMkM and k|n,nMδkMδ. Define the function r:N{0,1} to be the characteristic function of M, then

|mk=nTr(m)r(n)¯k(logk)|/nT|r(n)|2=1|M|mk=nM(logk)k=1|M|nMk|n(logk)k.

As showed in [9],

1|M|nMk|n1k=px1+ν=1b11νbpν.

Also in [9, p. 129, lines 3–9], it is proved that

px1+ν=1b11νbpν=1+O(b1)+O1xlogxeγlogx. (15)

Next, we split the sum into the following two parts:

1|M|nMk|n1k=1|M|nMk|nkMδ1k+1|M|nMk|nkMδ¯1k.

We will prove the following identity:

1|M|nMk|nkMδ1k=pxδ1+ν=1b11νbpν. (16)

To see this, let m be the largest integer such that pmxδ and let w be the largest integer such that pwx  (pn denotes the nth prime). Then we have

nMk|nkMδ1k=kMδ1kk|nnM1=α1=0b1α2=0b1αm=0b11p1α1p2α2pmαm(bα1)(bα2)(bαm)·bwm=bwm·n=1mαn=0b1bαnpnαn=bwn=1mν=0b11νbpnν.

Note that |M|=bw, then we immediately get (16). Now (15) together with (16) give that

1|M|nMk|nkMδ1k=pxδ1+ν=1b11νbpν=1+O(b1)+O1xδlogxeγ·δ·logx, (17)

where we omit the term δ1 inside the second big O(·) term since 1<δ12. Thus we obtain

1|M|nMk|nkMδ¯1k=1|M|nMk|n1k1|M|nMk|nkMδ1k=1+O(b1)+O1xδlogxeγ(1δ)logx.

By the definition of Mδ¯, if kMδ¯, then logkδlogx . So we have

1|M|nMk|n(logk)k1|M|nMk|nkMδ¯(logk)k1+O(b1)+O1xδlogxeγ(1δ)δ(logx)+1.

Now we set x=(logT)/(3log2T) and b=[log2T]. By the prime number theorem, P(x,b)T when T is sufficiently large. Take the choices of x,b and δ=·(+1)1 into the above inequality, then we are done.

4. PROOF OF THEOREM 1

Set N=[T12] and let R(t):=nNr(n)nit. Define the moments as follows:

M1(R,T):=T2T|R(t)|2ΦtTdt,M2(R,T):=T2T(1)ζ()(1+it)|R(t)|2ΦtTdt.

As in [22], Φ:RR denotes a smooth function, compactly supported in [1, 2], with 0Φ(y)1 for all y, and Φ(y)=1 for 5/4y7/4. Partial integration gives that Φ^(y)ν|y|ν for any positive integer ν.

Also in [22], Soundararajan proved that

M1(R,T)=TΦ^(0)(1+O(T1))nN|r(n)|2. (18)

Since Φ is compactly supported in [1, 2], we deduce that

T2T|R(t)|2kT(logk)k1+itΦtTdt=Tm,nNkTr(m)r(n)¯k(logk)·Φ^T·logkmn.

Since NT12, for the off‐diagonal terms kmn we have Φ^(Tlog(km/n))T2, by the rapid decay of Φ^  (see [22, p. 471]). Thus the contribution of the off‐diagonal terms kmn to the above summands can be bounded by

TnN|r(n)|2·kT(logk)k·T2T1(logT)+1NnN|r(n)|2.

Again, by N=[T12], we obtain

T2T|R(t)|2kT(logk)k1+itΦtTdt=Φ^(0)Tmk=nTr(m)r(n)¯k(logk)+OT12(logT)+1nT|r(n)|2. (19)

By Lemma 1, we have the following approximation formula and the implied constant in the big O(·) term is absolute:

(1)ζ()(1+it)=kT(logk)k1+it+O!ε·T1+ε,Tt2T.

In the integral of M2(R,T), the big O(·) term above contributes at most

T2T!ε·T1+ε·|R(t)|2Φ(tT)dt!ε·T1+ε·M1(R,T).

Combining this with (19), we have

M2(R,T)=Φ^(0)Tmk=nTr(m)r(n)¯k(logk)+OT12(logT)+1nT|r(n)|2+O!ε·T1+ε·M1(R,T).

Finally, the above formula together with (18) gives that

maxTt2Tζ()1+it|M2(R,T)|M1(R,T)1+O(T1)|mk=nTr(m)r(n)¯k(logk)|/nT|r(n)|2+OT32(logT)+1+O!ε·T1+ε.

Now let ε=(log2T)1. By Stirling's formula, if T is sufficiently large, then for all positive integers (logT)(log2T)1, we have  !·ε·T1+ε(log2T). Other big O(·) terms can be easily bounded. Together with Proposition 1, we finish the proof of Theorem 1.

5. PROOF OF THEOREM 2

5.1. Constructing the resonator

Given a set M of positive integers and a parameter T, we will construct a resonator R(t), following ideas from [1], [7], and [11]. Define

Mj:=1+logTTj,1+logTTj+1M(j0).

Let J be the set of integers j such that Mj and let mj be the minimum of Mj for jJ. We then set

M:={mj:jJ}

and

r(mj):=mMj1=|Mj|

for every mj in M. Then the resonator R(t) is defined as follows:

R(t):=mMr(m)mit. (20)

By Cauchy's inequality, one has the following trivial estimates [11]:

R(0)2NmMr(m)2N|M|N2.

As in [7] , set Φ(t):=et2/2. Its Fourier transform satisfies Φ^(ξ)=2πΦ(ξ).

Replacing T by T/logT in [8, Lemma 5], gives that

|R(t)|2ΦtlogTTdtT|M|logT. (21)

5.2. The proof

Let σ[12,1). Choose κ(0,1β) and set N:=[Tκ]. Fix ε>0 such that κ+4ε<1.

As in [8], choose

K(t):=sin2((εlogT)t)(εlogT)t2,

which has Fourier transform

K^(ξ)=πmax1|ξ|2εlogT,0. (22)

Define

Zσ(t,y):=F(σ+it+iy)F(σit+iy)K(y),I(T):=|t|2|R(t)|2ΦtlogTTZσ(t,y)dydt.

Following [8] and [11], we will show that the integral on 2Tβ|t|T2 and |y||t|2 gives the main term for I(T). We will frequently use the following trivial estimates (Lemma 2):

|F(σ±it+iy)|1+|ζ()(σ±it+iy)|(1+|t|+|y|)310. (23)

A simple computation gives

2|t|2Tβ|y|>TβZσ(t,y)dydt|t|2Tβ|y|>Tβ(1+|t|+|y|)351(|t|+|y|)2dydt(Tβ)35.

Note that

F(σ+it+iy)F(σit+iy)1+|ζ()(σ+it+iy)|1+|ζ()(σit+iy)|1+|ζ()(σ+it+iy)|+|ζ()(σit+iy)|+|ζ()(σ+it+iy)|2+|ζ()(σit+iy)|2.

Thus

2|t|2TβZσ(t,y)dydtTβ+2|t|2Tβ|y|TβZσ(t,y)dydtTβ+3Tβ3Tβ|ζ()(σ+it)|dt+3Tβ3Tβ|ζ()(σ+it)|2dtTβ·(logT)2+1,

where the last step follows from Lemmas 4 and 5 and the Cauchy–Schwarz inequality. Trivially, by |R(t)|R(0) and Φ(·)1,

2|t|2Tβ|R(t)|2ΦtlogTTZσ(t,y)dydtR(0)2Tβ·(logT)2+1|M|Tβ+κ(logT)2+1.

The fast decay of Φ and (23) give that

|t|>T2|R(t)|2ΦtlogTTZσ(t,y)dydtTκ+4e116(logT)2·|M|o(1)·|M|.

Using (21) and (23), one can compute

2Tβ|t|T2|R(t)|2ΦtlogTT|y|>|t|2Zσ(t,y)dydtT125β(logT)2·|M|.

Combining the above estimates, one gets

I(T)=2Tβ|t|T2|R(t)|2ΦtlogTT|y||t|2Zσ(t,y)dydt+|M|·OTβ+κ(logT)2+1+|M|·OT125β(logT)2.

Note that 2Tβ|t|T2 and |y||t|2 give Tβ|t±y|T.  Again, by (21)

I(T)T|M|logT·maxTβtTFσ+it2+|M|·OTβ+κ(logT)2+1+|M|·OT125β(logT)2. (24)

Next, let

Gσ(t):=m,n1K^(lognm)nσ+it·mσita(n)a(m) (25)

and set

I1(T):=|t|2Gσ(t)|R(t)|2ΦtlogTTdtI2(T):=2π!|t|2Δ+·|R(t)|2ΦtlogTTdtI3(T):=2π!|t|2Δ·|R(t)|2ΦtlogTTdt.

By the convolution formula (10), one obtains

I(T)=I1(T)+I2(T)+I3(T).

We will bound I2(T),I3(T) as follows:

|I2(T)|+|I3(T)||M|·Tκ+54εlogT. (26)

By Cauchy's integral for derivatives and the explicit expression for K, we have the following estimates for all 0nl:

ddznK(iσiz)|z=1itmax|α|=18|Kiσi(1it)+α|T54εlogT·|t|2,|t|2, (27)

where the implied constants depend on ε and ℓ only.

And trivially, for all 0ml, one has

ddzmF(zit)|z=1it1+|ζ(+m)(12it)||t|18,|t|2, (28)

where the implied constants depend only on ℓ.

Note that there are finitely many non‐negative integer pairs (m,n) satisfying m+n=, so

I3(T)R(0)2|t|2T54ε·|t|18logT·|t|2dt(Tκ·|M|)·T54εlogT|t|2|t|18|t|2dt|M|·Tκ+54εlogT. (29)

Proceed similarly for I2(T), so we get (26).

Next, in order to relate I1(T) to the GCD sums, we would like to use Fourier transform on the whole real line. So set

I1(T):=Gσ(t)|R(t)|2ΦtlogTTdt.

By (22), K^(lognm)=0 if mnT2ε. Clearly, al(n)/nσ1. So one can get

|t|2Gσ(t)|R(t)|2ΦtlogTTdt=|t|2m,n1K^(lognm)nσ+it·mσita(n)a(m)|R(t)|2ΦtlogTTdtR(0)2m,n1K^(lognm)nσ·mσa(n)a(m)(Tκ·|M|)·mnT2ε1Tκ+4ε·|M|.

We obtain I1(T)=I1(T)+|M|·O(Tκ+4ε). Thus we have

I1(T)T|M|logT·maxTβtTFσ+it2+|M|·O(Tκ+4ε)+|M|·OTβ+κ(logT)2+1+|M|·OT125β(logT)2. (30)

We compute the integral I1(T) by expanding the product of the resonator and the infinite series of Gσ(t), and then integrate term by term, as in [7, p. 1699]. Using the fact a(k)1 for every k and K^(logjk)π/2 if jkTε, one gets

I1(T)=T2πlogTm,nMr(m)r(n)j,k1a(j)a(k)K^(logjk)(jk)σΦTlogTlogmjnkT2πlogTm,nMr(m)r(n)j,k1K^(logjk)(jk)σΦTlogTlogmjnkTlogT1jkTε1(jk)σm,nMr(m)r(n)ΦTlogTlogmjnk.

Next, proceed as in [11, p. 127–128] (following ideas from [7]),

I1(T)TlogTm,nM[m,n](m,n)Tε(m,n)σ[m,n]σTlogTSσ(M)Tε(13σ)·S13(M). (31)

Combining (30) with (31), we have

maxTβtTFσ+it2+OTβ+κ1(logT)2+2+OTκ+4ε1logT+OT25βlogTSσ(M)|M|Tε(13σ)·S1/3(M)|M|. (32)

Next, we will consider the two cases σ=12 and σ(12,1) separately.

Case 1: σ=12.

In this case, let M be the set in (4) with |M|=N. Recall that N=[Tκ], so

S1/2(M)|M|exp{(22κ+o(1))logTlog3Tlog2T}. (33)

Also, in [11, p. 128], de la Bretèche and Tenenbaum showed that for this set M,

S1/3(M)|M|exp{yM23},whereyM(logT)65. (34)

So the second term on the right‐hand side of (32) is o(1). And clearly, the big O(·) terms in (32) can be ignored. Thus

maxTβtTζ()12+itmaxTβtTF12+it+O(1)exp{(2κ+o(1))logTlog3Tlog2T}. (35)

Case 2: σ(12,1).

In this case, let M be the set in (6) with |M|=N. Again, N=[Tκ], so

Sσ(M)|M|exp{c1σ·(logN)1σ(log2N)σ}exp{c·κ1σ1σ·(logT)1σ(log2T)σ}. (36)

Similarly as (31), we have

I1(T)TlogTSσ(M)Tε(12σ)·S12(M).

And by (4), we can get the following estimates:

Tε(12σ)·S12(M)|M|Tε(12σ)exp{22+o(1)κlogTlog3Tlog2T}=o(1).

Hence,

maxTβtTζ()σ+itmaxTβtTFσ+it+O(1)exp{c·κ1σ2(1σ)·(logT)1σ(log2T)σ}. (37)

Make κ slightly larger in the beginning then one can get (B).

6. PROOF OF PROPOSITION 2

The idea of the proof is basically the same as in the proof of Proposition 1. The new ingredient is Gál's identity. In this section, in order to avoid confusion about notations, we use the notation (mn) for the ordered pair of m and n.

Let P(r,b)=p1b1··prb1 , where pn denotes the nth prime. Define M to be the set of divisors of P(r,b), then |M|=br. By Gál's identity [13],

m,nM(m,n)[m,n]=irb+2ν=1b1bνpiν.

Let r=[logN/loglogN], then prlogN by the prime number theorem. Let b be the integer satisfying that

brN<(b+1)r,

then brN, as N. Choose a set MN such that MM and |M|=N.

Following Lewko–Radziwiłł  in [19], we use Gál's identity for the GCD sum and then split the product into two parts:

m,nM(m,n)[m,n]=brir1+2v=1b11piv·1vb(1+o(1))Nir11pi2×ir1+2v=1b11piv·1vb11pi2. (38)

By Mertens' theorem, the first product is asymptotically equal to (eγlogpr)2(eγloglogN)2 as N. The second product converges as N to

p1+2v=11pv11p2=6π2.

Next, let δ=·(2+1)1 and define the sets Mδ(1),Mδ(2) as follows:

Mδ(1):={(mn)M×M|i>rδ,αi=min{αi,βi},   where m and n have prime factorizations as     m=p1α1p2α2prαr,andn=p1β1p2β2prβr}.

Mδ(2):={(mn)M×M|i>rδ,βi=min{αi,βi},   where m and n have prime factorizations as     m=p1α1p2α2prαr,andn=p1β1p2β2prβr}.

Then define Mδ to be the union of the above two sets and Mδ¯ to be the complement of Mδ in M×M:

Mδ:=Mδ(1)Mδ(2),Mδ¯:=(M×M)Mδ.

Now we split the GCD sum into two parts:

m,nM(m,n)[m,n]=(mn)Mδ(m,n)[m,n]+(mn)Mδ¯(m,n)[m,n]. (39)

By symmetry, we have

(mn)Mδ(m,n)[m,n]2(mn)Mδ(1)(m,n)[m,n]. (40)

By the definition of Mδ(1) and Gál's identity, we have

(mn)Mδ(1)(m,n)[m,n]=irδ0αib10βib1rδ<ir0αiβib1irδpi|αiβi|rδ<ir1piβiαi=irδb+2ν=1b1bνpiν·rδ<irxi=0b1bxipixi=irδb+2ν=1b1bνpiν·rδ<ir1pib+1b+1pi+b·11pi2=brirδ1+2ν=1b11νbpiν·rδ<ir1b·1pib+11+1bpi+1·11pi2=brirδ1+2ν=1b11νbpiν11pi2×rδ<ir1b·1pib+11+1bpi+1×ir11pi2.

Again, we have brN, the first product converges to 6/π2, and the third product is asymptotically equal to (eγlogpr)2(eγloglogN)2 as N.

For the second product, it can be bounded as

rδ<ir1b·1pib+11+1bpi+1rδ<ir11pi.

And by Mertens' theorem and the prime number theorem, we have

limrrδ<ir11pi=δ.

As a result, we obtain that

(mn)Mδ(1)(m,n)[m,n]δ+o(1)N·6π2·(eγloglogN)2.

Hence by (38), (39), and (40), we get

(mn)Mδ¯(m,n)[m,n]12δ+o(1)N·6π2·(eγloglogN)2.

By the construction of Mδ¯,    if (mn)Mδ¯, then

logm(m,n)δ+o(1)·loglogN,logn(m,n)δ+o(1)·loglogN.

Thus

m,nM(m,n)[m,n]logm(m,n)logn(m,n)m,nM(m,n)[m,n]logm(m,n)logn(m,n)(mn)Mδ¯(m,n)[m,n]logm(m,n)logn(m,n)(12δ)δ2+o(1)N·6π2·e2γ·(loglogN)2+2.

By our choice of δ=·(2+1)1, we are done.

7. A SHORT PROOF FOR A WEAKER RESULT

One can use the method of Bohr–Landau (see [23, Theorem 8.5]) to prove the weaker result that ζ()(1+it)=Ω((log2t)+1), when N is fixed.

Write s=σ+it. When σ>1,

(1)ζ()(s)=n=2(logn)nσ+it=n=2N(logn)nσ+it+n=N+1(logn)nσ+it.

For given positive integers N and q, by Dirichlet's theorem, there exists t[1,qN], such that cos(tlogn)cos(2π/q) for all integers n[1,N]. Hence

|ζ()(s)|n=2N(logn)nσcos(tlogn)n=N+1(logn)nσcos(2πq)·n=2N(logn)nσn=N+1(logn)nσcos(2πq)·n=2(logn)nσ2n=N+1(logn)nσ.

Take q=8 to get

|ζ()(s)|cos(2π8)·n=2(logn)nσ2n=N+1(logn)nσ,Nlog8>logt. (41)

One can compute that

n=2(logn)nσ>O(1)+1(logx)xσdx>O(1)+!(σ1)+1, (42)

and for large N that

n=N+1(logn)nσ<N(logx)xσdx(+1)·(logNσ1)·N1σ·!(σ1)+1. (43)

Now fix a positive constant A (only depending on ℓ) such that (+1)A·eA<1/12 and let σ1=A/logN. Combining with (41) gives that

|ζ()(s)|>!(σ1)+1·(122·112)>!3·(logN)+1A+1(loglogt)+1. (44)

Next, define

f(s):=ζ()(s)(loglogs)+1.

Suppose that ζ()(1+it)Ω((loglogt)+1). So f(1+it)=o(1). Clearly, f(2+it)=o(1). Then we get a contradiction with (44) by the Phragmén–Lindelöf principle (for instance, see[23, p. 189]).

8. DISCUSSIONS, OPEN PROBLEMS, AND CONJECTURES

Let (0,) and σR, define the following normalized log‐type GCD sums as:

Γσ()(N):=sup|M|=N1Nm,nM(m,n)σ[m,n]σlogm(m,n)logn(m,n).

Problem 1

Given σ and ℓ, optimize Γσ()(N).

Remark 5

We are particularly interested in the case σ=1. Given ℓ, what is the optimal constant C such that Γ1()(N)C(log2N)2+2 ? (See [25] for both unconditional and conditional upper bounds). When σ(0,12), is it true that N12σ(logN)2+α(σ)Γσ()(N) for some positive constant α(σ)? (These bounds are inspired by the work of Bondarenko–Hilberdink–Seip in [5], where the authors studied GCD sums for σ(0,12) ). It is not difficult to obtain the upper bounds that Γσ()(N)N12σ(logN)2+β(σ) for some positive constant β(σ), by [5, Theorem 1] and arguments in the proof of Proposition 4 of [25].

We are also interested in extreme values of |ζ()(σ+it)| in the left half strip. It is unlike the situation of the zeta function, where the values on the left half strip can be easily determined by the right half strip via the functional equation. Thus it is worth to study Γσ()(N) when σ<12, even for this reason.

Problem 2

Study extreme values of |ζ()(σ+it)|, when σ(,12) and N are given.

We can use Theorem A of Ingham [16] to prove the following claim, from which we obtain the lower bounds (45) on maximum of |ζ()(σ+it)|. But we expect something slightly better.

Claim 1

Let N and σ(,12) be fixed. Then

0T|ζ()(σ+it)|2dt(2π)2σ1ζ(22σ)22σT22σ(logT2π)2,asT.

In Theorem A of Ingham [16], let μ=ν= and a=b=σ, then

0T|ζ()(σ+it)|2dt=2πF2(T2π,2σ)+R(T,σ),

where

R(T,σ)=O(Tmax{1σ,12σ}(logT)2+2)=o(T22σ)

and

F2(T,2σ)=1T2s2ζ(s)+x1sζ(2s)|s=2σdxζ(22σ)1Tx12σ(logx)2dxζ(22σ)22σT22σ(logT)2.

Immediately, we obtain the following corollary.

Corollary 1

Let N, β[0,1) and σ(,12) be fixed. Then for large T,

maxTβtTζ()σ+it(1+o(1))(2π)σ12ζ(22σ)22σT12σ(logT). (45)

Note that the lower bound in Theorem 1 increases when ℓ increases. So it is natural to have the following conjecture.

Conjecture 1

If T is sufficiently large, then uniformly for all positive integers 1,2(logT) ·(log2T)1, such that 1<2, we have

maxTt2Tζ(1)(1+it)<maxTt2Tζ(2)(1+it).

When ℓ is fixed, we have the following conjecture, inspired by the conjecture of Granville–Soundararajan .

Conjecture 2

Let N be given. Then there exists a polynomial P+1(x,y) of total degree +1 such that

maxTt2Tζ()(1+it)=P+1(log2T,log3T)+o(1),asT.

In particular, there exists a positive constant c such that

maxTt2Tζ()(1+it)c·(log2T)+1,asT.

Remark 6

Does limc exist? In particular, do we have limc=0?

Remark 7

When assuming the RH, one can get |ζ()(1+it)|(log2t)+1 for sufficiently large tR (see [25]).

When N and σ(0,1) are given, we think that the maximum of derivatives of zeta function and maximum of zeta function only differs by multiplying some small factors. More precisely, we have the conjecture.

Conjecture 3

Let N and σ(0,1) be fixed, then there exists constants C(σ,) and c(σ,) which depend on σ and ℓ, such that for sufficiently large T, we have

(logT)c(σ,)·maxTt2Tζ(σ+it)maxTt2Tζ()(σ+it)(logT)C(σ,)·maxTt2Tζ(σ+it),

where the implied constants depend at most on σ and ℓ. Moreover, when σ(0,12], then we can take C(σ,)=+α(σ) and c(σ,)=+β(σ), where α(σ) and β(σ) are constants depending at most on σ.

When we try to give a different proof of Theorem 1 via Levinson's approach [18], we meet with the following problem. In particular, if the following problem has a positive solution, then a new proof for our Theorem 1 can be given.

Problem 3

Let N be given. Find n=n(k) and some positive constant ceγ··(+1)(+1) such that if k is sufficiently large, then we have

dk,(n)n1kc·(logk)+1+O((logk))

and

logn=klogk+O(k),

where dk,(n) is defined as

dk,(n):=m1m2mk=n(logm1)(logm2)(logmk).

Remark 8

The arithmetic function dk,(n) is not multiplicative, which makes the problem difficult.

Problem 4

Study extreme values of derivatives of L‐functions.

Problem 5

In our Theorem 1, we require (logT)(log2T)1. What is the largest possible range for ℓ, that the result of Theorem 1 can still be valid. For instance, what can we say about the extreme values if =[T], or =[2T]?

Problem 6

Can one find some range for ℓ, such that the results in Theorem 2 can still hold?

Remark 9

The main terms always satisfy since we have a(n)1 for all n and ℓ. It is not clear about the moments of derivatives of the zeta function if ℓ can depend on T. For instance, if we let =[(logT)(log2T)1], then what can we say about the second moments as T,

0T|ζ()(12+it)|2dt?

When ℓ depends on T, it also seems difficult to bound the contributions of Δ++Δ .

Moreover, we have the following general problem, which asks how large or how small the extreme values of |ζ()(σ+it)| can be if ℓ can be taken arbitrary large with respect to the length T of the interval [T,2T].

Problem 7

Given σ0[0,1], decide which one of following four properties can be true.

(A) Given any function V:(0,+)(0,+), there always exists some function fV:(0,+)N such that if =fV(T), then for sufficiently large T, we have

maxTt2Tζ()(σ0+it)V(T).

(B) Given any function V:(0,+)(0,+), there always exists some function fV:(0,+)N such that if =fV(T), then for sufficiently large T, we have

maxTt2Tζ()(σ0+it)V(T).

(C) There exists some function V:(0,+)(0,+), such that for all function f:(0,+)N, if =fV(T), then for sufficiently large T, we have

maxTt2Tζ()(σ0+it)V(T).

(D) There exists some function V:(0,+)(0,+), such that for all function f:(0,+)N, if =fV(T), then for sufficiently large T, we have

maxTt2Tζ()(σ0+it)V(T).

JOURNAL INFORMATION

Mathematika is owned by University College London and published by the London Mathematical Society. All surplus income from the publication of Mathematika is returned to mathematicians and mathematics research via the Society's research grants, conference grants, prizes, initiatives for early career researchers and the promotion of mathematics.

ACKNOWLEDGEMENTS

I am grateful to Christoph Aistleitner for his guidance and many helpful discussions. I thank Marc Munsch for a valuable suggestion. I thank Zikang Dong and Daniel El‐Baz for their comments on early version of the paper. The work was supported by the Austrian Science Fund (FWF), project W1230.

REFERENCES

  • 1. Aistleitner C., Lower bounds for the maximum of the Riemann zeta function along vertical lines, Math. Ann. 365 (2016), 473–496. [Google Scholar]
  • 2. Aistleitner C., Berkes I., and Seip K., GCD sums from Poisson integrals and systems of dilated functions, J. Eur. Math. Soc. 17 (2015), 1517–1546. [Google Scholar]
  • 3. Aistleitner C., Mahatab K., and Munsch M., Extreme values of the Riemann zeta function on the 1‐line, Int. Math. Res. Not. IMRN 22 (2019), 6924–6932. [Google Scholar]
  • 4. Balasubramanian R. and Ramachandra K., On the frequency of Titchmarsh's phenomenon for ζ(s). III, Proc. Indian Acad. Sci. Sect. A 86 (1977), 341–351. [Google Scholar]
  • 5. Bondarenko A., Hilberdink T., and Seip K., Gál‐type GCD sums beyond the critical line, J. Number Theory 166 (2016), 93–104. [Google Scholar]
  • 6. Bondarenko A. and Seip K., GCD sums and complete sets of square‐free numbers, Bull. London Math. Soc. 47 (2015), 29–41. [Google Scholar]
  • 7. Bondarenko A. and Seip K., Large greatest common divisor sums and extreme values of the Riemann zeta function, Duke Math. J. 166 (2017), 1685–1701. [Google Scholar]
  • 8. Bondarenko A. and Seip K., Extreme values of the Riemann zeta function and its argument, Math. Ann. 372 (2018), 999–1015. [Google Scholar]
  • 9. Bondarenko A. and Seip K., Note on the resonance method for the Riemann zeta function, Oper. Theory Adv. Appl. 261 (2018), 121–139. [Google Scholar]
  • 10. Chandee V. and Soundararajan K., Bounding |ζ(12+it)| on the Riemann hypothesis, Bull. Lond. Math. Soc. 43 (2011), 243–250. [Google Scholar]
  • 11. de la Bretèche R. and Tenenbaum G., Sommes de Gál et applications, Proc. London Math. Soc. (3) 119 (2019), 104–134. [Google Scholar]
  • 12. Dong Z. and Wei B., On large values of |ζ(σ+it)| , arXiv:2110.04278.
  • 13. Gál I. S., A theorem concerning Diophantine approximations, Nieuw Arch. Wiskunde 23 (1949), 13–38. [Google Scholar]
  • 14. Granville A. and Soundararajan K., Extreme values of |ζ(1+it)| , The Riemann Zeta function and related themes: papers in honour of Professor K. Ramachandra, Ramanujan Mathematical Society Lecture Notes Series, vol. 2, Ramanujan Mathematical Society, Mysore, 2006, pp. 65–80. [Google Scholar]
  • 15. Hilberdink T., An arithmetical mapping and applications to Ω‐results for the Riemann zeta function, Acta Arith. 139 (2009), 341–367. [Google Scholar]
  • 16. Ingham A. E., Mean‐value theorems in the theory of the Riemann zeta‐function, Proc. Lond. Math. Soc. 27 (1926), 273–300. [Google Scholar]
  • 17. Kalmynin A., Omega‐theorems for the Riemann zeta function and its derivatives near the line Re s = 1 , Acta Arith. 186 (2018), 201–217. [Google Scholar]
  • 18. Levinson N., Ω‐theorems for the Riemann zeta‐function, Acta Arith. 20 (1972), 317–330. [Google Scholar]
  • 19. Lewko M. and Radziwiłł M., Refinements of Gál's theorem and applications, Adv. Math. 305 (2017), 280–297. [Google Scholar]
  • 20. Littlewood J. E., On the zeros of the Riemann zeta‐function, Proc. Camb. Philos. Soc. 22 (1924), 295–318. [Google Scholar]
  • 21. Montgomery H. L., Extreme values of the Riemann zeta function, Comment. Math. Helv. 52 (1977), 511–518. [Google Scholar]
  • 22. Soundararajan K., Extreme values of zeta and L‐functions, Math. Ann. 342 (2008), 467–486. [Google Scholar]
  • 23. Titchmarsh E. C., The theory of the Riemann zeta‐function, 2nd ed., Oxford University Press, New York, 1986. [Google Scholar]
  • 24. Voronin S. M., Lower bounds in Riemann zeta‐function theory, Izv. Akad. Nauk SSSR Ser. Mat. 52 (1988), 882–892. [Google Scholar]
  • 25. Yang D., A note on log‐type GCD sums and derivatives of the Riemann zeta function , arXiv:2201.12968.

Articles from Mathematika are provided here courtesy of Wiley

RESOURCES