Exercise 5.1.8

Let n be a positive integer. Then the polynomial f = x n 2 is irreducible over by the Schönemann-Eisenstein Criterion for the prime 2.

(a)
Determine the splitting field L of f over .
(b)
Show that [ L : ] = n ( n 1 ) when n is prime.

Answers

Proof.

(a)
The set of the roots of x n 2 [ x ] is S = { ζ k 2 n , k = 0 , , n 1 } , where ζ = e 2 n : the splitting field L of x n 2 over is so ( S ) .

As ζ = ζ 2 n 2 n ( S ) , L = ( ζ , 2 n ) .

(b)
Suppose that n is prime.

As f = x n 2 is irreducible over , f is the minimal polynomial of 2 n over , so [ ( 2 n ) : ] = deg ( f ) = n .

As n is prime, 1 + x + + x n 1 is irreducible over , thus [ ( ζ ) : ] = n 1 .

From the Tower Theorem,

[ L : ] = [ L : ( 2 n ) ] [ ( 2 n ) : ] = n [ L : ( 2 n ) ] [ L : ] = [ L : ( ζ ) ] [ Q ( ζ ) : ] = ( n 1 ) [ L : ( ζ ) ] (1)

Thus n [ L : ] and n 1 [ L : ] .

As n , n 1 are relatively prime,

n ( n 1 ) [ L : ] . (2)

Moreover, the minimal polynomial p of 2 n over ( ζ ) divides x n 2 [ x ] ( ζ ) [ x ] , thus [ L : ( ζ ) ] = deg ( p ) n . By (1), [ L : ] n ( n 1 ) , and by (2) n ( n 1 ) [ L : ] , thus

[ L : ] = n ( n 1 ) .

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