Click on the colored portions to expand or collapse content.

Cyclotomic Fields

Roots of Unity in C


Geometrically, μn are the vertices of a regular polygon inscribed in a unit circle. Let ζn=exp(2πi/n) (nth root of unity), then we can write μn(C)={exp(2πian) such that 1an}={ζan such that 1an} Thus, μn is a cyclic subgroup of order n, that is μnZ/nZ and thus for every divisor d|n, there is exactly one subgroup of order d. Another avatar of these subgroups are the cyclotomic polynomials Φd(X). The generators of the cyclic group μn are called the primitive nth roots of unity. These are precisely 0m<n such that gcd(m,n)=1 and are denoted as (Z/nZ)×.
  All the fractions a/n can be written in a reduced form m/d where d|n and gcd(m,d)=1. Let μ0d(C)={exp(2πimd) such that 1m<d}={ζμd such that ζj1 for 1j<d} Thus, writing μn by reducing a/n we have μn(C)=d|n{exp(2πimd) such that gcd(m,d)=1,1m<d}=d|nμ0d(C)


Irreducible cyclotomic polynomial on Q

For m=1, we see that nth root of unity is a root of Φn(X). Some examples, Φ1(X)=X1Φ2(X)=X+1Φ3(X)=X2+X+1Φ4(X)=X2+1Φ5(X)=X4+X3+X2+X+1Φ6(X)=X2X+1Φ7(X)=X6+X5+X4+X3+X2+X+1Φ8(X)=X4+1Φ9(X)=X6+X3+1


Proof All nth roots of unity have order d|n, that is a primitive dth root of 1. Inversely, if ζ is a primitive dth root of 1. We deduce that the set of nth roots of 1 is the disjoint union (parametrised by the divisors d of n) of dth primitive roots. Since Xn1=(Xζ), the product being understood over nth roots of unity, we deduce the formula Xn1=d|nΦd(X) We will use the fact that if F(X),G(X)Z[X] with G(X) monic then the quotient of F(X) divided by G(X), say Q(X)Z[X]. This follows from euclidean division.
Starting from Φ1(X)=X1 and noticing the LHS is Xn1 we can divide by Φ1(X) to get the remaining terms in Z[X] by the above fact. Thus, we obtain by induction on Z that Φd has integer coefficients for all d|n, thus also for d=n.
Some examples, X1=Φ1X21=(X1)(X+1)=Φ1Φ2X31=(X1)(X2+X+1)=Φ1Φ3X41=(X1)(X+1)(X2+1)=Φ1Φ2Φ4X51=(X1)(X4+X3+X2+X+1)=Φ1Φ5X61=(X1)(X+1)(X2+X+1)(X2X+1)=Φ1Φ2Φ3Φ6X71=(X1)(X6+X5+X4+X3+X2+X+1)=Φ1Φ7X81=(X1)(X+1)(X2+1)(X4+1)=Φ1Φ2Φ4Φ8X91=(X1)(X2+X+1)(X6+X3+1)=Φ1Φ3Φ9


Proof : Let ζn be the nth root of unity (and thus is a root of Φn). It suffices to prove that Φn|P if P is the minimal polynomial of ζn, or all primitive roots are roots of P. Let p be a prime number not dividing n, and ζ a root of P (minimal among the ζn), then ζ is necessarily primitive because P|Φn.
Proof: Suppose to the contrary and write Xn1=P(X)S(X). Since ζn is an algebraic integer its minimal polynomial P(X)Z[X] is monic and thus S(X)Z[X]. Since, we assumed P(ζp)0 we have S(ζp)=0. Hence, P(X) and Q(X)=S(Xp) have a common complex root ζ. Their GCD (calculated over Q) is therefore not constant, so that P|Q in Q[X] (irreducibility of P) therefore in Z[X] since P is monic. Reducing modp, we get ˉQ=ˉSp using Frobenius. Since n0 in Fp as by assumption pn, Xn1 and its derivative nXn have no common root in ¯Fp (making Xn1 separable), so that neither Xn1 nor ˉP have multiple factors in Fp[X] (that is, ˉP is separable). Let R be an irreducible factor of ˉP. Divisor ˉSp, it divides ˉS so that R2|Xn1 in Fp[X] (R is a factor of ¯P as well as ¯Q, since P|Q and thus of ˉSp), a contradiction since ˉP is separable.


Let ζ be any root of Φn, thus it is primitive, then ζ=ζm with gcd(m,n)=1 where ζ is root of P. Now, m can be decomposed into prime factors and repeated application of the lemma gives ζ as a root of P and hence Φn|P. For example if m=p21p2, then ζ=(((ζ)p1)p1)p2 and inductive application of lemma shows ζ is a root of P.


Roots of Unity in Ωk

Let n be an integer greater than 1, and prime to the char k where k is a field. This assures that Xn1 and its derivative nXn1 do not have a common zero in Ω (algebraic closure of k) and thus Xn1 is a separable polynomial. The set μn(Ω) of the roots in Ω is thus of size n and is a finite subgroup of Ω×, hence is cyclic and isomorphic to Z/nZ.
  We recall that, by definition, a primitive nth root of unity of 1 is generator of the cyclic group μn(Ω). We can make a choice of ζn as a generator. Let (Z/nZ)× denote the multiplicative group of invertible elements of Z/nZ, then the other primitive n the roots are ζmn where m is prime to n, or m(Z/nZ)×. (Z/nZ)×=Set of positive integers less than n and prime to n
  Since μn(Ω) is generated by ζmn (hence, choice of primitive root does not matter), the field of decomposition of Xn1 is simply k[ζn] (or k[ζmn] ) and thus is Galois on k. We note that |Gal(k[ζn]/k)|n since the polynomial Xn1 has degree n. We denote Gn:=Gal(k[ζn]/k). As noted before ζn can be replaced with any ζmn, since any ζmn generates (Z/nZ)×.



