Skip to the passage panel
WikiLean · Articles Articles Brain Contribute About

Preliminary: these links have not yet had an independent audit.

Generalized Riemann hypothesis

67 passages9 formalized9 statement only22 partial27 not formalized

More ways to filter
Library
Passages
About this page

This page

  • Wikipedia revision 1359389111, pinned: the text here is that revision, not today's article.
  • WikiProject Mathematics: C-class, High importance
  • Annotated article on WikiLean.
  • 67 passages checked, 63 Lean locations (and 50 related declarations).

Central statements: 45 of the 67 passages state the article's subject or a named result or definition; the other 22 are supporting (examples, setup). Of these 45: 7 formalized, 7 statement only, 16 partial, 15 not formalized.

What the colours mean

  • Formalized a Lean declaration states it, proved, or a Lean definition defines it
  • Statement only Lean states it, but the proof is not finished
  • Partial Lean states part of it, or a more general or special form
  • Not formalized searched every library and not found

Libraries searched

Searched 48 Lean libraries, pinned 2026-10-17, 3 left out (library set u1).

How these links were made

  • Accuracy, from an audit of a sample of 224 items (blind, not independent): Strong links (exact, close or broad match) on supporting passages that have exactly the right relation: 92% (95% interval 49–99%), from 36 drawn of 1029, weighted by relation and library, an effective sample of 5.1; Links in a counting relation (exact, close, broad, narrow match or part) on supporting passages that have exactly the right relation: 73% (95% interval 40–92%), from 48 drawn of 1740, weighted by relation and library, an effective sample of 8.1; Central and subject passages whose formalization status is right: 86% (95% interval 73–94%), from 44 drawn of 1905, weighted by recorded status, an effective sample of 42; 'Not formalized' on supporting passages that is right (no declaration in the 48 libraries states it): 60% (95% interval 25–87%), from 12 drawn of 1236, weighted by article, an effective sample of 6.1.
  • Audit run tierA-batch1-audit, run by jack, 2 Nov 2026, 21:10 – 3 Nov 2026, 02:10 UTC: judged by Claude Opus 5.5 (claude-opus-5-5).
  • Record set tierA-b1b (cf-locate-recordset/2, statuses by status rule 3), exported 1 Nov 2026 by formal-companion at commit d85385a.
  • Seal sha256 23710337d053e8212378a9e580805628bcdfda61a6fc431e65f24a4a16c9e602.
  • Inventory run inv-tierA-b1r, run by jack, 30 Oct 2026, 07:23–20:00 UTC: worker Claude Opus 5 (claude-opus-5), reviewer Claude Opus 5 (claude-opus-5). It listed the formal passages, each with its kind and prominence, that the locate run then searched.
  • Locate run loc-tierA-b1b, run by jack, 31 Oct 2026, 04:59 – 1 Nov 2026, 03:06 UTC: worker Claude Opus 5 (claude-opus-5), reviewer Claude Opus 5 (claude-opus-5).
  • Challenge run chal-tierA-b1, run by jack, 1 Nov 2026, 03:19–14:25 UTC: worker Claude Opus 5 (claude-opus-5), reviewer Claude Opus 5 (claude-opus-5). In this article it re-checked every Lean location and absence on a central or subject passage (50 locations and 15 absences); on supporting passages, a seeded sample (seed 0; drawn at 0.5 for strong matches, 0.2 for weaker links and 0.25 for absences): 7 of 13 locations and 4 of 12 absences. In all, 57 of 63 Lean locations (90%) and 19 of 27 absences (70%) were re-checked.
  • Passage text: 67 of 67 passages shown in full, each the slice of the pinned revision's text that its record's span sha256 hashes, checked when the store was built.
  • Lean code: each declaration's type, from the declaration corpus of universe u1 (built 18 Oct 2026, sha256 a364fd6aede5), at the commit its card links.

How the text is shown

