Lagrange's foursquare theorem
Lagrange's foursquare theorem, also known as Bachet's conjecture, states that every natural number can be represented as the sum of four integer squares.
where the four numbers are integers. For illustration, 3, 31 and 310 can be represented as the sum of four squares as follows:
This theorem was proven by Joseph Louis Lagrange in 1770.
Contents
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.^{[1]}
AdrienMarie Legendre completed the theorem in 1797–8 with his threesquare 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 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 foursquare 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.^{[2]}
The classical proof
Several very similar modern versions^{[3]}^{[4]}^{[5]} 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.
It is sufficient to prove the theorem for every odd prime number p. This immediately follows from Euler's foursquare identity (and from the fact that the theorem is true for the numbers 1 and 2).
The residues of a^{2} modulo p are distinct for every a between 0 and (p − 1)/2 (inclusive). To see this, take some a and define c as a^{2} mod p. a is a root of the polynomial x^{2} − c over the field Z/pZ. So is p − a (which is different from a). In a field K, any polynomial of degree n has at most n distinct roots (Lagrange's theorem (number theory)), so there are no other a with this property, in particular not among 0 to (p − 1)/2.
Similarly, for b taking integral values between 0 and (p − 1)/2 (inclusive), the −b^{2} − 1 are distinct. By the pigeonhole principle, there are a and b in this range, for which a^{2} and −b^{2} − 1 are congruent modulo p, that is for which
with 0 < n < p.
Now let m be the smallest positive integer such that mp is the sum of four squares, x_{1}^{2} + x_{2}^{2} + x_{3}^{2} + x_{4}^{2} (we have just shown that there is some m (namely n) with this property, so there is a least one m, and it is smaller than p). We show by contradiction that m equals 1: supposing it is not the case, we prove the existence of a positive integer r less than m, for which rp is also the sum of four squares (this is in the spirit of the infinite descent^{[6]} method of Fermat).
For this purpose, we consider for each x_{i} the y_{i} which is in the same residue class modulo m and between (–m + 1)/2 and m/2 (included). It follows that y_{1}^{2} + y_{2}^{2} + y_{3}^{2} + y_{4}^{2} = mr, for some strictly positive integer r less than m.
Finally, another appeal to Euler's foursquare identity shows that mpmr = z_{1}^{2} + z_{2}^{2} + z_{3}^{2} + z_{4}^{2}. But the fact that each x_{i} is congruent to its corresponding y_{i} implies that all of the z_{i} are divisible by m. Indeed,

 and
It follows that, for w_{i} = z_{i}/m, w_{1}^{2} + w_{2}^{2} + w_{3}^{2} + w_{4}^{2} = rp, and this is in contradiction with the minimality of m.
In the descent above, we must rule out both the case y_{1} = y_{2} = y_{3} = y_{4} = m/2 (which would give r = m and no descent), and also the case y_{1} = y_{2} = y_{3} = y_{4} = 0 (which would give r = 0 rather than strictly positive). For both of those cases, one can check that mp = x_{1}^{2} + x_{2}^{2} + x_{3}^{2} + x_{4}^{2} would be a multiple of m^{2}, contradicting the fact that p is a prime greater than m.
Proof using the Hurwitz integers
One of the ways to prove the theorem relies on Hurwitz quaternions, which are the analog of integers for quaternions.^{[7]} The Hurwitz quaternions consist of all quaternions with integer components and all quaternions with halfinteger components. These two sets can be combined into a single formula
where are integers. Thus, the quaternion components are either all integers or all halfintegers, depending on whether is even or odd, respectively. The set of Hurwitz quaternions forms a ring; that is to say, the sum or product of any two Hurwitz quaternions is likewise a Hurwitz quaternion.
The (arithmetic, or field) norm of a rational quaternion is the nonnegative rational number
where is the conjugate of . Note that the norm of a Hurwitz quaternion is always an integer. (If the coefficients are halfintegers, then their squares are of the form , and the sum of four such numbers is an integer.)
Since quaternion multiplication is associative, and real numbers commute with other quaternions, the norm of a product of quaternions equals the product of the norms:
For any , . It follows easily that is a unit in the ring of Hurwitz quaternions if and only if .
The proof of the main theorem begins by reduction to the case of prime numbers. Euler's foursquare identity implies that if Langrange's foursquare theorem holds for two numbers, it holds for the product of the two numbers. Since any natural number can be factored into powers of primes, it suffices to prove the theorem for prime numbers. It is true for . To show this for an odd prime integer , represent it as a quaternion and assume for now (as we shall show later) that it is not a Hurwitz irreducible; that is, it can be factored into two nonunit Hurwitz quaternions
The norms of are integers such that
and . This shows that both and are equal to (since they are integers), and is the sum of four squares
If it happens that the chosen has halfinteger coefficients, it can be replaced by another Hurwitz quaternion. Choose in such a way that has even integer coefficients. Then
Since has even integer coefficients, will have integer coefficients and can be used instead of the original to give a representation of as the sum of four squares.
As for showing that is not a Hurwitz irreducible, Lagrange proved that any odd prime divides at least one number of the form , where and are integers.^{[7]} This can be seen as follows: since is prime, can hold for integers , only when . Thus, the set of squares contains distinct residues modulo . Likewise, contains residues. Since there are only residues in total, and , the sets and must intersect.
The number can be factored in Hurwitz quaternions:
The norm on Hurwitz quaternions satisfies a form of the Euclidean property: for any quaternion with rational coefficients we can choose a Hurwitz quaternion so that by first choosing so that and then so that for . Then we obtain
It follows that for any Hurwitz quaternions with , there exists a Hurwitz quaternion such that
The ring of Hurwitz quaternions is not commutative, hence it is not an actual Euclidean domain, and it does not have unique factorization in the usual sense. Nevertheless, the property above implies that every right ideal is principal. Thus, there is a Hurwitz quaternion such that
In particular, for some Hurwitz quaternion . If were a unit, would be a multiple of , however this is impossible as is not a Hurwitz quaternion for . Similarly, if were a unit, we would have
so divides , which again contradicts the fact that is not a Hurwitz quaternion. Thus, is not Hurwitz irreducible, as claimed.
Generalizations
Lagrange's foursquare 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 , can we solve
for all positive integers in integers ? The case is answered in the positive by Lagrange's foursquare theorem. The general solution was given by Ramanujan.^{[8]} He proved that if we assume, without loss of generality, that then there are exactly 54 possible choices for such that the problem is solvable in integers for all . (Ramanujan listed a 55th possibility , but in this case the problem is not solvable if .^{[9]})
Algorithms
Michael O. Rabin and Jeffrey Shallit^{[10]} have found randomized polynomialtime algorithms for computing a single representation for a given integer , in expected running time .
Number of representations
The number of representations of a natural number n as the sum of four squares is denoted by r_{4}(n). Jacobi's foursquare 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.
Equivalently, it is eight times the sum of all its divisors which are not divisible by 4, i.e.
We may also write this as
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 r_{4}(p) = 8(p + 1).^{[11]}
Some values of r_{4}(n) occur infinitely often as r_{4}(n) = r_{4}(2^{m}n) whenever n is even. The values of r_{4}(n)/n can be arbitrarily large: indeed, r_{4}(n)/n is infinitely often larger than 8 √ log n.^{[11]}
Uniqueness
The sequence of positive integers which have only one representation as a sum of four squares (up to order) is:
 1, 2, 3, 5, 6, 7, 8, 11, 14, 15, 23, 24, 32, 56, 96, 128, 224, 384, 512, 896 ... (sequence A006431 in the OEIS).
These integers consist of the seven odd numbers 1, 3, 5, 7, 11, 15, 23 and all numbers of the form or .
The sequence of positive integers which cannot be represented as a sum of four nonzero squares is:
 1, 2, 3, 5, 6, 8, 9, 11, 14, 17, 24, 29, 32, 41, 56, 96, 128, 224, 384, 512, 896 ... (sequence A000534 in the OEIS).
These integers consist of the eight odd numbers 1, 3, 5, 9, 11, 17, 29, 41 and all numbers of the form or .
See also
Notes
 ^ Ireland & Rosen 1990.
 ^ Sarnak 2013.
 ^ Landau 1958, Theorems 166 to 169.
 ^ Hardy & Wright 2008, Theorem 369.
 ^ Niven & Zuckerman 1960, paragraph 5.7.
 ^ Here the argument is a direct proof by contradiction. With the initial assumption that m>2, m<p, is some integer such that mp is the sum of four squares (not necessarily the smallest), the argument could be modified to become an infinite descent argument in the spirit of Fermat.
 ^ ^{a} ^{b} Stillwell 2003, pp. 138–157.
 ^ Ramanujan 1917.
 ^ Oh 2000.
 ^ Rabin & Shallit 1986.
 ^ ^{a} ^{b} Williams 2011, p. 119.
References
 Hardy, G. H.; Wright, E. M. (2008) [1938]. HeathBrown, D. R.; Silverman, J. H.; Wiles, Andrew, eds. An Introduction to the Theory of Numbers (6th ed.). Oxford University Press. ISBN 9780199219858.
 Ireland, Kenneth; Rosen, Michael (1990). A Classical Introduction to Modern Number Theory (2nd ed.). Springer. doi:10.1007/9781475721034. ISBN 9781441930941.
 Landau, Edmund (1958) [1927]. Elementary Number Theory. 125. Translated by Goodman, Jacob E. (2nd ed.). AMS Chelsea Publishing.
 Niven, Ivan; Zuckerman, Herbert S. (1960). An introduction to the theory of numbers. Wiley.
 Oh, ByeongKweon (2000). "Representations of Binary Forms by Quinary Quadratic Forms" (PDF). Trends in Mathematics. Information Center for Mathematical Sciences. 3 (1): 102–107.
 Rabin, M. O.; Shallit, J. O. (1986). "Randomized Algorithms in Number Theory". Communications on Pure and Applied Mathematics. 39 (S1): S239–S256. doi:10.1002/cpa.3160390713.
 Ramanujan, S. (1917). "On the expression of a number in the form ax^{2} + by^{2} + cz^{2} + dw^{2}". Proc. Cambridge Phil. Soc. 19: 11–21.
 Sarnak, Peter (2013). "The Ramanujan Conjecture and some Diophantine Equations" (Lecture at Tata Institute of Fundamental Research). ICTS Lecture Series. Bangalore, India.
 Stillwell, John (2003). Elements of Number Theory. Springer. doi:10.1007/9780387217352. ISBN 0387955879. Zbl 1112.11002.
 Williams, Kenneth S. (2011). Number theory in the spirit of Liouville. London Mathematical Society Student Texts. 76. Cambridge University Press. ISBN 9780521175623. Zbl 1227.11002.
External links
 Proof at PlanetMath.org
 Another proof
 an applet decomposing numbers as sums of four squares