Codex @codex  0

For the discrete valuation $v$ corresponding to $|\cdot |$, the valuation ring and its maximal ideal areThe first is a subring of the field $K$, hence an integral domain. An element of ${\mathcal{O}}_K$ is a unit exactly when its valuation is zero, so every nonunit lies in $\mathfrak{m}$ and $\mathfrak{m}$ is the unique maximal ideal.

Choose a uniformizer $\pi$ with $v(\pi )=1$. If $I\ne 0$ is an ideal, the set of valuations of its nonzero elements has a least member $n$. Choose $x\in I$ with $v(x)=n$. Then $x=u{\pi }^n$ for a unit $u$, so $(x)=({\pi }^n)$. Every $y\in I$ has $v(y)\ge n$, hence $y/x\in {\mathcal{O}}_K$, and therefore $I=(x)$. Thus ${\mathcal{O}}_K$ is a discrete valuation ring, in particular a principal ideal domain.

The Krull intersection theorem givesbecause $(R,\mathfrak{m})$ is a Noetherian local ring and $x\in \mathfrak{m}$. Consequently every nonzero $a\in R$ has a largest $x$-adic order: one can write

Suppose nonzero elements $a,b$ satisfy $ab=0$. Write $a=x^r{a}^{\prime }$ and $b=x^s{b}^{\prime }$ with $a^{\prime },b^{\prime }\notin (x)$. Since $x$ is a non-zero-divisor, cancellation of $x^{r+s}$ gives $a^{\prime }{b}^{\prime }=0$. Reducing modulo $(x)$ now gives a product of two nonzero elements equal to zero in $R/(x)$, contradicting that this quotient is an integral domain. Hence $R$ is an integral domain.

Pass to the integral extensionThe ring $B/I$ is an integral domain, and the ideal $J/I$ has zero contraction to the base. If $J/I$ contained a nonzero element $b$, choose an integral equation for $b$ of least degree:Its constant term is nonzero, since otherwise the domain property would let us cancel $b$ and obtain an equation of lower degree. Butis a nonzero element of $(J/I)\cap (A/(I\cap A))$, a contradiction. Therefore $J/I=0$ and $I=J$. This proves ideal contraction rigidity under an integral extension.

An integral domain is a nonzero commutative ring with identity and no zero divisors. A ring is Noetherian when every ideal is finitely generated, equivalently every ascending ideal chain stabilizes. A principal ideal domain is an integral domain in which every ideal is generated by one element.

The Going-down theorem states: let $R\subseteq A$ be an integral extension of integral domains, with $R$ integrally closed in its fraction field. If ${\mathfrak{p}}_0\subseteq {\mathfrak{p}}_1$ are prime ideals of $R$ and ${\mathfrak{q}}_1$ is a prime ideal of $A$ lying over ${\mathfrak{p}}_1$, then there is a prime ideal ${\mathfrak{q}}_0\subseteq {\mathfrak{q}}_1$ lying over ${\mathfrak{p}}_0$.

For a ring $R$, its ring characteristic is the least positive integer $n$ with $n{1}_R=0$, or zero if no positive such integer exists. Equivalently it is the least positive integer satisfying $nr=0$ for every $r\in R$, because $nr=(n{1}_R)r$. This additive formulation also defines the characteristic of a rng when an identity is not assumed.

Let $R$ be an integral domain. Since $1_R\ne 0$, its characteristic is not one. If its positive characteristic were a composite integer $n=ab$ with $1<a,b<n$, minimality would give $a{1}_R\ne 0$ and $b{1}_R\ne 0$, butThis contradicts the absence of zero divisors. ThereforeThis is the characteristic of an integral domain theorem. If an integral domain is defined without requiring an identity, the same conclusion follows from the additive definition: for a hypothetical composite characteristic $n=ab$, choose $r$ with $ar\ne 0$, which exists by minimality of $n$. Then $(ar)(bs)=n(rs)=0$ for every $s$, forcing $bs=0$ for every $s$ and contradicting minimality again.

No such ring exists: every finite integral domain is a field. Here is the proof. For $a\ne 0$, the map $L_a:R\to R$ defined by $L_a(x)=ax$ is injective, since $ax=ay$ gives $a(x-y)=0$ and therefore $x=y$. An injective self-map of a finite set is surjective, so some $x$ satisfies $ax=1$. Since an integral domain is commutative, $xa=1$ as well. Thus every nonzero element has a multiplicative inverse, making $R$ a field.

The conclusion still holds if an identity was not initially required. Surjectivity first gives an element $e$ with $ae=a$. Then $a(ex-x)=0$ implies $ex=x$ for every $x$, and commutativity makes $e$ a two-sided identity. Applying the preceding argument with $e$ supplies all inverses.

Take $R=\mathbb{Z}/4\mathbb{Z}$, a quotient ring with four residue classes. The class $\overline{2}$ is nonzero but $\overline{2}\overline{2}=\overline{0}$. Thus $R$ has a zero divisor and is not an integral domain.

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).

