Sectors that shrink with the primes
Worth reading first: Which way a prime's two squares point · Two squares, and a lattice.
Which way a prime’s two squares point drew every prime as the point , with , and asked about its angle , which lies between and . Erich Hecke proved in 1920 that the angles are evenly spread: the share of primes up to whose angle falls in a fixed sector tends to the sector’s share of the . That essay showed fixed sectors filling on schedule and thin ones filling late, and it ended on the refinement that is not settled. How thin may a sector be, as a function of the size of the primes, and still be guaranteed its share?
The conjectured answer is: any width , for any . The proved answers are far wider. This essay does not prove anything about the question; it measures it. Take the primes between and with forty million, cut the range into sectors of width , and watch what happens to the counts as grows from small values, where Hecke’s method works, past , where the conjecture stops.
At width the picture looks like a band of noise around the line, which is what Hecke’s theorem would predict for wide sectors and what the conjecture predicts for these. Two things are visible on a closer look. The band is narrower than independent random counts would make it. And at the two ends, near and , the counts fall away and a couple of sectors are empty. Both turn out to be properties of the lattice that the primes live on, not of the primes.
Finding every prime, and cutting the range
The list of angles is complete. Every pair with between twenty and forty million was visited, and was looked up in a sieve; since a prime that leaves remainder 1 on division by 4 is a sum of two squares in exactly one way with , as two squares and a lattice explained, each prime appears once. There are 581,517 of them.
For each the range is cut into equal sectors, so that each has width about radians, and the primes are counted in each. At there are 26 sectors with over twenty thousand primes apiece; at , 4,967 sectors with 117 on average; at , nearly four hundred thousand sectors with fewer than two each. Three statistics describe the counts: how much they vary relative to their mean, how many sectors are empty, and where the empty ones are.
The lattice points come first
Before the primes there are the lattice points they are drawn from, and those are spread almost perfectly. The number of points with in a sector of width is the sector’s area, , plus an error that depends only on the sector’s boundary — the arc and the two straight sides — and is much smaller than the area for any width above about . The dots a circle catches measured the arc’s share of that error; the straight sides contribute in a way that depends on the slope of the side, small for a generic slope and large for a slope of small height, which is the effect the empty sectors will show.
The primes are a thin subset of those points. About one point in is a prime, and the sums of two squares themselves are already rare, as almost no number is one showed. So the share a sector should hold is its share of the lattice points times the density of primes among them, and the question of thin sectors splits in two: whether the lattice points are evenly spread at that width, which is geometry, and whether the primes among them are, which is arithmetic. At widths above the geometry is settled and only the arithmetic is in doubt. Below it, the geometry fails first.
Steadier than chance in wide sectors
If the angles were independent random points, the count in a sector would vary with variance equal to its mean — the Poisson rule — and the ratio of the two would be 1 at every width.
The ratio is not 1. For the widest sectors it is 0.38: the counts in 26 sectors of about each fluctuate with less than two-fifths of the variance random points would give. As the sectors narrow the ratio climbs — 0.48, 0.69, 0.77, 0.87 — and from about on it sits within a few per cent of 1. The primes’ angles are more regular than random at large scales and indistinguishable from random at small ones.
That shape is what Ze’ev Rudnick and Ezra Waxman predicted in 2019 from a random-matrix model of Hecke’s L-functions, the model the previous essay mentioned as its open question. The regularity at large scales has a plain source. The count in a wide sector is controlled by the low-frequency averages of the angles, which Hecke’s L-functions govern and which are close to their limits; the fluctuations of independent points would need those averages to be noisier than they are. At scales below the low frequencies no longer matter and what remains looks like independent noise. The measurements at four million and forty million agree in shape, which is evidence the transition is a property of the primes rather than of one size.
More empty sectors than chance allows
The variance is an average over all sectors. The empty sectors are where the average hides something.
Below no sector is empty, as chance would also predict. From on there are empty sectors that chance cannot account for: 2 at , 10 at 0.55, 65 at 0.6 — where the expected number, with about twenty primes per sector, is effectively nought — and 431 at 0.65, where chance expects fourteen. Only by , where sectors hold three or four primes on average and many are empty by chance, does the count of empty sectors fall back to the random prediction.
Some of the excess is forced. Near the axis, a point with and at most has angle at least about , so the first few sectors narrower than that contain no lattice point at all; the same happens near , where . Those forced sectors are the third line in the figure, and they are a minority of the empty ones. At , nine of the 65 are forced. The other 56 are empty for some other reason.
Where the empty sectors are
Sorting the empty sectors by position finds the reason.
The empty sectors are not scattered through the range. Almost every one sits right beside a direction of small rational slope: 16 beside , 12 beside , 7 at the axis, 6 beside , 5 beside , and the rest beside , , , , , . Near any rational direction the points of the integer lattice line up in parallel rows along that direction, the way they line up in rows along the axis, and the rows are spaced by for the slope . A sector thin enough to fit between two rows catches nothing, whatever the primes are doing. The same rows are what make the fractions with small denominators stand out among all fractions, the effect how evenly the fractions spread measured on the interval. The slopes that matter are the ones every fraction, exactly once produced first by adding tops and bottoms: and , then , then and . A slope of small height has widely spaced rows, and the further down that tree of mediants a slope lies, the closer its rows and the narrower the sector needed to fall between them.
Rows of this kind are a familiar way for structure to hide in apparent randomness. A rotation that hides the lattice described the pairs of outputs of a congruential random-number generator, which look scattered and lie on a few parallel lines when viewed along the right direction. The lattice points here do the same: from far away they fill the plane evenly, and seen along a direction of small slope they are lines with gaps between them.
And the slopes with both terms odd — , , , , , , — collect two-thirds of the empty sectors. The reason is parity. A prime other than 2 is odd, so and have opposite parity. Along a direction of slope with and both odd, the rows of lattice points alternate: on every other row, and have the same parity, is even, and no prime can lie there. The usable rows are twice as far apart as the lattice’s own, and the gaps a thin sector can fall into are twice as wide. For a slope with one even term every row contains points of both parities, and the effect is weaker. The slope is the end of the range itself, where the rows run along the boundary, so some of its empty sectors are among the forced ones; set it aside and the odd-odd slopes still hold the largest share of what is left, with alone holding sixteen.
Sector by sector
The swings near a rational direction can be seen one sector at a time.
Beside the axis the first five sectors are empty, then one holds 74 — a row of lattice points, or , running along it — and the counts swing between nothing and several times the share before settling. Beside the slope the counts are ordinary until the sectors come within a few widths of the direction; then they swing the same way, and one sector holds 142, seven times its share, because it runs along a row, while sectors either side of it hold none. Averaged over a wide sector, the feast and the famine cancel. In a thin one they are the whole story. The same swings would appear with every lattice point counted instead of only the primes; the primes inherit them, at about one in fourteen of the lattice points in this range, because they can only sit where lattice points are.
This is why the variance ratio climbed to 1 rather than above it. The excess empty sectors are paired with overfull ones beside the same directions, and over the whole range both are a small part of the total. They are not a failure of equidistribution; they are equidistribution at a scale where the lattice is visible.
The barrier at the axis
The axis is where the lattice’s rows are farthest apart, and where the conjecture’s exponent comes from.
The prime closest to the axis is always one with , a prime of the form , and its angle is about , which is about . No prime, and no lattice point with , can do better. So a sector of width narrower than placed at the axis is empty by geometry, and the conjecture cannot ask for anything thinner than . At exactly that width, a sector at the axis contains primes only if there are primes near , and whether there are infinitely many such primes is Landau’s problem — the open question the same bell on thinner sets met from the side of prime factors, where the count of primes up to two million matched Hardy and Littlewood’s prediction to within a tenth of a per cent. The conjecture for thin sectors therefore contains Landau’s problem as its extreme case, which is one way to see why it is hard.
What is proved, and what is measured
Hecke’s theorem gives the even spread for fixed sectors. Making it quantitative, with sectors shrinking at a rate, requires bounds on the error terms of all of Hecke’s L-functions at once. A sector of width needs about of the L-functions to describe it, each contributing its own error, and even the Riemann hypothesis for every one of them, used in the standard way, gives the share only in sectors far wider than ; unconditionally, the known widths are wider still. The difficulty is that a thin sector is a sharp edge in angle, and a sharp edge needs many frequencies, each of which must be controlled at once. Proved results of a different kind, from sieve methods, place infinitely many primes — though not their full share — in sectors as thin as . The measurements here run from to , across all of those thresholds and past the conjectured one.
What they show is consistent with the conjecture and with Rudnick and Waxman’s model: the counts are close to their shares at every width down to about , with fluctuations smaller than chance, and the exceptions that appear at thinner widths are explained by the lattice. They cannot show that the conjecture is true. At forty million, and differ by a factor of six, and a statement about exponents is a statement about how such factors behave as grows without bound.
Still open: thin sectors away from rational directions
Whether every sector of width eventually holds its share of primes is not known. The measurements suggest a sharper form of the question. The lattice forces empty sectors beside rational directions at widths a little below , and doubles the effect beside slopes with both terms odd. A natural refinement asks for the share in every sector of width that keeps a distance from rational directions of small height, for some range of beyond , and how that range depends on the height allowed. The measurements raise it rather than answer it, and the experiment here is too small to suggest an exponent.
The parity effect also makes a prediction that a larger computation could test. Beside a slope whose two terms are both odd, only every other row can hold a prime, so at a given width the empty sectors there should behave like those beside an even-odd slope whose rows are twice as far apart. If that matching held across many widths and sizes, it would show that the rows and their parity account for all of the excess, and that away from rational directions the thin sectors behave like chance all the way down — which is the content the conjecture would need.
The second open matter is Rudnick and Waxman’s prediction itself, which is a conjecture about the variance at every scale, derived from a model rather than from the primes. The two sizes measured here agree with its shape, and confirming its precise form would need sizes far beyond forty million and many more sector widths.
The lattice behind the primes
Hecke’s theorem is about primes, and its refinement is still about primes, but at the widths where the refinement is hard, the lattice underneath shows through. Wide shrinking sectors hold their share more steadily than chance would; thin ones fluctuate like chance; and the thin ones that go empty sit beside the directions where the lattice lines up in rows, most of all where parity removes every other row. The barrier at is the lattice’s barrier, and at the axis it becomes Landau’s problem. What the primes do away from those directions, at widths below , is the question the measurements point to and do not answer.
Shares its objects with
Essays that name at least two of the same things, and that neither author linked.
- The two squares actually produced — both name gaussian integers, lattice, sums of two squares
- A fraction on the circle forces a whole point — both name lattice, sums of two squares
- A share that depends on the average — both name equidistribution, prime number theorem
- Factoring uniquely with no way to divide — both name gaussian integers, lattice
- How many pairs can be one apart — both name lattice, sums of two squares
- The two supplements, and where the eight comes from — both name gaussian integers, sums of two squares
Named objects
A dashed tag is an object no other essay names yet.
EquidistributionGaussian integersLatticePrime number theoremSums of two squaresVariance