Apologies for the lack of posts lately; it’s been a busy semester. This post is essentially my notes for a talk I gave in my analytic number theory class.
Our goal is to obtain bounds on the distribution of prime numbers, that is, on functions of the form . The closely related function
turns out to be amenable to study by analytic means; here is the von Mangolt function,
Bounds on will imply corresponding bounds on
by fairly straightforward arguments. For instance, the prime number theorem is equivalent to
.
The function is naturally connected to the
-function in view of the formula
In other words, is the Dirichlet series associated to the function
. Using the theory of Mellin inversion, we can recover partial sums
by integration of
along a vertical line. That is, we have
at least for , in which case the integral converges. Under hypotheses on the poles of
(equivalently, on the zeros of
), we can shift the contour appropriately, and estimate the integral to derive the prime number theorem.
Example 1 The fact that
is zero-free on the line
implies the prime number theorem. The classical zero-free region for
states that
is zero-free for complex numbers of the form
for a sufficiently small constant
; it implies bounds on the estimates given by the prime number theorem.
Our goal is to generalize this to the problem of primes in arithmetic progressions. Fix and
, relatively prime to
. Instead of the function
, we can consider the functions
These count primes at most in the specified arithmetic progression. We have an analog of the prime number theorem for arithmetic progressions:
Theorem 1
as
. Moreover, for some
Recall that is the logarithmic integral
.
The theorem implies in particular that the prime numbers equidistributed in the arithmetic progressions (that is, those which are relatively prime to
). This is thus a strengthening of Dirichlet’s theorem on primes in arithmetic progressions.
A small caveat is in order. The constant is not independent of
, because of the possibility of “exceptional” zeros of
-functions on the real axis.
2. L-functions
In order to prove Theorem 1, we will need an analogous analytic theory. Given as above, we might try studying the function
Unfortunately, the arithmetic progressions over which the sum is taken are not very “multiplicative.” A way around this is provided by the theory of -functions. To a Dirichlet character
mod
(which, as always, is defined to be zero on integers not prime to
), we might study the function
Then, by Fourier inversion
so that estimates for will imply estimates for
.
The function has a nice Dirichlet series: namely, if one writes
for , then
By Mellin inversion again, we can expect analytic properties of the logarithmic derivative to yield information about the partial sums
.
3. Bounds on the L-function
The -function
, initially defined for
, has an meromorphic continuation to complex plane. If
is not the trivial character
, then
is entire; if
is the trivial character, then
has a simple pole at
. We will need this in the following, as the strategy behind the proof of the prime number theorem is to shift the contour of integration in Mellin inversion as far inside the strip
as possible.
There are a number of basic estimates for analogous to those for
. The notation
,
, will be in use below.
Proposition 2 Let
be nontrivial. In any region
(
), we have
The bounds are uniformly in , though later bonds probably will not be. Proof: We can use partial summation (or integration). Let
. Then clearly, for any
,
This follows by integration by parts. The function is uniformly bounded by
. Take
; a similar method as in the bound for
can now be applied.
I’ve omitted some details; they are explained (for the ordinary zeta function) in Montgomery and Vaughn’s book, or in Ingham’s older book.
This bound implies, in particular, that grows sublinearly in the imaginary part in the strip
.
Using this, one can prove a similar factorization as for . Let
be
if
is even, and
if
is odd. Define the function
Then this function can be shown to be entire. One has the functional equation
where is a complex number of modulus one.
Using Stirling’s formula and these estimates, one finds that
when . By the functional equation, this is true in general. Hadamard’s factorization theorem allows us to express
In particular, we get a partial fraction decomposition for . As in the case for
, one can obtain bounds for the number of zeros of
in a rectangle (using Jensen’s inequality).
4. The approximate partial fraction decomposition
We will next need an “approximate” partial fraction decomposition for the logarithmic derivative in terms of its roots in the critical strip (always denoted
). {Henceforth}, we will always be working in the case where
. The analysis when one works with all
is more complicated and is explained in the textbook.
As always, we use the notation
The decomposition is given by:
Proposition 3 For
(and
), we have
In order to prove this, we will need a general fact from complex analysis on the “approximate” expansion of logarithmic derivatives in partial fractions. Given a holomorphic function on a disk
of radius
, with zeros
in the disk (counted with multiplicities), one might try to approximate
.
The following criterion gives a criterion to the extent to which one can do this:
Proposition 4 Let
be a holomorphic function in a neighborhood of the disk
. Suppose
. Then for any
and
, we have
where the
are the zeros in
.
The proof this result requires a little work; it is explained in Montgomery and Vaughn’s book, and if I get time I will try to blog about it separately.
Applying it, and using the fact that grows at most linearly in the strip
(for
in the principal case), we can get the result.
As a result, we can bound below the real part of the logarithmic derivative.
Corollary 5 For
, we have
for a constant
.
Proof: In fact, the terms occurring in the sum all have positive real part when .
5. The trigonometric inequality
Suppose that had a zero at
where
was very close to
, say
for
. Then (1) shows that at a value
, we have that
is very large for close to zero. This is not too surprising: if there were a zero at
itself, then (2) would actually tend to
as
. The partial fraction expansion will allow us to say something a little weaker when there are roots close to
.
Nonetheless, there will be a problem with the largeness of (2). This is shown by the following:
Proposition 6 Let
. Then for any
,
Proof: This is established using a trigonometric argument. Namely,
Adding gives
This is because, for any complex number
of modulus
,
has nonnegative real part. This is precisely the trigonometric inequality
.
In view of this, the earlier inequalities, and the fact that has a simple pole with residue
at
, we can write
In other words, we can get a bound on the real part
This valid for and
.
6. The zero-free region
We can now see directly that is zero-free on
. In fact, this follows from (3). Suppose there were a zero at
, we could take
close to
, and observe that the term
is asymptotically
as
. The term
is asymptotically
if
is the order of the zero at
(so
clearly). The last term is bounded below as
, since
has at worst a zero at
(not a pole). In total, we get
as . This clearly contradicts (3).
Alternatively, we could use (4) (which we’ve established only for , though); if we had a zero at
, then at
, we have
for
the order of the zero. This contradicts (4).
A key component in this argument was that ; this will be used below in the refinement.
Theorem 7 Fix
. Then there exists a
such that
has no roots in
.
The constants here will depend on the choice of , though not if we restrict to points with
.
Proof: In fact, we will use a similar argument, except we will use (1) to bound below . Fix
. Suppose that there exists a root
. We assume
.
Let us recall (1):
where the sum is over all sufficiently close to
. If
, then we observe that all the terms in the sum have positive real part. It follows that
for some constant , if
is sufficiently close to
(so that
occurs in the sum). In other words, we have just taken one of the terms in the sum.
If we take where
is sufficiently small, we get
Let for
; then we have
We also know that, by (4),
This means that the lower bound is at most the upper bound:
for any . Take a large constant
, and set
. We get
or
which clearly means that for some constant
.
In general, we have
and
Combining these, we will get a contradiction if is sufficiently small. In fact, (3) gives here
This inequality has to hold for all . If
is sufficiently small, this will be impossible. Pick a large constant
, and let
. Then we have
If is chosen such that
, then it is easy to see that this is impossible for
sufficiently small (independently of
).
7. Remarks
Something stronger is proved in the textbook “Multiplicative Number Theory” by Montgomery and Vaughn; there is an absolute constant such that most of the conclusion about the zero-free region for holds simultaneously for every
. The caveat is that there is allowed to be one real zero in the region when
is quadratic. (No example is known, though.) This requires more careful estimates.
Leave a Reply