Introduction to Proofs in Analysis. updated December 5, By Edoh Y. Amiran Following the outline of notes by Donald Chalice INTRODUCTION

Introduction to Proofs in Analysis updated December 5, 2016 By Edoh Y. Amiran Following the outline of notes by Donald Chalice INTRODUCTION Purpose. These notes intend to introduce four main notions from analysis and use these to provide practice in deciding the validity of mathematical arguments. The notions mentioned above are convergence, continuity, connectedness, and completeness. It is assumed that the reader has had some experience with convergence of sequences of numbers and with the continuity of functions. General comment: The greatest attention should be directed to understanding definitions. In particular, it is important to study and construct examples of objects that do and do not have the defined properties until these properties become clear. Statements and Proofs. We will take the properties of the real numbers as given. So, for example, we will suppose that the product of two negative numbers is positive. As another example, we accept as known that between any two rational numbers there is an irrational number and that between any two irrational numbers there is a rational number. We will also allow ourselves graphical representations of sets in the plane. That is, we will assume that when we draw a set with certain properties we have shown that a set with these properties exists. Introductory Examples. Most of the notes that follow consist of statements that the readers are asked to prove or disprove. We now follow with some examples of proofs and counter examples. These examples deal with the topic of the number of elements in a set. (I ve chosen this topic because it is a good platform for illustrating methods of proof and because while the statements are simple, the proofs are not obvious making it clear that some creativity and attention to detail is needed in constructing proofs). Notation: The natural numbers are denoted here by N and are the set consisting of 1, 2, 3,.... The real numbers are denoted by R, and the rational numbers by Q. A mapping, f, from a set A to a set B is denoted by f : A B. We denote the difference of two sets by A \ B, that is A \ B = {a A : a B}. 1

Definition 1. A mapping f : A B is one-to-one or injective when f(a) = f(x) implies a = x. A mapping f : A B is onto or surjective when for any b B there is an a A with f(a) = b. A mapping f : A B has a left inverse when there is a mapping g : B A so that for any a A it holds that g f(a) = a. A mapping f : A B has a right inverse when there is a mapping g : B A so that for any b B it holds that f g(b) = b. Example 1. A mapping f : A B which is one-to-one and onto has a left inverse. Proof: Fix b B. Since f is onto, there is an a A so that f(a) = b. Moreover, since f is one-to-one, there is only one such a. Set g(b) = a. By the definition of g, g f(a) = a. This is an example of a direct proof. The proof started with the hypotheses and concluded with the desired consequence. The proof was actually constructive, having shown that g exists by giving its values (assuming the values of f are known). Example 2. A mapping f : A B which is one-to-one and onto has a right inverse. Proof: Define g as in the previous example. Fix b B. Since f is onto, there is an a A so that f(a) = b. Now f g(b) = f g(f(a)) and since g(f(a)) = a, f g(f(a)) = f(a) = b. so f g(b) = b. Example 3. Suppose a mapping f : A B has a left inverse g. Then f is one-to-one. Proof: Suppose that for two a 1, a 2 A we have f(a 1 ) = f(a 2 ). Then a 1 = g(f(a 1 )) = g(f(a 2 )) = a 2 and a 1 = a 2. Example 4. Suppose a mapping f : A B has a right inverse h. Then f is onto. Proof: Fix b B. Set a = h(b). Now f(a) = f(h(b)) = b. Example 5. Suppose a mapping f : A B has a left inverse g and a right inverse h. Then g = h. Proof: The examples above show that f is one-to-one and onto. Fix b B. Now f(h(b)) = b since h is a right inverse. Since f is onto, there is an a A with f(a) = b, and f(g(b)) = f(g(f(a))) = f(a) = b (since g(f(a)) = a). Since f is one-to-one, g(b) = h(b). Notation: We have seen that when a mapping f : A B is one-to-one and onto then it has a left inverse g and that g is also a right inverse for f. This common function g is called the inverse of f and is denoted by f 1. Cultural note: the underlying operation for the power notation is composition of functions (rather than multiplication of functions). Example 6. Decide whether the following statement is true: Suppose a mapping f : A B has a left inverse g. Then f is one-to-one and onto. Decision: This statement is false. To see this consider f : N N defined by f(n) = 2n. This mapping is clearly not onto because it misses all the odd natural numbers. Set g(2m) = m and g(2k 1) = k. The mapping g : N N is defined everywhere and g f(n) = n. We have given a counter-example that shows the statement to be false. Definition 2. An empty set is finite with zero elements. A non-empty set A is called finite and is said to have n elements when there is a mapping f : A {1, 2, 3,..., n} 2

