Download Rationality and the Tangent Function

Survey
yes no Was this document useful for you?
   Thank you for your participation!

* Your assessment is very important for improving the work of artificial intelligence, which forms the content of this project

Document related concepts

Resultant wikipedia , lookup

Polynomial wikipedia , lookup

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

Algebraic number field wikipedia , lookup

Fundamental theorem of algebra wikipedia , lookup

Transcript
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 coefficients 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 coefficients
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 iff 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.
¤