In a principal ideal domain, any two elements have a
greatest common divisor, which may be obtained as a generator of the ideal . All
Euclidean domains are principal ideal domains, but the converse is not true. An example of a principal ideal domain that is not a Euclidean domain is the ring \mathbb{Z}\bigl[\tfrac12\bigl(1+\sqrt{-19}~\!\bigr)\bigr], this was proved by
Theodore Motzkin and was the first case known. In this domain no and exist, with , so that \bigl(1+\sqrt{-19~\!}\bigr)=(4)q+r, despite 1+\sqrt{-19} and 4 having a greatest common divisor of . Every principal ideal domain is a
unique factorization domain (UFD). The converse does not hold since for any UFD , the ring of polynomials in 2 variables is a UFD but is not a PID. (To prove this look at the ideal generated by \left\langle X,Y \right\rangle. It is not the whole ring since it contains no polynomials of degree 0, but it cannot be generated by any one single element.) • Every principal ideal domain is
Noetherian. • In all unital rings,
maximal ideals are
prime. In principal ideal domains a near converse holds: every nonzero prime ideal is maximal. • All principal ideal domains are
integrally closed. The previous three statements give the definition of a
Dedekind domain, and hence every principal ideal domain is a Dedekind domain. Let
A be an integral domain, the following are equivalent. •
A is a PID. • Every prime ideal of
A is principal. •
A is a Dedekind domain that is a UFD. • Every finitely generated ideal of
A is principal (i.e.,
A is a
Bézout domain) and
A satisfies the
ascending chain condition on principal ideals. •
A admits a
Dedekind–Hasse norm. Any
Euclidean norm is a Dedekind-Hasse norm; thus, (5) shows that a Euclidean domain is a PID. (4) compares to: • An integral domain is a UFD if and only if it is a
GCD domain (i.e., a domain where every two elements have a greatest common divisor) satisfying the ascending chain condition on principal ideals. An integral domain is a
Bézout domain if and only if any two elements in it have a gcd
that is a linear combination of the two. A Bézout domain is thus a GCD domain, and (4) gives yet another proof that a PID is a UFD. == See also ==