Elliott–Halberstam

Elliott–Halberstam
Name	Elliott–Halberstam conjecture
Field	Number theory
Proposed	1968
Proponents	Peter D. T. A. Elliott; Heini Halberstam
Status	Open (conditional results)

Elliott–Halberstam is a conjecture in number theory about the distribution of primes in arithmetic progressions. It refines classical results such as those of Dirichlet's theorem on arithmetic progressions, Siegel–Walfisz theorem, and the Bombieri–Vinogradov theorem, asserting stronger uniformity for primes moduli up to large powers of x. The conjecture has influential connections to problems studied by Goldbach, twin primes, and work of Yitang Zhang and James Maynard.

Statement and conjecture

The conjecture asserts that for any fixed A>0 and any ε>0, the sum over moduli q ≤ x^{1−ε} of the maximum discrepancy between the count of primes up to x in reduced residue classes modulo q and the expected x/φ(q) is O(x / (log x)^A). This refines the conditional uniformity provided by Bombieri–Vinogradov theorem and strengthens distributional control beyond the range accessible by classical large sieve inequalities and the Generalized Riemann Hypothesis. In precise analytic terms it compares sums of the von Mangoldt function in arithmetic progressions against main terms given by φ(q), invoking techniques reminiscent of Dirichlet characters, L-function estimates, and spectral methods from the study of automorphic forms such as Maass form theory.

Historical background and origins

The conjecture was proposed in 1968 by Peter D. T. A. Elliott and Heini Halberstam in the context of advances following results of Atle Selberg, Enrico Bombieri, and Henryk Iwaniec. It responded to limitations of classical approaches of G. H. Hardy and John Littlewood to prime distribution and to developments from the Large sieve by Yu. V. Linnik and E. Bombieri. The formulation grew from investigations influenced by the Prime Number Theorem, work of Bernhard Riemann on zeros of the Riemann zeta function, and the emerging analytic machinery exemplified by Harald Bohr and Godfrey Harold Hardy; it also draws conceptual lineage from research by Atle Selberg and Paul Erdős on sieve methods.

Mathematical implications and consequences

If true, the conjecture would imply striking results about primes in short intervals and in arithmetic progressions beyond current reach, enabling unconditional breakthroughs on conjectures formerly approachable only under assumptions like the Generalized Riemann Hypothesis. Notably, it would yield bounded gaps between primes and strengthen results connected to the Hardy–Littlewood prime k-tuple conjecture, the binary Goldbach problem, and distributional claims employed in the work of Daniel Goldston, János Pintz, and C. Y. Yıldırım. The conjecture interacts with sieve-theoretic frameworks such as the Selberg sieve, Rosser–Iwaniec sieve, and spectral techniques related to automorphic representation theory and trace formula methods pioneered by James Arthur and Atle Selberg.

Partial results and progress

Significant partial progress includes the Bombieri–Vinogradov theorem, achieved through methods by Enrico Bombieri and A. I. Vinogradov, which provides the conjectured bound for moduli up to roughly x^{1/2} (up to logarithmic factors). Improvements conditional on the Generalized Riemann Hypothesis follow from classical zero-density estimates developed by H. L. Montgomery and Atle Selberg. Work by Yitang Zhang, consolidating ideas from Goldston–Pintz–Yıldırım and combining with variants of the GPY sieve, exploited weaker distributional hypotheses akin to averaged forms of Elliott–Halberstam to prove bounded gaps between primes. Subsequent refinements by Maynard–Tao and collaborative efforts culminating in the Polymath Project extended these techniques; contributors include Terence Tao, James Maynard, and many others.

Applications and related conjectures

The conjecture has been used as a heuristic or conditional hypothesis in proposals addressing the Twin prime conjecture, the existence of prime constellations per the Hardy–Littlewood k-tuple conjecture, and effective versions of Chebotarev density theorem in certain families. It is related to other distributional conjectures such as the Montgomery conjecture on pair correlation of zeros, the Barban–Davenport–Halberstam theorem, and conjectural zero-density bounds for Dirichlet L-functions. Connections extend to modern work in arithmetic geometry and Galois representations where uniformity in residual moduli plays a role in techniques employed by researchers like Jean-Pierre Serre and Richard Taylor.

Proof attempts and refutations of variants

There is no unconditional proof of the conjecture. Various stronger and weaker variants have been proposed, some disproven in specific ranges or shown inaccessible by current methods. Counterexamples to naive generalizations arise when adversarial constructions exploit deep properties of characters and potential exceptional zeros (Siegel zeros) studied by Carl Ludwig Siegel and Atle Selberg. Conditional proofs assuming powerful hypotheses such as the Generalized Riemann Hypothesis or robust zero-density estimates have been established in restricted contexts by authors including Hugh Montgomery, Andrew Granville, and K. Soundararajan. Contemporary research continues to explore hybrid analytic–combinatorial approaches and to delineate the frontier between what can be deduced from presently available tools and what would require breakthroughs in L-function theory or new sieve innovations.

Category:Conjectures in number theory