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 cyclotomic extension as a splitting field of
Definition
Let be a field and . A cyclotomic extension of of order is a splitting field of over (Polynomials that split and splitting fields of a polynomial or a family of polynomials); one exists by Every nonzero polynomial over a field has a splitting field. It is written
The notation is accurate. The roots of in are exactly the elements of (The group of -th roots of unity in a field, and primitive -th roots of unity), and a splitting field is generated over by the roots, so
in the sense of Finitely generated field extensions : is the smallest subfield of itself containing and the -th roots of unity it holds.
When the characteristic does not divide the extension has a single generator: by is separable over exactly when the characteristic does not divide , and then a splitting field carries distinct -th roots of unity the group is then cyclic of order and
for any primitive -th root of unity . Without that hypothesis the notation still names a splitting field, but can be much smaller than and no primitive -th root of unity need exist (In characteristic the only -th root of unity is , and ).
Remarks
- Which splitting field. Any two splitting fields of over are -isomorphic (Any two splitting fields of a polynomial are isomorphic over the base field), and every statement made below about is invariant under a -isomorphism, so the definite article is harmless; where a fixed ambient field matters, as in the compositum and intersection results, the statement says so and works inside one chosen extension of .
Depends on
- The group $\mu_n(K)$ of $n$-th roots of unity in a field, and primitive $n$-th roots of unity
- $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
- Polynomials that split and splitting fields of a polynomial or a family of polynomials
- Every nonzero polynomial over a field has a splitting field
- Any two splitting fields of a polynomial are isomorphic over the base field
- Finitely generated field extensions $F(a_1,\ldots,a_r)$
Used by
- [ℚ(ζₙ):ℚ]=φ(n) and Gal(ℚ(μₙ)/ℚ)≅(ℤ/n)^× Corollary
- For an odd prime p, ℚ(ζₚ) has exactly one intermediate field of degree two over ℚ Corollary
- The Galois group of a cyclotomic extension is abelian Corollary
- F₃(μ₅)capF₃(μ₇) is larger than F₃ although five and seven are coprime Counterexample
- Every intermediate field of ℚ(μₙ)/ℚ is Galois over ℚ with abelian Galois group Proposition
- Φₙ is irreducible over K exactly when [K(ζₙ):K]=φ(n), exactly when the embedding into (ℤ/n)^× is onto Proposition
- Recorded, not proved: every finite abelian extension of ℚ lies in a cyclotomic field Remark
- Every finite abelian group is the Galois group of some finite Galois extension of ℚ Theorem
- For gcd(n,q)=1 the image of Gal(F_q(μₙ)/F_q) in (ℤ/n)^× is generated by [q] 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
- Over a field whose characteristic does not divide n, the roots of Φₙ are exactly the primitive roots of unity Theorem
- ℚ(μₘ)∩ℚ(μₙ)=ℚ(μ_gcd(m,n)) Theorem
Dependency tree · two levels
28 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)