Lably
Skip to content

Generalized Riemann hypothesis

Mathematical conjecture about zeros of L-functions

  • 9 min read
  • 3 chapters

Related on Lably

Through Conjecture, Mathematics and Complex number

Global L-functions can be associated to elliptic curves, number fields (in which case they are called Dedekind zeta-functions), Maass forms, and Dirichlet characters (in which case they are called Dirichlet L-functions). When the Riemann hypothesis is formulated for Dedekind zeta-functions, it is known as the extended Riemann hypothesis (ERH) and when it is formulated for Dirichlet L-functions, it is known as the generalised Riemann hypothesis (GRH). Another approach to generalization of Riemann hypothesis was given by Atle Selberg and his introduction of class of function satisfying certain properties rather than specific functions, nowadays known as Selberg class. These three statements will be discussed in more detail below. (Many mathematicians use the label generalized Riemann hypothesis to cover the extension of the Riemann hypothesis to all global L-functions, not only the special case of Dirichlet L-functions.)

Generalized Riemann hypothesis (GRH)

The Generalized Riemann hypothesis asserts that all nontrivial zeros of Dirichlet L-function L(χ,s) for primitive Dirichlet character χ have real part 12.

The generalized Riemann hypothesis for Dirichlet L-functions was probably formulated for the first time by Adolf Piltz in 1884. It is important to assume primitivity of the character, since for nonprimitive characters, L-functions have infinitely many zeros off this line and do not satisfy the functional equation that is used to distinguish between trivial and nontrivial zeros.

Background

A Dirichlet character χ:Z→C of modulus q is an arithmetic function that is:

For such a character χ, we define the corresponding Dirichlet L-function by:

L(χ,s)=∑n=1∞χ(n)ns

For every complex number s such that Re s > 1 this series is absolutely convergent. By analytic continuation, this function can be extended to a meromorphic function on the complex plane having only a possible pole in s=1, when the character is principal (has only 1 as value for numbers coprime to k). For nonprincipal characters, the series is conditionally convergent for Re⁡(s)>0 and the analytic continuation is an entire function.

We say that the Dirichlet character χ is imprimitive if it is induced by another Dirichlet character χ⋆ of lesser modulus:

χ(n)={χ⋆(n),ifgcd(n,q)=10,ifgcd(n,q)≠1

Otherwise we say that the character is primitive. Generally most statements for Dirichlet L-functions are easier to express for versions with primitive characters. Using Euler products of Dirichlet L-functions, we can express the L-function of an imprimitive character χ as a function of the character χ⋆ that induces it:

L(s,χ)=L(s,χ⋆)∏p|q(1−χ⋆(p)ps)

From the factors in this equation we have infinitely many zeros on the line Re⁡(s)=0. For primitive Dirichlet character, the L-function satisfies a certain functional equation which allows us to define trivial zeros of L(s,χ) as zeros corresponding to poles of the gamma function in this equation:

  • If χ(−1)=1, then all trivial zeros are simple zeros in negative even numbers. If L(s,χ)≠ζ(s) it also includes 0.
  • If χ(−1)=−1 then all trivial zeros are simple zeros in negative odd numbers.

Any other zeros are called nontrivial zeros. The functional equation guarantees that nontrivial zeros lie in the critical strip 0<Re⁡(s)<1 and are symmetric with respect to the critical line Re⁡(s)=12. The Generalized Riemann Hypothesis says that all nontrivial zeros lie exactly on this line.

Consequences of GRH

Like the original Riemann hypothesis, the GRH has far-reaching consequences about the distribution of prime numbers:

  • Taking the trivial character χ(n)=1 yields the ordinary Riemann hypothesis.
  • More effective version of Dirichlet's theorem on arithmetic progressions: Let π(x,a,d) where a and d are coprime denote the number of prime numbers in arithmetic progression n⋅d+a which are less than or equal to x. If the generalized Riemann hypothesis is true, then for every ε > 0:
π(x,a,d)=Li⁡(x)φ(d)+O(x1/2+ε) as x→∞,
where φ is Euler's totient function, Li⁡(x)=∫2x1ln⁡tdt is the Logarithmic Integral, and O is the Big O notation. This is a considerable strengthening of the prime number theorem.
  • Every proper subgroup of the multiplicative group (Z/nZ)× has a set of generators less than 2ln⁡(n)2. In other words, every subgroup of multiplicative group omits a number less than 2ln⁡(n)2, as well as a number coprime to n less than 3ln⁡(n)2. This has many consequences in computational number theory:
    • In 1976, G. Miller showed that the Miller-Rabin test is guaranteed to run in polynomial time. In 2002, Manindra Agrawal, Neeraj Kayal and Nitin Saxena proved unconditionally that the AKS primality test is guaranteed to run in polynomial time.
    • The Shanks–Tonelli algorithm is guaranteed to run in polynomial time.
    • The Ivanyos–Karpinski–Saxena deterministic algorithm for factoring polynomials over finite fields with prime constant-smooth degrees is guaranteed to run in polynomial time.
  • For every prime p there exists a primitive root mod p (a generator of the multiplicative group of integers modulo p) that is less than O((ln⁡p)6).
  • Estimate of the character sum in the Pólya–Vinogradov inequality can be improved to O(qlog⁡log⁡q), q being the modulus of the character.
  • In 1913, Grönwall showed that the generalized Riemann hypothesis implies that Gauss's list of imaginary quadratic fields with class number 1 is complete, though Baker, Stark and Heegner later gave unconditional proofs of this without using the generalized Riemann hypothesis.
  • In 1917, Hardy and Littlewood showed that the generalized Riemann hypothesis implies a conjecture of Chebyshev that limx→1−∑p>2(−1)(p+1)/2xp=+∞ (where the sum extends over all odd primes p). This says that primes 3 mod 4 are more common than primes 1 mod 4 in some sense. (For related results, see Prime number theorem § Prime number race.)
  • In 1923, Hardy and Littlewood showed that the generalized Riemann hypothesis implies Goldbach weak conjecture for sufficiently large odd numbers. In 1997 Deshouillers, Effinger, te Riele, and Zinoviev showed that actually 5 is sufficiently large, so GRH implies weak Goldbach conjecture. In 1937 Vinogradov gave an unconditional proof for sufficiently large odd numbers. The yet to be verified proof of Harald Helfgott improved Vinogradov's method by verifying GRH for several thousand small characters up to a certain imaginary part to prove the conjecture for all integers above 1029, integers below which have already been verified by calculation.
  • In 1934, Chowla showed that the generalized Riemann hypothesis implies that the first prime in the arithmetic progression a mod m is at most Km2log⁡(m)2 for some fixed constant K.
  • In 1967, Hooley showed that the generalized Riemann hypothesis implies Artin's conjecture on primitive roots.
  • In 1973, Weinberger showed that the generalized Riemann hypothesis implies that Euler's list of idoneal numbers is complete.
  • Ono & Soundararajan (1997) showed that the generalized Riemann hypothesis implies that Ramanujan's integral quadratic form x2 + y2 + 10z2 represents all integers that it represents locally, with exactly 18 exceptions.

Sign in to keep reading

2 more chapters are free with a Lably account.

More in Topics in mathematics