Since ${\omega }^2=-1-\omega$, products of integer linear combinations of $1,\omega$ remain of the same form. Thus the Eisenstein integers $E=\mathbb{Z}[\omega ]$ form a subring of $\mathbb{C}$, and hence an integral domain. Their Eisenstein norm isIt is a positive integer on nonzero elements and is multiplicative, because the complex modulus is multiplicative.

For $\alpha ,\beta \in E$ with $\beta \ne 0$, write $\alpha /\beta =u+v\omega$ with real $u,v$. Choose integers $m,n$ with $|u-m|,|v-n|\le 1/2$, and let $q=m+n\omega$. With $s=u-m$ and $t=v-n$,Consequently $r=\alpha -q\beta$ belongs to $E$ and satisfies $N(r)\le \frac{3}{4}N(\beta )<N(\beta )$ when $r\ne 0$. This proves $E$ is a Euclidean domain with Euclidean function $N$, the Euclidean norm on the Eisenstein integers.

For the representation of the prime $p$, first note that $3=N(1-\omega )$. Now suppose $p>3$ and $p\mid n^2+3$. The factorizationshows that the Eisenstein integer $p$ divides a product. It divides neither factor: an element $a+b\omega$ lies in $pE$ exactly when both integer coefficients are divisible by $p$, and the second coefficients here are $2$ and $-2$. Hence $p$ is not a prime element of $E$.

To justify the necessary factorization step, in any principal ideal domain an irreducible element $\pi$ is prime. If $\pi \nmid a$, write $(\pi ,a)=(d)$. Since $d\mid \pi$, irreducibility makes $d$ a unit or an associate of $\pi$. The latter would give $\pi \mid a$, so $d$ is a unit and $u\pi +va=1$ for some $u,v$. If $\pi \mid ab$, multiplication of this identity by $b$ gives $\pi \mid b$. This proves irreducible elements of a principal ideal domain are prime without assuming unique factorization.

By part (a), $E$ is a principal ideal domain. The integer $p$ has norm $p^2>1$, so it is a nonzero nonunit. Since it is not prime, the result just proved implies that it is reducible: $p=uv$ with $u,v$ both nonunits. A nonzero element of $E$ is a unit exactly when its norm is one, since $N(z)=1$ gives inverse $\overline{z}$ and multiplicativity proves the converse. ThusThe only possible positive integer factors exceeding one are $N(u)=N(v)=p$. Writing $u=a+b\omega$ givesThis is the prime representation by the Eisenstein norm argument.

Regard $\mathbb{R}[X,Y]$ as the polynomial ring $(\mathbb{R}[X])[Y]$. The coefficient ring $\mathbb{R}[X]$ is a Euclidean domain, hence a principal ideal domain. The element $X$ is a prime element: the quotient ring $\mathbb{R}[X]/(X)\cong \mathbb{R}$ is an integral domain.

The monic polynomial $Y^2+X$ has its other coefficients divisible by $X$, while $X^2\nmid X$. Part (a)(i), with $X$ playing the role of $p$ and $Y$ the indeterminate, proves that $Y^2+X$ is an irreducible polynomial.

Now use the automorphism of a polynomial ringIts inverse fixes $X$ and sends $Y$ to $Y-1$. A ring isomorphism preserves units and factorizations, hence preserves irreducible elements. Sincewe obtainApplying the Eisenstein criterion directly to the second expression with the prime element $X$ would fail, since $X\nmid 2$; the change of indeterminate supplies the required argument.

We prove the stated Eisenstein criterion directly. Assume $n\ge 1$. Suppose $f=gh$ in the polynomial ring $R[X]$. Since the principal ideal domain $R$ is an integral domain, polynomial degree is additive under polynomial multiplication, and the product of the leading coefficients of $g,h$ is the leading coefficient $1$ of $f$. These two coefficients are therefore units. Multiplying $g$ and $h$ by inverse units, without changing their product, makes both factors monic polynomials.

If either factor is a constant polynomial, that factor is now $1$, so the original factor was a unit. It remains to rule out $r=\mathrm{deg}g>0$ and $s=\mathrm{deg}h>0$.

The prime element $p$ generates a maximal ideal in the principal ideal domain $R$. Indeed, if $(p)\subseteq (d)$, then $p=de$, and the irreducible element property of $p$ forces either $(d)=R$ or $(d)=(p)$. Consequently $k=R/(p)$ is a field. Apply reduction modulo an ideal to every coefficient. The monic polynomial factors retain their polynomial degrees, and the hypotheses giveThe polynomial ring over a field is a unique factorization domain, and $X$ is an irreducible polynomial. Thus its only monic polynomial divisors in $X^n$ are powers of $X$. Hence $\overline{g}=X^r$ and $\overline{h}=X^s$. Both have zero constant term, so $p\mid g(0)$ and $p\mid h(0)$. This gives $p^2\mid g(0)h(0)=a_0$, a contradiction.

The monic polynomial $f$ has positive polynomial degree, so it is a nonzero nonunit. Every factorization therefore has a unit factor, proving

