Exercise 13.2.10

This exercise will prove the second equivalence of Proposition 13.2.7. Note that one direction follows trivially from Theorem 13.2.6. So we can assume that G AGL ( 1 , 𝔽 5 ) and that 𝜃 f ( y ) = ( y β 1 ) g ( y ) where β 1 F .

(a)
Use ( 1 2 3 4 5 ) G to prove that Gal ( L F ) acts transitively on β 2 , , β 6 . As in the previous exercise, we don’t know if β 2 , , β 6 are distinct.
(b)
Let p ( y ) be the minimal polynomial of β 2 over F . By part (a), it is also the minimal polynomial of β 2 , , β 6 . Prove that 𝜃 f ( y ) = ( y β 1 ) p ( y ) m , where m = 1 or 5 . If m = 1 , then we are done. So we need to rule out m = 5 .
(c)
Show that ( y β 1 ) ( y β 2 ) 5 = 𝜃 f ( y ) implies that β 1 = β 2 , and then use this to show that Δ ( f ) = 0 .

Answers

Proof. If 𝜃 f ( y ) has a root β F , then by Theorem 13.2.6(b), G is conjugate to a subgroup of AGL ( 1 , 𝔽 5 ) .

Conversely, assume that G is conjugate to a subgroup of AGL ( 1 , 𝔽 5 ) . Relabeling the roots, we may assume that ( 1 2 3 4 5 ) G AGL ( 1 , 𝔽 5 ) , and by Theorem 13.2.6(b), 𝜃 f ( y ) has a root β 1 F , so 𝜃 f ( y ) = ( y β 1 ) g ( y ) .

(a)
Write ρ = ( 1 2 3 4 5 ) and ρ ~ Gal ( L F ) the corresponding automorphism. Then ρ ~ ( α 1 ) = α 2 , , ρ ~ ( α 4 ) = α 5 , ρ ~ ( α 5 ) = α 1 ,

and σ i Gal ( L F ) corresponds to τ i .

We name the left coset representatives of AGL ( 1 , 𝔽 5 ) given in S 5 :

τ 1 = e , τ 2 = ( 1 2 3 ) , τ 3 = ( 2 3 4 ) , τ 4 = ( 3 4 5 ) , τ 5 = ( 1 4 5 ) , τ 6 = ( 1 2 5 ) .

Note that these cosets representatives verify ρ τ 1 ρ 1 = τ 1 = e , and

ρ τ 2 ρ 1 = τ 3 , , ρ τ 5 ρ 1 = τ 6 , ρ τ 6 ρ 1 = τ 2 .

By definition, h i = τ i h , i = 1 , , 6 , where h = u 2 and u is given in (13.17), and

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

(see Exercise 13.2.5). Since ρ AGL ( 1 , 5 ) , ρ h = h , therefore, for 2 i 5

( ρ τ i ) h = ( ρ τ i ρ 1 ) ( ρ h ) = τ i + 1 h ,

and ( ρ τ 6 ) h = τ 2 h .

If φ ~ Gal ( L F ) corresponds to some φ S 5 , then φ ~ ( α i ) = α φ ( i ) , i = 1 , , 5 , so

φ ~ ( h ( α 1 , , α 5 ) ) = h ( α φ ( 1 ) , , α φ ( 5 ) ) = ( φ h ) ( α 1 , , α 5 ) .

Since ρ ~ σ i Gal ( L F ) corresponds to ρ τ i ,

ρ ~ ( β i ) = ρ ~ ( σ i ( β 1 ) ) = ( ρ ~ σ i ) ( h ( α 1 , α 2 , α 3 , α 4 , α 5 ) ) = [ ( ρ τ i ) h ] ( α 1 , α 2 , α 3 , α 4 , α 5 ) = [ ( ρ τ i ρ 1 ) ( ρ h ) ] ( α 1 , α 2 , α 3 , α 4 , α 5 ) = ( τ i + 1 h ) ( α 1 , α 2 , α 3 , α 4 , α 5 ) = β i + 1 , i = 2 , 3 , 4 , 5 ,

