Fix an integer n≥1. In an algebraic closure
of a field of characteristic 0 (e.g. inside C), an element ζ is a primitive n-th root of unity
if ζn=1 and ζd=1 for every proper divisor d∣n. The n-th cyclotomic polynomial is
Φn(x):=1≤k≤ngcd(k,n)=1∏(x−ζnk),where ζn is any fixed primitive n-th root of unity. This definition is independent of the choice of ζn, and Φn(x)∈Z[x] is monic.
A key structural identity is the factorization
xn−1=d∣n∏Φd(x),which can be taken as an equivalent recursive definition of Φn in Z[x]. Over Q, Φn(x) is irreducible, so it is the minimal polynomial of ζn and
[Q(ζn):Q]=degΦn=φ(n),linking cyclotomic polynomials to the cyclotomic extension
Q(ζn) and the splitting field
of xn−1.
Examples
Φ1(x)=x−1, Φ2(x)=x+1, Φ3(x)=x2+x+1, Φ4(x)=x2+1.
For an odd prime p,
Φp(x)=1+x+x2+⋯+xp−1.Using x6−1=∏d∣6Φd(x) and the known Φ1,Φ2,Φ3, one gets
Φ6(x)=(x−1)(x+1)(x2+x+1)x6−1=x2−x+1.