Quadratic Fields and the Gaussian Integers

⚡ Key Takeaways

Quadratic fields are degree-2 extensions $\mathbb{Q}(\sqrt{d})$ of the rationals; the Gaussian integers $\mathbb{Z}[i]$ are the integers of the simplest imaginary one, $\mathbb{Q}(i)$ . Key result: $\mathbb{Z}[i]$ is a Euclidean domain, hence a unique factorization domain, and its primes classify exactly which integers are sums of two squares. Applies across algebraic number theory, Diophantine equations, and cryptography. Foundational work by Gauss (1801, 1832), Dirichlet, and Dedekind (19th century).

💡 The Core Insight

Number-theoretic questions about $\mathbb{Z}$ become transparent when lifted into a larger ring where rational primes can split. The prime $5 = (2+i)(2-i)$ factors in $\mathbb{Z}[i]$ precisely because $5 \equiv 1 \pmod 4$ and is a sum of two squares, $5 = 2^2 + 1^2$ . The behavior of a rational prime $p$ in $\mathcal{O}_K$ —split, inert, or ramified—is the engine driving the entire theory, governed by quadratic reciprocity through the Legendre/Kronecker symbol.

DefinitionQuadratic Field

For a squarefree integer $d \notin \{0,1\}$ , the quadratic field is

1

\quad K = \mathbb{Q}(\sqrt{d}) = \{\, x + y\sqrt{d} : x,y \in \mathbb{Q} \,\}.

Derivation hint: adjoin a root of the irreducible $t^2 - d$ to $\mathbb{Q}$ ; the quotient $\mathbb{Q}[t]/(t^2-d)$ is a field of degree 2. $K$ is real quadratic if $d>0$ and imaginary quadratic if $d<0$ . The nontrivial Galois automorphism is conjugation $\sigma(x+y\sqrt d) = x - y\sqrt d$ .

DefinitionNorm and Trace

For $\alpha = x + y\sqrt d \in K$ , define the trace and norm by

2

\quad \mathrm{Tr}(\alpha) = \alpha + \sigma(\alpha) = 2x, \qquad N(\alpha) = \alpha\,\sigma(\alpha) = x^2 - d\,y^2.

Derivation hint: these are the coefficients of the characteristic polynomial $t^2 - \mathrm{Tr}(\alpha)\,t + N(\alpha)$ of multiplication-by- $\alpha$ on the $\mathbb{Q}$ -vector space $K$ . The norm is multiplicative: $N(\alpha\beta) = N(\alpha)N(\beta)$ . For the Gaussian integers, $N(a+bi) = a^2 + b^2$ .

DefinitionRing of Integers

The ring of integers $\mathcal{O}_K$ is the integral closure of $\mathbb{Z}$ in $K$ —the set of $\alpha\in K$ satisfying a monic polynomial with $\mathbb{Z}$ coefficients. Explicitly,

3

\quad \mathcal{O}_K = \begin{cases} \mathbb{Z}[\sqrt d], & d \equiv 2,3 \pmod 4,\\[4pt] \mathbb{Z}\!\left[\tfrac{1+\sqrt d}{2}\right], & d \equiv 1 \pmod 4. \end{cases}

Derivation hint: $\alpha = x+y\sqrt d$ is integral iff $\mathrm{Tr}(\alpha)=2x\in\mathbb{Z}$ and $N(\alpha)=x^2-dy^2\in\mathbb{Z}$ ; analyzing parities of $2x,2y$ modulo 4 yields the two cases.

TheoremDiscriminant

The discriminant of $K=\mathbb{Q}(\sqrt d)$ is

4

\quad D_K = \begin{cases} d, & d\equiv 1 \pmod 4,\\ 4d, & d\equiv 2,3 \pmod 4. \end{cases}

It satisfies $D_K \equiv 0$ or $1 \pmod 4$ and equals $\det\!\big(\mathrm{Tr}(\omega_i\omega_j)\big)$ for any integral basis $\{\omega_1,\omega_2\}$ .

TheoremGaussian Integers are Euclidean

The ring $\mathbb{Z}[i] = \mathcal{O}_{\mathbb{Q}(i)}$ is a Euclidean domain with respect to the norm $N(a+bi)=a^2+b^2$ . Consequently it is a principal ideal domain and a unique factorization domain. Its units are exactly $\{1,-1,i,-i\}$ , the elements of norm 1.

TheoremClassification of Gaussian Primes

Up to units, the primes of $\mathbb{Z}[i]$ are exactly:

