Math 2.0

Number theory Proof

Proof that the Gaussian integers form a Euclidean domain

Builds on Gaussian integerNorm of a Gaussian integerEuclidean domainIntegral domain

Proof

For a complex number z=u+viz = u + vi, write ∣z∣2=u2+v2\abs{z}^2 = u^2 + v^2. Recall ∣zw∣2=∣z∣2∣w∣2\abs{zw}^2 = \abs{z}^2 \abs{w}^2, and ∣γ∣2=N(γ)\abs{\gamma}^2 = N(\gamma) for a Gaussian integer γ\gamma, where NN is the norm.

  1. Since β≠0\beta \ne 0, N(β)=ββˉN(\beta) = \beta\bar\beta is a positive integer. So αβ=αβˉN(β)=s+ti\dfrac{\alpha}{\beta} = \dfrac{\alpha \bar\beta}{N(\beta)} = s + ti with rational numbers ss and tt.
  2. Choose integers mm and nn with ∣s−m∣≤12\abs{s - m} \le \frac{1}{2} and ∣t−n∣≤12\abs{t - n} \le \frac{1}{2}, for example the nearest integers to ss and tt.
  3. Put q=m+niq = m + ni and r=α−qβr = \alpha - q\beta. Both are Gaussian integers, since ℤ[i]\mathbb{Z}[i] is closed under sums and products. And α=qβ+r\alpha = q\beta + r.
  4. We have r=β(αβ−q)=β((s−m)+(t−n)i)r = \beta \left(\dfrac{\alpha}{\beta} - q\right) = \beta \big((s - m) + (t - n)i\big).
  5. So N(r)=N(β)((s−m)2+(t−n)2)≤N(β)(14+14)=12N(β)N(r) = N(\beta) \big((s - m)^2 + (t - n)^2\big) \le N(\beta) \left(\frac{1}{4} + \frac{1}{4}\right) = \frac{1}{2} N(\beta).
  6. Since N(β)>0N(\beta) > 0, this gives N(r)<N(β)N(r) < N(\beta). This proves the division statement.
  7. The ring ℤ[i]\mathbb{Z}[i] is a subring of the field ℂ\C. A product of nonzero complex numbers is nonzero, so ℤ[i]\mathbb{Z}[i] is an integral domain.
  8. The norm takes nonzero Gaussian integers to positive integers, so it is a function ℤ[i]∖{0}→ℕ\mathbb{Z}[i] \setminus \set{0} \to \N.
  9. By steps 3 and 6, for all α\alpha and β≠0\beta \ne 0 there are qq, rr with α=qβ+r\alpha = q\beta + r and r=0r = 0 or N(r)<N(β)N(r) < N(\beta). So ℤ[i]\mathbb{Z}[i] with the norm is a Euclidean domain.

Idea

Divide α\alpha by β\beta as complex numbers and round the quotient to the nearest lattice point qq. The rounding error is a complex number of absolute value at most 2/2\sqrt{2}/2. So the remainder r=β(α/β−q)r = \beta(\alpha/\beta - q) has norm at most half the norm of β\beta.

Reading path

To understand this page from the ground up, read these 9 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Gaussian integer definition
  2. Group concept
  3. Norm of a Gaussian integer definition
  4. Ring definition
  5. Commutative ring definition
  6. Zero divisor definition
  7. Integral domain definition
  8. Euclidean domain definition
  9. Proof that the Gaussian integers form a Euclidean domain proof

Where this leads

1 page builds on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Gaussian_integer, Euclidean division
About this page
TagBGTREPJS1V
URIm2://BGTREPJS1V
Kindproof
WritingW0 stub
MSC11R11
ProvesThe Gaussian integers form a Euclidean domain
UsesGaussian integer, Norm of a Gaussian integer, Euclidean domain, Integral domain
Changed4 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

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

What links here

No page links to this page yet.