We will formalize the notions of addition and multiplication in structures called fields. A field with a compatible order is called an ordered field. We will see that Q\mathbb{Q} and R\mathbb{R} are both examples of ordered fields.

Definition 6.1. A binary operation on a set XX is a function

f:X×X⟶X.f: X \times X \longrightarrow X.

We say that ff is associative if:

f(f(x,y),z)=f(x,f(y,z))for all x,y,z∈X.f(f(x,y),z) = f(x,f(y,z)) \qquad \text{for all } x,y,z \in X.

We say that ff is commutative if:

f(x,y)=f(y,x)for all x,y∈X.f(x,y) = f(y,x) \qquad \text{for all } x,y \in X.

An identity element of a binary operation ff is an element e∈Xe \in X such that:

f(x,e)=f(e,x)=xfor all x∈X.f(x,e) = f(e,x) = x \qquad \text{for all } x \in X.

Remark 6.2. Frequently, we denote a binary operation differently. If ∗:X×X⟶X*: X \times X \longrightarrow X is the binary operation, we often write a∗ba * b in place of ∗(a,b)*(a,b). We sometimes indicate this same operation by writing (a,b)↦a∗b(a,b) \mapsto a * b.

Examples 6.3.#

  1. The function +:Z×Z⟶Z+: \mathbb{Z} \times \mathbb{Z} \longrightarrow \mathbb{Z} which sends a pair of integers (m,n)(m,n) to +(m,n)=m+n+(m,n) = m + n is a binary operation on the integers, called addition. Addition is associative, commutative and has identity element 00.
  2. The maximum of mm and nn, denoted max⁡(m,n)\max(m,n), is an associative and commutative binary operation on Z\mathbb{Z}. Is there an identity element for max⁡\max?
  3. Let P(Y)P(Y) be the power set of a set YY. Recall that the power set consists of all subsets of YY. Then the intersection of sets, (A,B)↦A∩B(A,B) \mapsto A \cap B, defines an associative and commutative binary operation on P(Y)P(Y). Is there an identity element for ∩\cap?

Exercise 6.4. Find a binary operation on a set that is not commutative. Find a binary operation on a set that is not associative.

A∖BA\setminus B

Exercise 6.5. Let XX be a finite set, and let Y={f:X⟶X∣f is bijective}Y = \{f: X \longrightarrow X \mid f \text{ is bijective}\}. Consider the binary operation of composition of functions, denoted ∘:Y×Y⟶Y\circ: Y \times Y \longrightarrow Y and defined by (f∘g)(x)=f(g(x))(f \circ g)(x) = f(g(x)). Decide whether or not composition is commutative and/or associative and whether or not it has an identity.

Associative not commutative, ee=f:x→xf:x\to x

Theorem 6.6. Identity elements are unique. That is, suppose that ff is a binary operation on a set XX that has two identity elements ee and e′e'. Then e=e′e = e'.

Definition 6.7. A field is a set FF with two binary operations on FF called addition, denoted ++, and multiplication, denoted ⋅\cdot, satisfying the following field axioms:

  • FA1 (Commutativity of Addition): For all x,y∈Fx,y \in F, x+y=y+xx + y = y + x.
  • FA2 (Associativity of Addition): For all x,y,z∈Fx,y,z \in F, (x+y)+z=x+(y+z)(x + y) + z = x + (y + z).
  • FA3 (Additive Identity): There exists an element 0∈F0 \in F such that x+0=0+x=xx + 0 = 0 + x = x for all x∈Fx \in F.
  • FA4 (Additive Inverses): For any x∈Fx \in F, there exists y∈Fy \in F such that x+y=y+x=0x + y = y + x = 0.
  • FA5 (Commutativity of Multiplication): For all x,y∈Fx,y \in F, x⋅y=y⋅xx \cdot y = y \cdot x.
  • FA6 (Associativity of Multiplication): For all x,y,z∈Fx,y,z \in F, (x⋅y)⋅z=x⋅(y⋅z)(x \cdot y) \cdot z = x \cdot (y \cdot z).
  • FA7 (Multiplicative Identity): There exists an element 1∈F1 \in F such that x⋅1=1⋅x=xx \cdot 1 = 1 \cdot x = x for all x∈Fx \in F.
  • FA8 (Multiplicative Inverses): For any x∈Fx \in F such that x≠0x \neq 0, there exists y∈Fy \in F such that x⋅y=y⋅x=1x \cdot y = y \cdot x = 1.
  • FA9 (Distributivity of Multiplication over Addition): For all x,y,z∈Fx,y,z \in F, x⋅(y+z)=x⋅y+x⋅zx \cdot (y + z) = x \cdot y + x \cdot z.
  • FA10 (Distinct Additive and Multiplicative Identities): 1≠01 \neq 0.

