Fueter–Pólya theorem

From testwiki
Jump to navigation Jump to search

Template:Short description Template:Use dmy dates

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 1878, Georg Cantor showed that the so-called Cantor polynomialTemplate:Sfn

P(x,y):=12((x+y)2+3x+y)=x2+2xy+3x+y2+y2=x+(x+y)(x+y+1)2=(x1)+(x+y+12)

is a bijective mapping from ℕ2 to ℕ. 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 P(0,0)=0. He then wrote to Pólya, who showed the theorem does not require this condition.Template:Sfn

Statement

If P is a real quadratic polynomial in two variables whose restriction to ℕ2 is a bijection from ℕ2 to ℕ then it is

P(x,y):=12((x+y)2+3x+y)

or

P(x,y):=12((y+x)2+3y+x).

Proof

The original proof is surprisingly difficult, using the Lindemann–Weierstrass theorem to prove the transcendence of ea for a nonzero algebraic number a.Template:Sfn In 2002, M. A. Vsemirnov published an elementary proof of this result.Template:Sfn

Fueter–Pólya conjecture

The theorem states that the Cantor polynomial is the only quadratic pairing polynomial of ℕ2 and ℕ. The conjecture is that these are the only such pairing polynomials, of any degree.

Higher dimensions

A generalization of the Cantor polynomial in higher dimensions is as follows:Template:Sfn

Pn(x1,…,xn)=∑k=1n(k−1+∑j=1kxjk)=x1+(x1+x2+12)+⋯+(x1+⋯+xn+n−1n)

The sum of these binomial coefficients yields a polynomial of degree n in n variables. This is just one of at least (n−1)! inequivalent packing polynomials for n dimensions.Template:Sfn

Notes and references

Template:Reflist

Bibliography

Template:Refbegin

Template:Refend

Template:Refbegin

Template:Refend