How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
The group of -th roots of unity in a field, and primitive -th roots of unity
Definition
Let be a field and let be an integer. An element is an -th root of unity when , that is when is a root of (Evaluation and roots of a polynomial in a commutative target ring). Write
This is a subgroup of (Subgroup). Every is invertible, with inverse (Left inverse, right inverse, and invertible element of a monoid), so ; it contains ; it is closed under multiplication, since ; and it is closed under inverses, since .
An element is a primitive -th root of unity when its order in the group is exactly (The order of a finite group and the order of an element, with when no positive power of is the identity):
Equivalently, and no exponent with has .
An -th root of unity need not be primitive. In the element is a fourth root of unity of order two, not four; and may consist of alone, as does. The two notions are separated deliberately, and the exact circumstances under which a primitive -th root of unity exists are the content of is cyclic of order dividing , and has a primitive -th root of unity exactly when its order is and is separable over exactly when the characteristic does not divide , and then a splitting field carries distinct -th roots of unity.
Remarks
- The concrete complex picture arrives later in the reading order. Over the -th roots of unity are the numbers , and that description is developed in The -th roots of a complex number and the distinct roots of unity for every ↗. Nothing on this page uses it: the definition above is purely algebraic and applies to every field, including those of positive characteristic, where the count of -th roots of unity can be smaller than .
Depends on
- Evaluation and roots of a polynomial in a commutative target ring
- The order $|G|$ of a finite group and the order $\operatorname{ord}(g)$ of an element, with $\operatorname{ord}(g) = \infty$ when no positive power of $g$ is the identity
- Left inverse, right inverse, and invertible element of a monoid
- Subgroup
Used by
- [ℚ(ζₙ):ℚ]=φ(n) and Gal(ℚ(μₙ)/ℚ)≅(ℤ/n)^× Corollary
- For an odd prime p, ℚ(ζₚ) has exactly one intermediate field of degree two over ℚ Corollary
- Unit ranks by signature Corollary
- Kummer extensions from adjoining n-th roots over a base field containing μₙ Definition
- System of fundamental units Definition
- The cyclotomic extension K(μₙ) as a splitting field of tⁿ-1 Definition
- The geometric representation on the simple-root basis over a common splitting field, and the root set Definition
- The Lagrange resolvent attached to a cyclic action and a root of unity Definition
- In characteristic three, t³-1=(t-1)³ and μ₆ coincides with μ₂ Example
- Over ℂ, a cyclic group of order n has exactly n irreducible representations up to equivalence, represented by the characters g↦ λ with λⁿ=1 Example
- S-units of Q Example
- The A₂ discriminant, its Jacobian and the top coinvariant class in ℂ[u,z]/(uz,u³+z³) Example
- The exceptional spectra for E₆ and H₃ computed exactly: characteristic polynomials, cyclotomic factorisations and the resulting degree tables Example
- The invariants and the coinvariant Hilbert series of I₂(m): an explicit computation and the noncrystallographic contrast Example
- Units of ℚ and the imaginary quadratic fields Example
- Conjugates of an average of roots of unity Lemma
- Finitely many roots of unity in a number field Lemma
- If p is a prime not dividing n, a rational minimal polynomial of a primitive n-th root of unity also kills its p-th power Lemma
- Kernel of the unit logarithm is the roots of unity Lemma
- The Coxeter elements of the classical types Aₙ, Bₙ, Dₙ and I₂(m): characteristic polynomials, orders and spectral exponents from their reflection models Lemma
- The normal closure of a radical extension is again radical Lemma
- The rank-two block computation, exact dihedral orders, the signed reflection action, and ambient reducedness Lemma
- The six exceptional Coxeter spectra: characteristic polynomials, orders and spectral exponents from exact matrices Lemma
- In characteristic p the only pᵏ-th root of unity is 1, and t^pᵏ-1=(t-1)^pᵏ Proposition
- μₙ(K) is cyclic of order dividing n, and has a primitive n-th root of unity exactly when its order is n Proposition
- Φₙ is irreducible over K exactly when [K(ζₙ):K]=φ(n), exactly when the embedding into (ℤ/n)^× is onto Proposition
- A regular Coxeter eigenvector determines the basic degrees: the exponent-residue identification and the complete degree tables for all finite Coxeter types Theorem
- Dirichlet unit theorem Theorem
- For every n≥1 there are infinitely many primes p with p≡1 (mod n) Theorem
- For gcd(n,q)=1 the reduction of Φₙ in F_q[t] is a product of distinct monic irreducibles, each of degree the order of [q] modulo n Theorem
- K(μₘ)K(μₙ)=K(μ_lcm(m,n)) Theorem
- K(μₙ)/K is Galois and σ↦ a_σ embeds its Galois group into (ℤ/n)^× Theorem
- Kronecker root-of-unity criterion Theorem
- Over a field whose characteristic does not divide n, the roots of Φₙ are exactly the primitive roots of unity Theorem
- ℚ(μₘ)∩ℚ(μₙ)=ℚ(μ_gcd(m,n)) Theorem
- S-unit theorem Theorem
- Signed discriminant of a cyclotomic field Theorem
- Square of the quadratic Gauss sum Theorem
- The recursion defines a unique monic Φₙ∈ℤ[t], of degree φ(n) Theorem
- tⁿ-1 is separable over K exactly when the characteristic does not divide n, and then a splitting field carries n distinct n-th roots of unity Theorem
…and 1 more result.
Dependency tree · two levels
18 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- K. Conrad, Cyclotomic Extensions (expository blurb), Section 1 (standard reference, not scraped)
- P. L. Clark, Field Theory (course notes/monograph), Section 9.1.1 (standard reference, not scraped)