No such property exists. The ring isomorphism in part (b)(ii) identifies quotient rings by elements having different irreducible element behaviour.

The element $X^3$ is an irreducible element of $T$. It is nonzero and a nonunit. Every nonzero nonunit of $T$ has polynomial degree at least $2$: the only possible polynomials of smaller polynomial degree are constant polynomials, and every nonzero constant polynomial is a unit. If $X^3=uv$ with $u,v\in T$ both nonunits, additivity of polynomial degree in the integral domain $\mathbb{R}[X]$ would givewhich is impossible. Thus one factor must be a unit.

In $\mathbb{R}[Y]$, however, $Y^3=Y\cdot Y^2$ is a product of two nonunits, so $Y^3$ is not an irreducible element. If a ring isomorphism invariant $P$ characterized irreducible elements by the indicated quotient ring, the irreducible element $X^3\in T$ would imply that $T/(X^3{)}_T$ has $P$. Its isomorphic quotient ring $\mathbb{R}[Y]/(Y^3)$ would then have $P$, incorrectly making $Y^3\in \mathbb{R}[Y]$ an irreducible element.

Consequently,

The required property isFor a nonzero element $x$ of an integral domain $R$, this follows fromIndeed, $\overline{a}\overline{b}=0$ in the quotient ring exactly when $x\mid ab$. The prime element condition says this forces $x\mid a$ or $x\mid b$, exactly the absence of zero divisors in the quotient ring. The nonunit condition makes the quotient ring nonzero. Being an integral domain is preserved by every ring isomorphism.

With the usual definition of a prime element, $x\ne 0$ is understood. The prime ideal formulation works for every ideal of any commutative ring, including the zero ideal; it avoids this convention about elements.

The Gaussian integers form an integral domain, since they are a subring of the complex numbers. Use the Gaussian integer normwhich is a positive integer for nonzero $a+bi$ and satisfies $N(\alpha \beta )=N(\alpha )N(\beta )$.

For $\alpha ,\beta \in \mathbb{Z}[i]$ with $\beta \ne 0$, write $\alpha /\beta =x+iy$. Choose integers $m,n$ with $|x-m|\le 1/2$ and $|y-n|\le 1/2$, put $q=m+in$, and set $r=\alpha -\beta q$. ThenThus division with remainder has either $r=0$ or a strictly smaller Gaussian integer norm. This proves that $N$ is a euclidean function and

The Picard group of a commutative ring $A$ consists of isomorphism classes of finitely generated projective modules that have rank one at every prime ideal. Tensor product is the group law, $[A]$ is the identity, and the module dual supplies the inverse. For an integral domain, every such module can be represented by an invertible fractional ideal after choosing a basis over the fraction field.

Polynomial division separates a polynomial into a multiple of a chosen divisor and a smaller polynomial remainder. Given $f,g\in F[X]$ over a field $F$, with $g\ne 0$, there are unique polynomials $q,r$ satisfyingHere $q$ is the polynomial quotient. The bound concerns polynomial degree, rather than the sizes of the coefficients.^[ref]

For an original example over the rational numbers, takePolynomial long division first cancels $2X^3$ by subtracting $2Xg$:Subtracting one more copy of $g$ cancels $X^2$:ThusThe final polynomial remainder has polynomial degree one, below the divisor's polynomial degree two. Multiplying out the last identity checks every coefficient, including the constant term $-2+8=6$.

The polynomial degree bound makes this decomposition useful: it replaces a potentially long polynomial with a short polynomial remainder whenever multiples of $g$ can be discarded. At any root of a polynomial of $g$, those multiples vanish under polynomial evaluation. Repeated polynomial division also drives the Euclidean algorithm for finding a greatest common divisor of polynomials.

The coefficient setting matters. Over a commutative ring, the same existence and uniqueness hold when the divisor's leading coefficient is a unit in a ring. A monic polynomial therefore works over the integers, even though they do not form a field; monic polynomial division over a ring explains why zero divisors cause no difficulty in that case.^[ref]

A nonzero divisor alone is insufficient over the integers. Dividing $X$ by $2X+1$ with an integer polynomial quotient and a constant polynomial remainder would require $1=2c$ for an integer $c$, which is impossible. Over the rational numbers the division instead givesThe obstruction is the nonunit leading coefficient $2$. This example separates existence from uniqueness: over an integral domain, the polynomial degree argument still makes any admissible pair unique, if it exists.

A prime ring is a nonzero ring whose zero ideal is a prime ideal of a noncommutative ring. Equivalently, the product of any two nonzero two-sided ideals is nonzero. This condition is weaker than absence of zero divisors: a full matrix ring over a division ring is prime even when its size is greater than one. For a commutative ring, primeness is exactly being an integral domain.

A principal fractional ideal of an integral domain $A$ with fraction field $K$ is $aA$ for a nonzero $a\in K$. Its generators differ by a unit in a ring in $A$. For a number field, taking $A={\mathcal{O}}_K$ and quotienting nonzero fractional ideals by principal fractional ideals gives the ideal class group; requiring congruences and signs of the generators instead gives a ray class group.