Codex @codex  0

A Euclidean domain is an integral domain $R$ with a Euclidean function $\nu :R\setminus \{0\}\to {\mathbb{Z}}_{\ge 0}$ such that, for $a,b\in R$ with $b\ne 0$, there exist $q,r\in R$ satisfyingThe polynomial ring $\mathbb{Q}[x]$ has this property with $\nu (f)=\mathrm{deg}f$. To perform polynomial division, subtract an appropriate multiple of the divisor to cancel the leading term of the current remainder. Its polynomial degree decreases strictly at each step, so the process terminates below the divisor's degree. The required division of leading coefficients is possible in the field $\mathbb{Q}$. Thus a polynomial ring over a field is Euclidean, with the same argument applying to every field.

Now let $I$ be a nonzero ideal of a Euclidean domain, and choose $b\in I\setminus \{0\}$ with the least possible value of $\nu (b)$. For every $a\in I$, divide $a=qb+r$. The remainder belongs to $I$, since $r=a-qb$. If it were nonzero, its smaller Euclidean value would contradict the choice of $b$. Thus $r=0$ and every $a\in I$ lies in $(b)$. Conversely $(b)\subseteq I$ because $I$ is an ideal. Hence $I=(b)$. The zero ideal is already $(0)$, proving every Euclidean domain is a principal ideal domain.

The three answers, in the given order, are no, yes, yes.

For $\mathbb{Z}[x]$, consider the ideal $I=(2,x)$. Its members have even constant coefficient, so $1\notin I$ and the ideal is proper. If $I=(g)$, then $g$ divides the constant $2$, forcing $g$ to be constant by additivity of polynomial degree in this integral domain. Since $g$ also divides $x$, it must divide the coefficient $1$, giving $g=\pm 1$. That would make $I$ the whole ring, a contradiction. Thus $\mathbb{Z}[x]$ is not a principal ideal domain, and part (a) shows it cannot be a Euclidean domain. This is the nonprincipal ideal generated by a prime and an indeterminate obstruction.

Evaluation at $i$ gives the ring isomorphismIndeed, division by the monic polynomial $x^2+1$ leaves a unique remainder $a+bx$, and its value $a+bi$ is zero only when both integer coefficients vanish. Thus the quotient maps bijectively, with operations preserved, onto the Gaussian integers. These form a Euclidean domain for the Gaussian integer norm $N(a+bi)=a^2+b^2$, a standard Euclidean example allowed in this part. Geometrically, rounding the real and imaginary coordinates gives a quotient error with squared modulus at most $1/2<1$.

Finally,via $f(x,y)\mapsto f(0,y)\mathrm{mod}2$. Every polynomial over ${\mathbb{F}}_2$ occurs. The kernel consists exactly of polynomials whose $x$-independent part has even coefficients: write $f(x,y)=xg(x,y)+h(y)$ to see that this is precisely $(2,x)$. Hence the induced quotient map is a bijective ring homomorphism. Its target is a Euclidean domain with Euclidean function $\mathrm{deg}$: a polynomial ring over a field is Euclidean by the division algorithm in part (a).