Riemann hypothesis

Riemann hypothesis
No machine-readable author provided. Conscious assumed (based on copyright claim · CC BY-SA 3.0 · source
Name	Riemann hypothesis
Field	Mathematics
Proposer	Bernhard Riemann
Year	1859
Status	Unproven (open problem)

Riemann hypothesis is a central open problem in Mathematics originally proposed in 1859 by Bernhard Riemann, concerning the nontrivial zeros of the Riemann zeta function and their distribution on the critical line in the complex plane. It is one of the seven Millennium Prize Problems posed by the Clay Mathematics Institute and has profound implications across Number theory, Complex analysis, Mathematical physics, and the theory of L-functions. The problem attracts attention from researchers affiliated with institutions like Princeton University, Cambridge University, Harvard University, and organizations such as the American Mathematical Society and the European Mathematical Society.

Statement

The formal statement concerns the zeros of the analytic continuation of the Riemann zeta function ζ(s), defined initially by a Dirichlet series in the half-plane Re(s)>1 and extended via the functional equation involving the Gamma function and powers of π. The conjecture asserts that every nontrivial zero has real part one-half, i.e., lies on the "critical line" Re(s)=1/2 in the complex plane, a claim entwined with results from Bernhard Riemann's 1859 memoir and techniques related to the Euler product and Dirichlet characters. Equivalent formulations connect to the distribution of zeros in the critical strip and properties of entire functions arising from the completed zeta function ξ(s).

Historical background

Interest in zeros of ζ(s) traces to work on prime distribution by Leonhard Euler and later developments by Adrien-Marie Legendre and Carl Friedrich Gauss on prime counting, culminating in Bernhard Riemann's 1859 memoir that introduced complex methods and the contour integral approach used by George Pólya and G. H. Hardy. Subsequent milestones include Hardy's 1914 proof of infinitely many zeros on the critical line, results by J. E. Littlewood and Atle Selberg, and advances using trace formulas influenced by André Weil and Atiyah–Singer index theorem perspectives championed at institutions such as Institute for Advanced Study and École Normale Supérieure.

Connections to prime numbers and zeta function

The conjecture directly refines the error term in the Prime Number Theorem, first conjectured by Adrien-Marie Legendre and proved independently by Jacques Hadamard and Charles Jean de la Vallée-Poussin, by controlling oscillations in the explicit formulas connecting ζ(s) zeros to the prime counting function π(x). The Euler product links ζ(s) to prime powers, while the explicit formula derived via contour integration and residue calculus ties zeros to summatory functions studied by Dirichlet and Riemann. Consequences impact estimates in analytic techniques used by modern researchers at Institute for Advanced Study, Max Planck Institute for Mathematics, and groups around Andrew Wiles and Terence Tao.

Equivalent formulations and generalizations

Many statements are known to be equivalent, including criteria formulated by John von Neumann-style operators, spectral interpretations inspired by Hilbert–Pólya conjecture, and trace identities resembling the Selberg trace formula for modular forms and Maass forms. Generalizations include conjectures for Dirichlet L-functions, the Generalized Riemann Hypothesis studied by Peter Sarnak and Enrique Reyna, and vast frameworks in the Langlands program articulated by Robert Langlands. Cross-links to the Grand Riemann Hypothesis and properties of Artin L-functions show deep ties to representations studied by Emil Artin and Hecke operators.

Partial results and numerical verification

Significant partial results include Hardy's theorem, Levinson's proportion results refined by Conrey, density theorems by Atle Selberg and H. L. Montgomery, and zero-free region estimates by Vinogradov and Korobov. Extensive numerical verification of zeros on the critical line has been conducted by groups led by Alan Turing, Andrew Odlyzko, and teams at University of Illinois and University of Glasgow, checking billions of zeros consistent with the hypothesis. Computations leverage algorithms related to the Fast Fourier Transform and methods developed in computational centers like Los Alamos National Laboratory and ETH Zurich.

Approaches and major attempts at a proof

Approaches span analytic techniques from complex analysis and Fourier analysis, spectral methods suggested by Hilbert and Polya, random matrix models introduced by Freeman Dyson and Montgomery that connect to statistics of zeros resembling eigenvalues from Gaussian unitary ensemble studies, and arithmetic methods rooted in the Langlands correspondence pursued by Robert Langlands and Pierre Deligne. Notable claimed proofs and attempts have involved figures such as Louis de Branges, proposals invoking noncommutative geometry by Alain Connes, and approaches using trace formulas and automorphic representations developed by James Arthur.

Implications and consequences of a proof or disproof

A proof would yield optimal error bounds in the Prime Number Theorem family of results, sharpen estimates in analytic number theory affecting work by Paul Erdős, N. J. A. Sloane, and G. H. Hardy, and influence cryptographic assumptions used in systems influenced by research at RSA Laboratories and standards bodies. A disproof would force revisions across results conditional on the conjecture used in works by Andrew Wiles, Yitang Zhang, and many others, reshaping perspectives in the Langlands program, computational projects at Mathematical Sciences Research Institute, and theoretical physics connections explored by Edward Witten and Michael Berry.

Category:Unsolved problems in mathematics