$1+i$ , the unique ramified prime above $2$ , with $2 = -i(1+i)^2$ ;
For rational primes $p \equiv 1 \pmod 4$ : two conjugate split primes $\pi,\bar\pi$ with $p = \pi\bar\pi = a^2+b^2$ ;
For rational primes $p \equiv 3 \pmod 4$ : $p$ itself remains inert (prime in $\mathbb{Z}[i]$ ).

ProofSums of Two Squares from Gaussian Arithmetic

Step 1. A rational prime $p$ is a sum of two squares iff $p = N(a+bi)$ for some $a+bi\in\mathbb{Z}[i]$ , iff $p$ is reducible (splits) in $\mathbb{Z}[i]$ .

Step 2. $p$ splits iff the equation $x^2 \equiv -1 \pmod p$ has a solution, since then $p \mid x^2+1 = (x+i)(x-i)$ while $p\nmid (x\pm i)$ , so $p$ is not prime.

Step 3. By Euler's criterion,

7

\quad \left(\frac{-1}{p}\right) = (-1)^{(p-1)/2} = \begin{cases} +1, & p\equiv 1\pmod 4,\\ -1, & p\equiv 3\pmod 4. \end{cases}

Derivation hint: $(-1)^{(p-1)/2}$ records whether the order-2 element $-1$ lies in the squares of the cyclic group $(\mathbb{Z}/p)^\times$ .

Step 4 — Full count (Jacobi/Gauss). The number $r_2(n)$ of representations of $n$ as an ordered sum of two squares is

8

\quad r_2(n) = 4\sum_{d\mid n}\chi(d), \qquad \chi(d) = \begin{cases} 1 & d\equiv 1\,(4)\\ -1 & d\equiv 3\,(4)\\ 0 & d\equiv 0\,(2). \end{cases}

Derivation hint: count Gaussian integers of norm $n$ by factoring $n$ into Gaussian primes and tracking the four units; the divisor sum tracks split-prime exponents. $\blacksquare$

∎

mathematician · Carl Friedrich Gauss | 1777–1855

Gauss introduced the integers $a+bi$ in his 1832 memoir on biquadratic reciprocity, proving their unique factorization and using them to formulate the biquadratic reciprocity law—a problem he could not state cleanly within $\mathbb{Z}$ alone. His 1801 Disquisitiones Arithmeticae had already developed the genus theory of binary quadratic forms, the form-theoretic shadow of quadratic field arithmetic. The "Gaussian integers" bear his name precisely because he recognized that enlarging the number system was the natural setting for reciprocity. Dedekind and Dirichlet later recast this form-language into the modern ideal-and-field framework.

🧠 Intuition

Think of $\mathbb{Z}[i]$ as the square lattice in the complex plane, with the norm measuring squared distance to the origin. Euclidean division "rounds to the nearest lattice point," and the bound $N(r)\le \tfrac12 N(\beta)$ holds geometrically because any point in a unit cell is within distance $\tfrac{1}{\sqrt2}$ of a corner. A rational prime $p$ either fragments into two lattice points (split), sits at a doubled lattice point (ramified, only $p=2$ ), or remains atomic because no lattice point has norm $p$ (inert). The whole story of which primes are sums of two squares is just asking: does the circle of radius $\sqrt p$ pass through a lattice point?

ExampleComputing

D_K

and

\mathcal{O}_K

for

\mathbb{Q}(\sqrt{5})

Given: $d = 5$ , which is squarefree and $5 \equiv 1 \pmod 4$ .

Step 1. By [3], $\mathcal{O}_K = \mathbb{Z}\!\left[\frac{1+\sqrt5}{2}\right]$ . The generator $\omega = \frac{1+\sqrt5}{2}$ (the golden ratio) is integral, satisfying $\omega^2 - \omega - 1 = 0$ .

Step 2. By [4], since $d\equiv 1\pmod 4$ , the discriminant is $D_K = 5$ .

Step 3. Check via the trace form on basis $\{1,\omega\}$ : $\mathrm{Tr}(1)=2$ , $\mathrm{Tr}(\omega)=1$ , $\mathrm{Tr}(\omega^2)=\mathrm{Tr}(\omega+1)=3$ .

10

\quad D_K = \det\begin{pmatrix} 2 & 1\\ 1 & 3\end{pmatrix} = 6 - 1 = 5.

Derivation hint: the discriminant equals $\det(\mathrm{Tr}(\omega_i\omega_j))$ ; entries are $\mathrm{Tr}(1\cdot 1),\mathrm{Tr}(1\cdot\omega),\mathrm{Tr}(\omega\cdot\omega)$ . $\boxed{\mathcal{O}_K = \mathbb{Z}[\tfrac{1+\sqrt5}{2}],\ D_K = 5}$ .

