Field with four elements Created 2026-10-06 Updated 2026-10-14
Build this finite field by taking a quotient ring of a polynomial ring:
The polynomial has in the prime field . A polynomial of polynomial degree two is an irreducible polynomial exactly when it has no polynomial root in the coefficient field. Thus the quotient by an irreducible polynomial is a field construction applies. Its elements have unique representatives , with : precisely .
The defining relation is . Since this finite field has characteristic two, every element equals its additive inverse, and the relation becomes . Addition acts separately on the two coefficients:
All coefficient calculations use modular arithmetic modulo two. For example, and . Encoding as the pair of bits gives , , , and ; addition is bitwise exclusive or. These are coordinates in the basis , so the label does not make the element .
For multiplication, expand using the distributive property and replace every by :
For example, , while . The following complete tables are computed from the coefficient rules. Colors identify results, rather than their numerical sizes. Every row of the addition table lists all four elements, and every nonzero row of the multiplication table does too: adding an element, or multiplying by a nonzero element, can be undone.
Figure 1.
Computed addition and multiplication tables for the field with four elements
. Details.
The nonzero multiplicative inverses are , , and . Consequently the equation has the unique solution . Repeated multiplication gives , , , and . They cycle through every element of the multiplicative group of a finite field.
Compare the ring , also with four elements. Its addition satisfies , and its multiplication satisfies . Thus is a zero divisor, with no multiplicative inverse, and this ring is not a field. Multiplying by collapses different inputs to the same output: both and give , while both and give . In the field with four elements, multiplying by instead rotates the three nonzero elements, preserving their distinctness. The figure makes visible why counting four elements alone does not specify their arithmetic.
Figure 2.
Four elements with different arithmetic: a field and integers modulo four
. Details.
A monic quadratic polynomial over a field is irreducible exactly when it has no root in that field. Testing the nine choices of its two coefficients in gives
For clarity, a zero constant term gives a root at zero. Among constant term one, only the zero linear coefficient avoids roots at . Among constant term two, precisely the linear coefficients one and two avoid roots. This exhausts all choices.
Put . Its values at are respectively , so it has no linear factor. If this quartic were reducible, absence of a linear factor would force a factorization into two irreducible quadratics. Division by the three candidates above gives remainders respectively , all nonzero. Thus is an irreducible polynomial.
The quotient by an irreducible polynomial is a field consequently gives a field of elements. Its nonzero elements form a multiplicative group of a finite field of order . In this field, . Successive squaring gives
The latter is not one: otherwise the nonzero polynomial of degree below four would vanish at , contradicting its minimal polynomial. By Lagrange's theorem, . Since five is prime, its order is exactly five. Hence one answer is
Its other nonidentity powers are the remaining primitive fifth roots. It is unnecessary to prove that itself generates the entire multiplicative group.
A monic quadratic polynomial over a field is irreducible exactly when it has no root in that field. Testing the nine choices of its two coefficients in gives
For clarity, a zero constant term gives a root at zero. Among constant term one, only the zero linear coefficient avoids roots at . Among constant term two, precisely the linear coefficients one and two avoid roots. This exhausts all choices.
Put . Its values at are respectively , so it has no linear factor. If this quartic were reducible, absence of a linear factor would force a factorization into two irreducible quadratics. Division by the three candidates above gives remainders respectively , all nonzero. Thus is an irreducible polynomial.
The quotient by an irreducible polynomial is a field consequently gives a field of elements. Its nonzero elements form a multiplicative group of a finite field of order . In this field, . Successive squaring gives
The latter is not one: otherwise the nonzero polynomial of degree below four would vanish at , contradicting its minimal polynomial. By Lagrange's theorem, . Since five is prime, its order is exactly five. Hence one answer is
Its other nonidentity powers are the remaining primitive fifth roots. It is unnecessary to prove that itself generates the entire multiplicative group.