- Atlas
- Mathematics
- Analytic Number Theory
Analytic Number Theory
Analytic number theory is the branch of number theory that studies the integers with the tools of analysis—limits, infinite series, integrals, and above all functions of a complex variable.
13 frameworks, from 1737 to today · Number Theory · Mathematics
- Euler Product and Zeta Function Analysis 1737-Present
- Dirichlet Characters and L-functions 1837-Present
- Complex-Analytic Theory of the Zeta Function 1859-Present
- Prime Number Theorem and Zero-Free Regions 1896-Present
- Sieve theory 1915-Present
- Exponential Sum Methods 1916-Present
- Hardy–Ramanujan–Littlewood circle method 1920-Present
- Automorphic Forms and General L-functions 1930-Present
- Probabilistic Number Theory 1939-Present
- Random matrix theory and zeta statistics 1970-Present
- Random Matrix Models 1973-Present
- Additive Combinatorics and Transference 2004-Present
- Pretentious Multiplicative Function Theory 2007-Present
Overview
Analytic number theory is the branch of number theory that studies the integers with the tools of analysis—limits, infinite series, integrals, and above all functions of a complex variable1. Its founding insight is that questions about whole numbers can sometimes be answered by studying continuous objects. The distribution of the primes, for instance, is governed by the zeros of a single complex function. This is strange and powerful: a discrete, seemingly irregular set of numbers turns out to obey laws written in the language of calculus. The history of the subject is largely the history of learning to read those laws.
The Birth of the Subject: Euler and the Zeta Function
The subject begins with Leonhard Euler in the 1730s and 1740s. Euler asked what happens when you sum the reciprocals of the powers of the integers: \(1 + 1/2^s + 1/3^s + \cdots\)2. For \(s > 1\) this series converges, and Euler found a second expression for it as a product over the primes, \(\prod_p (1 - p^{-s})^{-1}\)1. This Euler product is the hinge on which analytic number theory turns: it converts a statement about all integers into a statement about primes. Euler used it to prove that the sum of reciprocals of the primes diverges, so the primes are more numerous than, say, the perfect squares13. He also evaluated the series at even integers, finding \(\zeta(2) = \pi^2/6\), a result linking number theory to geometry.
Euler's work was isolated. The next decisive step came from Dirichlet1.
Dirichlet: Characters, L-functions, and Primes in Progressions
In 1837, Peter Gustav Lejeune Dirichlet proved that every arithmetic progression \(a, a+q, a+2q, \dots\) with \(\gcd(a,q)=1\) contains infinitely many primes14. The problem was that Euler's product method says nothing about primes in a particular residue class. Dirichlet's idea was to introduce characters: functions \(\chi\) on the integers, periodic modulo \(q\), that are multiplicative and take values on the unit circle15. He then formed the Dirichlet L-function \(L(s,\chi) = \sum \chi(n) n^{-s}\), which also has an Euler product. By showing \(L(1,\chi) \neq 0\) for the nontrivial characters, he extracted the infinitude of primes in each class6. The nonvanishing at \(s=1\) is the technical heart of the proof, and it remains a model for how analytic information about an L-function yields arithmetic conclusions.
Dirichlet's characters and L-functions became permanent fixtures. They are the prototype for the more general L-functions that dominate the modern subject.
Riemann: The Zeta Function in the Complex Plane
In 1859, Bernhard Riemann, in an eight-page paper, did something no one had done: he treated Euler's series as a function of a complex variable \(s\) and studied it by the methods of complex analysis. Riemann showed that \(\zeta(s)\) extends meromorphically to the whole plane with a single pole at \(s=1\), satisfies a functional equation relating \(\zeta(s)\) to \(\zeta(1-s)\), and—crucially—that the distribution of primes is controlled by the nontrivial zeros of \(\zeta\)12. His explicit formula expresses a sum over primes as a sum over zeros7. The famous Riemann Hypothesis, that all nontrivial zeros lie on the line \(\Re(s) = 1/2\), is a statement about how regular the primes are17.
Riemann's paper introduced the ideas but left the hard estimates undone. The next half-century was spent making them rigorous.
The Prime Number Theorem and Zero-Free Regions
The prime number theorem—that the number of primes up to \(x\), written \(\pi(x)\), is asymptotic to \(x/\log x\)—was conjectured by Gauss and Legendre around the turn of the nineteenth century18. It was proved independently by Jacques Hadamard and Charles-Jean de la Vallée Poussin in 189618. Both proofs used Riemann's framework and established that \(\zeta(s)\) has no zeros on the line \(\Re(s)=1\)1. A zero-free region to the left of that line gives an explicit error term in the prime number theorem; wider regions give better errors. This trade-off—zero-free regions for error terms—became a central industry. The best known region today, due to Korobov and Vinogradov in 1958, still falls far short of the Riemann Hypothesis, and closing that gap remains open.
The explicit formulae of Riemann, developed by Hans von Mangoldt and later by Guido Weiss and others, gave precise identities connecting prime counts to zero sums. They remain the standard bridge between the two sides of the subject.
The Circle Method and Exponential Sums
In the 1920s, G. H. Hardy and John Littlewood, and independently Srinivasa Ramanujan in related work, developed the circle method: to count solutions of an additive equation such as \(n = p1 + p2 + p_3\), one writes the count as an integral over the unit circle of a generating function, then splits the circle into arcs near rational points (the "major arcs," where the integral is large and computable) and the rest (the "minor arcs," bounded by estimates). The method produced the first serious progress on Waring's problem (representing integers as sums of powers) and on Goldbach-type questions. Ivan Vinogradov's 1937 theorem that every sufficiently large odd number is a sum of three primes is a landmark of the method.
The engine of the circle method is exponential sums: sums of the form \(\sum e^{2\pi i f(n)}\)9. Estimating these sums—by Weyl's method, Vinogradov's method, or van der Corput's—is a technical discipline in its own right, and improvements in exponential sum bounds translate directly into wider ranges for additive problems.
Sieves
A sieve is a method for counting integers that survive a set of congruence conditions—the sieve of Eratosthenes is the elementary prototype1011. In the twentieth century, Viggo Brun (1915) turned sieving into an analytic tool, proving that the sum of reciprocals of twin primes converges and that every large even number is a sum of two numbers each with at most nine prime factors. The Selberg sieve (1940s) and the large sieve of Linnik gave powerful general bounds. The most famous modern application is Chen Jingrun's 1966 theorem that every sufficiently large even number is the sum of a prime and a number with at most two prime factors—the closest approach yet to Goldbach's conjecture. Sieves have inherent limitations (the "parity problem"), which is why they have not settled Goldbach outright.
Probabilistic and Pretentious Methods
In the twentieth century, number theorists began asking statistical questions: what does a "typical" integer look like? Probabilistic number theory, associated above all with Paul Erdős and Aurel Wirsing, studies arithmetic functions—functions defined on the integers, like the number of divisors—as random variables. The Erdős–Kac theorem (1939) is the emblem: the number of distinct prime factors of \(n\), suitably normalized, has approximately a normal distribution. This was a genuine surprise, showing that the primes impose Gaussian statistics on multiplicative structure.
A later development, the pretentious approach of Andrew Granville and K. Soundararajan (from around 2007), recasts multiplicative-function theory in terms of how much one function "pretends" to be another. Two multiplicative functions are close in a precise distance, and this distance controls their correlations. The framework gave clean new proofs of old results and new bounds, and it clarified why certain functions behave like characters and others do not.
Automorphic Forms and General L-functions
Dirichlet's L-functions were generalized in the twentieth century to L-functions attached to automorphic forms—highly symmetric functions on spaces like the upper half-plane—and to Galois representations. The modularity theorem (proved by Andrew Wiles and others in the 1990s, building on work of Shimura, Taniyama, and Weil) showed that elliptic curves over the rationals are modular, and the proof of Fermat's Last Theorem was a consequence. The analytic study of these L-functions—their zero-free regions, their value distributions, their functional equations—is now a central part of the field, connected to the Langlands program.
Random Matrix Models
In the 1970s, Hugh Montgomery, studying the pair correlation of zeta zeros, found a formula that Freeman Dyson recognized as matching the eigenvalue statistics of random Hermitian matrices from the Gaussian Unitary Ensemble. This was the beginning of random matrix theory in number theory. The Keating–Snaith conjectures (2000) extended the analogy to moments of \(\zeta\) and to L-functions more generally, predicting that their value distributions match characteristic polynomials of random matrices. The models are heuristic—they are not proved—but they have successfully predicted exact constants and guided conjectures across the subject.
Additive Combinatorics and Transference
In the twenty-first century, additive combinatorics—the study of sumsets and additive structure—has interacted increasingly with analytic number theory. Transference principles, such as the Green–Tao theorem (2004) that the primes contain arbitrarily long arithmetic progressions, use additive-combinatorial and ergodic methods alongside analytic ones. The distinction between the subfields has blurred, and many current results draw on both.
The Present
Analytic number theory today is a large, interconnected field. The Riemann Hypothesis remains open, and the gap between the best zero-free regions and the hypothesis is a standing challenge. The circle method and exponential sum estimates continue to drive additive results. Sieves remain indispensable but limited by the parity problem. Automorphic L-functions and their analytic properties are a major industry, tied to the Langlands program. Random matrix models guide conjectures but await proof. Pretentious methods have reorganized the study of multiplicative functions12. The subject's characteristic move—translate an arithmetic question into analysis, solve it there, translate back—has lost none of its power, and the questions it cannot yet answer are as sharp as ever.
References
- Analytic number theory (introduction, Riemann zeta function, Dirichlet, Multiplicative number theory, Precursors, Hadamard and de la Vallée-Poussin), Wikipedia
- Riemann zeta function, Wikipedia
- Prime number (History), Wikipedia
- Dirichlet's theorem on arithmetic progressions, Wikipedia
- Dirichlet character, Wikipedia
- Dirichlet L-function, Wikipedia
- Riemann hypothesis (Origin, introduction), Wikipedia
- Prime number theorem (History of the proof of the asymptotic law of prime numbers, introduction), Wikipedia
- Exponential sum, Wikipedia
- Sieve theory, Wikipedia
- Sieve of Eratosthenes, Wikipedia
- Adam Harper, Wikipedia
The frameworks of Analytic Number Theory
Each framework is a way of working the field has used: when it held, and the question it answers.
- 1737-Present
Euler Product and Zeta Function Analysis
How can a sum over all integers be rewritten as a product over primes?
- 1837-Present
Dirichlet Characters and L-functions
How can characters detect primes in arithmetic progressions?
- 1859-Present
Complex-Analytic Theory of the Zeta Function
How do the zeros of a complex function control the primes?
- 1896-Present
Prime Number Theorem and Zero-Free Regions
How many primes are there up to a given size?
- 1915-Present
- 1916-Present
- 1920-Present
Hardy–Ramanujan–Littlewood circle method
How can counting solutions to additive equations be turned into an integral?
- 1930-Present
Automorphic Forms and General L-functions
What analytic properties do L-functions of automorphic forms have?
- 1939-Present
Probabilistic Number Theory
What does a typical integer look like statistically?
- 1970-Present
Random matrix theory and zeta statistics
Why do zeta zeros mimic random matrix eigenvalues?
- 1973-Present
Random Matrix Models
Which random matrix ensembles model number-theoretic statistics?
- 2004-Present
Additive Combinatorics and Transference
How do additive structures persist under transference?
- 2007-Present
Pretentious Multiplicative Function Theory
When does one multiplicative function pretend to be another?
How the ideas connect
Each arrow runs from an earlier idea to the later one it shaped. The list below says what passed between them.
Dirichlet Characters and L-functions grew out of Euler Product and Zeta Function Analysis
Dirichlet built his L-functions by inserting characters into Euler's product, generalizing the zeta function to prove primes in arithmetic progressions.
Carried by Peter Gustav Lejeune Dirichlet.
Complex-Analytic Theory of the Zeta Function grew out of Euler Product and Zeta Function Analysis
Riemann treated Euler's series as a function of a complex variable, extending it meromorphically and connecting its zeros to prime distribution.
Carried by Bernhard Riemann.
Automorphic Forms and General L-functions grew out of Dirichlet Characters and L-functions
Automorphic L-functions generalize Dirichlet L-functions, retaining the Euler product and functional equation while attaching to modular forms and Galois representations.
Carried by Erich Hecke.
Prime Number Theorem and Zero-Free Regions grew out of Complex-Analytic Theory of the Zeta Function
Hadamard and de la Vallée Poussin made Riemann's complex-analytic framework rigorous, proving the prime number theorem by establishing zero-free regions.
Carried by Jacques Hadamard; Charles-Jean de la Vallée Poussin.
Random matrix theory and zeta statistics influenced by Complex-Analytic Theory of the Zeta Function
Montgomery's study of the pair correlation of zeta zeros, using Riemann's explicit formula, led to the recognition of a link with random matrix eigenvalue statistics.
Carried by Hugh Montgomery; Freeman Dyson.
Probabilistic Number Theory influenced by Euler Product and Zeta Function Analysis
Erdős and Kac used the Euler product to model the number of prime factors as a sum of independent random variables, yielding the Gaussian limit theorem.
Carried by Paul Erdős; Mark Kac.
Prime Number Theorem and Zero-Free Regions influenced by Dirichlet Characters and L-functions
Dirichlet's method of extracting arithmetic information from L-functions via nonvanishing at s=1 became a model for the prime number theorem proofs.
Carried by Peter Gustav Lejeune Dirichlet.
Pretentious Multiplicative Function Theory influenced by Dirichlet Characters and L-functions
Pretentious theory explains why some multiplicative functions behave like Dirichlet characters, using the character framework as the model for 'pretending'.
Carried by Andrew Granville; K. Soundararajan.
Automorphic Forms and General L-functions influenced by Complex-Analytic Theory of the Zeta Function
The analytic study of automorphic L-functions adopted Riemann's complex-analytic methods, including functional equations and zero-free regions.
Carried by Erich Hecke.
Additive Combinatorics and Transference influenced by Sieve theory
Additive combinatorics and transference grew partly from sieve-theoretic and circle-method techniques for counting additive configurations in sets of integers.
Carried by Ben Green; Terence Tao.
Additive Combinatorics and Transference influenced by Hardy–Ramanujan–Littlewood circle method
The circle method's decomposition into major and minor arcs was adapted in additive combinatorics, notably in Green and Tao's work on primes in progressions.
Carried by Ben Green; Terence Tao.
Pretentious Multiplicative Function Theory influenced by Probabilistic Number Theory
Granville and Soundararajan's pretentious distance recast the probabilistic study of multiplicative functions in terms of how closely one function mimics another.
Carried by Andrew Granville; K. Soundararajan.
Beyond the field
Where Analytic Number Theory's ideas came from in other fields, and what they led to there: the strongest 12 of 54 links.
Euler Product and Zeta Function Analysis influenced Analytic Number Theory in Complex Analysis
Riemann's complex-analytic study of the zeta function built directly on Euler's product formula and zeta-function analysis, extending Euler's real-variable results to the complex plane.
Carried by Bernhard Riemann; Leonhard Euler.
Euler Product and Zeta Function Analysis influenced Analytic number theory in Number Theory
Dirichlet's introduction of L-functions and his analytic proof of the arithmetic progression theorem grew directly out of Euler's product and zeta-function analysis. Riemann and later analytic number theorists built on this Eulerian base.
Carried by Peter Gustav Lejeune Dirichlet; Leonhard Euler.
Prime Number Theorem and Zero-Free Regions grew out of Analytic number theory in Number Theory
The prime number theorem proofs of Hadamard and de la Vallée Poussin were built directly on the analytic number theory of Dirichlet and Riemann, adding complex analysis of zero-free regions.
Carried by Jacques Hadamard; Charles de la Vallée Poussin.
Hardy–Ramanujan–Littlewood circle method influenced by Waring's problem in Additive Number Theory
Waring's problem was the motivating application for the circle method: Hardy and Ramanujan's 1918 partition work and Hardy–Littlewood's 1920s papers developed major and minor arcs to estimate representations as sums of powers. The method was built to solve Waring-type additive questions.
Carried by G. H. Hardy; John Edensor Littlewood; Srinivasa Ramanujan.
Hardy–Ramanujan–Littlewood circle method grew out of Additive number theory in Number Theory
The circle method is a technique developed within additive number theory to attack Waring's problem and partition asymptotics. It grew directly out of the additive tradition of representing integers as sums of powers.
Carried by G. H. Hardy; John Edensor Littlewood.
Automorphic Forms and General L-functions led to Arthur–Selberg trace formula in Modular Forms And Automorphic Forms
The Arthur-Selberg trace formula is the main computational tool of the automorphic forms and L-functions programme, developed to compare trace formulas on adelic groups and extract automorphic information.
Carried by Atle Selberg; James Arthur.
Automorphic Forms and General L-functions grew out of Hecke theory and modular L-functions in Modular Forms And Automorphic Forms
Hecke's theory of modular L-functions with Euler products is the direct ancestor of the general theory of automorphic L-functions. Hecke operators and Hecke characters were taken up and generalised in the automorphic programme.
Carried by Erich Hecke.
Automorphic Forms and General L-functions influenced Modular forms and automorphic representations in Number Theory
Hecke's theory of automorphic forms and L-functions, generalised by the Langlands programme, is the direct ancestor of automorphic representations. The later theory recasts Hecke's forms as representations of adelic groups.
Carried by Erich Hecke; Robert Langlands.
Automorphic Forms and General L-functions led to Modularity theorem in Modular Forms And Automorphic Forms
The modularity theorem grew out of the automorphic forms and L-functions programme: attaching an automorphic form (and its L-function) to an elliptic curve is exactly the general framework the theorem instantiates.
Carried by Yutaka Taniyama; Goro Shimura; Andrew Wiles.
Automorphic Forms and General L-functions influenced Langlands Program in Algebraic Number Theory
The Langlands program is stated in the language of automorphic forms and general L-functions, proposing that general L-functions are automorphic. The earlier theory of automorphic forms and L-functions provided the vocabulary and the objects of the conjectures.
Carried by Robert Langlands.
Automorphic Forms and General L-functions influenced Langlands program in Lie Theory
The theory of automorphic forms and general L-functions, developed from Hecke and Artin L-functions, provided the analytic objects whose generalisation Langlands made central to his conjectures.
Carried by Robert Langlands.
Automorphic Forms and General L-functions influenced Langlands program in Number Theory
The theory of automorphic forms and general L-functions, developed from Hecke and Artin through Weil and others, provided the analytic objects and L-function formalism that Langlands recast as the automorphic side of his correspondence.
Carried by Robert Langlands; Erich Hecke; André Weil.

Analytic Number Theory is a planet in Nousfarer
Its city has a tower for each of these 13 frameworks. Land, walk in, and climb one concept at a time.
Land on Analytic Number TheoryRelated fields
Fields its ideas are linked to
- Number Theory 12 links
- Modular Forms And Automorphic Forms 8 links
- Complex Analysis 6 links
- Combinatorics 5 links
- Additive Number Theory 5 links
- Elementary Number Theory 4 links
- Algebraic Number Theory 3 links
- Linear Algebra 2 links
- Additive Combinatorics 2 links
- Abstract Algebra 1 link
- Field And Galois Theory 1 link
- Lie Theory 1 link
More in Number Theory
- Additive Number Theory
- Algebraic Number Theory
- Arithmetic Geometry
- Computational Number Theory
- Elementary Number Theory
- Modular Forms And Automorphic Forms
- Number Theory
- Transcendental Number Theory
See where Analytic Number Theory sits on the Map of Human Knowledge