A SHORT PROOF OF THE PRIME NUMBER THEOREM FOR

ARITHMETIC PROGRESSIONS
IVAN SOPROUNOV
Abstract. We give a short proof of the Prime Number Theorem for arithmetic pro-
gressions following the ideas of recent Newmans short proof of the usual Prime Number
Theorem.
1. Introduction
A few years ago D. J. Newman found a simple analytic proof of the Prime Number
Theorem. It contains a very elegant proof of the fact that (s) has no zeros in s = 1, and
a rened short derivation of the Prime Number Theorem from it. The proof presented by D.
Zagier in [Z] only takes three pages since the author avoids unnecessary details. This makes
the proof even more appealing.
It seems natural to have an analogous short proof of the Prime Number Theorem for
arithmetic progressions. It turns out that the same arguments can be applied to this problem.
The proof we present here is similar to the one in [Z]. As for the length, it takes approximately
the same number of pages, even though we put more detail in it. However, the proof relies
on the fact that L(1, ) = 0 for any non-principal character , whose proof we omit. This
can be found in any proof of the Dirichlet theorem (see for example [BSh]).
2. The Prime Number Theorem for arithmetic progressions
Theorem 2.1. Let (x, q) denote the number of all primes p no greater than x, congruent
to a mod q , for a, q N such that gcd(a, q) = 1. Then
(x, q)
1
(q)
x
log x
,
where (q) is the Euler function.
Following the original paper [Z] we will give a proof in a series of steps. Let be a
Dirichlet character modulo q and
0
the principal character. We consider the following
functions:
L(s, ) =

n=1
(n)
n
s
,
q
(x) = (q)

px
pa (q)
log p,
(s, ) =

p
(p) log p
p
s
,
q
(s) =

(s, ),
q,a
(s) =

(a)(s, ).
Claim 1. For s > 1 we have L(s, ) =

p
(1 (p)p
s
)
1
. In particular L(s,
0
) =

p|q
(1 p
s
)
1
=

p|q
(1 p
s
) (s).
1
2 IVAN SOPROUNOV
The proof of the claim repeats the proof of the corresponding statement in [Z], taking
into account the multiplicativness of .
Claim 2. For any non-principal the functions L(s, ) and L(s,
0
)
(q)
q
1
s1
extend
holomorphically to s > 0.
Proof. We are using the standard partial summation argument:

nx
(n)
n
s
=
A(x)
x
s
+ s
_
x
1
A(t) dt
t
s+1
,
where A(x) =

nx
(n). Note that if =
0
then A(x) is bounded thus
L(s, ) = s
_

1
A(t) dt
t
s+1
represents a holomorphic function for s > 0. For the principal character we use the repre-
sentation in Claim 1 which gives a meromorphic extension to s > 0 with a simple pole at
s = 1 and the residue

p|q
(1 p
1
) = (q)/q .
Claim 3.
q
(x) = O(x).
This follows immediately from statement III of [Z] since

q
(x) (q)

px
log p = (q)(x) = O(x).
Claim 4. For any , L(s, ) has no zeros in s 1.
Proof. Consider the function L(s) =

L(s, ). We will show that L(s) has no zeros on

s = 1. We already know from the proof of the Dirichlet Theorem [BSh] that L(1, ) = 0
for any non-principal . By Claim 2 L(s,
0
) has a simple pole at s = 1 and hence so does
L(s). Suppose L(s) has a zero of order 0 at s = 1 +i for = 0. Denote the order of
zero at s = 1 + 2i by . Observe that L(s) is a real-valued function for s real. Indeed,
L(s) =

L(s, ) =

L(s, ) = L(s).
Therefore L(s) has zeros of orders and at s = 1 i and s = 1 2i, respectively.
Now for any character we have for s > 1

(s, )
L(s, )
=

p
d
ds
_
log(1 (p)p
s
)
1
_
=

p
(p)p
s
log p
1 (p)p
s
=

p
(p) log p
p
s
(p)
=

p
(p) log p
p
s
+

2
(p) log p
p
s
(p
s
(p))
(2.1)
= (s, ) + h(s, ),
where the function h(s, ) is holomorphic for s > 1/2. Therefore, by Claim 2 (s, )
extends meromorphically to s > 1/2 with poles only at the zeros of L(s, ) for =
0
,
and (s,
0
) extends meromorphically to s > 1/2 with poles only at s = 1 and the zeros
of L(s,
0
). Summing up the above equality over all we get

(s)
L(s)
=
L

