Engineering / Mathematics — Finite Fields
Finite Fields: Preliminaries
The characteristic of a finite field, why its order is a prime power, and the prime subfield.
Executive summary
Every finite field has prime characteristic and contains a copy of the prime field of that characteristic. It is a vector space over that subfield, so its order is a prime power.
This constrains the possible orders completely: a finite field of order n exists exactly when n is a prime power.
Learning objectives
- Define characteristic and prove it is prime for a field.
- Show every finite field has prime power order.
- Identify the prime subfield.
01Characteristic
Characteristic
The characteristic of a ring is the least positive n with n · 1 = 0, or 0 if no such n exists.
Characteristic of a field is prime or zero
If a field has characteristic n > 0, then n is prime.
Reason. If n = ab with both factors smaller, then (a · 1)(b · 1) = 0, and a field has no zero divisors, so one factor is already zero — contradicting minimality.
A finite field cannot have characteristic 0, since the multiples of 1 would then be infinitely many distinct elements. So every finite field has prime characteristic.
02Order is a prime power
Prime power order
Every finite field has order p^k for a prime p and integer k ≥ 1.
Reason. The multiples of 1 form a subfield isomorphic to F_p, and the field is a vector space over it. A k-dimensional vector space over F_p has exactly p^k elements.
Prime subfield
The subfield generated by 1, isomorphic to F_p. It is contained in every subfield and is the smallest subfield.
03The freshman's dream
Frobenius identity
In a field of characteristic p,
(a + b)^p = a^p + b^p.
The binomial coefficients C(p, i) for 0 < i < p are all divisible by p, because p appears in the numerator and cannot be cancelled by the smaller factors below it. Every cross term therefore vanishes.
| Property | Characteristic 0 | Characteristic p |
|---|---|---|
| (a+b)^p | Full binomial expansion | a^p + b^p |
| a ↦ a^p | Not additive | A field homomorphism |
| Derivative of X^p | pX^{p−1} | Zero |
| Every element a root of | — | X^{q} − X |
The vanishing derivative of X^p matters for squarefree decomposition: a polynomial can have zero derivative without being constant, which requires a separate branch in the algorithm.
04Frequently asked questions
Why is there no field of order 6?
Because 6 is not a prime power. A field of order 6 would have prime characteristic p dividing 6, and would be a vector space over F_p, so its order would be a power of p — impossible for 6.
Is Z_n a field for composite n?
No. For composite n it has zero divisors, so it is not even an integral domain. The field of order p^k is constructed as a polynomial quotient, not as Z_{p^k}.
What breaks in characteristic p?
Chiefly the derivative. X^p has zero derivative despite being non-constant, so the usual squarefree test via gcd with the derivative needs an extra case. Separability questions also arise that do not exist in characteristic zero.
Sources and method
Structural reference: Victor Shoup, A Computational Introduction to Number Theory and Algebra, Version 1, Cambridge University Press, 2005 — book pages 448-450.
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.