Exercise 6.8. Consider the set F2={0,1}\mathbb{F}_2 = \{0,1\}, and define binary operations ++ and ⋅\cdot on F2\mathbb{F}_2 by:

0+0=0,0+1=1,1+0=1,1+1=0,0⋅0=0,0⋅1=0,1⋅0=0,1⋅1=1.\begin{aligned} 0+0 &= 0, \quad 0+1 = 1, \quad 1+0 = 1, \quad 1+1 = 0,\\ 0\cdot0 &= 0, \quad 0\cdot1 = 0, \quad 1\cdot0 = 0, \quad 1\cdot1 = 1. \end{aligned}

Show that F2\mathbb{F}_2 is a field.

Theorem 6.9. Suppose that FF is a field. Then additive and multiplicative inverses are unique. This means:

  1. Let x∈Fx \in F. If y,y′∈Fy, y' \in F satisfy x+y=0x + y = 0 and x+y′=0x + y' = 0, then y=y′y = y'.
  2. Let x∈Fx \in F. If y,y′∈Fy, y' \in F satisfy x⋅y=1x \cdot y = 1 and x⋅y′=1x \cdot y' = 1, then y=y′y = y'.

We usually write −x-x for the additive inverse of xx and x−1x^{-1} or 1x\frac{1}{x} for the multiplicative inverse of xx.

Corollary 6.10. If x∈Fx \in F, then −(−x)=x-(-x) = x.

Corollary 6.11. If x∈Fx \in F and x≠0x \neq 0, then (x−1)−1=x(x^{-1})^{-1} = x.

Theorem 6.12. Let FF be a field, and let a,b,c∈Fa,b,c \in F. If a+b=a+ca + b = a + c, then b=cb = c.

Theorem 6.13. Let FF be a field, and let a,b,c∈Fa,b,c \in F. If a⋅b=a⋅ca \cdot b = a \cdot c and a≠0a \neq 0, then b=cb = c.

Theorem 6.14. Let FF be a field. If a∈Fa \in F, then a⋅0=0a \cdot 0 = 0.

Theorem 6.15. Let FF be a field, and let a,b∈Fa,b \in F. If a⋅b=0a \cdot b = 0, then a=0a = 0 or b=0b = 0.

Next, we discuss the notion of an ordered field.

Definition 6.16. An ordered field is a field FF equipped with an ordering << such that:

  • Addition respects the ordering: if x<yx < y, then x+z<y+zx + z < y + z for all z∈Fz \in F.
  • Multiplication respects the ordering: if 0<x0 < x and 0<y0 < y, then 0<x⋅y0 < x \cdot y.

Definition 6.17. Suppose FF is an ordered field and x∈Fx \in F. If 0<x0 < x, we say that xx is positive. If x<0x < 0, we say that xx is negative.

For the remaining theorems, assume FF is an ordered field.

Lemma 6.18. If 0<x0 < x, then −x<0-x < 0. Similarly, if x<0x < 0, then 0<−x0 < -x.

Lemma 6.19. If a,b∈Fa,b \in F, then a⋅(−b)=−(a⋅b)=(−a)⋅ba \cdot (-b) = -(a \cdot b) = (-a) \cdot b.

Lemma 6.20. If a,b∈Fa,b \in F, then a⋅b=(−a)⋅(−b)a \cdot b = (-a) \cdot (-b).

Lemma 6.21. If x∈Fx \in F, then 0≤x20 \leq x^2.

Corollary 6.22. 0<10 < 1.

Theorem 6.23. If FF is an ordered field, then FF has no first or last point.