Exercise 4.1.7

In the proof of Proposition 4.1.14, we used the quotient ring F [ x ] p to show that F [ α ] is a field when α is algebraic over F with minimal polynomial p F [ x ] . Here, you will prove that F [ α ] is a field without using quotient rings. Since we know that F [ α ] is a ring, it suffices to show that every nonzero element β F [ α ] has a multiplicative inverse in F [ α ] . So pick β 0 in F [ α ] Then β = g ( α ) for some g F [ x ] .

(a)
Show that g and p are relatively prime in F [ x ] .
(b)
By part (a) and the Euclidean algorithm, we have Ap + Bg = 1 for some A , B F [ x ] . Prove that B ( α ) F [ α ] is the multiplicative inverse of g ( α ) .

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 F L is a field extension, and that α L . Suppose that α L is algebraic over F , where p F [ x ] is the minimal polynomial of α over F , and β F [ α ] , β 0 .

There exists g F [ x ] such that β = g ( α ) .

(a)
The minimal polynomial p of α is irreducible over F (Prop. 4.1.5).

Let u F [ x ] such that u p , u g . Then p = uq , q F [ x ] , and since p is irreducible over F , u or q is a constant of F .

If q = λ F , then u = λ 1 p and p divides u , which divides g , thus p divides g . In this case, since p ( α ) = 0 , β = g ( α ) = 0 , in contradiction with the hypothesis β 0 .

So u = μ F , u 1 . Consequently, for all u F [ x ] , ( u p , u g ) u 1 : p , g are relatively prime.

(b)
Then there exists a Bézout’s relation between these two polynomials: Ap + Bg = 1 , A , B F [ x ] .

The evaluation of these polynomials in α , since p ( α ) = 0 , gives

B ( α ) g ( α ) = 1 , B ( α ) F [ α ]

So B ( α ) is the multiplicative inverse of β = g ( α ) 0 in F [ α ] : F [ α ] is a field.

Note: We have proved in Exercise 3.5.1 that F [ x ] f , where f is irreducible over F , is a field with the same argumentation. Here f = p is the minimal polynomial of α over F , so it is irreducible over f .

User profile picture
2022-07-19 00:00
Comments