In this post, I’d like to discuss two classic problems in analytic number theory, the Gauss circle problem (GCP) and the Dirichlet divisor problem (DDP). These two problems ask similar questions: how well can we approximate the number of lattice points inside certain planar regions? (Namely, within the circle of radius and below the hyperbola .)
By introducing the arithmetic functions
we can recast the GCP and the DDP in terms of error bounds for average order estimates. In this new language, our questions are as follows:
Question: Find the minimal (resp. ) for which
holds for any . (Here, is the Euler-Mascheroni constant.)
In each case, the leading terms are due to pioneering work by the eponymous mathematicians, who also showed (resp.) that . The first improvement past the -barrier in the GCP and DDP was due to Sierpiński (in 1903), who showed that . (These bounds are sometimes credited to Voronoi, Sierpiński’s advisor, with the year 1906.)
Bounds have steadily improved ever since, with progress towards the GCP occurring in lockstep with progress towards the DDP. The current bounds (both due to Huxley, 2003) give , and well-supported conjectures anticipate that should be the correct exponents.
There are some superficial reasons why progress towards the GCP and the DDP should be related (eg. circles and hyperbolas are both plane conics), but it appears that a deeper connection was not realized until the work of Sierpiński and Voronoi in the early twentieth century. (Very briefly, their techniques apply Poisson summation to transform the partial sums above into a form that makes the analogy clearer.)
A second connection would have to wait until the development of automorphic forms over the next two decades. In this context, the circle and divisor problems can be posed as estimates for partial sums of coefficients of theta functions and powers of the Riemann zeta function, respectively.
Perhaps the connection between the GCP and the DDP would have been realized sooner if the initial bounds (due to Gauss and Dirichlet, respectively) in each problem had been derived using similar techniques. Indeed, Gauss’ estimate amounts to estimating the area of a narrow annulus, while Dirichlet’s estimate relies upon what has become known as the Dirichlet hyperbola method. [This has been discussed in an earlier post on this site.]
In essence, the hyperbola method takes advantage of the -symmetry of the hyperbola to convert a sum of length into one of length . (Not-so-coincidentally, the work of Sierpiński and Voronoi converts these sums into dual sums of length .)
Since circles have -symmetry as well, it seems reasonable to suppose that a Dirichlet-style hyperbola trick could derive the Gauss bound of in the GCP. As it happens, this can be done, but there is little reason to do so, since the sums involved in estimating the GCP by counting lattice points in rows are already of length .
To see the comparison explicitly, consider the hyperbola-style decomposition
as well as the Riemann-sum-style decomposition
Both formulas can be used to prove the Gauss bound, but the second is obviously simpler. Either way, we have accomplished what we set out to do: replace a sum of length with one of length .
To estimate the sum that remains, we replace with its Taylor series and interchange the order of summation. It follows that
To estimate the inner sum above, we apply the Riemann sum estimates
to show that that the sum over in (1) is . Taking into account the sum over our error terms, we conclude that
The series that remains is a special value (at ) in the Taylor series for an anti-derivative of , namely
which gives at last the Gauss estimate:
— EXERCISES —
Exercise 1: Using the hyperbola method, show that
and use this to recover the Gauss bound. Which method gives a better effective constant in the error term?
Exercise 2: Pick’s Theorem (1899) gives a formula for calculating the area of a (simple) polygon with vertices on a lattice. This formula reads
in which is the area, is the number of interior lattice points, and is the number of lattice points on the boundary of the polygon.
Apply Pick’s Theorem to the convex hull of the collection of lattice points in a circle of radius to prove the Gauss bound. Similarly (and slightly harder), show that Pick’s Theorem implies Dirichlet’s bound.