Roots of Unity Notes: Where Do Complex Roots Come From

Roots of unity are the n solutions to z^n=1, bridging cyclic groups, regular polygons, and cyclotomic polynomials.
The article presents roots of unity in note form, emphasizing they are more than the n solutions to z^n=1. Each root e^{2πik/n} lies on the unit circle, turning multiplication into rotation. "Complex" has a double meaning: the complex field and the cyclic group structure. Geometrically, they form regular n-gon vertices, encoding periodicity and symmetry, linked to the discrete Fourier transform; algebraically, they are roots of irreducible cyclotomic polynomials Φ_n(x), bridging number theory and Galois theory. Overall, the original leans towards intuition and structure with limited computation, suitable as a lightweight starting point.
Roots of Unity: From Equations to Geometry
The roots of unity are the solutions to the equation $z^n = 1$ in the complex field. There are exactly n of them, evenly distributed on the unit circle in the complex plane. The original article explores this concept in note form, emphasizing that "Complex Roots of Unity" is not just an algebraic problem but also a geometric picture.
Each root can be written as $e^{2\pi i k / n}$, where k ranges from 0 to n-1. This definition transforms multiplicative structure into rotation on the circle, making the abstract equation visual.
Why "Complex": A Double Meaning
The word "complex" in "roots of unity" carries a pun in the original text. On one hand, it refers to the complex number field; on the other, it hints that the relationships among these roots are not simple—they form a cyclic group, generating each other through multiplication.
Understanding this helps elevate the roots from an isolated solution set to a structural object. This is also the orientation of the original notes: rather than rushing to calculate, first build structural intuition.
A cyclic group is one of the most fundamental structures in group theory: a group is called cyclic if it is generated by repeated operation of a single element; the roots of unity under multiplication form exactly a cyclic group of order $n$, with primitive roots of unity as generators. The value of this perspective is that it turns "complex roots" from merely $n$ solutions of an equation into a group with differentiated roles: some elements can generate all roots, while others only generate subgroups. This naturally leads to the Euler totient function $\varphi(n)$ as the count of primitive roots, the correspondence between subgroups and divisors, and the algebraic interpretation of "frequency" in the discrete Fourier transform. Understanding the structure of cyclic groups is a key step in elevating roots from a static solution set to computable objects.
Geometric Intuition: Symmetry on the Circle
Plotting the n roots of unity on the unit circle reveals the vertices of a regular n-gon. This symmetry is the most direct application entry point for complex roots: rotations, periodic signals, and discrete Fourier transforms are all related.
The note style of the original suggests that the value of complex roots lies in encoding "periodicity" and "symmetry" into a simple algebraic equation.
Algebraic Perspective: Cyclotomic Polynomials
The roots of unity are the roots of cyclotomic polynomials $\Phi_n(x)$, which are irreducible over the rational field. The original mentions this fact as a bridge between complex roots and number theory.
From the narrative of the notes, cyclotomic polynomials turn complex roots from analytical objects into algebraic ones, suitable for further discussion of topics like Galois theory.
The cyclotomic polynomial $\Phi_n(x)$ is a monic polynomial defined over the rational field, with degree exactly equal to the Euler totient function $\varphi(n)$, i.e., the number of positive integers less than $n$ and coprime to $n$. When $n$ is a prime $p$, $\Phi_p(x) = 1 + x + \cdots + x^{p-1}$; for general $n$, it is uniquely determined by having all primitive $n$-th roots of unity $e^{2\pi i k/n}$ (where $\gcd(k,n)=1$) as roots. A key fact is that $\Phi_n(x)$ is irreducible over the rational field, which explains why primitive roots cannot be distinguished by polynomial equations with rational coefficients—they form an inseparable algebraic whole. Because of this, cyclotomic polynomials become a natural entry point for studying cyclic extensions over the rational field; their splitting field is precisely the cyclotomic field $\mathbb{Q}(\zeta_n)$, whose Galois group is isomorphic to $(\mathbb{Z}/n\mathbb{Z})^\times$. This is also the core bridge connecting complex roots to Galois theory and even class field theory.
Summary: Notes Leaning Towards Intuition
The original is a brief mathematical note that does not expand on extensive calculations but emphasizes the structure and geometric meaning of concepts. For readers looking to revisit roots of unity, this approach provides a lightweight entry point, though with limited depth, suitable as a starting point for further study.
One-line Summary
The roots of unity are the n solutions to z^n=1, forming a bridge between cyclic groups, regular polygons, and cyclotomic polynomials.
Paragraph Summary
The article presents the concept of roots of unity in short note form, emphasizing that it is more than just the n solutions to the equation z^n=1. Each root can be written as e^{2πik/n}, evenly distributed on the unit circle, transforming multiplicative structure into rotation on the circle. The article points out that the word "complex" has a double meaning: it refers to the complex field and also hints that these roots form a cyclic group, generating each other through multiplication. Geometrically, they correspond to the vertices of a regular n-gon, encoding periodicity and symmetry, closely related to the discrete Fourier transform; algebraically, they are the roots of the cyclotomic polynomial Φ_n(x), irreducible over the rational field, forming a bridge to number theory and Galois theory. Overall, the original leans towards intuition and structure with limited computational expansion, suitable as a lightweight entry point for further learning.
Related articles

Random Pruning of the DPO Computation Graph: 1.4x Training Speedup and Lower Peak Memory
DPO training too slow and memory-hungry? This paper proposes a random pruning framework for the DPO computation graph, sampling independently across position, sequence, and branch dimensions; branch pruning achieves a 1.426x step-time speedup and cuts training time by about 30%, with in-depth attribution of memory and time gains.

Why Does JEPA Underperform MLM in Longitudinal EHR Representation Learning?
New study compares JEPA and MLM for longitudinal EHR representation learning on MIMIC-IV: three JEPA variants train stably without collapse but underperform MLM; target size, not heterogeneity, drives prediction error.

Transfer Learning + Visible Light Communication: A New Approach to Energy-Efficient Indoor Positioning
A study proposes a transfer learning-based visible light communication indoor positioning method, achieving 47% accuracy improvement on the BOSCH factory dataset, 67.5% model efficiency under high noise, and introducing the ME composite metric for energy-efficient positioning in energy-constrained industrial IoT scenarios.