Mathematical conjecture about zeros of L-functions
TheRiemann hypothesis is one of the most importantconjectures inmathematics. It is a statement about the zeros of theRiemann zeta function. Various geometrical and arithmetical objects can be described by so-called globalL-functions, which are formally similar to the Riemann zeta-function. One can then ask the same question about the zeros of theseL-functions, yielding various generalizations of the Riemann hypothesis. Many mathematicians believe these generalizations of the Riemann hypothesis to be true. The only cases of these conjectures which have been proven occur in thealgebraic function field case (not the number field case).
GlobalL-functions can be associated toelliptic curves,number fields (in which case they are calledDedekind zeta-functions),Maass forms, andDirichlet characters (in which case they are calledDirichletL-functions). When the Riemann hypothesis is formulated for Dedekind zeta-functions, it is known as theextended Riemann hypothesis (ERH) and when it is formulated for DirichletL-functions, it is known as thegeneralised Riemann hypothesis (GRH). Another approach to generalization of Riemann hypothesis was given byAtle 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 labelgeneralized Riemann hypothesis to cover the extension of the Riemann hypothesis to all globalL-functions, not only the special case of DirichletL-functions.)
Generalized Riemann hypothesis asserts that all nontrivial zeros of DirichletL-function for primitive Dirichlet character have real part.
The generalized Riemann hypothesis for DirichletL-functions was probably formulated for the first time byAdolf Piltz in 1884.[1]It is important to assume primitivity of character since for nonprimitive charactersL-functions have infinitely many zeros off this line and don't satisfy functional equation that is used to distinguish between trivial and nontrivial zeros.
If such character, we define the corresponding DirichletL-function by:
For everycomplex numbers such thatRes > 1 this series is absolutely convergent. Byanalytic continuation, this function can be extended tomeromorphic function on complex plane having only possible pole in, when character is principal (have only 1 as value for numbers coprime tok). For nonprincipal character, series is conditionally convergent for and analytic continuation isentire function.
We say that Dirichlet character isinprimitive if it is induced by another Dirichlet character of lesser modulus:
Otherwise we say that character isprimitive. Generally most statements for Dirichlet L-functions are easier to express for versions with primitive characters. Using Euler product of Dirichlet L-functions we can express L-function of imprimitive character by function of character that induces it:
From factors in this equation we have infinitely many zeros on line:.For primitive Dirichlet character L-function satisfies certainfunctional equation which allows us to definetrivial zeros of as zeros corresponding to poles of gamma function in this equation:
If, then all trivial zeros are simple zeros in negative even numbers. If it also includes 0.
If then all trivial zeros are simple zeros in negative odd numbers.
Any other zeros are callednontrivial zeros. Functional equation guarantees that nontrivial zeros lies in critical strip: and are symmetric with respect to critical line. Generalized Riemann Hypothesis says that all nontrivial zeros lies exactly on this line.
Like the original Riemann hypothesis, GRH has far-reaching consequences about the distribution ofprime numbers:
Taking trivial character yields the ordinary Riemann hypothesis.
More effective version ofDirichlet's theorem on arithmetic progressions: Let wherea andd are coprime denote the number of prime numbers in arithmetic progression which are less than or equal tox. If the generalized Riemann hypothesis is true, then for everyε > 0:
Every proper subgroup of the multiplicative group has set of generators less than. In other words, every subgroup of multiplicative group omits a number less than, as well as a number coprime to less than.[2] This has many consequences incomputational number theory:
In 1976, G. Miller showed thatMiller-Rabin test is guaranteed to run in polynomial time. In 2002, Manindra Agrawal, Neeraj Kayal and Nitin Saxena proved unconditionally thatAKS primality test is guaranteed to run in polynomial time.
The Ivanyos–Karpinski–Saxena deterministic algorithm[3] for factoring polynomials over finite fields with prime constant-smooth degrees is guaranteed to run in polynomial time.
For every primep there exists aprimitive root modp (a generator of the multiplicative group of integers modulop) that is less than[4]
Estimate of the character sum in thePólya–Vinogradov inequality can be improved to,q being the modulus of the character.
In 1913,Grönwall showed that the generalized Riemann hypothesis implies that Gauss'slist 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 which says that primes 3 mod 4 are more common than primes 1 mod 4 in some sense. (For related results, seePrime number theorem § Prime number race.)
In 1923, Hardy and Littlewood showed that the generalized Riemann hypothesis impliesGoldbach weak conjecture for sufficiently large odd numbers. In 1997Deshouillers, 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 ofHarald 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.[5]
In 1934, Chowla showed that the generalized Riemann hypothesis implies that the first prime in the arithmetic progressiona modm is at most for some fixed constantK.
for every complex numbers with real part > 1. The sum extends over all non-zero ideals of. That function can be extended by analytic continuation to the meromorphic function on complex plane with only possible pole at and satisfies a functional equation that gives exact location of trivial zeroes and guarantees that nontrivial zeros lie inside critical strip and are symmetric with respect to critical line:.
Theextended Riemann hypothesis asserts that for every number fieldK each nontrivial zero of has real part (and thus lies on the critical line).
The ordinary Riemann hypothesis follows from the extended one if one takes the number field to be, whose ring of integers is:.
Generalized Riemann hypothesis for Dirichlet L-functions is equivalent to ERH forK beingabelian extension of rational numbers, since for abelian extensions is finite product of some Dirichlet L-functions depending onK. Conversely, all L-functions for character modulon appears in product for, where isn-th primitive root of unity.
For general extensions, similar role to Dirichlet L-functions is played byArtin L-functions. Then, ERH is equivalent to Riemann Hypothesis for Artin L-functions.
The ERH implies an effective version[8] of theChebotarev density theorem: ifL/K is a finite Galois extension with Galois groupG, andC a union of conjugacy classes ofG, the number ofunramified primes ofK of norm belowx with Frobenius conjugacy class inC is
where the constant implied in the big-O notation is absolute,n is the degree ofL overQ, and Δ its discriminant.
Weinberger (1973) showed that ERH implies that any number field with class number 1 is eitherEuclidean or an imaginary quadratic number field ofdiscriminant −19, −43, −67, or −163.
Odlyzko (1990) discussed how the ERH can be used to give sharper estimates for discriminants and class numbers of number fields.
We say that Dirichlet series is in Selberg class if it satisfies following properties:
Analyticity: has a meromorphic continuation to the entire complex plane, with the only possible pole (if any) in.
Ramanujan conjecture:a1 = 1 and for any ε > 0;
Functional equation: there is a gamma factor of the form
where is real and positive, thegamma function, the real and positive, and the complex with non-negative real part, as well as a so-called root number:, such that the function:
satisfies:
Euler product: ForRe(s) > 1,F(s) can be written as a product over primes:
with
and, for some,
From analyticity follows that poles of gamma factor in must be cancelled by zeros of, that zeros are called trivial zeros. Functional equation guarantees that all nontrivial zeros lie in critical strip and are symmetric with respect to critical line.
Generalized Riemann hypothesis for Selberg class states that all nontrivial zeros of function belonging to Selberg class have real part and then lie on critical line.
Selberg class along with proposition of Riemann hypothesis for it was firs introduced in (Selberg 1992). Instead of considering specific functions, Selberg approach was to give axiomatic definition consisting of properties characterizing most of objects calledL-functions orzeta functions and expected to satisfy counterparts or generalizations of Riemann hypothesis.
ArtinL-functions and Dedekind zeta functions belong to Selberg class, then Riemann Hypothesis for Selberg class implies extended Riemann hypothesis.
Nontrivial zeros for much more generalL-functions than Dedekind zeta functions lie on critical lines. One example can beRamanujanL-function related to modular form calledDedekind eta function. Despite Ramanujan L-function itself don't belong to Selberg class and its critical line is, function obtained by translation of is in Selberg class.
^Ivanyos, Gabor; Karpinski, Marek; Saxena, Nitin (2009). "Schemes for deterministic polynomial factoring".Proceedings of the 2009 international symposium on Symbolic and algebraic computation (ISAAC). pp. 191–198.arXiv:0804.1974.doi:10.1145/1576702.1576730.ISBN9781605586090.S2CID15895636.
Weinberger, Peter J. (1973), "On Euclidean rings of algebraic integers",Analytic number theory ( St. Louis Univ., 1972), Proc. Sympos. Pure Math., vol. 24, Providence, R.I.: Amer. Math. Soc., pp. 321–332,MR0337902
Selberg, Atle (1992), "Old and new conjectures and results about a class of Dirichlet series",Proceedings of the Amalfi Conference on Analytic Number Theory (Maiori, 1989), Salerno: Univ. Salerno, pp. 367–385,MR1220477,Zbl0787.11037 Reprinted in Collected Papers, vol2, Springer-Verlag, Berlin (1991)