Finite fields
Quick preliminary facts:
- Let be a finite field. The characteristic of a finite field must be prime, so will contain one of the prime fields .
- Since is finite, it will be finite dimensional when considered as a vector space over . Using Prp 322.4, this tells us that the extension is algebraic.
- Let denote the degree . Recall that implies has an -basis of size . Thus, as an -vector space, is isomorphic to the space of column vectors, which contains elements, customarily denoted by . Fields of order are denoted by .
- Conversely, if is a finite field of order , we immediately have , since we cannot have .
- Do not confuse with the ring , which isn’t a field.
Example 345.1.
Consider . There is just one irreducible polynomial of degree in , namely , and is obtained by adjoining a root of of this polynomial to 1
By Prp 119.13, is a -basis for . It follows that .
Lemma 345.2.
0890ceLet be a positive power of .
The polynomial has no multiple root in any field extension of .
In the polynomial ring , .
Proof.
The derivative of is . Thus, and its derivative are relatively prime. Use Cor 342.7.
Expand in . The binomial coefficients are divisible by for in the range . Thus, the map sends these coefficients to zero, and in . The result is obtained for by induction.□
Lemma 345.3.
f27db6Let be a prime and let be a positive power of . Let be a field of characteristic , and let be the set of roots of in . Then is a subfield of .
Proof.
Let and be roots of the polynomial in . We have to show that , , , , and are roots of the same polynomial.
□
- , by Lem 2.2.
- .
- .
Theorem 345.4.
977ed1Let be a prime integer, and let be a positive power of .
Let be a field of order . The elements of are roots of the polynomial .
The irreducible factors of the polynomial over the prime field are the irreducible polynomials in whose degrees divide .
Let be a field of order . The multiplicative group of nonzero elements of is a cyclic group of order .
There exists a field of order , and all fields of order are isomorphic.
A field of order contains a subfield of order iff divides .
Proof.
The multiplicative group has order . Therefore the order of any element of divides , so , which means is a root of the polynomial . The remaining root of , zero, is the root of the polynomial . So every element of is a root of .
By Cor 103.12, is a direct sum of cyclic subgroups, say , where has order , and . let . For every , we have . Therefore every element of is a root of the polynomial . This polynomial has at most roots in , and therefore . On the other hand, . So . Since , the only possibility is that and . Therefore , and is cyclic.
There exists a field extension in which splits completely by Thm 342.2. The roots of in form a field by Lem 3.
We will now show that two fields and of the same order are isomorphic. As we know, both can be viewed as extensions and . Let be a generator for the cyclic group . Then , so the irreducible polynomial for over has degree . generates the ideal of polynomials in with root , since if is such that , then and are not relatively prime in by Prp 342.6, and being irreducible forces . Since is a root of , divides . Since splits completely in , has a root in too. Then and are both isomorphic to , hence to each other. Since the degree of the extension is equal to , , so we must have . Therefore, and are isomorphic.
Let and . Then and ; we can’t have unless .
Suppose , say . Substitution of into the equation shows that divides . Let be a field of order . Since the multiplicative group is cyclic of order , and since divides , contains an element of order . Then powers of this element are roots of in . Therefore splits completely in . Lem 3 shows that the roots form a field of order .
Let be an irreducible polynomial over of degree . The polynomial splits into linear factors in .
If divides , it will also factor into linear factors in , so it will have a root in . Now,
so .
Conversely, suppose that divides . Let be a root of in an extension field of . Then , so . By , contains a subfield of order , and by , there exists an isomorphism . Note that the isomorphism must be the identity on . By Rmk 338.2, is a root of . Therefore has a root in , and so divides by Prp 342.6.□
Corollary 345.5.
4e0304For every positive integer , there exists an irreducible polynomial of degree over .
Proof.
By Thm 4.4, there is a field of order . Its degree over is . By Thm 4.3, is cyclic. Clearly, a generator for this cyclic group will generate as an extension field, i.e, . Since , the degree of the irreducible polynomial of over is by Prp 119.13.□
Remark 345.6.
91a225The proof of Cor 5 tells us that a field of order can be obtained by going modulo an irreducible polynomial of degree in . Conversely, if is irreducible of degree , then the quotient is a field (because is maximal), and is an -vector space of dimension , hence has cardinality . Therefore it is a field with elements, and by Thm 4.4, isomorphic to .
Proposition 345.7.
No finite field is algebraically closed.
Proof.
Let’s suppose that is finite and write . Now take the polynomial . It’s easy to see that doesn’t have any roots in . Hence, is not algebraically closed.□