and similarly ρ ~ ( β 6 ) = β 2 . So the images of β i by the automorphism ρ ~ corresponding to ρ = ( 1 2 3 4 5 ) are given by

β 2 β 3 β 4 β 5 β 6 β 2 , β 1 β 1 ,

therefore Gal ( L F ) acts transitively on β 2 , , β 6 .

(b)
Let p ( y ) F [ y ] be the minimal polynomial of β 2 over F . Since ρ ~ Gal ( L , F ) , p ( β 3 ) = p ( ρ ~ ( β 2 ) ) = ρ ~ ( p ( β 2 ) ) = 0 , so β 3 , and similarly β 4 , β 5 , β 6 are roots of p , so p is the minimal polynomial of β 2 , , β 6 .

𝜃 f ( y ) = ( y β 1 ) g ( y ) , therefore g ( y ) F [ y ] .

F L is a separable extension, so β 2 is separable, therefore

p ( y ) = ( y γ 1 ) ( y γ r ) ,

where γ 1 , , γ r are distinct. As p is the minimal polynomial of β 2 over F , and g ( β 2 ) = 0 , with g F [ y ] , p ( y ) divides 𝜃 f ( y ) , so each γ i is a β j , and each β j , 2 j j , is a root of p so is a γ i . Therefore { γ 1 , , γ r } = { β 2 , , β 6 } , and γ 1 , , γ r are the distinct roots of g .

Since Gal ( L F ) acts transitively on β 2 , , β 6 , then the distinct roots γ 1 , , γ r have the same order of multiplicity m (as in Exercise 9). Therefore g ( y ) = p ( y ) m , so

𝜃 f ( y ) = ( y β 1 ) p ( y ) m .

Since 5 = deg ( g ) = m deg ( p ) , 5 m , so m = 1 or m = 5 . We need to rule out m = 5 .

(c)
If m = 5 , 𝜃 f ( y ) = ( y β 1 ) ( y β 2 ) 5 .

Then, with some formal computations,

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

The coefficients of y 5 , y 4 , y 3 give

0 = 2 b 2 + β 1 + 5 β 2 , 0 = b 2 2 5 β 1 β 2 10 β 2 2 + 2 b 4 , 0 = 10 β 1 β 2 2 + 10 β 2 3 + 2 b 2 b 4 + 2 b 6 ,

so

b 2 = 1 2 β 1 5 2 β 2 , b 4 = 1 8 β 1 2 + 5 4 β 1 β 2 + 15 8 β 2 2 , b 6 = 1 16 β 1 3 + 5 16 β 1 2 β 2 15 16 β 1 β 2 2 5 16 β 2 3 .

Substituting these values in the equation, we obtain

0 = a y 2 + by + c ,

where

a = 5 64 ( β 1 4 4 β 1 3 β 2 + 6 β 1 2 β 2 2 4 β 1 β 2 3 + β 2 4 ) = 5 64 ( β 1 β 2 ) 4 , b = 1 64 β 1 5 15 64 β 1 4 β 2 + 25 32 β 1 3 β 2 2 35 32 β 1 2 β 2 3 + 45 64 β 1 β 2 4 11 64 β 2 5 1024 Δ ( f ) , c = 1 256 β 1 6 5 128 β 1 5 β 2 + 55 256 β 1 4 β 2 2 35 64 β 1 3 β 2 3 + 175 256 β 1 2 β 2 4 53 128 β 1 β 2 5 + 25 256 β 2 6 .

Since a = 0 , if the characteristic is not 5, then β 1 = β 2 , so 𝜃 f ( y ) = ( y β 1 ) 6 . But the proof of Theorem 13.2.6 shows that this implies that Δ ( f ) = 0 , and this is a contradiction. Thus m = 1 and g is irreducible over F . This proves Proposition 13.2.7. in characteristic 5 .

