Homepage › Solution manuals › David A. Cox › Galois Theory › Exercise 11.2.15
Exercise 11.2.15
This exercise will illustrate how the word ”primitive” is sometimes overused in mathematics. In the previous problem, we computed the number of primitive elements of . In this problem, we consider the primitive roots of , which are generators of the cyclic group . The minimal polynomial over of a primitive root of is called a primitive polynomial for . These are the minimal polynomials of the primitive st roots of unity in characteristic .
- (a)
- Prove that has primitive roots, where is the Euler -function.
- (b)
- Prove that every primitive polynomial for has degree .
- (c)
- Prove that the product of the primitive polynomials for is .
Answers
Proof.
- (a)
- Let a generator of the cyclic group , with cardinality . Then , is a generator of the same group if and only if , so has primitive roots.
- (b)
-
Let
be a primitive root of
. As
, then
(in other words, a primitive root of
is a primitive element of the extension
).
Let be a primitive polynomial. By definition, is the minimal polynomial of a primitive root . Then
Every primitive polynomial for has degree .
- (c)
-
By definition of the cyclotomic polynomials (and Proposition 11.2.6),
where we write the order of in the group .
So the roots of are the primitive roots of .
Let be a primitive polynomial for . By definition , is the minimal polynomial of some primitive root of . Since , divides .
Conversely, let be an irreducible factor of . Let be a root of in some extension of . Since and , then , , therefore . Moreover is a root of , so is a primitive root of , thus is a primitive polynomial for .
So the irreducible factors of in are all primitive polynomials for . Since is a separable polynomial, is squarefree, so is the product of its monic irreducible factors:
the product of the primitive polynomials for is .
Note: this is consistent with Theorem 11.2.7. Indeed, is the product of irreducible polynomials in of degree , where is the minimum of the integers such that , so (the order of modulo is ). Here we have proved that these factors are the primitive polynomials for .