{
  "id": "roots-of-unity",
  "title": "Roots of Unity",
  "lang": "en",
  "source_lang": "en",
  "summary": "Roots of unity are numbers whose positive integer powers equal one, linking complex geometry, cyclic groups, polynomial factorization, number theory, and Fourier analysis.",
  "category": "mathematics",
  "subcategory": "algebra",
  "type": "concept",
  "aliases": [
    "Unity roots"
  ],
  "generated_at": "2026-11-05",
  "model": "pro/gpt-6.1-sol",
  "url": "https://aiwiki.page/en/roots-of-unity/",
  "translations": {
    "zh-Hans": {
      "url": "https://aiwiki.page/zh/roots-of-unity/",
      "json": "https://aiwiki.page/zh/roots-of-unity.json"
    }
  },
  "sections": [
    {
      "heading": "",
      "text": "A root of unity is a number \\(z\\) satisfying \\(z^n=1\\) for some positive integer \\(n\\). For a fixed \\(n\\), the solutions are called the \\(n\\)th roots of unity. Over the complex numbers, there are exactly \\(n\\) 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."
    },
    {
      "heading": "Complex roots and their geometry",
      "text": "By Euler’s formula, the \\(n\\)th roots of unity are\n\n\\[\\zeta_n^k=e^{2\\pi i k/n} =\\cos\\left(\\frac{2\\pi k}{n}\\right) +i\\sin\\left(\\frac{2\\pi k}{n}\\right), \\qquad k=0,1,\\ldots,n-1,\\]\n\nwhere\n\n\\[\\zeta_n=e^{2\\pi i/n}.\\]\n\nEvery root has absolute value \\(1\\), since \\(z^n=1\\) implies \\(|z|^n=1\\). Conversely, writing a nonzero complex number in polar form shows that its \\(n\\)th power is \\(1\\) precisely when its argument is an integer multiple of \\(2\\pi/n\\).\n\nFor \\(n\\geq 3\\), these roots are the vertices of a regular polygon centered at the origin, with one vertex at \\(1\\). Multiplication by \\(\\zeta_n\\) rotates the complex plane through the angle \\(2\\pi/n\\).\n\nExamples include:\n\n- The first roots: \\(1\\).\n- The square roots: \\(1,-1\\).\n- The cube roots:\n\n\\[1,\\quad -\\frac12+\\frac{\\sqrt3}{2}i,\\quad -\\frac12-\\frac{\\sqrt3}{2}i.\\]\n- The fourth roots: \\(1,i,-1,-i\\).\n- The sixth roots: \\(e^{\\pi i k/3}\\), for \\(k=0,\\ldots,5\\).\n\nThe only real roots of unity are \\(1\\) and \\(-1\\). The number \\(1\\) is an \\(n\\)th root for every positive \\(n\\), whereas \\(-1\\) is an \\(n\\)th root exactly when \\(n\\) is even.\n\nAn \\(n\\)th root of unity need not have \\(n\\) as its smallest exponent giving \\(1\\). For example, \\(i\\) is both a fourth root and an eighth root of unity, but its least such positive exponent is \\(4\\)."
    },
    {
      "heading": "Order and primitive roots",
      "text": "The order of a root of unity \\(z\\) is the least positive integer \\(d\\) for which \\(z^d=1\\). A root is a primitive \\(n\\)th root of unity if its order is exactly \\(n\\).\n\nFor the standard root \\(\\zeta_n\\),\n\n\\[\\operatorname{ord}(\\zeta_n^k) =\\frac{n}{\\gcd(n,k)},\\]\n\nwhere \\(\\gcd\\) denotes the greatest common divisor. Consequently,\n\n\\[\\zeta_n^k\\text{ is primitive} \\quad\\Longleftrightarrow\\quad \\gcd(n,k)=1.\\]\n\nThe number of primitive \\(n\\)th roots is therefore \\(\\varphi(n)\\), where Euler’s totient function counts the integers from \\(1\\) through \\(n\\) that are relatively prime to \\(n\\).\n\nFor example, the primitive sixth roots are \\(\\zeta_6\\) and \\(\\zeta_6^5\\), while the primitive eighth roots are\n\n\\[\\zeta_8,\\quad \\zeta_8^3,\\quad \\zeta_8^5,\\quad \\zeta_8^7.\\]\n\nA root of order \\(d\\) is an \\(n\\)th root of unity if and only if \\(d\\mid n\\). Thus the \\(n\\)th roots divide into disjoint classes according to their exact orders, giving\n\n\\[n=\\sum_{d\\mid n}\\varphi(d).\\]"
    },
    {
      "heading": "Group structure",
      "text": "Under multiplication, the \\(n\\)th roots form a cyclic group, usually denoted \\(\\mu_n\\):\n\n\\[\\mu_n=\\{1,\\zeta_n,\\zeta_n^2,\\ldots,\\zeta_n^{n-1}\\}.\\]\n\nIts generators are exactly the primitive \\(n\\)th roots.\n\nThe map\n\n\\[\\mathbb Z/n\\mathbb Z\\longrightarrow\\mu_n, \\qquad [k]\\longmapsto\\zeta_n^k\\]\n\nis a group isomorphism from addition modulo \\(n\\) to multiplication of roots. In particular,\n\n\\[\\zeta_n^a\\zeta_n^b=\\zeta_n^{a+b}, \\qquad (\\zeta_n^a)^{-1}=\\zeta_n^{-a}.\\]\n\nThis correspondence turns questions about roots into questions in modular arithmetic. For example, the equation\n\n\\[z^a=\\zeta_n^b,\\qquad z\\in\\mu_n,\\]\n\nis equivalent to the congruence \\(ak\\equiv b\\pmod n\\). It has solutions precisely when \\(\\gcd(a,n)\\) divides \\(b\\), and then has exactly \\(\\gcd(a,n)\\) solutions in \\(\\mu_n\\).\n\nFor positive integers \\(m,n\\),\n\n\\[\\mu_m\\cap\\mu_n=\\mu_{\\gcd(m,n)}.\\]\n\nThe subgroup generated by \\(\\mu_m\\) and \\(\\mu_n\\) is \\(\\mu_{\\operatorname{lcm}(m,n)}\\).\n\nAll complex roots of unity together form an infinite abelian group,\n\n\\[\\mu_\\infty=\\bigcup_{n\\geq1}\\mu_n,\\]\n\nisomorphic to \\(\\mathbb Q/\\mathbb Z\\) under the map\n\n\\[q+\\mathbb Z\\longmapsto e^{2\\pi i q}.\\]\n\nThey 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."
    },
    {
      "heading": "Polynomial identities and orthogonality",
      "text": "The roots provide the complete factorization\n\n\\[x^n-1=\\prod_{k=0}^{n-1}(x-\\zeta_n^k).\\]\n\nThey are distinct because the derivative \\(nx^{n-1}\\) does not vanish at any root of \\(x^n-1\\) over the complex numbers.\n\nA basic identity is\n\n\\[\\sum_{k=0}^{n-1}\\zeta_n^{km} = \\begin{cases} n,&n\\mid m,\\\\ 0,&n\\nmid m, \\end{cases}\\]\n\nfor every integer \\(m\\). When \\(n\\nmid m\\), this follows from the finite geometric series formula.\n\nIn particular, the sum of all \\(n\\)th roots is \\(0\\) for \\(n>1\\). Their product is\n\n\\[\\prod_{k=0}^{n-1}\\zeta_n^k=(-1)^{n-1}.\\]\n\nThe same identity gives an orthogonality relation:\n\n\\[\\sum_{k=0}^{n-1} \\zeta_n^{jk}\\overline{\\zeta_n^{\\ell k}} = \\begin{cases} n,&j\\equiv\\ell\\pmod n,\\\\ 0,&j\\not\\equiv\\ell\\pmod n. \\end{cases}\\]\n\nThus the vectors\n\n\\[v_j=\\frac1{\\sqrt n} \\left(1,\\zeta_n^j,\\zeta_n^{2j},\\ldots, \\zeta_n^{(n-1)j}\\right), \\qquad 0\\leq j<n,\\]\n\nform an orthonormal basis of \\(\\mathbb C^n\\) with its usual Hermitian inner product."
    },
    {
      "heading": "Cyclotomic polynomials and fields",
      "text": "The \\(n\\)th cyclotomic polynomial is the polynomial whose roots are exactly the primitive \\(n\\)th roots:\n\n\\[\\Phi_n(x)= \\prod_{\\substack{1\\leq k\\leq n\\\\\\gcd(k,n)=1}} (x-\\zeta_n^k).\\]\n\nThese polynomials satisfy\n\n\\[x^n-1=\\prod_{d\\mid n}\\Phi_d(x).\\]\n\nEach \\(\\Phi_n(x)\\) is monic, has integer coefficients, and is irreducible over the rational numbers. Its degree is \\(\\varphi(n)\\).\n\nExamples are\n\n\\[\\begin{aligned} \\Phi_1(x)&=x-1,\\\\ \\Phi_2(x)&=x+1,\\\\ \\Phi_3(x)&=x^2+x+1,\\\\ \\Phi_4(x)&=x^2+1,\\\\ \\Phi_6(x)&=x^2-x+1,\\\\ \\Phi_8(x)&=x^4+1. \\end{aligned}\\]\n\nFor a prime \\(p\\),\n\n\\[\\Phi_p(x)=1+x+\\cdots+x^{p-1}.\\]\n\nAdjoining a primitive \\(n\\)th root to \\(\\mathbb Q\\) gives the cyclotomic field\n\n\\[\\mathbb Q(\\zeta_n).\\]\n\nThis is the splitting field of \\(x^n-1\\), and\n\n\\[[\\mathbb Q(\\zeta_n):\\mathbb Q]=\\varphi(n).\\]\n\nIts symmetries are described by Galois theory:\n\n\\[\\operatorname{Gal}(\\mathbb Q(\\zeta_n)/\\mathbb Q) \\cong(\\mathbb Z/n\\mathbb Z)^\\times.\\]\n\nA residue class \\(a\\) relatively prime to \\(n\\) corresponds to the automorphism\n\n\\[\\zeta_n\\longmapsto\\zeta_n^a.\\]\n\nFor \\(n>2\\), complex conjugation corresponds to \\(a=-1\\), and its fixed field is\n\n\\[\\mathbb Q(\\zeta_n+\\zeta_n^{-1}) =\\mathbb Q\\left(2\\cos\\frac{2\\pi}{n}\\right),\\]\n\nthe maximal real subfield of the cyclotomic field."
    },
    {
      "heading": "Fourier analysis and computation",
      "text": "Roots of unity are the coefficients underlying the discrete Fourier transform (DFT). One common convention defines\n\n\\[X_k=\\sum_{j=0}^{n-1}x_j\\zeta_n^{-jk}, \\qquad k=0,\\ldots,n-1,\\]\n\nwith inverse\n\n\\[x_j=\\frac1n\\sum_{k=0}^{n-1}X_k\\zeta_n^{jk}.\\]\n\nThe orthogonality relation above proves that these operations are inverse to one another.\n\nThe 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.\n\nThe fast Fourier transform exploits identities among roots of different orders, such as\n\n\\[\\zeta_n^2=\\zeta_{n/2}\\]\n\nwhen \\(n\\) is even. These identities permit recursive decompositions that reduce the arithmetic cost of a DFT from a direct quadratic calculation to \\(O(n\\log n)\\) for standard FFT algorithms.\n\nAnother application is the roots-of-unity filter. If\n\n\\[A(x)=\\sum_{m\\geq0}a_mx^m\\]\n\nis a polynomial, then\n\n\\[\\frac1n\\sum_{k=0}^{n-1}\\zeta_n^{-rk}A(\\zeta_n^k) = \\sum_{\\substack{m\\geq0\\\\m\\equiv r\\pmod n}}a_m.\\]\n\nThe averaging operation retains precisely the coefficients whose indices belong to one residue class modulo \\(n\\). It also applies to power series when the necessary convergence conditions hold."
    },
    {
      "heading": "Roots of unity over other fields",
      "text": "The equation \\(x^n=1\\) makes sense over any field, but its number of solutions depends on the field and its characteristic.\n\nOver the real numbers, there is only one solution for odd \\(n\\), and two for even \\(n\\). In an algebraically closed field whose characteristic does not divide \\(n\\), there are exactly \\(n\\) distinct roots.\n\nIf the characteristic is a prime \\(p\\) dividing \\(n\\), repeated roots occur. Writing \\(n=p^a m\\) with \\(p\\nmid m\\), one has\n\n\\[x^n-1=(x^m-1)^{p^a}.\\]\n\nThus an algebraic closure contains only \\(m\\) distinct \\(n\\)th roots. In particular, in characteristic \\(p\\),\n\n\\[x^p-1=(x-1)^p,\\]\n\nso \\(1\\) is the only \\(p\\)th root of unity.\n\nIn a finite field \\(\\mathbb F_q\\), the multiplicative group has order \\(q-1\\) and is cyclic. Consequently, the number of \\(n\\)th roots of unity in \\(\\mathbb F_q\\) is\n\n\\[\\gcd(n,q-1),\\]\n\nand a primitive \\(n\\)th root exists in that field exactly when \\(n\\mid(q-1)\\). Such roots support finite-field analogues of Fourier transforms, allowing exact modular computations rather than approximate complex arithmetic."
    },
    {
      "heading": "Historical development and polygon construction",
      "text": "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.\n\nIn 1796, Carl Friedrich Gauss established the constructibility of the regular \\(17\\)-gon. The general Gauss–Wantzel theorem states that, for \\(n\\geq3\\), a regular \\(n\\)-gon is constructible with straightedge and compass exactly when\n\n\\[n=2^a p_1p_2\\cdots p_r,\\]\n\nwhere \\(a\\geq0\\) and the \\(p_j\\) are distinct Fermat primes—primes of the form \\(2^{2^s}+1\\).\n\nIn 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 \\(n\\). For example, regular pentagons and \\(17\\)-gons are constructible, while regular heptagons and nonagons are not."
    }
  ],
  "links": [
    "integer",
    "complex-number",
    "number-theory",
    "eulers-formula",
    "polygon",
    "greatest-common-divisor",
    "eulers-totient-function",
    "cyclic-group",
    "isomorphism",
    "modular-arithmetic",
    "abelian-group",
    "dense-set",
    "derivative",
    "geometric-series",
    "orthonormal-basis",
    "rational-number",
    "galois-theory",
    "discrete-fourier-transform",
    "eigenvalues-and-eigenvectors",
    "fast-fourier-transform",
    "field-mathematics",
    "finite-field",
    "carl-friedrich-gauss"
  ],
  "sources": [],
  "license": "https://creativecommons.org/licenses/by/4.0/"
}