In this section, we continue to exploit the Euler product for
,
deriving Dirichlet series for the functions in the title. Both these series
are essential ingredients of the proof of the prime number theorem.
First, consider
.
A logarithm of a complex number
is any
such that
. As the
reader will know, there are many such
's. If complex numbers
(
)
are given, and logarithms
of
can be chosen so that
is convergent (say to
), then by continuity
,
so
is a logarithm of
. So, by the Euler product,
we will obtain a logarithm of
if we can choose (for each
) a
logarithm
of
in such a way that
converges. We show now that this is achieved by using the familiar
logarithmic series, and furthermore that the resulting function is holomorphic
(alias differentiable).
Lemma 2.3.1. Define
for
. Then
is a logarithm of
. Also,
when
.
Proof. The series for
certainly converges when
. By termwise
differentiation (which is valid for power series), we have
We now use the following theorem on ``double series" (for a proof, see Appendix B):
(DS) Suppose that the repeated sum
converges. Then the repeated sums
Theorem 2.3.2. For Re
, a holomorphic function,
forming a logarithm of
, is defined by
Proof. Provided that the series
converges, its sum will be
a logarithm of
. This sum is the repeated sum
We shall use the notation
(for Re
) to mean the
function
just defined. It does not necessarily coincide with the so-called
``principal value" of the logarithm with argument between
and
.
However, it is clearly the real-valued logarithm when
is real.
The double series for
sheds some light
on the behaviour of
, in which the prime terms have
been picked out of the series for
. In the double series, we can reverse
the order of summation (again using (DS)) and separate out the term
, as follows:
Proposition 2.3.3. For real
, we have
Proof. The first statement follows immediately from the double series as written above.
To prove the second statement, we have for all
,
Hence in particular
as
.
This fact is a natural companion to the divergence of
, which
we proved in a similar way in 2.1.6.
We claim to have selected a logarithm of
that possesses
a derivative. Let us now consider this derivative.
Recall that for a real function
, the derivative of
is
. The same applies to complex functions in the following sense.
If
is differentiable and
, then differentiation gives
, hence
.
In our case, with
defined as above, this means that
Theorem 2.3.4. For Re
, we have
The function
is called the von Mangoldt function
(and
, again for historical reasons, is the standard notation).
Exactly as with the Möbius function, the Euler product has again led us
to an arithmetic function that would hardly have been obvious to guess!
Now that
has been identified for us,
let us formulate and verify the convolution identity corresponding to this series.
The series identity
Theorem 2.3.5. Write
. Then
Proof. The second statement follows from the first one, since
.
To prove the first statement, note first that
. Now
choose
, with prime factorization
The series for
plays an absolutely central part in the
strategy to prove the prime number theorem. At this point, it is nearly, but not
quite, clear why. Of course, our goal is to prove that
.
The general idea is that by knowing enough about a function defined by a
Dirichlet series, we hope to derive information about the coefficients of
the series - more exactly, about their partial sums. The Dirichlet series whose
coefficients would deliver
in this way is, of course, the derivative of
. However, this is an awkward function, and it is
easier to establish properties of
. The summation function of its coefficients
differs from
by including powers of primes as well
as primes. The next task is to show that this summation function does
just as well as
for our purpose. This is the subject of the next section.
1. What convolution identity is suggested by the fact that
? Prove this identity
by showing that
and applying
a result from section 1.8.
2. Let
3. Use Abel summation to show that
4. By termwise differentiation of the series
,
show that