Four-square Theorem

Lagrange's four-square theorem, also known as Bachet's conjecture, states that every nonnegative integer can be represented as a sum of four non-negative integer squares. That is, the squares form an additive basis of order four:
$p = a^2 + b^2 + c^2 + d^2,$
where the four numbers $a, b, c, d$ are integers. For illustration, 3, 31, and 310 can be represented as the sum of four squares as follows:
\begin
3 & = 1^2+1^2+1^2+0^2 \\ pt31 & = 5^2+2^2+1^2+1^2 \\ pt310 & = 17^2+4^2+2^2+1^2 \\ pt& = 16^2 + 7^2 + 2^2 +1^2 \\ pt& = 15^2 + 9^2 + 2^2 +0^2 \\ pt& = 12^2 + 11^2 + 6^2 + 3^2.
\end

This theorem was proven by Joseph Louis Lagrange.

Historical development

From examples given in the ''Arithmetica,'' it is clear that Diophantus was aware of the theorem. This book was translated in 1621 into Latin by Bachet (Claude Gaspard Bachet de Méziriac), who stated the theorem in the notes of his translation. But the theorem was not proved until 1770 by Lagrange.

Adrien-Marie Legendre extended the theorem in 1797–8 with his three-square theorem, by proving that a positive integer can be expressed as the sum of three squares if and only if it is not of the form $4^k(8m+7)$ for integers and . Later, in 1834, Carl Gustav Jakob Jacobi discovered a simple formula for the number of representations of an integer as the sum of four squares with his own four-square theorem.

The formula is also linked to Descartes' theorem of four "kissing circles", which involves the sum of the squares of the curvatures of four circles. This is also linked to Apollonian gaskets, which were more recently related to the Ramanujan–Petersson conjecture.

Proofs

The classical proof

Several very similar modern versions of Lagrange's proof exist. The proof below is a slightly simplified version, in which the cases for which ''m'' is even or odd do not require separate arguments.

Proof using the Hurwitz integers

Another way to prove the theorem relies on Hurwitz quaternions, which are the analog of integers for quaternions..

Generalizations

Lagrange's four-square theorem is a special case of the Fermat polygonal number theorem and Waring's problem. Another possible generalization is the following problem: Given natural numbers $a,b,c,d$, can we solve

$n=ax_1^2+bx_2^2+cx_3^2+dx_4^2$

for all positive integers in integers $x_1,x_2,x_3,x_4$? The case $a=b=c=d=1$ is answered in the positive by Lagrange's four-square theorem. The general solution was given by Ramanujan. He proved that if we assume, without loss of generality, that $a\leq b\leq c\leq d$ then there are exactly 54 possible choices for $a,b,c,d$ such that the problem is solvable in integers $x_1,x_2,x_3,x_4$ for all . (Ramanujan listed a 55th possibility $a=1,b=2,c=5,d=5$, but in this case the problem is not solvable if $n=15$.)

Algorithms

In 1986, Michael O. Rabin and Jeffrey Shallit proposed randomized polynomial-time algorithms for computing a single representation $n=x_1^2+x_2^2+x_3^2+x_4^2$ for a given integer , in expected running time $\mathrm(\log(n)^2)$. It was further improved to $\mathrm(\log(n)^2 \log(\log(n))^)$ by Paul Pollack and Enrique Treviño in 2018.

Number of representations

The number of representations of a natural number ''n'' as the sum of four squares of integers is denoted by ''r''₄(''n''). Jacobi's four-square theorem states that this is eight times the sum of the divisors of ''n'' if ''n'' is odd and 24 times the sum of the odd divisors of ''n'' if ''n'' is even (see divisor function), i.e.

r_4(n)=\begin8\sum\limits_m&\textn\text\\ 2pt24\sum\limits_m&\textn\text.
\end

Equivalently, it is eight times the sum of all its divisors which are not divisible by 4, i.e.

$r_4(n)=8\sum_m.$

We may also write this as
$r_4(n) = 8 \sigma(n) -32 \sigma(n/4) \ ,$
where the second term is to be taken as zero if ''n'' is not divisible by 4. In particular, for a prime number ''p'' we have the explicit formula ..

Some values of ''r''₄(''n'') occur infinitely often as whenever ''n'' is even. The values of ''r''₄(''n'')/''n'' can be arbitrarily large: indeed, ''r''₄(''n'')/''n'' is infinitely often larger than 8.

Uniqueness

The sequence of positive integers which have only one representation as a sum of four squares of non-negative integers (up to order) is:

:1, 2, 3, 5, 6, 7, 8, 11, 14, 15, 23, 24, 32, 56, 96, 128, 224, 384, 512, 896 ... .

These integers consist of the seven odd numbers 1, 3, 5, 7, 11, 15, 23 and all numbers of the form $2(4^k),6(4^k)$ or $14(4^k)$.

The sequence of positive integers which cannot be represented as a sum of four ''non-zero'' squares is:

:1, 2, 3, 5, 6, 8, 9, 11, 14, 17, 24, 29, 32, 41, 56, 96, 128, 224, 384, 512, 896 ... .

These integers consist of the eight odd numbers 1, 3, 5, 9, 11, 17, 29, 41 and all numbers of the form $2(4^k),6(4^k)$ or $14(4^k)$.

Further refinements

Lagrange's four-square theorem can be refined in various ways. For example, Zhi-Wei Sun proved that each natural number can be written as a sum of four squares with some requirements on the choice of these four numbers.

One may also wonder whether it is necessary to use the entire set of square integers to write each natural as the sum of four squares. Eduard Wirsing proved that there exists a set of squares with $, S, = O(n^\log^ n)$ such that every positive integer smaller than or equal to can be written as a sum of at most 4 elements of .

See also

* Fermat's theorem on sums of two squares
* Fermat's polygonal number theorem
* Waring's problem
* Legendre's three-square theorem
* Sum of two squares theorem
* Sum of squares function
* 15 and 290 theorems

Notes

References

*
*
*
*
*
*
*
*
*
*
*
*
*

External links

Proof at PlanetMath.orgAnother proofAn applet decomposing numbers as sums of four squaresOEIS index to sequences related to sums of squares and sums of cubes
*

{{DEFAULTSORT:Lagrange's Four-Square Theorem
Additive number theory
Articles containing proofs
Squares in number theory
Theorems in number theory