Cyclotomic polynomials

Arun Ram
Department of Mathematics and Statistics
University of Melbourne
Parkville, VIC 3010 Australia
aram@unimelb.edu.au

Last updates: 20 November 2011

Cyclotomic polynomials

Let n be a positive integer.

The nth roots of unity are e k2πin =cos(k2π/n) + icos(k2π/n) ,for k=0,1,…, n-1. In the complex plane the elements of μn all lie on the circle S1= { z∈ℂ | |z|=1 } .

1 ξ5 ξ4 ξ3 ξ2 ξ

Let n be a positive integer.

Since the nth roots of unity are the primitive dth roots of unity for the positive integers d dividing n, xn-1 = ∏d|n Φd(x) .

Let n be a postitive integer.

  1. Φn(x) ∈ℤ[x] and Φn(x) is irreducible in ℤ[x].
  2. ϕ(n) =deg Φn(x) = Card( (ℤ/nℤ) × ) =(the number of primitive nth roots of unity).

Let ω be a primitive nth root of unity. Then ℚ(ω) is the splitting field of xn-1∈ℚ [x], Gal(ℚ(ω)/ℚ) ≃(ℤ/nℤ) ×, and |ℚ(ω) :ℚ| = | Gal(ℚ(ω)/ℚ) | = ϕ(n) .

Proof. Any element σ∈ Gal(ℚ(ω)/ℚ) is determined by where it sends ω, and it must send ω to another primitive nth root of unity. Note that Φn(x) lies in ℚ[x] since it is fixed under Gal(ℚ(ω)/ℚ) . So Φn(x) ∈ℤ[x]. THIS PROOF IS INCOMPLETE. □

Notes and References

These notes are a retyped version of notes of Arun Ram from Work2004/BookNewalg/PartV.pdf.

References

[BouTop] N. Bourbaki, General Topology, Chapter VI, Springer-Verlag, Berlin 1989. MR?????

page history