Beatty sequence

Jump to navigation Jump to search

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.

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[edit]

A positive irrational number r {\displaystyle r} generates the Beatty sequence

B r = ⌊ r ⌋ , ⌊ 2 r ⌋ , ⌊ 3 r ⌋ , … {\displaystyle {\mathcal {B}}_{r}=\lfloor r\rfloor ,\lfloor 2r\rfloor ,\lfloor 3r\rfloor ,\ldots }

If r > 1 , {\displaystyle r>1\,,} then s = r / ( r − 1 ) {\displaystyle s=r/(r-1)} is also a positive irrational number. These two numbers naturally satisfy the equation 1 / r + 1 / s = 1 {\displaystyle 1/r+1/s=1} . The two Beatty sequences they generate,

B r = ( ⌊ n r ⌋ ) n ≥ 1 {\displaystyle {\mathcal {B}}_{r}=(\lfloor nr\rfloor )_{n\geq 1}} and

B s = ( ⌊ n s ⌋ ) n ≥ 1 {\displaystyle {\mathcal {B}}_{s}=(\lfloor ns\rfloor )_{n\geq 1}} ,

form a pair of complementary Beatty sequences. Here, "complementary" means that every positive integer belongs to exactly one of these two sequences.

Examples[edit]

When r is the golden mean, we have s = r + 1. In this case, the sequence ( ⌊ n r ⌋ ) {\displaystyle (\lfloor nr\rfloor )} , known as the lower Wythoff sequence, is

and the complementary sequence ( ⌊ n s ⌋ ) {\displaystyle (\lfloor ns\rfloor )} , the upper Wythoff sequence, is

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

• 1, 2, 4, 5, 7, 8, 9, 11, 12, 14, 15, 16, 18, 19, 21, 22, 24, ... (sequence A001951 in the OEIS) and
• 3, 6, 10, 13, 17, 20, 23, 27, 30, 34, 37, 40, 44, 47, 51, 54, 58, ... (sequence A001952 in the OEIS).

And for r = π and s = π/(π − 1) the sequences are

• 3, 6, 9, 12, 15, 18, 21, 25, 28, 31, 34, 37, 40, 43, 47, 50, 53, ... (sequence A022844 in the OEIS) and
• 1, 2, 4, 5, 7, 8, 10, 11, 13, 14, 16, 17, 19, 20, 22, 23, 24, 26, ... (sequence A054386 in the OEIS).

Any number in the first sequence is absent in the second, and vice versa.

History[edit]

Beatty sequences got their name from the problem posed in the American Mathematical Monthly by Samuel Beatty in 1926.[1][2] 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.[3]

Rayleigh theorem[edit]

