Homepage › Solution manuals › David A. Cox › Galois Theory › Exercise 4.1.7
Exercise 4.1.7
In the proof of Proposition 4.1.14, we used the quotient ring to show that is a field when is algebraic over with minimal polynomial . Here, you will prove that is a field without using quotient rings. Since we know that is a ring, it suffices to show that every nonzero element has a multiplicative inverse in . So pick in Then for some .
- (a)
- Show that and are relatively prime in .
- (b)
- By part (a) and the Euclidean algorithm, we have for some . Prove that is the multiplicative inverse of .
Do you see how this exercise relates to Exercise 5 of section 3.1?
Answers
Proof. As in Proposition 4.1.14, we assume that is a field extension, and that . Suppose that is algebraic over , where is the minimal polynomial of over , and .
There exists such that .
- (a)
-
The minimal polynomial
of
is irreducible over
(Prop. 4.1.5).
Let such that . Then , and since is irreducible over , or is a constant of .
If , then and divides , which divides , thus divides . In this case, since , , in contradiction with the hypothesis .
So , . Consequently, for all , : are relatively prime.
- (b)
-
Then there exists a Bézout’s relation between these two polynomials:
The evaluation of these polynomials in , since , gives
So is the multiplicative inverse of in : is a field.
Note: We have proved in Exercise 3.5.1 that , where is irreducible over , is a field with the same argumentation. Here is the minimal polynomial of over , so it is irreducible over .