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.
Over a field whose characteristic does not divide , the roots of are exactly the primitive roots of unity
Statement
Let be a field and with (The characteristic of a ring: the least with when one exists, and otherwise, Divisibility in : when for some integer ), and let be a splitting field of over , that is (The cyclotomic extension as a splitting field of ). Write also for the image of the integer polynomial (The cyclotomic polynomials , defined by ) in . Then is separable over (Repeated roots in extension fields and separable polynomials), it splits over , and its roots in are exactly the primitive -th roots of unity in (The group of -th roots of unity in a field, and primitive -th roots of unity, The unit group and Euler's totient for ).
Facts & Assumptions
Given: A field , an integer with , a splitting field of over , and the convention that for every finite subset the product means the finite product along any enumeration of ; because is a commutative ring, the value is independent of the enumeration (The product of a finite list in a monoid, by recursion, with the empty product () equal to the identity, Generalised associativity: in a monoid the product of a finite list does not depend on the bracketing, and in a commutative monoid it does not depend on the order of the factors either, Polynomial convolution makes a commutative ring containing as its constant subring). In particular, for each positive divisor of , let and .
is separable over when , and then is cyclic of order with exactly primitive -th roots of unity ( is separable over exactly when the characteristic does not divide , and then a splitting field carries distinct -th roots of unity, is cyclic of order dividing , and has a primitive -th root of unity exactly when its order is ).
For every one has in , each monic of degree (The recursion defines a unique monic , of degree ); reduction into preserves this identity.
A monic of degree splits over when with , repetitions allowed, and a splitting field is generated over by the roots (Polynomials that split and splitting fields of a polynomial or a family of polynomials).
is separable over when no extension field of contains an with dividing the image of (Repeated roots in extension fields and separable polynomials).
is an integral domain when is (A polynomial ring over an integral domain is an integral domain); and if and only if divides (Factor theorem over a commutative ring).
Proof
By [L1] the polynomial is separable over and is cyclic of order ; so has distinct roots in , namely the elements of , and by [L3].
Each has order dividing by [L5], and for a positive divisor of the condition says exactly ; so is the disjoint union of the over positive divisors of .
For every positive divisor of the polynomial divides in , since ; hence it splits over with distinct roots, which are the elements of , and with .
Consequently for every positive divisor of .
For every positive divisor of the image of in is , by induction on through the divisors of : at both are , since ; and if the claim holds for every positive divisor of with , then [L2] and step 3.1 give , and cancelling the nonzero left factor in the integral domain ([L6]) gives .
Taking : the image of in is , so splits over and its roots there are exactly the elements of , which are the elements of order in , that is the primitive -th roots of unity in ; there are of them by [L1], in agreement with from [L2].
is separable over . The product identity [L2] shows that the image of divides in . If an extension field contained an for which divided the image of , then the same square would divide the image of in , making a repeated root of . This contradicts the separability of supplied by [L1]. Thus [L4] applies.
Remarks
-
Both hypotheses are used, and neither can be dropped. If the characteristic divides then is not separable and the roots of do not separate into orders at all; and the statement is about the roots in a splitting field, not in itself, since may have no root in at all, as over shows.
-
Irreducibility is a separate question. The theorem says what the roots of are; it says nothing about whether factors over . Over it does not ( is irreducible in for every ), over a finite field it usually does (For the reduction of in is a product of distinct monic irreducibles, each of degree the order of modulo ), and in both cases the root description above is the same.
Depends on
- The cyclotomic polynomials $\Phi_n\in\mathbb Z[t]$, defined by $\prod_{d\mid n}\Phi_d=t^{n}-1$
- The recursion defines a unique monic $\Phi_n\in\mathbb Z[t]$, of degree $\varphi(n)$
- The group $\mu_n(K)$ of $n$-th roots of unity in a field, and primitive $n$-th roots of unity
- $\mu_n(K)$ is cyclic of order dividing $n$, and has a primitive $n$-th root of unity exactly when its order is $n$
- $t^{n}-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
- Repeated roots in extension fields and separable polynomials
- The cyclotomic extension $K(\mu_n)$ as a splitting field of $t^{n}-1$
- The unit group $(\mathbb{Z}/n)^\times$ and Euler's totient $\varphi(n)=\lvert(\mathbb{Z}/n)^\times\rvert$ for $n\ge1$
- If $\operatorname{ord}(g) = n$ then $g^{k} = e$ iff $k$ is an integer multiple of $n$, the powers $g^{0}, \dots, g^{n-1}$ are distinct, and $\langle g \rangle$ has exactly $n$ elements; if $g$ has infinite order then $g^{j} = g^{k}$ only for $j = k$
- 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
- Polynomials that split and splitting fields of a polynomial or a family of polynomials
- A polynomial ring over an integral domain is an integral domain
- Factor theorem over a commutative ring
- Polynomial convolution makes $R[x]$ a commutative ring containing $R$ as its constant subring
- The product $g_0 g_1 \cdots g_{n-1}$ of a finite list in a monoid, by recursion, with the empty product ($n = 0$) equal to the identity
- Generalised associativity: in a monoid the product of a finite list does not depend on the bracketing, and in a commutative monoid it does not depend on the order of the factors either
- The characteristic of a ring: the least $n \ge 1$ with $n \cdot 1_R = 0$ when one exists, and $0$ otherwise
- Divisibility in $\mathbb{Z}$: $d \mid a$ when $a = dq$ for some integer $q$
Used by
- 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
- Φₙ is irreducible over K exactly when [K(ζₙ):K]=φ(n), exactly when the embedding into (ℤ/n)^× is onto Proposition
- 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
- Φₙ is irreducible in ℚ[t] for every n≥1 Theorem
Dependency tree · two levels
92 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
- P. L. Clark, Field Theory (course notes/monograph), Theorem 9.7 (standard reference, not scraped)
- K. Conrad, Cyclotomic Extensions (expository blurb), Section 5 (standard reference, not scraped)