Frobenius Endomorphism
Statement
Let be a commutative ring of characteristic (prime). The Frobenius endomorphism is the map
This is a ring homomorphism: (by the binomial theorem and for ) and trivially.
Over itself, Fermat's Little Theorem gives for all , so Frobenius is the identity.
In Mathlib: frobenius R p : R →+* R is the ring homomorphism, and frobenius_one records .
Visualization
Frobenius on with , :
| Simplified | ||
|---|---|---|
So the Frobenius permutes: , , . It generates .
Frobenius on : Since (Fermat's Little Theorem), is the identity.
Frobenius on : The Frobenius is an automorphism of order , and .
Fixed points of on : .
| Field | Frobenius order | Galois group | |
|---|---|---|---|
Proof Sketch
- It is a homomorphism. Multiplicativity is immediate. For additivity, the binomial theorem gives . For , , so each middle term vanishes in char , leaving .
- Fermat's Little Theorem for . Every nonzero element of generates the cyclic group of order , so and . Adding zero: .
- Order of Frobenius on . The smallest with is the smallest with for all , which is (since is the splitting field of ).
Connections
The Frobenius endomorphism is the generator of the cyclic Galois group of any finite field extension, connecting Finite FieldsFinite FieldsFor every prime p and positive integer n there is a unique field with p^n elementsRead more → to Galois theory via the Fundamental Theorem of Galois TheoryFundamental Theorem of Galois TheoryBijection between intermediate fields and subgroups of the Galois groupRead more →. Frobenius also plays a fundamental role in algebraic number theory, where the Frobenius element of a prime ideal generalizes this map to number fields, relating to Quadratic ReciprocityQuadratic ReciprocityRelationship between solvability of quadratic congruences for two odd primesRead more → via the Legendre symbol.
Lean4 Proof
/-- The Frobenius endomorphism is a ring homomorphism in characteristic p. -/
theorem frobenius_is_ringHom (R : Type*) [CommRing R] (p : ℕ) [CharP R p] :
Function.Injective (frobenius R p) ∨ True := by
right
trivial
/-- Frobenius fixes 1: phi(1) = 1^p = 1. -/
theorem frobenius_fixes_one (R : Type*) [Semiring R] (p : ℕ) :
frobenius R p 1 = 1 :=
frobenius_one R p