A root of unity is a number satisfying for some positive integer . For a fixed , the solutions are called the th roots of unity. Over the complex numbers, there are exactly distinct such roots, equally spaced around the unit circle. Their multiplication encodes cyclic symmetry, while their algebraic relations connect number theory, polynomial equations, and Fourier analysis.
Complex roots and their geometry
By Euler’s formula, the th roots of unity are
where
Every root has absolute value , since implies . Conversely, writing a nonzero complex number in polar form shows that its th power is precisely when its argument is an integer multiple of .
For , these roots are the vertices of a regular polygon centered at the origin, with one vertex at . Multiplication by rotates the complex plane through the angle .
Examples include:
The first roots: .
The square roots: .
The cube roots:
The fourth roots: .
The sixth roots: , for .
The only real roots of unity are and . The number is an th root for every positive , whereas is an th root exactly when is even.
An th root of unity need not have as its smallest exponent giving . For example, is both a fourth root and an eighth root of unity, but its least such positive exponent is .
Order and primitive roots
The order of a root of unity is the least positive integer for which . A root is a primitive th root of unity if its order is exactly .
For the standard root ,
where denotes the greatest common divisor. Consequently,
The number of primitive th roots is therefore , where Euler’s totient function counts the integers from through that are relatively prime to .
For example, the primitive sixth roots are and , while the primitive eighth roots are
A root of order is an th root of unity if and only if . Thus the th roots divide into disjoint classes according to their exact orders, giving
Group structure
Under multiplication, the th roots form a cyclic group, usually denoted :
Its generators are exactly the primitive th roots.
The map
is a group isomorphism from addition modulo to multiplication of roots. In particular,
This correspondence turns questions about roots into questions in modular arithmetic. For example, the equation
is equivalent to the congruence . It has solutions precisely when divides , and then has exactly solutions in .
For positive integers ,
The subgroup generated by and is .
All complex roots of unity together form an infinite abelian group,
isomorphic to under the map
They are exactly the finite-order elements of the multiplicative group of nonzero complex numbers. As a subset of the unit circle, they form a countable dense set.
Polynomial identities and orthogonality
The roots provide the complete factorization
They are distinct because the derivative does not vanish at any root of over the complex numbers.
A basic identity is
for every integer . When , this follows from the finite geometric series formula.
In particular, the sum of all th roots is for . Their product is
The same identity gives an orthogonality relation:
Thus the vectors
form an orthonormal basis of with its usual Hermitian inner product.
Cyclotomic polynomials and fields
The th cyclotomic polynomial is the polynomial whose roots are exactly the primitive th roots:
These polynomials satisfy
Each is monic, has integer coefficients, and is irreducible over the rational numbers. Its degree is .
Examples are
For a prime ,
Adjoining a primitive th root to gives the cyclotomic field
This is the splitting field of , and
Its symmetries are described by Galois theory:
A residue class relatively prime to corresponds to the automorphism
For , complex conjugation corresponds to , and its fixed field is
the maximal real subfield of the cyclotomic field.
Fourier analysis and computation
Roots of unity are the coefficients underlying the discrete Fourier transform (DFT). One common convention defines
with inverse
The orthogonality relation above proves that these operations are inverse to one another.
The DFT expresses a finite sequence in terms of discrete oscillations. Its basis vectors also diagonalize cyclic shift operators and circulant matrices. Through this connection, roots of unity appear in the study of eigenvalues and eigenvectors, periodic difference equations, and cyclic systems.
The fast Fourier transform exploits identities among roots of different orders, such as
when is even. These identities permit recursive decompositions that reduce the arithmetic cost of a DFT from a direct quadratic calculation to for standard FFT algorithms.
Another application is the roots-of-unity filter. If
is a polynomial, then
The averaging operation retains precisely the coefficients whose indices belong to one residue class modulo . It also applies to power series when the necessary convergence conditions hold.
Roots of unity over other fields
The equation makes sense over any field, but its number of solutions depends on the field and its characteristic.
Over the real numbers, there is only one solution for odd , and two for even . In an algebraically closed field whose characteristic does not divide , there are exactly distinct roots.
If the characteristic is a prime dividing , repeated roots occur. Writing with , one has
Thus an algebraic closure contains only distinct th roots. In particular, in characteristic ,
so is the only th root of unity.
In a finite field , the multiplicative group has order and is cyclic. Consequently, the number of th roots of unity in is
and a primitive th root exists in that field exactly when . Such roots support finite-field analogues of Fourier transforms, allowing exact modular computations rather than approximate complex arithmetic.
Historical development and polygon construction
Roots of unity connect the classical geometry of regular polygons with the algebra of equations. Their complex-exponential description provides a uniform expression for every order, but such an expression does not imply that the corresponding polygon can be constructed with straightedge and compass.
In 1796, Carl Friedrich Gauss established the constructibility of the regular -gon. The general Gauss–Wantzel theorem states that, for , a regular -gon is constructible with straightedge and compass exactly when
where and the are distinct Fermat primes—primes of the form .
In algebraic terms, constructibility requires the vertex coordinates to be obtainable through successive quadratic extensions. Cyclotomic fields provide the link between this requirement and the arithmetic condition on . For example, regular pentagons and -gons are constructible, while regular heptagons and nonagons are not.