Zeta and L-functions
The Riemann zeta function, Dirichlet characters and L-functions, the Riemann Hypothesis and its generalization in the Mathlib forms, the explicit formula and theorems on primes, and the zeta functions of number fields.
Prerequisites: Class field theory, Complex analysis.
The Riemann zeta function and the Dirichlet L-functions are Dirichlet series with Euler products over the primes. The final theorem, riemannHypothesis, is about the zeros of , and the overview reaches it from EveryCharacter, about the zeros of all Dirichlet L-functions. With the zeta functions of number fields they are also inputs, to the explicit formula of ZeroFreeAll and the class number formula of the CM side. Chapter 3 defines analytic continuation and , and Chapter 5 defines Hecke L-functions.
The Riemann zeta function
Definition. For , the Riemann zeta function is the absolutely convergent series .
Theorem (Euler product; Euler, 1737). For , over the primes, and the product converges absolutely. So for .
Theorem (Riemann, 1859). The function extends to a meromorphic function on whose only pole is a simple pole at with residue : where is the Euler-Mascheroni constant. Also , and for each integer .
Remark (the value at the pole in Mathlib). Mathlib defines riemannZeta on all of , and riemannZeta_one says that its value at is . A statement about the zeros of riemannZeta must exclude by hand or use that this value is not zero.
Theorem (Hadamard, de la Vallée Poussin, 1896). for , hence for . This gives the prime number theorem .
The functional equation and the trivial zeros
Definition (completed zeta function). Put and .
Theorem (functional equation of the zeta function; Riemann, 1859). The function is meromorphic on with simple poles at and only, and . An equivalent form, riemannZeta_one_sub in Mathlib, is
Definition (trivial zeros, critical strip). Since has poles at and has no zeros with , vanishes at : these are the trivial zeros. The set is the critical strip, and the zeros of in it are the nontrivial zeros.
Proposition. The zeros of are the trivial zeros and the nontrivial zeros. The nontrivial zeros are the zeros of ; they are infinite in number and symmetric under and .
It follows from for and the functional equation, which leaves only the trivial zeros , , in (and ). The step rh-of-right uses riemannZeta_one_sub and to move a zero with to the zero with .
The Riemann Hypothesis
Definition (strip form). The Riemann Hypothesis (Riemann, 1859) is the statement: each zero of with has .
Definition (Mathlib form). Mathlib states the hypothesis as
def RiemannHypothesis : Prop :=
∀ (s : ℂ) (_ : riemannZeta s = 0) (_ : ¬∃ n : ℕ, s = -2 * (n + 1)) (_ : s ≠ 1),
s.re = 1 / 2
It says that each zero of other than the trivial zeros and the point has . Since riemannZeta 1 is not zero, the hypothesis does no work.
Proposition. RiemannHypothesis is equivalent to the strip form: by the previous section, a zero that is neither trivial nor lies in the critical strip, and each zero in the strip is neither.
The theorem riemannHypothesis proves RiemannHypothesis. It is the theorem rhOfAll, restated as riemannZeta_eq_zero_re in Main.lean.
Dirichlet characters
Fix an integer .
Definition. A Dirichlet character modulo is a group homomorphism , extended to by when and otherwise. The number is the modulus. The trivial character modulo is at each prime to . The order of is its order in the group of the characters modulo . Since , the parity is : is even if and odd if .
Example. Modulo there are two characters. The nontrivial one, , has and ; it is odd, of order .
Definition (conductor). Let . The character modulo is induced from modulo if for each prime to . The conductor of is the least such , and is primitive if its conductor is .
Each is induced from exactly one primitive , of modulus the conductor of ; the trivial character modulo induces each trivial character. In Mathlib, χ.IsPrimitive means conductor χ = N. By Chapter 5, primitive characters of conductor are the finite order Hecke characters of of conductor , and characters modulo are characters of .
EveryCharacter is about each character of each modulus, primitive or not, while VWin and the branch ZeroFreeAll (step 7 of the theta matching chapter) are about primitive characters PChar.
Dirichlet L-functions
Definition. Let be a Dirichlet character modulo . For , the Dirichlet L-function is
Theorem. extends to a meromorphic function on . It is entire if is nontrivial; if is trivial, its only pole is a simple pole at . For , (Davenport, ch. 9).
Mathlib defines DirichletCharacter.LFunction χ s on all of as , with the Hurwitz zeta function . It equals the series for and is entire for , and LFunction_modOne_eq says it is riemannZeta for .
Proposition (imprimitive characters). Let modulo be induced from the primitive . Then For with , the factor vanishes where ; since , these are infinitely many points on . For , , so the factor has no zeros there.
Example. For the trivial character modulo , , which vanishes at for each .
Gauss sums and the functional equation
Definition. The Gauss sum of modulo is . If is primitive, .
Theorem (functional equation). Let be primitive modulo with , , and put . Then
and the constant has absolute value (Davenport, ch. 9). In Mathlib this is IsPrimitive.completedLFunction_one_sub.
Since , the zeros of in the strip are symmetric under . For primitive , for , and the zeros outside the strip are the trivial zeros .
The step imprimitive proves the relation with LFunction_changeLevel and passes from primitive to all characters through the bound . The epsilon factors of ThetaIntegralsAgree contain local Gauss sums, the analogue of at a place.
Zeros and the Generalized Riemann Hypothesis
Definition (order of a zero). Let be holomorphic near and not identically . The order of a zero, or multiplicity , of at is the least with . In sums over the zeros of an L-function, each zero counts times.
Definition. The Generalized Riemann Hypothesis for Dirichlet L-functions is the statement: for each Dirichlet character , each zero of with has .
The proof states GRH in three forms with the Mathlib LFunction, for every ([NeZero N]) and every : DirichletCharacter ℂ N:
DirichletLNonvanishingRightOfHalf, the statement EveryCharacter: if and ( or ), then . The condition removes only the pole of the trivial character.DirichletLZerosOnLine: if and , then . The strict bound is needed because imprimitive characters have zeros on .PrimitiveDirichletLZerosOnLine: the same, for primitive .
By the symmetry , no zeros with means no zeros off the line in the strip. Main.lean derives the three forms as LFunction_ne_zero_of_half_lt_re, LFunction_eq_zero_re and LFunction_eq_zero_re_of_isPrimitive.
The step all-chi proves EveryCharacter, and rh-of-every applies it at , where . The field logDerOne of ThetaLocalInputs counts zeros with their orders: for primitive modulo , the sum over the zeros with and .
Primes and the explicit formula
Definition. The von Mangoldt function is if with prime and , and otherwise. For ,
Theorem (explicit formula; von Mangoldt, 1895). Let . For not a prime power, where runs over the nontrivial zeros with multiplicity and the sum is . In the form of Guinand (1948) and Weil (1952): let be even, smooth and compactly supported on , let , and write . Then
So sums over primes control sums over zeros: a zero with makes a prime sum grow like , and a bound on a suitable prime sum excludes zeros with .
The branch ZeroFreeAll (step 7 of the theta matching chapter) uses , with Euler's constant , and its character twists. Its lemma FormB turns a bound on long windows into for , and ZeroFreeAll from Green, VWin and HypsAlt assembles it.
Primes in progressions and in short intervals
Theorem (Dirichlet's theorem, 1837). Let and . There are infinitely many primes , and . The proof uses for each nontrivial modulo .
Theorem (Linnik, 1944). There are absolute constants such that for each and each prime to , the least prime is at most . One can take (Xylouris, 2011).
Theorem (primes in short intervals). For each , as (Huxley, 1972). For large , contains a prime (Baker, Harman and Pintz, 2001). Under RH, for some absolute , each interval with contains a prime (Cramér, 1920). See prime gaps.
The Chebotarev density theorem
Let be a finite Galois extension of number fields with group . Chapter 4 defines the Frobenius class of a prime of unramified in .
Theorem (Chebotarev, 1926). For a conjugacy class , the primes of unramified in with have natural density : The same holds for the primes of degree one (those with prime), since the others have density .
Example. For and , , and the theorem gives Dirichlet's density .
ThetaLocalInputs states Linnik's theorem as linnik, the input hLit : LitThin of HypsAlt asks for three statements ShortIntervalPrimes, and chebotarevDegreeOne of UnitaryGroupThirdPlaceHypotheses is Chebotarev for primes of degree one.
Zeta functions of number fields
Let be a number field with real and complex places, discriminant , class number , regulator , and roots of unity (Chapter 4).
Definition. The Dedekind zeta function of is for , the sum over the nonzero ideals of . It is the Hecke L-function of the trivial character.
Definition (partial zeta function). Let be a modulus and a class in the ray class group modulo . The partial zeta function is , over the integral ideals in . For a character of the ray class group, , and by orthogonality is an average of these . So it is meromorphic on , with a simple pole at , and has a functional equation.
Theorem (class number formula; Dirichlet, 1839; Dedekind, 1877). has a simple pole at with residue For an imaginary quadratic field of discriminant , with the quadratic character , and for this gives .
Theorem (Kronecker limit formula; Kronecker, 1863). For in the upper half plane and , let . Then, with Dedekind's eta function , Summed over the ideal classes of an imaginary quadratic field, it computes , which leads to the Chowla-Selberg formula.
Theorem (Siegel-Klingen; Klingen, 1962; Siegel, 1970). Let be totally real and a ray class modulo . For each integer , is rational.
Theorem (Deligne-Ribet, 1980). These rational values satisfy -adic congruences, which give the -adic L-functions of . In one form: for an integral ideal prime to , each ray class modulo and each ,
The CM divisibility chapter states the Chowla-Selberg mean , proved with the Kronecker limit formula (tendsto_realEisenstein_sub_pole) and the class number formula (LFunction_one_eq_classNumber). The record of CM inputs holds SiegelKlingenDeligneRibet and PartialZetaFunctionalEquation; only the second does work. The unitary hypotheses chapter uses a class number formula at each datum (StandardLattice.ClassNumberFormula₂), and the error term of the Weil bound chapter contains .
Further reading
- H. Davenport, Multiplicative Number Theory, 3rd ed., chapters 1, 4 to 9, 12 and 17.
- E. C. Titchmarsh, The Theory of the Riemann Zeta-Function, 2nd ed., chapters 2 and 3.
- H. Iwaniec and E. Kowalski, Analytic Number Theory, chapters 5 (5.5, the explicit formula) and 18 (Linnik).
- J. Neukirch, Algebraic Number Theory, chapter VII (Dedekind zeta, Hecke L-functions, Chebotarev, class number formula).
- S. Lang, Elliptic Functions, chapter 20 (the Kronecker limit formula).
The source of this page. Markdown. Something is wrong? Report it.