Skip to main content
Logo image

Applied Discrete Structures

Section 16.2 Fields

Although the algebraic structures of rings and integral domains are widely used and play an important part in the applications of mathematics, we still cannot solve the simple equation ax=b, a≠0 in all rings or all integral domains, for that matter. Yet this is one of the first equations we learn to solve in elementary algebra and its solubility is basic to innumerable questions. If we wish to solve a wide range of problems in a system we need at least all of the laws true for rings and the cancellation laws together with the ability to solve the equation ax=b, a≠0. We summarize the above in a definition and list theorems that will place this concept in the context of the previous section.

Definition 16.2.1. Field.

A field is a commutative ring with unity such that each nonzero element has a multiplicative inverse.
In this chapter, we denote a field generically by the letter F. The letters k, K and L are also conventionally used for fields.

Example 16.2.2. Some common fields.

The most common infinite fields are [Q;+,β‹…], [R;+,β‹…], and [C;+,β‹…].

Remark 16.2.3.

Since every field is a ring, all facts and concepts that are true for rings are true for any field.

Proof.

The proof is fairly easy and a good exercise, so we provide a hint. Starting with the assumption that aβ‹…b=0 if we assume that aβ‰ 0 then the existence of aβˆ’1 makes it possible to infer that b=0.
Of course the converse of Theorem 16.2.4 is not true. Consider [Z;+,β‹…]. However, the next theorem proves the converse in finite fields.

Proof.

We leave the details to the reader, but observe that if D is a finite integral domain, we can list all elements as a1,a2,…,an, where a1=1. Now, to show that any ai has a multiplicative inverse, consider the n products aiβ‹…a1,aiβ‹…a2,…,aiβ‹…an. What can you say about these products?
If p is a prime, p∣(aβ‹…b)β‡’p∣a or p∣b. An immediate implication of this fact is the following corollary.

Example 16.2.7. A field of order 4.

Corollary 16.2.6 gives us a large number of finite fields, but we must be cautious. This does not tell us that all finite fields are of the form Zp , p a prime. To see this, let’s try to construct a field of order 4.
First the field must contain the additive and multiplicative identities, 0 and 1, so, without loss of generality, we can assume that the field we are looking for is of the form F={0,1,a,b}. Since there are only two nonisomorphic groups of order 4, we have only two choices for the group table for [F;+]. If the additive group is isomorphic to Z4 then two of the nonzero elements of F would not be their own additive inverse (as are 1 and 3 in Z4). Let’s assume β∈F is one of those elements and Ξ²+Ξ²=Ξ³β‰ 0. An isomorphism between the additive groups F and Z4 would require that Ξ³ in F correspond with 2 in Z4. We could continue our argument and infer that Ξ³β‹…Ξ³=0, producing a zero divisor, which we need to avoid if F is to be a field. We leave the remainder of the argument to the reader. We can thus complete the addition table so that [F;+] is isomorphic to Z22:
+01ab001ab110baaab01bba10
Next, since 1 is the unity of F, the partial multiplication table must look like:
β‹…01ab00000101aba0aβˆ’βˆ’b0bβˆ’βˆ’
Hence, to complete the table, we have only four entries to find, and, since F must be commutative, this reduces our task to filling in three entries. Next, each nonzero element of F must have a unique multiplicative inverse. The inverse of a must be either a itself or b. If aβˆ’1=a, then bβˆ’1=b. (Why?) But aβˆ’1=aβ‡’aβ‹…a=1. And if aβ‹…a=1, then aβ‹…b is equal to a or b. In either case, by the cancellation law, we obtain a=1 or b=1, which is impossible. Therefore we are forced to conclude that aβˆ’1=b and bβˆ’1=a. To determine the final two products of the table, simply note that, aβ‹…aβ‰ a because the equation x2=x has only two solutions, 0 and 1 in any field. We also know that aβ‹…a cannot be 1 because a doesn’t invert itself and cannot be 0 because a can’t be a zero divisor. This leaves us with one possible conclusion, that aβ‹…a=b and similarly bβ‹…b=a. Hence, our multiplication table for F is:
β‹…01ab00000101aba0ab1b0b1a
We leave it to the reader to verify that [F;+,β‹…], as described above, is a field. Hence, we have produced a field of order 4. This construction would be difficult to repeat for larger fields. In section 16.4 we will introduce a different approach to constructing fields that will be far more efficient.
Even though not all finite fields are isomorphic to Zp for some prime p, it can be shown that every field F must have either:
  • a subfield isomorphic to Zp for some prime p, or
  • a subfield isomorphic to Q.
