Three-Distance Theorem

Let be a real number, and consider the arithmetic progression modulo 1. You can think of this as walking along a circle with steps of a fixed length. The three-distance theorem states that the distance between any two consecutive footprints is one of at most three distinct numbers. That is, the circle is partitioned into arcs with at most three distinct lengths.


If is rational, then eventually (namely when is the denominator of ), so the steps are then retraced. In this case there is eventually only one length between distinct consecutive points.
The interesting case is when is irrational. This is the so-called "irrational rotation", and there are either two or three distinct lengths.
comments
 
Powered by Wolfram Mathematica
Give us your feedback
Give us your feedback

Source page:




 often  occasionally  never

Note: Please do not include anything you consider confidential or proprietary. Your message and contact information may be shared with the author of any specific Demonstration for which you give feedback, but will not otherwise be published or distributed.
Privacy Policy »

Note: To run this Demonstration you need the free
Mathematica Player
or Mathematica 7+
Download or upgrade to Mathematica Player 7
I already have Mathematica Player or Mathematica 7+