Homepage › Solution manuals › David A. Cox › Galois Theory › Exercise 11.2.9
Exercise 11.2.9
State and prove analogs of Theorem 11.2.2 and 11.2.4 that count monic irreducible polynomials of degree in , where is now a power of the prime .
Answers
Let a power of the prime .
Proposition 11.2.1 bis. Let be irreducible over , of degree . Then:
- (a)
- divides .
- (b)
- is separable.
- (c)
- Given an integer , divides has a root in .
Proof.
Note: we suppose that all the fields considered here are subfields of a field , which can be an algebraic closure of . In this case, there is a unique subfield of with a given cardinality , written , where
We begin with part (c). Let be a root of . Since is irreducible over , the extension has degree . So , therefore (see the note). If , then , therefore (Corollary 11.1.8). Conversely, if , then , so the root of is in . This proves the second equivalence of part (c). If has a root , then , so is a root of . As is the minimal polynomial of over , . Conversely, suppose that . Take any root of in . As , then , and this implies , so (c) is proved. We get part (a) by taking in part (c), and part (b) follows immediately, since is separable by the proof of Theorem 11.1.4. □Theorem 11.2.2 bis. Let
and .
Then, for any , we have
where the sum is over all positive divisors of .
Proof. Since is separable, we know that it factors as a product of distinct irreducible polynomials in . Furthermore, since it is monic, we can assume that the polynomials in the factorization are also monic. Finally, part (c) of Proposition 11.2.1 bis shows that the polynomials in the factorization are all monic irreducible polynomials of whose degree divides . Thus
Since every has degree , taking the degree of each side give the desired formula. □
Theorem 11.2.4 bis. The number of monic irreducible polynomials of degree in is given by
Proof. Write ,and .
The Möbius inversion formula gives . So
□