Sage instructions for part (e):

     x,y,beta1,beta2,Delta,b2,b4,b6 = var(’x,y,beta1,beta2,Delta,b2,b4,b6’)
     p = (y^3 + b2*y^2 + b4*y + b6)^2 - 2^10*Delta*y - (y-beta1)*(y-beta2)^5
     p = p.expand().collect(y)
     R.<y>=QQ[]
     l = [p.coefficient(y,i) for i in range(5,-1,-1)]
     eq = l[:3]
     solve(eq,b2,b4,b6)
     q=p.subs(b2 == -1/2*beta1 - 5/2*beta2,
           b4 == -1/8*beta1^2 + 5/4*beta1*beta2 + 15/8*beta2^2,
           b6 == -1/16*beta1^3 + 5/16*beta1^2*beta2 -15/16*beta1*beta2^2 - 5/16*beta2^3)
     q=q.expand().collect(y)
     q.coefficient(y,2).factor()
      

5 64 ( β 1 β 2 ) 4

It remains the case where the characteristic is 5. Then the equations b = 0 , c = 0 become,

0 = 1 64 ( β 1 5 β 2 5 ) 2 10 Δ ( f ) , 0 = 1 256 β 1 ( β 1 5 β 2 5 ) .

If β 1 0 , then β 1 5 β 2 5 = 0 , hence 2 10 Δ ( f ) = 0 . Since the characteristic is not 2, we obtain Δ ( f ) = 0 , which is impossible since f is separable by hypothesis.

If β 1 = 0 , it remains a unique equation

0 = β 2 5 + 2 16 Δ ( f ) ,

that is

0 = β 2 5 + Δ ( f ) .

In this case

𝜃 f ( y ) = y ( y β 2 ) 5 = y ( y 5 β 2 5 ) = y 6 + Δ ( f ) y .

Since

𝜃 f ( y ) = ( y 3 + b 2 y 2 + b 4 y + b 6 ) 2 2 10 Δ ( f ) y = ( y 3 + b 2 y 2 + b 4 y + b 6 ) 2 + Δ ( f ) y ,

this condition is equivalent to b 2 = b 4 = b 6 = 0 .

I don’t see an immediate contradiction ...

In fact, with this analysis, we can show a counterexample of Proposition 13.2.7:

Let f = x 5 x + 1 𝔽 5 [ x ] , where c 1 = c 2 = c 3 = 0 , c 4 = 1 , c 5 = 1 . Then f is irreducible, separable, and the Sage instructions given in Exercise 6, where we replace the field by 𝔽 5 show that b 2 = b 4 = b 6 = 0 , and

Δ ( f ) = 1 , 𝜃 f ( y ) = y 6 y .

(We verify this directly on the formulas (13.24) : almost all the terms of B 2 , B 4 , B 6 contain σ 1 , σ 2 or σ 3 , if not, the coefficient is a multiple of 5, so b 2 = b 4 = b 6 = 0 .)

Therefore β = 0 is a root of 𝜃 f , and 𝜃 f ( y ) = ( y β ) g ( y ) , where g ( y ) = y 5 1 = ( y 1 ) 5 is not irreducible over 𝔽 5 .

The second equivalence of Proposition 13.2.7 is false if the characteristic of F is 5.

Note : Here we know explicitly the roots of f in 𝔽 5 5 [ x ] . If α is a root of f in this field, the roots of f are α , α + 1 , α + 2 , α + 3 , α + 4 (see Ex. 6.2.5). If we substitute (with the help of Sage) these roots in h 1 , , h 6 , we obtain 0 , 1 , 1 , 1 , 1 , 1 , therefore

𝜃 f ( y ) = i = 1 6 ( y h i ( α 1 , , α 5 ) ) = y ( y 1 ) 5 = y 6 y .

This is a confirmation of the previous results.

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