<< Chapter < Page | Chapter >> Page > |
Next, we discuss the set $Q$ of rational numbers, which we ordinarily think of as quotients $k/n$ of integers. Of course, we do not allow the “second” element $n$ of the quotient $k/n$ to be 0. Also, we must remember that there isn't a 1-1 correspondence between the set $Q$ of all rational numbers and the set of all such quotients $k/n.$ Indeed, the two distinct quotients $2/3$ and $6/9$ represent the same rational number. To be precise, the set $Q$ is a collection of equivalence classes of ordered pairs $(k,n)$ of integers, for which the second component of the pair is not 0. The equivalence relation among these ordered pairs is this:
We will not dwell on this possibly subtle definition, but will rather accept the usual understanding of the rational numbers and their arithmetic properties. In particular, we will represent them as quotients rather than as ordered pairs, and, if $r$ is a rational number, we will write $r=k/n,$ instead of writing $r$ as the equivalence class containing the ordered pair $(k,n).$ As usual, we refer to the first integer in the quotient $k/n$ as the numerator and the second (nonzero) integer in the quotient $k/n$ as the denominator of the quotient. The familiar definitions of sum and product for rational numbers are these:
and
Addition and multiplication of rational numbers satisfy the three basic algebraic relations of commutativity, associativity and distributivity stated earlier.
We note that the integers $Z$ can be identified in an obvious way as a subset of the rational numbers $Q.$ Indeed, we identify the integer $k$ with the quotient $k/1.$ In this way, we note that $Q$ contains the two numbers $0\equiv 0/1$ and $1\equiv 1/1.$ Notice that any other quotient $k/n$ that is equivalent to $0/1$ must satisfy $k=0,$ and any other quotient $k/n$ that is equivalent to $1/1$ must satisfy $k=n.$ Remember, $k/n\equiv {k}^{\text{'}}/{n}^{\text{'}}$ if and only if $k{n}^{\text{'}}={k}^{\text{'}}n.$
The set $Q$ has an additional property not shared by the set of integers $Z.$ It is this: For each nonzero element $r\in Q,$ there exists an element ${r}^{\text{'}}\in Q$ for which $r\times {r}^{\text{'}}=1.$ Indeed, if $r=k/n\ne 0,$ then $k\ne 0,$ and we may define ${r}^{\text{'}}=n/k.$ Consequently, the set $Q$ of all rational numbers is what is known in mathematics as a field.
A field is a nonempty set $F$ on which there are defined two binary operations, addition ( $+$ ) and multiplication ( $\times $ ), such that the following six axioms hold:
REMARK. There are many examples of fields. (See [link] .) They all share certain arithmetic properties, which can be derived from the axioms above. If $x$ is an element of a field $F,$ then according to one of the axioms above, we have that $1\times x=x.$ (Note that this “1” is the multiplicative identity of the field $F$ and not the natural number 1.) However, it is tempting to write $x+x=2\times x$ in the field $F.$ The “2” here is not à priori an element of $F,$ so that the equation $x+x=2\times x$ is not really justified. This is an example of a situation where a careful recursive definition can be useful.
If $x$ is an element of a field $F,$ define inductively elements $n\xb7x\equiv nx$ of $F$ by $1\xb7x=x,$ and, if $k\xb7x$ is defined, set $(k+1)\xb7x=x+k\xb7x.$ The set $S$ of all natural numbers $n$ for which $n\xb7x$ is defined is therefore, by the axiom of mathematical induction, all of $N.$
Usually we will write $nx$ instead of $n\xb7x.$ Of course, $nx$ is just the element of $F$ obtained by adding $x$ to itself $n$ times: $nx=x+x+x+...+x.$
Let $F$ be any field. Verify that the following arithmetic properties hold in $F.$
Let $F$ be a field, and let $x$ be a nonzero element of $F.$
For each natural number $n,$ we define inductively an element ${x}^{n}$ in $F$ as follows: ${x}^{1}=x,$ and, if ${x}^{k}$ is defined, set ${x}^{k+1}=x\times {x}^{k}.$ Of course, ${x}^{n}$ is just the product of $n$ $x$ 's.
Define ${x}^{0}$ to be $1.$
For each natural number $n,$ define ${x}^{-n}$ to be the multiplicative inverse ${\left({x}^{n}\right)}^{-1}$ of the element ${x}^{n}.$
Finally, we define ${0}^{m}$ to be 0 for every positive integer $m,$ and we leave ${0}^{-n}$ and ${0}^{0}$ undefined.
We have therefore defined ${x}^{m}$ for every nonzero $x$ and every integer $m\in Z.$
Let $F$ be a field. Derive the following laws of exponents:
From now on, we will indicate multiplication in a field by juxtaposition; i.e., $x\times y$ will be denoted simply as $xy.$ Also, we will use the standard fractional notation to indicate multiplicative inverses. For instance,
Notification Switch
Would you like to follow the 'Analysis of functions of a single variable' conversation and receive update notifications?