Skip to content

Principal Ideals

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 RR be a commutative ring. An ideal IRI\subseteq R is called principal if there exists an element αR\alpha\in R such that

I=(α). I=(\alpha).

This notation means

(α)={αr:rR}. (\alpha)=\{\alpha r:r\in R\}.

Thus a principal ideal consists of all multiples of a single element.

In the ordinary integers,

(n)=nZ (n)=n\mathbb{Z}

is the set of all multiples of nn. For example,

(6)={,12,6,0,6,12,}. (6)=\{\dots,-12,-6,0,6,12,\dots\}.

Every ideal of Z\mathbb{Z} 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 Z\mathbb{Z},

(a)(b) (a)\subseteq(b)

if and only if

ba. b\mid a.

For example,

(12)(4) (12)\subseteq(4)

because every multiple of 1212 is a multiple of 44. This reverses the usual divisibility order: the larger the divisor, the larger the principal ideal.

The same principle holds in any integral domain. If

(α)(β), (\alpha)\subseteq(\beta),

then α\alpha is divisible by β\beta, because

α(β). \alpha\in(\beta).

Hence there exists rRr\in R such that

α=βr. \alpha=\beta r.

Principal ideals therefore encode divisibility structurally.

Associates

Two elements α,βR\alpha,\beta\in R generate the same principal ideal precisely when they differ by multiplication by a unit.

That is,

(α)=(β) (\alpha)=(\beta)

if and only if there exists a unit uR×u\in R^\times such that

α=uβ. \alpha=u\beta.

Such elements are called associates.

For example, in Z\mathbb{Z},

(5)=(5), (5)=(-5),

because

5=(1)5, -5=(-1)5,

and 1-1 is a unit.

In the Gaussian integers Z[i]\mathbb{Z}[i], the elements

α,α,iα,iα \alpha,\quad -\alpha,\quad i\alpha,\quad -i\alpha

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:

Z, \mathbb{Z}, F[x] F[x]

for a field FF, and

Z[i]. \mathbb{Z}[i].

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 KK be a number field with ring of integers OK\mathcal O_K.

A principal ideal in OK\mathcal O_K has the form

(α)=αOK,αOK. (\alpha)=\alpha\mathcal O_K, \qquad \alpha\in\mathcal O_K.

Not every ideal of OK\mathcal O_K need be principal.

This is the central difference between ordinary integer arithmetic and general algebraic number theory.

When every ideal is principal, OK\mathcal O_K is a PID, and unique factorization of elements holds. When nonprincipal ideals exist, unique factorization of elements may fail.

Example: Gaussian Integers

In

Z[i], \mathbb{Z}[i],

the ideal generated by 1+i1+i is

(1+i)={(1+i)(a+bi):a,bZ}. (1+i)=\{(1+i)(a+bi):a,b\in\mathbb{Z}\}.

Since

2=(1+i)(1i), 2=(1+i)(1-i),

the ideal (1+i)(1+i) divides the ideal (2)(2). More precisely,

(2)=(1+i)2 (2)=(1+i)^2

up to a unit factor, because

(1+i)2=2i. (1+i)^2=2i.

This expresses the ramification of the prime 22 in the Gaussian integers.

Principal ideals make such factorization statements precise.

Norm of a Principal Ideal

For a nonzero ideal IOKI\subseteq\mathcal O_K, the ideal norm is

N(I)=OK/I. N(I)=|\mathcal O_K/I|.

If I=(α)I=(\alpha) is principal, then

N((α))=NK/Q(α). N((\alpha))= |N_{K/\mathbb{Q}}(\alpha)|.

Thus the ideal norm extends the field norm.

For example, in Z[i]\mathbb{Z}[i],

N(3+4i)=32+42=25. N(3+4i)=3^2+4^2=25.

Therefore

N((3+4i))=25. N((3+4i))=25.

This means the quotient ring

Z[i]/(3+4i) \mathbb{Z}[i]/(3+4i)

has 2525 elements.

Principal Ideals and Class Groups

The class group is built by comparing all fractional ideals with principal fractional ideals.

Let IKI_K be the group of nonzero fractional ideals of KK, and let PKP_K be the subgroup of principal fractional ideals. The ideal class group is

Cl(K)=IK/PK. \operatorname{Cl}(K)=I_K/P_K.

If every ideal is principal, then

Cl(K) \operatorname{Cl}(K)

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.