<<

A CLASS OF DIRICHLET

JONATHAN M. BORWEIN

1. Preliminaries.

In this note we extend the solution to a recent Monthly problem to analyze a broad class of and illustrate the result in action in various ways. More precisely, in [6] the following evaluation is obtained: Z © √ ª ∞ 3 − 2 2 cos (t log 2) |ζ (1/2 + it)|2 2 dt = π log 2. (1) 0 t + 1/4 This somewhat recondite-looking result transpires to be a case of a rather pretty class of evaluations given in Theorem 1, and worth making explicit. P −s We let λ(s) := n>0 λn n represent a formal Dirichlet series, with real coefficients λn and we set s := σ + i τ with σ = <(s) > 0. We refer to [2], [3], and [7] for other, largely standard, notation. We consider the following integral Z ¯ ¯ ∞ ¯ ¯2 ¯λ(s)¯ ιλ(σ) := ¯ ¯ dτ, (2) 0 s

as a function of the Dirichlet series λ (i.e., of the coefficients λn). The question of evaluating (2) when λ is the alternating zeta-function was posed and solved (at least formally) in [6]. It is convenient to know that for strictly positive u and a Z ∞ cos (at) π −au 2 2 dt = e , (3) 0 t + u 2u as may be established by , by consulting a computer algebra system, or otherwise.

2. The Main Result.

P∞ −s Theorem 1. For λ(s) = n=1 λn n and s = σ + i τ with fixed σ = <(s) > 0 such that the Dirichlet series is absolutely convergent it is true that Z ¯ ¯ ∞ ¯λ(s)¯2 π X∞ Λ2 − Λ2 ι (σ) = ¯ ¯ dτ = n n−1 , (4) λ ¯ s ¯ 2σ n2σ 0 n=1 Pn where Λn := k=1 λk and Λ0 := 0. 1 2

P∞ −s More generally, for given absolutely convergent Dirichlet series α(s) := n=1 αn n P∞ −s and β(s) := n=1 βn n Z ∞ α(s) β(s) π X∞ A B − A B < dτ = n n n−1 n−1 , (5) σ2 + τ 2 2σ n2σ 0 n=1 Pn Pn in which An = k=1 αk and Bn = k=1 βk.

PN −s Proof. Let λN (s) = n=1 λn n . Then P Z ∞ 2 Z ∞ −σ+iτ −σ−iτ |λN (s)| N≥n,m>0 λn λmn m 2 2 dτ = 2 2 dτ 0 τ + σ 0 τ + σ Z Z X λ λ ∞ (n/m)iτ XN λ λ ∞ (n/m)iτ = 2 n m dτ + n m dτ (nm)σ τ 2 + σ2 (nm)σ τ 2 + σ2 N≥n>m>0 0 n=m=1 0 Z ¡ ¢ Z X λ λ ∞ cos τ log(n/m) XN λ2 ∞ 1 = 2 n m dτ + n dτ (nm)σ τ 2 + σ2 n2σ τ 2 + σ2 N≥n>m>0 0 n=1 0 π X λ λ π XN λ2 = n m + n σ (nm)σ (n/m)σ 2σ n2 σ N≥n>m>0 n=1 π XN λ Λ π XN λ2 π XN Λ2 − Λ2 = n n − n = n n−1 . σ n2σ 2σ n2σ 2σ n2σ n=1 n=1 n=1

2 P∞ −σ 2 Next, we observe that |λN (s)| ≤ ( n=1 |λn|n ) = M < ∞, where M is independent of τ. Hence ¯ ¯ ¯λ (s)¯2 M ¯ N ¯ ≤ , ¯ s ¯ τ 2 + σ2 and (4) follows from Lebesgue’s theorem on dominated convergence when N → ∞. We can establish (8) in a similar fashion. 2

By Dirichlet’s test, the final series in (4) is convergent when σ > 0 provided that {Λn} is bounded, but we cannot automatically guarantee that it is equal to the integral in (4) in this case, or even that the integral is finite. Simple continuation arguments just will not work. It is easy to check that Z ∞ α(s) β(s) hα, βiτ := 2 2 dτ 0 σ + τ

