M17 MAT25-21 HOMEWORK 6
|
|
- Kristina Boyd
- 5 years ago
- Views:
Transcription
1 M17 MAT25-21 HOMEWORK 6 DUE 10:00AM WEDNESDAY SEPTEMBER 13TH 1. To Hand In Double Series. The exercises in this section will guide you to complete the proof of the following theorem: Theorem 1: Absolute Convergence of Iterated and Double Series (Abbott Theorem 2.8.1) Let (a ij ) be a double sequence. If the iterated series a ij j=1 j=1 a ij and converges, then both iterated series j=1 a ij converge to the same value A, and the unordered series i,j=1 a ij converges as a square sum to A as well. Let (a ij ) be a double sequence and suppose that the iterated series converges. Define t mn = m n j=1 a ij. Exercise 1: (Abbott Exercise 2.8.3) j=1 a ij (a) Prove that the sequence (t nn ) converges. (b) Use the fact that (t nn ) is a Cauchy sequence to argue that (s nn ) converges. Now we show that the iterated sum j=1 a ij converges to S. Solution 1. (a) By hypothesis, the iterated series j=1 a ij converges. This means that for all i N, the series j=1 a ij converges to some b i, and the series b i converges as well, say to C. Define t mn = m n j=1 a ij. We claim that the sequence (t nn ) n=1 converges. Given any i N, note that the sequence of partial sums of j=1 a ij is increasing. Since j=1 a ij = b i, it follows that a i a in b i for all n N. Furthermore, each b i is nonnegative. So since b i = C, we have that b b n C for all n N. Therefore, we can compute t nn = ( a a 1n ) + ( a a 2n ) ( a n a nn ) b 1 + b b n C. Hence the sequence (t nn ) is bounded above by C. Additionally, (t nn ) is increasing. Therefore by the monotone convergence theorem, (t nn ) converges. (b) Now we claim that (s nn ) is Cauchy. Let ɛ > 0 be arbitrary. Since (t nn ) converges, it is Cauchy. Therefore there exists some N N such that if n > m N, we have t nn t mm < ɛ. Compute 1
2 M17 MAT25-21 HOMEWORK 6 2 s nn s mm = (1) m<i n m<j n m<i n m<j n a ij a ij = t nn t mm < ɛ. Here (1) follows from the triangle inequality. Therefore if n > m N, we have that s nn s mm < ɛ. So (s nn ) is a Cauchy sequence, and therefore converges. Let S = lim n s nn. Let S = lim n s nn and B = sup{t mn m, n N}. Exercise 2: (Abbott Exercise 2.8.4) (a) Let ɛ > 0 be arbitrary and prove that there exists N 1 N such that for all n, m N 1, we have B ɛ/4 < t mn B. (b) Show that there exists N N such that for all n, m N, we have s mn S < ɛ/2. Solution 2. (a) Since (t nn ) is bounded by C, for any m, n N, we let k = max(m, n) and then we have that t mn t kk B. Hence the set {t mn m, n N} is bounded, and therefore we can let B = sup{t mn m, n N}. Given any ɛ > 0, there exists t mñ such that B ɛ/4 < t mñ B. Let N 1 = max( m, ñ). Then we have that t mñ t N1 N 1 B, and if n, m N 1, then we have B ɛ/4 < t mñ t N1 N 1 t mn B. Therefore we have found N 1 N such that if n, m N 1, then B ɛ/4 < t mn B. As a consequence of this, we have that whenever n, m N 1, it follows that t mn t mm < ɛ/4. (b) Furthermore, since (s nn ) S, there exists N 2 such that if n N then s nn S < ɛ/4. Let N = max(n 1, N 2 ). Then if n, m N, we may assume, without loss of generality, that n > m. Then we compute s mn S = s mn s mm + s mm S s mn s mm + s mm S (1) t mn t mm + s mm S < ɛ/4 + ɛ/4 = ɛ/2 Here, (1) follows from the triangle inequality. By hypothesis, for each i, the series j=1 a ij converges, and therefore the series j=1 a ij converges to some r i R.
3 M17 MAT25-21 HOMEWORK 6 3 Exercise 3: (Abbott Exercise 2.8.5) (a) Let ɛ > 0 and N be as in the previous exercise. Show that for all m N we have (r r m ) S ɛ/2 < ɛ. Conclude that the iterated sum j=1 a ij converges to S. (b) Show that the other iterated sum j=1 a ij also converges to S. Notice that the same argument can be used once it is established that, for each column j, the sum a ij converges to some real number c j. Solution 3. (a) Recall that by hypothesis, for each i N, j=1 a ij converges, so the series j=1 a ij is absolutely convergent, and therefore convergent, say to r i. Then for any m N, the Algebraic Limit Theorem says that m a ij = r r m. j=1 Since the sequence of partial sums of j=1 m a ij is (s mn ), it follows that lim s mn = r r m. n Therefore if m N, then for all n N, we have Hence by the Order Limit Theorem ɛ/2 + S < s mn < ɛ/2 + S. ɛ/2 + S r r m ɛ/2 + S = (r r m ) S ɛ/2 = (r r m ) S < ɛ. Therefore it follows that r i = S. In other words, we have j=1 a ij = S, as desired. (b) To show that the other iterated series converges to S, we first show that the jth column of the series converges for all j N. Recall that summing along the rows gives j=1 a ij = b i. This implies that a ij b i. Since j=1 b j converges, the Comparison Test then implies that j=1 a ij converges as well, say to c j. Then a similar argument to that above shows that j=1 a ij = S, as desired. Products of Series. Exercise 4: (Abbott Exercise 2.8.7) Assume that a i and j=1 b j converge absolutely to A and B respectively. (a) Prove that the iterated series j=1 a ib j converges. (b) Prove that the unordered series i,j=1 a ib j converges as a square sum to AB, and use it to show that the iterated series j=1 a ib j and j=1 a ib j, as well as k=2 d k, all converge to AB. Here, as in the lecture notes, we define d k = 1 i,j k i+j=k a i b j = a 1 b k 1 + a 2 b k a k 1 b 1.
4 M17 MAT25-21 HOMEWORK 6 4 Solution 4. (a) Since j=1 b j converges absolutely, it follows that j=1 b j converges to some D R, hence by the Algebraic Limit Theorem, for each i N, j=1 a i b j converges to a i D. But then because a i converges to some C R, the sum a i D converges to CD. Therefore the iterated series j=1 a ib j converges to CD. (b) The sequence (s nn ) is given by s nn = n j=1 n a i b j = (a a n )(b b n ). Since lim n (a a n ) = A and lim n (b b n ) = B, it follows from the Algebraic Limit Theorem for sequences that lim n s nn = AB. Hence the unordered series i,j=1 a ib j converges as a square sum to AB. By the previous three Exercises, it then follows that the iterated series j=1 a ib j and j=1 a ib j also converge to AB. The sequence (t m ) of partial sums of the series k=2 d k satisfies t m = d d m+1 = s l,l t m s m+1,m+1. for some l N. Therefore by the squeeze theorem, it follows that lim m t m = AB. Open sets, Closed Sets, and Limit Points. Exercise 5: (Abbott Exercise 3.2.6) Decide whether the following statements are true or false. If they re true, prove them. If they are false, provide counter examples. (a) An open set that contains every rational number must necessarily contain all of R. (b) The Nested Interval Property remains true if the term closed interval is replaced by closed set. (c) Every nonempty open set contains a rational number. (d) Every bounded, infinite, closed set contains a rational number. Solution 5. (a) This is false. The set (, 2) ( 2, ) is the union of two open intervals, and is therefore open, and it contains every real number except for 2, so it contains every rational number, however it does not contain 2, so it does not contain every real number. (b) This is false. Let F 1 = N, F 2 = N {1}, F 3 = N {1, 2}, and for any n N, F n = N {1, 2,..., n 1}. A similar proof to that which we used to show that N is closed shows that F n is closed for all n N. Furthermore n F n, so F n is nonempty. Finally, we have that F 1 F 2 F 3... However for each n N, we have that n / F n+1, and therefore n=1 F n =. (c) This is true. Let O be a nonempty open set. Since it is nonempty, there exists x O, and since O is open, it follows that there is some ɛ > 0 such that V ɛ (x) O. Then x ɛ < x + ɛ, so by the density of Q in R, there exists some r Q with x ɛ < r < x + ɛ, and therefore r V ɛ (x) O. (d) This is not true. Consider the set { n n N} { 2}. Then Problem 3 on the practice final tells us that this set is closed, and yet because 2 is irrational, so is n for all n N. This follows from noting that if n were rational, then because 1 n is also rational, and the sum of two rational numbers is rational, it follows that 2 = n 1 n Q, a contradiction.
5 M17 MAT25-21 HOMEWORK 6 5 Closure. Exercise 6: (Abbot Exercise 3.2.4) Let A be nonempty and bounded above so that sup(a) exists. (a) Show that sup(a) A. (b) Can an open set contain its supremum? Solution 6. (a) If sup(a) A, then sup(a) A since A = A L where L is the set of limit points of A. If sup(a) / A, then Problem 4 part (c) on the practice midterm shows that sup(a) is a limit point of A, and therefore sup(a) L, so sup(a) A. (b) No. Let U be an open, nonempty, bounded above subset of R. Then s = sup U exists. If s U, then because U is open, there exists some ɛ > 0 such that V ɛ (s) U. However s < s + ɛ/2, yet s + ɛ/2 is contained in V ɛ (s), and therefore in U, contradicting that s is an upper bound for U. Therefore s / U, as desired. Exercise 7: (Abbot Exercise 3.2.8) Assume A is an open set and B is a closed set. Determine if the following sets are open, closed, both, or neither and prove your result. (a) A B. (b) A B = {x A x / B}. (c) (A c B) c. (d) (A B) (A c B). (e) (A) c A c. Solution 7. (a) (Closed). Always. For any set C, C is closed. Therefore A B is always closed. (Open). Sometimes. If we let A = B = R, then we have A B = R which is open. On the other hand, if we let A = B = [0, 1]. Then A B = [0, 1], which is not open. (Both). Sometimes. If we let A = B = R, then we have A B = R which is both open and closed. On the other hand, if we let A = B = [0, 1]. Then A B = [0, 1], which is not open, and hence not both open and closed. (Neither). Never. Since A B is always closed, it can never be neither open nor closed. (b) (Open). Always. Note that we can write A B = A B c. Therefore if A is open and B is closed, B c is open, and therefore this is the intersection of finitely many open sets, which is open. (Closed). Sometimes. If we let B = and A = R, then A B = R, which is closed. On the other hand, if we let A = (0, 2) and B = [1, 3], then A B = (0, 1) which is not closed. (Both). Sometimes. If we let B = and A = R, then A B = R, which is both open and closed. On the other hand, if we let A = (0, 2) and B = [1, 3], then A B = (0, 1) which is not closed, and hence not both open and closed. (Neither). Never. Since A B is open, it can never be neither open nor closed. (c) (Closed). Always. Since A is open, A c is closed. Since B is open and the union of open sets is open, A c B is open. Then (A c B) c is closed. (Open). Sometimes. If we let A = B = R, then we have (A c B) c = which is open. On the other hand, if we let A = R, B = (0, 1). Then (A c B) c = (, 0] [1, ) which is not open. (Both). Sometimes. If we let A = B = R, then we have (A c B) c = which is both open and closed. On the other hand, if we let A = R, B = (0, 1). Then (A c B) c = (, 0] [1, ) which is not open, and hence not both open and closed. (Neither). Never. Since (A c B) c is always closed, it can never be neither open nor closed.
6 (d) In this case, in fact we have that (A B) (A c B) = B. Therefore, M17 MAT25-21 HOMEWORK 6 6 (Open). Always. By hypothesis, B is open. (Closed). Sometimes. If B =, R, then B is closed as well. If B = (0, 1), then B is not closed. (Both). Sometimes. If B =, R, then B is open and closed. If B = (0, 1), then B is not both closed and open. (Neither). Never. Since B is always open, it follows that B is never neither open nor closed. (e) In this case, since A is open, it follows that A c is closed, and hence that A c = A c. Since A A, we have (A) c A c, hence (A) c A c = (A) c. (Open). Always. Since A is closed, (A) c is open. (Closed). Sometimes. If A =, then (A) c = R which is closed. If A = (0, 1), then A = [0, 1] and (A) c = (, 0) (1, ) which is not closed. (Both). Sometimes. If A =, then (A) c = R which is both closed and open. If A = (0, 1), then A = [0, 1] and (A) c = (, 0) (1, ) which is not closed and therefore not both open and closed. (Neither). Never. Since (A) c is open is always open, it follows that (A) c is open is never neither open nor closed. Exercise 8: (Abbot Exercise ) Define the interior of a set E to be the set E = U E U open (a) Prove that E = {x E V ɛ (x) E for some ɛ > 0}. (b) Show that E is closed if and only if E = E. Show that E is open if and only if E = E. (c) Show that (E) c = (E c ) and (E ) c = E c. U Solution 8. (a) Define A = {x E V ɛ (x) E for some ɛ > 0}. We show mutual containment. ( ). Given any open subset U E, for any x U, by openness of U, we have that there exists ɛ > 0 such that V ɛ (x) U E. But this implies that x A, hence U A. Since U was an arbitrary open subset of E, it follows that E = U E U open U A as well. ( ). We ll show that A is an open set. Given any y A, we have that y E and there exists some ɛ > 0 such that V ɛ (y) Y. However, since the set V ɛ (y) is open, for any z V ɛ (y), there exists some δ > 0 such that V δ (z) V ɛ (y) E. Therefore z A as well. Hence in fact we have V ɛ (y) A. Since y A was arbitrary, it follows that A is open. Note also that A E. So A is one of the sets in the union U E U open U, which implies that A E. (b) (Closure). Recall that E = E L where L is the set of limit points of E. ( ). If E is closed, then E contains all of its limit points, therefore L E, so E = E L = E. ( ). If E = E, then because the closure of any set is closed, it follows that E is closed as well. (Interior). ( ). If E is open, then for every point in x there exists ɛ > 0 such that V ɛ (x) E. Therefore every x is in {x E V ɛ (x) for some ɛ > 0} = E. Since it s clear from the definition that E E, we have that E = E. ( ). If E = E, then since E is by definition a union of open sets, it is itself open, and therefore E is open as well. (c) ((E) c = (E c ) ). We show mutual containment. ( ). Since E is a closed set, it follows that (E) c is an open set. Furthermore since E E, we have that (E) c E c. Therefore (E) c is an open set which is contained in E c, so it is contained in (E c ). ( ). Suppose that U is an open subset of E c. Then for any x U, there exists some ɛ > 0 such that V ɛ (x) U. This shows that x is not in E and that x is not a limit point of E, and
7 M17 MAT25-21 HOMEWORK 6 7 therefore that U (E) c. Hence every open subset of E c is also contained in (E) c. Since (E c ) is the union of all of these open sets, it follows that (E c ) (E) c. ((E ) c = E c ). We show mutual containment. ( ). Let F be a closed set which contains E c. Then F c is open and F c E. Hence F c E, which implies that F (E ) c. Hence any closed subset containing E c also contains (E ) c, so in particular we have (E ) c E c. ( ). Since E is an open set, it follows that (E ) c is a closed set. Furthermore, since E E, we have that E c (E ) c. But this implies that (E ) c is a closed set which contains E c, and therefore E c (E ) c. Compact Sets. Exercise 9: (Abbot Exercise 3.3.4) Assume K is a compact set and F is a closed set. Determine if the following sets are open, closed, both, or neither, and prove your result. (a) K F. (b) F c K c. (c) K F = {x K x / F }. (d) K F c. Solution 9. (a) (Closed). Always. Since K is compact, it is closed, and since K and F are closed, K F is closed. (Open). Sometimes. If K = [0, 1] and F =, then K F = which is open. However let K = [0, 1] = F. Then K F = [0, 1] which is not open. (Both). Sometimes. If K = [0, 1] and F =, then K F = which is both open and closed. However let K = [0, 1] = F. Then K F = [0, 1] which is not both open and closed. (Neither). Never. Since K F is always closed, it follows that K F is never neither open nor closed. (b) (Closed). Always. The closure of any set is a closed set. (Open). Sometimes. Let F = K =. Then F c = K c = R, hence F c K c = R, so F c K c = R, which is open. But if we let F = K = [0, 1], (Both). Sometimes. Let F = K =. Then F c = K c = R, hence F c K c = R, so F c K c = R, which is also open. (Neither). Never. Since F c K c is always closed, it follows that F c K c is never neither open nor closed. (c) (Closed). Sometimes. If K = F =, then K F =, which is closed. On the other hand, if K = [0, 3] and F = [1, 2], then K F = [0, 1) (2, 3], which is not closed. (Open). Sometimes. If K = F =, then K F =, which is open. On the other hand, if K = [0, 3] and F = [1, 2], then K F = [0, 1) (2, 3], which is not open. (Both). Sometimes. If K = F =, then K F =, which is both open and closed. On the other hand, if K = [0, 3] and F = [1, 2], then K F = [0, 1) (2, 3], which is not both open and closed. (Neither). Sometimes. If K = F =, then K F =, which is not neither. On the other hand, if K = [0, 3] and F = [1, 2], then K F = [0, 1) (2, 3], which is neither open nor closed. (d) (Closed). Always. The closure of any set is always closed. (Open). Sometimes. If K =, F = R, then K F c =, which is open. But if K = [0, 1] and F =, then K F c = [0, 1], which is not open. (Both). Sometimes. If K =, F = R, then K F c =, which is both open and closed. But if K = [0, 1] and F =, then K F c = [0, 1], which is not both open and closed. (Neither). Never. Since it is always closed, it is never neither open nor closed.
8 M17 MAT25-21 HOMEWORK 6 8 Exercise 10: (Abbot Exercise 3.3.4) Decide whether the following propositions are true or false. If they are true, prove it. If not, find a counter example. (a) The arbitrary intersection of compact sets is compact. (b) The arbitrary union of compact sets is compact. (c) Let A be arbitrary and let K be compact. Then, the intersection A K is compact. (d) If F 1 F 2... is a nested sequence of non-empty closed sets, then we have n=1 F n. Solution 10. (a) This is true. Let {K α α I} be a collection of compact sets. Then by the Heine-Borel theorem, each K α is closed and bounded. Since α I K α is contained in every K α, it follows that this intersection is bounded as well. Furthermore, because each K α is closed and the arbitrary intersection of closed sets is closed, it follows that α I K α is closed as well. Hence α I K α is closed and bounded, which implies it is compact by the Heine-Borel theorem. (b) This is false. For n Z, let K n = [n, n + 1]. Then each K n is closed and bounded, so by the Heine-Borel theorem, each K n is compact. However, we compute K n = R, n= which is not bounded, and therefore not compact by the Heine-Borel theorem. (c) This is false. The interval K = [0, 2] is closed and bounded and hence compact, yet if we let A = (1, 3), then K A = (1, 2] which is not closed, and therefore not compact. (d) This is false. (And actually the same as Exercise 5 (b)). Let F 1 = N, F 2 = N {1}, F 3 = N {1, 2}, and for any n N, F n = N {1, 2,..., n 1}. A similar proof to that which we used to show that N is closed shows that F n is closed for all n N. Furthermore n F n, so F n is nonempty. Finally, we have that F 1 F 2 F 3... However for each n N, we have that n / F n+1, and therefore n=1 F n =. 2. Practice Problems (Don t hand these in) Exercise 11: (Abbot Exercise ) (a) Prove that A B = A B. (b) Does this result about closures extend to infinite unions of sets?
This exam contains 5 pages (including this cover page) and 4 questions. The total number of points is 100. Grade Table
MAT25-2 Summer Session 2 207 Practice Final August 24th, 207 Time Limit: Hour 40 Minutes Name: Instructor: Nathaniel Gallup This exam contains 5 pages (including this cover page) and 4 questions. The total
More informationMath 421, Homework #7 Solutions. We can then us the triangle inequality to find for k N that (x k + y k ) (L + M) = (x k L) + (y k M) x k L + y k M
Math 421, Homework #7 Solutions (1) Let {x k } and {y k } be convergent sequences in R n, and assume that lim k x k = L and that lim k y k = M. Prove directly from definition 9.1 (i.e. don t use Theorem
More informationHomework 4, 5, 6 Solutions. > 0, and so a n 0 = n + 1 n = ( n+1 n)( n+1+ n) 1 if n is odd 1/n if n is even diverges.
2..2(a) lim a n = 0. Homework 4, 5, 6 Solutions Proof. Let ɛ > 0. Then for n n = 2+ 2ɛ we have 2n 3 4+ ɛ 3 > ɛ > 0, so 0 < 2n 3 < ɛ, and thus a n 0 = 2n 3 < ɛ. 2..2(g) lim ( n + n) = 0. Proof. Let ɛ >
More informationMath 341 Summer 2016 Midterm Exam 2 Solutions. 1. Complete the definitions of the following words or phrases:
Math 34 Summer 06 Midterm Exam Solutions. Complete the definitions of the following words or phrases: (a) A sequence (a n ) is called a Cauchy sequence if and only if for every ɛ > 0, there exists and
More informationSequences. Chapter 3. n + 1 3n + 2 sin n n. 3. lim (ln(n + 1) ln n) 1. lim. 2. lim. 4. lim (1 + n)1/n. Answers: 1. 1/3; 2. 0; 3. 0; 4. 1.
Chapter 3 Sequences Both the main elements of calculus (differentiation and integration) require the notion of a limit. Sequences will play a central role when we work with limits. Definition 3.. A Sequence
More informationMath 421, Homework #6 Solutions. (1) Let E R n Show that = (E c ) o, i.e. the complement of the closure is the interior of the complement.
Math 421, Homework #6 Solutions (1) Let E R n Show that (Ē) c = (E c ) o, i.e. the complement of the closure is the interior of the complement. 1 Proof. Before giving the proof we recall characterizations
More informationCopyright 2010 Pearson Education, Inc. Publishing as Prentice Hall.
.1 Limits of Sequences. CHAPTER.1.0. a) True. If converges, then there is an M > 0 such that M. Choose by Archimedes an N N such that N > M/ε. Then n N implies /n M/n M/N < ε. b) False. = n does not converge,
More informationHW 4 SOLUTIONS. , x + x x 1 ) 2
HW 4 SOLUTIONS The Way of Analysis p. 98: 1.) Suppose that A is open. Show that A minus a finite set is still open. This follows by induction as long as A minus one point x is still open. To see that A
More informationProblem Set 2: Solutions Math 201A: Fall 2016
Problem Set 2: s Math 201A: Fall 2016 Problem 1. (a) Prove that a closed subset of a complete metric space is complete. (b) Prove that a closed subset of a compact metric space is compact. (c) Prove that
More information1 Topology Definition of a topology Basis (Base) of a topology The subspace topology & the product topology on X Y 3
Index Page 1 Topology 2 1.1 Definition of a topology 2 1.2 Basis (Base) of a topology 2 1.3 The subspace topology & the product topology on X Y 3 1.4 Basic topology concepts: limit points, closed sets,
More informationEC 521 MATHEMATICAL METHODS FOR ECONOMICS. Lecture 1: Preliminaries
EC 521 MATHEMATICAL METHODS FOR ECONOMICS Lecture 1: Preliminaries Murat YILMAZ Boğaziçi University In this lecture we provide some basic facts from both Linear Algebra and Real Analysis, which are going
More informationReal Analysis Math 131AH Rudin, Chapter #1. Dominique Abdi
Real Analysis Math 3AH Rudin, Chapter # Dominique Abdi.. If r is rational (r 0) and x is irrational, prove that r + x and rx are irrational. Solution. Assume the contrary, that r+x and rx are rational.
More informationMaths 212: Homework Solutions
Maths 212: Homework Solutions 1. The definition of A ensures that x π for all x A, so π is an upper bound of A. To show it is the least upper bound, suppose x < π and consider two cases. If x < 1, then
More informationConsequences of Continuity
Consequences of Continuity James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University October 4, 2017 Outline 1 Domains of Continuous Functions 2 The
More informationMT804 Analysis Homework II
MT804 Analysis Homework II Eudoxus October 6, 2008 p. 135 4.5.1, 4.5.2 p. 136 4.5.3 part a only) p. 140 4.6.1 Exercise 4.5.1 Use the Intermediate Value Theorem to prove that every polynomial of with real
More informationIn N we can do addition, but in order to do subtraction we need to extend N to the integers
Chapter The Real Numbers.. Some Preliminaries Discussion: The Irrationality of 2. We begin with the natural numbers N = {, 2, 3, }. In N we can do addition, but in order to do subtraction we need to extend
More informationTheorems. Theorem 1.11: Greatest-Lower-Bound Property. Theorem 1.20: The Archimedean property of. Theorem 1.21: -th Root of Real Numbers
Page 1 Theorems Wednesday, May 9, 2018 12:53 AM Theorem 1.11: Greatest-Lower-Bound Property Suppose is an ordered set with the least-upper-bound property Suppose, and is bounded below be the set of lower
More informationIn N we can do addition, but in order to do subtraction we need to extend N to the integers
Chapter 1 The Real Numbers 1.1. Some Preliminaries Discussion: The Irrationality of 2. We begin with the natural numbers N = {1, 2, 3, }. In N we can do addition, but in order to do subtraction we need
More informationREVIEW OF ESSENTIAL MATH 346 TOPICS
REVIEW OF ESSENTIAL MATH 346 TOPICS 1. AXIOMATIC STRUCTURE OF R Doğan Çömez The real number system is a complete ordered field, i.e., it is a set R which is endowed with addition and multiplication operations
More informationA lower bound for X is an element z F such that
Math 316, Intro to Analysis Completeness. Definition 1 (Upper bounds). Let F be an ordered field. For a subset X F an upper bound for X is an element y F such that A lower bound for X is an element z F
More informationSpring 2014 Advanced Probability Overview. Lecture Notes Set 1: Course Overview, σ-fields, and Measures
36-752 Spring 2014 Advanced Probability Overview Lecture Notes Set 1: Course Overview, σ-fields, and Measures Instructor: Jing Lei Associated reading: Sec 1.1-1.4 of Ash and Doléans-Dade; Sec 1.1 and A.1
More informationMATH 51H Section 4. October 16, Recall what it means for a function between metric spaces to be continuous:
MATH 51H Section 4 October 16, 2015 1 Continuity Recall what it means for a function between metric spaces to be continuous: Definition. Let (X, d X ), (Y, d Y ) be metric spaces. A function f : X Y is
More informationEconomics 204 Fall 2012 Problem Set 3 Suggested Solutions
Economics 204 Fall 2012 Problem Set 3 Suggested Solutions 1. Give an example of each of the following (and prove that your example indeed works): (a) A complete metric space that is bounded but not compact.
More informationMATH 324 Summer 2011 Elementary Number Theory. Notes on Mathematical Induction. Recall the following axiom for the set of integers.
MATH 4 Summer 011 Elementary Number Theory Notes on Mathematical Induction Principle of Mathematical Induction Recall the following axiom for the set of integers. Well-Ordering Axiom for the Integers If
More informationEconomics 204 Fall 2011 Problem Set 2 Suggested Solutions
Economics 24 Fall 211 Problem Set 2 Suggested Solutions 1. Determine whether the following sets are open, closed, both or neither under the topology induced by the usual metric. (Hint: think about limit
More informationMATH 101, FALL 2018: SUPPLEMENTARY NOTES ON THE REAL LINE
MATH 101, FALL 2018: SUPPLEMENTARY NOTES ON THE REAL LINE SEBASTIEN VASEY These notes describe the material for November 26, 2018 (while similar content is in Abbott s book, the presentation here is different).
More informationHomework 3 Solutions, Math 55
Homework 3 Solutions, Math 55 1.8.4. There are three cases: that a is minimal, that b is minimal, and that c is minimal. If a is minimal, then a b and a c, so a min{b, c}, so then Also a b, so min{a, b}
More informationSample Problems for the Second Midterm Exam
Math 3220 1. Treibergs σιι Sample Problems for the Second Midterm Exam Name: Problems With Solutions September 28. 2007 Questions 1 10 appeared in my Fall 2000 and Fall 2001 Math 3220 exams. (1) Let E
More informationThe Real Number System
MATH 337 The Real Number System Sets of Numbers Dr. Neal, WKU A set S is a well-defined collection of objects, with well-defined meaning that there is a specific description from which we can tell precisely
More informationIndeed, if we want m to be compatible with taking limits, it should be countably additive, meaning that ( )
Lebesgue Measure The idea of the Lebesgue integral is to first define a measure on subsets of R. That is, we wish to assign a number m(s to each subset S of R, representing the total length that S takes
More informationx 0 + f(x), exist as extended real numbers. Show that f is upper semicontinuous This shows ( ɛ, ɛ) B α. Thus
Homework 3 Solutions, Real Analysis I, Fall, 2010. (9) Let f : (, ) [, ] be a function whose restriction to (, 0) (0, ) is continuous. Assume the one-sided limits p = lim x 0 f(x), q = lim x 0 + f(x) exist
More informationReal Analysis Notes. Thomas Goller
Real Analysis Notes Thomas Goller September 4, 2011 Contents 1 Abstract Measure Spaces 2 1.1 Basic Definitions........................... 2 1.2 Measurable Functions........................ 2 1.3 Integration..............................
More informationThat is, there is an element
Section 3.1: Mathematical Induction Let N denote the set of natural numbers (positive integers). N = {1, 2, 3, 4, } Axiom: If S is a nonempty subset of N, then S has a least element. That is, there is
More informationMath LM (24543) Lectures 01
Math 32300 LM (24543) Lectures 01 Ethan Akin Office: NAC 6/287 Phone: 650-5136 Email: ethanakin@earthlink.net Spring, 2018 Contents Introduction, Ross Chapter 1 and Appendix The Natural Numbers N and The
More informationSet, functions and Euclidean space. Seungjin Han
Set, functions and Euclidean space Seungjin Han September, 2018 1 Some Basics LOGIC A is necessary for B : If B holds, then A holds. B A A B is the contraposition of B A. A is sufficient for B: If A holds,
More informationMath 117: Topology of the Real Numbers
Math 117: Topology of the Real Numbers John Douglas Moore November 10, 2008 The goal of these notes is to highlight the most important topics presented in Chapter 3 of the text [1] and to provide a few
More informationCharacterisation of Accumulation Points. Convergence in Metric Spaces. Characterisation of Closed Sets. Characterisation of Closed Sets
Convergence in Metric Spaces Functional Analysis Lecture 3: Convergence and Continuity in Metric Spaces Bengt Ove Turesson September 4, 2016 Suppose that (X, d) is a metric space. A sequence (x n ) X is
More informationContinuity. Chapter 4
Chapter 4 Continuity Throughout this chapter D is a nonempty subset of the real numbers. We recall the definition of a function. Definition 4.1. A function from D into R, denoted f : D R, is a subset of
More information1 Lecture 4: Set topology on metric spaces, 8/17/2012
Summer Jump-Start Program for Analysis, 01 Song-Ying Li 1 Lecture : Set topology on metric spaces, 8/17/01 Definition 1.1. Let (X, d) be a metric space; E is a subset of X. Then: (i) x E is an interior
More informationMATH NEW HOMEWORK AND SOLUTIONS TO PREVIOUS HOMEWORKS AND EXAMS
MATH. 4433. NEW HOMEWORK AND SOLUTIONS TO PREVIOUS HOMEWORKS AND EXAMS TOMASZ PRZEBINDA. Final project, due 0:00 am, /0/208 via e-mail.. State the Fundamental Theorem of Algebra. Recall that a subset K
More informationU e = E (U\E) e E e + U\E e. (1.6)
12 1 Lebesgue Measure 1.2 Lebesgue Measure In Section 1.1 we defined the exterior Lebesgue measure of every subset of R d. Unfortunately, a major disadvantage of exterior measure is that it does not satisfy
More informationReal Variables: Solutions to Homework 3
Real Variables: Solutions to Homework 3 September 3, 011 Exercise 0.1. Chapter 3, # : Show that the cantor set C consists of all x such that x has some triadic expansion for which every is either 0 or.
More informationMath 410 Homework 6 Due Monday, October 26
Math 40 Homework 6 Due Monday, October 26. Let c be any constant and assume that lim s n = s and lim t n = t. Prove that: a) lim c s n = c s We talked about these in class: We want to show that for all
More informationContents Ordered Fields... 2 Ordered sets and fields... 2 Construction of the Reals 1: Dedekind Cuts... 2 Metric Spaces... 3
Analysis Math Notes Study Guide Real Analysis Contents Ordered Fields 2 Ordered sets and fields 2 Construction of the Reals 1: Dedekind Cuts 2 Metric Spaces 3 Metric Spaces 3 Definitions 4 Separability
More informationAnalysis Finite and Infinite Sets The Real Numbers The Cantor Set
Analysis Finite and Infinite Sets Definition. An initial segment is {n N n n 0 }. Definition. A finite set can be put into one-to-one correspondence with an initial segment. The empty set is also considered
More information1. Supremum and Infimum Remark: In this sections, all the subsets of R are assumed to be nonempty.
1. Supremum and Infimum Remark: In this sections, all the subsets of R are assumed to be nonempty. Let E be a subset of R. We say that E is bounded above if there exists a real number U such that x U for
More informationWe are going to discuss what it means for a sequence to converge in three stages: First, we define what it means for a sequence to converge to zero
Chapter Limits of Sequences Calculus Student: lim s n = 0 means the s n are getting closer and closer to zero but never gets there. Instructor: ARGHHHHH! Exercise. Think of a better response for the instructor.
More informationMATH 102 INTRODUCTION TO MATHEMATICAL ANALYSIS. 1. Some Fundamentals
MATH 02 INTRODUCTION TO MATHEMATICAL ANALYSIS Properties of Real Numbers Some Fundamentals The whole course will be based entirely on the study of sequence of numbers and functions defined on the real
More informationMetric Space Topology (Spring 2016) Selected Homework Solutions. HW1 Q1.2. Suppose that d is a metric on a set X. Prove that the inequality d(x, y)
Metric Space Topology (Spring 2016) Selected Homework Solutions HW1 Q1.2. Suppose that d is a metric on a set X. Prove that the inequality d(x, y) d(z, w) d(x, z) + d(y, w) holds for all w, x, y, z X.
More informationµ (X) := inf l(i k ) where X k=1 I k, I k an open interval Notice that is a map from subsets of R to non-negative number together with infinity
A crash course in Lebesgue measure theory, Math 317, Intro to Analysis II These lecture notes are inspired by the third edition of Royden s Real analysis. The Jordan content is an attempt to extend the
More informationMath 118B Solutions. Charles Martin. March 6, d i (x i, y i ) + d i (y i, z i ) = d(x, y) + d(y, z). i=1
Math 8B Solutions Charles Martin March 6, Homework Problems. Let (X i, d i ), i n, be finitely many metric spaces. Construct a metric on the product space X = X X n. Proof. Denote points in X as x = (x,
More informationThe Heine-Borel and Arzela-Ascoli Theorems
The Heine-Borel and Arzela-Ascoli Theorems David Jekel October 29, 2016 This paper explains two important results about compactness, the Heine- Borel theorem and the Arzela-Ascoli theorem. We prove them
More informationConsequences of Continuity
Consequences of Continuity James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University October 4, 2017 Outline Domains of Continuous Functions The Intermediate
More informationMath 421, Homework #9 Solutions
Math 41, Homework #9 Solutions (1) (a) A set E R n is said to be path connected if for any pair of points x E and y E there exists a continuous function γ : [0, 1] R n satisfying γ(0) = x, γ(1) = y, and
More informationMath 320-2: Midterm 2 Practice Solutions Northwestern University, Winter 2015
Math 30-: Midterm Practice Solutions Northwestern University, Winter 015 1. Give an example of each of the following. No justification is needed. (a) A metric on R with respect to which R is bounded. (b)
More information1/12/05: sec 3.1 and my article: How good is the Lebesgue measure?, Math. Intelligencer 11(2) (1989),
Real Analysis 2, Math 651, Spring 2005 April 26, 2005 1 Real Analysis 2, Math 651, Spring 2005 Krzysztof Chris Ciesielski 1/12/05: sec 3.1 and my article: How good is the Lebesgue measure?, Math. Intelligencer
More informationDiscrete Mathematics. Spring 2017
Discrete Mathematics Spring 2017 Previous Lecture Principle of Mathematical Induction Mathematical Induction: rule of inference Mathematical Induction: Conjecturing and Proving Climbing an Infinite Ladder
More informationHomework 1 (revised) Solutions
Homework 1 (revised) Solutions 1. Textbook, 1.1.1, # 1.1.2 (p. 24) Let S be an ordered set. Let A be a non-empty finite subset. Then A is bounded and sup A, inf A A Solution. The hint was: Use induction,
More informationThe Lebesgue Integral
The Lebesgue Integral Brent Nelson In these notes we give an introduction to the Lebesgue integral, assuming only a knowledge of metric spaces and the iemann integral. For more details see [1, Chapters
More informationMath 324 Summer 2012 Elementary Number Theory Notes on Mathematical Induction
Math 4 Summer 01 Elementary Number Theory Notes on Mathematical Induction Principle of Mathematical Induction Recall the following axiom for the set of integers. Well-Ordering Axiom for the Integers If
More informationmeans is a subset of. So we say A B for sets A and B if x A we have x B holds. BY CONTRAST, a S means that a is a member of S.
1 Notation For those unfamiliar, we have := means equal by definition, N := {0, 1,... } or {1, 2,... } depending on context. (i.e. N is the set or collection of counting numbers.) In addition, means for
More informationLogical Connectives and Quantifiers
Chapter 1 Logical Connectives and Quantifiers 1.1 Logical Connectives 1.2 Quantifiers 1.3 Techniques of Proof: I 1.4 Techniques of Proof: II Theorem 1. Let f be a continuous function. If 1 f(x)dx 0, then
More informationMAT1000 ASSIGNMENT 1. a k 3 k. x =
MAT1000 ASSIGNMENT 1 VITALY KUZNETSOV Question 1 (Exercise 2 on page 37). Tne Cantor set C can also be described in terms of ternary expansions. (a) Every number in [0, 1] has a ternary expansion x = a
More informationNORMS ON SPACE OF MATRICES
NORMS ON SPACE OF MATRICES. Operator Norms on Space of linear maps Let A be an n n real matrix and x 0 be a vector in R n. We would like to use the Picard iteration method to solve for the following system
More informationThe Arzelà-Ascoli Theorem
John Nachbar Washington University March 27, 2016 The Arzelà-Ascoli Theorem The Arzelà-Ascoli Theorem gives sufficient conditions for compactness in certain function spaces. Among other things, it helps
More informationA LITTLE REAL ANALYSIS AND TOPOLOGY
A LITTLE REAL ANALYSIS AND TOPOLOGY 1. NOTATION Before we begin some notational definitions are useful. (1) Z = {, 3, 2, 1, 0, 1, 2, 3, }is the set of integers. (2) Q = { a b : aεz, bεz {0}} is the set
More informationMath 328 Course Notes
Math 328 Course Notes Ian Robertson March 3, 2006 3 Properties of C[0, 1]: Sup-norm and Completeness In this chapter we are going to examine the vector space of all continuous functions defined on the
More informationChapter 1. Measure Spaces. 1.1 Algebras and σ algebras of sets Notation and preliminaries
Chapter 1 Measure Spaces 1.1 Algebras and σ algebras of sets 1.1.1 Notation and preliminaries We shall denote by X a nonempty set, by P(X) the set of all parts (i.e., subsets) of X, and by the empty set.
More informationg 2 (x) (1/3)M 1 = (1/3)(2/3)M.
COMPACTNESS If C R n is closed and bounded, then by B-W it is sequentially compact: any sequence of points in C has a subsequence converging to a point in C Conversely, any sequentially compact C R n is
More informationSolutions for Homework Assignment 2
Solutions for Homework Assignment 2 Problem 1. If a,b R, then a+b a + b. This fact is called the Triangle Inequality. By using the Triangle Inequality, prove that a b a b for all a,b R. Solution. To prove
More informationMATH 117 LECTURE NOTES
MATH 117 LECTURE NOTES XIN ZHOU Abstract. This is the set of lecture notes for Math 117 during Fall quarter of 2017 at UC Santa Barbara. The lectures follow closely the textbook [1]. Contents 1. The set
More informationCOMPLEX ANALYSIS TOPIC XVI: SEQUENCES. 1. Topology of C
COMPLEX ANALYSIS TOPIC XVI: SEQUENCES PAUL L. BAILEY Abstract. We outline the development of sequences in C, starting with open and closed sets, and ending with the statement of the Bolzano-Weierstrauss
More informationMATH 301 INTRO TO ANALYSIS FALL 2016
MATH 301 INTRO TO ANALYSIS FALL 016 Homework 04 Professional Problem Consider the recursive sequence defined by x 1 = 3 and +1 = 1 4 for n 1. (a) Prove that ( ) converges. (Hint: show that ( ) is decreasing
More informationMATHS 730 FC Lecture Notes March 5, Introduction
1 INTRODUCTION MATHS 730 FC Lecture Notes March 5, 2014 1 Introduction Definition. If A, B are sets and there exists a bijection A B, they have the same cardinality, which we write as A, #A. If there exists
More informationAdvanced Calculus: MATH 410 Real Numbers Professor David Levermore 5 December 2010
Advanced Calculus: MATH 410 Real Numbers Professor David Levermore 5 December 2010 1. Real Number System 1.1. Introduction. Numbers are at the heart of mathematics. By now you must be fairly familiar with
More informationLecture 4: Completion of a Metric Space
15 Lecture 4: Completion of a Metric Space Closure vs. Completeness. Recall the statement of Lemma??(b): A subspace M of a metric space X is closed if and only if every convergent sequence {x n } X satisfying
More information2. Metric Spaces. 2.1 Definitions etc.
2. Metric Spaces 2.1 Definitions etc. The procedure in Section for regarding R as a topological space may be generalized to many other sets in which there is some kind of distance (formally, sets with
More informationLecture Notes on Metric Spaces
Lecture Notes on Metric Spaces Math 117: Summer 2007 John Douglas Moore Our goal of these notes is to explain a few facts regarding metric spaces not included in the first few chapters of the text [1],
More informationSolutions to Homework Assignment 2
Solutions to Homework Assignment Real Analysis I February, 03 Notes: (a) Be aware that there maybe some typos in the solutions. If you find any, please let me know. (b) As is usual in proofs, most problems
More informationMATH 409 Advanced Calculus I Lecture 7: Monotone sequences. The Bolzano-Weierstrass theorem.
MATH 409 Advanced Calculus I Lecture 7: Monotone sequences. The Bolzano-Weierstrass theorem. Limit of a sequence Definition. Sequence {x n } of real numbers is said to converge to a real number a if for
More informationMidterm Review Math 311, Spring 2016
Midterm Review Math 3, Spring 206 Material Review Preliminaries and Chapter Chapter 2. Set theory (DeMorgan s laws, infinite collections of sets, nested sets, cardinality) 2. Functions (image, preimage,
More informationIntroduction to Topology
Introduction to Topology Randall R. Holmes Auburn University Typeset by AMS-TEX Chapter 1. Metric Spaces 1. Definition and Examples. As the course progresses we will need to review some basic notions about
More informationNumerical Sequences and Series
Numerical Sequences and Series Written by Men-Gen Tsai email: b89902089@ntu.edu.tw. Prove that the convergence of {s n } implies convergence of { s n }. Is the converse true? Solution: Since {s n } is
More informationContribution of Problems
Exam topics 1. Basic structures: sets, lists, functions (a) Sets { }: write all elements, or define by condition (b) Set operations: A B, A B, A\B, A c (c) Lists ( ): Cartesian product A B (d) Functions
More informationWeek 2: Sequences and Series
QF0: Quantitative Finance August 29, 207 Week 2: Sequences and Series Facilitator: Christopher Ting AY 207/208 Mathematicians have tried in vain to this day to discover some order in the sequence of prime
More informationLecture 2: A crash course in Real Analysis
EE5110: Probability Foundations for Electrical Engineers July-November 2015 Lecture 2: A crash course in Real Analysis Lecturer: Dr. Krishna Jagannathan Scribe: Sudharsan Parthasarathy This lecture is
More informationPart III. 10 Topological Space Basics. Topological Spaces
Part III 10 Topological Space Basics Topological Spaces Using the metric space results above as motivation we will axiomatize the notion of being an open set to more general settings. Definition 10.1.
More informationMid Term-1 : Practice problems
Mid Term-1 : Practice problems These problems are meant only to provide practice; they do not necessarily reflect the difficulty level of the problems in the exam. The actual exam problems are likely to
More informationEssential Background for Real Analysis I (MATH 5210)
Background Material 1 Essential Background for Real Analysis I (MATH 5210) Note. These notes contain several definitions, theorems, and examples from Analysis I (MATH 4217/5217) which you must know for
More informationContinuity. Matt Rosenzweig
Continuity Matt Rosenzweig Contents 1 Continuity 1 1.1 Rudin Chapter 4 Exercises........................................ 1 1.1.1 Exercise 1............................................. 1 1.1.2 Exercise
More information2.1 Convergence of Sequences
Chapter 2 Sequences 2. Convergence of Sequences A sequence is a function f : N R. We write f) = a, f2) = a 2, and in general fn) = a n. We usually identify the sequence with the range of f, which is written
More informationA lower bound for X is an element z F such that
Math 316, Intro to Analysis Completeness. Definition 1 (Upper bounds). Let F be an ordered field. For a subset X F an upper bound for X is an element y F such that A lower bound for X is an element z F
More informationIntroductory Analysis 1 Fall 2009 Homework 4 Solutions to Exercises 1 3
Introductory Analysis 1 Fall 2009 Homework 4 Solutions to Exercises 1 3 Note: This homework consists of a lot of very simple exercises, things you should do on your own. A minimum part of it will be due
More informationMATH 23b, SPRING 2005 THEORETICAL LINEAR ALGEBRA AND MULTIVARIABLE CALCULUS Midterm (part 1) Solutions March 21, 2005
MATH 23b, SPRING 2005 THEORETICAL LINEAR ALGEBRA AND MULTIVARIABLE CALCULUS Midterm (part 1) Solutions March 21, 2005 1. True or False (22 points, 2 each) T or F Every set in R n is either open or closed
More informationElementary Analysis Math 140C Spring 1993
Elementary Analysis Math 140C Spring 1993 Bernard Russo September 12, 2005 Course: Mathematics 140C MWF 11:00 11:50 SSTR 100 Instructor: Bernard Russo PS 270 Office Hours MWF 1:15-2:00 or by appointment
More informationMAT 570 REAL ANALYSIS LECTURE NOTES. Contents. 1. Sets Functions Countability Axiom of choice Equivalence relations 9
MAT 570 REAL ANALYSIS LECTURE NOTES PROFESSOR: JOHN QUIGG SEMESTER: FALL 204 Contents. Sets 2 2. Functions 5 3. Countability 7 4. Axiom of choice 8 5. Equivalence relations 9 6. Real numbers 9 7. Extended
More informationDefinition 2.1. A metric (or distance function) defined on a non-empty set X is a function d: X X R that satisfies: For all x, y, and z in X :
MATH 337 Metric Spaces Dr. Neal, WKU Let X be a non-empty set. The elements of X shall be called points. We shall define the general means of determining the distance between two points. Throughout we
More informationSome Background Material
Chapter 1 Some Background Material In the first chapter, we present a quick review of elementary - but important - material as a way of dipping our toes in the water. This chapter also introduces important
More informationReal Analysis. Joe Patten August 12, 2018
Real Analysis Joe Patten August 12, 2018 1 Relations and Functions 1.1 Relations A (binary) relation, R, from set A to set B is a subset of A B. Since R is a subset of A B, it is a set of ordered pairs.
More informationClass Notes for MATH 255.
Class Notes for MATH 255. by S. W. Drury Copyright c 2006, by S. W. Drury. Contents 0 LimSup and LimInf Metric Spaces and Analysis in Several Variables 6. Metric Spaces........................... 6.2 Normed
More information