which is one-to-one and onto. When for a fixed non-empty set A there is no such mapping (for any n), the set is called infinite. A set A is called countable when there is a mapping f : A N which is one-to-one. Notice that finite sets are automatically countable (including the empty set). Example 7. A subset of a finite set is finite. Proof: Let A denote the finite set and let B A. If A is empty, then B is empty and is finite. When A is not empty there is an n and a one to one and onto map f : A {1,..., n}. Consider the image f(b). If B is the empty set,, then B is finite by definition. Suppose B. There is a least element, i, in f(b) and a b 1 so that f(b 1 ) = i. Set g(b 1 ) = 1. Continue in this fashion, that is, b 1,..., b k are such that g(b j ) = j and f(b j+1 ) is the smallest number in the image of B \ {b 1,..., b j } under f. The map g is one to one and g(b j ) n. Let m be the maximum value in g(b). Then g : B {1,..., m} is onto. To see this note that, by its definition, there are b 1 and b m with g(b 1 ) = 1 and g(b m ) = m, and if i with 1 < i < m is not in the image of g then neither is i 1. Example 8. The set of natural numbers, N is infinite. Proof: By contradiction (our first example of a proof using this method). Suppose there is an n and a one-to-one and onto map f : N {1, 2,..., n}. Set a i = f 1 (i). Notice that for each i, 1 i n, a i is well defined and a natural number. Let k = 1+a 1 +a 2 +...+a n. Then k N and k a i for any i. However, f(k) = j for some j in {1, 2,..., n}, so f(k) = f(a j ). This contradicts f being one-to-one. Example 9. The set of positive rational numbers is countable. Proof: We will define a map from the positive rationals to N as follows. For each positive rational number, x, there is a pair of positive natural numbers (m, n) so that x = m/n and m and n have no common factors. Set f(x) = (m + n 1)(m + n 2) 2 + m. This function is well defined, and we claim that it is one-to-one. To see this, notice that if k = m + n and (i, j) is a pair of natural numbers with i + j < k, then f(i, j) (k 2)(k 3)/2 + (k 2) = (k 1)(k 2)/2 < f(m, n) for such pairs. For those pairs (m i, n i ) with m i +n i = k, say (m 1, n 1 ) (m 2, n 2 ), the values of f differ because f(m 1, n 1 ) f(m 2, n 2 ) = m 1 m 2. Hence Q is countable. Note that we ve shown that the set of pairs of natural numbers is countable (and have shown that the positive rationals can be mapped into this set). Hence the proof actually shows that the set product of two countable sets is countable. The formula used in the proof to get a one-to-one map from Q to N is also not the main point. Rather, showing there is a one-to-one map from a set into N is sufficient to conclude that the set is countable. Example 10. The interval, [0, 1] is not countable. Proof: By contradiction. Suppose that there is a one-to-one map f : [0, 1] N. For each i N that is in the image of f there is an x i in [0, 1] with f(x i ) = i. Consider the decimal 3

expansion of x i that does not terminate in repeating 9s. This expansion is well-defined. Let d i be the i th digit of x i. Now choose a number z by specifying its decimal expansion to have a digit different from d i for its i th digit. For example, the i th digit of z could be d i 1 if i is in the image of f and 3 otherwise. Notice that z [0, 1] and so f(z) = j for some j. Notice that z x j for any j. Also, if i is not in the image of f, then clearly f(z) i. So f(z) = j for some j with x j as above, which contradicts f being one-to-one. Summary of the introduction: We assume the usual properties of numbers. We have seen examples of direct proofs (including constructive proofs) and proofs by contradiction with both of these using logical arguments and definitions. We also saw how a counter-example can prove a statement false. OPEN and CLOSED SETS This section concerns sets in the real line, in the Euclidean plane, and in Euclidean 3-space. Definition 3. A set O in the real line is open if for every point p O there is an r > 0 so that the interval (p r, p + r) is in O. Symbolically, r > 0 with (p r, p + r) O, or alternatively with {x : x p < r} O. Definition 4. A set O in the plane or in R 3 is open if for every point p O there is an r > 0 so that the disk (or ball) {x : x p < r} is in O. Here x p denotes the (Euclidean) distance between x and p. In terms of coordinates, in the plane x = (x 1, x 2 ) and p = (p 1, p 2 ), and x p = ((x 1 p 1 ) 2 + (x 2 p 2 ) 2 ) 1/2. In R 3, x = (x 1, x 2, x 3 ) and p = (p 1, p 2, p 3 ), and x p = ((x 1 p 1 ) 2 + (x 2 p 2 ) 2 + (x 3 p 3 ) 2 ) 1/2. Exercise 1. Sketch each of the following sets in the real line (a rough sketch will do) and decide whether it is open. (a) {x : x 1 < 2}. (b) {x : x 1 2}. (c) {x : x 1 = 2 n for some n N}. Exercise 2. Sketch each of the following sets in the real line (a rough sketch will do) and decide whether it is open. (a) {x : x 1 < 2 or x 3 < 1}. (b) {x : x 1 2 and x 3 < 1}. (c) {x : x 1 < 1 2 n for some n N}. (d) {x : x 2 n < 1 for some n N}. Prove or contradict 1. The intersection of two open sets in the line or the plane is open. Stated with symbols, let A and B be two given open sets. Then A B is open. Prove or contradict 2. The union of two open sets in the line or the plane is open. Symbolically, let A and B be two given open sets. Then A B is open. Prove or contradict 3. If O is an open set in the line or in the plane then there is some positive number r (particular to O) so that for each and every p O, {x : x p < r} is in O. 4

