In mathematics, a Beatty sequence (or homogeneous Beatty sequence) is the sequence of integers found by taking the floor of the positive multiples of a positive irrational number. Beatty sequences are named after Samuel Beatty, who wrote about them in 1926.
Contents
- Definition
- Examples
- History
- Rayleigh theorem
- First proof
- Second proof
- Properties
- Relation with Sturmian sequences
- Generalizations
- Additional reading
- References
Rayleigh's theorem, named after Lord Rayleigh, states that the complement of a Beatty sequence, consisting of the positive integers that are not in the sequence, is itself a Beatty sequence generated by a different irrational number.
Beatty sequences can also be used to generate Sturmian words.
Definition
A positive irrational number
If
form a pair of complementary Beatty sequences. Here, "complementary" means that every positive integer belongs to exactly one of these two sequences.
Examples
For r = the golden mean, we have s = r + 1. In this case, the sequence
and the complementary sequence
These sequences define the optimal strategy for Wythoff's game, and are used in the definition of the Wythoff array
As another example, for r = √2, we have s = 2 + √2. In this case, the sequences are
And for r = π and s = π/(π - 1) the sequences are
Notice that any number in the first sequence is lacking in the second, and vice versa.
History
Beatty sequences got their name from the problem posed in the American Mathematical Monthly by Samuel Beatty in 1926. It is probably one of the most often cited problems ever posed in the Monthly. However, even earlier, in 1894 such sequences were briefly mentioned by John W. Strutt (3rd Baron Rayleigh) in the second edition of his book The Theory of Sound.
Rayleigh theorem
The Rayleigh theorem (also known as Beatty's theorem) states that given an irrational number
First proof
Given
To see that no two of the numbers can occupy the same position (as a single number), suppose to the contrary that
For any j/r, there are j numbers i/r ≤ j/r and
Likewise, the position of k/s in the list is
Conclusion: every positive integer (that is, every position in the list) is of the form
Second proof
Collisions: Suppose that, contrary to the theorem, there are integers j > 0 and k and m such that
This is equivalent to the inequalities
For non-zero j, the irrationality of r and s is incompatible with equality, so
which lead to
Adding these together and using the hypothesis, we get
which is impossible (one cannot have an integer between two adjacent integers). Thus the supposition must be false.
Anti-collisions: Suppose that, contrary to the theorem, there are integers j > 0 and k and m such that
Since j + 1 is non-zero and r and s are irrational, we can exclude equality, so
Then we get
Adding corresponding inequalities, we get
which is also impossible. Thus the supposition is false.
Properties
Proof:
Furthermore,
Proof:
Relation with Sturmian sequences
The first difference
of the Beatty sequence associated to the irrational number
Generalizations
The Lambek–Moser theorem generalizes the Rayleigh theorem and shows that more general pairs of sequences defined from an integer function and its inverse have the same property of partitioning the integers.
Uspensky's theorem states that, if