Primitive complex roots of unity
ProvedFamousTheorems.isprimitiveroot_iffcomplex-analysismathlib
Primitive -th roots of unity. For , a complex number is a primitive -th root of unity if and only if
Among the roots of unity, the primitive ones are exactly those whose order is rather than a proper divisor, and the coprimality condition on the exponent is precisely what guarantees this. Consequently there are of them, and they are the roots of the -th cyclotomic polynomial, whose degree is therefore . A primitive root generates the whole cyclic group of -th roots of unity, which makes it the natural choice of basis for the cyclotomic field and the reason . Formalization note. IsPrimitiveRoot ζ n says and no smaller positive power is . The result is Mathlib's Complex.isPrimitiveRoot_iff.
Preamble
import Mathlib
Formal statement
namespace FamousTheorems
universe u_1 u_2 u_3 u_4 u_5 u_6 u_7 u_8 u_9 u_10 u_11 u_12 u_13 u_14 u_15 u_16 u_17 u_18 u_19 u_20 u_21 u_22 u_23 u_24 u_25
open Filter Set Topology DirectSum
theorem isprimitiveroot_iff :
∀ (ζ : ℂ) (n : ℕ),
n ≠ 0 → (IsPrimitiveRoot ζ n ↔ ∃ i < n, ∃ (_ : i.Coprime n), Complex.exp (2 * ↑Real.pi * Complex.I * (↑i / ↑n)) = ζ) := by sorry
end FamousTheoremsSource
Listed in Mathlib's undergraduate/overview curriculum manifests; formalized in Mathlib. Proof here reduces to the corresponding Mathlib result.