MATH 140A (Lecture B; course code 44775) Fall 2011 Assignment #3

Instructor: Professor R. C. Reilly

Reading Assignments (Note: All section or page numbers refer to the course text, Elementary Analysis: The Theory of Calculus, by K. Ross.) Monday 10/10/2011: 8 Wednesday 10/12/2011: 9 Friday 10/14/2011: 9 (continued) Monday 10/17/2011: 9, 10 Some Extra Material (1) The following denition is not given in Ross, but you need it to do much of mathematics, and especially Math 140. Denition Let X and Y be nonempty sets of objects (of any type). A function, with domain being the set X and values being in the set Y , is a rule which, to each element in X, assigns a unique corrresponding element of Y . If f is such a function, and x is an element of the set X, then the unique element of Y which f assigns to x is denoted by the expression f (x), pronounced f of x. Remarks (1) In more advanced parts of mathematics one does allow the sets X and Y to consist of objects that can be very complicated. In Math 140A, however, in nearly all the cases which we consider the domain X is a subset of I the set of all real numbers; and Y equals I R, R. (2) It was pointed out in the lecture that by dening a function to be a rule, one opens the possibility of examples such as this: Let f and g be functions, both with domain equal to I given by the following rules: R, f (x) = (x + 3) (x 1) (x2 4) and g(x) = 2 x + 1 for all x in I R. It is clear that the rule dening f is not the same as the rule dening g. For example, the rst step in carrying out the rule for g(x) is to multiply x by 2. In contrast, the rule dening f (x) makes no mention of multiplying x by 2. Nevertheless, it is easy to show (by simple algebra) that the eect of applying these dierent algebraic rules to x always yields the same results. For that reason we consider f and g to be the same function. More generally: Denition Two functions, f and g, are said to be the same function provided: (i) The domain of f is the same set as the domain of g. (ii) For every x in this common domain, one has f (x) = g(x). (3) In the lecture I gave the following denition of sequence, which is slightly less ambiguous than the one in the text: Denition A sequence with values in a set Y is a function whose domain is the set I of N all natural numbers and whose values are in the set Y . Things to Prepare for the Discussions (These are not to be handed in.) Note: These are problems/examples/topics which the Teaching Assistant (TA) will cover in the discussion sections. You are expected to work on them before you go to the discussions. (A) (Prepare these items for the discussion on Tuesday 10/11/2011. Do not hand in.) (1) Do the 20 parts of Exercise 7.3 before coming to the discussion. Despite the texts statement that no proofs are required, try to provide the proofs. The TA will go over several of these proofs.

 (2) Consider the sequence = (s1 , s2 , . . . ) given by the rule sn = n2 + 2 n n for each n in I N. Problem (a) Using a calculator, try to guess whether this sequence is convergent. (b) If the results of Part (a) suggest that it is convergent, prove that it is convergent. If the results of Part (a) suggest that it is not convergent, prove that it is not convergent. (3) Go over Example 5 in Section 8. Then do Exercise 8.3 (B) (Prepare these items for the discussion on Thursday 10/13/2011. Do not hand in.) Note The text wants exercises from Section 8 to be carried out directly from the denition of convergence, and not by using the standard rules for limits that you learned in calculus. Those rules come into play once we do Section 9. (1) Do Exercises 8.1 and 8.2. The TA will cover selected portions of them. (2) Do Exercise 8.5. Is it important that Part (a) be done before Part (b)? (3) Do Exercise 8.9 Exercises to be Handed in at Start of the Class on Monday 10/17/2011: (I) Exercise 8.4 (II) (a) Exercise 8.10 (b) Prove or Disprove: Let (sn )n 1 be a convergent sequence, and suppose that n sn a for lim some number a. Then there exists a number N such that n N implies sn a. (III) Let (an )n 1 , (bn )n 1 and (sn )n 1 be sequences of numbers such that for each n, the number sn is in the set Box [an , bn ]. (See Hand-in Assignment #2 for the denition of the box notation.) Assume further that the sequences (an )n 1 and (bn )n 1 are convergent, and consider the following statements: (i) A necessary condition for the sequence (sn )n 1 to be convergent is that lim an = lim bn . n n (ii) A sucient condition for the sequence (sn )n 1 to be convergent is that lim an = lim bn . n n Problem: Prove or Disprove each of these statements. In your solution, make it clear which part, (i) or (ii), you are doing. (IV) In both parts of this problem, (an )n 1 and (bn )n 1 are sequences of real numbers such that an bn for all natural numbers n, and n |bn an | = 0. lim (a) Prove or Disprove: Suppose that there exists a number c such that an c bn for all nI N. Then each of the sequences (an )n 1 and (bn )n 1 is convergent. (b) Prove or Disprove: Suppose that for each nI there exists a number c such that an c bn . N Then each of the sequences (an )n 1 and (bn )n 1 is convergent. (V) Without using the existence of 2, prove that if c is a positive real number such that c2 < 2, then there exists a real number x such that c < x and x2 < 2. (Hint: Consider the sequence 1 (sn )n 1 given by sn = c + for all n in I Also, one of the other problems may be relevant.) N. n (VI) Let = (s1 , s2 , . . . sn , . . . ) be a sequence of real numbers. For m a given natural number, let = (t1 , t2 , . . . tk , . . . ) be the sequence given by the rule tk = sm+k for each k in I N. Problem Show that the sequence is convergent if, and only if, the sequence is convergent.