Homepage › Solution manuals › David A. Cox › Galois Theory › Exercise 15.5.7
Exercise 15.5.7
When evaluating the multiplication formula for at a complex number , one needs to worry about poles and vanishing denominators.
- (a)
-
Let
be odd, and assume that
is a pole of neither
nor
. Prove carefully that
and that
Exercise 9 of Section 5.4 will be useful.
- (b)
-
Let
be odd, and let
be a prime dividing
. Then let
be a Gaussian prime such that
if
and
if
. Use part (a) to prove carefully that
Theorem 15.3.2 will be helpful.
- (c)
- Let be odd, and let be a prime such that divides . Also define as in part (b). Prove that
Answers
Proof. (a) Assume that is not a pole of . We will prove that implies that is a pole of .
Write , and . Since , there is some polynomial and some such that (we have not proved in the text that has no multiple root) and , so that, with ,
For all such that both members are defined,
where is analytic in some neighborhood of , since is not a pole of , and since .
Moreover, by Exercise 9 of section 5.4, and have no common roots. Since is a root of , we have , so that
If was a zero of , then and , in contradiction with the hypothesis, thus .
We write
where is analytic in a neighborhood of , and is the order of the zero of (thus or by the proof of theorem 15.3.3).
Then
where and . Then is analytic in a neighborhood of , since is not a pole of . Moreover . Therefore is analytic in , and .
Since the poles of are isolated, there is a neighborhood of such that is defined on .
Then, for all in the neighborhood of such that , since both members are defined in ,
Since are analytic, and , is analytic in a neighborhood of , and
Moreover, since , . This proves that has a pole of order .
This proves by contraposition that if is a pole of neither nor , then .
Moreover, since is not a pole of , is defined, and since , where is not a pole of , the right member is defined, thus
(b) In both cases of the sentence, is a Gaussian prime dividing . Thus there is a Gaussian integer such that
Since is odd, and are odd.
To apply part (a), it remains to verify that is a pole of neither nor .
has no real poles, thus is not a pole of .
If was a pole of , then would be a pole of . The Theorem 15.3.2 shows that
But then , because and are odd. This contradicts , and this contradiction shows that is not a pole of .
Therefore, by Theorem 15.4.4 and part (a),
This shows that
(c) Now . Since is a Gaussian prime dividing , divides in , thus there is some such that
We know that and are odd, thus is odd.
Since is odd, the same proof as in part (b) shows that is a pole of neither nor .
Therefore, by Theorem 15.4.4 and part (a),
This equality shows that
□