Scribd
Upload
106 views

Lecture 1

This document outlines the topics to be covered in a course on analytic number theory over 13 lectures. The lectures will cover Dirichlet's proof of an infinite number of primes in arithmetic progressions using Dirichlet characters and L-functions, the prime number theorem in arithmetic progressions, Linnik's theorem on the least prime in an arithmetic progression, and Selberg's theorem on the logarithm of zeta on the half line. References for further reading are provided for each topic.

Uploaded by

Eric Parker
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
106 views

Lecture 1

This document outlines the topics to be covered in a course on analytic number theory over 13 lectures. The lectures will cover Dirichlet's proof of an infinite number of primes in arithmetic progressions using Dirichlet characters and L-functions, the prime number theorem in arithmetic progressions, Linnik's theorem on the least prime in an arithmetic progression, and Selberg's theorem on the logarithm of zeta on the half line. References for further reading are provided for each topic.

Uploaded by

Eric Parker
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Topics in analytic number theory, Lent 2013.

Lecture 1: Overview
Bob Hough
January 30, 2013
Outline of course. *Lecture numbers are approximate. References are supplementary lecture notes will be provided.
Dirichlets proof of an of primes in arithmetic progressions: basic theory of Dirichlet characters and Dirichlet L-functions, functional equation,
analytic continuation, bounds (Lectures 1 4)
The Prime Number Theorem in Arithmetic Progressions: Hadamard product, counting zeros, the zero-free region, the explicit formula, Siegels theorem (Lectures 58). Reference to this point is Davenport [2], see also
Iwaniec and Kowalski [3] for Siegels theorem.
Linniks theorem on the least prime in an arithmetic progression: zero
density estimates near the edge of the critical strip, the large sieve, zero
repulsion, Turans power sum method (Lectures 9 14). References: primarily Bombieri [1], also Montgomery [4] for Turans method and Tenenbaum [6] for the large sieve.
Selbergs theorem on the logarithm of zeta on the half line: zero density
estimates near the half line, mollification, zeros and primes (Lectures 15
20). References: primarily Selberg [5], also Iwaniec and Kowalski [3]
Effective bound for the class number: splitting of small primes, brief introduction to the L-function of a modular form (Lectures 2124). Reference:
Iwaniec and Kowalski [3]

Definition of :
(s) =

X
1
,
s
n
n=1

s C, <(s) > 1.

Euler:
 Y
1
1
1
+
+
...
=
(1 1/ps )
(6= 0),
s
2s
p
p
p
p
X
XX 1
log (s) =
log(1 1/ps ) =
npns
p
p
n
(s) =

Y

1+

Since lim1 () = there are infinitely many primes.


1

<(s) > 1

Dirichlet:
= Dirichlet characters, (homomorphisms)
Consider G = (Z/qZ) . G
: (Z/qZ) {z C, |z| = 1},

(1) = 1, (ab) = (a)(b).

These satisfy the orthogonality



1 X
1
(a)(b) =
0
(q)

a b mod q
.
otherwise

0 is the trivial character, 0 (m) = 1 if (m, q) = 1, 0 otherwise.


Define on Z by (m) = (m) (reduction mod q), (m) = 0 if (m, q) > 1.
This is multiplicative. The Dirichlet L-function is

X
(n)
,
<(s) > 1
ns
n=1
Y
 Y
1
=
(1 (p)/ps )
1 + (p)/ps + (p2 )/p2s + ... =

L(s, ) =

log L(s, ) =

X X (pn )
p

npns

Dirichlet: for (a, q) = 1,


La,q (s) =

1 X
(a) log L(s, ) =
(q)

X
p,n
pn a mod q

1
.
npns

If lim1 La,q () = then there are infinitely many primes equivalent to a mod
q (the sum over prime powers converges, since, for any fixed p and for 1,
X 1
1

= (1 p )1 p2 2p2
n
np
pn

X
n2

and

p2

n2

n2 is uniformly bounded in 1.) Since

log L(s, 0 ) = log (s) +

log(1 1/ps )

p|q

is contained in the sum, it suffices to show for 6= 0 , log L(1, ) exists and is
bounded below. We are aiming toward this in the next couple of lectures.

References
[1] Enrico Bombieri. Le grand crible dans la theorie analytique des nombres.
Societe Mathematique de France, Paris, 1974. Avec une sommaire en anglais,
Asterisque, No. 18.
[2] Harold Davenport. Multiplicative number theory, volume 74 of Graduate
Texts in Mathematics. Springer-Verlag, New York, third edition, 2000. Revised and with a preface by Hugh L. Montgomery.
2

[3] Henryk Iwaniec and Emmanuel Kowalski. Analytic number theory, volume 53 of American Mathematical Society Colloquium Publications. American Mathematical Society, Providence, RI, 2004.
[4] Hugh L. Montgomery. Ten lectures on the interface between analytic number theory and harmonic analysis, volume 84 of CBMS Regional Conference
Series in Mathematics. Published for the Conference Board of the Mathematical Sciences, Washington, DC, 1994.
[5] Atle Selberg. Contributions to the theory of the Riemann zeta-function.
Arch. Math. Naturvid., 48(5):89155, 1946.
[6] Gerald Tenenbaum. Introduction to analytic and probabilistic number theory,
volume 46 of Cambridge Studies in Advanced Mathematics. Cambridge University Press, Cambridge, 1995. Translated from the second French edition
(1995) by C. B. Thomas.

You might also like