One can think of all fields as being constructed from either Zp or Q.

Example 16.2.8.

[R;+,β‹…] is a field, and it contains a subfield isomorphic to [Q;+,β‹…], namely Q itself.

Example 16.2.9.

The field F that we constructed in Example 16.2.7 has a subfield isomorphic to Zp for some prime p. From the tables, we note that the subset {0,1} of {0,1,a,b} under the given operations of F behaves exactly like [Z2;+2,Γ—2]. Hence, F has a subfield isomorphic to Z2.
We close this section with a brief discussion of isomorphic fields. Again, since a field is a ring, the definition of isomorphism of fields is the same as that of rings. It can be shown that if f is a field isomorphism, then f(aβˆ’1)=f(a)βˆ’1; that is, inverses are mapped onto inverses under any field isomorphism. A major question to try to solve is: How many different non-isomorphic finite fields are there of any given order? If p is a prime, it seems clear from our discussions that all fields of order p are isomorphic to Zp. But how many nonisomorphic fields are there, if any, of order 4, 6, 8, 9, etc? The answer is given in the following theorem, whose proof is beyond the scope of this text.
French stamp honoring Evariste Galois
Figure 16.2.11. French stamp honoring Evariste Galois
This theorem tells us that there is a field of order 22 = 4, and there is only one such field up to isomorphism. That is, all such fields of order 4 are isomorphic to F, which we constructed in the example above.

Exercises Exercises

1.

Write out the addition, multiplication, and β€œinverse” tables for each of the following fields’.
  1. [Z2;+2,Γ—2]
  2. [Z3;+3,Γ—3]
  3. [Z5;+5,Γ—5]

2.

Show that the set of units of the fields in Exercise 1 form a group under the operation of the multiplication of the given field. Recall that a unit is an element which has a multiplicative inverse.

4.

Write out the operation tables for Z22. Is Z22 a ring? An integral domain? A field? Explain.

5.

Determine all values x from the given field that satisfy the given equation:
  1. x+1=βˆ’1 in Z2 , Z3 and Z5
  2. 2x+1=2 in Z3 and Z5
  3. 3x+1=2 in Z5
Answer.
  1. 0 in Z2, 1 in Z3, 3 in Z5
  2. 2 in Z3, 3 in Z5
  3. 2 in Z5

6.

  1. Prove that if p and q are prime, then ZpΓ—Zq is never a field.
  2. Can Zpn be a field for any prime p and any positive integer nβ‰₯2?

7.

Determine all solutions to the following equations over Z2. That is, find all elements of Z2 that satisfy the equations.
  1. x2+x=0
  2. x2+1=0
  3. x3+x2+x+1=0
  4. x3+x+1=0
Answer.
  1. 0 and 1
  2. 1
  3. 1
  4. none

8.

Determine the number of different fields, if any, of all orders 2 through 15. Wherever possible, describe these fields via a known field.

9.

Let Q(2)={a+b2|a,b∈Q}.
  1. Prove that [Q(2);+,β‹…] is a field.
  2. Show that Q is a subfield of Q(2). For this reason, Q(2) is called an extension field of Q.
  3. Show that all the roots of the equation x2βˆ’4x+72=0 lie in the extension field Q(2).
  4. Do the roots of the equation x2βˆ’4x+3=0 lie in this field? Explain.
You have attempted 1 of 1 activities on this page.