Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passaudited 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.

Kummer theory classifies finite abelian extensions of exponent dividing n by subgroups between (F×)n and F×

Statement

Let F be a field, let n1, assume charFn, and assume μnF. Then the assignment

BF(B1/n)

is an inclusion-preserving bijection between

  1. subgroups B with (F×)nBF× and finite quotient B/(F×)n, and
  2. finite abelian extensions K/F whose Galois group has exponent dividing n.

For corresponding objects one has

Gal(K/F)Hom(B/(F×)n,μn).

Facts & Assumptions

Given: The field F, the integer n, a subgroup B as above, and a finite abelian extension K/F of exponent dividing n.

[F1]

A Kummer extension is a finite Galois extension of the form F(B1/n) with μnF (Kummer extensions from adjoining n-th roots over a base field containing μn).

[L1]

The Kummer pairing for K=F(B1/n) is perfect, in particular bilinear and nondegenerate in both variables (The Kummer pairing Gal(K/F)×B/(F×)nμn is perfect).

[L2]

Cyclic degree-d extensions over a base containing μd are exactly the extensions generated by a d-th root whose defining polynomial xda is irreducible (If μnF and charFn, then a degree-n extension is cyclic exactly when it is F(α) with αnF and xnαn irreducible).

[L3]

Artin's fixed-field theorem computes degrees from finite automorphism groups (Artin's fixed-field theorem: [K:KG]=G and Aut(K/KG)=G).

[L4]

In a finite Galois extension, normal intermediate fields correspond to quotient Galois groups (Normal subgroups, conjugate fields, and quotient groups in the Galois correspondence).

[L5]

Every finite abelian group is a finite direct product Cn1××Cnr with 1<n1nr (Fundamental theorem of finite abelian groups: invariant-factor form).

Proof

technique · direct
1.1

Let B be a subgroup with finite quotient. Because B/(F×)n is finite, choose elements a1,,arB whose classes generate it. Then F(B1/n)=F(a11/n,,ar1/n). For each j, the field F(aj1/n) contains all roots of xnaj because μnF, so it is a finite Galois extension whose automorphism group embeds in μn by the rule σσ(aj1/n)/aj1/n. Thus each one-generator step is cyclic of degree dividing n. The compositum K:=F(B1/n) is therefore finite Galois and abelian, and every automorphism acts on every chosen n-th root by multiplication with an element of μn. Hence the exponent of Gal(K/F) divides n.

F1choosealgebra
1.2

For this extension, the Kummer pairing of [L1] is perfect, so the natural maps Gal(K/F)Hom(B/(F×)n,μn),B/(F×)nHom(Gal(K/F),μn) are isomorphisms because both groups are finite and the pairing is nondegenerate in both variables. In particular, Gal(K/F)Hom(B/(F×)n,μn).

L1
1.3

Conversely, let K/F be finite abelian of exponent dividing n and define B(K):={bF×:some n-th root of b lies in K}. This contains (F×)n. For bB(K) choose βK with βn=b and define χb(σ):=σ(β)βμn(σGal(K/F)). As in the Kummer-pairing proof, this depends only on the class of b modulo (F×)n, and if χb=1 then every σ fixes β, so βF and b(F×)n. Therefore B(K)/(F×)nHom(Gal(K/F),μn), so the quotient is finite.

algebra
1.4

Let L:=F(B(K)1/n)K and put G=Gal(K/F). If σG is nontrivial, use [L5] to write GCn1××Cnr. Each nj divides n because the exponent of G divides n. Some coordinate of σ is nonzero, say in Cnj. If ζF is a primitive n-th root of unity, then η=ζn/nj has order nj, so projection to this coordinate followed by a generator-preserving map Cnjη gives a character χ:Gμn with χ(σ)1. Put H=kerχ and d=imχ. Then HG, dn, and [L4] makes E:=KH/F cyclic of degree d. Since charFd and μdF, [L2] gives E=F(γ) with γdF. Hence γn=(γd)n/dF, so γL. But χ(σ)1 means σH=Gal(K/E), so σ acts nontrivially on E=F(γ) and therefore does not fix L. Thus Gal(K/L)=1, and [L3] gives [K:L]=1. Therefore K=F(B(K)1/n).

L2L3L4L5algebrachoose
2.1

Starting from a finite abelian extension K/F, step 1.4 shows that the radicals coming from B(K) generate K, so the field-side composite is the identity.

step 1.4
2.2

Starting from a subgroup B and putting K=F(B1/n), one has BB(K) by definition. For the reverse inclusion, let cB(K) and choose βcK with βcn=c. Step 1.2 identifies the perfect pairing with an isomorphism B/(F×)nHom(Gal(K/F),μn), so the character χc(σ)=σ(βc)/βc equals χb for some class bˉB/(F×)n represented by βbn=b with bB. Then for every σGal(K/F) one has σ(βc/βb)βc/βb=χc(σ)χb(σ)=1, so βc/βbF. Hence c/b=(βc/βb)n(F×)nB, and therefore cB. Thus B(K)=B.

step 1.2algebra
3.1

Inclusion preservation is immediate from the definitions, and the displayed Galois-group formula is exactly the isomorphism of step 1.2.

step 1.2step 2.1step 2.2

Remarks

  • This page uses the cohomology-free version. The proof is organized through cyclic Kummer subextensions and the concrete pairing, not through H1.

Depends on

Used by

Dependency tree · two levels

29 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