Exercise 7.14

Let F be a field with q elements and n a positive integer. Show that there exist irreducible polynomials in F [ x ] of degree n .

Answers

Proof. Let F = 𝔽 q a field with q = p m elements, and n a positive integer.

By Theorem 2 Corollary 3, there exists an irreducible polynomial f ( x ) 𝔽 p [ x ] of degree nm . Let g be an irreducible factor of f in 𝔽 q [ x ] , and let α be a root of g in an extension of 𝔽 q .

We show that 𝔽 q 𝔽 p [ α ] .

𝔽 q and 𝔽 p [ α ] are two subfields of the same finite field 𝔽 q [ α ] . Moreover, | 𝔽 q | = p m , and | 𝔽 p [ α ] | = p nm . As m nm , 𝔽 q 𝔽 p [ α ] .

Indeed, for all γ 𝔽 q [ α ] ,

γ 𝔽 q γ p m = γ γ p mn = γ γ 𝔽 p [ α ] .

So 𝔽 q 𝔽 p [ α ] .

We show that 𝔽 q [ α ] = 𝔽 p [ α ] .

As 𝔽 p 𝔽 q , 𝔽 p [ α ] 𝔽 q [ α ] .

Let β 𝔽 q [ α ] . Then β = i = 1 k a i α i , where a i 𝔽 q 𝔽 p [ α ] , thus a i = p i ( α ) , p i 𝔽 p [ x ] . Therefore

β = i = 1 k p i ( α ) α i 𝔽 p [ α ] .

We have proved 𝔽 q [ α ] = 𝔽 p [ α ] .

Since | 𝔽 p [ α ] | = p nm ,

nm = [ 𝔽 p [ α ] : 𝔽 p ] = [ 𝔽 q [ α ] : 𝔽 p ] = [ 𝔽 q [ α ] : 𝔽 q ] × [ 𝔽 q : 𝔽 p ] = [ 𝔽 q [ α ] : 𝔽 q ] × m .

Thus [ 𝔽 q [ α ] : 𝔽 q ] = n . Moreover g is the minimal polynomial of α on 𝔽 q , thus deg ( g ) = n .

Conclusion: if F is a field with q = p m elements, there exist irreducible polynomials in F [ x ] of degree n for all positive integers n . □

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