Root of unity
In mathematics, a root of unity, occasionally called a de Moivre number, is any complex number that yields 1 when raised to some positive integer power n. Roots of unity are used in many branches of mathematics, and are especially important in number theory, the theory of group characters, and the discrete Fourier transform.
Roots of unity can be defined in any field. If the characteristic of the field is zero, the roots are complex numbers that are also algebraic integers. For fields with a positive characteristic, the roots belong to a finite field, and, conversely, every nonzero element of a finite field is a root of unity. Any algebraically closed field contains exactly n nth roots of unity, except when n is a multiple of the (positive) characteristic of the field.
Group properties[edit]
Group of all roots of unity[edit]
The product and the multiplicative inverse of two roots of unity are also roots of unity. In fact, if xm = 1 and yn = 1, then (x−1)m = 1, and (xy)k = 1, where k is the least common multiple of m and n.
Therefore, the roots of unity form an abelian group under multiplication. This group is the torsion subgroup of the circle group.
Group of nth roots of unity[edit]
For an integer n, the product and the multiplicative inverse of two nth roots of unity are also nth roots of unity. Therefore, the nth roots of unity form an abelian group under multiplication.
Given a primitive nth root of unity ω, the other nth roots are powers of ω. This means that the group of the nth roots of unity is a cyclic group. It is worth remarking that the term of cyclic group originated from the fact that this group is a subgroup of the circle group.
Galois group of the primitive nth roots of unity[edit]
Let be the field extension of the rational numbers generated over by a primitive nth root of unity ω. As every nth root of unity is a power of ω, the field contains all nth roots of unity, and is a Galois extension of
If k is an integer, ωk is a primitive nth root of unity if and only if k and n are coprime. In this case, the map
Cyclic groups[edit]
The nth roots of unity form under multiplication a cyclic group of order n, and in fact these groups comprise all of the finite subgroups of the multiplicative group of the complex number field. A generator for this cyclic group is a primitive nth root of unity.
The nth roots of unity form an irreducible representation of any cyclic group of order n. The orthogonality relationship also follows from group-theoretic principles as described in Character group.
The roots of unity appear as entries of the eigenvectors of any circulant matrix; that is, matrices that are invariant under cyclic shifts, a fact that also follows from group representation theory as a variant of Bloch's theorem.[15] In particular, if a circulant Hermitian matrix is considered (for example, a discretized one-dimensional Laplacian with periodic boundaries[16]), the orthogonality property immediately follows from the usual orthogonality of eigenvectors of Hermitian matrices.
For n = 1, 2, both roots of unity 1 and −1 are integers.
For three values of n, the roots of unity are quadratic integers:
For four other values of n, the primitive roots of unity are not quadratic integers, but the sum of any root of unity with its complex conjugate (also an nth root of unity) is a quadratic integer.
For n = 5, 10, none of the non-real roots of unity (which satisfy a quartic equation) is a quadratic integer, but the sum z + z = 2 Re z of each root with its complex conjugate (also a 5th root of unity) is an element of the ring Z[1 + √5/2] (D = 5). For two pairs of non-real 5th roots of unity these sums are inverse golden ratio and minus golden ratio.
For n = 8, for any root of unity z + z equals to either 0, ±2, or ±√2 (D = 2).
For n = 12, for any root of unity, z + z equals to either 0, ±1, ±2 or ±√3 (D = 3).