Each passage is shown in full, as revision 1359389111 states it (checked against its record's span hash when the store was built). Where a passage is only part of a sentence, it is highlighted and the rest of the sentence is shown in grey around it, from the same copy of the revision; a list item also shows the sentence that introduces it. Formulas are drawn from their TeX; hover one to see it.

Each card's Lean code is its declaration's type as Lean prints it, from the declaration corpus of library set u1 at the card's commit, laid out as a header: binders before the colon, then the hypotheses as arrows (the corpus keeps no hypothesis names) and the conclusion, in Mathlib's notation (𝓝, π, R[X], Type*). It is not the source text; Source opens that.

Select a highlighted passage to see where Lean formalizes it.

The Riemann hypothesis is one of the most important conjectures in mathematics. It is a statement about the zeros of the Riemann zeta function. Various geometrical and arithmetical objects can be described by so-called global L-functions, which are formally similar to the Riemann zeta-function. One can then ask the same question about the zeros of these L-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 the algebraic function field case (not the number field case).

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 ) {\textstyle L(\chi ,s)} for primitive Dirichlet character χ {\displaystyle \chi } have real part 1 2 {\textstyle {\frac {1}{2}}} .

The generalized Riemann hypothesis for Dirichlet L-functions was probably formulated for the first time by Adolf Piltz in 1884.[1] 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.[2]

Background

A Dirichlet character χ : Z → C {\textstyle \chi :\mathbb {Z} \rightarrow \mathbb {C} } of modulus q is an arithmetic function that is:

  • completely multiplicative: χ ( a ⋅ b ) = χ ( a ) ⋅ χ ( b ) {\textstyle \chi (a\cdot b)=\chi (a)\cdot \chi (b)}
  • periodic: χ ( n + q ) = χ ( n ) {\textstyle \chi (n+q)=\chi (n)}
  • χ ( n ) = 0 {\textstyle \chi (n)=0} if and only if gcd ( n , q ) > 1 {\textstyle \gcd(n,q)>1} .

For such a character χ {\textstyle \chi } , we define the corresponding Dirichlet L-function by:

