Topics in analytic number theory, Lent 2013.

Lecture 7: Hadamard product, bounds for zeros

Bob Hough
May 7, 2013
General reference for this lecture: Davenport, Chaps 11, 12, 15, 16.

The Hadamard product, and its consequences

The bounds of the previous lecture imply the following representation of the
completed L-functions as products over zeros. This was discovered by Hadamard,
and played a crucial role in the proof of the Prime Number Theorem (discovered
shortly thereafter).
Theorem 7.1 (Hadamard Product). There exist constants A, B such that

Y 
s
A+Bs
(s) = e
1
es/ .

()=0

For each primitive Dirichlet character mod q there exist constants A and B
such that

Y 
s
(s, ) = eA()+B()s
1
es/ .

(,)=0

Proof sketch. This is non-examinable.

We first note that the product converges. Indeed, let R = max(|s|, 1). Then
the product splits as


Y 
Y 
s
s
1
es/
1
es/ .

||2R

||<2R

The first product is finite, and the second product is convergent, since



s
es/ = O(R2 /||2 ),
log 1

and the sum

Z
Z
X 1
d#{ : || < t}
O(t(log t + log q))
=
=
dt < .
2
||2
t
t3
2R
2R
||>2R

Now we consider
F (s) = Q

(s, )


,
s
s/
(,)=0 1 e
1

which is an entire function, having no zeros or poles. We claim that for  > 0,
|F (s)| exp(O(|s|1+ )) [we are viewing q as fixed, so the implied constant may
depend upon q]. By the maximum modulus principle, it suffices to check this
on a sequence of circles |s| = Rn where 2n Rn < 2n+1 . The bound is already
known for (s, ) (on any circle) so it suffices to find circles for which
Y
1+
(1 s/)1 es/ eO(|s| ) .

Between |s| = 2j and |s| = 2j+1 there are O(j2j ) zeros of (s, ), and therefore
we may choose Rj [2j , 2j+1 ) such that |s| j2cj for all s with |s| = Rj . Split
the product according as || < R/2, R/2 || 2R and ||
elements
P> 2R. The
1
= O(R )
in the first product are bounded by O(ReR/|| ). Since ||<R/2 ||
and there are O(R log R) terms in the product, this region is covered. In the
||
middle region, each term in the product is O( |s|
) = O(R3 ). Since there are
O(R log R) terms, again this is covered.P The elements in the third product
are bounded by exp(O(R2 /||2 )). Since ||>2R ||1 2 = O(R1+ ), this term is
covered.
We have established that F (s) is entire, without zeros or poles, and satisfies
|F (s)| exp(O(|s|1+ )). It is then a standard fact of complex analysis that
F (s) = eA+Bs for some constants A and B.
Logarithmically differentiating the Hadamard product, we find

X  1
0
1
(s) = B +
+

s
:()=0

which provides an alternative expression for the logarithmic derivative of ,


X  1
0
1
1 1
1 0
1
(s) = B +
+ log +
(s/2)
+
. (1)

s1 s 2
2
s
:()=0

Comparing this expression with the Dirichlet series

0 /(s) =

X X log p
p

pns

X (n)

(2)

ns

in the domain of absolute convergence provides most of the known information

about the zeros.
The analogue of these two expressions of the logarithmic derivative for primitive L(s, ) are (a = 0 for even and a = 1 for odd )

X  1
L0 (s, )
1
q
1 0 s + a
1

(3)
= log +
(
) B()
+
L(s, )
2
2
2
s
:(,)=0

and
L0 /L(s, ) =

X X log p(pn )
p

pns

X (n)(n)
n

ns

(4)

The constant B now depends on q, and so must be controlled. The following

lemma is useful.
1

is the von Mangoldt function, (pn ) = log p at prime powers, and otherwise zero.

Lemma 7.2. We have <(B()) =

Proof. We have B() =

:(,)=0

< 1 .

0
(0, ).

By the functional equation


X  1
0
1
B() = (1, ) = B()
+
.

1
(,)=0

Since 1 runs over the zeros of (s, ) as runs over the zeros of (s, ), we
have
X
X
X
1
1
1
< = 2
2<B() = B() + B() =
<
< .

(,)=0

(,)=0

(,)=0

(The separation of summands justified because the sum of real parts is absolutely
convergent.)
We now prove a sequence of key estimates regarding sums over zeros.
Lemma 7.3. We have, for any t R and primitive mod q,
X
=+i:(,)=0

1
= O(log q + log(|t| + 2)).
1 + (t )2

In particular, the number of zeros of (s, ) satisfying |t | < 1 is O(log q +

log(|t| + 2)) for any t and
X
:|t|>1

1
= O(log q + log(|t| + 2)).
(t )2

These statements also hold for .

For 1/2 2 and any primitive mod q, q > 1, we have

L0
(s, ) = O(log(|t| + 2) + log q)
L

Similarly,

X
(,)=0
|t|1

1
1
even .
s
s

X
0
1
(s) = O(log(|t| + 2)) +

s1

()=0
|t|<1

(5)

1
.
s

Proof. Write s = + it, = + i. For 2, apply Stirlings approximation

for the logarithmic derivative of
X
L0 /L(s, ) = O(log(|t| + 2) + log q) B()
(1/(s ) + 1/).

Now we let = 2 and take real parts to deduce

<

X
2
L0
(2 + it) = O(1) = O(log(|t| + 2) + log q)
. (6)
2 + (t )2
L
(2

Notice that we have used Lemma 7.2 to cancel the real part of B with the sum
of <(1/). This proves the first set of statements, since
X

X
1
2
= O(log(|t| + 2) + log q).
2
2
2 + (t )2
1 + (t )
(2

To prove the formula for L0 /L as a finite sum over zeros, write (L0 /L(2 +
it, ) = O(1))

L0
L0
L0
(s, ) = O(1) (s, ) + (2 + it, )
L
L
L

X 1
1 0 2 + it + a
1
1 0 s + a
(
)
(
)

.
= O(1) +
2
2
2
2
s 2 + it

If is even then 12 ( 2s ) = 1s + O(1) as s 0, and otherwise the difference of

Gamma functions is O(log(|t| + 2)).
Now we truncate the sum over zeros. If |t | > 1 then


 1

1
2
2


 s 2 + it  = |s ||2 + it | |t |2 ,
so that this part of the sum is bounded by O(log(|t| + 2) + log q). We are left
with a finite sum over zeros satisfying |t | < 1. To eliminate the part of the
1
sum coming from 2+it
note that
X
:|t|<1

1
= O(log(|t| + 2) + log q),
2 + it

due to the number of zeros. This yields the formula.

The corresponding estimate for is proved in the same way. Now the term
1
1
cancels
the pole of at 0, while the term s1
remains.
s