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.
For a degree- extension of a field of order , the -power map has order exactly
Statement
Let be a finite field of order and let be an extension of finite fields of degree (The degree of a finite field extension). Then
and the relative Frobenius (The relative Frobenius of an extension of finite fields) has order exactly in (The order of a finite group and the order of an element, with when no positive power of is the identity). At this says is the identity, of order one.
Facts & Assumptions
Given: Finite fields with and ; the prime subfield of is with the characteristic, and has the same characteristic, its identity element being that of .
The relative Frobenius is , an -automorphism of , with (The relative Frobenius of an extension of finite fields).
If is a field with elements, then every satisfies (A field with elements is the splitting field of over its prime subfield).
Let be an integral domain. A nonzero polynomial of degree has at most distinct roots in (A nonzero polynomial of degree over an integral domain has at most distinct roots).
If is a finite field, then there is a unique prime and a unique positive integer with ; here and (Every finite field has order for a unique prime characteristic and positive integer ).
For fields with and finite, is finite and (Tower law for finite extensions: ).
Proof
By [L4] applied to , with ; by [L4] applied to , with .
The tower and [L5] give , so .
Every satisfies , by [L2] applied to , whose order is by step 2.1; by [L1] this says .
For an integer with one has : otherwise every one of the elements of would be a root of the nonzero polynomial , whose degree is smaller than because , contradicting [L3].
The least with is therefore , that is ; for steps 3.1 and 3.2 say only that , of order one.
Depends on
- The relative Frobenius $x\mapsto x^q$ of an extension of finite fields
- A field with $q$ elements is the splitting field of $x^q-x$ over its prime subfield
- A nonzero polynomial of degree $n$ over an integral domain has at most $n$ distinct roots
- Every finite field has order $p^n$ for a unique prime characteristic $p$ and positive integer $n$
- Tower law for finite extensions: $[L:F]=[L:K][K:F]$
- The degree $[K:F]=\dim_F K$ of a finite field extension
- The order $|G|$ of a finite group and the order $\operatorname{ord}(g)$ of an element, with $\operatorname{ord}(g) = \infty$ when no positive power of $g$ is the identity
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 finite extension of a finite field of order q is Galois with cyclic Galois group generated by x↦ x^q Theorem
- A monic irreducible of degree d over F_q has the d distinct roots α,α^q,…,α^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
34 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)