Dedekind domains and ideal factorization
Recover unique factorization for nonzero ideals while distinguishing irreducible elements, prime elements, and nonprincipal prime ideals.
On this page
The question for today
What you’ll understand
- State the Dedekind hypotheses behind unique ideal factorization.
- Distinguish element factorizations from principal-ideal factorizations.
- Use finite quotient norms to verify a small ideal factorization.
Unique factorization of ordinary integers can fail for elements in a number field's integer ring. The repair is not to choose a different list of irreducible elements, but to factor ideals into prime ideals. The full ring of integers is a Dedekind domain, and its nonzero ideals have unique prime-ideal factorizations even when some prime ideals are not principal. This distinction explains how two incompatible-looking element products can encode the same underlying ideal arithmetic. It also shows why working in an arbitrary nonmaximal order can invalidate the expected theorem.
The domain hypotheses are essential
A Dedekind domain is a Noetherian integrally closed integral domain in which every nonzero prime ideal is maximal, with the field case often treated separately. The full ring of integers of a number field is a nonfield example. Its localization at any nonzero prime ideal is a discrete valuation ring. These local rings measure the exponent of that prime in a nonzero ideal, while the global theorem asserts that only finitely many exponents occur for each integral ideal.
Unique factorization applies to nonzero ideals; the zero ideal is excluded. The unit ideal has the empty factorization. Every nonzero fractional ideal is invertible, allowing integer exponents and forming an abelian group generated freely by nonzero prime ideals. Multiplication of ideals consists of finite sums of products of elements, not simply a union or intersection of their element sets. Containment reverses the intuitive divisibility direction: an ideal with a larger prime exponent is a smaller subset.
Irreducibility is weaker than primality
An irreducible element cannot be written as a product of two nonunits, while a prime element must divide one factor whenever it divides a product. These notions agree in a unique factorization domain but can differ in a general integer ring. Passing to principal ideals sends an element product to an ideal product. Prime ideals in that product need not come from individual prime elements, so unique ideal factorization does not itself give unique element factorization.
In Z[sqrt(−5)], which is the full integer ring of its field, the element six factors as 2 times 3 and also as (1+sqrt(−5))(1−sqrt(−5)). The norm a²+5b² rules out elements of norm two or three, which verifies irreducibility of the factors by multiplicativity. The two factorizations are not related by multiplication by units and reordering. Prime-ideal factorization refines both products into the same collection, with the missing nonprincipal ideal factors carrying the obstruction.
Norms verify finite quotient sizes
For a nonzero integral ideal I in a number field, its norm is the finite index of I in the integer ring, or equivalently the number of elements in the quotient. Ideal norm is multiplicative. For a principal ideal generated by a nonzero integer-ring element, it equals the absolute field norm of that element. A quotient by a prime ideal is a finite field, but an arbitrary finite quotient ring can have zero divisors and nilpotents. Cardinality alone does not determine its ring structure.
To verify an ideal equality, first prove containment using generators, then compare finite indices or norms. This avoids trusting a formal product of names without checking what the ideals contain. A nonmaximal order need not be integrally closed, and its ideals need not satisfy the full Dedekind factorization and invertibility conclusions. Before applying the theorem, verify the ambient ring rather than assuming that every ring generated by one algebraic integer inherits all properties of the full integer ring.
Work it through
A nonprincipal ideal squares to a principal one
In O=Z[sqrt(−5)] let P=(2,1+sqrt(−5)). Show its norm is two, verify P²=(2), and explain why P is not principal.
Modulo P, two is zero and sqrt(−5) equals −1, which is one in F2. The map a+b sqrt(−5) to a+b modulo two is surjective with kernel P, so O/P has two elements and N(P)=2.
The square ideal is generated by 4, 2(1+sqrt(−5)), and (1+sqrt(−5))²=−4+2sqrt(−5). Every generator is divisible by two, so P² is contained in (2). Their norms agree: N(P²)=4 and N((2))=|N(2)|=4, proving equality.
If P were generated by alpha, then |N(alpha)| would be two. But a²+5b²=2 has no integer solution: b=0 would require a²=2, and |b|≥1 already gives at least five. Thus P is nonprincipal despite its square being principal.
A nonprincipal prime ideal of norm two explains part of the failure of unique element factorization, while its own ideal factorization remains well-defined.
The living notebook
Explore the model
Interactive lab · modular
Finite quotients need not be fields
Pause and Reset, then set both controls to modulus m=6 and additive step a=2; predict orbit {0,2,4}. In Z/6Z, the separate multiplication check 2×3=0 exhibits zero divisors. Reset and set m=5 and a=2; predict all five residues. Z/5Z is a field, but the instrument only computes additive orbits, so a long orbit alone is not a primality or ideal-factorization test.
- Residue r0
- 0
- Orbit period · m/gcd(m,a)
- 12
- Distinct residues visited
- 1 of 12
Addition modulo m starts at zero: rₙ = na mod m. Playback advances two additions per second. The orbit has period m/gcd(m,a), including period one for a = 0. This is not a cryptographic security test or a primality algorithm. 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 forQuotient cardinality, additive structure, and being a field are distinct facts that need their own checks.
Pause & reason
Check your understanding
Your turn
Try it yourself
In the Gaussian integer ring Z[i], factor the ideals (5) and (2) using 2+i, 2−i, and 1+i. Check the ideal norms.
Take a moment to make a prediction or work it out on paper. Open a hint when you need one.
Give me a hint
Element products can differ by a unit without changing their principal ideals. The Gaussian norm is a²+b².
Compare with the solution
Because (2+i)(2−i)=5, the ideal (5) equals (2+i)(2−i), where the factors now denote principal ideals. Each factor has ideal norm five and is prime since its quotient has prime cardinality. Also (1+i)²=2i, so (2)=(1+i)² as ideals because i is a unit. The norm of (1+i) is two, hence the square has norm four, matching N((2))=|N_Q(i)/Q(2)|=4. The latter factorization is ramified rather than a product of two distinct prime ideals.
Keep the idea
Take it with you
- Dedekind hypotheses recover unique factorization of nonzero ideals.
- Nonprincipal prime ideals can coexist with irreducible elements that are not prime.
- Containment plus equal norm is a practical ideal-equality check.
Read further
Original sources and deeper explanations to follow at your own pace.
Optional progress, saved in this browser when available. Revisit any lesson at any time.
Lesson not marked complete.