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.
Every finite abelian group is the Galois group of some finite Galois extension of
Statement
For every finite abelian group there is a finite Galois extension (Finite Galois extensions and ) with
and may be taken inside a cyclotomic field (The cyclotomic extension as a splitting field of ).
Facts & Assumptions
Given: A finite abelian group ; is an ordered field (The rationals form a totally ordered field), so (The characteristic of a ring: the least with when one exists, and otherwise) and divides no positive integer (Divisibility in : when for some integer ).
There are positive integers and a surjective group homomorphism (Every finite abelian group is a quotient of for some and , The external direct product with componentwise multiplication).
For a finite pairwise-coprime list of positive integers with , the map is a bijection preserving addition, multiplication, and (Chinese remainder theorem for a finite pairwise-coprime list: simultaneous residues determine one class modulo the product, and the resulting bijection preserves addition and multiplication, The congruence class and the quotient set , For every natural , is an abelian group, multiplication is a commutative monoid operation, and both distributive laws hold, Coprime integers: , Common divisor, and the greatest common divisor , with the convention ).
is a finite subgroup of the unit group of the field , hence cyclic (Every finite subgroup of the unit group of an integral domain is cyclic, For every prime , the two operations on make it a field, Field), of order (, and for every prime , The unit group and Euler's totient for ).
A cyclic group of finite order is isomorphic to (Every cyclic group is isomorphic to or to for its finite order ).
( and ), and this group is abelian (The Galois group of a cyclotomic extension is abelian).
For finite Galois with group and , the field is an intermediate field (The fundamental theorem of finite Galois theory); it is Galois over exactly when is normal (Normal subgroup: invariance under conjugation), and then (Normal subgroups, conjugate fields, and quotient groups in the Galois correspondence, The quotient group and coset product ).
For a homomorphism the rule is an isomorphism (First isomorphism theorem for groups: ).
Proof
Fix and a surjection by [L1].
Choose pairwise distinct primes with : the set of such primes is not finite by [L2], so at each of the steps one may pick a prime outside the finitely many already chosen. Put .
Distinct primes are coprime: a positive common divisor of and is or , and is or , so if it is not then . Hence is a pairwise-coprime list.
For each there is a surjective homomorphism : by [L4] the group is cyclic of order , which divides by step 2.1; [L5] identifies it with , and is well defined because , is a homomorphism, and is onto.
By [L3] the map is a bijection preserving multiplication and , so it carries units to units bijectively and restricts to a group isomorphism .
Taking the product of the maps of step 3.2 and composing with step 4.1 and with gives a surjective group homomorphism ; composing with the isomorphism of [L6] gives a surjective homomorphism .
Put and . The group is abelian by [L6], so every subgroup is normal, holding for all ; hence is an intermediate field, is finite Galois, and by [L7].
By [L8] applied to , which is surjective, ; hence , with inside .
Remarks
-
What is produced is a subfield, not a cyclotomic field. The construction realises as the Galois group of an intermediate field of , and it must: the Galois group of itself is , whose order is even for , so most finite abelian groups are not of that form. The companion page spells out that failure in FALSE: every finite abelian group is for some ↗.
-
The distinctness of the primes is needed twice. It makes the list pairwise coprime so that the Chinese remainder theorem applies, and it makes the product have exactly the intended unit group. Repeating a prime would collapse two factors into one.
Depends on
- For every $n\ge1$ there are infinitely many primes $p$ with $p\equiv1\pmod n$
- Every finite abelian group is a quotient of $(\mathbb Z/n)^{k}$ for some $n$ and $k$
- $[\mathbb Q(\zeta_n):\mathbb Q]=\varphi(n)$ and $\operatorname{Gal}(\mathbb Q(\mu_n)/\mathbb Q)\cong(\mathbb Z/n)^\times$
- The Galois group of a cyclotomic extension is abelian
- Chinese remainder theorem for a finite pairwise-coprime list: simultaneous residues determine one class modulo the product, and the resulting bijection preserves addition and multiplication
- Normal subgroups, conjugate fields, and quotient groups in the Galois correspondence
- The fundamental theorem of finite Galois theory
- Every finite subgroup of the unit group of an integral domain is cyclic
- For every prime $p$, the two operations on $\mathbb{Z}/p$ make it a field
- $\varphi(1)=1$, and $\varphi(p)=p-1$ for every prime $p$
- Every cyclic group is isomorphic to $(\mathbb Z,+)$ or to $(\mathbb Z/n,+)$ for its finite order $n\ge1$
- First isomorphism theorem for groups: $G/\ker f\cong\operatorname{im}f$
- The quotient group $G/N$ and coset product $(gN)(hN)=ghN$
- Normal subgroup: invariance under conjugation
- The unit group $(\mathbb{Z}/n)^\times$ and Euler's totient $\varphi(n)=\lvert(\mathbb{Z}/n)^\times\rvert$ for $n\ge1$
- The cyclotomic extension $K(\mu_n)$ as a splitting field of $t^{n}-1$
- The external direct product $G\times H$ with componentwise multiplication
- The congruence class $[a]_n$ and the quotient set $\mathbb{Z}/n$
- Congruence modulo an integer: $a\equiv b\pmod n$ when $n\mid(a-b)$, including the moduli $0$ and $1$
- For every natural $n$, $(\mathbb{Z}/n,+)$ is an abelian group, multiplication is a commutative monoid operation, and both distributive laws hold
- Finite Galois extensions and $\operatorname{Gal}(K/F)$
- Common divisor, and the greatest common divisor $\gcd(a,b)$, with the convention $\gcd(0,0) := 0$
- Coprime integers: $\gcd(a,b) = 1$
- Finite, countably infinite, countable, uncountable
- Field
- Prime and composite integers: $p$ is prime when $p > 1$ and its only positive divisors are $1$ and $p$
- Divisibility in $\mathbb{Z}$: $d \mid a$ when $a = dq$ for some integer $q$
- The rationals form a totally ordered field
- The characteristic of a ring: the least $n \ge 1$ with $n \cdot 1_R = 0$ when one exists, and $0$ otherwise
Used by
- FALSE: every finite abelian group is Gal(ℚ(μₙ)/ℚ) for some n False statement
Dependency tree · two levels
130 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), Corollary 9.12 (standard reference, not scraped)
- K. Conrad, Cyclotomic Extensions (expository blurb), Section 5 (standard reference, not scraped)