A principal ideal domain (PID) is a commutative integral domain in which every ideal is generated by one element. The integers and the ring of polynomials in one variable over a field are fundamental examples. Principal ideal domains occupy an important place in abstract algebra because they support greatest common divisors, unique factorization, and a classification of finitely generated modules that extends both the classification of finitely generated abelian groups and canonical forms for linear operators.
Definition and conventions
An integral domain is a commutative ring with a multiplicative identity and no zero divisors. An ideal is principal if there is an element such that
The ring is a principal ideal domain if every ideal has this form. The definition includes the zero ideal and the whole ring .
A generator need not be unique. For nonzero ,
for some unit , meaning an element with a multiplicative inverse in . Such elements and are called associates. The same equivalence holds when both elements are zero.
A principal ideal ring also has every ideal generated by one element, but need not be an integral domain. For example, is a principal ideal ring but not a PID, because its nonzero residue classes and multiply to zero.
Examples and nonexamples
Integers
Every ideal of is for a unique nonnegative integer . For a nonzero ideal , choose its least positive element . Division with remainder shows that every element of is divisible by , so .
This is the basic model for the connection between ideals and divisibility.
Polynomial rings over fields
If is a field, then is a PID. Given a nonzero ideal , choose a nonzero polynomial of least degree. For any , polynomial division gives
where or . Since belongs to , minimality forces . Hence .
The assumption that the coefficients form a field is essential. For example, is not a PID: its ideal is not principal.
Fields and Gaussian integers
Every field is a PID, since its only ideals are and the whole field.
The Gaussian integers
also form a PID. Their norm permits a division-with-remainder argument.
A multivariable nonexample
The polynomial ring is not a PID. Consider the ideal
If , then divides both and . Their only common divisors are units, so would be a unit and would be the whole ring. But every element of vanishes at , whereas does not.
Thus adjoining a second polynomial variable can destroy the principal ideal property even when the coefficient ring is a field.
Divisibility and greatest common divisors
Principal ideals translate divisibility into ideal inclusion:
The direction of containment is reversed: a divisor generates an ideal containing the ideal generated by its multiple.
For , their generated ideal is
In a PID this ideal equals for some . Consequently,
for suitable , and divides both and . Any common divisor of and divides every such linear combination, including . Thus is a greatest common divisor, determined up to multiplication by a unit.
The identity is a Bézout identity. In particular,
for some .
Least common multiples have a complementary ideal interpretation. For nonzero , the intersection is generated by a least common multiple. If is a greatest common divisor and a least common multiple, then and are associates.
These facts extend familiar integer arithmetic, including the Chinese remainder theorem. If , then
Unique factorization and prime ideals
Every PID is a unique factorization domain: every nonzero nonunit factors into irreducible elements, and the factorization is unique up to ordering and multiplication of factors by units.
Two properties underlie this result:
- Every ascending chain of ideals eventually stabilizes, ensuring that factorization into irreducibles terminates.
- Every irreducible element is prime.
For the second property, let be irreducible and suppose but . A greatest common divisor of and must be a unit, so there are with
Multiplying by shows that . This is the prime-divisor property responsible for uniqueness, generalizing the fundamental theorem of arithmetic.
An ideal is a prime ideal if implies or . In a PID, every nonzero prime ideal is generated by a prime element and is maximal. Equivalently, if is irreducible, then is a field.
The zero ideal is prime because is a domain, but it is maximal only when itself is a field. Thus a PID that is not a field has Krull dimension one.
Relationship to other classes of domains
Several important classes satisfy the implications
Euclidean domains
A Euclidean domain has a size function that supports division with remainder. Choosing a nonzero ideal element of least size proves that every ideal is principal, just as for integers and univariate polynomials.
The converse does not hold: a PID need not admit a Euclidean function. A classical example is
which is a PID but is not Euclidean.
This distinction separates an ideal-theoretic existence property from a stronger division property. The PID condition alone does not supply a particular Euclidean algorithm for computing generators.
Unique factorization domains
Unique factorization does not imply that every ideal is principal. The ring , for example, is a unique factorization domain but has the nonprincipal ideal . Unique factorization concerns multiplicative decompositions of elements; being a PID also restricts the additive structure of ideals.
Noetherian and Bézout domains
A Noetherian ring is a ring in which every ideal is finitely generated, equivalently one satisfying the ascending chain condition on ideals. Every PID is Noetherian because one generator suffices for each ideal.
A Bézout domain is an integral domain in which every finitely generated ideal is principal. A domain is a PID precisely when it is both Noetherian and a Bézout domain. The distinction matters because a general Bézout domain may have ideals that are not finitely generated.
Modules over a PID
Principal ideal domains are especially important because of the structure of their modules. Modules generalize vector spaces by allowing scalars from a ring rather than requiring a field.
Submodules of free modules
Over a PID, every submodule of a free module is free. In particular, if
then has a basis of at most elements.
This is not a general property of integral domains. For instance, the ideal , regarded as a module over , is a submodule of a free module of rank one but is not itself free.
Classification of finitely generated modules
Every finitely generated module over a PID has an isomorphism of the form
where each is a nonzero nonunit and
Here denotes a direct sum. The integer and the ideals are uniquely determined by . The elements , called invariant factors, are therefore unique up to multiplication by units.
The summand is the free part. The remaining summands form the torsion submodule, whose elements are annihilated by some nonzero scalar. In particular, every finitely generated torsion-free module over a PID is free. Finite generation is essential: , as a module over , is torsion-free but not free.
Factoring the invariant factors into powers of prime elements gives an alternative decomposition into modules , called the elementary divisor decomposition.
Applications to groups and linear algebra
Finitely generated abelian groups
An abelian group is naturally a module over , with integer scalar multiplication defined by repeated addition and additive inverses. Since is a PID, the module structure theorem gives
where and . This is the classification of finitely generated abelian groups.
Linear operators
If is a finite-dimensional vector space over and is a linear map, then becomes an -module by defining
Because is a PID, the module classification yields the rational canonical form of . When the relevant polynomials split into linear factors over , the elementary divisor decomposition yields Jordan canonical form.
Matrix reduction
A matrix over a PID admits a Smith normal form:
where are invertible matrices over the ring and
This form describes finitely presented modules through generators and relations. Over , it is used to compute finitely generated abelian groups and integral homology groups. Over a general PID, existence of the form is an algebraic theorem; effective computation additionally requires suitable procedures for arithmetic and finding ideal generators.