Math 2.0

statement theorem

Lagrange's four-square theorem

Statement

Each natural number nn is a sum of four squares of integers: n=a2+b2+c2+d2n = a^2 + b^2 + c^2 + d^2 for some integers aa, bb, cc and dd.

Remarks

For example, 7=4+1+1+17 = 4 + 1 + 1 + 1 and 15=9+4+1+115 = 9 + 4 + 1 + 1. Three squares are not enough: 77 is not a sum of three squares, by Legendre's three-square theorem. By Euler's four-square identity, it is enough to prove the theorem for primes. Other proofs use Minkowski's theorem or the Hurwitz quaternions.

History

Diophantus knew examples, and Bachet stated the theorem in his Latin translation of the Arithmetica of 1621. Lagrange gave the first proof in 1770.

Explanations

L1 human

Every whole number is a sum of at most four perfect squares, if you allow 00 as a square. Some numbers, such as 77, 1515 and 2323, need all four.

What this node needs for W2
  • edge about out: the concepts that the statement is about (0 of 1)
  • edge proves in: at least one proof node (0 of 1)
  • edge instance_of or illustrates in: one example that shows the statement at work (0 of 1)
  • explanation L2 (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

What this needs

To read this node, read these 2 nodes in this order. The foundations come first, and the list ends with this node.

Each node uses the nodes above it. The colour of the bar on a box shows the evidence level, and the box also gives it as text. The list below has the same nodes.
  • no evidence level
  1. Euler's four-square identity statement
  2. Lagrange's four-square theorem statement

Sources

  1. Web https://en.wikipedia.org/wiki/Lagrange%27s_four-square_theorem, lead section
  2. Web https://en.wikipedia.org/wiki/Lagrange%27s_four-square_theorem, Historical development