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

A finite extension of a finite field of order q is Galois with cyclic Galois group generated by xxq

Statement

Let Fq be a finite field of order q and let E be a finite field having Fq as a subfield, with [E:Fq]=n (The degree [K:F]=dimFK of a finite field extension). Then E/Fq is a finite Galois extension (Finite Galois extensions and Gal(K/F)) and

Gal(E/Fq)=σq

is cyclic of order n, generated by the relative Frobenius σq ⁣:xxq (The relative Frobenius xxq of an extension of finite fields).

Facts & Assumptions

Given: Finite fields FqE with Fq=q and [E:Fq]=n, and the subgroup G:=σq of Aut(E/Fq).

[L1]

The relative Frobenius σq(x)=xq is an Fq-automorphism of E (The relative Frobenius xxq of an extension of finite fields).

[L2]

{xE:xq=x}=Fq, that is Eσq=Fq (The elements of a finite extension fixed by the q-power map are exactly the base field).

[L3]

E=qn and σq has order exactly n in Aut(E/Fq) (For a degree-n extension of a field of order q, the q-power map has order exactly n).

[L4]

If G is a finite group of automorphisms of K, then [K:KG]=G and Aut(K/KG)=G (Artin's fixed-field theorem: [K:KG]=G and Aut(K/KG)=G).

[L5]

For a finite extension K/F with G=Aut(K/F), the conditions "K/F is Galois", "K is the splitting field over F of a separable polynomial", "G=[K:F]" and "KG=F" are equivalent (Equivalent characterizations of a finite Galois extension).

[L6]

KG={xK:σ(x)=x for every σG} (The fixed field KG of a group of field automorphisms).

Proof

technique · direct
1.1

G=σq is a cyclic group of automorphisms of E, finite of order n by [L1] and [L3].

L1L3
1.2

Its fixed field is EG=Fq by [L2] and [L6].

L2L6
2.1

Applying [L4] to the finite automorphism group G of E and using step 1.2, [E:Fq]=[E:EG]=G=n and Aut(E/Fq)=Aut(E/EG)=G.

step 1.1step 1.2L4
3.1

Hence Aut(E/Fq)=n=[E:Fq], so E/Fq is Galois by [L5], and Gal(E/Fq)=Aut(E/Fq)=σq is cyclic of order n by step 2.1 and step 1.1. At n=1 the group is trivial and E=Fq.

step 1.1step 2.1L5

Remarks

  • Separability and normality are never argued separately. The usual route checks that E is a splitting field of tqnt and that this polynomial has no repeated root. Routing through Artin's fixed-field theorem: [K:KG]=G and Aut(K/KG)=G instead replaces both checks by one count: an automorphism group of order n whose fixed field is Fq already forces Aut=[E:Fq], which is one of the equivalent Galois conditions.

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