Exercise 11.2.9

State and prove analogs of Theorem 11.2.2 and 11.2.4 that count monic irreducible polynomials of degree n in 𝔽 q [ x ] , where q is now a power of the prime p .

Answers

Let q = p ν a power of the prime p .

Proposition 11.2.1 bis. Let f 𝔽 q [ x ] be irreducible over 𝔽 q , of degree m . Then:

(a)
f divides x q m x .
(b)
f is separable.
(c)
Given an integer n 1 , f divides x q n x f has a root in 𝔽 q n m n .

Proof.

Note: we suppose that all the fields considered here are subfields of a field Ω , which can be an algebraic closure of 𝔽 q . In this case, there is a unique subfield of Ω with a given cardinality q d , written 𝔽 q d , where

𝔽 q d = { α Ω | α q d = α } . We begin with part (c). Let α Ω be a root of f . Since f is irreducible over 𝔽 q , the extension 𝔽 q 𝔽 q ( α ) has degree m = deg ( f ) . So | 𝔽 q ( α ) | = q m , therefore 𝔽 q ( α ) = 𝔽 q m (see the note). If α 𝔽 q n , then 𝔽 q ( α ) = 𝔽 q m 𝔽 q n , therefore m n (Corollary 11.1.8). Conversely, if m n , then 𝔽 q ( α ) = 𝔽 q m 𝔽 q n , so the root α of f is in 𝔽 q n . This proves the second equivalence of part (c). If f has a root α 𝔽 q n , then α q n = α , so α is a root of x q n x . As f is the minimal polynomial of α over 𝔽 q , f ( x ) x q n x . Conversely, suppose that f ( x ) x q n x . Take any root α of f in Ω . As f ( x ) x q n x , then α q n = α , and this implies α 𝔽 q n , so (c) is proved. We get part (a) by taking n = m in part (c), and part (b) follows immediately, since x q n x = x p x is separable by the proof of Theorem 11.1.4. □

Theorem 11.2.2 bis. Let

N m = { f 𝔽 q [ x ] | f  is monic irreducible over  𝔽 q  of degree  m } ,

and N m = | N m | .

Then, for any n 1 , we have

m n m N m = q n ,

where the sum is over all positive divisors of n .

Proof. Since x q n x is separable, we know that it factors as a product of distinct irreducible polynomials in 𝔽 p [ x ] . Furthermore, since it is monic, we can assume that the polynomials in the factorization are also monic. Finally, part (c) of Proposition 11.2.1 bis shows that the polynomials in the factorization are all monic irreducible polynomials of 𝔽 p [ x ] whose degree m divides n . Thus

x q n x = m n f N m f .

Since every f N m has degree m , taking the degree of each side give the desired formula. □

Theorem 11.2.4 bis. The number of monic irreducible polynomials of degree n in 𝔽 q [ x ] is given by

N n = 1 n m n μ ( m ) q n m .

Proof. Write F ( n ) = n N n ,and G ( n ) = m n F ( m ) = q n .

The Möbius inversion formula gives F ( n ) = m n μ ( m ) G ( n m ) . So

n N n = m n μ ( m ) q n m .

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