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 Galois and embeds its Galois group into
Statement
Let be a field and with (The characteristic of a ring: the least with when one exists, and otherwise), and let (The cyclotomic extension as a splitting field of ). Then is a finite Galois extension, and there is an injective group homomorphism
where is any integer with for a primitive -th root of unity . The class does not depend on which primitive -th root of unity is used, and holds for every .
Facts & Assumptions
Given: A field , an integer with , the extension (The cyclotomic extension as a splitting field of ), and a primitive -th root of unity (The group of -th roots of unity in a field, and primitive -th roots of unity).
For , is separable over when ; in a splitting field the group is then cyclic of order , has primitive -th roots of unity, and for every primitive -th root of unity ( is separable over exactly when the characteristic does not divide , and then a splitting field carries distinct -th roots of unity).
For a finite extension with , the conditions " is Galois", " is the splitting field over of a separable polynomial", "" and "" are equivalent (Equivalent characterizations of a finite Galois extension, Finite Galois extensions and , Relative field automorphisms and ).
is a finite cyclic subgroup of of order dividing , and when its order is its generators are exactly the primitive -th roots of unity ( is cyclic of order dividing , and has a primitive -th root of unity exactly when its order is ).
In a cyclic group of finite order , generates the group if and only if (A cyclic group of order has exactly generators).
For an element of finite order : if and only if (If then iff is an integer multiple of , the powers are distinct, and has exactly elements; if has infinite order then only for ).
For and , the class (The congruence class and the quotient set ) is a unit of if and only if (For , is a unit if and only if ); the units form the group of order (The unit group and Euler's totient for ).
If is algebraic over a field , then the simple extension is finite, with degree equal to the degree of the minimal polynomial of (A simple algebraic extension is its minimal-polynomial quotient and has power basis and degree ).
Proof
By [L1] the polynomial is separable over , the group is cyclic of order generated by , and . The element is algebraic because it is a root of , so [L7] makes finite. Since is the splitting field of the separable polynomial , [L2] now makes finite Galois.
Each maps into itself, since ; being injective on the finite set it restricts to a bijection, and it is multiplicative, so it restricts to a group automorphism of .
Hence generates , so for some integer , and [L4] gives , so by [L6]. The class is well defined: means , which by [L5] and says , that is . Write for this class.
For every one has for some , so .
The map is a group homomorphism: , so by the well-definedness of step 3.1.
It is injective: if then by step 3.1, and since and fixes pointwise, is the identity on .
The class is independent of the chosen primitive -th root of unity: any other one is a generator of by [L3], so for some , and , which exhibits the same exponent class. With steps 4.1, 4.2 and 4.3 this proves the theorem.
Remarks
- The embedding need not be onto. Surjectivity is exactly irreducibility of the -th cyclotomic polynomial over ( is irreducible over exactly when , exactly when the embedding into is onto), and it fails over many base fields: over the image is the cyclic subgroup generated by the class of (For the image of in is generated by ).
Depends on
- The cyclotomic extension $K(\mu_n)$ as a splitting field of $t^{n}-1$
- 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
- A simple algebraic extension is its minimal-polynomial quotient and has power basis $1,a,\ldots,a^{n-1}$ and degree $n$
- A cyclic group of order $n$ has exactly $\varphi(n)$ generators
- 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$
- Finite Galois extensions and $\operatorname{Gal}(K/F)$
- 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$
- For $n\ge1$, $[a]_n$ is a unit if and only if $\gcd(a,n)=1$
- The congruence class $[a]_n$ and the quotient set $\mathbb{Z}/n$
- Relative field automorphisms and $\operatorname{Aut}(K/F)$
- The characteristic of a ring: the least $n \ge 1$ with $n \cdot 1_R = 0$ when one exists, and $0$ otherwise
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
- 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
- For gcd(n,q)=1 the image of Gal(F_q(μₙ)/F_q) in (ℤ/n)^× is generated by [q] Theorem
- ℚ(μₘ)∩ℚ(μₙ)=ℚ(μ_gcd(m,n)) Theorem
Dependency tree · two levels
89 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), Lemma 2.1 and Theorem 2.3 (standard reference, not scraped)
- J. S. Milne, Fields and Galois Theory, v5.10, Proposition 5.8 (standard reference, not scraped)
- P. L. Clark, Field Theory (course notes/monograph), Proposition 9.5 (standard reference, not scraped)