Proof : As noted before the splitting field of Xn1 is k[ζn]. Since, the extension k[ζn]/k is algebraic and contains all conjugates of ζn, the extension is Galois and the degree of extension is n where n is degree of Xn1.



Proof: We can write the image of ζn under the action of an element gGn uniquely as g(ζn)=ζχ(g)n where χ(g)(Z/nZ)×. ζμn can be written as ζ=ζmn with m(Z/nZ)×. Existence can be shown by the following g(ζ)=g(ζmn)=(g(ζn))m=(ζχ(g)n)m=(ζmn)χ(g)=ζχ(g) For uniqueness, let there be a second morphism χ:Gn(Z/nZ)× such that for all gGn and ζμn we have g(ζ)=ζχ(g). The above gives for all gGn and ζμn 1=ζχ(g)χ(g). Setting ζ=ζn we deduce that χ(g)χ(g) is divisible by order of ζnμn which is n. But, χ maps into (Z/nZ)×, hence giving χ(g)χ(g)=0.


Proof Let g,gGn and ζμn, we have (gg)(ζ)=g(ζχ(g))=ζχ(g)χ(g) thus giving χ(gg)=χ(g)χ(g). We also have (gg1)(ζ)=ζ=ζχ(g)χ(g1) hence χ(g1)=(χ(g))1. Since ζn generates k[ζn], and ζmn with m(Z/nZ)× is not 1, we deduce that χ is injective and and we can identify Gn and its image χ(Gn).


Proof Q[ζn]/Q is a cyclotomic extension, and thus Galois (see lemma above). Since, the cyclotomic polynomial Φn(X) is irreducible over Q of degree equal to size |(Z/nZ)×|. We get |Gal(Q[ζn]/Q)|=[Q[ζn]:Q]=|(Z/nZ)×| But we have already shown χ maps Gal(Q[ζn]/Q) injectively into (Z/nZ)×. Hence, we get the isomorphism.


Intersection of Cyclotomic fields


Let d|n so that Q[ζn]Q[ζd]. The Galois Correspondence predicts that Q[ζd] corresponds to a subgroup of Gal(Q[ζn]/Q) with cardinality φ(n)/φ(d) (where φ is the Euler totient function and φ(n)=card (Z/nZ)×). Subgroup of Gal(Q[ζn]/Q) must be the kernel of the surjection Gal(Q[ζn]/Q)Gal(Q[ζd]/Q) Since, Gal(Q[ζn]/Q)(Z/nZ)× by Theorem 5, the above surjection can be written as (Z/nZ)×(Z/dZ)×



Proof Denote lcm(n,m)=α,gcd(n,m)=δ,K=Q[ζα] and Γd=Ker ((Z/αZ)×(Z/dZ)×) where d|α There are two sub-fields Ki=Q[ζi],i=n,m of K, defined (via Galois Correspondence) after the preceding, by the subgroups Γi,i=n,m.

Proof Let f:XY be a strictly decreasing bijection between two ordered sets and x,xX. Then f(maxξ)ξx,x=minηf(x),f(x)ηf(minξ)ξx,x=maxηf(x),f(x)η Applying the galois correspondence f:FG (where F,G are ordered by inclusion) gives f(KG1KG2)=f(maxLLKG1,KG2)=minHG1,G2H=G1G2f(KG1KG2)=f(minLLKG1,KG2)=maxHG1,G2H=G1G2 Let xK, then f(k[x])=Autk[x](K)={gG|g(y)=y for all yk[x]}=Gx, the last equality follows from the fact all the elements xK are k linear.


Using the Lemma above we have to simply show ΓnΓm={1} (which will prove that KnKm=Q[α]) and that the group generated by Γn and Γm is Γδ (proving KnKm=Q[ζδ]).
  The first part is clear: Let gmodα(Z/nZ)× is in the intersection of ΓnΓn, , that is to say that n and m divide g1, in other words α|(g1). Since g1 is always prime to g, it has to be the case that g=1.
  For the second statement, using chinese lemma, we can suppose that n,m are powers of p, of the form pν,pμ with (say) 0νμ such that δ=pν. The case where ν or μ is zero is trivial, hence suppose ν,μ>0. We have then Γi=1+piZ/pμZ,i=ν,μ and thus the group generated is Γν=Γδ.

Remark Another proof that is less galois. Denote lcm(n,m)=ϖ and gcd(n,m)=δ. The first point is elementary. Denote ϖ=nν,ϖ=mμ where ν and μ are relatively prime. This then gives ζn=ζνϖandζm=ζνϖ proving Q[ζn,ζm]Q[ζϖ].
  The second equality is more subtle. Denote now n=δν,m=δμ where μ and ν are relatively prime. We have ζδ=ζνn=ζμm giving the inclusion Q[ζδ]Q[ζn]Q[ζm] Inversely, since the cycltomic extensions Q[ζn]Q is galois, we know the degrees of the various extensions thanks to to theorem on galois extension of composites , which are summarized as follows.


Q[ζn,ζm]
Q[ζn]Q[ζm]
Q
Q[ζm]
Q[ζn]
φ(m)/φ(δ)
φ(n)/φ(δ)
φ(n)
φ(n)/φ(δ)
φ(m)/φ(δ)
φ(m)


A substantial part is a translation of INTRODUCTION À LA THÉORIE DE GALOIS by Yves Lazlo.