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 and are both examples of ordered fields.
Definition 6.1. A binary operation on a set is a function
We say that is associative if:
We say that is commutative if:
An identity element of a binary operation is an element such that:
Remark 6.2. Frequently, we denote a binary operation differently. If is the binary operation, we often write in place of . We sometimes indicate this same operation by writing .
Examples 6.3.#
- The function which sends a pair of integers to is a binary operation on the integers, called addition. Addition is associative, commutative and has identity element .
- The maximum of and , denoted , is an associative and commutative binary operation on . Is there an identity element for ?
- Let be the power set of a set . Recall that the power set consists of all subsets of . Then the intersection of sets, , defines an associative and commutative binary operation on . Is there an identity element for ?
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.
Exercise 6.5. Let be a finite set, and let . Consider the binary operation of composition of functions, denoted and defined by . Decide whether or not composition is commutative and/or associative and whether or not it has an identity.
Associative not commutative, =
Theorem 6.6. Identity elements are unique. That is, suppose that is a binary operation on a set that has two identity elements and . Then .
Definition 6.7. A field is a set with two binary operations on called addition, denoted , and multiplication, denoted , satisfying the following field axioms:
- FA1 (Commutativity of Addition): For all , .
- FA2 (Associativity of Addition): For all , .
- FA3 (Additive Identity): There exists an element such that for all .
- FA4 (Additive Inverses): For any , there exists such that .
- FA5 (Commutativity of Multiplication): For all , .
- FA6 (Associativity of Multiplication): For all , .
- FA7 (Multiplicative Identity): There exists an element such that for all .
- FA8 (Multiplicative Inverses): For any such that , there exists such that .
- FA9 (Distributivity of Multiplication over Addition): For all , .
- FA10 (Distinct Additive and Multiplicative Identities): .
Exercise 6.8. Consider the set , and define binary operations and on by:
Show that is a field.
Theorem 6.9. Suppose that is a field. Then additive and multiplicative inverses are unique. This means:
- Let . If satisfy and , then .
- Let . If satisfy and , then .
We usually write for the additive inverse of and or for the multiplicative inverse of .
Corollary 6.10. If , then .
Corollary 6.11. If and , then .
Theorem 6.12. Let be a field, and let . If , then .
Theorem 6.13. Let be a field, and let . If and , then .
Theorem 6.14. Let be a field. If , then .
Theorem 6.15. Let be a field, and let . If , then or .
Next, we discuss the notion of an ordered field.
Definition 6.16. An ordered field is a field equipped with an ordering such that:
- Addition respects the ordering: if , then for all .
- Multiplication respects the ordering: if and , then .
Definition 6.17. Suppose is an ordered field and . If , we say that is positive. If , we say that is negative.
For the remaining theorems, assume is an ordered field.
Lemma 6.18. If , then . Similarly, if , then .
Lemma 6.19. If , then .
Lemma 6.20. If , then .
Lemma 6.21. If , then .
Theorem 6.23. If is an ordered field, then has no first or last point.