RICHARD R. GOLDBERG The University of lowa SECOND EDITION JOHN WILEY & SONS, Inc. New York London Sydney TorontoCopyright © 1976, by John Wiley & Sons, Inc. Copyright 1964, Ginn and Company (Xerox Corporation) A\ll rights reserved. Published simultaneously in Canada. No part of this book may be reproduced by any means, nor transmitted, nor translated into a machine language with- out the written permission of the publisher. Library of Congress Cataloging in Publication Data: Goldberg, Richard R. Methods of real analysis. Includes index. 1, Functions of real variables. 2, Mathemati- cal analysis. I. Title. QA331.5.G58 1976 515'.8 75-30615 ISBN 0-471-31065-4 Printed in the United States of America 10987654321PREFACE This book is intended as a one-year course for students who have completed an ordinary sequence of courses in elementary calculus. It presents in rigorous fashion basic material on the fundamental concepts and tools of analysis—functions, limits, continu- ity, derivatives and integrals, sequences, and series. Most of the difficult points usually glossed over in elementary courses are dealt with in detail, as well as many more advanced topics designed to give a good background for (and, hopefully, a taste of) modern analysis and topology. In particular, there are treatments of metric spaces and Lebesgue integration, topics that are often reserved for more advanced courses. Also included are many smaller but interesting topics not usually presented in courses at this level; these topics include Baire category and discontinuous functions, summability of series, the Weierstrass theorem on approximation of continuous functions by poly- nomials, and a proof of the standard existence theorem for differential equations from the point of view of fixed-point theory. The book is written at the same level as texts for traditional “advanced calculus” courses, but does not consider topics in “several variables.” Material on differentials and vector calculus, in our opinion, can be understood best from the point of view of modern differential geometry and belong in a separate course. REMARKS ON THE SECOND EDITION Many changes in, additions to, and some deletions from the first edition have been made in accordance with thoughtful criticism from many colleagues at large and small institutions. A major feature of this new edition is the addition of sections called “Notes and Additional Exercises,” which include a variety of material. There are famous theorems related to the material in the body of the text—for example, the Schréder-Bernstein theorem from set theory, the Tietze extension theorem from topology, and Stone’s generalization of the Weierstrass approximation theorem. The proofs are given in outline only, with a great deal left to the student as exercises. In these new sections there are alsovi PREFACE miscellaneous exercises (many of which are quite challenging) and an occasional histori- cal note. An instructor’s solutions manual for the problems in the new material can be obtained from the author. I also added an appendix that contains an axiomatic treatment of the real number system. This was a compromise between no treatment at all in the first edition and a lengthy development from basic principles that I think would retard the reader’s progress into the core of the book. All the assumptions about the real numbers and the necessary results that can be derived from these assumptions are carefully presented. There are a number of pictorial illustrations—also a departure from the first edition— and new exercises in many of the chapters, and new proofs. Richard R. GoldbergCONTENTS Introduction: Assumptions and Notations 1. Sets and functions Wl, 1.2 1.3. 1.4, 1.5. 1.6. 17. Sets and elements Operations on sets Functions Real-valued functions Equivalence, countability Real numbers Least upper bounds 2. Sequences of real numbers 2.1, ee 2.3. 2.4, 2.5. 2.6. 2.7. 2.8. 2.9. 2.10. 2a Definition of sequence and subsequence Limit of a sequence Convergent sequences Divergent sequences Bounded sequences Monotone sequences Operations on convergent sequences Operations on divergent sequences Limit superior and limit inferior Cauchy sequences Summability of sequences 27 7 33 35 37 38 4 47 48 54 58CONTENTS 2.12. Limit superior and limit inferior for sequences of sets Series of real numbers 3.1. Convergence and divergence 3.2. Series with nonnegative terms 3.3. Alternating series 3.4. Conditional convergence and absolute convergence 3.5. Rearrangements of series 3.6. Tests for absolute convergence 3.7. Series whose terms form a nonincreasing sequence 3.8. Summation by parts 3.9. (C,1) summability of series 3.10. The class /? 3.11. Real numbers and decimal expansions 3.12, Notes and additional exercises for Chapters 1, 2, and 3 Li its and metric spaces 4.1, Limit of a function on the real line 4.2. Metric spaces 4.3. Limits in metric spaces Continuous functions on metric spaces 5.1, Functions continuous at a point on the real line 5.2. Reformulation 5.3. Functions continuous on a metric space 5.4. Open sets 5.5. Closed sets 5.6. Discontinuous functions on R! 5.7. The distance from a point to a set Connectedness, completeness, and compactness 6.1. More about open sets 6.2. Connected sets 6.3, Bounded sets and totally bounded sets 6.4. Complete metric spaces 6.5. Compact metric spaces 65 68 68 70 73 74 77 81 87 92 94 97 108 108 108 118 121 126 126 129 132 134 138 143 146 148 148 149 153 156 16010. CONTENTS 6.6. Continuous functions on compact metric spaces 6.7. Continuity of the inverse function 6.8. Uniform continuity 6.9. Notes and additional exercises for Chapters 4, 5, and 6 Ceficulus Sets of measure zero Defi Existence of the Riemann integral ion of the Riemann integral 7.4. Properties of the Riemann integral 7.5. Derivatives 7.6. Rolle's theorem 7.7. The law of the mean 7.8. Fundamental theorems of calculus 7.9. Improper integrals 7.10. Improper integrals (continued) The elementary functions. Taylor series 8.1. Hyperbolic functions 8.2. The exponential function 8.3. The logarithmic function. Definition of x° 8.4. The trigonometric functions 8.5. Taylor's theorem 8.6. The binomial theorem 8.7. L'Hospital’s rule Sequences and series of functions 9.1. Pointwise convergence of sequences of functions Uniform convergence of sequences of functions 9. 9.4. Convergence and uniform convergence of series of functions Consequences of uniform convergence 9.5, Integration and differentiation of series of functions 9.6. Abel summability 9.7. Acontinuous, nowhere-differentiable function Three famous theorems 10.1. The metric space C[a,b] 163 166 167 171 179 179 180 186 188 193 203 205 au 218 224 224 226 228 230 235 242 245 252 252 255 260 264 268 271 277 280 28012. CONTENTS. 10.2. 10.3. 10.4. 10.5. The Weierstrass approximation theorem Picard existence theorem for differential equations The Arzela theorem on equicontinuous families Notes and additional exercises for Chapters 9 and 10 The Lebesgue integral Wal, 11.2, 11.3. 11.4, 11.5. 11.6, M7. 11.8, 11.9. Length of open sets and closed sets Inner and outer measure. Measurable sets Properties of measurable sets Measurable functions Definition and existence of the Lebesgue integral for bounded functions Properties of the Lebesgue integral for bounded measurable functions The Lebesgue integral for unbounded functions Some fundamental theorems The metric space £?[a,5). 11,10, The integral on (— 00, 00) and in the plane Fourier series Defi n of Fourier series Formulation of convergence problems The (C, 1) summability of Fourier series The ©? theory of Fourier series Convergence of Fourier series Orthonormal expansions in £?[a,b] Notes and additional exercises for Chapters 11 and 12 Appendix: The algebraic and order axioms for the real numbers Special Symbols Index 283 287 290 292 299 299 302 305 311 315 321 328 336 341 348 373 380 388 395 399INTRODUCTION ASSUMPTIONS AND NOTATIONS A. The book does not begin with an extended development of the real numbers. However, the reader who wishes to proceed in strictly logical order should first digest the basic definitions and theorems about sets and functions in Sections 1.1 through 1.3, and then turn to the Appendix for the algebra and order axioms of the reals and the theorems on arithmetic and inequalities that are derived from those axioms. After the Appendix the reader should go to Section 1.7 where the least upper bound axiom is presented. At this point the reader will have seen a careful treatment of all the basic assumptions about the reals. Anyone choosing this approach may skip now to paragraph Cc. B. There are some who feel, however, that it is preferable at first to be less formal about the real numbers so that the reader can get to the meat of the book more quickly. From this point of view it is better to delay reading the Appendix and simply proceed directly through the main body of the text. For those who wish to take this approach we mention briefly some facts about the reals. An integer is a “whole number.” Thus 6,0, —3 are integers. A rational number is a real number that can be expressed as a quotient of integers. Thus 3/2 and —9/276 are rational numbers. Any integer k is thus a rational number since we may write k=k/1. An irrational number is a real number that is not a rational number. For example, a solution to the equation x?=2 must be an irrational number. The reader should have some facility in handling inequalities. He should know that if x-and y are real nuibers and x—y. Also, if O0 we define |x| to be x. For x <0 we define |x| to be — x. Finally we define {0|=0. Thus for any real numbers x, |x| is the “numerical value” of x. We call |x| the absolute value of x. By considering various cases according to the sign of x and of y, the reader should have no difficulty in proving the immensely important results Ix+ylO and for rational values of x and y. In Chapter 8 we define a* for any real number x and then prove the familiar laws of exponents for arbitrary exponents. The notations a'/? and Va both mean the positive square root of a. (The existence of a positive square root for any positive number is presented in exercise 8 of Section 6.2.) D. Here are some notations. If @ and b are real numbers with a< 5, we denote by (a,b) the set of all real numbers x such that aa. By (—00,a) we mean the set of all real x with x |x>0, y >0}—the ser of all points (x,y) such that x is nonnegative and y is nonnegative. Similarly, [0, 1]={x|0< x <1). DEFINITION. If 6 is an element of the set A, we write b€ A. If b is not an element of A, we write bZ A. Thus a€ {a,b,c} but d@{a,b,c}. As another illustration, suppose we define a base- ball team as the set of its players and define the American League to be the set of its twelve member teams. Then, in the notations we have just introduced, American League = {A’s, Tigers, ..., Rangers}, A’s= {Jackson, Bando, A’s€ American League, Jackson € A’s. Campaneris},4 SETS AND FUNCTIONS Note that the elements of the American League are themselves sets, which illustrates the fact that a set can be an element of another set. Note also that although Jackson plays in the American League, he is not an element of the American League as we have defined it. Hence Jackson American League. Exercises 1.1 1, Describe the following sets of real numbers geometrically: A={x|x<7), B=(x||x|>2), C= {x||x|=1). 2. Describe the following sets of points in the plane geometrically: A=(|x+y=2}. 3. Let P be the set of prime integers. Which of the following are true? (a) 7EP. (b) 9EP. () lee. (d) 7,547,193-65,317€ P. 4, Let A= (1,2, (3}, (4,5}}. Are the following true or false? (a) led. (b) 3E4. How many elements does A have? 1.2 OPERATIONS ON SETS In grammar-school arithmetic the “elementary operations” of addition, subtraction, multiplication, and division are used to make new numbers out of old numbers—that is, to combine two numbers to create a third. In set theory there are also elementary operations—union, intersection, complementation—which correspond, more or less, to the arithmetic operations of addition, multiplication, and subtraction. 1.2A. DEFINITION. If 4 and B are sets, then A U B (read “A union B” or “the union of A and B”) is the set of all elements in either A or B (or both). Symbolically, AUB={x|xEA or xEB}. Thus if A={1,2,3}, B=({3,4,5}, qa) then AU B=({1,2,3,4,5). 1,.2B. DEFINITION. If A and B are sets, then AM B (read “A intersection B” or “the intersection of A and B”) is the set of all elements in both A and B. Symbolically, ANB={x|xEA and xEB}.1,2 OPERATIONS ON SETS 5 Thus if A,B are as in (1) of Section 1.2A, then 4 4 B= (3}. (Note the distinction between {3} and 3. Since A B is the set whose only element is 3, to be consistent we must write AM B= {3}. This distinction is rarely relevant, and we often ignore it.) See Figure 1. When A and B are sets with no elements in common, 4 / B has nothing in it at all. We would still like, however, to call AM B a set. We therefore make the following definition. FIGURE 1. 1.2C. DEFINITION. We define the empty set (denoted by @) as the set which has no elements. Thus {1,2} {3,4}=@. Moreover, for any set A we have AU@=A and ANG=O (verify!). 1.2D. DEFINITION. If A and B are sets, then B—A (read “B minus A”) is the set of all elements of B which are not elements of A. Symbolically, B-A={x|x€B,x@A). Thus if A,B are as in (1) of Section 1.2A, B— A = {4,5}. See Figure 2. There are relations for sets that correspond to the < and > signs in arithmetic. We now define them. FIGURE 2. 1.2E. periniTION. If every element of the set A is an element of the set B, we write ACB (read “A is contained in B” or “A is included in B”) or BD A (read “B contains A”). If ACB, we say that A is a subset of B. A proper subset of B is a subset A CB such that 4 + B. (See Figure 3.)6 ‘SETS AND FUNCTIONS ACB FIGURE 3. Thus if A={1,67}, B={1,3,6,7,8), C= {2,3,4,5,...,100}, ay then ACB but BC (even though C has 99 elements and B has only 5), Also @C D and D CD for any set D. 1.2F. DEFINITION. We say that nwo sets are equal if they contain precisely the same elements. Thus A= B if and only if AC B and BCA (verify!). Note that for B and C in (1) of 1.2E, none of the relations B CC,C C B,C=B hold. 1.2G. It is often the case that all sets A,B,C,... in a given discussion are subsets of a “big” set S. Then S—A is called the complement of A (relative to S), the phrase in parentheses sometimes being omitted. For example, the set of rational numbers is the complement of the set of irrational numbers (relative to the reals). When there is no ambiguity as to what S is we write S—A=A’. Thus A” [meaning (4’)'] is equal to A. Moreover, S= A UA". See Figure 4. We now prove our first theorem. 12H. THEOREM. If A,B are subsets of S, then (AUB) =A4'nB’ Q) FIGURE 4.1.2 OPERATIONS ON SETS 7 and (An BY =4'UB". (2) These equations are sometimes called De Morgan’s laws. PRooF: If x€(AU BY’, then x@AUB. Thus x is an element of neither A nor B so that x@A’ and xB’. Thus x€A’n B’. Hence (AU BY’ CA’ B’. Conversely, if ye A'NB’, then yEA’ and y@B’, so that yZA and y@B. Thus yZAUB, and so » (AU BY’. Hence A’n B’C(AU BY. This establishes (1). Equation (2) may be proved in the same manner or it can be deduced from (1) as follows: In (1) replace A,B by A’,B’ respectively, so that A’, B’ are replaced by A” =A and B” = B. We obtain (4’U B'Y = 417 B. Now take the complement of both sides. Exercises 1.2 1. Let A be the set of letters in the word “trivial,” A = {a,i,/,r,t,0}. Let B be the set of letters in the word “difficult.” Find AU B,A M B,A — B,B— A. If S is the set of all 26 letters in the alphabet and A’= S— A,B — B, find A’, B’,A’n B’. Then verify that A'n B’=(AUBY. . For the sets A,B,C in Exercise | of Section 1.1, describe geometrically 4M B, BN GANC. . Do the same for the sets A,B,C of Exercise 2 of Section 1.1. 4. For any sets A,B,C prove that (AUB)UC=AU(BUC). This is an associative law for union of sets and shows that AU BU C may be written without parentheses. 5. Prove; for any sets A,B,C, that (AN B)nC=An(BC). This is an associative law for intersection of sets. 6. Prove the distributive law AN(BUC)=(ANB)U(ANC). v e See Figure 5. FIGURE 5. AN(BUC)=(AN B)U(ANC) 7. Prove (AUB)-(AnB)=(4-B)U(B—A).8 SETS AND FUNCTIONS 2 . True or false (that is, prove true for all sets A, B,C, or give an example to show false): (a) (AUB)—C=AU(B-C). (b) (AUB)—A=B. (c) (AN B)U(BNC)U(ANC)=AN BNC. (d) (AUB)NC=AU(BNC). 9. True or false: (a) If ACB and BCC, then ACC. (b) If ACC and BCC, then AUBCC. (©) [0,1]5@,1). @) {x|1x]>4}0 Oly1> 4)= (lll > 4). 1.3. FUNCTIONS 1.3A. In the cruder calculus texts we see the following definition: “If to each x (in a set S) there corresponds one and only one value of y, then we say that y is a function of x.” This “definition,” although it embodies the essential idea of the function concept, does not conform to our purpose of keeping undefined terms to a minimum. (What does “correspond” mean?) In other places we see a function defined as a graph. Again, this is not suitable for us since “graph” is as yet undefined. However, since a plane graph (intuitively) is a certain kind of set of points, and each point is (given by) a pair of numbers, this will lead us to an acceptable definition of function in Section 1.3C. 1.3B. DEFINITION. If A,B are sets, then the Cartesian product of A and B (denoted AX B) is the set of all ordered pairs* (a,b) where aA and bE B. Thus the Cartesian product of the set of real numbers with itself gives the set of all ordered pairs of real numbers. We usually call this last set the plane (after we define the distance between pairs). See Figure 6. The lateral surface of a right circular cylinder can be regarded as the Cartesian product of a line segment and a circle. (Why?) We are now in a position to define function. 1.3C. DEFINITION. Let A and B be any two sets. A function f from (or on) A into Bis a subset of A X B (and hence is a set of ordered pairs ) with the property that each aA belongs to precisely one pair (a,b). Instead of (x,y) Ef we usually write y = f(x). Then y is called the image of x under f. The set A is called the domain of f. The range of f is the set {b€ B|b=f(a) for some a}. That is, the range of f is the subset of B consisting of all images of elements of 4. Such a function is sometimes called a mapping of A into B. If CCB, then f-\(C) is defined as {a€A|f(a)EC}, the set of all points in the domain of f whose images are in C. If C has only one point in it, say C= { y}, we usually write f~'(y) instead of f~'({y}). The set f~!(C) is called the inverse image of C under f. (Note that no definition has been given for the symbol f~! by itself.) If DCA, then f(D) is defined as { f(x)|x € D }. The set f(D) is called the image of D under f. Consider Figure 7. The dots at the beginning of the arrows denote points in the domain of f. Thus the statement f(a) = b is pictured by an arrow starting at a and ending *To keep the record clear we had better define “ordered pair.” What is needed is a set with a and & mentioned in an asymmetrical fashion. How about defining (a,b) to be ((a),(a,b}}?A FIGURE 6. The Cartesian product of two intervals FIGURE 7. Diagram of a function f from A into B10 SETS AND FUNCTIONS at b. According to the definition of function, no two distinct arrows may begin at any a&A, but two (or more) may end at some b€ B. We should think of f as sending points of A to points of B. Note that f(a)=f(c)=b so that f~'(b)= {a,c}. If a function has domain and range both consisting of real numbers, then we can use the familiar method of graphing the function in the x-y plane. It is often possible to infer a good deal of information from such a graph. However, for understanding basic concepts about functions such as limit and continuity, a diagram like that in Figure 7 often is more helpful than an x-y graph. For example, the set f= {B. If the range of fis all of B, we say that f is a function from A onto B. In this case we sometimes write f:A=B. Thus if f(x) = x?(— 00 B and if XC B,Y CB, then SKA) =fL XS). In words, the inverse image of the intersection of two sets in the intersection of the inverse images. PROOF: The proof is left as an exercise. The last two results concerned inverse images. Here is one about images. 13G. THEOREM. If f:A—>B and X CA,Y CA, then S(XUY)=f(~)Us(Y). In words, the image of the union of two sets is the union of the images. pRooF: If bE f(X UY), then b=f(a). for some a€X UY. Either a€X or aE, Thus either bE f(X) or bE f(Y). Hence b €f(X)Uf(Y) which shows f(X U Y)Cf(X)U f(Y). Conversely, if cE f(X)Uf(Y) then either cE f(X) or cE f(Y). Then c is the image of some point in X or c is the image of some point in Y. Hence c is the.image of some point in XU Y, that is cE f(X U Y). So f(X)UF(Y)C/(X U Y). 1.3H. Conspicuously absent from this list of results is the relation S(XAY)=f(X)NF(Y) forX CA,YCA. Prove that this relation need not hold. 1.31. DEFINITION (THE COMPOSITION OF FUNCTIONS). If f:4—>B and g:B->C, then we define the function gef by gef(x)=g[f(x)] (xe A).12 ‘SETS AND FUNCTIONS That is, the image of x under gef is defined to be the image of f(x) under g. The function gef is called the composition of f with g. [Some people write g(f) instead of af] Thus gef:A—C. For example, if S(x)=1+sinx (-2Y. If ACX,BCX, show that f(A)-f(B)C f(A — B).- wv 2 1.3 FUNCTIONS 13 Let S(x)=logx — (0B,g: B>C,h: CD, prove that he(gef)=(heg)es.14 SETS AND FUNCTIONS 13. For which of the following pairs of functions f and g is g an extension of f? (x)= 1(0< x<00), (©) f(x)=sinx(0< x <2n), g(x)= V1—cos?x (0 R, we call f a real-valued function. If x€A, then f(x) (heretofore called the image of x under f) is also called the value of f at x. We now define the sum, difference, product, and quotient of real-valued functions. 14B. DEFINITION. If f:A—>R and g:A—R, we define f+ g as the function whose value at xEA is equal to f(x)+g(x). That is, (Ft s\(x)=f(x)+8(x) — (*EA). In set notation f+ a= (Cus (x)+8(x))|xE4}- It is clear that f+ g:A—>R. Similarly, we define f— g and fg by (f-s\(*)=f(x)-8(x) (x EA), (f()=fx) (x) (xEA). Finally, if g(x)#0 for all x € A, we can define f/g by (Z)o-28 wea. The sum, difference, product, and quotient of two real-valued functions with the same domain are again real-valued functions. What permits us to define the sum of two real-valued functions is the fact that addition of real numbers is defined. In general, if f:A—>B,g:A->B, there is no way to define f+ g unless there is a “plus” operation in B. 14C. perinition. If f:A—>R and c is a real number (cE R), the function of is defined by (Ax)=elf(x)] (EA). Thus the value of 3f at x is 3 times the value of f at x. 14D. For a,b real numbers let max(a,b) denote the larger and min(a,b) denote the smaller of a and 6. [If a=6, then max(a,b)=min(a,b)=a=6.] Then we can define max(f,g) and min(f,g) for real-valued functions f,g. DEFINITION. If f:A>Rig:A—R, then max( fg) is the function defined by max(f,g)(x)=max[f(x),g(x)] (x€A),1.4 REAL-VALUED FUNCTIONS. 15 and min(f,g) is the function defined by min(f,g)(x)=min[f(x),8(x)]_ (x), Thus if f(x)=sinx(0< x < 7/2),g(x)=cosx(0< x < 7/2) and h=max(f,g), then h(x)=cosx (0R, then || is the function defined by I@)=lF@) (EA). If a,b are real numbers, the formulae —bltatb max(a,b) = Letbe ans : . —|a—b|+at+b min(a,b)= ——5-—— , are easy to verify. (Do so.) From them follow immediately the formulae lf-al+f+g max(f,g)= a Fi —altftg min(f,g)= eee > for real-valued functions fg. 1.4E. In this section we consider sets which are all subsets of a “big” set S. If ACS, then A’=S—A (Section 1.2G). For each A C'S we define a function x, as follows. DEFINITION. If ACS, then x, (called the characteristic function of A) is defined as xu(x)=1 (x A), xu(x)=0 9 (xed’). The reason for the name “characteristic function” is obvious—the set A is char- acterized (completely described) by x4. That is, A = B if and only if x,= xp. The reader should verify the following useful equations for characteristic functions where A,B are subsets of S. Xaus=MAX(X4Xe)> qQ) Xan p= MiN(X4)Xp)= XaXar Xa-p=Xa-Xe (provided BCA), Xa = 1 Xa" xs=h, Xg=O0F . But either xEA For example, to establish (1), suppose x €4U B. Then X4u 9(x)= * We are using | here to denote the real-valued function whose value at each x € S is equal to the number | (that is, here I is the “function identically 1”). Thus the symbol I has two different meanings—one a number, the other a function. The reader will be able to tell from the context which meaning to assign. + The 0 denotes the function identically 0.16 SETS AND FUNCTIONS or x € B (or both), and so either x4(x)=1 or xp(x)=1. Thus max(x4,xp)(x)= 1. Hence T=X4ua(x)=max(xpXxe(x) (XEAUB) (2) If xZAUB, then xX4.,(x)=0. But x A’n B’ by (I) of Section 1.2H and hence x4’ and x € B’ so that x4(x)=0=xp(x). Thus max(x4.x—)(x)=0. Hence O=X4ua(x)=Max(X4Xe)(x) — (XFAUB). (3) Equation (1) now follows from (2) and (3). Exercises 1.4 1. Let f(x)=2x(— 00 B and f is 1-1, then the function f~' (called the inverse function for f) is defined as follows: If f(a)=6, thenf-'(b)=a — (bin range of f). a) Thus the domain of f~' is the range of f and the range of f~' is A (the domain of f). The1.5 EQUIVALENCE; COUNTABILITY 7 definition of the function f~' is consistent with the definition of inverse image in Section 13C, For if f is 1-1 and f(a)=6, then the inverse image of {6} is {a}. That is, J7"({b}))= {a}. If we omit the braces, we obtain (1). . For example, if g(x)=x'(0< x <0o), then g~'(x)= Vx (0<.x< 00). For, if b=g(a) =a’, then a= Vb =g~\(b). Also, if h(x)=e*(— 00 B and f is 1-1, then f is called a 1-1 correspondence (between A and B). If there exists a 1-1 correspondence between the sets A and B, then 4 and B are called equivalent. Thus any two sets containing exactly seven elements are equivalent. The reader should not find it difficult to verify the following. 1, Every set A is equivalent to itself. 2. If A and B are equivalent, then B and A are equivalent. 3. If A and B are equivalent and B and C are equivalent, then A and C are equivalent. We shall see presently that the set of all integers and the set of all rational numbers are equivalent, but that the set of all integers and the set of all real numbers are not equivalent. First let us talk a little bit about “infinite sets.” 1.5D. The set A is said to be infinite if, for each positive integer n, A contains a subset with precisely n elements.* Let us denote by / the set of all positive integers— T=(1,2,...}- Then / is clearly an infinite set. The set R of all real numbers is also an infinite set. The reader should convince himself that if a set is not infinite, it contains precisely n elements for some nonnegative integer n. A set that is not infinite is called finite. It will be seen that there are many “sizes” of infinite sets. The smallest size is called countable. 1.SE DEFINITION. The set A is said to be countable (or denumerable) if A is equivalent to the set / of positive integers. An uncountable set is an infinite set which is not countable. Thus A is countable if there exists a 1-1 function f from J onto A. The elements of A are then the images f(1),f(2),..., of the positive integers— (A=(F(DofQo}s {where the (i) are all distinct from one another]. “If n is a positive integer, then the statement “B has n elements” means “B is equivalent to the set (2,0)18 SETS AND FUNCTIONS Hence, saying that 4 is countable means that its elements can be “counted” (arranged with “labels” 1,2,...). Instead of f(1),f(2),..., we usually write a,,d),.... For example, the set of all integers is countable. For by arranging the integers as 0,-1,+1,-2,+2,..., we give a scheme by which they can be counted. [The last sentence is an imprecise but highly intuitive way of saying that the function f defined by n-l f(a 5 (n=1,3,5,...), f(= “bs is a 1-1 correspondence between / and the set of all integers. For f(1),f(2),... is the same as 0, ~1,1,—2,2,....] See Figure 9. This example shows that a set can be equivalent to a proper subset of itself. The same reasoning shows that if A and B are countable, then so is AU B. For A can be expressed as A ={a,,dy,...} and similarly B={b,,by,...}- Thus 41,0 1,y,3,45,byy--. 18 a scheme for “counting” the elements of AU B. (Of course, we must remove any b, which occurs among the a,’s so that the same element in AU B is not counted twice.) (n=2,4,6, FIGURE 9. Diagram of a 1-1 correspondence between the set of positive integers ‘and the set of all integers1.5. EQUIVALENCE; COUNTABILITY 9 The following theorem gives a much stronger result. L5F. THEOREM. If Aj,A3,... are countable sets, then* UA, is countable. In words, the countable union of countable sets is countable. proof: We may write 4,=(al,al,al,...},4,=(a3,a3,a3,...},-.4,= (at, ay,d3,.. oh so that af is the Ath element of the set 4). Define me height of aj to bej +k. Then a} is the only element of height 2; likewise a! and a? are the only elements of height 3; and so on. Since for any positive integer m > 2 there are only m—1 elements of height m, we may arrange (count) the elements of U*_,A, according to their height as 1 @alalalaial al,aalal,aaias,..., being careful to remove any af that has already been counted. Pictorially, we are listing the elements of U4, in the following array’ and counting them in the order indicated by the arrows: The fact that this counting scheme eventually counts every aj proves that U%.,A,, i countable. We obtain the following important corollary. 1.5G. corottary. The set of all rational numbers is countable. PROOF: The set of all rational numbers is the union U%.,E, where E, is the set of rationals which can be written with denominator n. That is, E,={0/n,—1/n,1/n,—2/ n,2/n,...}. Now each E, is clearly equivalent to the set of all integers and is thus countable. (Why?) Hence the set of all rationals is the countable union of countable sets. Apply 1.5F. It seems clear that if we can count the elements of a set we can count the elements of any subset. We make this precise in the next theorem. 15H. THEOREM. If B is an infinite subset of the countable set 4, then B is countable. PROOF: Let A={aj,a,...}. Then each element of B is an a,. Let , be the smallest subscript for which a,, € B, let n be the next smallest, and so on. Then B= (4,,,d,,.-..}- The elements of B are thus labeled with 1,2,..., and $0 B is countable. 1.51. COROLLARY. The set of all rational numbers in [0,1] is countable. PROOF: The proof follows directly from 1.5G and 1.5H. * We have not used the symbol U% ,4,'before. It means, of course, the set of all elements in at least one of the A,.20 SETS AND FUNCTIONS Exercises 1.5 1. Which of the following define a 1-1 function? (a) f(x) =e*(— B and g: BC and both f and g are 1-1, is g°f also 1-1? (b) If fis not 1-1, is it still possible that gef is 1-12 (c) Give an example in which f is 1-1, g is not 1-1, but gef is 1-1. 3. Let P, be the set of polynomial functions f of. degree n, R L(x) = agx"tayx" +++ $a, x +a,, where n is a fixed nonnegative integer and the coefficients ap,a,,...,a, are all integers. Prove that P,, is countable. (Hint: Use induction.) Prove that the set of all polynomial functions with integer coefficients is countable. . Prove that the set of all polynomial functions with rational coefficients is countable. (Hint: This can be done by retracing the methods used in the preceding two problems.) However, also try this: Every polynomial g with rational coefficients can be written g=(1/N)f where f is a polynomial with integer coefficients and N is a suitable positive integer. (Verify.) The set of all g that go with a given N is countable (by Exercise 4 of Section 1.5). Finish the proof. 6. We are assuming that every (nonempty) open interval (a,b) contains a rational (Introduction). Using this assumption, prove that every open interval contains infinitely many (and hence countably many) rationals. |. Show that the intervals (0,1) and [0,1] are equivalent. (Hint: Consider separately the rationals and irrationals in the intervals.) . Prove that any infinite set contains a countable subset. . Prove that if A is an infinite set and x € A, then A and A — {x} are equivalent. (This shows that any infinite set is equivalent to a proper subset. This property is often taken as the definition of infinite sets.) 10. Show that the set of all ordered pairs of integers is countable. 11. Show that if A and B are countable sets, then the Cartesian product A xX B is countable. 12. Prove that the family of all finite subsets of a countable set is itself countable. 13. (a) If fis a 1-1 function from 4 onto B, show that folef(xj=x (x A), and fof (y)=y (ye B). (b) If g:C—+4 and h=/feg, show that g=f~!eh. ye Pa 9 1.6 REAL NUMBERS This section is out of logical order. We shall not at this time define the terms “decimal expansion,” “binary expansion,” and so on; rather, we rely here on the reader’s experience and intuition. These terms, and the assumptions concerning them, are discussed carefully in Chapter 3. Insofar as the logical development of this book is concerned, this section could be ignored. Insofar as examples and understanding are concerned, however, this sqction should definitely not be ignored. We have not as yet given an example of an infinite set that is not countable. We shall soon see that the set R of all real numbers provides such an example.1.6 REAL NUMBERS 2 We shall assume that every real number x can be written in decimal expansion. x= bayayays + =b+ 4 Ey 10° 10 10° where the a, are integers, 0< a, <9. This expansion is unique except for cases such as x=} which can be expanded .500000--- and 4=0.49999---, Every number x €[0,1] can thus be expanded x=0.a,a)a3---. Conversely, we assume that every decimal of the form i= 2 b.ayayay* ++ is the decimal expansion for some real number. (We have not defined the real numbers. Hence we now take these relations between decimal expansion and real numbers as assumptions. As we presently show, however, they are consequences of the more basic axiom 1.7D,) 1.6A. THEOREM. The set [0, 1]={x|0< x < 1) is uncountable. PROOF: Suppose [0,1] were countable. Then (0, 1]={.x,x,,...} where every number in [0,1] occurs among the x,. Expanding each x, in decimals we have x,=O.alala}+- =0.a2a2a? x, =0.a?a3a3- +» O.afazag--- Let b, be any integer from 1 to 8 such that b, # aj. Then let b, be any integer from | to 8 such that b,#a3. In general, for each n=1,2,..., let 6, be any integer from 1 to 8 such that 6, #a,", Let y=0.b,b,-+-,-++. Then, for any'n, the decimal expansion for y differs from the decimal expansion for x, since b,%a,". Moreover, the decimal expansion for y is unique since no b, is equal to 0 or 9. Hence y#x, for every n. Since 0< y <1, this contradicts the assumption that every number in [0,1] occurs among the x;. This contradiction proves the theorem. 1.6.B. COROLLARY. The set R of all real numbers is uncountable. pRoor: By 1.5H, if R were countable, then [0,1] would be countable, contradicting 1.6A. Hence R is uncountable. Here is another proof of 1.6B. Suppose R were countable—R={x,,x3,...}. Let J, be the interval (x,—4,x, +4), let /, be the interval (x,—4,x,+ 4), and in general, for each positive integer n, let J, denote the interval (x,—2-"~',x, +27"~'). Then the length of /, is 2~" so the sum of the lengths of all the J, is 2-'+2-?+2-3+--- =1. But x,€/, so that R=U2.;(%,} CU4/,. But then the whole real line (whose length is infinite) would be covered by (contained in) a union of intervals whose lengths add up to 1. This seems to be a contradiction. Is it? 1.6C, In addition to decimal expansions it is useful to consider binary and ternary expansions for real numbers.22 SETS AND FUNCTIONS The binary expansion for a real number x uses only the digits 0 and 1. For example, O.ayayay: ++ means a,/2+a,/2?+ a;/2+--> so that $=0.10000--- (2), $=0.01000--- (2), £=0.00010--- (2), Bal+t+4=0.1101000--- (2), where the (2) denotes binary expansion. Similarly, the ternary expansion of a real x uses the digits 0,1,2. Thus X=0.b,26;--- (3) means by bz bs X37 py For example, 4$=0.1000-- G), 4$=0.0222- (3), F=011IL + 3), fea}4+4=0211--- (3). The ternary expansion for a real number x is unique except for numbers such as } with two expansions, one ending in a string of 2’s, the other in a string of 0's. 16D. The following set serves as a useful example later on. DEFINITION. The Cantor set K is the set of all numbers x in [0,1] which have a ternary expansion without the digit 1. Thus the numbers }=0.0222:-+ (3) and 3=0.20000--- (3) are in K, but any x such that }B and the range of f is uncountable, prove that the domain of f is uncountable. 2. Prove that if B is a countable subset of the uncountable set A, then A-—B is uncountable, 3. Prove that the set of all irrational numbers is uncountable. 4. If abe R and aL, then M cannot be a 1.u.b. for A since L is an u.b. and L < M. Similarly, no set can have more than one g.l.b. It is not at all obvious that a nonempty set A which is bounded above necessarily has a Lu.b. This is the subject of the least upper bound axiom to be given shortly. First we give some examples. If B=(4,3,...,"-1)/2",...}, then g.b.,c,x=4 and Lu.b.,<)x= 1. (Verify!) Note that the g.l.b. for B is an element of B but that the 1. for B is not an element of B. The set (3,4) (open interval) does not contain either its g.1.b. or its l.u.b., which are 3 and 4 respectively. The g.l.b. for J is 1. There is no 1.u.b, since J is not bounded above. The g.l.b. and the L.u.b. for {0} are both equal to 0. According to our definitions, the empty set @ is bounded since @C[M,N] for any interval [M,N]. Thus every number N ER is an u.b. for @ and so @ does not have a Lub. The following axiom would be a theorem if we were to develop set theory carefully and then construct the real numbers from the definition. Since we are not doing this we call it an axiom, 1,7D, LEAST UPPER BOUND AXIOM. If A is any nonempty subset of R that is bounded above, then A has a least upper bound in R. This axiom says roughly that R (visualized as a set of points on a line) has no holes in it. The set of all rational numbers does have holes in it. (That is, the 1.u.b. axiom does not hold if R is replaced by the set of all rationals.) For example, if A={1,14,141, 1.414,...}, then (in R) the Lu.b. for A is V2 which is not in the set of rationals. Thus if we had never heard of irrational numbers, we would say that A had no Lu.b. Our assumptions about the relation between real numbers and decimal expansions are consequences of the 1.u.b. axiom 1.7D. We show how to deduce them in the next chapter. The statement for g.l.b. corresponding to 1.7D need not be taken as an axiom. It can be deduced from 1.7D. 17E. THEOREM. If A is any nonempty subset of R that is bounded below, then A has a greatest lower bound in R. proor: Let BCR be the set of all xR such that — x EA. (That is, the elements of B are the negatives of the elements of 4.) If M is a lower bound for A, then — M is an upper bound for B. For if x€B, then —x€A and so M<—x,x<—M. Hence B is bounded above so that, by 1.7D, B has a l.u.b. If Q is the l.u.b. for B, then — Q is the g.lb. for A. (Verify.) One interesting consequence of the least upper bound axiom is the following result called the Archimedean property of the real numbers. 1.7F, THEOREM. If a and 6 are positive numbers, then there exists n€/J such that na > b. (Thus no matter how small a is or how large b is, there is an integral multiple of a that is greater than b.)26 ‘SETS AND FUNCTIONS PROOF: Let A={nalne1}. If the theorem were false, then b would be an upper bound for A. Hence by 1.7D, the set A would have a least upper bound. Let B=1.u.b.A. Then, since B is the feast upper bound, the number B~a is not an upper bound for A so that B—a,-..) contains only one element. That is, A= (2). The sequence (5,1, considered as a set (ince it is a function), has infinitely many elements. In set notation {5,)21= (4n,2>|[n 1). 2728 ‘SEQUENCES OF REAL NUMBERS sequence. (Try it.) In reading the next paragraph, use whatever intuitive idea of “subsequence” you have. If 51,53)... is a sequence, a subsequence is usually written s,,, 5,,...-. That is, from the original sequence we “keep” only those terms whose subscripts are 7,, n,,.... But these numbers n,, 7,... themselves form a subsequence of the sequence of positive integers 1, 2, 3,.... Thus we first define “subsequence of the sequence of positive integers” and then define subsequences of an arbitrary sequence of real numbers. 2.1C. DEFINITION. A subsequence N of {n}%_, (the sequence of positive integers) is a function from J (the set of positive integers) into / such that N()rk (ker). nt1 (N=1,3,5;.0)s 5 = » » a 2.2 LIMIT OF A SEQUENCE The concept of limit is one of the most important (and conceivably the most difficult) in analysis. In this section we define the limit of a sequence (function on ). Limits for other functions are discussed in the fourth chapter. Roughly speaking, the sequence {s,}%_, has the limit L if s,—L is “small” for all sufficiently large values of n. From this crude description, we would expect that the sequence 1,1, 1,.. aoe the limit 1, that the sequence 1,},4,..., has the limit 0, and the sequence 1, oo = , does not have a limit. We shall see oo our intuition in these cases is correct. In other cases, for example {nsin(7/n)}%_,, our intuition is not sharp enough to tell if a given sequence has a “limit” or to compute the “limit” if there is one. We need a precise definition of “limit of a sequence” and enough theorems about the definition to make computations easy. 2.2A. DEFINITION. Let {s,}2., be a sequence of real numbers. We say that 5, approaches the limit L (as n approaches infinity), if for every «>0 there is a positive integer N such that |y,—Ll). (1) If s, approaches the limit L we write tim 5,=L 5,>L (n+). Instead of ““s, approaches the limit L” we often say that the sequence {s,}%., has the limit L. We emphasize the fact that our definition requires that L be a real number. Thus lim,_,..5,= L means that for any ¢>0, the inequality |s,—L|0, of finding a value of N such that |s,-LlN). There is no need to find the smallest value of N for which (1) holds. If, for each ¢>0, any N for which (1) is true has been found, this proves lim, ,,.5,= L. Consider Figure 11. All of the s,, except for at most a finite number of n, must be inside the parentheses. s sya Snes Sue sys 2 L L i 4 i i il L-e L Lee FIGURE 11. Diagram of lim s,=L For example, consider the sequence 1,4,4,.... That is, consider (s,}%_, where 5,=1/n (n=1,2,...). We would naturally guess that this sequence has the limit L=0. Let us prove this. Given ¢>0 we must find N so that (1) holds. In this case (1) reads 1 ol), ce (n> N). 2) Thus if we choose N so that 1/NN. Now 1/N1/e. Hence if we take any NEJ such that N>I/e, then (1) will hold for this sequence {s,}%_, with L=0. This proves lim, _... |/n=0. Note that the limit 0 is not equal to any term of the sequence. Let us now examine the sequence {s,}%_, where s,=1 (n=1,2,...). We have pre- viously guessed that this sequence has the limit L=1. To prove this we note that 5,— L=1-1=0 so that for any e>0, |s,-Ll 1). Thus in this case, for any ¢>0 we can make (1) hold by taking N = 1. (This is one of the rare cases where N does not depend on e.) This proves lim, _,,. 1=1. For a third example, consider {s,}., where s,=n (n=1,2,...)—that is, consider the sequence 1,2,3,.... We shall prove this sequence does not have a limit. Assume the contrary. Then lim,,,.,5,= L for some L€ R. Then for any e there is an N for which (1) holds. In particular, for ¢=1 there is an N for which (1) holds: |s,-LI<1 (n> N). This is equivalent to —I) or —IN) or L-1N).2.2. LIMIT OF A SEQUENCE 31 The last statement says that all values of n greater than N lie between L—1 and L+1. This is clearly false and the contradiction shows that {s,}7_,={n}7.; does not have a limit. The last example shows that a sequence whose terms get “too big” cannot have a limit. This is not the only kind of sequence that does not have a limit. Consider the sequence {5,}2.1 where s,=(—1)" (n=1,2,...). The terms of this sequence are —1,1,—I,1,.... Suppose there were an LER for which lim,_,,,5,=L. Then for e=4 there would be an NEI such that (1) holds. That is, \-I"-L<$ (n>). @) For n even (3) says [I=L] <4, (4) while for n odd (3) says LI<. (5) Since |a— b] is the distance from a to 6, (4) implies that L is less than 4 unit away from 1, while (5) implies that L is less than } unit away from — 1. This is a contradiction. [To deduce a contradiction from (4) and (5) without geometry, reason as follows: The inequality (5) is equivalent to |1+ Z|<}. But then 2=[2|=|1+ 1]=|(1+L)+(1—L)[ <]1+ L]+|1-L)<$+4=1, which is a contradiction.] Hence no limit L exists for the sequence {(—1)"}%, (even though the terms of the sequence all have absolute value 1 and hence are not “too big”). We emphasize that at this early stage in our development of limit, if we wish to show that a given sequence has a limit, then we must first guess what the limit is! We have as yet developed no general criteria that will tell us if a limit exists for a given sequence. Here is an example indicating how to go about guessing under a typical set of circumstances, { z i n+4nl/ 1 Let When n is “large,” then n is “much bigger than” n'/?, We thus guess that, for purposes of establishing what the limit is (if it exists), the 4m'/? term can be ignored. That is, we have 5,=2n/(n+0) where, as n becomes larger, the quantity @ becomes more and more negligible compared to the other quantities (even though @=4n'/” itself is “large” when nis “large”). Thus, for “large” n, 5, must be near 2. We therefore guess that {s,}2_, has the limit 2. From a slightly different, and a more algebraic point of view, we note that s,= 2/(1+4/n'/?), As n gets “large” the 2 and the | are not affected but 4/n'/? gets “small.” In the “long run” s, is roughly 2/(1+0). So again we guess lim, _,,,5,=2. Now let us prove that lim,_,,.8,=2. Given «>0 we must find (calculate) N €/ such that (Sa}net 2n ata ce (n>N). (6) The inequality (6) is equivalent to 2n-2n—8n'/2 ane \<« (n>N),32 ‘SEQUENCES OF REAL NUMBERS or 8/2 Taam <é (PN). (7) Now the left side of (7) is less than 8n!/2/n=8/n'/2, (Why?) Hence (7) will be true if 8 wa N). (8) If we choose N so that 8/N'/?<«, that is, choose N >64/¢?, then (8) will certainly be true. (For 8/n'/?<8/N'/? if n>.) We have thus shown that if N is any positive integer greater than 64/.?, then (8) and hence (7) and finally (6) will be true. This proves Titty seo Sp = 2+ Our intuition tells us that a sequence of nonnegative numbers cannot have a negative limit. This we now prove. 2.2B. THEOREM. If (s,}%., is a sequence of nonnegative numbers and if lim,_,.. 5,=L, then L>0. PROOF: Suppose the contrary, namely that L<0. Then for e=—L/2 there exists N eI such that |s,—L1< (n> N). In particular Iy-L1< se, which implies or But, by hypothesis, sy > 0. This implies L>0, contradicting our supposition that L <0. Hence L>0. This proof is a precise way of saying the following: If s, gets “arbitrarily close” to L when n is “large,” and L0, prove L< M. 3. If {5,}2., is a sequence of real numbers and if, for every «>0, In—Ll N) where N does nor depend on e, prove that all but a finite number of terms of (5,)%, are equal to L.2.3 CONVERGENT SEQUENCES 33 4. (a) Find N EJ such that 2n eS (n>N). (b) Prove lim, _,,,2n/(n+3)=2. 5. (a) Find N €/ so that 1/Vn+1 <0.03 when n> N. (b) Prove that lim, ,,,1/Vn+1 =0. 6. If 6 is a rational number, prove that the sequence {sinn!6}%_, has a limit. . For each of the following sequences, prove either that the sequence has a limit or that the sequence does not have a limit. ® Nees) ae ) {*,}° : ntTnl? J nat 3n © a { n+Tn Jee ..(a) Prove that the sequence {107/n}%_, has limit 0. (b) Prove that {n/10"}#_, does not have a limit. (c) Note that the first 10’ terms of the sequence in (a) are greater than the corresponding terms of the sequence in (b). This emphasizes that the existence of a limit for a sequence does not depend on the first “few” (“few” = “any finite number”) terms. 9. Prove that {n—1/n}%_, does not have a limit. 10. If s,=5"/n!, show that lim,._,,,8,=0. (Hint: Prove that s, <(5°/5!\(5/n) if n>5.) 11. If P is a polynomial function of third degree, ~ ° P(x)=ax?+bx?4+cex+d — (a,b,c,d,xER), prove that P(ntl) _ ee Bay 2.3 CONVERGENT SEQUENCES 2.3A. DEFINITION, If the sequence of real numbers (s,}., has the limit L, we say that {5,}21 is convergent to L. If {s,}%., does not have a limit, we say that (5,)%., is divergent. From the examples of the last section we see that the sequences 1,1,1,... and 1,3,4,-.. are convergent (to the limits 1 and 0, respectively) and that the sequences 1,2,3,... and —1,+1,-1,+1,... are divergent. We now prove that a sequence cannot converge to more than one limit. 2.3B. THEOREM. If the sequence of real numbers {5,}%., is convergent to L, then (5,}2.1 cannot also converge to a limit distinct from’L. That is, if lim, ...8,=L and lim, 205, = M, then L= M.34 ‘SEQUENCES OF REAL NUMBERS PROOF: Assume the contrary. Then L#M so that |M—L|>0. Let e=3|M—L|. By the hypothesis lim,_,..5, = L there exists N,€/ such that |s,- Ll). Similarly, since lim,_,,,5,=M there exists N,€/ such that Is. -—Ml N3). Let N=max(N,,N;). Then N > N, and N >N, so that both |sy—L| and |sy—M| are less than ¢, Thus, |M— L|=|(sy— L)—(sy— MI <|5y— L] +|5y— M|<2e=|M— LI, which implies |M—L|<|M— Ll, This contradiction shows M=L, which is what we wished to show. The next result is almost obvious. In fact it is obvious, so the proof is left to the reader. 2.3C, THEOREM. If the sequence of real numbers {5,)%_, is convergent to L, then any subsequence of {s,}%°_, is also convergent to L. There is a useful corollary. 2.3D. COROLLARY. All subsequences of a convergent sequence of real numbers con- verge to the same limit. PROOF: If the sequence S converges to L then, by 2.3B, S converges to no other limit. By 2.3C, then, all subsequences of S converge to L (and to no other limit). This corollary yields an easy proof that S={(—1)"}®., is divergent. For both 11,1,... and —1,—1,~1,... are subsequences of S and converge to different limits. The example {(—1)"}%., shows that a divergent sequence may have a convergent subsequence. The example’ {n}%., shows that a divergent sequence need have no convergent subsequence. Here are some more examples. If @ is a rational number, 0<@<1, and S= {sinnOr}2_,, then S is divergent. For we can write @=a/b where a and b are integers and b>2. The terms of S for 6,2b,36,... are sinaz,sin2az,sin3az,.... Thus S contains the subsequence 0,0,0,.... But the terms of S for which n=b+1,2b+1,3b+ 1... are sin(a7+an/b),sin(2a7 + a7/b),sin@ar+an/b),... or (—1)*sin¢am/b),(— 1)** sin(a/b),(—1)**sin(a/6),.... These terms all have absolute value sin(az/b) and hence do not approach 0. Thus S contains a subsequence which has the limit 0 and a subsequence which (may or may not converge but certainly) does not have the limit 0. By 2.3D, S is divergent. For 6=0 or @=1 the sequence {sinn@m}®_, is clearly convergent to 0. It may be shown that if @ is irrational, then {sinn@}%_, is divergent. This, however, is somewhat more difficult. Exercises 2.3 1, For any a,b€ R show that lla|-[6I| <|a—4). Then prove that {|s,|}2_, converges to |L| if {s,}%_, converges to L.