core29 min studyLesson 147 in Mathematics

Unique factorization domains

Separate irreducible factors from prime divisors, and understand what uniqueness means when units and associates are present.

Before you begin

Euclidean domains and principal ideals

On this page

The question for today

What you’ll understand

Distinguish irreducible elements, prime elements, and associates.
State both existence and uniqueness in the UFD property.
Use examples to separate Euclidean, principal-ideal, and unique-factorization hypotheses.

Factoring an integer feels unambiguous only because the integers satisfy a substantial theorem. In another ring, an element can have two factorizations that cannot be reconciled by reordering factors or multiplying by units. Unique factorization domains isolate the setting where the familiar reasoning is valid. The key distinction is between a factor that cannot split further and a factor that must divide one side of a product it divides. Those properties coincide in a UFD but need not coincide everywhere.

A factor that stops is not automatically prime

In an integral domain, an irreducible element is a nonzero nonunit whose factorization into two factors always includes a unit. A prime element is a nonzero nonunit that divides at least one factor whenever it divides a product. A prime is irreducible: if it equals a product, the prime-divisibility property and cancellation force one factor to be a unit. The reverse implication needs a further structural hypothesis.

Two elements are associates if one is a unit times the other. In the integers, three and negative three are associates, so counting them as distinct prime factors would give a misleading notion of uniqueness. In polynomials over a field, any two nonzero constant multiples are associates. Monic representatives often remove this ambiguity, but the abstract theorem must still permit unit factors and changes in the order of factors.

p\text{ prime}\Longrightarrow p\mid ab\Rightarrow p\mid a\ \text{or}\ p\mid b,\qquad a\sim b\iff a=ub\text{ for some }u\in R^\times

The definition of prime also requires p to be a nonzero nonunit. Associates differ by an invertible factor in the specified domain.↔ Scroll wide equations horizontally.

Existence and uniqueness are separate promises

A unique factorization domain, or UFD, requires every nonzero nonunit to factor into finitely many irreducibles, and requires any two such factorizations to agree up to order and associates. Neither clause should be omitted. If irreducibles are prime and factorizations exist, uniqueness follows by matching a prime on one side with a factor it divides on the other, canceling that pair, and repeating. This finite argument explains the role of prime divisibility.

Every PID is a UFD. One route first uses the ideal condition to rule out endless failure of factorization, then uses Bézout reasoning to prove that irreducibles are prime. But a UFD need not be a PID. Integer polynomials form a UFD, yet the ideal generated by two and x is not principal. A generator would divide both two and x, hence would be a unit; that would force the ideal to contain one, although every constant term in the ideal is even.

\text{Euclidean domain}\Longrightarrow\text{PID}\Longrightarrow\text{UFD}\Longrightarrow\text{integral domain}

These are valid implications. Reading the arrows backwards requires additional hypotheses and is generally false.↔ Scroll wide equations horizontally.

Use a norm to detect a genuine failure

Consider the domain of numbers a plus b times the square root of negative five, with integer coefficients. Its norm is a squared plus five b squared and is multiplicative. The only units have norm one, so they are one and negative one. No element has norm two or three: b equal to zero would require an integer square of two or three, while nonzero b makes the norm at least five.

In this ring, six factors as two times three and also as one plus the square root of negative five times one minus that square root. Each displayed factor is irreducible. A proper factorization of two or three would require norm factors two and two, or three and three; a proper factorization of either norm-six element would require norms two and three. Those norms are impossible. The two lists cannot be matched by units because their norms differ, so this is a failure of unique factorization.

Work it through

An irreducible that is not prime

Show that 2 is irreducible but not prime in $\mathbb{Z}[\sqrt{-5}]$ .

The norm of two is four. Any factorization into two nonunits would split four into norms two and two, but no element has norm two. Therefore two is irreducible.
The product $(1+\sqrt{-5})(1-\sqrt{-5})=6$ is divisible by two. To divide $1+\sqrt{-5}$ by two inside this ring would require the coefficients one-half and one-half to be integers, which they are not.
The same coefficient argument excludes divisibility of one minus the square root of negative five by two. Thus two divides the product while dividing neither factor, exactly contradicting the prime-divisibility condition.

The result

Two is irreducible but not prime in this domain; irreducibility alone cannot justify the usual prime-factor argument.

The living notebook

Explore the model

Interactive lab

Interactive lab · function

Separate polynomial size from factor structure

Keep a nonzero in the lab's real polynomial family $ax^2$ . Predict the factorization into the unit a and two copies of x, then vary a. The graph changes, but the irreducible-factor list in $\mathbb{R}[x]$ stays the same up to associates. The lab does not factor polynomials or test whether an arbitrary ring is a UFD.

y = ax²TangentSigned integral

y at chosen x: 0.608
Tangent slope · 2ax: 1.35
Signed area · ax³/3: 0.182

Coefficient a0.75Position x0.9

t = 0 s

This lab uses only y = ax². Playback traces the curve within the fixed integration interval from 0 to x; it does not estimate numerical error or change the chosen point. Parameter changes pause playback and recompute the model at the current elapsed time. Reset restores both parameters and returns time to zero. Playback starts paused. Adjust either parameter, then choose Play or Step.

Look forUnit multiples can alter appearance without changing a factorization's essential irreducible factors.

Pause & reason

Check your understanding

Interactive checks need JavaScript. You can still read the explanation.

Read the checkpoint explanation

If a prime p equals ab, primality says p divides one factor. Cancellation then forces the other factor to be a unit. The other claims require stronger hypotheses.

Your turn

Try it yourself

In $\mathbb{Q}[x]$ , compare the factorizations $2(x-1)(x+1)$ and $(2x-2)(x+1)$ . Do they contradict uniqueness?

Take a moment to make a prediction or work it out on paper. Open a hint when you need one.

Give me a hint

Identify the units in a polynomial ring over a field.

Compare with the solution

They do not contradict uniqueness. Every nonzero rational constant is a unit in this ring, and 2x − 2 is an associate of x − 1. After absorbing the unit two, both factorizations contain the same two linear irreducibles, x − 1 and x + 1. Uniqueness allows both changes of order and replacement of factors by associates; literal equality of the displayed strings is not required.

Keep the idea

Take it with you

Prime implies irreducible in a domain, while the converse can fail.
A UFD promises both existence and uniqueness up to order and units.
Unique factorization is weaker than having a principal generator for every ideal.

Read further

Original sources and deeper explanations to follow at your own pace.

James McKernan, MIT — Special domains

Optional progress, saved in this browser when available. Revisit any lesson at any time.

Lesson not marked complete.