Mathwords logoMathwords

Finite Field — Definition, Formula & Examples

A finite field is a field that contains a finite number of elements. Just like the real numbers, you can add, subtract, multiply, and divide (except by zero) within a finite field, but the set of elements is limited — for example, the integers {0, 1, 2, 3, 4} under arithmetic modulo 5.

A finite field (also called a Galois field) is a set FF with a finite number of elements, together with two binary operations (addition and multiplication), such that (F,+,⋅)(F, +, \cdot) satisfies the field axioms: closure, associativity, commutativity, existence of additive and multiplicative identities, existence of additive inverses for all elements, existence of multiplicative inverses for all nonzero elements, and distributivity of multiplication over addition. A finite field exists if and only if its number of elements is pnp^n, where pp is a prime and nn is a positive integer.

How It Works

The simplest finite fields are Zp={0,1,2,…,p−1}\mathbb{Z}_p = \{0, 1, 2, \ldots, p-1\} where pp is prime, with all arithmetic done modulo pp. To add or multiply, perform the usual operation and then take the remainder when dividing by pp. Division by a nonzero element aa means multiplying by the multiplicative inverse of aa, which always exists because pp is prime. For example, in Z5\mathbb{Z}_5, the inverse of 3 is 2 because 3×2=6≡1(mod5)3 \times 2 = 6 \equiv 1 \pmod{5}. Finite fields with pnp^n elements (where n>1n > 1) are constructed using polynomial arithmetic modulo an irreducible polynomial over Zp\mathbb{Z}_p.

Worked Example

Problem: In the finite field Z7={0,1,2,3,4,5,6}\mathbb{Z}_7 = \{0, 1, 2, 3, 4, 5, 6\}, compute 5+45 + 4, 3×53 \times 5, and find the multiplicative inverse of 3.
Addition: Add 5 and 4, then reduce modulo 7.
5+4=9≡2(mod7)5 + 4 = 9 \equiv 2 \pmod{7}
Multiplication: Multiply 3 and 5, then reduce modulo 7.
3×5=15≡1(mod7)3 \times 5 = 15 \equiv 1 \pmod{7}
Multiplicative inverse of 3: From the previous step, we see that 3×5≡1(mod7)3 \times 5 \equiv 1 \pmod{7}, so the multiplicative inverse of 3 is 5.
3−1≡5(mod7)3^{-1} \equiv 5 \pmod{7}
Answer: In Z7\mathbb{Z}_7: 5+4=25 + 4 = 2, 3×5=13 \times 5 = 1, and 3−1=53^{-1} = 5.

Why It Matters

Finite fields are foundational in coding theory and cryptography — the AES encryption standard and Reed-Solomon error-correcting codes both rely on arithmetic in finite fields. In abstract algebra courses, they serve as key examples that connect group theory, ring theory, and polynomial algebra.

Common Mistakes

Mistake: Assuming a finite field can have any number of elements, such as 6 or 10.
Correction: A finite field exists only when the number of elements is a prime power pnp^n. There is no finite field with 6 elements because 6 is not a prime power.