Prove or contradict 4. If O is an open set in the plane and B is a set in the plane that is not open, then O B cannot be open. Prove or contradict 5. If A and B are sets in the plane that are not open, then A B cannot be open. Definition 5. An indexed collection of sets is an index set I and for each α I a set S α. Prove or contradict 6. The intersection of an indexed collection of open sets in the plane is open. That is, suppose that for each α I, A α is open. Then α I A α is open. Prove or contradict 7. The union of an indexed collection of open sets in the plane is open. Prove or contradict 8. Let O be a set in the line or in the plane. If O is open then for each p O there is a rational number q > 0 so that {x : x p < q} is in O. Conversely, if for each p O there is a rational number q > 0 so that {x : x p < q} is in O, then O is open. Definition 6. An open set containing a point p is called a neighborhood of p. Definition 7. In the line or the plane, a point p is an accumulation point of a set S when every neighborhood of p contains a point in S without considering p. That is, every neighborhood of p, even after p is deleted from this neighborhood, contains a point in S. Notation. For convenience we will denote the set of accumulation points of a set S by L(S). (This is a script L, since these points are limit points, in some sense.) Prove or contradict 9. Suppose that p is an accumulation point of A B. Then p is an accumulation point of A or p is an accumulation point of B (or both). Definition 8. A set C in the line or the plane is closed when C contains all the accumulation points of C. Exercise 3. Sketch each of the following sets in the real line (a rough sketch will do) and decide whether it is closed. (a) {x : x 1 < 2}. (b) {x : x 1 2}. (c) {x : x 1 = 2 n for some n N}. Exercise 4. Sketch each of the following sets in the real line (a rough sketch will do) and decide whether it is closed. (a) {x : x 1 2 or x 3 1}. (b) {x : x 1 < 2 and x 3 1}. (c) {x : x 1 1 2 n for some n N}. (d) {x : x 2 n 1 for some n N}. Prove or contradict 10. The intersection of two closed sets in the line or the plane is closed. Stated with symbols, let A and B be two given closed sets. Then A B is closed. Prove or contradict 11. The union of two closed sets in the line or the plane is closed. Symbolically, let A and B be two given closed sets. Then A B is closed. Prove or contradict 12. The intersection of an indexed collection of closed sets in the plane is closed. 5

Prove or contradict 13. The union of an indexed collection of closed sets in the plane is closed. Prove or contradict 14. If C is a closed set in the plane and B is a set in the plane that is not closed, then C B cannot be closed. Prove or contradict 15. If A and B are sets in the plane that are not closed, then A B cannot be closed. Exercise 5. Decide whether the intersection of an open set and a closed set can be closed, open, or neither. Exercise 6. Decide whether the union of an open set and a closed set can be closed, open, or neither. Exercise 7. Decide whether there are sets that are both open and closed (at the same time). Prove or contradict 16. Let X denote the line or plane. If O is an open set in X, then X \ O, the complement of O, is closed. Prove or contradict 17. Let X denote the line or plane. If C is a closed set in X, then X \ C, the complement of C, is open. Prove or contradict 18. Suppose C is closed and O is open. Then C \ O is closed and O \ C is open. Definition 9. The boundary of a set S, denoted S, consists of all points p so that each neighborhood of p contains both a point in S and a point not in S. Exercise 8. For each of the following sets in the plane sketch it (a rough sketch will do) and describe its boundary. (a) {x : x (1, 2) < 2}. (b) {x : x (3, 1) 2}. (c) {x : x (3, 3) = 2 n for some n N}. Prove or contradict 19. A set always contains its boundary. Prove or contradict 20. A closed set always contains its boundary. Prove or contradict 21. If a set contains its boundary, then it is closed. Prove or contradict 22. The boundary of a union of two sets in the plane is contained in the union of the boundaries of the sets. That is, (A B) ( A) ( B). Prove or contradict 23. The boundary of an intersection of two sets in the plane is contained in the intersection of the boundaries of the sets. That is, (A B) ( A) ( B). Prove or contradict 24. A set with its boundary removed is open. (That is, if A is a set in the line or the plane, then A \ A is open.) Prove or contradict 25. The boundary of a set is a closed set. That is, A is always a closed set. Definition 10. The closure of a set S, denoted S, consists of all points p so that either p is in S or p is an accumulation point of S. 6

Prove or contradict 26. The closure of a set is a closed set. Prove or contradict 27. The closure of a set consists of the set and the boundary of the set. That is, S = S ( S). Prove or contradict 28. If C is closed and S C, then S C. Prove or contradict 29. The closure of a set is the intersection of all closed sets that contain the original set. That is S = {C : C is closed and S C}. CONNECTED SETS This section concerns sets in the real line and in the plane. Similar definitions apply to sets in other settings. Definition 11. Two sets are disjoint if their intersection is empty. That is A and B are disjoint when A B =. Definition 12. Two non-empty sets A and B are separated if there are two open sets O and G so that A O and B G and O G =. Exercise 9. For each of the following pairs of sets in the line decide whether they are separated. (a) A = {x : x 1 < 2}, B = {x : x 4 1}. (b) A = {x : x 1 < 2}, B = {x : x 4 < 1}. (c) A = {x : x = 2 n for some n N}, B = {x : x 0}. Exercise 10. For each of the following pairs of sets in the plane decide whether they are separated. (a) A = {(x, y) : x 2 + y 2 < 1}, B = {(x, y) : (x 2) 2 + y 2 1}. (b) A = {(x, y) : x 2 + y 2 < 1}, B r = {(x, y) : 0.5 < x < 2, r < y < r + r 2 }, where all r > 0 are to be considered. (c) A = {(x, y) : x 2 + y 2 < 1}, B = {(x, y) : x 2 + y 2 > 1}. Exercise 11. For each of the following pairs of sets in the line decide whether they are separated. (a) A consists of rational numbers in [0, 1], B consists of irrational numbers in [0, 1]. (b) A = {x : x = n + 2 n for some n N}, B = {x : x = n 2 n for some n N}. Exercise 12. For each of the following pairs of sets in the plane decide whether they are separated. (a) A = {(x, y) : x = 0, 1 y 1}, B = {(x, y) : 0 < x < 1, y = sin(1/x)}. (b) A = {(x, y) : x = 0, 0 y 1}, B = {(x, y) : x = 1/n, for some n N, 0 y 1}. (c) A = {(x, y) : x 2 + y 2 = 1}, B = {(x, y) : x = (1 e t ) cos(t), y = (1 e t ) sin(t), for some t 0}. Prove or contradict 30. If A B = then A and B are separated. 7

