Engineering · Mathematics · Advanced Algebra Handbook

Complex Numbers, Roots of Unity and Cyclotomic Polynomials

This topic establishes the proof language and structural vocabulary that later algebra depends on. Treat definitions as precise contracts: each hypothesis controls what operations or conclusions are permitted. This page consolidates the relevant material from the supplied algebra source into a stand-alone handbook chapter.

Learning pathFoundations of Abstract Algebra

LevelAdvanced

FormatHandbook guide

Read time9 min

Executive summary

This chapter develops complex numbers, roots of unity and cyclotomic polynomials as part of a connected advanced-algebra learning sequence. The emphasis is on definitions, hypotheses, structural results and repeatable methods rather than historical narrative.

The source material is theorem-rich. Accordingly, the handbook presentation separates vocabulary from results and then adds a verification workflow so that each statement can be applied safely. Mathematical examples in the source are treated as examples, not as universal rules.

Visual model: roots distributed on the unit circle

For an eighth-root example, successive powers of a primitive root advance by equal angular steps. The geometry makes periodicity visible: after eight multiplications the point returns to 1, while lower powers visit the equally spaced positions in between.

1 ζ ζ² ζ³ ζ⁴ ζ⁵ ζ⁶ ζ⁷

Problem-solving workflow

State the underlying set, number system or relation precisely.

Write the defining conditions before manipulating symbols.

Reduce the problem to a canonical form such as a remainder, factorisation, equivalence class or function equation.

Apply only results whose hypotheses have been checked explicitly.

Separate existence from uniqueness; prove both when a construction claims a unique answer.

Verify the result against the original definition, including boundary and degenerate cases.

Core definitions

Definition

If n ≥1 is an integer, then an nth root of unity is a complex number ζ with ζ n = 1. The geometric interpretation of complex multiplication is particularly interesting when z and w lie on the unit circle, so that |z| = 1 = |w|. Given a positive integer n, let θ = 2π/n and let ζ = eiθ. The polar coordinates of ζ are (1, θ), the polar coordinates of ζ 2 are (1, 2θ), the polar coordinates of ζ 3 are (1, 3θ),. . . , the polar coordinates of ζ n−1 are (1, (n −1)θ), and the polar coordinates of ζ n = 1 are (1, nθ) = (1, 0). Thus, the nth roots of unity are equally spaced around the unit circle. Figure 1.5 shows the 8th roots of unity (here, θ = 2π/8 = π/4). i − i −1 √1 2 √1 2(−1 + i) (1 + i) (−1 − i) (1 − i) √1 2 √1 2 Figure 1.5: 8th Roots of Unity

Definition

If d is a positive integer, then the dth cyclotomic3 polynomial is defined by →d(x) = → (x −ζ), where ζ ranges over all the primitive dth roots of unity. The following result is almost obvious. 3The roots of xn −1 are the nth roots of unity: 1, ζ, ζ 2, . . . , ζ n−1, where ζ = e2πi/n = cos(2π/n) + i sin(2π/n). This explains the term cyclotomic, for its Greek origin means “circle splitting.” Roots of Unity

Definition

Define the totient function as the degree of the nth cyclotomic polynomial: φ(n) = deg(→n(x)). We now give another description of the totient function that does not depend on roots of unity.

Principal results and structural facts

Key result

Every complex number z has a factorization z = r(cos θ + i sin θ), where r = |z| ≥0 and 0 ≤θ < 2π.

Key result

If z = cos θ + i sin θ and w = cos ψ + i sin ψ, then zw = cos(θ + ψ) + i sin(θ + ψ).

Key result

If z and w are complex numbers with polar coordinates (r, θ) and (s, ψ), respectively, then the polar coordinates of zw are2 (rs, θ + ψ), and so |zw| = |z| |w|.

Key result

For every real number x and every positive integer n, cos(nx) + i sin(nx) = (cos x + i sin x)n.

Key result

(i) cos(2x) = cos2 x −sin2 x = 2 cos2 x −1 sin(2x) = 2 sin x cos x. (ii) cos(3x) = cos3 x −3 cos x sin2 x = 4 cos3 x −3 cos x sin(3x) = 3 cos2 x sin x −sin3 x = 3 sin x −4 sin3 x.

Key result

