A-9 Roots of Unity and Cyclotomic Polynomial over Ring

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 p (with p prime), which is structured as follows:

Definition A-9 Roots of Unity and Cyclotomic Polynomial over Ring 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πik∕μ 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 ωd≠1 ωμ ≡1 mod p, and ωd≢1 mod p
Primitive for any 1 ≤d < μ with d∣μ for any 1 ≤d < μ with d∣μ
𝛍-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πi∕μ, compute all ωk such that Find one primitive ω 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 ∈ ℂ vs. 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 (the complex numbers) and over p (the ring).