Lambek–Moser theorem

Template:Short description The Lambek–Moser theorem is a mathematical description of partitions of the natural numbers into two complementary sets. For instance, it applies to the partition of numbers into even and odd, or into prime and non-prime (one and the composite numbers). There are two parts to the Lambek–Moser theorem. One part states that any two non-decreasing integer functions that are inverse, in a certain sense, can be used to split the natural numbers into two complementary subsets, and the other part states that every complementary partition can be constructed in this way. When a formula is known for the Template:Nowrap natural number in a set, the Lambek–Moser theorem can be used to obtain a formula for the Template:Nowrap number not in the set.

The Lambek–Moser theorem belongs to combinatorial number theory. It is named for Joachim Lambek and Leo Moser, who published it in 1954,Template:Sfn and should be distinguished from an unrelated theorem of Lambek and Moser, later strengthened by Wild, on the number of primitive Pythagorean triples.Template:Sfn It extends Rayleigh's theorem, which describes complementary pairs of Beatty sequences, the sequences of rounded multiples of irrational numbers.

From functions to partitions

The four functions $f$, $f^{*}$, $F$, and $F^{*}$, for the two Beatty sequences Template:Nowrap and Template:Nowrap These sequences round down the integer multiples of $\phi$ and $\phi +1$, where $\phi$ is the golden ratio.

Let $f$ be any function from positive integers to non-negative integers that is both non-decreasing (each value in the sequence $f(1),f(2),f(3),\dots$ is at least as large as any earlier value) and unbounded (it eventually increases past any fixed value). The sequence of its values may skip some numbers, so it might not have an inverse function with the same properties. Instead, define a non-decreasing and unbounded integer function $f^{*}$ that is as close as possible to the inverse in the sense that, for all positive integers $n$, $$f(f^{*}(n))<n\le f(f^{*}(n)+1).$$ 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$. If the two functions $f$ and $f^{*}$ are plotted as histograms, they form mirror images of each other across the diagonal line $x=y$.Template:Sfn

From these two functions $f$ and $f^{*}$, define two more functions $F$ and $F^{*}$, from positive integers to positive integers, by $$\begin{array}{cc}F(n)& =f(n)+n\\ F^{*}(n)& =f^{*}(n)+n\\ \end{array}$$ Then the first part of the Lambek–Moser theorem states that each positive integer occurs exactly once among the values of either $F$ or $F^{*}$. That is, the values obtained from $F$ and the values obtained from $F^{*}$ form two complementary sets of positive integers. More strongly, each of these two functions maps its argument $n$ to the $n$th member of its set in the partition.

As an example of the construction of a partition from a function, 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.Template:Sfn 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.

From partitions to functions

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.Template:Sfn

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$.

One of the simplest examples to which this could be applied is the partition of positive integers into even and odd numbers. The functions $F(n)$ and $F^{*}(n)$ should give the Template:Nowrap even or odd number, respectively, so $F(n)=2n$ and $F^{*}(n)=2n-1$. From these are derived the two functions $f(n)=F(n)-n=n$ and $f^{*}(n)=F^{*}(n)-n=n-1$. They 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.Template:Sfn

Limit formula

In the same work in which they proved the Lambek–Moser theorem, Lambek and Moser provided a method of going directly Template:Nowrap the function giving the Template:Nowrap member of a set of positive integers, Template:Nowrap the function giving the Template:Nowrap non-member, without going through $f$ Template:Nowrap Let $F^{\mathrm{\#}}(n)$ denote the number of values of $x$ for which $F(x)\le n$; this is an approximation to the inverse function Template:Nowrap but (because it uses $\le$ in place Template:Nowrap offset by one from the type of inverse used to define $f^{*}$ Template:Nowrap Then, for Template:Nowrap $F^{*}(n)$ is the limit of the sequence $$n,n+F^{\mathrm{\#}}(n),n+F^{\mathrm{\#}}(n+F^{\mathrm{\#}}(n)),\dots ,$$ meaning that this sequence eventually becomes constant and the value it takes when it does Template:Nowrap

Lambek and Moser used the prime numbers as an example, following earlier work by Viggo Brun and D. H. Lehmer. If $\pi (n)$ is the prime-counting function (the number of primes less than or equal Template:Nowrap then the Template:Nowrap non-prime (1 or a composite number) is given by the limit of the sequence $$n,n+\pi (n),n+\pi (n+\pi (n)),\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 Template:Nowrap positive integer that is not a Template:Nowrap power can be obtained from the limiting formula as $$n+\lfloor \sqrt[k]{n+\lfloor \sqrt[k]{n}\rfloor }\rfloor .$$

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^{*}$.Template:Sfn Edsger W. Dijkstra has provided a visual proof of the result,Template:Sfn and later another proof based on algorithmic reasoning.Template:Sfn Yuval Ginosar has provided an intuitive proof based on an analogy of two athletes running in opposite directions around a circular racetrack.Template:Sfn

Related results

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)\le y$ if and only if $x\le 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.Template:Sfn

Rayleigh's theorem

Template:Main Rayleigh's theorem states that for two positive irrational numbers $r$ and $s$, both greater than one, with $\frac{1}{r}+\frac{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.

See also

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

References

• Template:Citation
• Template:Citation
• Template:Citation; Solutions by Beatty, A. Ostrowski, J. Hyslop, and A. C. Aitken, vol. 34 (1927), pp. 159–160, Template:JSTOR
• Template:Citation, as cited by Template:Harvnb
• Template:Citation
• Template:Citation
• Template:Citation
• Template:Citation
• Template:Citation
• Template:Citation
• Template:Citation
• Template:Citation
• Template:Citation
• Template:Citation
• Template:Citation
• Template:Citation
• Template:Citation
• Template:Citation