Lambek–Moser theorem

In combinatorial number theory, the Lambek–Moser theorem defines a partition of the positive integers into two subsets from any non-decreasing integer-valued function and its inverse function. It is a generalization of Rayleigh's theorem, on the complementary Beatty sequences obtained by rounding down irrational multiples of the integers. Any partition of the positive integers into two complementary subsets may be defined from a non-decreasing function using the Lambek–Moser theorem.

The Lambek–Moser theorem is named for Joachim Lambek and Leo Moser, who published it in 1954, and should be distinguished from an unrelated theorem of Lambek and Moser, later strengthened by Wild, on the number of primitive Pythagorean triples.

Statement

There are two parts to the Lambek–Moser theorem. One part states that two integers functions that are inverse, in a certain sense, can be used to construct a partition of the positive integers into two complementary subsets, and the other part states that every complementary partition can be constructed in this way.

From functions to partitions

The four functions $f$, $f^{*}$, $F$, and $F^{*}$, for the two Beatty sequences 1, 3, 4, 6, ... and 2, 5, 7, 10, ... . These sequences round down the integer multiples of $\varphi$ and $\varphi +1$, where $\varphi$ is the golden ratio.

The theorem applies to any non-decreasing and unbounded function $f$ that maps positive integers to non-negative integers. From any such function $f$, define $f^{*}$ to be the integer-valued function that is as close as possible to the inverse function of $f$, in the sense that, for all positive integers $n$,

$$f{\bigl (}f^{*}(n){\bigr )}<n\leq f{\bigl (}f^{*}(n)+1{\bigr )}.$$

Equivalently, $f^{*}(n)$ may be defined as the number of values $x$ for which $f(x)<n$. It follows from either of these definitions that $f^{*}{}^{*}=f$. Further, define two more functions $F$ and $F^{*}$, from positive integers to positive integers, by

$${\begin{aligned}F(n)&=f(n)+n\\F^{*}(n)&=f^{*}(n)+n\\\end{aligned}}$$

Then the first part of the theorem states that $F$ and $F^{*}$ are strictly increasing and that the ranges of $F$ and $F^{*}$ form a partition of the positive integers. Each of these two functions maps any integer $i$ to the $i$th element of its set in the partition.

From partitions to functions

The second part of the Lambek–Moser theorem states that this construction of partitions from inverse functions is universal, in the sense that it can explain any partition of the positive integers into two infinite parts. If $S=s_{1},s_{2},\dots$ and $S^{*}=s_{1}^{*},s_{2}^{*},\dots$ are any two complementary increasing sequences of integers, one may construct a pair of functions $f$ and $f^{*}$ from which this partition may be derived using the Lambek–Moser theorem. To do so, define $f(n)=s_{n}-n$ and $f^{*}(n)=s_{n}^{*}-n$.

Limits of iterated inverses

