Primitive root of unity

A root of unity ζ with multiplicative order exactly n (i.e., ζ^n=1 but ζ^d≠1 for d<n).
Primitive root of unity

Definition. Let LL be a field and let n1n\ge 1. An element ζL×\zeta\in L^\times is an n-th root of unity if ζn=1\zeta^n=1. It is primitive if its multiplicative order is exactly nn, i.e.

ζn=1andζd1 for every 1d<n. \zeta^n=1 \quad\text{and}\quad \zeta^d\neq 1 \text{ for every } 1\le d<n.

Equivalently, ζ\zeta generates the cyclic subgroup of all nn-th roots of unity in L×L^\times (compare and ).

Primitive nn-th roots are precisely the roots of the Φn(x)\Phi_n(x).

See also. , .

Examples.

  1. In C\mathbb{C}, ζn=e2πi/n\zeta_n=e^{2\pi i/n} is a primitive nn-th root of unity.
  2. ζ3=1+i32\zeta_3=\frac{-1+i\sqrt3}{2} is a primitive cube root of unity; it satisfies x2+x+1=0x^2+x+1=0.
  3. In a finite field Fq\mathbb{F}_q, an element of order nn exists iff n(q1)n\mid (q-1), since Fq×\mathbb{F}_q^\times is cyclic of order q1q-1.