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.

The intermediate fields of Fqn/Fq are the Fqd, one for each positive divisor d of n

Statement

Let Fq be a finite field of order q, let n≥1, and let Fqn be a finite field having Fq as a subfield with [Fqn:Fq]=n (The degree [K:F]=dim⁡FK of a finite field extension). For a positive divisor d of n (Divisibility in Z: d∣a when a=dq for some integer q) put

Fqd:={ x∈Fqn:xqd=x }.

Then the fields Fqd, as d runs over the positive divisors of n, are exactly the intermediate fields of Fqn/Fq, with distinct divisors giving distinct fields;

[Fqd:Fq]=d,∣Fqd∣=qd;

and for positive divisors d,e of n,

Fqd⊆Fqe⟺d∣e.

The two ends of the lattice are instances: d=1 gives the base field Fq and d=n gives Fqn.

Facts & Assumptions

Given: Finite fields Fq⊆E:=Fqn with ∣Fq∣=q and [E:Fq]=n≥1, and the relative Frobenius σq(x)=xq (The relative Frobenius x↦xq of an extension of finite fields), whose i-th iterate is x↦xqi.

[L1]

E/Fq is Galois and Gal⁡(E/Fq)=⟨σq⟩ is cyclic of order n (A finite extension of a finite field of order q is Galois with cyclic Galois group generated by x↦xq).

[L2]

In a cyclic group ⟨g⟩ of finite order n, for each positive divisor c of n the subgroup ⟨gn/c⟩ has order c and is the unique subgroup of that order, every subgroup has this form for exactly one such c, and ⟨gn/c⟩⊆⟨gn/c′⟩ if and only if c∣c′ (A finite cyclic group has exactly one subgroup of each order dividing its own).

[L3]

For K/F finite Galois with G=Gal⁡(K/F), the assignments H↦KH and F′↦Gal⁡(K/F′) are mutually inverse inclusion-reversing bijections between subgroups H≤G and intermediate fields F⊆F′⊆K, and [K:KH]=∣H∣, [KH:F]=[G:H] (The fundamental theorem of finite Galois theory).

[L5]

For an extension of finite fields L/Fq of degree m one has ∣L∣=qm (For a degree-n extension of a field of order q, the q-power map has order exactly n).

[L6]

KH={ x∈K:σ(x)=x for every σ∈H } (The fixed field KG of a group of field automorphisms).

[L7]

For a finite group G and H≤G one has ∣G∣=[G:H] ∣H∣ (Lagrange's theorem: ∣G∣=[G:H]∣H∣ for every subgroup H of a finite group G).

Proof

technique · direct
1.1L1

Write G:=Gal⁡(E/Fq)=⟨σq⟩, cyclic of order n by [L1], and for a positive divisor d of n put Hd:=⟨σq d⟩.

2.1step 1.1L2algebra

By [L2] applied to G with generator σq and c=n/d, the subgroup Hd=⟨σq n/(n/d)⟩ has order n/d; every subgroup of G is Hd for exactly one positive divisor d of n; and He⊆Hd if and only if d∣e, since He⊆Hd reads ⟨σq n/(n/e)⟩⊆⟨σq n/(n/d)⟩, which by [L2] says (n/e)∣(n/d), that is d∣e.

2.2step 1.1L6given

The fixed field of Hd is EHd={ x∈E:σq d(x)=x }={ x∈E:xqd=x }=Fqd, because an element fixed by σq d is fixed by all its powers and conversely.

3.1step 2.1step 2.2L3

By [L3] the map H↦EH is a bijection from the subgroups of G onto the intermediate fields of E/Fq; composing with the bijection of step 2.1 between positive divisors of n and subgroups, the fields Fqd=EHd are exactly the intermediate fields, distinct divisors giving distinct fields.

3.2step 2.1step 2.2L3L5L7algebra

Degrees: [L3] gives [Fqd:Fq]=[EHd:Fq]=[G:Hd], and [L7] with step 2.1 turns this into ∣G∣/∣Hd∣=n/(n/d)=d; then [L5] gives ∣Fqd∣=qd.

4.1step 2.1step 2.2step 3.1step 3.2L3L4∎

Inclusions: [L3] makes the correspondence inclusion-reversing, so Fqd=EHd⊆EHe=Fqe exactly when He⊆Hd, which by step 2.1 holds exactly when d∣e. At d=1 one has H1=G and Fq1=EG=Fq by [L4], and at d=n one has Hn={id} and Fqn=E; with steps 3.1 and 3.2 this proves every clause.

Remarks

  • Why the lattice is exactly the divisor lattice. Uniqueness of the subgroup of each order in a cyclic group is what leaves no choice: had Gal⁡(E/Fq) been the Klein four-group, three distinct subgroups of order two would have produced three intermediate fields of the same degree, and no indexing by divisors could exist.

Depends on

Used by

Dependency tree · two levels

39 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