Exercise 11.23

Let p 1 < p 2 < p 3 < ⋯ denote the positive prime numbers arranged in order. Let N m = p 1 m p 2 m ⋯ p m m and let E m denote the field with q N m elements. Show that E m can be considered as a subfield of E m + 1 and that E = ⋃ ⁡ E m is an extension of E 0 = F , a finite field with q elements, with the following property; for every positive integer n , E contains one and only one subfield F n with q n elements.

Answers

Proof. Here q = p a is a power of p .

We build the family E m by induction.

For m = 0 , N 0 = 1 . Take E 0 = F , a finite field with q elements, whose existence is proved in Theorem 3, Chapter 7. Then | E 0 | = q = q N 0 .

Suppose that we know an extension E m of F with q N m elements, so that [ E m : F ] = N m .

Write s = N m and t = N m + 1 . Then t = ( p 1 ⋯ p m p m + 1 m + 1 ) s , so s ∣ t , and k = t ∕ s is an integer. By Exercise 7.14, there exists a polynomial p ( x ) ∈ E m [ x ] of degree k , irreducible over E m . Then K = E m [ x ] ∕ ( p ( x ) ) is a field, and the map j : E m → K defined by j ( α ) = α ¯ = α + ( p ( x ) ) is injective. This allows us to “identify” E m and j ( E m ) .

More explicitly, if we define E m + 1 = ( K ∖ j ( E m ) ) ∪ E m (that is, we replace the elements of j ( E m ) by the corresponding elements in E m ), then E m ⊂ E m + 1 absolutely, and

φ { K → E m + 1 α ↦ { β if  α = j ( β ) ∈ j ( E m ) α if  α ∉ j ( E m )

is a bijection. This bijection allows us to define a structure of field over E m + 1 by transport of structure, i.e. the laws +,× on E m + 1 are given by

u + v = φ ( φ − 1 ( u ) + φ − 1 ( v ) ) , u × v = φ ( φ − 1 ( u ) × φ − 1 ( v ) ) , u , v ∈ E m + 1 .

Then E m + 1 is a field for these laws, φ is a field isomorphism, and E m is a subfield of E m + 1 . Since the degree of E m + 1 ≃ K = E m [ x ] ∕ ( p ( x ) ) is k = deg ⁡ ( p ) , [ E m + 1 : E m ] = k = N m + 1 ∕ N m , therefore [ E m + 1 : F ] = [ E m + 1 : E m ] [ E m : F ] = k N m = N m + 1 . Thus | E m + 1 | = q N m + 1 .

To conclude this part, the sequence ( E m ) m ∈ ℕ is an increasing sequence for inclusion, and for each m ∈ N , | E m | = q N m .

Now consider the set union

E = ⋃ m ∈ ℕ E m .

We can define additive and multiplicative laws on E . If α , β ∈ E , then α ∈ E r , β ∈ E s . If m = max ⁡ ( r , s ) , then α , β ∈ E m , so that α + β is defined in E m . Moreover, assume that α , β ∈ E m ′ for another index m ′ . Then E m ⊂ E m ′ , or E m ′ ⊂ E m . If we suppose E m ⊂ E m ′ (the other case is similar), E m is a subfield of E m ′ , so that α + β is the same in E m or E m ′ . This allows us to define α + β in E as the sum of α , β in any field E m such that α , β are both in E m . Similarly, we define the law × .

Then the axioms of a field are verified. For instance, if α , β , γ ∈ E , there is some m ∈ ℕ such that α , β , γ ∈ E m , where α ( β + γ ) = αβ + αγ . Thus this equality is true on E .

This shows that ( E , + , × ) is a field, and E m is a subfield of E for every m ∈ ℕ . In particular, E is an extension of F = E 0 .

Now we verify that E has the expected property. Let n ∈ ℕ ∗ be a positive integer. Consider

F n = { α ∈ E ∣ α q n = α } .

Then F n is a subfield of E . Indeed, 1 ∈ F n , and if α , β ∈ F n , and γ ∈ F n ∗ , then

( α + β ) q n = α q n + β q n = α + β , ( αβ ) q n = α q n β q n = αβ , ( γ − 1 ) q n = ( γ q n ) − 1 = γ − 1

thus α + β , αβ , γ − 1 ∈ F n . Let n = p 1 a 1 ⋯ p k a k be the decomposition of n in prime factors, for some k ∈ ℕ , and a i ≥ 0 , i = 1 , 2 , … , k . If m = max ⁡ { a 1 , … ⁡ , a k } , then n ∣ N m . By Lemma 2 and 3 of Chapter 7, this shows that q n − 1 ∣ q N m − 1 , thus x q n − 1 − 1 ∣ x q N m − 1 − 1 , thus x q n − x ∣ x q N m − x . By proposition 7.1.1, since E m is a field with q N m elements,

x q N m − x = ∏ α ∈ E m ( x − α ) .

therefore the factor x q n − x of x q N m − x splits completely over E m , a fortiori over E , and Corollary 2 shows that all the roots of x q n − x , which are in E m , are simple roots.

This proves that

x q n − x = ∏ α ∈ A ( x − α ) ,

where A ⊂ E m ⊂ E .

By definition of F n , for all α ∈ E , α is a root of x q n − 1 if and only if α ∈ F n , thus A = F n , and

x q n − x = ∏ α ∈ F n ( x − α ) ,

The comparison of the degrees gives

q n = | F n | .

This proves that E contains a field F n with q n elements.

Suppose that E contains another field F n ′ with q n elements, then the preceding argument shows that

x q n − x = ∏ α ∈ F n ( x − α ) = ∏ α ∈ F n ′ ( x − α ) ,

therefore F n = F n ′ .

For every positive integer n , E contains one and only one subfield F n with q n elements. □

Note: We can show a little more, that E is an algebraic closure of F .

First, E is algebraic over F , since every α ∈ E is in some E m , which is a finite extension of F , thus α is algebraic over F ∗ .

Next, we show that E is algebraically closed. Let p ( x ) = ∑ ⁡ k = 0 l a k x k ∈ E [ x ] be any non constant polynomial with coefficients in E . There is a m ∈ ℕ such that all the coefficients a i are in E m , so that p ( x ) ∈ E m [ x ] . Let f ( x ) be an irreducible factor of p ( x ) over E m , with deg ⁡ ( f ) = d ≥ 1 .

Then f ( x ) has a root γ in the field K = E m [ x ] ∕ ( f ( x ) ) , where | K | = q d N m , so γ is a root of x q d N m − x . Since f ( x ) is the minimal polynomial of γ over E m , this proves that f ( x ) ∣ x q d N m − x . If n = d N m , we have seen that if F n is the subfield of E with q n elements, then x q n − x = ∏ ⁡ α ∈ F n ( x − α ) , so that f ( x ) splits completely over F n = F d N m ⊂ E . Therefore f ( x ) has a root in E , and also p ( x ) .

We have proved that E is an algebraic closure of F (with a concrete construction, without the axiom of choice, used in the general proof of the existence of algebraic closure).

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