Exercise 7.15

Let x n − 1 ∈ F [ x ] , where F is a finite field with q elements. Suppose that ( q , n ) = 1 . Show that x n − 1 splits into linear factors in some extension field and that the least degree of such a field is the smallest integer f such that q f ≡ 1 ( mod n ) .

Answers

Proof. From exercise 7.12, we know that x n − 1 splits into linear factors in some extension field K , with [ K : F ] < ∞ :

u ( x ) = x n − 1 = ( x − ζ 0 ) ( x − ζ 1 ) ⋯ ( x − ζ n − 1 ) , ζ i ∈ K .

Then u ′ ( x ) ∧ u ( x ) = n x n − 1 ∧ ( x n − 1 ) = 1 , since x ( n x n − 1 ) − n ( x n − 1 ) = n , and n ≠ 0 in the field F , because we know from the hypothesis q ∧ n = 1 that the characteristic p doesn’t divide n . So the n roots of x n − 1 are distinct.

The set G = { x ∈ K | x n = 1 } is a subgroup of K ∗ , thus G is cyclic of order n . Let ζ a generator of G . Then

x n − 1 = ( x − 1 ) ( x − ζ ) ( x − ζ 2 ) ⋯ ( x − ζ n − 1 ) .

Let p ( x ) be the minimal polynomial of ζ on F , and f the degree of p :

f = deg ⁡ ( p ) = [ F [ ζ ] : F ] .

Thus Card F [ ζ ] = q f , and since ζ ∈ F [ ζ ] ∗ , ζ q f − 1 − 1 = 0 . As the order of ζ in the group G is n , n ∣ q f − 1 , namely q f ≡ 1 ( mod n ) .

Let k be any positive integer such that q k ≡ 1 ( mod n ) .

Then n ∣ q k − 1 , thus ζ q k − 1 − 1 = 0 , and ζ q k − ζ = 0 . Let L be any extension of K such that x q k − x splits in linear factors in L , and let M = { α ∈ L ∣ α q k = α } . We know that M is a subfield of L (see Ex. 13), with cardinality q k , so that [ M : F ] = k . As ζ q k − ζ = 0 , ζ belongs to M . Therefore F [ ζ ] ⊂ M , thus f = [ F [ ζ ] : F ] ≤ k = [ M : F ] .

So f = [ F [ ζ ] : F ] is the smallest k ∈ ℕ ∗ such that q k ≡ 1 ( mod n ) .

If K is any extension of F containing the roots of x n − 1 , then K ⊃ F [ ζ ] , where ζ is a primitive root of unity, so [ K : F ] ≥ [ F [ ζ ] : F ] = f .

Conclusion: the minimal degree of a extension K ⊃ F containing the roots of x n − 1 , with n ∧ q = 1 , is the smallest positive integer f such that q f ≡ 1 ( mod n ) , the order of q modulo n . □

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