Definition 16.2.1. Field.
A field is a commutative ring with unity such that each nonzero element has a multiplicative inverse.
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 \(a x = b\text{,}\) \(a \neq 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 \(a x = b\text{,}\) \(a \neq 0\text{.}\) We summarize the above in a definition and list theorems that will place this concept in the context of the previous section.
In this chapter, we denote a field generically by the letter \(F\text{.}\) The letters \(k\text{,}\) \(K\) and \(L\) are also conventionally used for fields.
Example 16.2.2. Some common fields.
The most common infinite fields are \([\mathbb{Q}; +, \cdot ]\text{,}\) \([\mathbb{R}; +, \cdot ]\text{,}\) and \([\mathbb{C}; +, \cdot ]\text{.}\)
Remark 16.2.3.
Since every field is a ring, all facts and concepts that are true for rings are true for any field.
Theorem 16.2.4. Field \(\Rightarrow\) Integral Domain.
Every field is an integral domain.
Proof.
The proof is fairly easy and a good exercise, so we provide a hint. Starting with the assumption that \(a\cdot b= 0\) if we assume that \(a \neq 0\) then the existence of \(a^{-1}\) makes it possible to infer that \(b=0\text{.}\)
Of course the converse of Theorem 16.2.4 is not true. Consider \([\mathbb{Z}; +, \cdot ]\text{.}\) However, the next theorem proves the converse in finite fields.
Theorem 16.2.5. Finite Integral Domain \(\Rightarrow\) Field.
Every finite integral domain is a field.
Proof.
We leave the details to the reader, but observe that if \(D\) is a finite integral domain, we can list all elements as \(a_1, a_2, \ldots, a_n\text{,}\) where \(a_1=1\text{.}\) Now, to show that any \(a_i\) has a multiplicative inverse, consider the \(n\) products \(a_i \cdot a_1, a_i \cdot a_2, \ldots, a_i \cdot a_n\text{.}\) What can you say about these products?
If \(p\) is a prime, \(p\mid (a\cdot b) \Rightarrow p\mid a \textrm{ or } p\mid b\text{.}\) An immediate implication of this fact is the following corollary.
Corollary 16.2.6.
If p is a prime, then \(\mathbb{Z}_p\) is a field.
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 \(\mathbb{Z}_p\) , \(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\}\text{.}\) Since there are only two nonisomorphic groups of order 4, we have only two choices for the group table for \([F; +]\text{.}\) If the additive group is isomorphic to \(\mathbb{Z}_4\) then two of the nonzero elements of \(F\) would not be their own additive inverse (as are 1 and 3 in \(\mathbb{Z}_4\)). Let’s assume \(\beta \in F\) is one of those elements and \(\beta +\beta =\gamma \neq 0\text{.}\) An isomorphism between the additive groups \(F\) and \(\mathbb{Z}_4\) would require that \(\gamma\) in \(F\) correspond with 2 in \(\mathbb{Z}_4\text{.}\) We could continue our argument and infer that \(\gamma \cdot \gamma =0\text{,}\) 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 \(\mathbb{Z}_2{}^2\text{:}\)
\begin{equation*}
\begin{array}{c|cccc}
+ & 0 & 1 & a & b \\
\hline
0 & 0 & 1 & a & b \\
1 & 1 & 0 & b & a \\
a & a & b & 0 & 1 \\
b & b & a & 1 & 0 \\
\end{array}
\end{equation*}
Next, since 1 is the unity of \(F\text{,}\) the partial multiplication table must look like:
\begin{equation*}
\begin{array}{c|cccc}
\cdot & 0 & 1 & a & b \\
\hline
0 & 0 & 0 & 0 & 0 \\
1 & 0 & 1 & a & b \\
a & 0 & a & - & - \\
b & 0 & b & - & - \\
\end{array}
\end{equation*}
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\text{.}\) If \(a^{-1} = a\text{,}\) then \(b^{-1}=b\text{.}\) (Why?) But \(a^{-1} = a \Rightarrow a \cdot a = 1\text{.}\) And if \(a \cdot a = 1\text{,}\) then \(a \cdot b\) is equal to \(a\) or \(b\text{.}\) In either case, by the cancellation law, we obtain \(a = 1\) or \(b = 1\text{,}\) which is impossible. Therefore we are forced to conclude that \(a^{-1} = b\) and \(b^{-1} = a\text{.}\) To determine the final two products of the table, simply note that, \(a \cdot a \neq a\) because the equation \(x^2=x\) has only two solutions, 0 and 1 in any field. We also know that \(a\cdot 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 \cdot a = b\) and similarly \(b \cdot b = a\text{.}\) Hence, our multiplication table for \(F\) is:
\begin{equation*}
\begin{array}{c|cccc}
\cdot & 0 & 1 & a & b \\
\hline
0 & 0 & 0 & 0 & 0 \\
1 & 0 & 1 & a & b \\
a & 0 & a & b & 1 \\
b & 0 & b & 1 & a \\
\end{array}
\end{equation*}
We leave it to the reader to verify that \([F; +, \cdot ]\text{,}\) 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 \(\mathbb{Z}_p\) for some prime \(p\text{,}\) it can be shown that every field \(F\) must have either:
-
a subfield isomorphic to \(\mathbb{Q}\text{.}\)
One can think of all fields as being constructed from either \(\mathbb{Z}_p\) or \(\mathbb{Q}\text{.}\)
Example 16.2.8.
\([\mathbb{R}; +, \cdot]\) is a field, and it contains a subfield isomorphic to \([\mathbb{Q}; +, \cdot]\text{,}\) namely \(\mathbb{Q}\) itself.
Example 16.2.9.
The field \(F\) that we constructed in Example 16.2.7 has a subfield isomorphic to \(\mathbb{Z}_p\) for some prime \(p\text{.}\) From the tables, we note that the subset \(\{0, 1\}\) of \(\{0, 1, a, b\}\) under the given operations of \(F\) behaves exactly like \(\left[\mathbb{Z}_2; +_2,\times _2\right]\text{.}\) Hence, \(F\) has a subfield isomorphic to \(\mathbb{Z}_2\text{.}\)
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\left(a^{-1} \right) = f(a)^{-1}\text{;}\) 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 \(\mathbb{Z}_p\text{.}\) 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.
Theorem 16.2.10.
-
Any two fields of order \(p^n\) are isomorphic.
Historical Aside: Galois.
French stamp honoring Evariste Galois
This theorem tells us that there is a field of order \(2^2\textrm{ = 4}\text{,}\) and there is only one such field up to isomorphism. That is, all such fields of order 4 are isomorphic to \(F\text{,}\) which we constructed in the example above.
Exercises Exercises
1.
Write out the addition, multiplication, and “inverse” tables for each of the following fields’.
-
\(\displaystyle \left[\mathbb{Z}_2; +_2, \times _2\right]\)
-
\(\displaystyle \left[\mathbb{Z}_3; +_3, \times _3\right]\)
-
\(\displaystyle \left[\mathbb{Z}_5; +_5, \times _5\right]\)
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.
3.
Complete the proof of Theorem 16.2.5 that every finite integral domain is a field.
4.
Write out the operation tables for \(\mathbb{Z}_2{}^2\text{.}\) Is \(\mathbb{Z}_2{}^2\) a ring? An integral domain? A field? Explain.
5.
Determine all values \(x\) from the given field that satisfy the given equation:
6.
-
Prove that if \(p\) and \(q\) are prime, then \(\mathbb{Z}_p \times \mathbb{Z}_q\) is never a field.
-
Can \(\mathbb{Z}_p{}^n\) be a field for any prime \(p\) and any positive integer \(n \geq 2\text{?}\)
7.
Determine all solutions to the following equations over \(\mathbb{Z}_2\text{.}\) That is, find all elements of \(\mathbb{Z}_2\) that satisfy the equations.
-
\(\displaystyle x^2 + x = 0\)
-
\(\displaystyle x^2 + 1 = 0\)
-
\(\displaystyle x^3 + x^2 + x + 1 = 0\)
-
\(\displaystyle x^3 + x + 1 = 0\)
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 \(\mathbb{Q}\left(\sqrt{2}\right) = \left\{\left.a + b\sqrt{2}\right| a, b \in \mathbb{Q}\right\}\text{.}\)
-
Prove that \(\left[\mathbb{Q}\left(\sqrt{2}\right); +, \cdot \right]\) is a field.
-
Show that \(\mathbb{Q}\) is a subfield of \(\mathbb{Q}\left(\sqrt{2}\right)\text{.}\) For this reason, \(\mathbb{Q}\left(\sqrt{2}\right)\) is called an extension field of \(\mathbb{Q}\text{.}\)
-
Show that all the roots of the equation \(x^2 - 4x+\frac{7}{2} = 0\) lie in the extension field \(\mathbb{Q}\left(\sqrt{2}\right)\text{.}\)
-
Do the roots of the equation \(x^2 -4 x+ 3 = 0\) lie in this field? Explain.
You have attempted of activities on this page.
