In ℤ[√(−5)], the element 2 is irreducible but not prime. What does this mean, concretely?
A2 cannot be written as a product in ℤ[√(−5)], and it does not divide any products
B2 cannot be factored further in ℤ[√(−5)], yet 2 divides (1+√(−5))(1−√(−5))=6 without dividing either factor
C2 is irreducible and its prime norm implies it is prime as a ring element
D2 becomes prime in the ideal-theoretic sense, so the failure of primeness is only apparent
2 is irreducible because N(2) = 4 and there is no element of norm 2 in ℤ[√(−5)] (a²+5b²=2 has no integer solutions), so 2 cannot split. But 2 divides 6 = (1+√(−5))(1−√(−5)) = 6 without dividing either factor in the ring — that is the precise failure of primeness. Option C is wrong: prime norm implies irreducibility in many cases, but not primeness; this divergence is exactly what breaks unique factorization. Option D describes the ideal-level resolution, not why element factorization fails.
Question 2 Multiple Choice
Why does ℤ have unique factorization while ℤ[√(−5)] does not?
Aℤ is a field while ℤ[√(−5)] is only a ring, and fields always have unique factorization
BIn ℤ, every irreducible element is also prime; in ℤ[√(−5)], irreducible and prime diverge
Cℤ[√(−5)] contains elements of both positive and negative norm, making factorization ambiguous
Dℤ has a norm function while ℤ[√(−5)] does not, preventing irreducibility detection
A ring is a UFD if and only if every irreducible element is prime. In ℤ, this holds — the Euclidean algorithm yields Bézout's identity, which forces every irreducible to be prime. In ℤ[√(−5)], the element 2 is irreducible but not prime, breaking the chain. Option A is wrong — ℤ is not a field (1/2 ∉ ℤ). Option D is wrong — ℤ[√(−5)] does have a norm function N(a+b√(−5)) = a²+5b²; it is essential for proving irreducibility.
Question 3 True / False
In any ring of algebraic integers, nearly every irreducible element is prime.
TTrue
FFalse
Answer: False
This is false in general, and the failure is precisely what produces non-unique factorization. In ℤ[√(−5)], the element 2 is irreducible but not prime — it divides a product without dividing either factor. In ℤ and ℤ[i], irreducible and prime coincide, but that is a special property of those rings (they are UFDs). The divergence between irreducible and prime is the algebraic heart of the phenomenon this topic describes.
Question 4 True / False
The two factorizations 6 = 2·3 = (1+√(−5))(1−√(−5)) in ℤ[√(−5)] show that 2 and (1+√(−5)) are associates — equal up to multiplication by a unit.
TTrue
FFalse
Answer: False
Associates differ by a unit. The only units in ℤ[√(−5)] are ±1, so two elements are associates only if one equals ±1 times the other. The four irreducibles 2, 3, (1+√(−5)), (1−√(−5)) are pairwise distinct and none is ±1 times another — they are genuinely different. The two factorizations of 6 are not the same factorization 'up to associates'; they are truly distinct, which is the content of the failure of unique factorization.
Question 5 Short Answer
Why do ideals restore unique factorization when element arithmetic fails in rings like ℤ[√(−5)]?
Think about your answer, then reveal below.
Model answer: In ℤ[√(−5)], element-level irreducibles like 2 are not prime. But when we pass to ideals, the principal ideal (2) factors into prime ideals: (2) = 𝔭₁·𝔭₂. The two apparently different element factorizations of 6 arise from the same underlying unique ideal factorization — they differ because the prime ideals happen to combine differently into principal ideals at the element level. The ideal class group measures how far such recombinations are from trivial, quantifying the failure.
Dedekind invented ideals to rescue unique factorization. Elements are too coarse to see the true multiplicative structure: two different element factorizations can reflect the same prime ideal factorization viewed through different groupings. Passing to ideals resolves the ambiguity. The ideal class group is trivial (all ideals are principal) if and only if the ring is a UFD — making it the natural measure of how badly unique factorization fails.