A common theme in ring theory is the idea that we identify a property of the integers, and work out what that property means in a more general setting. The idea of the Euclidean_domain captures the fact that in , we may perform the division_algorithm (which can then be used to work out greatest common divisors and other such nice things from $Z$ ). Here, we will prove that this simple property actually imposes a lot of structure on a ring: it forces the ring to be a principal ideal domain, so that every ideal has just one generator.

In turn, this forces the ring to have unique factorisation (proof), so in some sense the Fundamental Theorem of Arithmetic (i.e. the statement that $Z$ is a unique factorisation domain) is true entirely because the division algorithm works in $Z$ .

This result is essentially why we care about Euclidean domains: because if we know a Euclidean function for an integral domain, we have a very easy way of recognising that the ring is a principal ideal domain.

Formal statement

Let $R$ be a Euclidean_domain. Then $R$ is a principal ideal domain.

Proof

This proof essentially mirrors the first proof one might find in the concrete case of the integers, if one sat down to discover an integer-specific proof; but we cast it into slightly different language using an equivalent definition of "ideal", because it is a bit cleaner that way. It is a very useful exercise to work through the proof, using $Z$ instead of the general ring $R$ and using "size" ^[1] as the Euclidean function.

Let $R$ be a Euclidean domain, and say $ϕ : R ∖ {0} \to N^{\geq 0}$ is a Euclidean function. That is,

if $a$ divides $b$ then $ϕ (a) \leq ϕ (b)$ ;

for every $a$ , and every $b$ not dividing $a$ , we can find $q$ and $r$ such that $a = q b + r$ and $ϕ (r) < ϕ (b)$ .

We need to show that every ideal is principal, so take an ideal $I \subseteq R$ . We'll view $I$ as the kernel of a homomorphism $α : R \to S$ ; recall that this is the proper way to think of ideals. (Proof of the equivalence.) Then we need to show that there is some $r \in R$ such that $α (x) = 0$ if and only if $x$ is a multiple of $r$ .

If $α$ only sends $0$ to $0$ (that is, everything else doesn't get sent to $0$ ), then we're immediately done: just let $r = 0$ .

Otherwise, $α$ sends something nonzero to $0$ ; choose $r$ to be nonzero with minimal $ϕ$ . We claim that this $r$ works.

Indeed, let $x$ be a multiple of $r$ , so we can write it as $a r$ , say. Then $α (a r) = α (a) α (r) = α (a) \times 0 = 0$ . Therefore multiples of $r$ are sent by $α$ to $0$ .

Conversely, if $x$ is not a multiple of $r$ , then we can write $x = a r + b$ where $ϕ (b) < ϕ (r)$ and $b$ is nonzero. ^[2] Then $α (x) = α (a r) + α (b)$ ; we already have $α (r) = 0$ , so $α (x) = α (b)$ . But $b$ has a smaller $ϕ$ -value than $r$ does, and we picked $r$ to have the smallest $ϕ$ -value among everything that $α$ sent to $0$ ; so $α (b)$ cannot be $0$ , and hence nor can $α (x)$ .

So we have shown that $α (x) = 0$ if and only if $x$ is a multiple of $r$ , as required.

The converse is false

There do exist principal ideal domains which are not Euclidean domains: $Z [\frac{1}{2} (1 + \sqrt{- 19})]$ is an example. (Proof.)

^{^︎}
That is, if $n > 0$ then the size is $n$ ; if $n < 0$ then the size is $- n$ . We just throw away the sign.
^{^︎}
The fact that we can do this is part of the definition of the Euclidean function $ϕ$ .