Exercise 13.2.5

Complete the proof of part (b) of Theorem 13.2.6. Then prove part (c).

Answers

Proof.

In the context of the proof of part (b) of Theorem 13.2.6, A 5 G . Let τ 1 = e , τ 2 = ( 1 2 3 ) , τ 3 = ( 2 3 4 ) , τ 4 = ( 3 4 5 ) , τ 5 = ( 1 4 5 ) , τ 6 = ( 1 2 5 ) ,

and h i = τ i h , i = 1 , , 6 , where h = u 2 and

u = x 1 x 2 + x 2 x 3 + x 3 x 4 + x 4 x 5 + x 5 x 1 x 1 x 3 x 3 x 5 x 5 x 2 x 2 x 4 x 4 x 1 .

By definition,

β i = h i ( α 1 , α 2 , α 3 , α 4 , α 5 ) .

Since A 5 G and τ i A 5 , there exists σ i Gal ( L F ) such that σ i maps to τ i for every i [[ 1 , 6 ]] , so

σ i ( α j ) = α τ i ( j ) , i [[ 1 , 6 ]] , j [[ 1 , 5 ]] .

Then, for all i [[ 1 , 6 ]] ,

σ i ( β 1 ) = σ i ( h ( α 1 , α 2 , α 3 , α 4 , α 5 ) ) = h ( σ i ( α 1 ) , σ i ( α 2 ) , σ i ( α 3 ) , σ i ( α 4 ) , σ i ( α 5 ) ) = h ( α τ i ( 1 ) , α τ i ( 2 ) , α τ i ( 3 ) , α τ i ( 4 ) , α τ i ( 5 ) ) = ( τ i h ) ( α 1 , α 2 , α 3 , α 4 , α 5 ) = h i ( α 1 , α 2 , α 3 , α 4 , α 5 ) = β i

So

σ i ( β 1 ) = β i , i = 1 , , 6 .

By assumption, some β j is in F , therefore β 1 = σ j 1 ( β j ) = β j F , and β i = σ i ( β 1 ) = β 1 for all i [[ 1 , 6 ]] . We obtain the identity

( y β 1 ) 6 = ( y 3 + b 2 y 2 + b 4 y + b 6 ) 2 2 10 Δ ( f ) y .

Multiplying this out, we obtain

y 6 6 β 1 y 5 + 15 β 1 2 y 4 20 β 1 3 y 3 + 15 β 1 4 y 2 6 β 1 5 y + β 1 6 = y 6 + 2 b 2 y 5 + ( b 2 2 + 2 b 4 ) y 4 + ( 2 b 6 + 2 b 2 b 4 ) y 3 + ( b 4 2 + 2 b 2 b 6 ) y 2 + ( 2 b 4 b 6 2 10 Δ ( f ) ) y + b 6 2 ,

so

6 β 1 = 2 b 2 , 15 β 1 2 = b 2 2 + 2 b 4 , 20 β 1 3 = 2 b 2 b 4 + 2 b 6 .

Therefore, since F has characteristic 2 ,

b 2 = 3 β 1 , b 4 = 1 2 ( 15 β 1 2 9 β 1 2 ) = 3 β 1 2 , b 6 = 1 2 ( 20 β 1 3 + 18 β 1 3 ) = β 1 3 ,

so

b 2 = 3 β 1 , b 4 = 3 β 1 2 , b 6 = β 1 3 .

The precedent identity becomes

( y β 1 ) 6 = ( y 3 + b 2 y 2 + b 4 y + b 6 ) 2 2 10 Δ ( f ) y = ( y 3 3 β 1 y 2 + 3 β 1 2 y β 1 3 ) 2 2 10 Δ ( f ) y = ( y β 1 ) 6 2 10 Δ ( f ) y .

Hence 2 10 Δ ( f ) = 0 . Yet F has characteristic 2 , and Δ ( f ) 0 , since f is separable. This contradiction completes the proof of the theorem.

We prove part (c) of Theorem 13.2.6.

Suppose that G is conjugate to ( 1 2 3 4 5 ) . Let L = F ( α 1 , α 2 , α 3 , α 4 , α 5 ) be the splitting field of f . We choose the numbering of the roots such that Gal ( L F ) = σ , where σ corresponds to ( 1 2 3 4 5 ) .

[ L : F ] = | Gal ( L F ) | = 5 , so the Tower Theorem implies that [ F ( α ) : F ] divides 5.

Since f is irreducible, α F , so [ F ( α ) : F ] 1 , [ F ( α ) : F ] = 5 and L = F ( α ) . Therefore α i F ( α ) , i = 1 , , 5 , and so f = ( x α 1 ) ( x α 2 ) ( x α 3 ) ( x α 4 ) ( x α 5 ) splits completely over F ( α ) .

Conversely suppose that f splits completely over F ( α ) . Then α i F ( α ) , i = 1 , , 5 , so the splitting field of f is L = F ( α ) . Therefore | Gal ( L F ) | = [ L : F ] = 5 is prime, so Gal ( L F ) is cyclic. G Gal ( L F ) is cyclic of order 5, so G = τ , where τ S 5 is a permutation of order 5. τ is a product of disjoint cycles whose order is the least common multiple of the length of the cycles, so τ is a 5 -cycle.

G = ( a 1 a 2 a 3 a 4 a 5 ) = σ ( 1 2 3 4 5 ) σ 1 , where σ is defined by σ ( i ) = a i , i = 1 , , 5 . G is conjugate to ( 1 2 3 4 5 ) .

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