A-9 Roots of Unity and Cyclotomic Polynomial over Rings

In §A-7 and §A-8, we learned about the definition and properties of the μ-th roots of unity and the μ-th cyclotomic polynomial over complex numbers (i.e., X ) as follows:

In this section, we will explain the μ-th cyclotomic polynomial over X p (ring), which is structured as follows:

Definition A-9 Roots of Unity and Cyclotomic Polynomial over Rings p

Polynomial over 𝐗 Polynomial over 𝐗 𝐩
(Complex Number) (Ring)
Definition All X such that Xμ = 1, (which are All X p such that Xμ 1 mod p
of the computed as X = e2𝜋𝑖𝑘μ for integer k
𝛍-th where 0 k μ 1)
Root of Unity
Definition Those μ-th roots of unity ω such that Those μ-th roots of unity ω such that
of the ωμ = 1, and ωμ 2 1 ωμ 1 mod p, and ωμ 2 1 mod p
Primitive
𝛍-th
Root of
Unity
Definition
The polynomial whose roots are the μ-th primitive roots of unity as follows:
of the
Φμ(x) = ωP(μ)(x ω) (see Definition A-8.1 in §A-8.1)
𝛍-th
Cyclotomic
Polynomial
Finding For ω = e2𝜋𝑖μ, compute all ωk such that Find one satisfactory ω that is a root of
Primitive 0 < k < μ and 𝗀𝖼𝖽(k,μ) = 1 the μ-th cyclotomic polynomial, and
𝛍-th (Theorem A-7.2.4 in §A-7.2) compute all ωk mod p such that
Roots of 0 < k < μ and 𝗀𝖼𝖽(k,μ) = 1
Unity
Table 2: The roots of unity and cyclotomic polynomials over X v.s. over X p

Note that in the μ-th cyclotomic polynomial in both cases of over X and over X p, each of their roots ω (i.e., the primitive μ-th root of unity) has the order μ (i.e., ωμ = 1 over X , and ωμ 1 mod p over X p). Also note that each root ω can generate all roots of the μ-th cyclotomic polynomial by computing ωk such that 𝗀𝖼𝖽(k,μ) = 1.

Table 2 compares the properties of the roots of unity and the μ-th cyclotomic polynomial over X (complex numbers) and over X p (ring).