<?xml version="1.0" encoding="UTF-8" standalone="yes"?><oembed><version><![CDATA[1.0]]></version><provider_name><![CDATA[Geometry and the imagination]]></provider_name><provider_url><![CDATA[https://lamington.wordpress.com]]></provider_url><author_name><![CDATA[Danny Calegari]]></author_name><author_url><![CDATA[https://lamington.wordpress.com/author/dannycaltech/]]></author_url><title><![CDATA[Roth&#8217;s theorem]]></title><type><![CDATA[link]]></type><html><![CDATA[<p>I am in Kyoto right now, attending the twenty-first <a href="http://nevanlinna.jp">Nevanlinna colloquium</a> (update: took a while to write this post &#8211; now I&#8217;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.</p>
<p>The talk started quite accessibly, being concerned with the fundamental equation</p>
<p style="padding-left:30px;"><img src="https://s0.wp.com/latex.php?latex=a+%2Bb+%3D+c&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="a +b = c" title="a +b = c" class="latex" /></p>
<p>where <img src="https://s0.wp.com/latex.php?latex=a%2Cb%2Cc&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="a,b,c" title="a,b,c" class="latex" /> are coprime positive integers. The <a href="http://en.wikipedia.org/wiki/Abc_conjecture">abc conjecture</a>, formulated by Oesterlé and Masser, says that for any positive real number <img src="https://s0.wp.com/latex.php?latex=%5Cepsilon&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;epsilon" title="&#92;epsilon" class="latex" />, there is a constant <img src="https://s0.wp.com/latex.php?latex=C_%5Cepsilon&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="C_&#92;epsilon" title="C_&#92;epsilon" class="latex" /> so that</p>
<p style="padding-left:30px;"><img src="https://s0.wp.com/latex.php?latex=%5Cmax%28a%2Cb%2Cc%29+%5Cle+C_%5Cepsilon%5Ctext%7Brad%7D%28abc%29%5E%7B1%2B%5Cepsilon%7D&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;max(a,b,c) &#92;le C_&#92;epsilon&#92;text{rad}(abc)^{1+&#92;epsilon}" title="&#92;max(a,b,c) &#92;le C_&#92;epsilon&#92;text{rad}(abc)^{1+&#92;epsilon}" class="latex" /></p>
<p>where <img src="https://s0.wp.com/latex.php?latex=%5Ctext%7Brad%7D%28abc%29&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;text{rad}(abc)" title="&#92;text{rad}(abc)" class="latex" /> is the product of the distinct primes appearing in the product <img src="https://s0.wp.com/latex.php?latex=abc&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="abc" title="abc" class="latex" />. Informally, this conjecture says that for triples <img src="https://s0.wp.com/latex.php?latex=a%2Cb%2Cc&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="a,b,c" title="a,b,c" class="latex" /> satisfying the fundamental equation, the numbers <img src="https://s0.wp.com/latex.php?latex=a%2Cb%2Cc&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="a,b,c" title="a,b,c" class="latex" /> are not divisible by &#8220;too high&#8221; powers of a prime. The abc conjecture is known to imply many interesting number theoretic statements, including (famously) Fermat&#8217;s Last Theorem (for sufficiently large exponents), and Roth&#8217;s theorem on diophantine approximation (as observed by Bombieri).</p>
<p>Roth&#8217;s theorem is the following statement:</p>
<p><strong>Theorem(Roth, 1955)</strong>: Let <img src="https://s0.wp.com/latex.php?latex=%5Calpha&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;alpha" title="&#92;alpha" class="latex" /> be a real algebraic number. Then for any <img src="https://s0.wp.com/latex.php?latex=%5Cepsilon%3E0&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;epsilon&gt;0" title="&#92;epsilon&gt;0" class="latex" />, the inequality <img src="https://s0.wp.com/latex.php?latex=%7C%5Calpha+-+p%2Fq%7C+%3C+q%5E%7B-%282%2B%5Cepsilon%29%7D&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="|&#92;alpha - p/q| &lt; q^{-(2+&#92;epsilon)}" title="|&#92;alpha - p/q| &lt; q^{-(2+&#92;epsilon)}" class="latex" /> has only finitely many solutions in coprime integers <img src="https://s0.wp.com/latex.php?latex=p%2Cq&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="p,q" title="p,q" class="latex" />.</p>
<p>This inequality is best possible, in the sense that every irrational number can be approximated by infinitely many rationals <img src="https://s0.wp.com/latex.php?latex=p%2Fq&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="p/q" title="p/q" class="latex" /> to within <img src="https://s0.wp.com/latex.php?latex=1%2F2q%5E2&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="1/2q^2" title="1/2q^2" class="latex" />. In fact, the rationals appearing in the continued fraction approximation to <img src="https://s0.wp.com/latex.php?latex=%5Calpha&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;alpha" title="&#92;alpha" class="latex" /> have this property. There is a very short and illuminating geometric proof of this fact.</p>
<p>In the plane, construct a circle packing with a circle of radius <img src="https://s0.wp.com/latex.php?latex=1%2F2q%5E2&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="1/2q^2" title="1/2q^2" class="latex" /> with center <img src="https://s0.wp.com/latex.php?latex=p%2Fq%2C1%2F2q%5E2&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="p/q,1/2q^2" title="p/q,1/2q^2" class="latex" /> for each coprime pair <img src="https://s0.wp.com/latex.php?latex=p%2Cq&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="p,q" title="p,q" class="latex" /> of integers.</p>
<p><img data-attachment-id="578" data-permalink="https://lamington.wordpress.com/2009/09/15/roths-theorem/circles_1/" data-orig-file="https://lamington.files.wordpress.com/2009/09/circles_1.jpg?w=500&#038;h=140" data-orig-size="1000,281" data-comments-opened="1" data-image-meta="{&quot;aperture&quot;:&quot;0&quot;,&quot;credit&quot;:&quot;&quot;,&quot;camera&quot;:&quot;&quot;,&quot;caption&quot;:&quot;&quot;,&quot;created_timestamp&quot;:&quot;0&quot;,&quot;copyright&quot;:&quot;&quot;,&quot;focal_length&quot;:&quot;0&quot;,&quot;iso&quot;:&quot;0&quot;,&quot;shutter_speed&quot;:&quot;0&quot;,&quot;title&quot;:&quot;&quot;}" data-image-title="circles_1" data-image-description="" data-medium-file="https://lamington.files.wordpress.com/2009/09/circles_1.jpg?w=500&#038;h=140?w=300" data-large-file="https://lamington.files.wordpress.com/2009/09/circles_1.jpg?w=500&#038;h=140?w=1000" class="aligncenter size-full wp-image-578" title="circles_1" src="https://lamington.files.wordpress.com/2009/09/circles_1.jpg?w=500&#038;h=140" alt="circles_1" width="500" height="140" srcset="https://lamington.files.wordpress.com/2009/09/circles_1.jpg?w=498&amp;h=140 498w, https://lamington.files.wordpress.com/2009/09/circles_1.jpg?w=996&amp;h=280 996w, https://lamington.files.wordpress.com/2009/09/circles_1.jpg?w=150&amp;h=42 150w, https://lamington.files.wordpress.com/2009/09/circles_1.jpg?w=300&amp;h=84 300w, https://lamington.files.wordpress.com/2009/09/circles_1.jpg?w=768&amp;h=216 768w, https://lamington.files.wordpress.com/2009/09/circles_1.jpg 1000w" sizes="(max-width: 500px) 100vw, 500px" />This circle packing nests down on the <img src="https://s0.wp.com/latex.php?latex=x&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="x" title="x" class="latex" />-axis, and any vertical line (with irrational <img src="https://s0.wp.com/latex.php?latex=x&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="x" title="x" class="latex" />-co-ordinate) intersects infinitely many circles. If the <img src="https://s0.wp.com/latex.php?latex=x&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="x" title="x" class="latex" /> co-ordinate of a vertical line is <img src="https://s0.wp.com/latex.php?latex=%5Calpha&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;alpha" title="&#92;alpha" class="latex" />, every circle the line intersects gives a rational <img src="https://s0.wp.com/latex.php?latex=p%2Fq&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="p/q" title="p/q" class="latex" /> which approximates <img src="https://s0.wp.com/latex.php?latex=%5Calpha&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;alpha" title="&#92;alpha" class="latex" /> to within <img src="https://s0.wp.com/latex.php?latex=1%2F2q%5E2&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="1/2q^2" title="1/2q^2" class="latex" />. qed.</p>
<p>On the other hand, consider the corresponding collection of circles with radius <img src="https://s0.wp.com/latex.php?latex=1%2F2q%5E%7B2%2B%5Cepsilon%7D&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="1/2q^{2+&#92;epsilon}" title="1/2q^{2+&#92;epsilon}" class="latex" />. Some &#8220;space&#8221; appears between neighboring circles, and they no longer pack tightly (the following picture shows <img src="https://s0.wp.com/latex.php?latex=%5Cepsilon+%3D+0.2&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;epsilon = 0.2" title="&#92;epsilon = 0.2" class="latex" />).</p>
<p><img data-attachment-id="580" data-permalink="https://lamington.wordpress.com/2009/09/15/roths-theorem/circles_2/" data-orig-file="https://lamington.files.wordpress.com/2009/09/circles_2.jpg?w=500&#038;h=143" data-orig-size="1000,286" data-comments-opened="1" data-image-meta="{&quot;aperture&quot;:&quot;0&quot;,&quot;credit&quot;:&quot;&quot;,&quot;camera&quot;:&quot;&quot;,&quot;caption&quot;:&quot;&quot;,&quot;created_timestamp&quot;:&quot;0&quot;,&quot;copyright&quot;:&quot;&quot;,&quot;focal_length&quot;:&quot;0&quot;,&quot;iso&quot;:&quot;0&quot;,&quot;shutter_speed&quot;:&quot;0&quot;,&quot;title&quot;:&quot;&quot;}" data-image-title="circles_2" data-image-description="" data-medium-file="https://lamington.files.wordpress.com/2009/09/circles_2.jpg?w=500&#038;h=143?w=300" data-large-file="https://lamington.files.wordpress.com/2009/09/circles_2.jpg?w=500&#038;h=143?w=1000" class="aligncenter size-full wp-image-580" title="circles_2" src="https://lamington.files.wordpress.com/2009/09/circles_2.jpg?w=500&#038;h=143" alt="circles_2" width="500" height="143" srcset="https://lamington.files.wordpress.com/2009/09/circles_2.jpg?w=500&amp;h=143 500w, https://lamington.files.wordpress.com/2009/09/circles_2.jpg?w=150&amp;h=43 150w, https://lamington.files.wordpress.com/2009/09/circles_2.jpg?w=300&amp;h=86 300w, https://lamington.files.wordpress.com/2009/09/circles_2.jpg?w=768&amp;h=220 768w, https://lamington.files.wordpress.com/2009/09/circles_2.jpg 1000w" sizes="(max-width: 500px) 100vw, 500px" />The total cross-sectional width of these circles, restricted to pairs <img src="https://s0.wp.com/latex.php?latex=p%2Fq&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="p/q" title="p/q" class="latex" /> in the interval <img src="https://s0.wp.com/latex.php?latex=%5B0%2C1%29&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="[0,1)" title="[0,1)" class="latex" />, can be estimated as follows. Each <img src="https://s0.wp.com/latex.php?latex=p%2Fq&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="p/q" title="p/q" class="latex" /> contributes a width of <img src="https://s0.wp.com/latex.php?latex=1%2F2q%5E%7B2%2B%5Cepsilon%7D&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="1/2q^{2+&#92;epsilon}" title="1/2q^{2+&#92;epsilon}" class="latex" />. Ignoring the coprime condition, there are <img src="https://s0.wp.com/latex.php?latex=q&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="q" title="q" class="latex" /> fractions of the form <img src="https://s0.wp.com/latex.php?latex=p%2Fq&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="p/q" title="p/q" class="latex" /> in the interval <img src="https://s0.wp.com/latex.php?latex=%5B0%2C1%29&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="[0,1)" title="[0,1)" class="latex" />, so the total width is less than <img src="https://s0.wp.com/latex.php?latex=%5Cfrac+1+2+%5Csum_q+q%5E%7B-1-%5Cepsilon%7D&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;frac 1 2 &#92;sum_q q^{-1-&#92;epsilon}" title="&#92;frac 1 2 &#92;sum_q q^{-1-&#92;epsilon}" class="latex" /> which converges for positive <img src="https://s0.wp.com/latex.php?latex=%5Cepsilon&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;epsilon" title="&#92;epsilon" class="latex" />. 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.</p>
<p>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 <img src="https://s0.wp.com/latex.php?latex=%5Csum_%7Bn%3D1%7D%5E%5Cinfty+10%5E%7B-n%21%7D&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;sum_{n=1}^&#92;infty 10^{-n!}" title="&#92;sum_{n=1}^&#92;infty 10^{-n!}" class="latex" />.</p>
<p>Some special cases of Roth&#8217;s theorem are much easier than others. For instance, it is very easy to give a proof when <img src="https://s0.wp.com/latex.php?latex=%5Calpha&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;alpha" title="&#92;alpha" class="latex" /> is a quadratic irrational; i.e. an element of <img src="https://s0.wp.com/latex.php?latex=%5Cmathbb%7BQ%7D%28%5Csqrt%7Bd%7D%29&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;mathbb{Q}(&#92;sqrt{d})" title="&#92;mathbb{Q}(&#92;sqrt{d})" class="latex" /> for some integer <img src="https://s0.wp.com/latex.php?latex=d&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="d" title="d" class="latex" />. 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 <img src="https://s0.wp.com/latex.php?latex=%5Ctext%7BPSL%7D%282%2C%5Cmathbb%7BZ%7D%29&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;text{PSL}(2,&#92;mathbb{Z})" title="&#92;text{PSL}(2,&#92;mathbb{Z})" class="latex" /> acts on the upper half-plane, which we think of now as the complex numbers with non-negative imaginary part, by fractional linear transformations <img src="https://s0.wp.com/latex.php?latex=z+%5Cto+%28az%2Bb%29%2F%28cz%2Bd%29&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="z &#92;to (az+b)/(cz+d)" title="z &#92;to (az+b)/(cz+d)" class="latex" />. The quotient is a hyperbolic triangle orbifold, with a <em>cusp.</em> A vertical line in the plane ending at a point <img src="https://s0.wp.com/latex.php?latex=%5Calpha&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;alpha" title="&#92;alpha" class="latex" /> on the <img src="https://s0.wp.com/latex.php?latex=x&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="x" title="x" class="latex" />-axis projects to a geodesic ray in the triangle orbifold. A rational number <img src="https://s0.wp.com/latex.php?latex=p%2Fq&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="p/q" title="p/q" class="latex" /> approximating <img src="https://s0.wp.com/latex.php?latex=%5Calpha&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;alpha" title="&#92;alpha" class="latex" /> to within <img src="https://s0.wp.com/latex.php?latex=1%2F2q%5E2&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="1/2q^2" title="1/2q^2" class="latex" /> is detected by the geodesic entering a horoball centered at the cusp. If <img src="https://s0.wp.com/latex.php?latex=%5Calpha&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;alpha" title="&#92;alpha" class="latex" /> 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 <img src="https://s0.wp.com/latex.php?latex=%5Calpha&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;alpha" title="&#92;alpha" class="latex" /> never get better than <img src="https://s0.wp.com/latex.php?latex=C%2F2q%5E2&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="C/2q^2" title="C/2q^2" class="latex" /> for some constant <img src="https://s0.wp.com/latex.php?latex=C&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="C" title="C" class="latex" /> depending on <img src="https://s0.wp.com/latex.php?latex=%5Calpha&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;alpha" title="&#92;alpha" class="latex" />, as required. A different vertical line intersecting the <img src="https://s0.wp.com/latex.php?latex=x&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="x" title="x" class="latex" />-axis at some <img src="https://s0.wp.com/latex.php?latex=%5Cbeta&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;beta" title="&#92;beta" class="latex" /> corresponds to a different geodesic ray; the existence of good rational approximations to <img src="https://s0.wp.com/latex.php?latex=%5Cbeta&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;beta" title="&#92;beta" class="latex" /> 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 &#8220;random&#8221; geodesic on a cusped hyperbolic surface takes time <img src="https://s0.wp.com/latex.php?latex=n&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="n" title="n" class="latex" /> to go distance <img src="https://s0.wp.com/latex.php?latex=%5Clog%7Bn%7D&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;log{n}" title="&#92;log{n}" class="latex" /> out the cusp (this is a kind of equidistribution fact &#8211; the thickness of the cusp goes to zero like <img src="https://s0.wp.com/latex.php?latex=e%5E%7B-t%7D&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="e^{-t}" title="e^{-t}" class="latex" />, so if one chooses a sequence of points in a hyperbolic surface at random with respect to the uniform (area) measure, it takes about <img src="https://s0.wp.com/latex.php?latex=n&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="n" title="n" class="latex" /> points to find one that is distance <img src="https://s0.wp.com/latex.php?latex=%5Clog%7Bn%7D&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;log{n}" title="&#92;log{n}" class="latex" /> out the cusp). If one expects that every geodesic ray corresponding to an algebraic number looks like a &#8220;typical&#8221; random geodesic, one would conjecture (and in fact, Lang <em>did</em> conjecture) that there are only finitely many <img src="https://s0.wp.com/latex.php?latex=p%2Fq&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="p/q" title="p/q" class="latex" /> for which <img src="https://s0.wp.com/latex.php?latex=%7Cp%2Fq+-+%5Calpha%7C+%3C+q%5E%7B-2%7D%28%5Clog%7Bq%7D%29%5E%7B-1-%5Cepsilon%7D&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="|p/q - &#92;alpha| &lt; q^{-2}(&#92;log{q})^{-1-&#92;epsilon}" title="|p/q - &#92;alpha| &lt; q^{-2}(&#92;log{q})^{-1-&#92;epsilon}" class="latex" /> for any <img src="https://s0.wp.com/latex.php?latex=%5Cepsilon+%3E+0&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;epsilon &gt; 0" title="&#92;epsilon &gt; 0" class="latex" />.</p>
<p>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 <img src="https://s0.wp.com/latex.php?latex=%5Calpha+%3D+%281%2B%5Csqrt%7B5%7D%29%2F2&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;alpha = (1+&#92;sqrt{5})/2" title="&#92;alpha = (1+&#92;sqrt{5})/2" class="latex" />. The matrix <img src="https://s0.wp.com/latex.php?latex=A%3D%5Cleft%28+%5Cbegin%7Bsmallmatrix%7D+2+%26+1+%5C+1+%26+1+%5Cend%7Bsmallmatrix%7D+%5Cright%29&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="A=&#92;left( &#92;begin{smallmatrix} 2 &amp; 1 &#92; 1 &amp; 1 &#92;end{smallmatrix} &#92;right)" title="A=&#92;left( &#92;begin{smallmatrix} 2 &amp; 1 &#92; 1 &amp; 1 &#92;end{smallmatrix} &#92;right)" class="latex" /> has <img src="https://s0.wp.com/latex.php?latex=%5Cleft%28+%5Cbegin%7Bsmallmatrix%7D+%5Calpha+%5C+1+%5Cend%7Bsmallmatrix%7D+%5Cright%29&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;left( &#92;begin{smallmatrix} &#92;alpha &#92; 1 &#92;end{smallmatrix} &#92;right)" title="&#92;left( &#92;begin{smallmatrix} &#92;alpha &#92; 1 &#92;end{smallmatrix} &#92;right)" class="latex" /> and <img src="https://s0.wp.com/latex.php?latex=%5Cleft%28+%5Cbegin%7Bsmallmatrix%7D+%5Cbar%7B%5Calpha%7D+%5C+1+%5Cend%7Bsmallmatrix%7D+%5Cright%29&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;left( &#92;begin{smallmatrix} &#92;bar{&#92;alpha} &#92; 1 &#92;end{smallmatrix} &#92;right)" title="&#92;left( &#92;begin{smallmatrix} &#92;bar{&#92;alpha} &#92; 1 &#92;end{smallmatrix} &#92;right)" class="latex" /> as eigenvectors (here <img src="https://s0.wp.com/latex.php?latex=%5Cbar%7B%5Calpha%7D&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;bar{&#92;alpha}" title="&#92;bar{&#92;alpha}" class="latex" /> denotes the &#8220;conjugate&#8221; <img src="https://s0.wp.com/latex.php?latex=1-%5Calpha&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="1-&#92;alpha" title="1-&#92;alpha" class="latex" />), and thus preserves a &#8220;wedge&#8221; in <img src="https://s0.wp.com/latex.php?latex=%5Cmathbb%7BR%7D%5E2&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;mathbb{R}^2" title="&#92;mathbb{R}^2" class="latex" /> bounded by lines with slopes <img src="https://s0.wp.com/latex.php?latex=%5Calpha&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;alpha" title="&#92;alpha" class="latex" /> and <img src="https://s0.wp.com/latex.php?latex=%5Cbar%7B%5Calpha%7D&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;bar{&#92;alpha}" title="&#92;bar{&#92;alpha}" class="latex" />. The set of integer lattice points in this wedge is permuted by <img src="https://s0.wp.com/latex.php?latex=A&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="A" title="A" class="latex" />, and therefore so is the boundary of the convex hull of this set (the <em>sail</em> of the cone). Lattice points on the sail correspond to rational approximations to the boundary slopes; the fact that <img src="https://s0.wp.com/latex.php?latex=A&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="A" title="A" class="latex" /> permutes this set corresponds to the periodicity of the continued fraction expansion of <img src="https://s0.wp.com/latex.php?latex=%5Calpha&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;alpha" title="&#92;alpha" class="latex" /> (and certifies the fact that <img src="https://s0.wp.com/latex.php?latex=%5Calpha&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;alpha" title="&#92;alpha" class="latex" /> cannot be approximated better than quadratically by rational numbers).</p>
<p>There is an analogue of this construction in higher dimensions: let <img src="https://s0.wp.com/latex.php?latex=A&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="A" title="A" class="latex" /> be an <img src="https://s0.wp.com/latex.php?latex=n%5Ctimes+n&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="n&#92;times n" title="n&#92;times n" class="latex" /> integer matrix whose eigenvalues are all real, positive, irrational and distinct. A collection of <img src="https://s0.wp.com/latex.php?latex=n&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="n" title="n" class="latex" /> suitable eigenvectors spans a polyhedral cone which is invariant under <img src="https://s0.wp.com/latex.php?latex=A&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="A" title="A" class="latex" />. 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 &#8220;best&#8221; integral approximations to the eigenvectors. In fact, there is a <img src="https://s0.wp.com/latex.php?latex=%5Cmathbb%7BZ%7D%5E%7Bn-1%7D&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;mathbb{Z}^{n-1}" title="&#92;mathbb{Z}^{n-1}" class="latex" /> subgroup of <img src="https://s0.wp.com/latex.php?latex=%5Ctext%7BSL%7D%28n%2C%5Cmathbb%7BZ%7D%29&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;text{SL}(n,&#92;mathbb{Z})" title="&#92;text{SL}(n,&#92;mathbb{Z})" class="latex" /> consisting of matrices with the same set of eigenvectors (this is a consequence of <a href="http://en.wikipedia.org/wiki/Dirichlet%27s_unit_theorem">Dirichlet&#8217;s theorem</a> 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 <em>a priori</em> 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&#8217;s theorem along these lines, at least for algebraic numbers in totally real fields, but I don&#8217;t know the answer.</p>
]]></html><thumbnail_url><![CDATA[https://i2.wp.com/lamington.wordpress.com/files/2009/09/circles_1.jpg?fit=440%2C330]]></thumbnail_url><thumbnail_width><![CDATA[440]]></thumbnail_width><thumbnail_height><![CDATA[124]]></thumbnail_height></oembed>