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.
is irreducible over exactly when , exactly when the embedding into is onto
Statement
Let be a field and with (The characteristic of a ring: the least with when one exists, and otherwise), let (The cyclotomic extension as a splitting field of ), and let be a primitive -th root of unity (The group of -th roots of unity in a field, and primitive -th roots of unity). The following are equivalent.
- The image of in (The cyclotomic polynomials , defined by ) is irreducible (Irreducible and prime elements of an integral domain).
- (The degree of a finite field extension, The unit group and Euler's totient for ).
- The embedding of is Galois and embeds its Galois group into is an isomorphism.
Facts & Assumptions
Given: A field , an integer with , the extension , a primitive -th root of unity , and the minimal polynomial of over .
The image of in has as its roots in exactly the primitive -th roots of unity in (Over a field whose characteristic does not divide , the roots of are exactly the primitive roots of unity).
is monic of degree (The recursion defines a unique monic , of degree , Degree, leading coefficient and monic polynomial, with the zero polynomial having no degree); reduction into preserves both.
For algebraic over there is a unique monic irreducible with if and only if (The evaluation kernel and the unique monic irreducible minimal polynomial of an algebraic element).
If is algebraic over with minimal polynomial of degree , then (A simple algebraic extension is its minimal-polynomial quotient and has power basis and degree ).
For this , is finite Galois and is an injective homomorphism ( is Galois and embeds its Galois group into ); moreover for every primitive -th root ( is separable over exactly when the characteristic does not divide , and then a splitting field carries distinct -th roots of unity).
(The unit group and Euler's totient for ), and for a finite Galois extension (Equivalent characterizations of a finite Galois extension).
In an integral domain, an irreducible element is a nonzero nonunit every one of whose factorisations has a unit factor (Irreducible and prime elements of an integral domain).
Proof
is a root of the image of in by [L1], so divides that image by [L3]; both are monic, and has positive degree because is not a root of a nonzero constant. Write the image of as with monic.
For the equivalence of clauses 2 and 3: by [L5] one has and the embedding is injective into a group of order by [L6], so it is surjective if and only if ; and by [L6]. An injective homomorphism onto its target is an isomorphism.
For the implication from clause 1 to clause 2: if the image of is irreducible, then in the factorisation of step 1.1 one factor is a unit by [L7], and is not, so is a nonzero constant; both and being monic forces and . Hence by [L2] and [L4].
For the implication from clause 2 to clause 1: if then by [L2] and [L4], so in step 1.1 is monic of degree , that is and the image of equals , which is irreducible by [L3].
Steps 2.1 and 2.2 give the equivalence of clauses 1 and 2, and step 1.2 the equivalence of clauses 2 and 3; so all three are equivalent.
Remarks
- This is a criterion, not a theorem about . Over all three clauses hold for every ( is irreducible in for every ), but over they hold only when the class of generates (The reduction of is irreducible over exactly when generates ).
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)$
- Over a field whose characteristic does not divide $n$, the roots of $\Phi_n$ are exactly the primitive roots of unity
- $K(\mu_n)/K$ is Galois and $\sigma\mapsto a_\sigma$ embeds its Galois group into $(\mathbb Z/n)^\times$
- $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
- The cyclotomic extension $K(\mu_n)$ as a splitting field of $t^{n}-1$
- The evaluation kernel and the unique monic irreducible minimal polynomial of an algebraic element
- A simple algebraic extension is its minimal-polynomial quotient and has power basis $1,a,\ldots,a^{n-1}$ and degree $n$
- Irreducible and prime elements of an integral domain
- Equivalent characterizations of a finite Galois extension
- The unit group $(\mathbb{Z}/n)^\times$ and Euler's totient $\varphi(n)=\lvert(\mathbb{Z}/n)^\times\rvert$ for $n\ge1$
- The degree $[K:F]=\dim_F K$ of a finite field extension
- The group $\mu_n(K)$ of $n$-th roots of unity in a field, and primitive $n$-th roots of unity
- The characteristic of a ring: the least $n \ge 1$ with $n \cdot 1_R = 0$ when one exists, and $0$ otherwise
- Degree, leading coefficient and monic polynomial, with the zero polynomial having no degree
Used by
- [ℚ(ζₙ):ℚ]=φ(n) and Gal(ℚ(μₙ)/ℚ)≅(ℤ/n)^× Corollary
Dependency tree · two levels
81 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
- J. S. Milne, Fields and Galois Theory, v5.10, Lemma 5.9 (standard reference, not scraped)
- K. Conrad, Cyclotomic Extensions (expository blurb), Section 2 (standard reference, not scraped)