Fueter–Pólya theorem
The Fueter–Pólya theorem, first proved by Rudolf Fueter and George Pólya, states that the only quadratic polynomial pairing functions are the Cantor polynomials.
Introduction
In 1873, Georg Cantor showed that the so-called Cantor polynomial[1]
- [math]\displaystyle{ P(x,y) := \frac{1}{2} ((x+y)^2+3x+y) = \frac{x^2 + 2xy+ 3x + y^2 + y}2 = x + \frac{(x+y)(x+y+1)}2 = \binom{x}1 + \binom{x+y+1}{2} }[/math]
is a bijective mapping from [math]\displaystyle{ \N^2 }[/math] to [math]\displaystyle{ \N }[/math]. The polynomial given by swapping the variables is also a pairing function.
Fueter was investigating whether there are other quadratic polynomials with this property, and concluded that this is not the case assuming [math]\displaystyle{ P(0,0)=0 }[/math]. He then wrote to Pólya, who showed the theorem does not require this condition.[2]
Statement
If [math]\displaystyle{ P }[/math] is a real quadratic polynomial in two variables whose restriction to [math]\displaystyle{ \N^2 }[/math] is a bijection from [math]\displaystyle{ \N^2 }[/math] to [math]\displaystyle{ \N }[/math] then it is
- [math]\displaystyle{ P(x,y) := \frac{1}{2} ((x+y)^2+3x+y) }[/math]
or
- [math]\displaystyle{ P(x,y) := \frac{1}{2} ((y+x)^2+3y+x). }[/math]
Proof
The original proof is surprisingly difficult, using the Lindemann–Weierstrass theorem to prove the transcendence of [math]\displaystyle{ e^a }[/math] for a nonzero algebraic number [math]\displaystyle{ a }[/math].[3] In 2002, M. A. Vsemirnov published an elementary proof of this result.[4]
Fueter–Pólya conjecture
The theorem states that the Cantor polynomial is the only quadratic pairing polynomial of [math]\displaystyle{ \N^2 }[/math] and [math]\displaystyle{ \N }[/math]. The conjecture is that these are the only such pairing polynomials. In a 2018 preprint, Pieter Adriaans has put forward a proof that purports to confirm the conjecture.[5]
Higher dimensions
A generalization of the Cantor polynomial in higher dimensions is as follows:[6]
- [math]\displaystyle{ P_n(x_1,\ldots,x_n) = \sum_{k=1}^n \binom{k-1+\sum_{j=1}^k x_j}{k} = x_1 + \binom{x_1+x_2+1}{2} + \cdots +\binom{x_1+\cdots +x_n+n-1}{n} }[/math]
The sum of these binomial coefficients yields a polynomial of degree [math]\displaystyle{ n }[/math] in [math]\displaystyle{ n }[/math] variables. This is just one of at least [math]\displaystyle{ (n-1)! }[/math] inequivalent packing polynomials for [math]\displaystyle{ n }[/math] dimensions.[7]
References
- ↑ G. Cantor: Ein Beitrag zur Mannigfaltigkeitslehre, J. Reine Angew. Math., Band 84 (1878), Pages 242–258
- ↑ Rudolf Fueter, Georg Pólya: Rationale Abzählung der Gitterpunkte, Vierteljschr. Naturforsch. Ges. Zürich 68 (1923), Pages 380–386
- ↑ Craig Smoryński: Logical Number Theory I, Springer-Verlag 1991, ISBN:3-540-52236-0, Chapters I.4 and I.5: The Fueter–Pólya Theorem I/II
- ↑ M. A. Vsemirnov, Two elementary proofs of the Fueter–Pólya theorem on pairing polynomials. St. Petersburg Math. J. 13 (2002), no. 5, pp. 705–715. Correction: ibid. 14 (2003), no. 5, p. 887.
- ↑ Adriaans, Pieter (2018). "A simple information theoretical proof of the Fueter-Pólya Conjecture". arXiv:1809.09871.
- ↑ P. Chowla: On some Polynomials which represent every natural number exactly once, Norske Vid. Selsk. Forh. Trondheim (1961), volume 34, pages 8–9
- ↑ Sánchez Flores, Adolfo (1995). "A family of [math]\displaystyle{ (n-1)! }[/math] diagonal polynomial orders of [math]\displaystyle{ \mathbb{N}^n }[/math]". Order 12 (2): 173-187. doi:10.1007/BF01108626.
 |  |