Prove or contradict 31. Suppose B A =. Set D = {x : x B }. Then for each p ( A) D there is an r > 0 so that {x : x p < 2r} D and so that for y B, y p > 2r. Prove or contradict 32. Suppose A B = and B A =. Set D = {x : x B } as above, and for each p ( A) D let r p > 0 be as in the previous statement. Set U = {x : x p < r p, p ( A) D}. Then U is open. Let E = {x : x A }. Construct the set V similar to U but with the union over all points q in ( B) E. Then V is open. Moreover U V =. Prove or contradict 33. Suppose A B = and B A =. Then A and B are separated. Prove or contradict 34. If A and B are closed disjoint sets then they are separated. Definition 13. A set S is connected if there are no two sets A and B, both non-empty, so that S = A B and A and B are separated. Such a pair {A, B} is called a separation of S. Exercise 13. For each of the following sets decide whether they are connected. Give reasons for your conclusions (a proof is not required). (a) A set consisting of exactly two points (in the line). (b) A = {x : x = 2 n for some n N}. (c) An interval of the form [a, b]. Exercise 14. For each of the following sets decide whether they are connected. Give reasons for your conclusions (a proof is not required). (a) The rational numbers in [0, 1] of the form 1/n for some n. (b) The rational numbers in [0, 1]. Exercise 15. Consider the sets S r below and decide, for each r > 0, whether the set is connected. (You should describe the values of r > 0, if any, for which S r is connected, and all the values, if any, for which it is not connected.) S r = {(x, y) : x 2 + y 2 < 1} {(x, y) : (x 3) 2 + y 2 < 1} {(x, y) : 0 < x < 3, 0 < y < r}. Prove or contradict 35. Suppose A and B are connected sets. Assume that A B is not empty. Then A B is connected. Prove or contradict 36. Suppose S is a connected set. Then S is connected. Prove or contradict 37. Suppose S is a connected set. Then S is connected. Prove or contradict 38. Suppose A and B are connected sets. Suppose A B. Then A B is connected. Prove or contradict 39. Suppose A α is a connected set for each α I (here I is some index set). Suppose there is a point p so that p A α for each α I. Then the union {A α : α I} is connected. 8

Prove or contradict 40. Suppose A n is a connected set for each n N. Suppose that for each n one has A n+1 A n. Then the intersection {A n : n N} is connected. LEAST UPPER BOUND This section concerns sets in the real line. The least upper bound axiom is a property of real numbers. Definition 14. A set S R has u as an upper bound if u is as large as any number in S. Symbolically, s u, s S. Definition 15. A set S R has least upper bound b if b is the smallest upper bound for S. That is, b is an upper bound for S and for any other upper bound, u, b u. Exercise 16. Find three different upper bounds for each of the following sets. Then find the least upper bound for each set. (a) S = {x : x = 1/n, some positive integer n}. (b) S = {x : x < 2}. (c) S = {x : x = 3 1/n, some positive integer n}. Exercise 17. If a set has a least upper bound, then this number is unique. (Symbolically, if b and r are both least upper bounds for S then b = r.) We will assume that every set in the real line with an upper bound has a least upper bound. This is called the least upper bound axiom. (In the usual formulations of the axioms for real numbers either this axiom or an alternative one is assumed). Definition 16. A set S R is an interval if it is convex. That is, for any a, b S and any number t with 0 t 1, we have that ta + (1 t) b S. Definition 17. A set S R is bounded if there is a number r with S [ r, r]. Exercise 18. Show that any bounded set has an upper bound. Exercise 19. Define the lower bound of a set S in the real line. Exercise 20. Define the greatest lower bound of a set S in the real line. Prove or contradict 41. Every connected set in the real line is an interval. Prove or contradict 42. Any interval in the real line is connected. Definition 18. A set S R has a maximum x if x S and x is as large as any number in S. A set S R has a minimum x if x S and x is as small as any number in S. Exercise 21. Show that not every bounded interval in the real line has a maximum. Exercise 22. Show that if a set in the real line has a maximum, then it has a least upper bound. Cultural note: The least upper bound of a set in the real line is also called the supremum of the set. 9