(s, )
L(s, )
=
q
(s) + h(s)
A SHORT PROOF OF THE PRIME NUMBER THEOREM FOR ARITHMETIC PROGRESSIONS 3
for some holomorphic function h(s) in s > 1/2. Recall that the residue of the logarithmic
derivative of a function f at a pole is equal to the order of the zero of f at this point.
Therefore we have:
res
s=1
(
q
(s)) = lim
0

q
(1 + ) = 1,
res
s=1i
(
q
(s)) = lim
0

q
(1 + i) = ,
res
s=12i
(
q
(s)) = lim
0

q
(1 + 2i) = .
Let us now sum the values of
q
at these 5 points with binomial coecients 1, 4, 6, 4, 1. We
obtain
2

r=2
_
2 + r
4
_

q
(1 + + ri) =

(p) log p
p
1+
_
p
i/2
+ p
i/2
_
4
=

p1 (q)
(q) log p
p
1+
_
p
i/2
+ p
i/2
_
4
0.
On the other hand times the left hand side of the equation approaches 4+64 ,
as 0. Thus 6 8 2 0, which implies = 0. Therefore, L(s) and, hence, L(s, )
for each has no zeros on s = 1. Note also that L(s, ) has no zeros for s > 1 by
Claim 1.
Claim 5.
q,a
(s)
1
s1
is holomorphic for s 1.
Proof. Indeed, by denition

q,a
(s) =

(a)(s, ) =

=0
(a)(s, ) + (s,
0
).
From (2.1) we see that each (s, ) is holomorphic for s 1 since L(s, ) is holomorphic
and has no zeros in s 1 by Claim 2 and Claim 4. Also (s,
0
)
1
s1
is holomorphic for
s 1 since L(s,
0
) has a simple pole at s = 1 and no zeros in s 1. The statement
now follows.
Claim 6.
_

1
q(x)x
x
2
dx converges.
Proof. Let a be an inverse of a mod q , i.e. such that aa 1 (q). Then (a) = ( a) and by
denition

q,a
(s) =

(a)

p
(p) log p
p
s
=

p
_

( a)(p)
_
log p
p
s
=

ap1 (q)
(q) log p
p
s
=

pa (q)
(q) log p
p
s
.
Note that
q
(x) has jumps of height (q) log p at points x = p, where p a (q). Thus we
can write the above sum as an Riemann-Stieltjes integral and apply integration by parts:
=
_

1
d
q
(x)
x
s
=

q
(x)
x
s

1
+ s
_

1

q
(x)
x
s+1
dx.
4 IVAN SOPROUNOV
Replacing x = e
t
we nally get
(2.2)
q,a
(s) = s
_

0
e
st

q
(e
t
) dt.
Now let f(t) =
q
(e
t
)e
t
1. The function f is bounded since
q
(x) = O(x) by Claim 3
and locally integrable since it has a discrete set of points of discontinuity. Moreover,
g(z) =
_

0
f(t)e
zt
dt =
_

0

q
(e
t
)e
(z+1)t
dt
_

0
e
zt
dt
=

q,a
(z + 1)
z + 1

1
z
,
where the last equality follows from (2.2). Therefore by Claim 5 the function g(z) extends
holomorphically to s 0. We now are under the conditions of the Analytic Theorem:
Analytic Theorem. [Z] Let f(t), t 0 be a bounded and locally integrable function and
suppose that the function g(z) =
_

0
f(t)e
zt
dt, where z > 0, extends holomorphically
to z 0. Then
_

0
f(t) dt exists and equals g(0).
It remains to show that
g(0) =
_

0
(e
1

q
(e
t
) 1) dt =
_

0

q
(e
t
) e
t
e
t
dt =
_

1

q
(x) x
x
2
dx.

Claim 7.
q
(x) x, x .
Proof. This follows directly from Claim 6.
Claim 8.
(x, q)
1
(q)
x
log x
, x .
Proof. We have

q
(x) = (q)

px
pa (q)
log p (q)

px
pa (q)
log x = (q)(x, q) log x.
Fix any > 0. Then

q
(x) (q)

x
1
px
pa (q)
log p (q)

x
1
px
pa (q)
(1) log x = (q)(1) log x
_
(x, q)+O(x
1
)
_
,
since (x, q) = O(x), clearly. It remains to let 0.
References
[BSh] Z. I. Borevich, I. R. Shafarevich, Number Theory, New York, Academic Press 1966.
[Z] D. Zagier, Newmans Short Proof of the Prime Number Theorem, Amer. Math. Monthly, Vol.104
(1997), No. 8, 705708.
Department of Mathematics, University of Toronto, Toronto, ON Canada
E-mail address: isoprou@math.toronto.edu