### Bounded gaps between primes!

And so it came to pass, that an almost millenial quest found a safe resting place…

Like all analytic number theorists, I’ve been amazed to learn that Yitang Zhang has proved that there exist infinitely many pairs of prime numbers with bounded by an absolute constant .

So, how did he do it?

Well, since the paper just became available, I don’t have anything intelligent to say yet on the *new* ideas that he introduced (but I certainly hope to come back to this!). However, one can easily list those previously-known tools that he uses, which involve some of the deepest and most clever results in analytic number theory of the last 30 to 35 years.

(1) At the core, the proof is based on the method discovered about ten years ago by Goldston, Pintz and Yıldırım to show that

As I discussed a while back, this remarkable result — besides its intrinsic interest — was notable for being the first to bring the problem of bounded gaps between primes within a circle of well-studied and widely believed conjectures on primes in arithmetic progressions to large moduli. Precisely, Goldston, Pintz and Yıldırım had derived the statement above, after many ingenious steps, by applying the Bombieri-Vinogradov Theorem, and they showed that any progress beyond it towards the so-called Elliott-Halberstam Conjecture would imply the bounded gap property. However, in my former blog post, I discussed why it seemed extremely difficult to go in that direction…

(2) … despite the existence of *some* results going beyond the Bombieri-Vinogradov theorem, due first to Fouvry-Iwaniec and later improved by Bombieri-Friedlander-Iwaniec; but Zhang uses indeed some of the ideas behind these results…

(3) … results which themselves depend crucially on two big ideas: the *well-factorable* weights of the linear sieve, due to Iwaniec, and the development and applications of the Kuznetsov formula and other results concerning the spectral theory of automorphic forms and estimates for sums of Kloosterman sums, the outcome of the work of Deshouillers and Iwaniec (actually, at first glance, it seems that Zhang does not explicitly use those results arising from the Kuznetsov formula; he does reach sums with incomplete Kloosterman sums which the spectral methods are designed to handle, but he can deal with them with the Weil bound only; this might be a place where the result can be improved…)

(4) … but furthermore, Zhang uses also an estimate for a certain character sum over finite fields which had appeared in the work of Friedlander and Iwaniec on the exponent of distribution for the ternary divisor function; this sum is a three-variable additive character sum, and its estimation (with square-root cancellation), proved by Bombieri and Birch in an Appendix to the paper of Friedlander and Iwaniec, depends crucially on the Riemann Hypothesis over finite fields of Deligne.

Here are some references to surveys or explanations of some of these tools. Amusingly, I have written something on most of them…

- There have been many surveys of the work of Goldston, Pintz and Yıldırım, and in particular I wrote a Bourbaki report on it, which may be interesting to those who read French;
- Concerning the automorphic Kloostermania that comes into the Fouvry-Iwaniec and Bombieri-Friedlander-Iwaniec circle of ideas (although it is apparently not needed for Zhang’s proof…), I happened to write a few years ago, for a book on Poincaré’s mathematical work, an account of the applications of Poincaré series to analytic number theory, which are used to prove the Kuznetsov formula;
- Fouvry has written a survey
*Cinquante ans de théorie analytique des nombres*from the point of view of sieve methods, which discusses the philosophy of extending the ranges of exponents of distribution for important sequences, as well as the well-factorable weights of Iwaniec; - Fans of trace functions may remember that I noticed in a previous post (see the very end) that the exponential sum of Friedlander-Iwaniec, estimated by Birch and Bombieri, is (for prime moduli) just a special case of the general “correlation sums” that appeared in my recent work with Fouvry and Ph. Michel — in particular, our arguments (based on the sheaf-theoretic Fourier transform of Deligne, Laumon, Katz and others) give a conceptually simple proof of that estimate (I just wrote it down in a short separate note);

And although it doesn’t seem that Zhang uses it directly, I’d like to mention that the result of Friedlander and Iwaniec concerning the exponent of distribution of was improved by Heath-Brown a few years later, and that Fouvry, Michel and I very recently improved it quite a bit further (for prime moduli; the second part of that paper involves another application of the Bombieri-Friedlander-Iwaniec techniques to improve the exponent of distribution on average…)

And a philosophical preliminary conclusion, before diving into the work of Zhang: it is thrilling to see this result, and I particularly like that it comes completely unexpectedly, and yet uses all these beautiful ideas and methods from this analytic number theory that I love!

Jon — 22.05.2013 @ 8:56

Thanks for all that background information, makes Zhang’s accomplishment all the more impressive!

A question: does Zhang’s result immediately implies also results on Gaussian primes (i.e. Gaussian_prime#Unsolved_problems on wikipedia) ? In particular, do you think it solves the Gaussian Moat problem? Thank you!

Kowalski — 22.05.2013 @ 9:10

I have no idea about this at the moment…

Biderman — 18.09.2014 @ 1:18

This result does not immediately imply the Gaussian Moat problem. The issue is the primes (in Z[i]) whose norm is a prime in Z and with neither a nor b equal to 0. Since it is possible for both a and b to be composite and have the sum of their squares still be a prime, there is no trivial way to apply this new theorem to the Gaussian Moat problem.

Greg — 23.05.2013 @ 19:27

Regarding Jon’s question: I don’t think Zhang’s result (or plausible generalizations of it to primes in arithmetic progressions, Gaussian primes, etc.) has any bearing on the Gaussian moat problem. Zhang’s result says that there are primes close together infinitely often, but these occurrences are *rare*. To walk to infinity on the Gaussian primes, we need there *always* to be a prime close by.

Robert Munafo — 23.05.2013 @ 23:09

Your “the paper just became available” link does not work. Where can we read this paper?

Cornelius Cooper — 01.06.2013 @ 21:40

I a not a mathematician; merely an interested observer, but the proof that an infinite number of primes exits between which there is a gap no greater than 70,000,000; set beside the contention that the number of primes occurs less frequently the further we go in the number line, suggests something about the over all geometry of numbers, with primes behaving as nodes in an infinitely expanding mesh. It is almost as if there were a fractal aspect to the phenomenon — in this instance things getter every larger, rather than ever smaller.