Worked solution: Hilbert's existence proof for Waring's problem (1909)

Step 1 of 7: Waring's 1770 conjecture and the special cases before Hilbert

In plain words

Every whole number is trivially a sum of $1$ 's, but Joseph-Louis Lagrange proved something much sharper in 1770: every positive integer is a sum of at most $4$ perfect squares. That same year, Edward Waring guessed this was just the first case of a much bigger pattern: for cubes, at most $9$ are needed; for fourth powers, at most $19$ ; and so on for every exponent $k$ .

For 139 years this remained a guess verified only case by case (squares by Lagrange, cubes and a few other small exponents by others), with no general reason why a finite bound $g(k)$ should exist at all for every $k$ simultaneously. Hilbert's 1909 paper finally supplied that general reason.

\forall k\ge2\ \exists\, g(k)<\infty:\ \text{every } N\in\mathbb{N} \text{ is a sum of at most } g(k) \text{ } k\text{-th powers}

Detailed analysis

Waring's problem, posed in his 1770 Meditationes Algebraicae, asks: for each integer $k\ge2$ , does there exist a finite $g(k)$ such that every positive integer is a sum of at most $g(k)$ non-negative $k$ -th powers? Lagrange's four-square theorem (1770) settles $k=2$ with $g(2)=4$ ; Waring's remark extends the pattern to cubes ( $g(3)=9$ , conjecturally) and fourth powers ( $g(4)=19$ , conjecturally), 'and so on,' without proof.

Progress before Hilbert was piecemeal: special values of $k$ (up to $k=10$ ) were handled by various 19th-century mathematicians using ad hoc identities, and Joseph Liouville showed in 1859 that $g(4)\le53$ using Lagrange's four-square theorem twice over (his identity $6(x_1^2+x_2^2+x_3^2+x_4^2)^2=\sum_{i<j}(x_i+x_j)^4+\sum_{i<j}(x_i-x_j)^4$ is itself a small case of the general pattern Hilbert would later exploit). No general argument existed for arbitrary $k$ .

Hilbert's 1909 paper (*Beweis für die Darstellbarkeit der ganzen Zahlen durch eine feste Anzahl $n$ -ter Potenzen*, Mathematische Annalen) finally proved $g(k)<\infty$ for every $k$ — the Hilbert–Waring theorem. The remaining steps summarize his strategy: a single algebraic identity, its origin in averaging over a high-dimensional sphere, and how it bootstraps into a full existence proof, following the presentation of this identity in Nathanson's Additive Number Theory: The Classical Bases (Springer GTM 164, Ch. 3) and Ellison's 1971 survey.

Terms in this step

Waring's problem and $g(k)$: For fixed $k\ge2$ , $g(k)$ denotes the smallest number of non-negative $k$ -th powers needed to represent every positive integer as their sum. Waring's problem is the question of whether $g(k)$ is finite for every $k$ .