The cyclotomic polynomial is
By the allowed irreducibility, this is the minimal polynomial of and its degree is . The field contains every th root of unity and is the splitting field of . This polynomial has no repeated roots in characteristic zero, so the extension is Galois.
An automorphism sends to another primitive root , where is a unit modulo . Conversely each such conjugate defines an embedding, and it is an automorphism of because has an inverse modulo . Composition corresponds to multiplication of exponents. Therefore
A finite solvable group is a group admitting a finite chain of normal subgroups with abelian successive quotients; equivalently its derived series eventually becomes trivial. The chain
has quotients , all abelian. Thus is solvable. Every subgroup of a solvable group is solvable, because intersecting the chain with the subgroup gives factors isomorphic to subgroups of the original abelian factors. A Galois group of a polynomial of degree at most embeds in by its action on the roots, so it is solvable even if the polynomial is reducible or has repeated roots.
For the substitution, the characteristic-zero solvability by radicals theorem says that a polynomial has solvable Galois group if and only if its splitting field is contained in a finite tower formed by adjoining successive roots of elements of the preceding field. First place all roots of in such a tower. Adjoin a primitive th root of unity and, for every nonzero , an th root . These are radical adjunctions, and all roots of are . Zero roots require no adjunction. The resulting radical tower therefore contains the splitting field of . The theorem implies
Let , whose minimal polynomial is . For , the cyclic group has a nontrivial cube root of unity . Then and are distinct roots of . By the Kummer-Dedekind theorem,
Since the given ring of integers is a principal ideal domain, write . Its norm is
Multiplication by completes the square:
Thus and supply the required integers.
A primitive eighth root of unity is , and . Indeed and , while the displayed expression gives the reverse containment. Since , adjoining has degree two; adjoining to also has degree two. By the tower law,
Periodic dilation annihilates low Fourier modes Created 2026-10-14 Updated 2026-10-20
If is integrable and -periodic and is a positive integer, then for every integer with . Split the integral into equal intervals and substitute to obtain
The root of unity sum vanishes by the finite geometric series formula. The zero mode is , so a mean-zero dilated function is orthogonal to all trigonometric polynomials of degree at most .
Prime cyclotomic field degree Created 2026-10-03 Updated 2026-11-05
For a prime , the cyclotomic polynomial of a primitive th root of unity is
It is irreducible over , so adjoining one root gives a field of degree .
A nonabelian simple group has no nonidentity conjugacy class of prime-power size. Coprime-degree irreducible characters vanish on such an element: the conjugacy-class sum makes the character-to-degree ratio an algebraic integer, and the Kronecker theorem on algebraic integers in the unit disk makes a nonzero ratio a root of unity, forcing a scalar in a faithful group representation. Column character orthogonality then makes an algebraic integer, impossible. This is the character-theoretic ingredient in Burnside's theorem.
Primitive root of unity Created 2026-09-24 Updated 2026-11-05
For , nonzero roots define projective-point coordinates , satisfying , where . This polynomial is irreducible over . After fixing one root , the remaining coordinates satisfy . Substitute and : the equation becomes . At a nontrivial th root of unity the second term has a simple zero, so the polynomial is Eisenstein over the algebraic closure's rational function field. This proves irreducibility of and hence two-transitivity on projective points.
Quantum integer Created 2026-10-14 Updated 2026-11-05
The symmetric quantum integer is the displayed Laurent polynomial, with . It obeys and . At a primitive odd th root of unity, exactly when divides .
Ramification bound for a primitive pth root of unity Created 2026-10-07 Updated 2026-11-05
If a finite extension of the P-adic numbers contains a primitive th root of unity , the identity gives . The ratios of these factors reduce to the nonzero integers in the residue field. Thus an extension with has only roots of unity of order prime to .
Root of unity Created 2026-09-24 Updated 2026-11-05
An th root of unity is a complex number satisfying . The primitive root generates all th roots.
Roots-of-unity filter Created 2026-10-20 Updated 2026-11-05
Let be a primitive th root of unity. The finite geometric series gives
Consequently, for a polynomial , the expression keeps exactly the terms whose exponents are congruent to modulo . This is orthogonality of characters for a cyclic group in concrete form.
For , the even and odd parts are and . Taking extracts sums of binomial coefficients in chosen residue classes. The same calculation works for formal power series coefficient by coefficient over a coefficient field containing and .
Seventh cyclotomic field Created 2026-09-24 Updated 2026-11-05
For a primitive seventh root of unity ,
where . Its four intermediate fields correspond to the four subgroups of the cyclic group .
Spectral decomposition of a quantum-plane point Created 2026-10-14 Updated 2026-11-05
For finite matrices satisfying , with not a root of unity, sends the generalized eigenspace of at into the one at . Finiteness of the spectrum makes nilpotent on the sum of the nonzero generalized eigenspaces. Exchanging gives the corresponding statement for . Splitting the zero generalized eigenspace of by that of gives the displayed invariant direct sum; both operators are nilpotent on .
Let be a finite multiset of nonzero complex numbers such that taking the th powers permutes it for every positive integer . Taking and iterating the resulting permutation shows that each obeys for some , hence is a root of unity. Let be a common multiple of their orders. The th powers are all one, and the assumed permutation then forces every original element to be one. For a unitary matrix, the spectral theorem for normal operators further forces the matrix itself to be the identity.
Toral automorphism Created 2026-10-14 Updated 2026-11-05
An integer matrix with determinant defines a toral automorphism
on the real torus . Integer entries make the map independent of the chosen representative. The inverse matrix also has integer entries, so the transformation is invertible. It preserves normalized Haar measure.
The map is a mixing measure-preserving transformation exactly when no eigenvalue of is a root of unity. This can be proved with characters of a real torus , since . Orthogonality gives
If no eigenvalue is a root of unity, a nonzero integer frequency cannot repeat: a repetition would give for some . It therefore eventually leaves every finite set of frequencies. The displayed correlations prove mixing first for trigonometric polynomials, then for square-integrable functions by approximation.
Conversely, a root-of-unity eigenvalue makes singular for some . As an integer matrix it has a nonzero rational kernel vector, which can be scaled to a nonzero integer vector . The nonconstant character is then invariant under , obstructing mixing. The cat map is a mixing example, while the identity matrix gives an invertible measure-preserving map that is not mixing.
Unit equation over a number field Created 2026-10-14 Updated 2026-11-05
For a number field and fixed nonzero coefficients , the equation
has finitely many solutions in the unit group of its ring of integers. The coefficients remain fixed; varying them gives a different finiteness problem.
Here is the logarithmic-form mechanism. The Dirichlet unit theorem writes each unit as a root of unity times a product of fixed fundamental units with integer exponents. If the unit rank is zero there are already only finitely many possibilities. Otherwise set to the maximum of and the absolute values of their exponents. The logarithmic embedding and the product formula imply that a unit with a large exponent vector is exponentially small at some archimedean place, after possibly interchanging and .
At that place, makes the other term exponentially close to one. A nonzero logarithm of that term is a linear form in logarithms of algebraic numbers, including a suitable multiple of when complex logarithm branches are adjusted. Its integer coefficients are . The Baker lower bound for a homogeneous linear form in logarithms bounds its nonzero size below by for fixed data, contradicting an exponentially small upper bound when grows. The logarithm cannot vanish, since then the other term would be exactly one and the remaining nonzero term zero. Thus the exponent vectors are bounded, leaving finitely many solutions. A finite torsion subgroup and finitely many archimedean places allow uniform constants.
Unit group of the fifth cyclotomic field Created 2026-09-24 Updated 2026-11-05
For a primitive fifth root of unity ,