defines an extended-value inner product on the space of Dirichlet series with hα, αiσ = ια(σ), which is typically finite for σ large enough. 3

¡ ¢ P∞ µ −s Next, let Lµ(s) := n=1 n n denote the primitive L-function corresponding to the ¡ µ ¢ Legendre-Jacobi-Kronecker symbol n [5]. An imprimitive character sum modulo m is induced by another character sum modulo m0 for which m|m0 and χ(m) = χ0 (n mod m0). ³We´ remind the reader that, for a prime p and µ relatively prime to p, the Legendre symbol µ p is 1 when µ is a quadratic residue modulo p and is −1 otherwise. The Jacobi symbol extends this multiplicatively for µ the product of distinct primes, while the Kronecker symbol provides the final extension to all relatively prime pairs µ and n. Example 1. First, we note that with λ ≡ 1 we recover the arctangent formula Z 1 π 2 2 dt = . R σ + t σ

−s −1 σ 1 Similarly, let ϑ := s 7→ (1 + 2 ) . Here again π ιϑ(σ) = 2 ϑ(2σ). 2

Example 2. For the Riemann zeta-function (ζ = L1) and for σ > 1, σ 1 ι (σ) = ζ(2σ − 1) − ζ(2σ), π ζ 2

as λn = 1 and Λn = n. By contrast it is known—see [4, eqn. (69)] or [1]—that on the critical line µ ¶ 1/2 1 √ 1 ι = log( 2 π) − γ. π ζ 2 2 More broadly, Crandall (in unpublished notes) has shown that when 0 < σ < 1 Z Z 1 X θ2 1 ι (σ) = π dθ = π θ2ζ(1 + 2σ, θ) dθ, ζ (n + θ)1+2σ 0 n≥0 0 where ζ(s, a) is the Hurwitz zeta-function, which is easy to compute. Working a little harder [1], we obtain  − 1 [ζ(2σ) + 2 ζ(2σ − 1)/(2σ − 1)] if 0 < σ < 1; σ  2 ιζ (σ) = (6) π  1 − 2 [ζ(2σ) − 2 ζ(2σ − 1)] , if 1 < σ < ∞. 2 Example 3. There are similar formulas for s 7→ ζ(s − k) with k integral. For instance, applying the result in (4) with ζ1 the function sending t 7→ ζ(t + 1) yields Z µ ¶ 1 ∞ |ζ(3/2 + iτ)|2 1 1 2 dτ = ιζ1 = 2 ζ(2, 1) + ζ(3) = 3 ζ(3), π 0 1/4 + τ π 2

P 2 Pn−1 on using Euler’s result [3] that ζ(2, 1) := n 1/n k=1 1/k = ζ(3). 2 4

Example 4. For the classical alternating zeta-function, α(s) := (1−21−s)ζ(s), we recover (see [6]): σ 1 ι (σ) = α(2σ), π α 2 n+1 2 2 as λn = (−1) = Λn − Λn−1. Set σ = 1/2. Then |α(1/2 + it)|2 |1 − 21/2−i t|2 |ζ(1/2 + i t)|2 ³ √ ´ |ζ(1/2 + i t)|2 = = 3 − 2 2 cos (t ln (2)) 1/4 + t2 1/4 + t2 1/4 + t2

is precisely the integrand in (1). Thus, since α(2σ) = log 2, we see that ια(1/2) = π log 2 is the evaluation in [6]. Note that to justify the exchange of sum and integral implicit in (4) we have to group the terms more carefully as 1/2 is below the abscissa of absolute convergence of the series—or use the approach in [1] on the Hurwitz zeta-function. 2

