Exercise 5.1.9

Let f F [ x ] have degree n > 0 , and let L be the splitting field of f over F .

(a)
Suppose that [ L : F ] = n ! . Prove that f is irreducible over F .
(b)
Show that the converse of part (a) is false.

Answers

Proof.

(a)
Let f F [ x ] , deg ( f ) = n > 0 , and L be the splitting field of f over F .

Suppose that f is reducible over F . We show then that [ L : F ] < n ! .

In this case, f = gh , where 1 k = deg ( g ) n 1 (then deg ( h ) = n k ).

The roots α 1 , , α k of g , and the roots β 1 , , β n k of h , are the roots of f . They are thus in L , and

L = F ( α 1 , , α k , β 1 , , β n k ) .

Let K = F ( α 1 , , α k ) . This is the splitting field of g over F . Theorem 5.1.5 shows that [ K : F ] k ! .

As L = K ( β 1 , , β n k ) is the splitting field of h over K , the same theorem shows that [ L : K ] ( n k ) ! .

Hence

[ L : F ] = [ L : K ] [ K : F ] k ! ( n k ) ! .

If 1 k n 1 ,

( n k ) = n ! k ! ( n k ) ! = i = 0 k 1 n i k i > 1 ,

thus, for the same values of k ,

k ! ( n k ) ! < n ! .

Consequently [ L : F ] < n ! . In particular [ L : F ] n ! . The contraposition gives thus

[ L : F ] = n ! f is irreducible over F .

(b)
We give a counterexample of the converse : by Exercise 5, L = ( 2 + 3 ) is the splitting field of the irreducible polynomial f = x 4 10 x 2 + 1 , but

[ L : ] = [ ( 2 + 3 ) : ] = 4 4 ! = 24 .

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