# All the Same Opposites

###### Editor’s note: see this appendix for supporting proofs.

Fields are among the most convenient algebraic structures, preserving much of the arithmetic we know and love from familiar fields like the rationals \mathbb{Q} and the real numbers \mathbb{R}.

Now, it is unnecessary that a set possess infinitely many elements to possibly constitute a field (under the right binary operations). Indeed, Dr. Rachel Traylor recently invited readers to finite field theory by way of GF(4), the field with four elements. In this post, I propose to discuss the simplest of all possible fields, namely \text{GF}(2).

## What *is *\text{GF}(2)?

As Dr. Traylor explains in her post on GF(4), a *field* is built via a nonempty set \mathbb{F} and two binary operations, typically denoted + and \cdot when no further specifying is needed. Speaking abstractly, \text{GF}(2) is the case when \mathbb{F} is taken to be any set of two elements, say, \{a,b\}, satisfying the operation tables below^{1}.

+ | a | b |

a | a | b |

b | b | a |

\cdot | a | b |

a | a | a |

b | a | b |

## So, what makes \text{GF}(2) simplest?

Briefly put, there is no field with fewer elements than has \text{GF}(2). Why is this so? The operations + and \cdot each require an identity element, and these must be distinct. As a result, any field must contain *at least* two elements. And, as it happens, those are enough to define a fully-fledged field.

As it is the most basic of fields, it might be expected that \text{GF}(2) is only trivially interesting, or only appears in coverage of the subject on the theoretical front. (No judgment here; sometimes the simplest examples of structures are illustrative of very little. See the trivial topology or trivial algebra of sets on a set X.) However, \text{GF}(2) is the mathematical representation of many dualities we encounter on a daily basis. We will take a look at some of the prominent cases.

## Even & Odd

Let’s denote by {\bf e} and {\bf o} arbitrarily chosen even and odd integers, respectively. *Truly, in this way, we are defining two equivalence classes on the set of integers, \mathbb{Z}, by way of modulo 2 addition.*

Reminder, we say an integer m is **even** to mean there exists an integer k such that m=2k, and m is **odd** to mean there exists an integer j such that m=2j+1. Collect these in a set: \{{\bf e},{\bf o}\}, and consider this set under ordinary addition + and multiplication \cdot .

These results are summarized in tables. For instance, in the + table below, we can think of {\bf e}+{\bf o} as

(2k)+(2j+1)=2(k+j)+1\equiv{\bf o},since k+j is also an integer.

+ | {\bf e} | {\bf o} |

{\bf e} | {\bf e} | {\bf o} |

{\bf o} | {\bf o} | {\bf e} |

\cdot | {\bf e} | {\bf o} |

{\bf e} | {\bf e} | {\bf e} |

{\bf o} | {\bf e} | {\bf o} |

From these tables, {\bf e} serves as additive identity for the field, and {\bf o} the multiplicative identity.

## Binary

Even more readily encountered than even and odd is binary arithmetic. We have a series of posts here on the theory of coding, and all of it rests on \{0,1\} when taken with the operations of +_2 (addition modulo 2) and \cdot .

+_2 | 0 | 1 |

0 | 0 | 1 |

1 | 1 | 0 |

\cdot | 0 | 1 |

0 | 0 | 0 |

1 | 0 | 1 |

The similarities to the tables for (\{{\bf e},{\bf o}\},+,\cdot) are evident. With binary, 0 is the additive (modulo 2) identity, and 1 is the multiplicative identity. This seems to follow naturally. After all, 0 is an even integer, and 1 is an odd integer, so these elements are easily believed to work alike. With that in mind, I move to an example with a less immediate connection.

## Truth & Falsehood

Now I want to consider the set \{{\bf T},{\bf F}\} of truth values^{2} true and false, respectively.

It is worthwhile to stop and think on which *operations* make sense for this set. Two are needed to construct a field. Just as even and odd integers may be combined by adding and multiplying, mathematical statements may be combined via disjunction (“or,” \vee), conjunction (“and,” \wedge), and implication (“if, then,” \Rightarrow). For this case, I am interested in the special “exclusive or,” also called XOR^{3}, denoted by \oplus, and conjunction.

\oplus | {\bf F} | {\bf T} |

{\bf F} | {\bf F} | {\bf T} |

{\bf T} | {\bf T} | {\bf F} |

\wedge | {\bf F} | {\bf T} |

{\bf F} | {\bf F} | {\bf F} |

{\bf T} | {\bf F} | {\bf T} |

## Opposite… in Precisely the Same Way

The only thing setting these examples apart is an exchange of symbols. Truly,

a, {\bf e}, 0, and {\bf F},

are interchangeable, just as are

b, {\bf o}, 1, and {\bf T}.

What matters is that these individual elements *behave *in **exactly the same way** with respect to their operations. In the language of algebra, it is said

(\{a,b\},+,\cdot),

(\{{\bf e},{\bf o}\},+,\cdot),

(\{0,1\},+_2,\cdot), and

(\{{\bf F},{\bf T}\},\oplus,\wedge)

are *isomorphic*, that is, structurally equivalent.

Definition (Isomorphism of fields).We say two fields(\mathbb{F},+,\times)and(\mathbb{H},\boxplus,\boxtimes)areisomorphicto mean there exists a function\varphi\mathrel{:}\mathbb{F}\to\mathbb{H}such that\varphiis one-to-one, onto, and, for allx,y\in\mathbb{F},\varphi(x+y)=\varphi(x)\boxplus\varphi(y);\quad\varphi(x\times y)=\varphi(x)\boxtimes\varphi(y).

In the case of \text{GF}(2), proving isomorphism amounts to simply defining the function that swaps the symbols as needed. For example, to show (\{{\bf e},{\bf o}\},+,\cdot) and (\{0,1\},+_2,\cdot) are isomorphic, define^{4}\varphi\mathrel{:}\{{\bf e},{\bf o}\}\to\{0,1\} by putting \varphi({\bf e})=0 and \varphi({\bf o})=1.

## Concluding Remarks

Mathematics in many respects is the art^{5} of extension and generalization. The goal is frequently to take an existing object, assume an aerial viewpoint to learn its structure and what makes it work. (This is often carried out by seeing how few pieces of the whole are really needed to accomplish those key characteristics.)

With the right perspective, even these sets of opposites can bear likeness. I take comfort in that.

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

#### Footnotes

- For proof that the triple ({
*a*,*b*}, +, ·) with + and · defined as in the tables satisfies all requirements of a field, see appendix. This is perhaps the easiest case proven exhaustively. - This is the lingo used when discussing formal mathematical logic. Shortly, a mathematical statement must be either true or false, cannot be both, and cannot be neither.
- Similar to the linguistic usage, where “Option A XOR Option B” means “either Option A or Option B, but not both, and not neither”.
- I encourage all readers to prove this function is an isomorphism by definition. The curious may find full proof in the appendix attached.
- And purest science, by the way.