can be generalized. If f2(x) = 2x2 −1, then cos(2x) = 2 cos2 x −1 = f2(cos x), and if f3(x) = 4x3 −3x, then cos(3x) = 4 cos3 x −3 cos x = f3(cos x).

Key result

For all n ≥1, there is a polynomial fn(x) having all coefficients integers such that cos(nx) = fn(cos x).

Key result

Every nth root of unity is equal to e2πik/n = cos ( 2πk n ) + i sin ( 2πk n ) , for some k = 0, 1, 2, . . . , n −1, and hence it has modulus 1.

Key result

If an nth root of unity ζ is a primitive dth root of unity, then d must be a divisor of n.

Key result

For every integer n ≥1, xn −1 = → d|n →d(x), where d ranges over all the divisors d of n [in particular, →1(x) and →n(x) occur].

Key result

If n ≥1 is an integer, then φ(n) is the number of integers k with 1 ≤k ≤n and (k, n) = 1.

Key result

For every positive integer n, the cyclotomic polynomial →n(x) is a monic polynomial all of whose coefficients are integers.

Key result

If q is a positive integer, and if d is a divisor of an integer n with d < n, then →n(q) is a divisor of both qn −1 and (qn −1)/(qd −1).

Key result

If ε1, . . . , εn are roots of unity, where n ≥2, then n j=1 ε j ≤ n j=1 ε j = n. Moreover, there is equality if and only if all the ε j are equal.

How to reason with these results

Most advanced-algebra problems become manageable when the representation is separated from the invariant structure. Begin with the definition, then decide whether the problem is asking for an elementwise calculation, a statement about a morphism, or a classification up to isomorphism. That choice determines the correct proof language.

When a theorem gives a structural conclusion, do not jump directly to the conclusion. Write the hypotheses next to the object you are studying and check them one by one. If a hypothesis fails, either strengthen the object, pass to a quotient or localisation where the theorem applies, or use a more elementary argument.

For computational work, record each transformation together with the equivalence relation it preserves. In algebra, row operations, similarity, quotienting, localisation and isomorphism preserve different kinds of information. A calculation is useful only when the preserved structure matches the question.

Common failure modes

Failure mode	Control
Using an operation before checking that it is well-defined.	Return to the definition or theorem hypotheses and verify the missing condition before continuing.
Treating an example as a proof of a universal claim.	Return to the definition or theorem hypotheses and verify the missing condition before continuing.
Ignoring zero, empty-set or boundary cases.	Return to the definition or theorem hypotheses and verify the missing condition before continuing.
Confusing equality of representations with equality of the underlying mathematical object.	Return to the definition or theorem hypotheses and verify the missing condition before continuing.
Using induction without a valid base case or without proving the inductive implication.	Return to the definition or theorem hypotheses and verify the missing condition before continuing.

Verification checklist

The ambient set, ring, field, group, module or category has been stated.
Every operation and map used is well-defined in that setting.
The hypotheses of each structural result have been checked before use.
Representatives, coordinates or generators have not been confused with the underlying object.
Existence and uniqueness have been separated where both matter.
The final result has been checked against the original defining relation or universal property.

Quick questions

What should I identify first in a problem about complex numbers, roots of unity and cyclotomic polynomials?

Start with the ambient algebraic structure, its operation or maps, and the exact hypotheses. Most incorrect solutions begin by using a familiar rule that is not valid in the stated structure.

How should definitions be used in proofs?

Expand the definition at the point where it becomes useful. Definitions are not background prose; they are the conditions that determine what must be proved and which implications are available.

When is a structural theorem safer than direct calculation?

Use a structural theorem when its hypotheses are satisfied and the calculation would otherwise depend on arbitrary coordinates, representatives or generators. The theorem usually identifies an invariant that survives those choices.

How can a final answer be checked?

Substitute the result back into the defining relation, verify any required closure or map property, and check edge cases such as zero, the identity, the empty object or degenerate quotients where relevant.

Complex Numbers, Roots of Unity and Cyclotomic Polynomials

Executive summary

Visual model: roots distributed on the unit circle

Problem-solving workflow

Core definitions

Principal results and structural facts

How to reason with these results

Common failure modes

Verification checklist

Quick questions

What should I identify first in a problem about complex numbers, roots of unity and cyclotomic polynomials?

How should definitions be used in proofs?

When is a structural theorem safer than direct calculation?

How can a final answer be checked?

Connections within the handbook

Continue learning