In the same work in which they proved the Lambek–Moser theorem, Lambek and Moser provided a method of reconstructing $F^{*}$ directly from $F$, without going through $f$ and $f^{*}$. Let $F^{\#}(n)$ denote the number of values of $x$ for which $F(x)\leq n$; this is an approximation to the inverse function of $F$, but (because it uses $\leq$ in place of $<$) offset by one from the type of inverse used to define $f^{*}$ from $f$. Then, for any $n$, $F^{*}(n)$ is the limit of the sequence

$$n,n+F^{\#}(n),n+F^{\#}{\bigl (}n+F^{\#}(n){\bigr )},\dots ,$$

meaning that this sequence eventually becomes constant and the value it takes when it does is $F^{*}(n)$.

For non-negative integers

A variation of the theorem applies to partitions of the non-negative integers, rather than to partitions of the positive integers. For this variation, every partition corresponds to a Galois connection of the ordered non-negative integers to themselves. This is a pair of non-decreasing functions $(f,f^{*})$ with the property that, for all $x$ and $y$, $f(x)\leq y$ if and only if $x\leq f(y)$. The corresponding functions $F$ and $F^{*}$ are defined slightly less symmetrically by $F(n)=f(n)+n$ and $F^{*}(n)=f^{*}(n)+n+1$. For functions defined in this way, the values of $F$ and $F^{*}$ (for non-negative arguments, rather than positive arguments) form a partition of the non-negative integers, and every partition can be constructed in this way.

Examples

For instance, consider the partition of positive integers into even and odd numbers, let $F(n)=2n$ be the $n$th even positive integer, and let $F^{*}(n)=2n-1$ be the $n$th odd positive integer. Then the two functions $f(n)=F(n)-n=n$ and $f^{*}(n)=F^{*}(n)-n=n-1$ form an inverse pair, and the partition generated via the Lambek–Moser theorem from this pair is just the partition of the positive integers into even and odd numbers. Another integer partition, into evil numbers and odious numbers (by the parity of the binary representation) uses almost the same functions, adjusted by the values of the Thue–Morse sequence.

As another example, let $f(n)=n^{2}$, the function that squares its argument. Then its inverse is the square root function, whose closest integer approximation (in the sense used for the Lambek–Moser theorem) is $f^{*}(n)=\lfloor {\sqrt {n-1}}\rfloor$. These two functions give $F(n)=n^{2}+n$ and $F^{*}(n)=\lfloor {\sqrt {n-1}}\rfloor +n.$ For $n=1,2,3,\dots$ the values of $F$ are the pronic numbers

2, 6, 12, 20, 30, 42, 56, 72, 90, 110, ...

while the values of $F^{*}$ are

1, 3, 4, 5, 7, 8, 9, 10, 11, 13, 14, ....

These two sequences are complementary: each positive integer belongs to exactly one of them. The Lambek–Moser theorem states that this phenomenon is not specific to the pronic numbers, but rather it arises for any choice of $f$ with the appropriate properties.

The two functions $f$ (rightward blue arrows) and $f^{*}$ (leftward red arrows) arising from the partition of positive integers into primes (2, 3, 5, 7, ...) and non-primes (1, 4, 6, 8, ...). Visualization based on a method of Angel.

Following earlier work of Viggo Brun and D. H. Lehmer, Lambek and Moser discuss formulas involving the prime-counting function for the functions $f$ and $f^{*}$ arising in this way from the partition of the positive integers into prime numbers and non-primes (1 and the composite numbers). If $\pi (n)$ is the prime-counting function (number of primes less than or equal to $n$), then the $n$th non-prime is given by the limit of the sequence

$$n,n+\pi (n),n+\pi {\bigl (}n+\pi (n){\bigr )},\dots$$

For some other sequences of integers, the corresponding limit converges in a fixed number of steps, and a direct formula for the complementary sequence is possible. In particular, the $n$th positive integer that is not a $k$th power can be obtained from the limiting formula as

$$n+\left\lfloor {\sqrt[{k}]{n+\lfloor {\sqrt[{k}]{n}}\rfloor }}\right\rfloor .$$

Rayleigh's theorem

Main article: Beatty sequence

Rayleigh's theorem states that for two positive irrational numbers $r$ and $s$, both greater than one, with ${\tfrac {1}{r}}+{\tfrac {1}{s}}=1$, the two sequences $\lfloor i\cdot r\rfloor$ and $\lfloor i\cdot s\rfloor$ for $i=1,2,3,\dots$, obtained by rounding down to an integer the multiples of $r$ and $s$, are complementary. It can be seen as an instance of the Lambek–Moser theorem with $f(n)=\lfloor rn\rfloor -n$ and $f^{\ast }(n)=\lfloor sn\rfloor -n$. The condition that $r$ and $s$ be greater than one implies that these two functions are non-decreasing; the derived functions are $F(n)=\lfloor rn\rfloor$ and $F^{*}(n)=\lfloor sn\rfloor .$ The sequences of values of $F$ and $F^{*}$ forming the derived partition are known as Beatty sequences, after Samuel Beatty's 1926 rediscovery of Rayleigh's theorem.

History and proofs

The theorem was discovered by Leo Moser and Joachim Lambek, who published it in 1954. Moser and Lambek cite the previous work of Samuel Beatty on Beatty sequences as their inspiration, and also cite the work of Viggo Brun and D. H. Lehmer from the early 1930s on methods related to their limiting formula for $F^{*}$. Edsger W. Dijkstra has provided a visual proof of the result, and later another proof based on algorithmic reasoning. Yuval Ginosar has provided an intuitive proof based on an analogy of two athletes running in opposite directions around a circular racetrack.

See also

• Hofstadter Figure-Figure sequences, another pair of complementary sequences to which the Lambek–Moser theorem can be applied

References

• Allouche, Jean-Paul; Dekking, F. Michel (2019), "Generalized Beatty sequences and complementary triples", Moscow Journal of Combinatorics and Number Theory, 8 (4): 325–341, arXiv:1809.03424, doi:10.2140/moscow.2019.8.325, MR 4026541
• Angel, Myer (1964), "Partitions of the natural numbers", Canadian Mathematical Bulletin, 7: 219–236, doi:10.4153/CMB-1964-020-1, MR 0161826
• Beatty, Samuel (1926), "Problem 3173", The American Mathematical Monthly, 33 (3): 159, doi:10.2307/2300153, JSTOR 2300153; Solutions by Beatty, A. Ostrowski, J. Hyslop, and A. C. Aitken, vol. 34 (1927), pp. 159–160
• Brun, Viggo (1931), "Rechenregel zur Bildung der $n$-ten Primzahl" [Calculating rules to build the $n$th prime], Norsk Matematisk Tidsskrift (in Norwegian), 13: 73–79, Zbl 0003.14902, as cited by Lambek & Moser 1954
• Chamberland, Marc (2017), "Beatty sequences", Single Digits: In Praise of Small Numbers, Princeton University Press, pp. 32–33, ISBN 978-0-691-17569-0
• Dijkstra, Edsger W. (1980), On a theorem by Lambek and Moser (PDF), Report EWD753, University of Texas
• Dijkstra, Edsger W. (1982), "Lambek and Moser revisited", in Broy, Manfred; Schmidt, Gunther (eds.), Theoretical Foundations of Programming Methodology: Lecture Notes of an International Summer School, directed by F. L. Bauer, E. W. Dijkstra and C. A. R. Hoare, NATO Advanced Study Institutes Series. Series C - Mathematical and Physical Sciences, vol. 91, D. Reidel Publishing Co., pp. 19–23, doi:10.1007/978-94-009-7893-5_2, Zbl 0533.40001
• Dos Reis, A. J.; Silberger, D. M. (1990), "Generating nonpowers by formula", Mathematics Magazine, 63 (1): 53–55, doi:10.2307/2691513, MR 1042938
• Fraenkel, Aviezri S. (1977), "Complementary systems of integers", The American Mathematical Monthly, 84 (2): 114–115, doi:10.2307/2319931, JSTOR 2319931, MR 0429815
• Garry, Y. K. K. (1997), "Inverse sequences and complementary sequences" (PDF), Mathematical Excalibur, 3 (4): 2
• Ginosar, Yuval (2014), "On the Lambek-Moser theorem", Integers, 14: A09:1–A09:4, arXiv:1207.5633
• Honsberger, Ross (1970), "Essay 12: Complementary sequences", Ingenuity in Mathematics, New Mathematical Library, vol. 23, New York: Random House, Inc., pp. 93–110, ISBN 0-394-70923-3, MR 3155264
• Lambek, Joachim (1994), "Some Galois connections in elementary number theory", Journal of Number Theory, 47 (3): 371–377, doi:10.1006/jnth.1994.1043, MR 1278405
• Lambek, Joachim; Moser, Leo (August–September 1954), "Inverse and complementary sequences of natural numbers", The American Mathematical Monthly, 61 (7): 454–458, doi:10.2307/2308078, JSTOR 2308078
• Lehmer, D. H. (1932), "An inversive algorithm", Bulletin of the American Mathematical Society, 38 (10): 693–694, doi:10.1090/S0002-9904-1932-05496-9, MR 1562488
• John William Strutt, Baron Rayleigh (1894), The Theory of Sound, vol. 1 (2nd ed.), Macmillan, p. 123
• Roberts, Joe (1992), Lure of the Integers, MAA Spectrum, Washington, DC: Mathematical Association of America, p. 11, doi:10.2307/40148160, ISBN 0-88385-502-X, MR 1189138
• Wild, Roy E. (1955), "On the number of primitive Pythagorean triangles with area less than n", Pacific Journal of Mathematics, 5: 85–91, MR 0067912