Diophantine Equations - Main Theorem

Several fundamental theorems characterize solvability and structure of solutions for classical Diophantine equations. These results form the cornerstone of elementary and algebraic number theory.

TheoremLagrange's Four-Square Theorem

Every non-negative integer can be expressed as the sum of four integer squares: $n = x_1^2 + x_2^2 + x_3^2 + x_4^2$

This was conjectured by Bachet in 1621 and proved by Lagrange in 1770.

Unlike sums of two or three squares, which impose restrictions on $n$ , four squares suffice for all non-negative integers.

ExampleFour-Square Representations

$7 = 2^2 + 1^2 + 1^2 + 1^2$
$15 = 3^2 + 2^2 + 1^2 + 1^2$
$23 = 3^2 + 3^2 + 2^2 + 1^2$
$31 = 5^2 + 2^2 + 1^2 + 1^2$

Even numbers like $7$ and $31$ that aren't sums of two or three squares can be written as sums of four squares.

TheoremThue's Theorem

Let $F(x, y)$ be an irreducible homogeneous polynomial of degree $n \geq 3$ with integer coefficients. For any non-zero integer $m$ , the equation: $F(x, y) = m$ has only finitely many integer solutions $(x, y)$ .

This was proved by Axel Thue in 1909 using Diophantine approximation.

Thue's theorem is ineffective: it guarantees finiteness but doesn't bound the size of solutions or provide an algorithm to find them.

ExampleThue Equation

The equation $x^3 - 2y^3 = 1$ has solutions:

$(x, y) = (1, 0)$
$(x, y) = (-1, -1)$

By Thue's theorem, there are only finitely many such solutions (in fact, these are all of them).

TheoremHasse-Minkowski Theorem (Local-Global Principle)

A quadratic form $Q(x_1, \ldots, x_n) = 0$ has a non-trivial rational solution if and only if it has a non-trivial solution over $\mathbb{R}$ and over $\mathbb{Q}_p$ for all primes $p$ .

This local-global principle allows us to determine solvability of quadratic Diophantine equations by checking finitely many local conditions.

ExampleLocal-Global Principle

Consider $x^2 + y^2 = 3z^2$ . To find rational solutions, check:

Over $\mathbb{R}$ : Obviously solvable (e.g., $x = \sqrt{3}, y = 0, z = 1$ )
Over $\mathbb{Q}_2$ : Check if solvable modulo powers of $2$
Over $\mathbb{Q}_3$ : Check if solvable modulo powers of $3$
Over $\mathbb{Q}_p$ for other $p$ : Usually automatically solvable

If all local conditions are satisfied, a rational solution exists.

TheoremSiegel's Theorem

For integer points on curves, if $C$ is an algebraic curve of genus $g \geq 1$ defined over $\mathbb{Q}$ , then $C$ has only finitely many integral points.

This powerful result covers many classical Diophantine equations.

ExampleApplication of Siegel

The curve $y^2 = x^3 + x$ has genus $1$ (it's an elliptic curve). By Siegel's theorem, there are only finitely many integer points.

The integer solutions are:

$(x, y) = (0, 0)$
$(x, y) = (-1, 0)$

All other rational points have non-integer coordinates.

TheoremMatiyasevich's Theorem (Hilbert's Tenth Problem)

There is no general algorithm that can determine whether an arbitrary Diophantine equation has integer solutions.

This resolved Hilbert's Tenth Problem negatively: the problem of solving Diophantine equations is undecidable.

Remark

While specific classes of Diophantine equations can be solved systematically (linear, Pell, quadratic forms), the general problem is algorithmically unsolvable. This result connects number theory with mathematical logic and computability theory.

These theorems show that while some Diophantine equations yield to elementary methods, others require deep tools from algebraic geometry, transcendence theory, and mathematical logic.