Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26
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 Q

Statement

For every finite abelian group G there is a finite Galois extension L/Q (Finite Galois extensions and Gal⁡(K/F)) with

Gal⁡(L/Q)≅G,

and L may be taken inside a cyclotomic field Q(μN) (The cyclotomic extension K(μn) as a splitting field of tn−1).

Facts & Assumptions

[L1]

There are positive integers n,k and a surjective group homomorphism (Z/n)k→G (Every finite abelian group is a quotient of (Z/n)k for some n and k, The external direct product G×H with componentwise multiplication).

[L5]

A cyclic group of finite order m is isomorphic to (Z/m,+) (Every cyclic group is isomorphic to (Z,+) or to (Z/n,+) for its finite order n≥1).

[L7]

For K/Q finite Galois with group G′ and H≤G′, the field KH is an intermediate field (The fundamental theorem of finite Galois theory); it is Galois over Q exactly when H is normal (Normal subgroup: invariance under conjugation), and then Gal⁡(KH/Q)≅G′/H (Normal subgroups, conjugate fields, and quotient groups in the Galois correspondence, The quotient group G/N and coset product (gN)(hN)=ghN).

[L8]

For a homomorphism f:A→B the rule aker⁡f↦f(a) is an isomorphism A/ker⁡f→im⁡f (First isomorphism theorem for groups: G/ker⁡f≅im⁡f).

Proof

technique · direct
1.1L1

Fix n,k≥1 and a surjection π ⁣:(Z/n)k→G by [L1].

2.1step 1.1L2

Choose pairwise distinct primes p1,…,pk with pi≡1(modn): the set of such primes is not finite by [L2], so at each of the k steps one may pick a prime outside the finitely many already chosen. Put N:=p1⋯pk.

3.1step 2.1givenalgebra

Distinct primes are coprime: a positive common divisor of pi and pj is 1 or pi, and is 1 or pj, so if it is not 1 then pi=pj. Hence p1,…,pk is a pairwise-coprime list.

3.2step 2.1L4L5

For each i there is a surjective homomorphism (Z/pi)×→Z/n: by [L4] the group (Z/pi)× is cyclic of order mi=pi−1, which n divides by step 2.1; [L5] identifies it with (Z/mi,+), and [a]mi↦[a]n is well defined because n∣mi, is a homomorphism, and is onto.

4.1step 3.1L3

By [L3] the map [x]N↦([x]pi)i is a bijection Z/N→∏iZ/pi preserving multiplication and [1], so it carries units to units bijectively and restricts to a group isomorphism (Z/N)×→∏i(Z/pi)×.

5.1step 1.1step 4.1step 3.2L6

Taking the product of the maps of step 3.2 and composing with step 4.1 and with π gives a surjective group homomorphism Ψ0 ⁣:(Z/N)×→G; composing with the isomorphism of [L6] gives a surjective homomorphism Ψ ⁣:Gal⁡(Q(μN)/Q)→G.

6.1step 5.1L6L7

Put G′:=Gal⁡(Q(μN)/Q) and H:=ker⁡Ψ. The group G′ is abelian by [L6], so every subgroup is normal, gHg−1=H holding for all g; hence L:=Q(μN)H is an intermediate field, L/Q is finite Galois, and Gal⁡(L/Q)≅G′/H by [L7].

7.1step 5.1step 6.1L8∎

By [L8] applied to Ψ, which is surjective, G′/H≅im⁡Ψ=G; hence Gal⁡(L/Q)≅G, with L inside Q(μN).

Remarks

  • What is produced is a subfield, not a cyclotomic field. The construction realises G as the Galois group of an intermediate field of Q(μN)/Q, and it must: the Galois group of Q(μN) itself is (Z/N)×, whose order φ(N) is even for N≥3, so most finite abelian groups are not of that form. The companion page spells out that failure in FALSE: every finite abelian group is Gal⁡(Q(μn)/Q) for some n ↗.

  • 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 N have exactly the intended unit group. Repeating a prime would collapse two factors into one.

Depends on

Used by

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