L ( χ , s ) = ∑ n = 1 ∞ χ ( n ) n s {\displaystyle L(\chi ,s)=\sum _{n=1}^{\infty }{\frac {\chi (n)}{n^{s}}}}

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 {\textstyle 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 {\textstyle \operatorname {Re} (s)>0} and the analytic continuation is an entire function.

We say that the Dirichlet character χ {\textstyle \chi } is inprimitive if it is induced by another Dirichlet character χ ⋆ {\textstyle \chi ^{\star }} of lesser modulus:

χ ( n ) = { χ ⋆ ( n ) , i f gcd ( n , q ) = 1 0 , i f gcd ( n , q ) ≠ 1 {\displaystyle \chi (n)={\begin{cases}\chi ^{\star }(n),&\mathrm {if} \gcd(n,q)=1\\0,&\mathrm {if} \gcd(n,q)\neq 1\end{cases}}}

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 χ {\textstyle \chi } as a function of the character χ ⋆ {\textstyle \chi ^{\star }} that induces it:

L ( s , χ ) = L ( s , χ ⋆ ) ∏ p | q ( 1 − χ ⋆ ( p ) p s ) {\displaystyle L(s,\chi )=L(s,\chi ^{\star })\prod _{p\,|\,q}\left(1-{\frac {\chi ^{\star }(p)}{p^{s}}}\right)}

From the factors in this equation we have infinitely many zeros on the line Re ⁡ ( s ) = 0 {\textstyle \operatorname {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 , χ ) {\textstyle L(s,\chi )} as zeros corresponding to poles of the gamma function in this equation:

  • If χ ( − 1 ) = 1 {\textstyle \chi (-1)=1} , then all trivial zeros are simple zeros in negative even numbers. If L ( s , χ ) ≠ ζ ( s ) {\textstyle L(s,\chi )\neq \zeta (s)} it also includes 0.
  • If χ ( − 1 ) = − 1 {\textstyle \chi (-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 {\textstyle 0<\operatorname {Re} (s)<1} and are symmetric with respect to the critical line Re ⁡ ( s ) = 1 2 {\textstyle \operatorname {Re} (s)={\tfrac {1}{2}}} . 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 {\textstyle \chi (n)=1} yields the ordinary Riemann hypothesis.
  • More effective version of Dirichlet's theorem on arithmetic progressions: Let π ( x , a , d ) {\textstyle \pi (x,a,d)} where a and d are coprime denote the number of prime numbers in arithmetic progression n ⋅ d + a {\textstyle n\cdot d+a} which are less than or equal to x. If the generalized Riemann hypothesis is true, then for every ε > 0:
π ( x , a , d ) = 1 φ ( d ) ∫ 2 x 1 ln ⁡ t d t + O ( x 1 / 2 + ε )  as    x → ∞ , {\displaystyle \pi (x,a,d)={\frac {1}{\varphi (d)}}\int _{2}^{x}{\frac {1}{\ln t}}\,dt+O(x^{1/2+\varepsilon })\quad {\mbox{ as }}\ x\to \infty ,}
where φ {\displaystyle \varphi } is Euler's totient function and O {\displaystyle O} is the Big O notation. This is a considerable strengthening of the prime number theorem.
  • Every proper subgroup of the multiplicative group ( Z / n Z ) × {\textstyle (\mathbb {Z} /n\mathbb {Z} )^{\times }} has a set of generators less than 2 ln ⁡ ( n ) 2 {\textstyle 2\ln(n)^{2}} . In other words, every subgroup of multiplicative group omits a number less than 2 ln ⁡ ( n ) 2 {\textstyle 2\ln(n)^{2}} , as well as a number coprime to n {\displaystyle n} less than 3 ln ⁡ ( n ) 2 {\textstyle 3\ln(n)^{2}} .[3] 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[4] 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 ) . {\displaystyle O((\ln p)^{6}).} [5]
  • Estimate of the character sum in the Pólya–Vinogradov inequality can be improved to O ( q log ⁡ log ⁡ q ) {\textstyle O\left({\sqrt {q}}\log \log q\right)} , 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 lim x → 1 − ∑ p > 2 ( − 1 ) ( p + 1 ) / 2 x p = + ∞ , {\displaystyle \lim _{x\to 1^{-}}\sum _{p>2}(-1)^{(p+1)/2}x^{p}=+\infty ,} which 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.[6]
  • In 1934, Chowla showed that the generalized Riemann hypothesis implies that the first prime in the arithmetic progression a mod m is at most K m 2 log ⁡ ( m ) 2 {\textstyle Km^{2}\log(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.
  • In 2021, Alexander (Alex) Dunn and Maksym Radziwill proved Patterson's conjecture on cubic Gauss sums, under the assumption of the GRH.[7][8]

Extended Riemann hypothesis (ERH)

Suppose K {\textstyle K} is a number field with ring of integers O K {\textstyle O_{K}} (this ring is the integral closure of the integers Z {\displaystyle \mathbb {Z} } in K). If I {\textstyle I} is a nonzero ideal of O K {\textstyle O_{K}} , we denote its norm by N ( I ) {\textstyle N(I)} . The Dedekind zeta-function of K is then defined by:

ζ K ( s ) = ∑ I ⊆ O K 1 N ( I ) s {\displaystyle \zeta _{K}(s)=\sum _{I\subseteq O_{K}}{\frac {1}{N(I)^{s}}}}

for every complex number s with real part > 1. The sum extends over all non-zero ideals I {\textstyle I} of O K {\textstyle O_{K}} . That function can be extended by analytic continuation to the meromorphic function on complex plane with only possible pole at s = 1 {\textstyle s=1} and satisfies a functional equation that gives exact location of trivial zeroes and guarantees that nontrivial zeros lie inside critical strip 0 ≤ Re ⁡ ( s ) ≤ 1 {\textstyle 0\leq \operatorname {Re} (s)\leq 1} and are symmetric with respect to critical line: Re ⁡ ( s ) = 1 2 {\textstyle \operatorname {Re} (s)={\tfrac {1}{2}}} .

The extended Riemann hypothesis asserts that for every number field K each nontrivial zero of ζ K {\textstyle \zeta _{K}} has real part 1 2 {\textstyle {\tfrac {1}{2}}} (and thus lies on the critical line).

Consequences of ERH

  • The ordinary Riemann hypothesis follows from the extended one if one takes the number field to be Q {\displaystyle \mathbb {Q} } , whose ring of integers is: O Q = Z {\displaystyle O_{\mathbb {Q} }=\mathbb {Z} } .
  • Generalized Riemann hypothesis for Dirichlet L-functions is equivalent to ERH for K being abelian extension of rational numbers, since for abelian extensions ζ K {\textstyle \zeta _{K}} is finite product of some Dirichlet L-functions depending on K. Conversely, all L-functions for character modulo n appears in product for K = Q ( ζ n ) {\textstyle K=\mathbb {Q} (\zeta _{n})} , where ζ n {\textstyle \zeta _{n}} is n-th primitive root of unity.
  • For general extensions, similar role to Dirichlet L-functions is played by Artin L-functions. Then, ERH is equivalent to Riemann Hypothesis for Artin L-functions.
  • The ERH implies an effective version[9] of the Chebotarev density theorem: if L/K is a finite Galois extension with Galois group G, and C a union of conjugacy classes of G, the number of unramified primes of K of norm below x with Frobenius conjugacy class in C is
| C | | G | ( Li ⁡ ( x ) + O ( x ( n log ⁡ x + log ⁡ | Δ | ) ) ) , {\displaystyle {\frac {|C|}{|G|}}{\Bigl (}\operatorname {Li} (x)+O{\bigl (}{\sqrt {x}}(n\log x+\log |\Delta |){\bigr )}{\Bigr )},}
where the constant implied in the big-O notation is absolute, n is the degree of L over Q, and Δ its discriminant.
  • Weinberger (1973) showed that ERH implies that any number field with class number 1 is either Euclidean or an imaginary quadratic number field of discriminant −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.

Generalized Riemann hypothesis for Selberg class

Selberg class is defined the following way:

We say that Dirichlet series F ( s ) = ∑ n = 1 ∞ a n n s {\textstyle F(s)=\sum _{n=1}^{\infty }{\frac {a_{n}}{n^{s}}}} is in Selberg class if it satisfies following properties:

  • Analyticity: F ( s ) {\displaystyle F(s)} has a meromorphic continuation to the entire complex plane, with the only possible pole (if any) in s = 1 {\textstyle s=1} .
  • Ramanujan conjecture: a1 = 1 and a n ≪ ε n ε {\displaystyle a_{n}\ll _{\varepsilon }n^{\varepsilon }} for any ε > 0;
  • Functional equation: there is a gamma factor of the form
γ ( s ) = Q s ∏ i = 1 k Γ ( ω i s + μ i ) {\displaystyle \gamma (s)=Q^{s}\prod _{i=1}^{k}\Gamma (\omega _{i}s+\mu _{i})}

where Q {\textstyle Q} is real and positive, Γ {\textstyle \Gamma } the gamma function, the ω i {\textstyle \omega _{i}} real and positive, and the μ i {\textstyle \mu _{i}} complex with non-negative real part, as well as a so-called root number: α ∈ C , | α | = 1 {\textstyle \alpha \in \mathbb {C} ,\;|\alpha |=1} , such that the function:

Φ ( s ) = γ ( s ) F ( s ) {\displaystyle \Phi (s)=\gamma (s)F(s)\,}

satisfies:

Φ ( s ) = α Φ ( 1 − s ¯ ) ¯ ; {\displaystyle \Phi (s)=\alpha \,{\overline {\Phi (1-{\overline {s}})}};}
  • Euler product: For Re(s) > 1, F(s) can be written as a product over primes:
F ( s ) = ∏ p F p ( s ) {\displaystyle F(s)=\prod _{p}F_{p}(s)}

with

F p ( s ) = exp ⁡ ( ∑ n = 1 ∞ b p n p n s ) {\displaystyle F_{p}(s)=\exp \left(\sum _{n=1}^{\infty }{\frac {b_{p^{n}}}{p^{ns}}}\right)}

and, for some θ < 1 2 {\textstyle \theta <{\tfrac {1}{2}}} ,

b p n = O ( p n θ ) . {\displaystyle b_{p^{n}}=O(p^{n\theta }).}

From analyticity follows that poles of gamma factor in Re ⁡ ( s ) < 1 {\textstyle \operatorname {Re} (s)<1} must be cancelled by zeros of F ( s ) {\textstyle F(s)} , that zeros are called trivial zeros. Functional equation guarantees that all nontrivial zeros lie in critical strip 0 < Re ⁡ ( s ) < 1 {\textstyle 0<\operatorname {Re} (s)<1} and are symmetric with respect to critical line Re ⁡ ( s ) = 1 2 {\textstyle \operatorname {Re} (s)={\tfrac {1}{2}}} .

Generalized Riemann hypothesis for Selberg class states that all nontrivial zeros of function F {\textstyle F} belonging to Selberg class have real part 1 2 {\textstyle {\tfrac {1}{2}}} 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 called L-functions or zeta functions and expected to satisfy counterparts or generalizations of Riemann hypothesis.

Consequences

  • Artin L-functions and Dedekind zeta functions belong to Selberg class, then Riemann Hypothesis for Selberg class implies extended Riemann hypothesis.
  • Nontrivial zeros for much more general L-functions than Dedekind zeta functions lie on critical lines. One example can be Ramanujan L-function related to modular form called Dedekind eta function. Despite Ramanujan L-function itself don't belong to Selberg class and its critical line is Re ⁡ ( s ) = 6 {\displaystyle \operatorname {Re} (s)=6} , function obtained by translation of 11 2 {\displaystyle {\tfrac {11}{2}}} is in Selberg class.

See also

References

  1. ^ Davenport, Harold (2000). Multiplicative Number Theory. Graduate Texts in Mathematics. Vol. 74. Revised and with a preface by Hugh L. Montgomery (Third ed.). New York: Springer-Verlag. p. 124. ISBN 0-387-95097-4.
  2. ^ Rohrlich, David E. (2011). "Root numbers" (PDF). Arithmetic of L-functions. IAS/Park City Mathematics Series. Vol. 18. Providence, Rhode Island: American Mathematical Society. pp. 353–448. doi:10.1090/pcms/018/13. ISBN 978-0-8218-5320-7. MR 2882696. See Exercise 1.1, pp. 374–375 (p. 23 of preprint version).
  3. ^ Bach, Eric (1990). "Explicit bounds for primality testing and related problems". Mathematics of Computation. 55 (191): 355–380. doi:10.2307/2008811. JSTOR 2008811.
  4. ^ 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. ISBN 9781605586090. S2CID 15895636.
  5. ^ Shoup, Victor (1992). "Searching for primitive roots in finite fields". Mathematics of Computation. 58 (197): 369–380. doi:10.2307/2153041. JSTOR 2153041.
  6. ^ p5. Helfgott, Harald (2013). "Major arcs for Goldbach's theorem". arXiv:1305.2897 [math.NT].
  7. ^ "Caltech Mathematicians Solve 19th Century Number Riddle". California Institute of Technology. October 31, 2022.
  8. ^ Dunn, Alexander; Radziwiłł, Maksym (2021). "Bias in cubic Gauss sums: Patterson's conjecture". arXiv:2109.07463 [math.NT].
  9. ^ Lagarias, J.C.; Odlyzko, A.M. (1977). "Effective Versions of the Chebotarev Theorem". Algebraic Number Fields: 409–464.

Further reading