Factorise 10 in two ways in Z[
√
−6]. Hence, show that Z[
√
−6] is not a UFD
Expert's answer
Answer on Question #48119 – Math - Abstract Algebra
Problem.
Factorise 10 in two ways in Z[−6]. Hence, show that Z[−6] is not a UFD
Solution.
10=(2+−6)(2−−6)
and
10=2⋅5
Now we will prove that 2−−6,2+−6,2 and 5 are irreducible elements of Z[−6].
- Suppose that there exist a,b=1,2 such that ab=2. Then 2=N(2)=N(a)N(b). Hence N(a)=N(b)=2.
If a=m+n−6. Therefore from N(a)=2, m2+6n2=2. Then n=0 and m2=2. We obtain contradiction. Hence 2 is irreducible.
- Suppose that there exist a,b=1,5 such that ab=5. Then 25=N(2)=N(a)N(b). Hence N(a)=N(b)=5.
If a=m+n−6. Therefore from N(a)=5, m2+6n2=5. Then n=0 and m2=5. We obtain contradiction. Hence 5 is irreducible.
- Suppose that there exist a,b=1,2+−6 such that ab=2+−6. Then 10=N(2+−6)=N(a)N(b). Hence N(a)=2 and N(b)=5 (w.l. o.g.). In two previous parts we prove that for all c∈Z[−6]: N(c)=2 and N(c)=5. We obtain contradiction. Hence 2+−6 is irreducible.
- Suppose that there exist a,b=1,2−−6 such that ab=2−−6. Then 10=N(2−−6)=N(a)N(b). Hence N(a)=2 and N(b)=5 (w.l. o.g.). In two previous parts we prove that for all c∈Z[−6]: N(c)=2 and N(c)=5. We obtain contradiction. Hence 2−−6 is irreducible.
Therefore 2−−6,2+−6,2 and 5 are irreducible elements of Z[−6].
Suppose that we have two distinct factorizations of 10 and Z[−6] is UFD. Then all factors are pairwise associated. Hence N(2)=N(2+−6) or N(2)=N(2−−6). Therefore 4=10. We obtain contradiction. Hence Z[−6] is not UFD.