The study of roots of unity begins with the simplest case: finding the square roots of 1. While the real number system only yields 1 and -1, extending the domain to complex numbers reveals a much broader set of solutions. A root of unity is defined as any complex number that yields 1 when raised to a positive integer power n. For a specific n, these roots are the complex numbers z such that z^n = 1. For example, while the third roots of unity (n=3) include 1, they also include two complex numbers: (-1 + i√3)/2 and (-1 - i√3)/2. These values can be systematically calculated using polar coordinates, where a complex number with magnitude 1 is represented as z = e^(iθ). By equating z^n to 1, the roots are found to be z_k = e^(i2πk/n) for k = 0, 1, ..., n-1.
Geometrically, these roots are evenly spaced along the unit circle in the complex plane. When these points are connected to their immediate neighbors, they form regular polygons. This symmetry is a direct result of the roots being separated by equal central angles of 2π/n. Furthermore, the set of n-th roots of unity (denoted as μ_n) forms an Abelian cyclic group under multiplication. This means the set is closed under multiplication, contains an identity element (1), and every element has an inverse. Within this group, a 'generator' is a root that can produce all other roots through integer powers. While the first root (w = e^(i2π/n)) is always a generator, other roots w^k are also generators if k and n are co-prime.
Beyond geometry and group theory, the powers of the roots of unity possess significant algebraic properties. The sum of all n-th roots of unity is zero (for n > 1), a fact that can be proven via the geometric series formula or by observing that the roots' positions on the unit circle cause their vector components to cancel out. More importantly, these roots form an orthogonal basis for the complex vector space C^n. When arranged into a matrix where each row represents the powers of a root, the resulting 'Fourier matrix' has rows that are mutually orthogonal. This property is a cornerstone of modern engineering and mathematics, as it provides the underlying mechanism for the Discrete Fourier Transform (DFT), which is essential for signal processing and data analysis.