Sean Li Math 7370 Notes Spring 2013 Algebraic Number Theory Lecture 4 1/28/13 Standard Example of Non-Unique Factorization.

on. In R = Z[ 5], we have 6 = (2)(3) = (1 + 5)(1 5). Can prove these are irreducible elements by showing norm. Suppose 2 = zz , where z = a + b 5, z = c + d 5. Then 4 = (a2 + 5b2 )(c2 + 5d2 ), and this is impossible in Z. Can repeat for other elements. Why not R = Z[ 3]? have 4 = (2)(2) = (1 + 3)(1 3). It turns out there is a We slightly larger ring in Q[ 3] which has unique factorization. Z is not integrally closed. Prime vs Irreducible. Prime = irreducible always. In a UFD, irreducible also = prime. In a PID, irreducible = prime. Let R be a PID and suppose p|ab. Assume p a. Then (p) (a), so (p) = (a). Let (p) + (a) = (c). This implies c|p. But p is irreducible, so c is an associate, in which case (c) = (p) or a unit, in which case (c) = (1) = R. Since p a we have (c) = (1). Then (p) + (a) = (1), so that px + ay = 1. Multiplying by b gives pxb + ayb = b, so that p|b. Hence p is prime.