Exercise 11.2.15

This exercise will illustrate how the word ”primitive” is sometimes overused in mathematics. In the previous problem, we computed the number of primitive elements of 𝔽 p 𝔽 p n . In this problem, we consider the primitive roots of 𝔽 p n , which are generators of the cyclic group 𝔽 p n . The minimal polynomial over 𝔽 p of a primitive root of 𝔽 p n is called a primitive polynomial for 𝔽 p n . These are the minimal polynomials of the primitive ( p n 1 ) st roots of unity in characteristic p .

(a)
Prove that 𝔽 p n has ϕ ( p n 1 ) primitive roots, where ϕ is the Euler ϕ -function.
(b)
Prove that every primitive polynomial for 𝔽 p n has degree n .
(c)
Prove that the product of the primitive polynomials for 𝔽 p n is Φ p n 1 ( x ) .

Answers

Proof.

(a)
Let γ a generator of the cyclic group 𝔽 p n , with cardinality p n 1 . Then γ k , 0 k < p n 1 , is a generator of the same group if and only if k n = 1 , so 𝔽 p n has ϕ ( p n 1 ) primitive roots.
(b)
Let α be a primitive root of 𝔽 p n . As F p n = { 0 } { 1 , α , α 2 , , α p n 2 } , then 𝔽 p n = 𝔽 p ( α ) (in other words, a primitive root of 𝔽 p n is a primitive element of the extension 𝔽 p 𝔽 p n ).

Let f be a primitive polynomial. By definition, f is the minimal polynomial of a primitive root α . Then

deg ( f ) = [ 𝔽 p ( α ) : 𝔽 p ] = [ 𝔽 p n : 𝔽 p ] = n .

Every primitive polynomial for 𝔽 p n has degree n .

(c)
By definition of the cyclotomic polynomials (and Proposition 11.2.6), Φ p n 1 ( x ) = o ( α ) = p n 1 ( x α ) ,

where we write o ( α ) the order of α in the group 𝔽 p n .

So the roots of Φ p n 1 ( x ) are the primitive roots of 𝔽 p n .

Let f be a primitive polynomial for 𝔽 p n . By definition , f is the minimal polynomial of some primitive root α of 𝔽 p n . Since Φ p n 1 ( α ) = 0 , f divides Φ p n 1 ( x ) .

Conversely, let f 𝔽 p [ x ] be an irreducible factor of Φ p n 1 ( x ) . Let α be a root of f ( x ) in some extension of 𝔽 p n . Since f ( x ) Φ p n 1 ( x ) and Φ p n 1 ( x ) x p n 1 1 , then α p n 1 = 1 , α p n = α , therefore α 𝔽 p n . Moreover α is a root of Φ p n 1 ( x ) , so α is a primitive root of 𝔽 p n , thus f is a primitive polynomial for 𝔽 p n .

So the irreducible factors of Φ p n 1 ( x ) in 𝔽 p [ x ] are all primitive polynomials for 𝔽 p n . Since Φ p n 1 ( x ) is a separable polynomial, Φ p n 1 ( x ) is squarefree, so Φ p n 1 ( x ) is the product of its monic irreducible factors:

the product of the primitive polynomials for 𝔽 p n is Φ p n 1 ( x ) .

Note: this is consistent with Theorem 11.2.7. Indeed, Φ p n 1 ( x ) is the product of irreducible polynomials in 𝔽 p [ x ] of degree m , where m is the minimum of the integers k such that d = p n 1 p k 1 , so m = n (the order of p modulo p n 1 is n ). Here we have proved that these factors are the primitive polynomials for 𝔽 p n .

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