Cyclotomic Polynomials and Extensions

Subjects: Field Theory
Links: Field Extensions, Separable Field Extensions, Characteristic of a Ring, Splitting Fields and Normal Field Extensions

If K is a field, let L be the splitting field of the polynomial xn1K[x]. If K=Q, the polynomial is separable, but if K has characteristic p>0, and n=prq with pq, then $$x^n-1 = (x^q-1)^{p^r}\in K[x], $$and the splitting field of xq1 is the same as the splitting field of xn1. With this in mind, we can focus on the splitting fields of xn1 with pn. Let suppose that the characteristic of K doesn't divide n and L be the splitting field of xn1. The nth roots of unity form a finite group, μnL, this must be a cyclic group of order n. A generator of μn is called a primitive nth root of unity. If ω is a primitive nth root of unity, then L=K(ω). We call the fields L=K(ω) is called a cyclotomic field.

We see that every primitive nth root of unity can be used to generate L, if we consiser the all of the primitive roots of unity, the polynomial that they define is $$\Phi_n(x) :=\prod_{\omega}(x-\omega)\in L[x],$$where the product is over all the primitive nth roots of unity, and this polynomial is known as the nth cyclotomic polynomial.

Prop: Let K be a field and suppose that the characteristic of K doesn't divide n. If K0 is its prime field of K, then Φn(x)K0[x].

Th: Let K be a field and suppose that the characteristic of K doesn't divide n. Let Φn the nth cyclotomic polynomial over K, and let L be the splitting field of Φn over K, then

Prop: Let p be a prime and n be a positive integer such that pn.

The proposition above tells us that the there must be a primitive root modulo n, so must be of the form qk, 2qk, 2 and 4.

Cyclotmic Extensions over Q

Def: Let μn denote the group of nth roots of unity over Q.

Def: A generator of the cyclic group μn is called a primitive nth roots of unity. Let ζn be the a primitive nth root of unity.

Obs: Suppose m and n are relatively prime positive integers. Then ζmζn is a primitive mnth root of unity. If ζn is a primitive nth root of unity, and d is divisor of n, then ζnd is a primitive (n/d)th root of unity.

Def: We define the nth cyclotomic polynomial Φn(x) to be the polynomial whose roots are the primitive nth roots of unity $$\Phi_n(x) := \prod_{\zeta \text{ primitive }\in \mu_n}(x-\zeta) = \prod_{\substack{1 \le a <n \ (a, n) = 1}} (x-\zeta_n^a),$$which has degree φ(n), where φ(n) is the Euler Totient Function.

Obs: Let n be a positive integer, then $$x^n-1 = \prod_{d \mid n}\Phi_d(x).$$This is equivalent to $$n = \sum_{d\mid n}\phi(d) $$
Lemma: The cyclotomic polynomial Φn(x) is a monic polynomial in Z[x] of degree φ(n).

Prop: The cyclotomic polynomial Φn is an irreducible monic polynomial in Z[x] of degree φ(n).

Prop: If n is an odd integer, then Φ2n(x)=Φn(x).

Def: The field Q(ζn)/Q is called the cyclotomic field of nth roots of unity.

Cor: The degree over Q of the cyclotomic field of nth roots of unity is φ(n): $$[\Bbb Q(\zeta_n) : \Bbb Q] = \varphi(n). $$
Prop: If K/Q is a finite field extension, then K has only a finite number of roots of unity.

Prop: We can use the Möbius inversion formula to get the following formula: $$\Phi_n (x):= \prod_{d \mid n }(x^d-1)^{\mu(n/d)}.$$
Prop: Let be a prime, and let Φ(x)=(x1)/(x1)Z[x]. We want to determine the factorisation of Φ(x) modulo p for any prime p. Let ζ denote any fixed primive th root of unity.

We can get a weakened version of Dirichlet's Theorem on Primes in Arithmetic Progressions, but without the machinery that are Dirichlet L-functions.

Lemma: Given any monic polynomial p(x)Z[x] of degree at least one there are infinitely many distinct prime divisors of the integers $${p(n) \mid n \in \Bbb N^+}.$$

Lemma: Let p be a prime and m an integer such that pm. If a is an integer such that Φm(a)0(modp), then (a,p)=1, and the order of a in (Z/pZ)× is m.

Cor: Let aZ. If p is an odd prime that divides Φm(a), then either p divides m or p1(modm).

Th: For any positive integer m there are infinitely many primes p with p1(modm).

Th: The Galois group of the cyclotomic field Q(ζn) of nth roots of unity is isomorphic to the multiplicative group (Z/nZ)×. The isomorphism is given explicitly by the map a(modn)σa, where σa(ζn)=ζna.

Obs: A basis for Q(ζp) over Q is given by $$\zeta_p, \zeta_p^2, \dots, \zeta_p^{p-2},\zeta_p^{p-1}.$$The reason for choosing this basis is that any σ in the Galois group Gal(Q(ζp)/Q) simply permutes these basis elements since these are precisely the primitive p roots of unity. This where we need that p is prime. Let H be any subgroup of the Galois group of Q(ζp) over Q and let $$\alpha_H = \sum_{\sigma\in H} \sigma(\zeta_p), $$the sum of the conjugates by the elements in H. We can prove that the fixed field of H is Q(α).

Cor: Let n=k=0pkαk be the prime decomposition of the positive integer n into distinct prime powers. Then the cyclotomic fields Q(ζpkαk), kN intersect only in the field Q and their composite is the cyclotomic field Q(ζn). We have $$\text{Gal}(\Bbb Q(\zeta_n)/\Bbb Q) \cong \prod_{k = 0}^\infty \text{Gal}(\Bbb Q(\zeta_{p_k^{\alpha_k}})/\Bbb Q) $$which by the we get the following isomorphism, equivalent to the Chinese Remainder Theorem$$(\Bbb Z/n \Bbb Z)^\times \cong \prod_{k = 0}^\infty (\Bbb Z/p_k^{\alpha_k}\Bbb Z)^\times $$
Th: Let G be any finite abelian group. Then there is a subfield K of a cyclotomic field with Gal(K/Q)G.

() Kronecker-Weber Theorem: Let K be a finite abelian extension of Q. Then K is contained in a cyclotomic extension of Q.

Prop: Let ζn denote the primitive nth root of unity and let K=Q(ζn) be the associated cyclotomic field. We see that TrK/Q(ζn)=μ(n), where μ is the Möbius function, and TrK/Q is the trace of an element.

Prop: The primitive nth roots of unity form a basis over Q for the cyclotomic field of nth roots of unity iff n is squarefree.

Def: We see that complex conjugation restricts to the automorphism σ1Gal(Q(ζn)/Q) of the cyclotomic field of nth roots of unity. We see that Q(ζn+ζn1) is a subfield of the real elements of Q(ζn). We call this field the maximal real subfield of Q(ζn).