In this script, we define the rational numbers and show that they form an ordered field. At the end of this script, we show that any ordered field contains a canonical copy of the rational numbers.
Definition 7.1. Let . We define a relation on as:
Lemma 7.2. The relation is reflexive. That is, for every .
Lemma 7.3. The relation is symmetric. That is, if , then .
Lemma 7.4. The relation is transitive. That is, if and , then .
Remark 7.5. A relation on any set that is reflexive, symmetric, and transitive is called an equivalence relation. Thus, the preceding lemmas show that is an equivalence relation on .
Remark 7.6. A partition of a set is a collection of non-empty disjoint subsets whose union is the original set. Any equivalence relation on a set creates a partition of that set by collecting into subsets all of the elements that are equivalent (related) to each other. When the partition of a set arises from an equivalence relation in this manner, the subsets are referred to as equivalence classes.
Remark 7.7. If we think of the set as representing the collection of all fractions whose denominators are not zero, then the relation may be thought of as representing the equivalence of two fractions.
Definition 7.8. As a set, the rational numbers, denoted , are the equivalence classes in the set under the equivalence relation . If , we denote the equivalence class of this element as . Thus,
Definition 7.9. We define addition and multiplication in as follows. If and are in , then:
We use the notation and to represent addition and multiplication in so as to distinguish these operations from the usual addition and multiplication in .
Theorem 7.10. Addition in is well-defined. That is, if and , then
Theorem 7.11. Multiplication in is well-defined. That is, if and , then
Theorem 7.12. The rational numbers satisfy axiom FA1 for fields.
Theorem 7.13. The rational numbers satisfy axiom FA2 for fields.
Theorem 7.14. The rational numbers satisfy axiom FA3 for fields, where the additive identity is the element .
Theorem 7.15. The rational numbers satisfy axiom FA4 for fields, where the additive inverse of the element is given by .
Theorem 7.16. The rational numbers satisfy axiom FA5 for fields.
Theorem 7.17. The rational numbers satisfy axiom FA6 for fields.
Theorem 7.18. The rational numbers satisfy axiom FA7 for fields, where the multiplicative identity is the element .
Theorem 7.19. The rational numbers satisfy axiom FA8 for fields, where the multiplicative inverse of the element is given by .
Theorem 7.20. The rational numbers satisfy axiom FA9 for fields.
Theorem 7.21. The rational numbers satisfy axiom FA10 for fields.
Remark 7.22. Thus, the rational numbers with and form a field.
Next, we define an ordering on .
Definition 7.23. Let . Assuming in , we say that if and only if . Note that we use the symbol to denote our ordering relation in so as to distinguish it from the usual ordering in . Note also that, given an element in , it is always possible to choose a representative with .
Theorem 7.24. Ordering in is well-defined. That is, if and , then
Theorem 7.25. The relation is an ordering on the rational numbers .
Theorem 7.26. The rational numbers form an ordered field.
There is an important sense in which every ordered field contains a "copy" of the rational numbers. Let be an ordered field with additive identity and multiplicative identity . To prevent ambiguity, denote the additive identity in the rational numbers by and the multiplicative identity in the rational numbers by .
Theorem 7.27. Any ordered field contains a copy of the rational numbers in the following sense. There exists an injective map that respects all of the axioms for an ordered field. In particular:
Since we know that is an ordered field, this result says that is the "minimal" ordered field.