SEQUENCES A sequence of real numbers or of points in the plane is an indexed collection p n of numbers or points with n a natural number (n is one of 1, 2, 3,...). Definition 19. A sequence of real numbers is a function from the natural numbers to the real numbers. A sequence of points in the plane is a function from the natural numbers to the plane. The ordered values of the function are called the terms of the sequence. Since the order of terms in a sequence is included, we often refer to the value of the term that appears in the n th position as the n th term. Notation: We write {x n } to denote the sequence whose n th term is x n. In other words, this refers to a sequence x : N R or x : N R 2 with x n = x(n). Examples 11. (a) x n = n, (b) p n = (1, 1/n 2 ), (c) x n = n, (d) p n = (n, n 2 ), (e) x n = 2 n, (f) x n = 0.4 n, (g) p n = (1/n, sin(n)), (h) x n = ( 1) n, (i) p n = (1/n, sin(1/n)), (j) x n = cos(n)/n 2, (k) x n = (n + 3)/(5n 1). Definition 20. A sequence {x n } approaches a limit v if given any positive number ɛ > 0, there is an N so that whenever n N we also have x n v < ɛ. When a sequence approaches some limit, it is said to converge. Exercise 23. Which of the examples at the beginning of this section approaches a limit? and if so, what value or point does it approach? Prove or contradict 43. If a sequence of real numbers converges (that is, it approaches a limit), then the set consisting of its terms is bounded. Prove or contradict 44. If a sequence of real numbers does not converge, then the set consisting of its terms is not bounded. Prove or contradict 45. If a sequence of real numbers converges, then the set consisting of its terms has an accumulation point. Prove or contradict 46. If the set consisting of the terms of a sequence of real numbers has an accumulation point, then the sequence converges. Prove or contradict 47. Suppose {x n } is a sequence with x n S for some set S. Suppose that the sequence converges to v, with v S. Then S is not closed. Definition 21. A subsequence of a sequence {x n } is a sequence obtained by skipping over some of the terms in {x n }. More carefully, let x n = f(n). A subsequence is given by g : N N which is a strictly increasing function (that is g(i + 1) > g(i)) through the rule y i = f(g(i)). Notation: We often write x ni for the i th term of the subsequence. That is, for f : N R, and a strictly increasing g : N N. we think of the terms as x n = f(n) and n i = g(i), and of the sequence and subsequence as {x n } and {x ni }. Exercise 24. Set x n = f(n) = ( 1) n. Let g(i) = 2i and h(j) = 2j 1. Describe the terms of the subsequences f(g(i)) and f(h(j)). 10

Exercise 25. Set x n = f(n) = [( 1) n /n] + [( 1) n+1 /(n + 1)]. Let g(i) = 2i and h(j) = 2j 1. Describe the terms of the subsequences f(g(i)) and f(h(j)). Exercise 26. If n is odd let x n = 1/n, and if n is even let x n = 7. Find a subsequence of {x n } that converges and a subsequence of {x n } that does not converge. (You should be able to find more than one of each.) Definition 22. A sequence of real numbers {x n } is increasing if x n+1 x n for each n (so the function f in the definition of a sequence is an increasing function). A sequence {x n } is strictly increasing if x n+1 > x n. A sequence {x n } is decreasing if x n+1 x n. A sequence {x n } is strictly decreasing if x n+1 < x n. Prove or contradict 48. If a sequence of real numbers has a strictly increasing subsequence, then the (original) sequence cannot be decreasing. Prove or contradict 49. If a sequence of real numbers converges and has a strictly increasing subsequence, then the (original) sequence is increasing. Prove or contradict 50. An increasing sequenced of real numbers {x n } with (x n+1 x n ) 0 (as n ) converges. Prove or contradict 51. Suppose that a sequence of real numbers is increasing and has a convergent subsequence. Then the sequence converges. Prove or contradict 52. Suppose that a sequence of real numbers is increasing and has an upper bound (that is, the set of terms has an upper bound). Then the sequence converges to its least upper bound. Intuitively, the first few terms of a sequence do not determine whether it converges. We will now turn our attention to the tail end of sequences. That is, for a fixed m we think of the terms {x n } where n m. Of course, the beginning of the end (that is m) will vary. Prove or contradict 53. A sequence of real numbers that does not have an upper bound has an increasing subsequence. Similarly, a sequence of real numbers that does not have a lower bound has a decreasing subsequence. Prove or contradict 54. Fix a sequence of real numbers {x n }. Suppose that the sequence is bounded and let u be the least upper bound of the collection {x 1, x 2,...}. Suppose that u x n for any n. Let y j = max{x 1, x 2,..., x j }. Then for any k > j, y k y j and for any fixed j there is an m > j so that y m > y j. Prove or contradict 55. Fix a sequence of real numbers {x n }. Suppose this sequence is bounded. Let l j be the least upper bound of {x j, x j+1, x j+2,...}. Then (a) {l j } is a decreasing sequence, and (b) it is possible that l j is a subsequence of {x n } but also that it is not a subsequence of {x n }. Prove or contradict 56. Every sequence of real numbers has either an increasing subsequence or a decreasing subsequence. 11

Prove or contradict 57. Every bounded sequence of real numbers has a convergent subsequence. That is, suppose there are lower and upper bounds for the terms of a sequence, say a x n b, then {x n } has a subsequence that converges. CAUCHY SEQUENCES Definition 23. A sequence {x n } is Cauchy (or a Cauchy sequence) if given any ɛ > 0 there is a K so that if m, n K then x n x m < ɛ. Note that K may depend on ɛ. Exercise 27. Decide which of the following sequences is a Cauchy sequence. (a) x n = 1 n, (b) x n = ln(n), (c) x n = 1 + ( 1)n, (d) x n = 5 0.3 n 3 + n + ( 1) n n. Prove or contradict 58. Every Cauchy sequence of real numbers is bounded. Prove or contradict 59. Every convergent sequence of real numbers is Cauchy. Prove or contradict 60. Every Cauchy sequence of real numbers converges. Definition 24. A set on which a distance is define is called a metric space and such a metric space is complete if every Cauchy sequence in the space converges. Prove or contradict 61. Every Cauchy sequence whose terms are in (0, 1) converges to a limit v with v (0, 1). Comments: We did not define what we mean by a distance, but an example with which the reader is familiar is the Euclidean distance in two or three dimensions. The problems above suggest that the real numbers is a complete metric space. The idea is that a Cauchy sequence discovers whether there are holes in the space that a sequence is Cauchy tells us that it should have a limit. COMPACT SETS We consider only sets in the real line in this section. However, the reader might consider how the objects defined here generalize to the plane and to other spaces. Definition 25. An indexed collection of open sets, O α with α I, is an open cover of the set S when S α O α. Exercise 28. Fix a set S (in the real line) and a number δ > 0. Consider the collection O s = (s δ, s + δ) with s S. Is this an open cover of S? Definition 26. An open cover of S, O α with α I, has a finite sub-cover if there is a finite n so that S O α1... O αn. That is, there are a finite number of elements α i I so that S is contained in the union of the corresponding sets. Exercise 29. Let S = (0, 1] and for each integer i 10 set O i = (1/i, 1 + 1/i). Show that the collection of O i is an open cover for S. Is there a finite sub-cover of this cover? 12

