A Diophantine equation begins with a severe restriction: the unknowns are not allowed to move through a continuum. A polynomial equation such as $x^2 + y^2 = 1$ is a curve over $\mathbb{R}$, but over $\mathbb{Z}$ it becomes a finite arithmetic question. The same symbols can describe a geometric object, a congruence problem, a search algorithm, or a theorem about the impossibility of solutions.

The subject is built around one recurring tension. Polynomial equations are flexible over large fields, but the integral or rational points on them can be sparse, structured, or absent for reasons that are invisible over $\mathbb{R}$ or $\mathbb{C}$. Diophantine methods try to detect this arithmetic structure without losing sight of the underlying algebraic shape.

[example: A Circle with Few Integral Points] The notation $\mathbb{Z}[x,y]$ means the ring of polynomials in the variables $x$ and $y$ with integer coefficients. Let $F(x,y)=x^2+y^2-1\in \mathbb{Z}[x,y]$. Over $\mathbb{R}$, the equation $F(x,y)=0$ is \begin{align*} x^2+y^2-1=0, \end{align*} equivalently \begin{align*} x^2+y^2=1, \end{align*} which is the unit circle and has infinitely many real solutions, for example $(\cos \theta,\sin \theta)$ for each $\theta\in\mathbb{R}$. Over $\mathbb{Z}$, suppose $(x,y)\in\mathbb{Z}^2$ satisfies $x^2+y^2=1$. Since $x^2$ and $y^2$ are nonnegative integers whose sum is $1$, one of them is $1$ and the other is $0$. If $x^2=1$ and $y^2=0$, then $x=1$ or $x=-1$, and $y=0$, giving $(1,0)$ and $(-1,0)$. If $x^2=0$ and $y^2=1$, then $x=0$, and $y=1$ or $y=-1$, giving $(0,1)$ and $(0,-1)$. Substituting these four pairs gives $1^2+0^2=1$, $(-1)^2+0^2=1$, $0^2+1^2=1$, and $0^2+(-1)^2=1$, so the integral solution set is exactly \begin{align*} \{(1,0),(-1,0),(0,1),(0,-1)\}. \end{align*} The same polynomial therefore defines a continuum of real points but only four integral points. [/example]

This first example shows why the coefficient ring and the allowed solution set must be part of the definition. The equation alone does not determine the problem; the same polynomial asks different questions over $\mathbb{N}$, $\mathbb{Z}$, $\mathbb{Q}$, or a finite ring.

## Definition

A Diophantine equation records a polynomial constraint together with a specified arithmetic domain for its unknowns. This lets us distinguish the algebraic expression from the arithmetic question of which tuples are allowed. In the formal definition, $R$ is the ambient commutative ring in which the polynomial can be evaluated, and $S\subset R$ is the chosen set from which the unknowns are allowed to be drawn.

[definition: Diophantine Equation] Let $R$ be a commutative ring, and let $S\subset R$. A Diophantine equation over $S$ is an equation \begin{align*} F(x_1,\ldots,x_n)=0 \end{align*} where $n\in \mathbb{N}$, $F\in \mathbb{Z}[x_1,\ldots,x_n]$, and the unknown tuple $(x_1,\ldots,x_n)$ is required to lie in $S^n$. [/definition]

The most common choices are $S=\mathbb{Z}$, $S=\mathbb{N}$, and $S=\mathbb{Q}$. To compare these choices, we need a named object that records all permitted tuples satisfying the same polynomial equation.

[definition: Solution Set of a Diophantine Equation] Let $R$ be a commutative ring, let $S\subset R$, let $F\in \mathbb{Z}[x_1,\ldots,x_n]$, and let the Diophantine equation over $S$ be $F(x_1,\ldots,x_n)=0$. Its solution set over $S$ is \begin{align*} X_F(S)=\{(a_1,\ldots,a_n)\in S^n : F(a_1,\ldots,a_n)=0\}. \end{align*} [/definition]

The notation $X_F(S)$ separates two tasks: understanding the polynomial $F$ and understanding the arithmetic set of its solutions. Many natural problems impose several polynomial conditions at once, so the next step is to name the multi-equation version without pretending it is merely a typographical variant.

[definition: System of Diophantine Equations] Let $R$ be a commutative ring, and let $S\subset R$. A system of [Diophantine equations](/page/Diophantine%20Equations) over $S$ is a finite collection \begin{align*} F_1(x_1,\ldots,x_n)=0,\quad \ldots,\quad F_m(x_1,\ldots,x_n)=0 \end{align*} with $m,n\in \mathbb{N}$, each $F_j\in \mathbb{Z}[x_1,\ldots,x_n]$, and the unknown tuple $(x_1,\ldots,x_n)$ required to lie in $S^n$. [/definition]

A system might seem more expressive than a single equation, because each component can impose an independent constraint. The obstruction to collapsing the system is that one equation must remember all the separate vanishing conditions without creating new integer solutions.

Over $\mathbb{Z}$ there is a special way around this obstruction: a sum of integer squares is zero only when every square is zero. Thus the single equation

\begin{align*} F_1(x)^2+\cdots+F_m(x)^2=0 \end{align*}

forces all the original equations at once, so finite systems and single Diophantine equations define the same kinds of integer solution sets.

[quotetheorem:9916]

The reduction is special to ordered domains such as $\mathbb{Z}$. Over a ring where nonzero squares can sum to zero, the same replacement may add false solutions.

## Linear Diophantine Equations

The first complete theory appears in degree one. Here the problem is not geometric curvature or factorisation, but divisibility: which integer combinations of the coefficients can be produced?

A linear equation in two variables is the prototype because every solution is obtained from one solution by moving along a one-dimensional lattice. The obstruction is the [greatest common divisor](/page/Greatest%20Common%20Divisor) of the coefficients, so the definition isolates the equations for which this gcd test is the right tool.