The Rayleigh theorem (also known as Beatty's theorem) states that given an irrational number r > 1 , {\displaystyle r>1\,,} there exists s > 1 {\displaystyle s>1} so that the Beatty sequences B r {\displaystyle {\mathcal {B}}_{r}} and B s {\displaystyle {\mathcal {B}}_{s}} partition the set of positive integers: each positive integer belongs to exactly one of the two sequences.[3]

First proof[edit]

Given r > 1 , {\displaystyle r>1\,,} let s = r / ( r − 1 ) {\displaystyle s=r/(r-1)} . We must show that every positive integer lies in one and only one of the two sequences B r {\displaystyle {\mathcal {B}}_{r}} and B s {\displaystyle {\mathcal {B}}_{s}} . We shall do so by considering the ordinal positions occupied by all the fractions j / r {\displaystyle j/r} and k / s {\displaystyle k/s} when they are jointly listed in nondecreasing order for positive integers j and k.

To see that no two of the numbers can occupy the same position (as a single number), suppose to the contrary that j / r = k / s {\displaystyle j/r=k/s} for some j and k. Then r / s {\displaystyle r/s} = j / k {\displaystyle j/k} , a rational number, but also, r / s = r ( 1 − 1 / r ) = r − 1 , {\displaystyle r/s=r(1-1/r)=r-1,} not a rational number. Therefore, no two of the numbers occupy the same position.

For any j / r {\displaystyle j/r} , there are j {\displaystyle j} positive integers i {\displaystyle i} such that i / r ≤ j / r {\displaystyle i/r\leq j/r} and ⌊ j s / r ⌋ {\displaystyle \lfloor js/r\rfloor } positive integers k {\displaystyle k} such that k / s ≤ j / r {\displaystyle k/s\leq j/r} , so that the position of j / r {\displaystyle j/r} in the list is j + ⌊ j s / r ⌋ {\displaystyle j+\lfloor js/r\rfloor } . The equation 1 / r + 1 / s = 1 {\displaystyle 1/r+1/s=1} implies

j + ⌊ j s / r ⌋ = j + ⌊ j ( s − 1 ) ⌋ = ⌊ j s ⌋ . {\displaystyle j+\lfloor js/r\rfloor =j+\lfloor j(s-1)\rfloor =\lfloor js\rfloor .}

Likewise, the position of k / s {\displaystyle k/s} in the list is ⌊ k r ⌋ {\displaystyle \lfloor kr\rfloor } .

Conclusion: every positive integer (that is, every position in the list) is of the form ⌊ n r ⌋ {\displaystyle \lfloor nr\rfloor }  or of the form ⌊ n s ⌋ {\displaystyle \lfloor ns\rfloor } , but not both. The converse statement is also true: if p and q are two real numbers such that every positive integer occurs precisely once in the above list, then p and q are irrational and the sum of their reciprocals is 1.

Second proof[edit]

Collisions: Suppose that, contrary to the theorem, there are integers j > 0 and k and m such that

j = ⌊ k ⋅ r ⌋ = ⌊ m ⋅ s ⌋ . {\displaystyle j=\left\lfloor {k\cdot r}\right\rfloor =\left\lfloor {m\cdot s}\right\rfloor \,.}

This is equivalent to the inequalities

j ≤ k ⋅ r < j + 1  and  j ≤ m ⋅ s < j + 1. {\displaystyle j\leq k\cdot r<j+1{\text{ and }}j\leq m\cdot s<j+1.}

For non-zero j, the irrationality of r and s is incompatible with equality, so

j < k ⋅ r < j + 1  and  j < m ⋅ s < j + 1 {\displaystyle j<k\cdot r<j+1{\text{ and }}j<m\cdot s<j+1}

which lead to

j r < k < j + 1 r  and  j s < m < j + 1 s . {\displaystyle {j \over r}<k<{j+1 \over r}{\text{ and }}{j \over s}<m<{j+1 \over s}.}

Adding these together and using the hypothesis, we get

j < k + m < j + 1 {\displaystyle j<k+m<j+1}

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

k ⋅ r < j  and  j + 1 ≤ ( k + 1 ) ⋅ r  and  m ⋅ s < j  and  j + 1 ≤ ( m + 1 ) ⋅ s . {\displaystyle k\cdot r<j{\text{ and }}j+1\leq (k+1)\cdot r{\text{ and }}m\cdot s<j{\text{ and }}j+1\leq (m+1)\cdot s\,.}

Since j + 1 is non-zero and r and s are irrational, we can exclude equality, so

k ⋅ r < j  and  j + 1 < ( k + 1 ) ⋅ r  and  m ⋅ s < j  and  j + 1 < ( m + 1 ) ⋅ s . {\displaystyle k\cdot r<j{\text{ and }}j+1<(k+1)\cdot r{\text{ and }}m\cdot s<j{\text{ and }}j+1<(m+1)\cdot s.}

Then we get

k < j r  and  j + 1 r < k + 1  and  m < j s  and  j + 1 s < m + 1 {\displaystyle k<{j \over r}{\text{ and }}{j+1 \over r}<k+1{\text{ and }}m<{j \over s}{\text{ and }}{j+1 \over s}<m+1}

Adding corresponding inequalities, we get

k + m < j  and  j + 1 < k + m + 2 {\displaystyle k+m<j{\text{ and }}j+1<k+m+2}

k + m < j < k + m + 1 {\displaystyle k+m<j<k+m+1}

which is also impossible. Thus the supposition is false.

Properties[edit]

m ∈ B r {\displaystyle m\in {\mathcal {B}}_{r}} if and only if

1 − 1 r < [ m r ] 1 {\displaystyle 1-{\frac {1}{r}}<\left[{\frac {m}{r}}\right]_{1}}

where [ x ] 1 {\displaystyle [x]_{1}} denotes the fractional part of x {\displaystyle x} i.e., [ x ] 1 = x − ⌊ x ⌋ {\displaystyle [x]_{1}=x-\lfloor x\rfloor } .

Proof:

m ∈ B r {\displaystyle m\in B_{r}}

⇔ ∃ n , m = ⌊ n r ⌋ {\displaystyle \Leftrightarrow \exists n,m=\lfloor nr\rfloor }

⇔ m < n r < m + 1 {\displaystyle \Leftrightarrow m<nr<m+1}

⇔ m r < n < m r + 1 r {\displaystyle \Leftrightarrow {\frac {m}{r}}<n<{\frac {m}{r}}+{\frac {1}{r}}}

⇔ n − 1 r < m r < n {\displaystyle \Leftrightarrow n-{\frac {1}{r}}<{\frac {m}{r}}<n}

⇔ 1 − 1 r < [ m r ] 1 {\displaystyle \Leftrightarrow 1-{\frac {1}{r}}<\left[{\frac {m}{r}}\right]_{1}}

Furthermore, m = ⌊ ( ⌊ m r ⌋ + 1 ) r ⌋ {\displaystyle m=\left\lfloor \left(\left\lfloor {\frac {m}{r}}\right\rfloor +1\right)r\right\rfloor } .

Proof:

m = ⌊ ( ⌊ m r ⌋ + 1 ) r ⌋ {\displaystyle m=\left\lfloor \left(\left\lfloor {\frac {m}{r}}\right\rfloor +1\right)r\right\rfloor }

⇔ m < ( ⌊ m r ⌋ + 1 ) r < m + 1 {\displaystyle \Leftrightarrow m<\left(\left\lfloor {\frac {m}{r}}\right\rfloor +1\right)r<m+1}

⇔ m r < ⌊ m r ⌋ + 1 < m + 1 r {\displaystyle \Leftrightarrow {\frac {m}{r}}<\left\lfloor {\frac {m}{r}}\right\rfloor +1<{\frac {m+1}{r}}}

⇔ ⌊ m r ⌋ + 1 − 1 r < m r < ⌊ m r ⌋ + 1 {\displaystyle \Leftrightarrow \left\lfloor {\frac {m}{r}}\right\rfloor +1-{\frac {1}{r}}<{\frac {m}{r}}<\left\lfloor {\frac {m}{r}}\right\rfloor +1}

⇔ 1 − 1 r < m r − ⌊ m r ⌋ = [ m r ] 1 {\displaystyle \Leftrightarrow 1-{\frac {1}{r}}<{\frac {m}{r}}-\left\lfloor {\frac {m}{r}}\right\rfloor =\left[{\frac {m}{r}}\right]_{1}}

Relation with Sturmian sequences[edit]

The first difference

⌊ ( n + 1 ) r ⌋ − ⌊ n r ⌋ {\displaystyle \lfloor (n+1)r\rfloor -\lfloor nr\rfloor }

of the Beatty sequence associated with the irrational number r {\displaystyle r} is a characteristic Sturmian word over the alphabet { ⌊ r ⌋ , ⌊ r ⌋ + 1 } {\displaystyle \{\lfloor r\rfloor ,\lfloor r\rfloor +1\}} .

Generalizations[edit]

If slightly modified, the Rayleigh's theorem can be generalized to positive real numbers (not necessarily irrational) and negative integers as well: if positive real numbers r {\displaystyle r} and s {\displaystyle s} satisfy 1 / r + 1 / s = 1 {\displaystyle 1/r+1/s=1} , the sequences ( ⌊ m r ⌋ ) m ∈ Z {\displaystyle (\lfloor mr\rfloor )_{m\in \mathbb {Z} }} and ( ⌈ n s ⌉ − 1 ) n ∈ Z {\displaystyle (\lceil ns\rceil -1)_{n\in \mathbb {Z} }} form a partition of integers.

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 α 1 , … , α n {\displaystyle \alpha _{1},\ldots ,\alpha _{n}} are positive real numbers such that ( ⌊ k α i ⌋ ) k , i ≥ 1 {\displaystyle (\lfloor k\alpha _{i}\rfloor )_{k,i\geq 1}} contains all positive integers exactly once, then n ≤ 2. {\displaystyle n\leq 2.} That is, there is no equivalent of Rayleigh's theorem for three or more Beatty sequences.[4][5]

References[edit]

Further reading[edit]

• Holshouser, Arthur; Reiter, Harold (2001). "A generalization of Beatty's Theorem". Southwest Journal of Pure and Applied Mathematics. 2: 24–29. Archived from the original on 2014-04-19.
• Stolarsky, Kenneth (1976). "Beatty sequences, continued fractions, and certain shift operators". Canadian Mathematical Bulletin. 19 (4): 473–482. doi:10.4153/CMB-1976-071-6. MR 0444558. Includes many references.

External links[edit]