The Prime Number Theorem, Part 3: Riemann zeta function
Another way to see that is a natural function to consider is through its deep connection with the Riemann zeta function.
In this section, we will prove the following standard facts about the zeta function.
-
The series defining
converges for
, and the function
is holomorphic in this half-plane.
-
For
, we have the Euler product formula
where the product extends over all primes
. This identity reveals that
encodes the multiplicative structure of the integers and, in particular, the distribution of the primes.
-
For
, we have the logarithmic derivative
where
is the von Mangoldt function. Thus the arithmetic information carried by
is directly reflected in the analytic behavior of
. The series is a Dirichlet series with nonnegative coefficients, which will be important in later arguments.
-
By the inverse Mellin transform, for
and
, we have
This identity expresses
as a complex integral whose behavior is governed by the analytic properties of
.
Definition of the Zeta Function
Proof. If where
and
are real, then
As a consequence, if the series defining
is uniformly bounded by
, which converges. Therefore, the series
converges uniformly on every half-plane
, and therefore defines a holomorphic function in
. □
The Euler Product Formula
Proof. Assume . Fix positive integers
and
with
.
Define the set of primes
and the exponent box
For each exponent vector , define
By the uniqueness part of the fundamental theorem of arithmetic, the map
is injective.
Now let be a positive integer with
. By the fundamental theorem of arithmetic,
since no prime larger than can divide
. Moreover, if
, then
which implies . Hence
Therefore,
Since the function is positive for
, this set inclusion implies
On the other hand, expanding the finite product
corresponds to choosing an exponent for each
, and hence yields
where injectivity of ensures that each integer appears exactly once.
Combining the above inequalities, we obtain
Since
we further obtain
Letting yields
For the reverse inequality, note that for fixed and
, the same expansion shows
since .
Letting and using monotone convergence gives
Taking completes the proof. □
The Logarithmic Derivative of the Zeta Function
We work in the half-plane , where the Euler product
converges absolutely.
Lemma 4. If , then
where .
Proof. Suppose first that is real and
. Taking the logarithm of the Euler product and using the power series expansion
we obtain
Since the double sum converges absolutely, the order of summation need not be specified. The identity therefore extends to all by analytic continuation. Moreover, the function
is well defined in the simply connected half-plane
, since
has no zeros there.
Finally, the sum may be rewritten as a Dirichlet series over the integers:
where if
for some prime
and integer
, and
otherwise. □
From the lemma, we have
Taking derivatives (using for instance the generalised Cauchy integral formula and Fubini’s theorem to justify the interchange of summation and derivative), we see that
Rewriting the right-hand side yields
Perron’s Formula
The logarithmic derivative of the Riemann zeta function connects to the Chebyshev function
through Perron’s formula, which may be viewed as a special case of the Mellin inversion formula:
Rather than attempting to analyze the asymptotic behavior of directly from this integral, it is more convenient to study its integral
Formally interchanging the order of summation and integration yields
This additional factor improves convergence and isolates the dominant contribution arising from the pole at
.
At the stage where Perron’s formula is introduced, the proof of the Prime Number Theorem relies on a small number of simple but essential principles. Making these explicit clarifies the contour deformations and estimates that appear later in the argument.
Infinite contours as limits of finite contours
Integrals along infinite contours are always interpreted as limits of integrals along finite contours. That is,
All contour deformations and estimates are first carried out for the truncated contours with finite height , and only afterward is the limit
taken. This includes applying Cauchy’s theorem or the residue theorem to finite contours, estimating integrals along auxiliary segments, and justifying the vanishing of error terms as
.
A deformation interpretation of the residue theorem (single pole case)
Let be a meromorphic function with a single pole at
.
The classical formulation of the residue theorem states that if is a positively oriented closed contour enclosing
and no other singularities, then
For applications such as the proof of the Prime Number Theorem, it is often more illuminating to reinterpret this result in terms of contour deformation.
Suppose that two oriented contours and
together form the boundary of a region containing the pole
, and that
is holomorphic in the region between them except at
. Writing the closed contour as
the residue theorem may be rewritten as
From this point of view, the residue theorem provides a mechanism for replacing an integral along one contour by an integral along another, at the cost of an explicit residue term arising from the pole crossed during the deformation.
Cauchy’s theorem appears as the special case in which has no poles in the region, so that
Zeros and poles determine the singularities of the logarithmic derivative
Let be a meromorphic function that is not identically zero. Its logarithmic derivative
is again meromorphic, and its singularities are completely determined by the zeros and poles of .
More precisely, suppose that is a zero of
of order
. Then locally one may write
where is holomorphic and nonvanishing near
. Taking logarithms and differentiating yields
so has a simple pole at
with residue
.
Similarly, if is a pole of
of order
, then
has a simple pole at
with residue
.
Thus the logarithmic derivative has only simple poles, located precisely at the zeros and poles of
, and the residue at each such pole records the corresponding multiplicity.
Returning now to the integral representation of ,
our goal is to move the line of integration from to the line
. On the latter line, the factor
has magnitude
, whereas on
it grows like
, which is too large for asymptotic purposes.
At this point such a deformation is not yet justified, since and its logarithmic derivative are initially defined only in the half-plane
. To proceed, we require their analytic continuation.
We now record several standard facts concerning the analytic continuation and zeros of the Riemann zeta function.
Theorem 5. The zeta function admits a meromorphic continuation to the entire complex plane, with a single singularity: a simple pole at .
Theorem 6. The only zeros of outside the strip
occur at the negative even integers
.
The region is called the critical strip. A central ingredient in the proof of the Prime Number Theorem is the fact that
has no zeros on the line
. As a consequence of this fact and the functional equation for
, it follows that
has no zeros on the line
.
Theorem 7. The zeta function has no zeros on the line .
Theorem 8. For we have
where is holomorphic in the half-plane
.
Theorem 9. For any , we have
whenever with
and
, where
is a positive constant depending only on
.
Back to the proof. We now deform the line of integration in the formula for from
toward the line
. The key point is that the integrand has no singularities in the region between these two lines except for the simple pole at
.
By the residue theorem, the difference between the two integrals is equal to times the residue of the integrand at
. A direct computation shows that this residue equals
.
Fix , say
, and assume
. Let
denote the integrand. The proof proceeds through three stages of contour deformation:
-
From Stage 1 to Stage 2, we justify deforming the infinite vertical line
to the truncated contour
. This requires decay estimates for
along the horizontal segments
,
, as
:
-
From Stage 2 to Stage 3, we apply the residue theorem at
to obtain
-
Finally, we estimate the integral along
by decomposing the contour into simpler segments and bounding each contribution.
From Stage 1 to Stage 2.
By Cauchy’s theorem, we have
where and
denote the top and bottom horizontal segments, respectively.
To deform the contour from to
, it suffices to show that
We first consider the upper horizontal segment . Along this segment, we have
with
, and hence
By Theorem 9, for any fixed and all
, there exists a constant
(depending on
and
) such that
in the rectangular regions under consideration. Consequently,
and therefore
for example by taking . The estimate for the lower segment
is identical.
From Stage 2 to Stage 3.
To establish the identity via the residue theorem, we compute the residue of
at . By Theorem 8, the logarithmic derivative of
has the expansion
where is holomorphic in a neighborhood of
. Since the factor
is also holomorphic at
, the residue of
at
is obtained by evaluating this factor at
. Hence,
Stage 3: Estimating the integral along .
We decompose the contour as
as shown in Figure 1, and estimate each integral separately.
We first choose sufficiently large. For the vertical rays
and
, we claim that
For , we have
with
, so that
By Theorem 9, taking , there exists a constant
such that
Hence,
which converges and can be made smaller than by choosing
sufficiently large. The estimate for
is identical.
Having fixed , we next choose
sufficiently small. On the vertical segment
, where
, we have
and therefore there exists a constant (depending on
) such that
Finally, on the horizontal segments and
, we obtain
Combining these estimates, we conclude that
Dividing by , we obtain
Thus, for all sufficiently large ,
The Prime Number Theorem, Part 2: Reduction of the Prime Number Theorem
Heuristically, the Prime Number Theorem predicts that primes near occur with density about
. If this is so, then the total contribution of the primes and their powers up to
, weighted by
, should be approximately
which suggests that the natural analytic formulation of the Prime Number Theorem is the asymptotic relation
This heuristic explains why is the correct object to study from the analytic point of view.
We now make this precise by showing that the Prime Number Theorem follows from the asymptotic behavior of .
Theorem 2. If as
, then
Recall that the asymptotic notation as
means that
Proof. Suppose that
We aim to prove that
Rather than estimating the difference
directly, we use upper and lower limits. It suffices to show that
Since always holds, these two inequalities together imply the desired limit.
By the hypothesis, since , the strategy is to compare
to
.
Recall the trivial upper bound for :
Dividing both sides by and taking
yields
To get the other bound, observe that for any fixed , we have
where in the last inequality we use the simple bound for all
. It follows that
Taking on both sides and using the hypothesis gives
Since this holds for all , we may let
to conclude that
and the proof is complete. □
The Prime Number Theorem, Part 1: Introduction
Define to be the number of primes less than or equal to
:
The Prime Number Theorem asserts that
Theorem 1.
At first glance, is the most natural object to study: it directly answers the question “how many primes are there up to
?” However,
is difficult to analyze analytically. It is a step function that jumps by
at each prime, and it treats every prime equally:
This additive viewpoint fails to reflect the multiplicative nature of the primes.
Indeed, primes are defined not by additive properties but by their role as the building blocks of multiplication. This multiplicative structure is made precise by the Fundamental Theorem of Arithmetic, which states that every integer can be written uniquely as
| (1) |
where is the exponent of the prime
in the prime factorization of
.
Taking logarithms converts this multiplicative decomposition into an additive one:
This identity suggests that the logarithm naturally “weights” primes according to how often they appear in the factorization of integers. In particular, primes should not all be counted equally; instead, they should be weighted by , and higher powers of primes should also contribute.
This motivates the definition of the Chebyshev function
where the sum runs over all prime powers not exceeding
.
Equivalently, may be written as a sum over primes:
where denotes the greatest integer less than or equal to
.
Thus, in each prime
contributes not just
once, but
multiplied by the number of powers of
that are less than or equal to
.
We have the following trivial observation connecting and
:
To better understand the structure of , it is helpful to view it as consisting of two distinct components:
-
the number of prime powers
,
-
the logarithmic weight
attached to each such power.
Note that both components are naturally motivated by the logarithmic factorization identity (1). Now consider how the prime contributes across all integers up to
. Rather than summing
over all
directly, we isolate the basic multiplicative events associated with
, namely the appearances of its powers
Each prime power represents one fundamental contribution of the prime
at scale
, and the total number of such powers is
This leads naturally to counting, for each prime , the number of its powers not exceeding
, and weighting each occurrence by
. Summing over all primes gives
It is not difficult to see that can also be expressed as a sum over all integers up to
:
where is the von Mangoldt function, defined by
We will see that the function is far more amenable to analytic methods than
. It is directly connected to the Riemann zeta function through its logarithmic derivative. As a result, the proof of the Prime Number Theorem proceeds not by analyzing
directly, but by first understanding the asymptotic behavior of
.
Hello world!
Welcome to WordPress.com. This is your first post. Edit or delete it and start blogging!



