You are currently browsing the tag archive for the ‘Roth’s theorem’ tag.

I am in Kyoto right now, attending the twenty-first Nevanlinna colloquium (update: took a while to write this post – now I’m in Sydney for the Clay lectures). Yesterday, Junjiro Noguchi gave a plenary talk on Nevanlinna theory in higher dimensions and related Diophantine problems. The talk was quite technical, and I did not understand it very well; however, he said a few suggestive things early on which struck a chord.

The talk started quite accessibly, being concerned with the fundamental equation

where are coprime positive integers. The abc conjecture, formulated by Oesterlé and Masser, says that for any positive real number , there is a constant so that

where is the product of the distinct primes appearing in the product . Informally, this conjecture says that for triples satisfying the fundamental equation, the numbers are not divisible by “too high” powers of a prime. The abc conjecture is known to imply many interesting number theoretic statements, including (famously) Fermat’s Last Theorem (for sufficiently large exponents), and Roth’s theorem on diophantine approximation (as observed by Bombieri).

Roth’s theorem is the following statement:

**Theorem(Roth, 1955)**: Let be a real algebraic number. Then for any , the inequality has only finitely many solutions in coprime integers .

This inequality is best possible, in the sense that every irrational number can be approximated by infinitely many rationals to within . In fact, the rationals appearing in the continued fraction approximation to have this property. There is a very short and illuminating geometric proof of this fact.

In the plane, construct a circle packing with a circle of radius with center for each coprime pair of integers.

This circle packing nests down on the -axis, and any vertical line (with irrational -co-ordinate) intersects infinitely many circles. If the co-ordinate of a vertical line is , every circle the line intersects gives a rational which approximates to within . qed.

On the other hand, consider the corresponding collection of circles with radius . Some “space” appears between neighboring circles, and they no longer pack tightly (the following picture shows ).

The total cross-sectional width of these circles, restricted to pairs in the interval , can be estimated as follows. Each contributes a width of . Ignoring the coprime condition, there are fractions of the form in the interval , so the total width is less than which converges for positive . In other words, the total cross-sectional width of all circles is finite. It follows that almost every vertical line intersects only finitely many circles.

Some vertical lines do, in fact, intersect infinitely many circles; i.e. some real numbers are approximated by infinitely many rationals to better than quadratic accuracy; for example, a Liouville number like .

Some special cases of Roth’s theorem are much easier than others. For instance, it is very easy to give a proof when is a quadratic irrational; i.e. an element of for some integer . Quadratic irrationals are characterized by the fact that their continued fraction expansions are eventually periodic. One can think of this geometrically as follows. The group acts on the upper half-plane, which we think of now as the complex numbers with non-negative imaginary part, by fractional linear transformations . The quotient is a hyperbolic triangle orbifold, with a *cusp.* A vertical line in the plane ending at a point on the -axis projects to a geodesic ray in the triangle orbifold. A rational number approximating to within is detected by the geodesic entering a horoball centered at the cusp. If is a quadratic irrational, the corresponding geodesic ray eventually winds around a periodic geodesic (this is the periodicity of the continued fraction expansion), so it never gets too deep into the cusp, and the rational approximations to never get better than for some constant depending on , as required. A different vertical line intersecting the -axis at some corresponds to a different geodesic ray; the existence of good rational approximations to corresponds to the condition that the corresponding geodesic goes deeper and deeper into the cusp infinitely often at a definite rate (i.e. at a distance which is at least some fixed (fractional) power of time). A “random” geodesic on a cusped hyperbolic surface takes time to go distance out the cusp (this is a kind of equidistribution fact – the thickness of the cusp goes to zero like , so if one chooses a sequence of points in a hyperbolic surface at random with respect to the uniform (area) measure, it takes about points to find one that is distance out the cusp). If one expects that every geodesic ray corresponding to an algebraic number looks like a “typical” random geodesic, one would conjecture (and in fact, Lang *did* conjecture) that there are only finitely many for which for any .

A slightly different (though related) geometric way to see the periodicity of the continued fraction expansion of a quadratic irrational is to use diophantine geometry. This is best illustrated with an example. Consider the golden number . The matrix has and as eigenvectors (here denotes the “conjugate” ), and thus preserves a “wedge” in bounded by lines with slopes and . The set of integer lattice points in this wedge is permuted by , and therefore so is the boundary of the convex hull of this set (the *sail* of the cone). Lattice points on the sail correspond to rational approximations to the boundary slopes; the fact that permutes this set corresponds to the periodicity of the continued fraction expansion of (and certifies the fact that cannot be approximated better than quadratically by rational numbers).

There is an analogue of this construction in higher dimensions: let be an integer matrix whose eigenvalues are all real, positive, irrational and distinct. A collection of suitable eigenvectors spans a polyhedral cone which is invariant under . The convex hull of the set of integer lattice points in this cone is a polyhedron, and the vertices of this polyhedron (the vertices on the sail) are the “best” integral approximations to the eigenvectors. In fact, there is a subgroup of consisting of matrices with the same set of eigenvectors (this is a consequence of Dirichlet’s theorem on the structure of the group of units in the integers in a number field). Hence there is a group that acts discretely and co-compactly on the vertices of the sail, and one gets *a priori* estimates on how well the eigenvectors can be approximated by integral vectors. It is interesting to ask whether one can give a proof of Roth’s theorem along these lines, at least for algebraic numbers in totally real fields, but I don’t know the answer.

## Recent Comments