Appendix a Construction of Real Numbers

Appendix a Construction of Real Numbers

Appendix A Construction of Real Numbers The purpose of this appendix is to give a construction of the field lR of real numbers from the field iQ of rational numbers which, we assume, is known to the reader. Let us point out that we did not give the axiomatic construction of the set N of natural numbers from which one can first construct the set Z of integers and, subsequently, the set iQ of rationals. These constructions may be found in most textbooks on abstract algebra, e.g., A Survey of Modern Algebra, by Birkhoff and MacLane [BM77]. Most authors use the so-called Dedekind Cuts to construct the set of real numbers from that of rational numbers. Since, however, the reader is now familiar with sequences and series, it is more natural to use Georg Cantor's method of construction, which is based on Cauchy sequences of rational numbers, and can be extended to more abstract situations. This abstraction, which is referred to as the completion of a metric space, was discussed in Chapter 5. We begin our discussion by introducing some notation and definitions. Notation. We recall that the set of rational numbers is denoted by iQ and the set of positive rationals by iQ+ = {r E iQ : r > O}. Also, the set of all sequences of rational numbers, i.e., the set of all functions from N to iQ, is denoted by iQN . Next, we define the Cauchy sequences of rational numbers. Although the def­ inition of Cauchy sequences was given earlier, since we have not yet constructed the set of real numbers, we must insist that the e > 0 in our definition take rational values only. Definition A.I (Cauchy Sequences in iQ). A sequence x E iQN is called a Cauchy sequence if the following holds: 532 Appendix A. Construction of Real Numbers The set of all Cauchy sequences in Q will be denoted by C. Next, we define null sequences in Q. Again, this was defined earlier, but we must be careful to use only rational e > 0 . Definition A.2 (Null Sequences in Q). A sequence x E ~ is called a null sequence if the following holds : The set of all null sequences in Q will be denoted by N. Remark. Note that N is precisely the set of all rational sequences that converge to zero, and that we obviously have N c C. (Why?) As we have seen, the set Q of rationals is dense in the set lR of real numbers, which we introduced axiomatically. It follows that each real number { is the limit of a (not unique) sequence (x n ) of rational numbers. It is tempting, therefore, to take such a sequence (x n ) as the definition of the real number {. The non­ uniqueness of (x n ) poses a problem, however, for two such sequences in fact represent the same {. This motivates the following definition. Definition A.3 (Equivalent Cauchy Sequences). We say that two Cauchy sequences x , y E C are equivalent, and write x 'V y, if and only if x - yEN. Exercise A.!. Show that the relation 'V is indeed an equivalence relation on the set C. Notation. For each sequence x E C, its equivalence class is denoted by [x], and, we recall, is defined by [z] = {y E C: y 'V x}. The set of all equivalence classes of elements of C is denoted by C/N. Definition A .4 (Real Number). The set R of real numbers is defined to be lR := C/N. Thus { is a real number if {= [xl for some x E C. The sequence x E C is then called a representative of {. Clearly, if x and y both represent {, then x-yEN. Exercise A.2. (1) Show that a Cauchy sequence in Q is bounded. (2) Show that C is closed under addition and multiplication; i.e., 'rIx , y E C, we have x + y, xy E C. (3) Show that N is an ideal in C; i.e., it is closed under addition and satisfies the stronger condition that 'rIx E Nand 'rIy E C we have xy E N. Hints: For the addition, use an c/2-argument. For the multiplication, use the inequalities IXmYm - xnYnl ~ IYmllxm - xnl + IxnllYm - Ynl ~ Blxm - xnl + AIYm - Ynl, for some constants A, BE Q+ , where the second inequality follows from part (1). Definition A.5 (Addition, Subtraction, Multiplication). Let { = [xl and "I = [y] be any real numbers. We define { + "I, -"I, {- "I, and {"I (or { . "I) as follows: (1) {+ "I := [x + y], (2) -"I := [-y], (3) { - "I := { + (-"I) = [x - y], and (4) {"I := [xy]. Appendix A. Construction of Real Numbers 533 Exercise A.a. Show that the definitions of e + 11 and e11 are independent of the representatives x and y of e and 11, respectively. In other words, show that, if x rv x' and y rv s', then we have x + y rv x' + y' and xy rv x'y'. Hint: You will need arguments similar to those needed in Exercise A.2. Proposition A.I (Ring Properties of R). The set R of real numbers is a commutative ring with identity. In other words, for all real numbers e, 11, and (, we have (1) e + 11 = 11 + e, (2) (e + 11) + ( = e + (11 + (), (9) 30 ER with 0 +e= e, (4) 3 - eE R with e+ (-e) = 0, (5) e11 = TJe, (6) (eTJ)( = e(TJ(), (7) 3 1 E R, 1 =1= 0, with 1 . e= e, and (8) e(TJ +() = eTJ + e(· Proof. The proofs of these properties are straightforward. For example, to prove (2), note that if e= [x], TJ = [y], and ( = [z], then (e +TJ)+( = [(x+y) +z], while e+(TJ+() = [x+(y+z)]. Since we obviously have (x+y)+z = x+(y+z) in C, (2) follows. Note that the additive identity ("0" in (3)) is in fact 0 = [(0,0,0, .. )] E N, and that the multiplicative identity ("I" in (7)) is 1 = [(1,1,1, )]. Also, 1 =1= 0 is obvious, because the sequences (0,0,0, . .. ) and (1,1,1, ) are not equivalent. 0 Proposition A.2. Let ¢ : Q -t R be defined by ¢(r) = [(r, r, r, .. )]. Then ¢ is an injective "ring homomorphism". In other words, ¢ is a one-to-one map satisfying ¢(r + s) = ¢(r) + ¢(s), ¢(rs) = ¢(r)¢(s), ¢(O) = 0, and ¢(1) = 1, Vr, SEQ. Exercise A.4. Prove Proposition A.2. Remarks. By Proposition A.2, the map ¢ is a field isomorphism of Q onto its image ¢(Q) C Rj i.e., a one-to-one correspondence between Q and ¢(Q) that preserves all the algebraic properties of Q. Therefore, we henceforth identify the two sets and, by abuse of notation, will write Q = ¢(Q) CR. Based on this identification, the field Q of rational numbers becomes a subfield of the field R of real numbers. Here , by a field we mean a set F together with two operations "+" of addition and «.» of multiplication, i.e., two maps + : (x, y) t---+ X + y and· : (x, y) t---+ z . y, from F x F to F, satisfying the nine (algebraic) axioms (Ai - A4' M i - M 4 , D) stated for real numbers in section 1 of Chapter 2. Proposition A.l only shows that R is a commutative ring with identity. To prove that R is actually a field, the only property we need to check is the existence of reciprocals for nonzero real numbers [cf, Axiom (M4) at the beginning of Chapter 2). To this end, we shall need the following Proposition A.a. Let ebe a nonzero element ofR. Then, there exists a rational number r E Q+ and a representative z E C ofesuch that, either X n ;::: r "In E N or Xn $ -r "In EN. 534 Appendix A. Construction of Real Numbers Proof. Let Y EC be a representative of {. Since { i= 0, the sequence (Yn) is not equivalent to (O, 0, 0, ... ) and we have (3c E Q+){'tIN E N){3n ~ N)(lYn - 01 ~ c). On the other hand, (Yn) E C implies that (3K E N)(m, n ~ K ~ IYm - Ynl < c/2). Now, by (*), we can find k ~ K such that \Ykl ~ c. Changing {to -{, if necessary, we may assume that Yk ~ c. Therefore, using (**), Let X n := c/2 for n < K, and X n = Yn for n ~ K. It is then clear that { = [(xn)), and that, with r := c/2, we have X n ~ r for all n E N. 0 Definition A.6 (Positive and Negative Cauchy Sequences). We say that a sequence x E C is positive (resp., negative) if it satisfies the first (resp., second) alternative in Proposition A.3. The set of all positive (resp., negative) sequences in C is denoted by C+ (resp. , C-). Remarks. It is obv ious that the two alternatives in Proposition A.3 are mutually exclusive; i.e., that C+ n C- = 0. Moreover, the cond ition in the first (and hence also second) alternative needs only be satisfied ultimately; i.e., it can be replaced by (3r E Q+)(3N E N)(n ~ N ~ X n ~ r) . Indeed, one can always replace x by the equivalent sequence x' defined by x~ := r 'tIk < N, and x~ := Xk 'tIk ~ N. Proposition A.4. We have C = C+ u N u C- , where the union is disjoint. In other words, {C+,N,C-} is a partition ojC. Proof. This is an obvious consequence of Proposition A.3. 0 We are now going to prove that lR is indeed a field.

View Full Text

Details

  • File Type
    pdf
  • Upload Time
    -
  • Content Languages
    English
  • Upload User
    Anonymous/Not logged-in
  • File Pages
    29 Page
  • File Size
    -

Download

Channel Download Status
Express Download Enable

Copyright

We respect the copyrights and intellectual property rights of all users. All uploaded documents are either original works of the uploader or authorized works of the rightful owners.

  • Not to be reproduced or distributed without explicit permission.
  • Not used for commercial purposes outside of approved use cases.
  • Not used to infringe on the rights of the original creators.
  • If you believe any content infringes your copyright, please contact us immediately.

Support

For help with questions, suggestions, or problems, please contact us