Primitive root of unity

An element ζ with ζ^n = 1 whose multiplicative order is exactly n.
Primitive root of unity

Let FF be a and let F\overline{F} be an . An element ζF\zeta\in\overline{F} is an nn-th root of unity if ζn=1\zeta^n=1. It is a primitive nn-th root of unity if its multiplicative order is exactly nn, i.e.

ζn=1andζd1 for every proper divisor dn. \zeta^n=1 \quad\text{and}\quad \zeta^d\ne 1 \text{ for every proper divisor } d\mid n.

Equivalently, ζ\zeta is primitive of order nn if and only if it is a root of the Φn(x)\Phi_n(x).

When char(F)n\mathrm{char}(F)\nmid n, the polynomial xn1x^n-1 has distinct roots in F\overline{F} (a separability phenomenon; compare ), and the nn-th roots of unity form a cyclic subgroup of F×\overline{F}^\times. Adjoining a primitive nn-th root produces the F(ζ)/FF(\zeta)/F.

Examples

  1. Complex numbers. In C\mathbb{C}, ζn=e2πi/n\zeta_n=e^{2\pi i/n} is a primitive nn-th root of unity, and all primitive nn-th roots are ζnk\zeta_n^k with gcd(k,n)=1\gcd(k,n)=1.

  2. Small orders. Primitive 3rd roots of unity are the two nontrivial roots of x2+x+1x^2+x+1, namely e2πi/3e^{2\pi i/3} and e4πi/3e^{4\pi i/3}. Primitive 4th roots of unity are ±i\pm i.

  3. Finite fields. If F=FqF=\mathbb{F}_q is a , then F×F^\times is cyclic of order q1q-1 (see ). Hence FF contains a primitive nn-th root of unity exactly when n(q1)n\mid(q-1).