Proof of the uniqueness of finite fields of a given order

Builds on Finite field The order of a finite field is a prime power Prime subfield First isomorphism theorem for rings The multiplicative group of a finite field is cyclic Minimal polynomial of an algebraic element Degree of a simple extension is the degree of the minimal polynomial The minimal polynomial divides every polynomial vanishing at the element The minimal polynomial is irreducible Irreducible polynomial Every element of a finite field of order q satisfies x^q = x A polynomial over a field has at most as many roots as its degree K(a) is isomorphic to K[x] modulo the minimal polynomial

Proof

We follow the source, but we build the isomorphism from a generator of $F^\times$ . This avoids identifying the two prime subfields by hand.

Let $F$ and $F'$ be finite fields with $\abs{F} = \abs{F'} = q$ . By the prime power theorem, $q = p^n$ and $q = p'^{n'}$ , where $p$ and $p'$ are the characteristics.
By unique factorisation of $q$ into primes, $p = p'$ and $n = n'$ .
Let $P$ and $P'$ be the prime subfields of $F$ and $F'$ . As in the prime power theorem, the maps $\Z \to P$ , $k \mapsto k \cdot 1$ , and $\Z \to P'$ are surjective ring homomorphisms with kernel $p\Z$ .
By the first isomorphism theorem, both $P$ and $P'$ are isomorphic to $\Z/p\Z$ . So $\iota \colon P \to P'$ , $k \cdot 1 \mapsto k \cdot 1$ , is a ring isomorphism.
Applying $\iota$ to the coefficients gives a ring isomorphism $P[x] \to P'[x]$ , written $g \mapsto g^\iota$ . It preserves degrees and fixes $x^q - x$ .
By the cyclicity of $F^\times$ , there is $\alpha \in F$ that generates $F^\times$ . Every nonzero element of $F$ is a power of $\alpha$ , so $F = P(\alpha)$ .
Let $g$ be the minimal polynomial of $\alpha$ over $P$ . Then $\deg g = [P(\alpha) : P] = [F : P] = n$ , by the degree of a simple extension and the prime power theorem.
Since $\alpha^q = \alpha$ by the equation $x^q = x$ , the polynomial $g$ divides $x^q - x$ . Write $x^q - x = g h$ with $h \in P[x]$ of degree $q - n$ .
Applying $\iota$ gives $x^q - x = g^\iota h^\iota$ in $P'[x]$ . Every $b \in F'$ is a root of $x^q - x$ by the same result. So $g^\iota(b) h^\iota(b) = 0$ for each of the $q$ elements $b \in F'$ .
The polynomial $h^\iota$ is nonzero of degree $q - n < q$ , so it has fewer than $q$ roots in $F'$ . So $g^\iota(\beta) = 0$ for some $\beta \in F'$ .
The polynomial $g$ is monic and irreducible. The isomorphism of step 5 preserves factorisations and degrees, so $g^\iota$ is monic and irreducible in $P'[x]$ .
The minimal polynomial of $\beta$ over $P'$ divides $g^\iota$ . By step 11 it equals $g^\iota$ .
By the structure of simple extensions, $F = P(\alpha) \cong P[x]/(g)$ and $P'(\beta) \cong P'[x]/(g^\iota)$ . The isomorphism of step 5 maps the ideal $(g)$ onto $(g^\iota)$ , so it induces $P[x]/(g) \cong P'[x]/(g^\iota)$ .
Composing, we get a ring isomorphism $\sigma \colon F \to P'(\beta)$ . So $P'(\beta)$ has $q$ elements.
Since $P'(\beta) \subseteq F'$ and $\abs{F'} = q$ , we get $P'(\beta) = F'$ . So $\sigma$ is an isomorphism from $F$ onto $F'$ .

Idea

Both fields are generated over their copy of $\F_p$ by a single element. The minimal polynomial of a generator of $F$ divides $x^q - x$ , and $x^q - x$ vanishes on all of $F'$ . So that polynomial also has a root in $F'$ , and the two simple extensions it defines are isomorphic.

Reading path

To understand this page from the ground up, read these 213 pages in order. The foundations come first. The path takes the proofs Proof of Bézout's identity, Proof of cancellation in an integral domain, Proof of the generalized Euclid's lemma, Proof of the commutativity of addition by induction, Proof of the universal property of the polynomial ring, Proof that equivalence classes form a partition, Proof that g to the n equals 1 iff the order divides n, Proof that R[x] is an integral domain iff R is, Proof that g to the order of the group is the identity, Proof that the degree of a simple extension is the degree of the minimal polynomial, Proof that finite subgroups of the multiplicative group of a field are cyclic, Proof of the first isomorphism theorem for rings, Proof that a ring homomorphism is injective iff its kernel is zero, Proof that the order of an element divides the order of the group, Proof of the degree of a product over an integral domain, Proof of strong induction from ordinary induction, Proof of the laws of exponents in a group, Proof of the correspondence theorem for rings, Proof that a product of two finite cyclic groups is cyclic iff their orders are coprime, Proof that R/M is a field iff M is maximal, Proof that the characteristic of an integral domain is zero or prime, Proof that the only ideals of a field are zero and the whole field, Proof that a polynomial over a field has at most as many roots as its degree, Proof of the remainder theorem, Proof that K(a) is isomorphic to K[x] modulo the minimal polynomial, Proof that the order of a finite field is a prime power, Proof that a finite abelian group is cyclic iff its exponent equals its order, Proof that the order of a cyclic subgroup equals the order of its generator, Proof of the well-ordering principle from strong induction, Proof that the minimal polynomial is irreducible, Proof of the division algorithm, Proof that the minimal polynomial divides every polynomial vanishing at the element, Proof of the uniqueness of inverses, Proof that cyclic groups of the same order are isomorphic, Proof that K[x]/(f) is a field iff f is irreducible, Proof that in a PID a nonzero element is irreducible iff it generates a maximal ideal, Proof of Lagrange's theorem, Proof that every element of a finite field of order q satisfies x^q = x, Proof of the factor theorem, Proof that cosets have the same cardinality as the subgroup, Proof that the multiplicative group of a finite field is cyclic, Proof that Euclidean domains are principal ideal domains, Proof of the universal property of the quotient ring, Proof that K[x] is a Euclidean domain.

Binary operation definition
Definition by recursion concept
Divisibility definition
Element definition
Group concept
Left coset concept
Mathematical induction concept
Natural numbers object
Peano axioms concept
Proposition concept
Spanning set concept
Vector space definition
Commutativity definition
Identity element definition
Greatest common divisor definition
Prime number definition
Set definition
Direct product of groups definition
Group homomorphism definition
Order of a group definition
Ring definition
Subgroup definition
Successor function definition
Conjunction definition
Disjunction definition
Implication definition
Predicate definition
External direct sum definition
Linear combination definition
Linear subspace definition
Inverse element definition
Abelian group definition
Coprime integers definition
Composite number definition
Empty set object
Family of sets definition
Ordered pair definition
Addition of natural numbers definition
Group isomorphism definition
Ideal definition
Intersection definition
Union definition
Characteristic of a ring definition
Commutative ring definition
Polynomial ring definition
Ring homomorphism definition
Subring definition
Unit of a ring definition
Zero divisor definition
Left coset definition
Right coset definition
Set-builder notation concept
The successor function is injective statement
Zero is not a successor statement
Biconditional definition
Existential quantifier definition
Universal quantifier definition
Linear independence definition
Linear span definition
Proof of the uniqueness of inverses proof
Cartesian product definition
Disjoint sets definition
Order on the natural numbers definition
Proof of the commutativity of addition by induction proof
Maximal ideal definition
Two-sided ideal definition
Group of units of a ring definition
Ideal generated by a subset definition
Subset definition
Divisibility in a commutative ring definition
Union of a family of sets definition
Degree of a polynomial definition
Polynomial evaluation definition
Proof of the universal property of the polynomial ring proof
Axiom of extensionality statement
Field definition
Kernel of a ring homomorphism definition
Ring isomorphism definition
Integral domain definition
Uniqueness quantifier definition
Spanning set definition
Uniqueness of inverses statement
Binary relation definition
Commutativity of addition statement
Quotient ring definition
Partition of a set definition
Principal ideal definition
Proof that the characteristic of an integral domain is zero or prime proof
Proof of strong induction from ordinary induction proof
Leading coefficient definition
Proof that the only ideals of a field are zero and the whole field proof
Root of a polynomial definition
Proof of cancellation in an integral domain proof
Evaluation homomorphism definition
Finite field definition
Subfield definition
Irreducible element definition
Euclidean domain definition
Finite-dimensional vector space definition
Basis definition
Reflexive relation definition
Symmetric relation definition
Transitive relation definition
Proof of the laws of exponents in a group proof
Strong induction statement
Monic polynomial definition
Proof that R/M is a field iff M is maximal proof
Proof of the universal property of the quotient ring proof
Function definition
Multiplicity of a root definition
The only ideals of a field are zero and the whole field statement
Principal ideal domain definition
The characteristic of an integral domain is zero or prime statement
Proof of the remainder theorem proof
Proof of the degree of a product over an integral domain proof
Universal property of the polynomial ring statement
Prime subfield definition
Irreducible polynomial definition
Cancellation in an integral domain statement
Field extension definition
Dimension definition
Equivalence relation definition
Laws of exponents in a group statement
Proof of the well-ordering principle from strong induction proof
Codomain definition
Injective function definition
Image of a set definition
Preimage of a set definition
Division algorithm for polynomials statement
Universal property of the quotient ring statement
Proof that in a PID a nonzero element is irreducible iff it generates a maximal ideal proof
Degree of a product statement
Algebraic element definition
Intermediate field definition
Degree of a field extension definition
Order of an element definition
Well-ordering principle statement
Cyclic subgroup generated by an element definition
Surjective function definition
In a PID a nonzero element is irreducible iff it generates a maximal ideal statement
Minimal polynomial of an algebraic element definition
Equivalence class definition
Remainder theorem statement
Proof that a ring homomorphism is injective iff its kernel is zero proof
Proof that R[x] is an integral domain iff R is proof
Field generated by adjoining elements definition
Exponent of a group definition
Proof of the division algorithm proof
Cyclic group definition
Bijective function definition
Proof that equivalence classes form a partition proof
Proof that Euclidean domains are principal ideal domains proof
Proof that the minimal polynomial divides every polynomial vanishing at the element proof
Simple extension definition
Proof of the factor theorem proof
Proof that the minimal polynomial is irreducible proof
R[x] is an integral domain iff R is statement
A ring homomorphism is injective iff its kernel is zero statement
Division algorithm statement
Equinumerous sets definition
Equivalence classes form a partition statement
Proof of the correspondence theorem for rings proof
The minimal polynomial divides every polynomial vanishing at the element statement
Factor theorem statement
The minimal polynomial is irreducible statement
Euclidean domains are principal ideal domains statement
Proof that K[x] is a Euclidean domain proof
Proof of the first isomorphism theorem for rings proof
Cardinality definition
Proof of Bézout's identity proof
Proof that g to the n equals 1 iff the order divides n proof
Correspondence theorem for rings statement
K[x] is a Euclidean domain statement
First isomorphism theorem for rings statement
Proof that a polynomial over a field has at most as many roots as its degree proof
g to the n equals 1 iff the order divides n statement
Bézout's identity statement
R/M is a field iff M is maximal statement
A polynomial over a field has at most as many roots as its degree statement
Proof that cosets have the same cardinality as the subgroup proof
Proof that the order of a finite field is a prime power proof
Proof of the generalized Euclid's lemma proof
Proof that the order of a cyclic subgroup equals the order of its generator proof
Proof that K[x]/(f) is a field iff f is irreducible proof
The order of a finite field is a prime power statement
Cosets have the same cardinality as the subgroup statement
Generalized Euclid's lemma statement
Order of a cyclic subgroup equals the order of its generator statement
Proof of Lagrange's theorem proof
K[x]/(f) is a field iff f is irreducible statement
Proof that a product of two finite cyclic groups is cyclic iff their orders are coprime proof
Proof that cyclic groups of the same order are isomorphic proof
Lagrange's theorem statement
Proof that K(a) is isomorphic to K[x] modulo the minimal polynomial proof
Proof that the order of an element divides the order of the group proof
Cyclic groups of the same order are isomorphic statement
K(a) is isomorphic to K[x] modulo the minimal polynomial statement
Product of cyclic groups is cyclic iff the orders are coprime statement
Order of an element divides the order of the group statement
Proof that the degree of a simple extension is the degree of the minimal polynomial proof
Proof that g to the order of the group is the identity proof
Classification of finite abelian groups statement
Degree of a simple extension is the degree of the minimal polynomial statement
g to the order of the group is the identity statement
Proof that a finite abelian group is cyclic iff its exponent equals its order proof
A finite abelian group is cyclic iff its exponent equals its order statement
Proof that every element of a finite field of order q satisfies x^q = x proof
Proof that finite subgroups of the multiplicative group of a field are cyclic proof
Every element of a finite field of order q satisfies x^q = x statement
Finite subgroups of the multiplicative group of a field are cyclic statement
Proof that the multiplicative group of a finite field is cyclic proof
The multiplicative group of a finite field is cyclic statement
Proof of the uniqueness of finite fields of a given order proof

Where this leads

4 pages build on this one.

Tag	`ACWQ5B20KG`
URI	`m2://ACWQ5B20KG`
Kind	proof
Writing	W0 stub
MSC	12E20
Proves	Uniqueness of finite fields of a given order
Uses	Finite field, The order of a finite field is a prime power, Prime subfield, First isomorphism theorem for rings, The multiplicative group of a finite field is cyclic, Minimal polynomial of an algebraic element, Degree of a simple extension is the degree of the minimal polynomial, The minimal polynomial divides every polynomial vanishing at the element, The minimal polynomial is irreducible, Irreducible polynomial, Every element of a finite field of order q satisfies x^q = x, A polynomial over a field has at most as many roots as its degree, K(a) is isomorphic to K[x] modulo the minimal polynomial
Changed	4 November 2026

Proof of the uniqueness of finite fields of a given order

Proof

Idea

Reading path

Where this leads

Further reading

What this page needs for W1

What links here