Engineering / Mathematics — Finite Fields
The Frobenius Map
The Frobenius endomorphism, its fixed field, its order, and the Galois structure of finite field extensions.
Executive summary
The map sending an element to its p-th power is a field homomorphism in characteristic p. On a finite field it is an automorphism, and it generates the full automorphism group.
The Galois group of a finite field extension is cyclic, generated by Frobenius, which makes finite field Galois theory unusually simple.
Learning objectives
- Prove Frobenius is a field homomorphism.
- Identify its fixed field and order.
- State the Galois correspondence for finite fields.
01Frobenius is a homomorphism
Frobenius map
φ(a) = a^p on a field of characteristic p.
Homomorphism property
φ(a + b) = φ(a) + φ(b) and φ(ab) = φ(a)φ(b).
Multiplicativity is trivial. Additivity is the freshman's dream: the binomial coefficients strictly between the ends are divisible by p and therefore vanish. This is the property that has no analogue in characteristic zero.
On a finite field φ is injective, since a field homomorphism has trivial kernel, and therefore surjective by finiteness. So it is an automorphism.
02Fixed field and order
Fixed field
The elements fixed by φ are exactly those with a^p = a, which is the prime field F_p.
More generally, the fixed field of φ^d is F_{p^d}.
On F_{p^k} the map φ has order exactly k: applying it k times gives a^{p^k} = a, the identity, and no smaller power works because the fixed field would then be too large.
φ^k = id on F_{p^k}, and Fix(φ^d) = F_{p^d} for d | k03The Galois correspondence
Galois group of a finite field extension
Gal(F_{p^k} / F_p) is cyclic of order k, generated by the Frobenius map.
Subgroups correspond to subfields: the subgroup generated by φ^d has fixed field F_{p^d}, for each divisor d of k.
So the Galois correspondence for finite fields is the divisor lattice of k, matching the subfield structure exactly. This is the simplest non-trivial Galois theory there is — every extension is cyclic, normal and separable.
| Subgroup of Gal | Order | Fixed field |
|---|---|---|
| Trivial | 1 | F_{p^k}, the whole field |
| <φ^d> | k/d | F_{p^d} |
| Whole group | k | F_p, the prime field |
Computationally, Frobenius is a linear map over the prime field, so it is represented by a matrix that can be precomputed. Applying it then costs a matrix-vector product, or a single cyclic shift if a normal basis is used.
04Frequently asked questions
Why is Frobenius surjective on a finite field but not in general?
Because an injective map on a finite set is automatically surjective. On an infinite field injectivity gives nothing, and fields where Frobenius fails to be surjective are called imperfect.
Is every finite field extension Galois?
Yes. Finite field extensions are always normal and separable, so every one is Galois with cyclic group. This is why finite field Galois theory is so much simpler than the general theory.
How is Frobenius computed efficiently?
As a precomputed matrix over the prime field, giving a matrix-vector product per application. With a normal basis it is a cyclic shift, which is essentially free — the reason normal bases are used in hardware.
Sources and method
Structural reference: Victor Shoup, A Computational Introduction to Number Theory and Algebra, Version 1, Cambridge University Press, 2005 — book pages 456-461.
This page carries the durable method layer only: definitions, constructions, algorithms, complexity results and selection criteria, authored originally for KEVOS. No text is transcribed or paraphrased from the source, and no numeric tables or benchmark data are reproduced — these are routed to live authoritative sources instead.
Author: Kevin Jogin. Last reviewed 2026-08-07.