Example 5. For the Catalan zeta-function, β := L−4: σ 1 ι (σ) = β(2σ), π β 2 n 2 2 as λ2n = 0, λ2n+1 = (−1) , and again Λn − Λn−1 = λn. σ 1 For L−3, the same pattern holds, in that π ιL−3 (σ) = 2 L−3(2σ), but it fails for L5, L−7, and so on. In general L±d does not lead to output that is again a primitive L-series modulo d. For example, σ X (−1)(n mod 5) ι (σ) = − , π L5 n2σ 5-n and σ 1 ι (σ) = L (2σ) − L (2σ). π L−8 −8 2 −4 Unlike the case of primitive L-series (meaning that the coefficients are not induced by restriction of another L-series), these right-hand side series have coefficients that are not multiplicative, though always the coefficients repeat modulo d. 2

While (4) gives an effective way of evaluating the integral, direct numerical computation to high precision presents a more interesting challenge. This is in part because of the severe oscillations of the integrand— shown in Figure 1 with σ = 1/2, 1, and 2 for α and L−3, respectively. In large part, the issue lies in estimating the integrand well, and so is intrinsically no-trivial.

3. A Characterization and Some Reworkings.

The preceding results are nicely explained by the following theorem: 5

0.35 2

0.3

1.5 0.25

0.2

1 0.15

0.1 0.5

0.05

0 5 10 15 20 25 30 0 5 10 15 20 25 30 t t

Figure 1. The integrands for α and L−3 respectively with σ = 1/2, 1 and 2

Theorem 2. The unique Dirichlet series with all nonvanishing coefficients satisfying the functional equation π 1 ι (σ) = ϑ(2σ) σ ϑ 2 is the alternating zeta-function α. Moreover, each solutions is alternating of the form X∞ (−1)k ϑ(s) = (7) ns k=1 k

for an increasing sequence of integers 0 < n1 < n2 < ··· < nk ··· .

Proof. Comparing coefficients and invoking (4), we see that, in the ring of formal Dirichlet σ 1 series π ιψ(σ) = 2 ψ(2σ) if and only if 1 Ψ2 − Ψ2 = ψ (Ψ + Ψ ) = ψ n n−1 n n−1 n 2 n Pn for all n, where as before Ψn := m=1 ψm. Equivalently, we have either Ψn = Ψn−1 or Ψn + Ψn−1 = 1 for all n. Observing that Ψ0 = 0, we deduce that Ψn = 0 or 1 for each n.

This leads to (7) when reexpressed in terms of ψn. 2 −s Note that λ ≡ 1 and s 7→ 1 − 3 have the requisite form, as do L−3,L−4, and ϑ in the previous examples, whereas the other functions therein do not. 6

The derivation of (4) can be adjusted to produce Z ¯ ¯ ∞ ¯λ(s)¯2 π X λ2 π X λ2 π X λ Θ ¯ ¯ dτ + n = ι (σ) + n = n n . (8) ¯ s ¯ 2σ n2σ λ 2σ n2σ σ n2σ−1 0 n>0 n>0 n>0 1 Pn Here Θn := n m=1 λm is the average order of λn [7]. P 2 −σ For an interesting variety of arithmetic functions, both λ(σ) and λ2(σ) := n>0 λn n have closed forms (see [7, chaps. 16–18], [5]) and the discussion to follow, so (8) can be viewed as giving information about the more recondite average order series on the far σ right. Thus, an application of the arithmetic-geometric mean inequality— for λn/n and σ nΘn/n —yields Z ¯ ¯ ∞ ¯λ(s)¯2 π X λ Θ π X λ2 π X Θ2 ¯ ¯ dτ = n n − n ≤ n . (9) ¯ s ¯ σ n2σ−1 2σ n2σ 2σ n2σ−2 0 n>0 n>0 n>0 Thus, Z ¯ ¯ π X λ Θ ∞ ¯λ(s)¯2 π X Θ2 n n−1 ≤ ¯ ¯ dτ ≤ n . (10) σ n2σ−1 ¯ s ¯ 2σ n2σ−2 n>0 0 n>0 Moreover, we have ¯ ¯ ¯ ¯ ¯ X Z ∞ 2 ¯ X 2 ¯π λnΘn ¯λ(s)¯ ¯ π λ π ¯ − ¯ ¯ dτ¯ ≤ n = λ (2 σ), (11) ¯σ n2σ−1 ¯ s ¯ ¯ 2σ n2 θ 2σ 2 n>0 0 n>0 where both quantities on the left are nonnegative.

