Homepage › Solution manuals › Kenneth Ireland › A Classical Introduction to Modern Number Theory › Exercise 6.6
Exercise 6.6
Let be irreducible, and be a root. Show that is a ring (in fact, it is a field). Let , where is square-free. Show that .
Answers
Proof. By definition, for all .
The Euclidean division gives , so . Therefore :
, where is a field. ( , where is the constant polynomial ).
Let , where are in . Then , where , and , where . Thus . So is a subring of .
Let and . As , .
Let such that . As is irreducible by hypothesis, or ( is an associate of or ). If , then , and , so . Since , this implies , in contradiction with the definition of . So . Therefore .
From Bézout’s theorem, there exist polynomials such that . As , and is such that = 1. Therefore is a subfield of (and ).
As is irreducible, (if not, is not irreducible). So can be written , where is square-free (positive or negative), .
, so , thus and .
As , , so :
□