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 is Galois with cyclic Galois group generated by
Statement
Let be a finite field of order and let be a finite field having as a subfield, with (The degree of a finite field extension). Then is a finite Galois extension (Finite Galois extensions and ) and
is cyclic of order , generated by the relative Frobenius (The relative Frobenius of an extension of finite fields).
Facts & Assumptions
Given: Finite fields with and , and the subgroup of .
The relative Frobenius is an -automorphism of (The relative Frobenius of an extension of finite fields).
and has order exactly in (For a degree- extension of a field of order , the -power map has order exactly ).
If is a finite group of automorphisms of , then and (Artin's fixed-field theorem: and ).
For a finite extension with , the conditions " is Galois", " is the splitting field over of a separable polynomial", "" and "" are equivalent (Equivalent characterizations of a finite Galois extension).
Proof
is a cyclic group of automorphisms of , finite of order by [L1] and [L3].
Its fixed field is by [L2] and [L6].
Applying [L4] to the finite automorphism group of and using step 1.2, and .
Hence , so is Galois by [L5], and is cyclic of order by step 2.1 and step 1.1. At the group is trivial and .
Remarks
- Separability and normality are never argued separately. The usual route checks that is a splitting field of and that this polynomial has no repeated root. Routing through Artin's fixed-field theorem: and instead replaces both checks by one count: an automorphism group of order whose fixed field is already forces , which is one of the equivalent Galois conditions.
Depends on
- The relative Frobenius $x\mapsto x^q$ of an extension of finite fields
- 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$
- Artin's fixed-field theorem: $[K:K^G]=|G|$ and $\operatorname{Aut}(K/K^G)=G$
- Equivalent characterizations of a finite Galois extension
- Finite Galois extensions and $\operatorname{Gal}(K/F)$
- The fixed field $K^G$ of a group of field automorphisms
- The degree $[K:F]=\dim_F K$ of a finite field extension
Used by
- A normal basis of F₈ over F₂ Example
- Gal(F₈/F₂) is cyclic of order three with no proper intermediate field Example
- The four roots of t⁴+t+1 over F₂ are the Frobenius powers of any one of them Example
- The intermediate fields of F_2¹²/F₂ match the divisors of twelve Example
- FALSE: every basis of a finite field over a subfield is a normal basis False statement
- A monic irreducible of degree d over F_q has the d distinct roots α,α^q,…,α^qᵈ⁻¹ Theorem
- Every finite Galois extension has a normal basis Theorem
- For gcd(n,q)=1 the image of Gal(F_q(μₙ)/F_q) in (ℤ/n)^× is generated by [q] Theorem
- The intermediate fields of F_qⁿ/F_q are the F_qᵈ, one for each positive divisor d of n Theorem
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
- K. Conrad, Finite Fields (expository blurb), Theorem 5.6 (standard reference, not scraped)
- J. S. Milne, Fields and Galois Theory, v5.10, Proposition 4.20 (standard reference, not scraped)