Example 6. Clearly, (L±d)2 is very simple. In particular, for p prime we have (L±p)2(s) = (1 − p−s)ζ(s). Let σk denote the kth power sum of divisors of n. A beautiful formula [7, Theorem 291] asserts that: X∞ σ (n) k = ζ(s)ζ(s − k)(<(s) > max{1, k + 1}), (12) ns n=1 while [7, Theorem 305] gives the following remarkable identity: X∞ σ (n)σ (n) ζ(s)ζ(s − a)ζ(s − b)ζ(s − a − b) a b = (13) ns ζ(2s − a − b) n=1 when <(s) > 1+max{a, b, a+b}. This result, which is due to Ramanujan for a = b, yields

(Lσa )2. 2 P −s Example 7. By contrast, for the M¨obiusfunction [7], [8] we have µ(s) = n>0 µ(n)n = 1/ζ(s)—directly from the M¨obiusinversion formula. Here µ(n) = (−1)k if n has k P −s distinct prime factors and is zero otherwise. On the other hand, µ2(s) = n∈SF n , 7

where SF represents the squarefree numbers, has no explicit formula. From (11) with Pn M(n) := k=1 µ(k), we obtain ¯ ¯ ¯ ¯ ¯ X Z ∞ 2 ¯ X ¯π µn Mn ¯ 1 ¯ ¯ 1 ¯ − ¯ ¯ dτ¯ ≤ . (14) ¯σ n2σ ¯s ζ(s)¯ ¯ n2 σ n>0 0 n∈SF √ Recall that the Mertens conjecture— that always |M(n)| ≤ n holds for all n—was only recently shown to fail for some n no smaller than 1012 and probably larger that 1030 [8, pp. 207–210]. 2

References [1] D. Borwein and J. M. Borwein, Van der Pol expansions of L-series, (2005, preprint). [2] J. M. Borwein and D. H. Bailey, Mathematics by Experiment. Plausible Reasoning in the 21st Century, AK Peters, Natick, MA, 2003. [3] Jonathan Borwein, David Bailey, and R. Girgensohn, Experimentation in Mathematics. Computa- tional Paths to Discovery, AK Peters, Natick, MA, 2004. [4] J. M. Borwein, D. M. Bradley and R. E. Crandall, Computational strategies for the Riemann zeta- function, J. Comp. and Appl. Math, 121 (2000), 247–296; also available as CECM Preprint 98:118. [5] J. M. Borwein and K.-K. (Stephen) Choi, On Dirichlet series for sums of squares, Ramanujan J., 7 (2003) 195–238. [6] A. Ivic, Solution to Monthly Problem #10939, proposed by A. Ivi´c,with his solution in this Monthly 110 (2003), 847–848. [7] G. H. Hardy and E. M. Wright, 4th ed, An Introduction to the Theory of Numbers, Oxford University Press, Oxford, 1959. [8] J. Havel, Gamma: Exploring Euler’s Constant, Princeton University Press, Princeton, 2003. Dedication. This article is dedicated

To the memory of “Sir Edward Wright, the former principal and vice-chancellor of Aberdeen University who died on February 2 [2005] aged 98, became one of the country’s most distinguished mathematicians, despite being largely self-taught.”1 Acknowledgements. The research of the author is supported by NSERC and by the Canada Research Chair Programme.

Faculty of Computer Science, Dalhousie University, Halifax, Nova Scotia B3H 1W5, Canada E-mail address, Jonathan M. Borwein: [email protected] URL: http://www.cs.dal.ca/∼jborwein

1www.telegraph.co.uk/news/main.jhtml?xml=/news/2005/02/10/db1001.xml&sSheet=/portal/2005/02/10/ ixportal.html