Exercise 30. Let S = [0, 1] and set O i,n = ( i 2 n 1 n + 3, i 2 n + 1 ), i, n N, i < 2 n. n + 3 Show that the collection of O i,n are an open cover for S. Is there a finite sub-cover of this cover? Definition 27. A set S is compact if every open cover of S has a finite sub-cover. Exercise 31. Is a set of finitely many real numbers compact? Is N compact? Exercise 32. Is the open interval (0, 1) compact? Prove or contradict 62. Every compact set is bounded. Prove or contradict 63. A union of two compact sets is compact. Prove or contradict 64. Any sequence in a compact set has a convergent subsequence. Prove or contradict 65. A closed subset of a compact set is compact. That is, if C S and C is closed and S is compact, then C is compact. Prove or contradict 66. Any sequence in a compact set converges. Prove or contradict 67. Any compact set is closed. Suggestion: let v be an accumulation point of a compact set S. Construct a collection of open sets that would be a cover of S with no finite sub-cover if v S. Prove or contradict 68. The intersection of two compact sets is compact. Prove or contradict 69. Suppose that a set S has the property that every infinite sequence in S has a subsequence that converges. Then S is bounded. Prove or contradict 70. Suppose that a set S has the property that every infinite sequence in S has a subsequence that converges to a point in S. Then S is closed. Prove or contradict 71. The set [a, b] is compact. Prove or contradict 72. If a set (in R) is bounded and closed then it is compact. Prove or contradict 73. A set S is countably compact if every countable open cover of S has a finite sub-cover. A countably compact set is compact. Example 12. The Cantor set is defined as follows. The set is a subset of [0, 1]. Set C 1 = [0, 1] \ (1/3, 2/3) = [0, 1/3] [2/3, 1]. Notice that C 1 is closed and bounded. Set C 2 = C 1 \ ( (1/9, 2/9) (7/9, 8/9) ). Set C 3 = C 2 \ ( (1/27, 2/27) (7/27, 8/27) (19/27, 20/27) (25/27, 26/27 ). Continue in this fashion, with C k being the union of 2 k disjoint closed intervals, and with the middle third of each of these intervals removed to form C k+1. The cantor set is C = C i, the intersection being over all i N. The cantor set is closed because it is the intersection of closed sets, and it is bounded because it is contained in [0, 1]. Hence C is compact. 13

When considering the size of the Cantor set, the following is interesting. The base 3 expansion of x [0, 1] is x = d i 3 i where the sum is over i N and the digits are d i {0, 1, 2}. (For some numbers the representation is not unique.) Exercise 33. Write the endpoints of C 1, C 2, and C 3 using the base 3 expansion. Exercise 34. How does one obtain the base 3 expansion of the endpoints to C n+1 from the base 3 expansion of the endpoints to C n? Example 13. The Cantor set consists of those points in [0, 1] that have a base 3 expansion using only the digits 0 and 2. Prove or contradict 74. The Cantor set is uncountable. CONTINUOUS FUNCTIONS Here we consider a real valued function whose domain is a subset of the real numbers. We aim to understand the consequences of continuity for a function defined on a compact set in R. Definition 28. A function f defined on a domain D is continuous at a point p in D if given any ɛ > 0 there is a δ > 0 so that f is defined on (p δ, p + δ) and f(x) f(p) < ɛ whenever x p < δ. Exercise 35. Show that f(x) = x 3 is continuous at any point p R. Exercise 36. Show that f(x) = 1/x is continuous at p = 2 (in fact it is continuous at any point p 0). Prove or contradict 75. The function f(x) defined below is continuous at any point p that is irrational (p Q), and is not continuous at any point p that is rational. { 0 x irrational f(x) = 1 n x = m n in lowest terms Hint: For any fixed x and n there are only finitely many rational numbers with denominator at most n inside, say, (x 1, x + 1). Prove or contradict 76. domain) is continuous. The sum of two continuous functions (defined on the same Prove or contradict 77. Suppose f : D R is continuous at p. Suppose {x n } with x n D has x n p. Then f(x n ) f(p). Prove or contradict 78. Suppose f : D R where D is an open set. Fix p D. Suppose that for any sequence {x n } with x n D and x n p one has f(x n ) f(p). Then f is continuous at p. Definition 29. Let f : R R be a function and let S be a set (in R). Then the image of S under f is f(s) = {y : y = f(x), for some x S}. The inverse image of S under f is f 1 (S) = {x : y = f(x), for some y S}. 14

Prove or contradict 79. Suppose f : R R is continuous and let O be an open set. Then the inverse image of O, f 1 (O), is open. Prove or contradict 80. Suppose f : R R and that for any open set O it is known that f 1 (O) is open. Then f is continuous. Terminology: A function f has a maximum value M on a set S and the maximum value is achieved at a point p when f(p) f(x) for any x S. Exercise 37. What is the maximum value of f(x) = x 3 on [0, 1]? Exercise 38. Is there a maximum value for f(x) = x 3 on (0, 1)? Exercise 39. What is the least upper bound for the values of f(x) = x 3 on (0, 1)? Terminology: We call the least upper bound for the values of f on the set S the supremum of f on S. Definition 30. Let f : R R be a function and let {x n } be a sequence (in R). Then f(x n ), the function approaches infinity on this sequence, if given any B there is an M so that f(x n ) > B for all n with n M. Prove or contradict 81. Assume that f is defined on a set S and suppose that the values of f on S have no upper bound. Then there is a sequence {x n } with x n S so that f(x n ). Prove or contradict 82. Assume that f is defined and continuous (everywhere). Let S be a set (in R) and let u be the supremum of f on S. We are assuming that u is finite. Then there is a sequence {x n } with x n S so that f(x n ) u. Prove or contradict 83. Assume that f is defined and continuous (everywhere). Assume that S is bounded. Then the supremum of f on S is finite. Prove or contradict 84. Assume that f is defined and continuous (everywhere). Assume that S is compact. Then f has a maximum value on S. Prove or contradict 85. Assume that f is defined and continuous (everywhere). Let [a, b] be a bounded interval. Assume that f(a) < f(b) and fix an intermediate value v, by which we mean f(a) < v < f(b). Set D = {x : f(t) < v, for a t x}. (Notice that x D implies that a x). Show that D is nonempty and open. Prove or contradict 86. Assume that f is defined and continuous (everywhere). Let [a, b] be a bounded interval. Assume that f(a) < f(b) and fix an intermediate value v [f(a), f(b)]. Then there is a point c [a, b] with f(c) = v. Prove or contradict 87. Suppose that f is continuous (on R) and f([0, 1]) = [0, 1]. Then f has a fixed point p [0, 1]. That is, there is a point p in [0, 1] with f(p) = p. Suggestion: consider g(x) = f(x) x or h(x) = x f(x). Definition 31. A function f defined on a domain D is uniformly continuous on D if given any ɛ > 0 there is a δ > 0 so that for any x and p in D with x p < δ, f(x) f(p) < ɛ. 15

Exercise 40. Show that f(x) = x 2 is uniformly continuous on [0, 3]. Exercise 41. Show that f(x) = 1/x is not uniformly continuous on (0, 1]. Exercise 42. Set f(x) = x sin(1/x) for x 0 and set f(0) = 0. Show that f is continuous at 0. Is f continuous at x 0? Exercise 43. Set f(x) = x sin(1/x) for x 0 and set f(0) = 0. Is f uniformly continuous on [ 1, 1]? Prove or contradict 88. Suppose that there is a K so that for any x and p in D we have f(x) f(p) < K x p. Then f is uniformly continuous on D. Prove or contradict 89. Suppose that D is compact and f is continuous at each point in D. Then f is uniformly continuous on D. POINT-WISE AND UNIFORM CONVERGENCE Here we consider a sequence of real valued functions. Definition 32. A sequence of functions {f n } defined on a domain D converges to a function g on D if given any point x D, {f n (x)} converges to g(x). Notice that in this definition the point x is picked first. That is, given a point x and an ɛ > 0, there is an N so that whenever n N one also has f n (x) g(x) < ɛ. Exercise 44. Set f n (x) = x n and set g(x) = 0 for 0 x < 1 with g(1) = 1. Show that {f n } converges to g on [0, 1]. Exercise 45. Set f n (x) = sin(x/n) and set g(x) = 0. Show that {f n } converges to g (on R). Exercise 46. Set nx 0 x < 1 n f n (x) = 1 2 nx n < x < 2 n 0 otherwise Show that {f n } converges to g(x) = 0 (on R). Definition 33. A sequence of functions {f n } defined on a domain D converges to a dunction g uniformly on D if given any point any ɛ > 0, there is an N so that whenever n N one also has f n (x) g(x) < ɛ for all x D. Exercise 47. Set f n (x) = x n. Does {f n } converge uniformly on [0, 0.7]? on [0, 1]? Exercise 48. Set f n (x) = sin(x/n). Does {f n } converge uniformly on R? Exercise 49. Set x 0 x < 1 n f n (x) = 2 n x 1 n < x < 2 n 0 otherwise 16

Does {f n } converge uniformly on R? Prove or contradict 90. Fix a sequence of functions {f n }. Suppose that each f n is continuous on D and that D is compact. Suppose that {f n } converges uniformly on D to some function g. Then g is continuous on D. RIEMANN INTEGRAL In this section we consider integrals of functions on an interval [a, b]. Definition 34. For a fixed interval [a, b] a partition of [a, b] is a collection of finitely many points, say n + 1 points which we denote x i, with a = x 0 < x 1 < x 2 <... < x n = b. The size of this partition is the length of the largest subinterval. That is size({x i }) = max 1 i n (x i x i 1 ). Definition 35. Given a function f(x) and a partition {x i } of [a, b], the upper sum for f on {x i } is n U(f, {x i }) = x i x i 1 lub{f(x) x i 1 x x i }. i=1 Here lub{f(x) x i 1 x x i } is the least upper bound. Given a function f(x) and a partition {x i } of [a, b], the lower sum for f on {x i } is L(f, {x i }) = n x i x i 1 glb{f(x) x i 1 x x i }. i=1 Here glb{f(x) x i 1 x x i } is the greatest lower bound, that is, it is the largest number l so that l f(x) for all x with x i 1 x x i. Definition 36. A function f defined on [a, b] is Riemann integrable on [a, b], with definite integral v = b a f(x)dx, when given any ɛ > 0 there is a partition {x i} of [a, b], so that L(f, {x i }) > v ɛ and U(f, {x i }) < v + ɛ. Exercise 50. Set f(x) = { 0 x Q 1 otherwise. Calculate the upper sum and lower sum for the partition of [0, 1] defined by x i = i/n for 1 i n. Exercise 51. Set f(x) = { sin(1/x) x 0 0 x = 0. Is f integrable on [ 1, 1]? Explain the decision. { x x is not rational Exercise 52. For f(x) =, and the interval [0, 1] with 100 equally 0 x is rational sized subintervals, find U(f, {x i }) and L(f, {x i }). Hint: think of the sketch of the least upper bounds and calculate the upper estimate geometrically (as an area). 17

Exercise 53. Set p 0 (x) = { 0 x < 1 1 1 x 1 0 2 < x. (a) Calculate 3 0 p 0(x)dx. (b) Set p 1 (x) = p 0 (3x). Calculate 3 0 p 1(x)dx. (c) Set p k (x) = p(3 k x). Calculate 3 0 p k(x)dx. (d) Set s(x) = k=0 p k(x). Is s(x) Riemann integrable on [0, 3]? Notice that we can also define s(x) directly as the function which is 1 if 3 k x 2 3 k for some k 0 and is otherwise zero. Prove or contradict 91. For f(x) = x and [0, 1], 1 x dx = 1/2. 0 Prove or contradict 92. Suppose that {x i } and {z j } are two partitions of [a, b] so that for every i there is a j = j(i) with z j = x i. That is, {z j } is a refinement of {x i }. Fix a function f on [a, b]. Then U(f, {x i }) U(f, {z i }). Similarly, L(f, {x i }) L(f, {z i }). Prove or contradict 93. Suppose that f is continuous (everywhere). Then f is integrable on any bounded interval [a, b]. Exercise 54. Define f n (x) for x > 1 by f n (x) = x n when x < 1 and f(x) = x 1/n for x 1. What is g(x) defined by g(x) = lim n f n (x)? Prove or contradict 94. Suppose that for each n N, f n is continuous. Suppose that a function g(x) exists so that for every x in some open set U, f n (x) g(x) (as n ). Fix a bounded interval [a, b] U. Then given any ɛ > 0 there is an N so that f n (x) g(x) < ɛ for all x [a, b]. Prove or contradict 95. Suppose that for each n N, f n is continuous. Suppose that a function g exists so that f n (x) g(x) (as n ) for every x U. Then g is integrable on any bounded interval [a, b] U. Prove or contradict 96. Suppose that {f n } is a sequence of continuous functions. Suppose that {f n } converges to g uniformly on [a, b]. Then g is integrable on [a, b] and b a b g = lim f. n a Definition 37. A function f defined on [a, b] has variation V for the partition {x i } of [a, b], when V (f, {x i }) = n i=1 f(x i) f(x i 1 ). Definition 38. A function f defined on [a, b] is of bounded variation on [a, b], when there is a bound B so that the variation of f satisfies V (f, {x i }) B for any partition {x i } of [a, b]. Prove or contradict 97. Suppose that {x i } and {z j } are two partitions of [a, b] so that for every i there is a j = j(i) with z j = x i. That is, {z j } is a refinement of {x i }. Fix a function f on [a, b]. Then V (f, {x i }) V (f, {z i }). Prove or contradict 98. Suppose a function f is continuous on the bounded interval [a, b]. Then there is a K so that f(x) f(z) K x z for any x [a, b] and z [a, b]. 18

Prove or contradict 99. A continuous function f is of bounded variation on any bounded interval [a, b]. Prove or contradict 100. Suppose that f is of bounded variation on [a, b]. Then f is integrable on [a, b]. 19

List of Some Symbols N The natural numbers {1, 2, 3,...}. Q The rational numbers. R The real line. R 2 The Euclidean plane. The empty set. For all. There exists (an element). \, A \ B Difference of sets: the elements of A that are not elements of B. Ā The closure of A., x A Element: x is an element of the set A., x A Not an element: x is not an element of the set A. Intersection (of sets). Union (of sets)., A The boundary of a set. The Euclidean distance from the origin. (a, b] The interval of real numbers, {x : a < x b}. INDEX Accumulation point of a set 5 Approaches (a value or point) 10 Boundary of a set 6 Bounded set 9 Bounded variation 18 Cauchy (sequence) 12 Closed set 5 Closure of a set 6 Collection of sets 5 Compact 13 Complete 12 Connected set 8 20

Continuous (function) 14 Converge (numbers) 10 Converges (sequence of functions) 16 Countable set 2 Cover, open 12 Decreasing (sequence) 11 Disjoint sets 7 Finite set 2 Image (of a set under a map) 15 Increasing (sequence) 11 Indexed collection of sets 5 Integral 17 Interval 9 Inverse image 15 Inverse mapping 1 Least upper bound 9 Limit value 10 Lower bound 9 Maximum 9 Minimum 9 Neighborhood of a point 5 Open set 4 One to one mapping 1 Partition of an interval 17 Separated sets 7 Sequence 10 Strictly decreasing (sequence) 11 Strictly increasing (sequence) 11 Subcover 12 Sums upper and lower 17 Supremum 15 Surjective mapping 1 Terms (of a sequence) 10 Uniform convergence 16 Uniformly continuous 15 Upper bound 9 Variation 18 21