Ma · Mathematics

Why Is Every Finite Integral Domain a Field?

Published By the 9to5Science editorial team

At a glance

  1. 1. Choose a nonzero element

    Fix any nonzero element a in the finite integral domain.

  2. 2. Multiply by a

    The map x to ax is injective because the domain has no zero divisors.

  3. 3. Use finiteness

    An injective map from a finite set to itself is surjective.

  4. 4. Find an inverse

    Surjectivity gives an element b with ab equal to 1, so every nonzero element is invertible.

A finite integral domain is always a field, under the standard convention that an integral domain is a commutative ring with identity 1≠01 \ne 0 and no zero divisors. The key point is that in a finite set, an injective function from the set to itself must also be surjective. Apply that fact to multiplication by any nonzero element.

The proof

Let DD be a finite integral domain, and choose any a∈Da \in D with a≠0a \ne 0. Consider the function

fa:D→D,fa(x)=ax. f_a : D \to D, \qquad f_a(x)=ax.

First, show that faf_a is injective. If fa(x)=fa(y)f_a(x)=f_a(y), then

ax=ay⟹a(x−y)=0. ax=ay \quad\Longrightarrow\quad a(x-y)=0.

Because DD has no zero divisors and a≠0a \ne 0, it follows that x−y=0x-y=0, so x=yx=y. Thus distinct elements of DD have distinct products when multiplied by aa.

Now use finiteness. The function faf_a maps the finite set DD to itself. An injective map from a finite set to itself is surjective: it has as many distinct outputs as there are inputs, so it must reach every element of DD. In particular, it reaches the identity 11. Therefore, there is some b∈Db \in D such that

fa(b)=ab=1. f_a(b)=ab=1.

So aa has a multiplicative inverse. Since aa was an arbitrary nonzero element, every nonzero element of DD is invertible. That is exactly the additional property needed for an integral domain to be a field.

A concrete example: arithmetic modulo 7

The integers modulo 7 form a finite integral domain, written Z/7Z\mathbb{Z}/7\mathbb{Z}. To see the inverse argument at work, take a=3a=3. Multiplication by 3 sends the residue classes as follows:

xx3x3x modulo 7
00
13
26
32
45
51
64

Every residue class appears as an output, including 1. In fact, 3⋅5≡1(mod7)3 \cdot 5 \equiv 1 \pmod 7, so 5 is the inverse of 3 modulo 7. The proof guarantees that this happens for every nonzero residue class, not just 3.

More generally, Z/nZ\mathbb{Z}/n\mathbb{Z} is a field when nn is prime. If nn is composite, it has nonzero zero divisors: for example, modulo 6, 2⋅3≡02 \cdot 3 \equiv 0. Thus Z/6Z\mathbb{Z}/6\mathbb{Z} is not an integral domain and the theorem does not apply.

Why finiteness matters

An infinite integral domain need not be a field. The integers Z\mathbb{Z} are an integral domain, but 2 has no multiplicative inverse in Z\mathbb{Z}: there is no integer bb with 2b=12b=1. The injectivity argument still works for multiplication by 2, but the step from injective to surjective fails for infinite sets. For instance, multiplying integers by 2 never produces an odd integer.

Common mistakes

  • Stopping after proving injectivity. Injectivity alone does not give an inverse. The crucial next step is that an injective self-map of a finite set is surjective, which makes 1 an output.
  • Assuming every finite ring is a field. A finite ring can have zero divisors, as Z/6Z\mathbb{Z}/6\mathbb{Z} shows. The theorem requires an integral domain.
  • Forgetting the identity convention. The standard definition used here includes a multiplicative identity distinct from zero. Without that convention, the statement needs extra qualifications.
  • Changing the meaning of “domain.” In standard introductory algebra, an integral domain is commutative. Noncommutative rings without zero divisors require a different statement and, in the finite case, a deeper theorem to conclude commutativity.

The argument is useful whenever you can define a multiplication map on a finite domain: prove it is injective using cancellation, then use finiteness to obtain surjectivity and an inverse.

References

  1. Abstract Algebra, David S. Dummit and Richard M. Foote

Spotted an error? Send a correction. Read how we write and check articles in our editorial policy.