Let $R$ be a commutative ring. An ideal $I\subseteq R$ is called principal if there exists an element $\alpha\in R$ such that
Ideals Generated by One Element
Let be a commutative ring. An ideal is called principal if there exists an element such that
This notation means
Thus a principal ideal consists of all multiples of a single element.
In the ordinary integers,
is the set of all multiples of . For example,
Every ideal of is principal. This simple fact is one reason ordinary integer arithmetic behaves so cleanly.
Principal Ideals and Divisibility
Principal ideals translate divisibility into set containment.
In ,
if and only if
For example,
because every multiple of is a multiple of . This reverses the usual divisibility order: the larger the divisor, the larger the principal ideal.
The same principle holds in any integral domain. If
then is divisible by , because
Hence there exists such that
Principal ideals therefore encode divisibility structurally.
Associates
Two elements generate the same principal ideal precisely when they differ by multiplication by a unit.
That is,
if and only if there exists a unit such that
Such elements are called associates.
For example, in ,
because
and is a unit.
In the Gaussian integers , the elements
all generate the same principal ideal.
Thus principal ideals identify elements up to multiplication by units.
Principal Ideal Domains
An integral domain in which every ideal is principal is called a principal ideal domain, or PID.
Examples include:
for a field , and
In a PID, ideal theory is especially close to element arithmetic.
Every PID is a unique factorization domain. Therefore every nonzero nonunit element factors uniquely into irreducibles.
This explains why proving that a ring is a PID is often a powerful way to prove unique factorization.
Rings of Integers
Let be a number field with ring of integers .
A principal ideal in has the form
Not every ideal of need be principal.
This is the central difference between ordinary integer arithmetic and general algebraic number theory.
When every ideal is principal, is a PID, and unique factorization of elements holds. When nonprincipal ideals exist, unique factorization of elements may fail.
Example: Gaussian Integers
In
the ideal generated by is
Since
the ideal divides the ideal . More precisely,
up to a unit factor, because
This expresses the ramification of the prime in the Gaussian integers.
Principal ideals make such factorization statements precise.
Norm of a Principal Ideal
For a nonzero ideal , the ideal norm is
If is principal, then
Thus the ideal norm extends the field norm.
For example, in ,
Therefore
This means the quotient ring
has elements.
Principal Ideals and Class Groups
The class group is built by comparing all fractional ideals with principal fractional ideals.
Let be the group of nonzero fractional ideals of , and let be the subgroup of principal fractional ideals. The ideal class group is
If every ideal is principal, then
is trivial.
Thus principal ideals represent the zero class in the class group. Nonprincipal ideals represent obstructions to unique factorization.
Why Principal Ideals Matter
Principal ideals form the bridge between element arithmetic and ideal arithmetic.
Element factorization may fail, but ideal factorization remains unique in rings of integers. Principal ideals explain how much of that ideal factorization comes from actual elements.
In this sense, the central question becomes:
When does ideal arithmetic descend back to element arithmetic?
The answer is controlled by the class group. A trivial class group means every ideal is principal and ordinary unique factorization survives. A nontrivial class group means ideals carry arithmetic information that no single element can capture.