* Your assessment is very important for improving the work of artificial intelligence, which forms the content of this project
Download Rationality and the Tangent Function
Cubic function wikipedia , lookup
Polynomial ring wikipedia , lookup
Field (mathematics) wikipedia , lookup
Quartic function wikipedia , lookup
Polynomial greatest common divisor wikipedia , lookup
Root of unity wikipedia , lookup
System of polynomial equations wikipedia , lookup
Factorization of polynomials over finite fields wikipedia , lookup
Factorization wikipedia , lookup
Eisenstein's criterion wikipedia , lookup
RATIONALITY AND THE TANGENT FUNCTION 15 and onto H if 4|n. AutQ Q (r1 ) has the same cardinality as its image under μ, so μ is an isomorphism onto its image. ¤ Corollary 10. Let n > 2 be natural and k an integer such that rk = tan kÏ/n exists. The roots of a minimal polynomial of rk over Q are precisely the numbers rjk where j is any integer such that (j, n) = 1 and, in case 4|n, j â¡ 1 mod 4. Proof. Note that we are not assuming (k, n) = 1. Let Ï (x) be a minimal polynomial of rk over Q. Clearly, Q (rk ) â Q (r1 ). Q (rk ) is the splitting field of Ï (x) over Q, so Q (rk ) is Galois (and stable) over Q. Thus, any Ï â AutQ Q (r1 ) maps Q (rk ) into itself and permutes the roots of Ï (x). Hence, the numbers in the statement of the corollary are indeed roots of Ï (x). The converse follows similarly, since AutQ Q (rk ) permutes the roots ¤ of Ï (x) transitively and any Ï â AutQ Q (rk ) extends to some Ï â AutQ Q (r1 ). Notice that if 4 - n and 2 6= d|n, then rn/d and rân/d are roots of the same minimal polynomial by Corollary 10, since (n â 1) n/d â¡ ân/d mod n and (n â 1, n) = 1. If 4|n, then this is not always true. Corollary 11. Let n > 2 be natural. Suppose 4|d and d|n. Then, rn/d and rân/d are not roots of the same minimal polynomial over Q. Proof. Otherwise, there is an integer j such that j â¡ 1 mod 4 and jn/d â¡ ân/d mod n by Corollary 10. Then, d|j + 1 and j â¡ 3 mod 4, a contradiction. ¤ The factorization of pn (x) over Q is now straightforward. The irreducible factors of pn (x) roughly correspond to divisors of n. The factorization is simplest for odd n. Fix n > 2 odd. Let d be a positive divisor of n. Define: Y¡ ¢ (6.1) Ï d (x) = x â rjn/d where the product is over distinct values jn/d mod n for integers j such that (j, n) = 1. Corollary 12. Ï d (x) â Q [x] is irreducible and has degree Ï (d). Proof. The coeï¬cients of Ï d (x) are symmetric polynomials in the roots rjn/d . Every Ï â AutQ Q (r1 ) permutes these rjn/d by Corollary 10, and therefore fixes the coeï¬cients of Ï d (x). The fixed field of AutQ Q (r1 ) is Q, and so Ï d (x) â Q [x]. The degree of rn/d = tan Ï/d is Ï (d) by Theorem 1. The number of terms in the product 6.1 equals the number of roots of a minimal polynomial of rn/d by Corollary 10, which equals deg rn/d = Ï (d). ¤ Thus, Ï d (x) is irreducible. In particular, Ï d (x) is a monic minimal polynomial of rn/d over Q. Note that d = 1 corresponds to the factor Ï 1 (x) = x of pn (x). Lemma 10. Ï d (x) and Ï e (x) have a common root iï¬ d = e. Proof. If they share a common root, then they have identical roots and rn/e is a root of Ï d (x). Corollary 10 implies there is an integer j such that (j, n) = 1 and jn/d â¡ n/e mod n. This implies j/d â 1/e â Z and je/d â Z. As d|n and (j, n) = 1, we get d|e. By symmetry, e|d and d = e. ¤