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 are the , one for each positive divisor of
Statement
Let be a finite field of order , let , and let be a finite field having as a subfield with (The degree of a finite field extension). For a positive divisor of (Divisibility in : when for some integer ) put
Then the fields , as runs over the positive divisors of , are exactly the intermediate fields of , with distinct divisors giving distinct fields;
and for positive divisors of ,
The two ends of the lattice are instances: gives the base field and gives .
Facts & Assumptions
Given: Finite fields with and , and the relative Frobenius (The relative Frobenius of an extension of finite fields), whose -th iterate is .
is Galois and is cyclic of order (A finite extension of a finite field of order is Galois with cyclic Galois group generated by ).
In a cyclic group of finite order , for each positive divisor of the subgroup has order and is the unique subgroup of that order, every subgroup has this form for exactly one such , and if and only if (A finite cyclic group has exactly one subgroup of each order dividing its own).
For finite Galois with , the assignments and are mutually inverse inclusion-reversing bijections between subgroups and intermediate fields , and , (The fundamental theorem of finite Galois theory).
For an extension of finite fields of degree one has (For a degree- extension of a field of order , the -power map has order exactly ).
For a finite group and one has (Lagrange's theorem: for every subgroup of a finite group ).
Proof
Write , cyclic of order by [L1], and for a positive divisor of put .
By [L2] applied to with generator and , the subgroup has order ; every subgroup of is for exactly one positive divisor of ; and if and only if , since reads , which by [L2] says , that is .
The fixed field of is , because an element fixed by is fixed by all its powers and conversely.
By [L3] the map is a bijection from the subgroups of onto the intermediate fields of ; composing with the bijection of step 2.1 between positive divisors of and subgroups, the fields are exactly the intermediate fields, distinct divisors giving distinct fields.
Degrees: [L3] gives , and [L7] with step 2.1 turns this into ; then [L5] gives .
Inclusions: [L3] makes the correspondence inclusion-reversing, so exactly when , which by step 2.1 holds exactly when . At one has and by [L4], and at one has and ; 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 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
- A finite extension of a finite field of order $q$ is Galois with cyclic Galois group generated by $x\mapsto x^q$
- A finite cyclic group has exactly one subgroup of each order dividing its own
- The fundamental theorem of finite Galois theory
- The elements of a finite extension fixed by the $q$-power map are exactly the base field
- For a degree-$n$ extension of a field of order $q$, the $q$-power map has order exactly $n$
- The relative Frobenius $x\mapsto x^q$ of an extension of finite fields
- The fixed field $K^G$ of a group of field automorphisms
- The degree $[K:F]=\dim_F K$ of a finite field extension
- Lagrange's theorem: $|G|=[G:H]|H|$ for every subgroup $H$ of a finite group $G$
- Divisibility in $\mathbb{Z}$: $d \mid a$ when $a = dq$ for some integer $q$
Used by
- F₃(μ₅)capF₃(μ₇) is larger than F₃ although five and seven are coprime Counterexample
- Gal(F₈/F₂) is cyclic of order three with no proper intermediate field Example
- The intermediate fields of F_2¹²/F₂ match the divisors of twelve Example
- The Galois description of the subfields of a finite field and the elementary divisibility criterion agree Remark
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
- K. Conrad, Finite Fields (expository blurb), Theorem 5.2 (standard reference, not scraped)
- J. S. Milne, Fields and Galois Theory, v5.10, Proposition 4.23 and Corollary 4.21 (standard reference, not scraped)