Exercise 5.4.2

Let F be a finite field, and let F L be a finite extension. We claim that there is α L such that L = F ( α ) and α is separable over F .

(a)
Show that L is a finite field.
(b)
The set L = L { 0 } is a finite group under multiplication and hence is cyclic by Proposition A.5.3. Let α L be a generator. Prove that L = F ( α ) .
(c)
Let m = | L | 1 . Show that α i is a root of x m 1 for all 0 i m 1 , and conclude that x m 1 = ( x 1 ) ( x α ) ( x α 2 ) ( x α m 1 ) .

(d)
Use part (c) to show that α is separable over F .

Answers

Proof. Let F a finite field, and F L a finite extension.

(a)
As n = [ L : F ] < , there exists a basis ( l 1 , , l n ) of L over F , thus every element α L is of the form α = γ 1 l 1 + + γ n l n , with a unique ( γ 1 , , γ n ) F n . Therefore L is isomorphic to F n as a vector space, thus | L | = | F | n < . L is a finite field.
(b)
L being the finite multiplicative group of a field is cyclic (Proposition A.5.3), with a generator α L : L = { 1 , α , α 2 , , α m 1 } , where  m = | L | 1 .

So every γ in L is of the form γ = α k , k , thus L F ( α ) , and 0 F [ α ] , thus L F ( α ) . Moreover F L , and α L , thus F ( α ) L .

L = F ( α ) .

(c)
As ( L , × ) is a group of cardinality m = | L | 1 , Lagrange’s Theorem shows that every γ L = { 1 , α , α 2 , , α m 1 } satisfies γ m = 1 , and so is a root of x m 1 .

Since the order of α is m , α i α j if 0 i < j m 1 , thus the polynomial p = ( x 1 ) ( x α ) ( x α m 1 ) divides x m 1 . The degree of the quotient is 0, so this quotient is a constant c F . Since p and x m 1 are monic, c = 1 .

x m 1 = ( x 1 ) ( x α ) ( x α m 1 ) .

(d)
The minimal polynomial f of α over F divides x m 1 , which is separable by part (c). Thus f is also separable. Therefore α is separable, and L = F ( α ) : the Theorem of the Primitive Element is proved in the case of a finite extension of a finite field.
User profile picture
2022-07-19 00:00
Comments