Alphabeta Math
RemarkRemark: AI-adaptedProof: Not applicableSession-authored (Fable 5 assisted)judge 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 Galois description of the subfields of a finite field and the elementary divisibility criterion agree

Statement

Two statements in this library describe the subfields of a finite field, and they describe the same objects.

The subfields of Fpn are the unique fields Fpd for positive divisors d of n fixes a finite field F of order pm with p its characteristic and says that for each positive divisor e of m the set {aF:ape=a} is the unique subfield of F of order pe, and that these are all of the subfields of F. Its index set is therefore the divisors of m, and its base point is the prime field.

The intermediate fields of Fqn/Fq are the Fqd, one for each positive divisor d of n fixes a base field Fq inside F and says that the intermediate fields of F/Fq are the {xF:xqd=x} for the positive divisors d of n=[F:Fq]. Its index set is therefore the divisors of n, and its base point is Fq.

The dictionary. Write q=pk, so that m=kn. For a positive divisor d of n the two prescriptions produce literally the same set,

{xF:xqd=x}={xF:xpkd=x},

which is the subfield of order pkd named by the first statement; and kd runs exactly over the divisors e of m that are multiples of k as d runs over the divisors of n. So the intermediate fields of F/Fq are precisely those subfields of F whose order is pe with ke, which is the expected answer: a subfield of F contains the unique subfield of order pk exactly when k divides e, by the divisibility clause of The intermediate fields of Fqn/Fq are the Fqd, one for each positive divisor d of n applied over the prime field.

Neither statement is the other. The published one is elementary: it counts roots of tpet and needs no Galois theory. The one proved here reads the lattice off the subgroup lattice of a cyclic Galois group, and it is that reading which the rest of this page uses, because the same correspondence also supplies the degrees and the automorphism groups of the intermediate fields. Recording their agreement here is what keeps the two vocabularies from drifting apart in later proofs.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

16 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