Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicableSession-authored (Fable 5 assisted)judge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26
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 μn(K) of n-th roots of unity in a field, and primitive n-th roots of unity

Definition

Let K be a field and let n1 be an integer. An element xK is an n-th root of unity when xn=1, that is when x is a root of tn1K[t] (Evaluation and roots of a polynomial in a commutative target ring). Write

μn(K):={xK:xn=1}.

This is a subgroup of K× (Subgroup). Every xμn(K) is invertible, with inverse xn1 (Left inverse, right inverse, and invertible element of a monoid), so μn(K)K×; it contains 1; it is closed under multiplication, since (xy)n=xnyn=1; and it is closed under inverses, since (x1)n=(xn)1=1.

An element ζμn(K)K× is a primitive n-th root of unity when its order in the group K× is exactly n (The order G of a finite group and the order ord(g) of an element, with ord(g)= when no positive power of g is the identity):

ord(ζ)=n.

Equivalently, ζn=1 and no exponent k with 1k<n has ζk=1.

An n-th root of unity need not be primitive. In Q the element 1 is a fourth root of unity of order two, not four; and μn(K) may consist of 1 alone, as μ3(Q) does. The two notions are separated deliberately, and the exact circumstances under which a primitive n-th root of unity exists are the content of μn(K) is cyclic of order dividing n, and has a primitive n-th root of unity exactly when its order is n and tn1 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.

Remarks

Depends on

Used by

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