Homepage › Solution manuals › David A. Cox › Galois Theory › Exercise 9.1.12
Exercise 9.1.12
Here are some further properties of cyclotomic polynomials.
- (a)
- Given , let . Prove that . This shows that we can reduce computing to the case when is squarefree.
- (b)
- Let be an odd integer. Prove that .
- (c)
- Let be a prime not dividing an integer . Prove that .
Answers
Lemma. Let be two monic polynomials in , of same degree , and separable.
If every root of in is a root of , then .
Proof of the Lemma. As is monic separable of degree , the decomposition in irreducible factors of in is
The hypothesis implies that for all , , hence . As , and as are monic, then . □
Proof.
- (a)
-
. Write
. Then
.
, therefore
.
Moreover these polynomials are monic and is separable. It remains to show that every root of is a root of .
Such a root has order in the group .
Write .
Then the order of is . Indeed, for all ,
.
Therefore, by definition of , .
The hypotheses of the lemma are satisfied, thus
- (b)
-
We show that
(
odd, so
).
Note first that .
If , then is even. Indeed, we can group in pairs the elements of , with the pairs , where and since , which is impossible if . Hence
is monic by definition, and the leading coefficient of is , so is also monic.
Let be any root of . Then , where is a th primitive root of unity, so is an element of order in the group .
Then the order of is . Indeed, for all ,
, that is , implies , thus , so (since is odd), therefore and so .
As .
Conversely, if .
Conclusion: , so the order of is , hence is a root of .
Every root of in is a root of . Moreover is a separable polynomial, and . Then the lemma gives the conclusion, for all odd , ,
- (c)
-
We show first that divides . As is separable, it is sufficient to verify that every root of is a root of . Such a root is a th primitive root of unity, so its order is . Then the order of is also . Indeed, for all , as ,
Therefore is a root of , so and is a root of .
We compare the degrees:
,
, thus
Moreover, these two polynomials are monic, and is separable.
We show that every root of is a root of .
If is a root of , then , therefore
(indeed, for all , ).
So is a root of , which is equivalent to is a root of .
As , , , therefore is a root of .
The hypotheses of the lemma are so satisfied, so