⚠️ Common mistake

The ring of integers is NOT always $\mathbb{Z}[\sqrt d]$ . For $d\equiv 1\pmod 4$ you must use the half-integer basis $\frac{1+\sqrt d}{2}$ . Using $\mathbb{Z}[\sqrt5]$ instead of $\mathbb{Z}[\frac{1+\sqrt5}{2}]$ gives an order of index 2, with wrong discriminant ( $20$ vs $5$ ) and a non-maximal, badly-behaved ideal theory.

⚠️ Common mistake

Norm being prime is sufficient but not necessary for an element to be prime. If $N(\alpha)$ is a rational prime then $\alpha$ is a Gaussian prime; but $\alpha=3$ is a Gaussian prime with $N(3)=9$ composite. Inert primes have composite (square) norm.

CounterexampleUnique factorization can fail

In $\mathbb{Z}[\sqrt{-5}] = \mathcal{O}_{\mathbb{Q}(\sqrt{-5})}$ (here $-5\equiv 3\pmod 4$ so this is the full ring of integers),

11

\quad 6 = 2\cdot 3 = (1+\sqrt{-5})(1-\sqrt{-5}),

and all four factors are irreducible and non-associate, with norms $4,9,6,6$ . Derivation hint: check no element has norm 2 or 3 (i.e. $a^2+5b^2\in\{2,3\}$ is insoluble), so the factors cannot be split further or matched up. The class number is $h(\mathbb{Q}(\sqrt{-5}))=2 > 1$ , measuring exactly this failure. Unlike $\mathbb{Z}[i]$ , this ring is a Dedekind domain but not a PID—ideals still factor uniquely even though elements do not.

connection

Quadratic fields are the degree-2 case of Algebraic Number Fields, and their integers are the simplest Dedekind Domains where Unique Factorization of Ideals replaces element factorization. The split/inert/ramified trichotomy is governed by Quadratic Reciprocity through the Kronecker symbol $\left(\frac{D_K}{p}\right)$ . The failure of unique factorization is measured by the Ideal Class Group, whose order is the class number $h$ , and the structure of units in real quadratic fields is the content of Dirichlet's Unit Theorem and the Pell Equation. Imaginary quadratic fields connect to Complex Multiplication and the theory of elliptic curves with CM.

🔬 Where this appears

⏳ History

- 1640 — Fermat states (in a letter to Mersenne) that every prime

p\equiv 1\pmod 4

is a sum of two squares, without published proof.

- 1749–1770 — Euler proves Fermat's two-square theorem and develops infinite descent and quadratic residue tools.

- 1798 — Legendre formulates quadratic reciprocity (with an incomplete proof) and the Legendre symbol.

- 1801 — Gauss publishes Disquisitiones Arithmeticae, giving the first complete proofs of quadratic reciprocity and the genus theory of binary quadratic forms.

- 1832 — Gauss introduces

\mathbb{Z}[i]

to state biquadratic reciprocity, proving its unique factorization.

- 1840s — Dirichlet proves the unit theorem and the class number formula for quadratic forms; Eisenstein develops

\mathbb{Z}[\omega]

for cubic reciprocity.

- 1846–1871 — Kummer's ideal numbers (for cyclotomic fields) inspire Dedekind's general theory.

- 1871 — Dedekind defines ideals and integral closure, recasting quadratic-field arithmetic as the theory of Dedekind domains in his supplements to Dirichlet's lectures.

- 1900s — Hilbert's Zahlbericht and class field theory systematize quadratic fields as the genesis of all abelian extension theory.

open-problem

Class number problems remain partly open. Gauss conjectured (proved by Heilbronn 1934, effectivized by Baker–Stark 1966) that there are exactly nine imaginary quadratic fields with class number 1: $d = -1,-2,-3,-7,-11,-19,-43,-67,-163$ . By contrast, it is still unknown whether infinitely many real quadratic fields have class number 1—the Gauss class number 1 problem for real fields is open. The Cohen–Lenstra heuristics predict that roughly $75.4\%$ of real quadratic fields are principal, but no proof exists. Effective bounds on class numbers and the precise distribution of split versus inert primes (linked to the Generalized Riemann Hypothesis through $L(1,\chi)$ ) remain active frontiers.

Quadratic Fields and the Gaussian Integers

Formal Statement

Why It Holds / Derivation

Building Intuition

Worked Examples

Common Misconceptions

Connections

Real-World Applications

Historical Development

Subtleties & Limits

See Also