Past exam of the algebra and analysis I for mathematics and philosophy course of the University of Oxford / 2013 / Algebra / 3

A Euclidean domain is an integral domain $R$ admitting a Euclidean function $\delta :R\setminus \{0\}\to {\mathbb{Z}}_{\ge 0}$ such that division with a smaller remainder is possible: for every $a\in R$ and nonzero $b\in R$, there are $q,r\in R$ withThus the Euclidean function measures progress in repeated division. Definitions which additionally normalize it to be nondecreasing under multiplication give the same class of Euclidean domains; the division property is the one needed below.

For the zero ideal, choose $d=0$. Otherwise choose a nonzero $d\in I$ for which the Euclidean function $\delta (d)$ is minimal; the well-ordering principle guarantees such a choice. For any $a\in I$, perform Euclidean division:Because $I$ is an ideal, $r=a-qd\in I$. A nonzero remainder would contradict the minimal choice of $d$, so $r=0$ and $a\in Rd$. Thus $I\subseteq Rd$. Conversely, $d\in I$ implies $Rd\subseteq I$, provingEvery ideal is therefore a principal ideal; in particular, a Euclidean domain is a principal ideal domain.

For the Gaussian integers, use the Gaussian normTo identify the ideal, note that $a^2+b^2$ is even if and only if $a,b$ have the same parity. AlsoThis quotient is a Gaussian integer precisely when $a,b$ have the same parity. Therefore the prescribed set consists exactly of the multiples of $1+i$, givingAny associate of $1+i$ would generate the same principal ideal.