Copyright 2010 Pearson Education, Inc. Publishing as Prentice Hall.

Size: px
Start display at page:

Download "Copyright 2010 Pearson Education, Inc. Publishing as Prentice Hall."

Transcription

1 .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, but /n = 1/ n 0 c) False. = 1 converges and y n = ( 1) n is bounded, but y n = ( 1) n does not converge. d) False. = 1/n converges to 0 and y n = n > 0, but y n = n does not converge a) By the Archimedean Principle, given ε > 0 there is an N N such that N > 1/ε. Thus n N implies ( 1/n) 1/n 1/N < ε. b) By the Archimedean Principle, given ε > 0 there is an N N such that N > π /ε. Thus n N implies 1 + π/ n 1 π/ n π/ N < ε. c) By the Archimedean Principle, given ε > 0 there is an N N such that N > 3/ε. Thus n N implies 3(1 + 1/n) 3 3/n 3/N < ε. d) By the Archimedean Principle, given ε > 0 there is an N N such that N > 1/ 3ε. Thus n N implies (n + 1)/(3n ) /3 1/(3n ) 1/(3N ) < ε..1.. a) By hypothesis, given ε > 0 there is an N N such that n N implies 1 < ε/. Thus n N implies < ε. b) By hypothesis, given ε > 0 there is an N N such that n N implies > 1/ and 1 < ε/4. In particular, 1/ <. Thus n N implies (π )/ (π ) ( 1)/ < 4 1 < ε. c) By hypothesis, given ε > 0 there is an N N such that n N implies > 1/ and 1 < ε/(1 + e). Thus n N and the triangle inequality imply (x n e)/ (1 e) e ( e ) < 1 (1 + e) < ε a) If n k = k, then 3 ( 1) n k converges to ; if n k = k + 1, then 3 ( 1) n k 4 converges to 4. b) If n k = k, then ( 1) 3nk + ( 1) 6k + = 1 + = 3 converges to 3; if n k = k + 1, then ( 1) 3nk + ( 1) 6k+3 + = 1 + = 1 converges to 1. c) If n k = k, then (n k ( 1) n k n k 1)/n k 1/(k) converges to 0; if n k = k+1, then (n k ( 1) n k n k 1)/n k (n k 1)/n k = (4k + 1)/(k + 1) converges to Suppose is bounded. By Definition.7, there are numbers M and m such that m M for all n N. Set C := max{1, M, m }. Then C > 0, M C, and m C. Therefore, C C, i.e., < C for all n N. Conversely, if < C for all n N, then is bounded above by C and below by C If C = 0, there is nothing to prove. Otherwise, given ε > 0 use Definition.1 to choose an N N such that n N implies b n b n < ε/ C. Hence by hypothesis, n N implies By definition, a a C b n < ε If = a for all n, then a = 0 is less than any positive ε for all n N. Thus, by definition, a 10

2 .1.7. a) Let a be the common limit point. Given ε > 0, choose N N such that n N implies a and y n a are both < ε/. By the Triangle Inequality, n N implies y n a + y n a < ε. By definition, y n 0 b) If n converges to some a, then given ε = 1/, 1 = (n + 1) n < (n + 1) a + n a < 1 for n sufficiently large, a contradiction. c) Let = n and y n = n + 1/n. Then y n = 1/n 0 as n, but neither nor y n converges By Theorem.6, if a then k a. Conversely, if k a for every subsequence, then it converges for the subsequence.. Limit Theorems...0. a) False. Let = n and y n = n and note by Exercise..a that + y n b) True. Let ε > 0. If as n, then choose N N such that n N implies < 1/ε. Then < 0 so = > 0. Multiply < 1/ε by ε/( ) which is positive. We obtain ε < 1/, i.e., 1/ = 1/ < ε. c) False. Let = ( 1) n /n. Then 1/ = ( 1) n n has no limit d) True. Since ( x x) = x log 1 > 1 for all x, i.e., x x is increasing on [, ). In particular, x x > 0, i.e., x > x for x. Thus, since as n, we have xn > for n large, hence xn < a) 1/n 0 as n and we can apply the Squeeze Theorem. b) n/(n + π) = (/n)/(1 + π/n ) 0/(1 + 0) = 0 by Theorem.1. c) ( n + 1)/(n + ) = (( / n) + (1/n))/(1 + ( /n)) 0/(1 + 0) = 0 by Exercise..5 and Theorem.1. d) An easy induction argument shows that n + 1 < n for n = 3, 4,.... We will use this to prove that n n for n = 4, 5,.... It s surely true for n = 4. If it s true for some n 4, then the inductive hypothesis and the fact that n + 1 < n imply (n + 1) = n + n + 1 n + n + 1 < n + n = n+1 so the second inequality has been proved. Now the second inequality implies n/ n < 1/n for n 4. Hence by the Squeeze Theorem, n/ n 0... a) Let M R and choose by Archimedes an N N such that N > max{m, }. Then n N implies n n = n(n 1) N(N 1) > M( 1) = M. b) Let M R and choose by Archimedes an N N such that N > M/. Notice that n 1 implies 3n 3 so 1 3n. Thus n N implies n 3n = n(1 3n) n N < M. c) Let M R and choose by Archimedes an N N such that N > M. Then n N implies (n + 1)/n = n + 1/n > N + 0 > M. d) Let M R satisfy M 0. Then + sin θ 1 = 1 implies n ( + sin(n 3 + n + 1)) n 1 > 0 M for all n N. On the other hand, if M > 0, then choose by Archimedes an N N such that N > M. Then n N implies n ( + sin(n 3 + n + 1)) n 1 N > M...3. a) Following Example.13, + 3n 4n 1 n + 3n = (/n ) + (3/n) 4 (1/n ) (/n) b) Following Example.13, n 3 + n n 3 + n = 1 + (1/n ) (/n 3 ) + (1/n ) (/n 3 ) 1 11

3 c) Rationalizing the expression, we obtain ( 3n + n)( 3n + + n) n + 3n + n = = 3n + + n 3n + + n as n by the method of Example.13. (Multiply top and bottom by 1/ n.) d) Multiply top and bottom by 1/ n to obtain 4n + 1 n 4 + 1/n 1 1/n = 1 9n + 1 n /n 1 + /n 3 1 = a) Clearly, Thus Since y 0, y n y / for large n. Thus x y n y = y xy n = y xy + xy xy n. yy n yy n x y n y 1 y n x + x yy n y n y. x y n y y x + x y y n y 0 as n by Theorem.1i and ii. Hence by the Squeeze Theorem, /y n x/y b) By symmetry, we may suppose that x = y =. Since y n implies y n > 0 for n large, we can apply Theorem.15 directly to obtain the conclusions when α > 0. For the case α < 0, > M implies α < αm. Since any M 0 R can be written as αm for some M R, we see by definition that..5. Case 1. x = 0. Let ɛ > 0 and choose N so large that n N implies < ɛ. By (8) in 1.1, < ɛ for n N, i.e., 0 Case. x > 0. Then xn x = ( ( xn + ) x x) xn + = x x xn + x. Since 0, it follows that x x x. This last quotient converges to 0 by Theorem.1. Hence it follows from the Squeeze Theorem that x..6. By the Density of Rationals, there is an r n between x + 1/n and x for each n N. Since x r n < 1/n, it follows from the Squeeze Theorem that r n x..7. a) By Theorem.9 we may suppose that x =. By symmetry, we may suppose that x =. By definition, given M R, there is an N N such that n N implies > M. Since w n, it follows that w n > M for all n N. By definition, then, w n b) If x and y are finite, then the result follows from Theorem.17. If x = y = ± or x = y =, there is nothing to prove. It remains to consider the case x = and y =. But by Definition.14 (with M = 0), > 0 > y n for n sufficiently large, which contradicts the hypothesis y n...8. a) Take the limit of +1 = 1 1, We obtain x = 1 1 x, i.e., x x = 0. Therefore, x = 0, 1. b) Take the limit of +1 = + We obtain x = + x, i.e., x 5x + 6 = 0. Therefore, x =, 3. But x 1 > 3 and induction shows that +1 = + > + 3 = 3, so the limit must be x = 3. c) Take the limit of +1 = + We obtain x = + x, i.e., x x = 0. Therefore, x =, 1. But +1 = + 0 by definition (all square roots are nonnegative), so the limit must be x =. This proof doesn t change if x 1 >, so the limit is again x =. 1

4 ..9. a) Let E = {k Z : k 0 and k 10 n+1 y}. Since 10 n+1 y < 10, E {0, 1,..., 9}. Hence w := sup E E. It follows that w 10 n+1 y, i.e., w/10 n+1 y. On the other hand, since w + 1 is not the supremum of E, w + 1 > 10 n+1 y. Therefore, y < w/10 n+1 + 1/10 n+1. b) Apply a) for n = 0 to choose x 1 = w such that x 1 /10 x < x 1 /10 + 1/10. Suppose s n := n n x k 10 k x < x k 10 k n. Then 0 < x s n < 1/10 n, so by a) choose +1 such that +1 /10 n+1 x s n < +1 /10 n+1 + 1/10 n+1, i.e., n+1 n+1 x k 10 k x < x k 10 k n+1. c) Combine b) with the Squeeze Theorem. d) Since an easy induction proves that 9 n > n for all n N, we have 9 n < 1/n. Hence the Squeeze Theorem implies that 9 n 0 Hence, it follows from Exercise 1.4.4c and definition that Similarly,.4999 = lim n k=.999 = lim.3 The Bolzano Weierstrass Theorem k = 4 ( 10 + lim ) 10 9 n = = 0.5. n ( 9 10 k = lim 1 1 ) 9 n = a) False. = 1/4 + 1/(n + 4) is strictly decreasing and 1/4 + 1/5 < 1/, but 1/4 as n. b) True. Since (n 1)/(n 1) 1/ as n, this factor is bounded. Since cos(n + n + 1) 1, it follows that { } is bounded. Hence it has a convergent subsequence by the Bolzano Weierstrass Theorem. c) False. = 1/ 1/n is strictly increasing and 1/ < 1 + 1/n, but 1/ d) False. = (1 + ( 1) n )n satisfies = 0 for n odd and = n for n even. Thus x k+1 0 as k, but is NOT bounded Suppose that 1 < 1 < 0 for some n 0. Then 0 < < 1 so 0 < < and it follows that 1 < =. Moreover, = 0. Hence by induction, is increasing and bounded above by 0. It follows from the Monotone Convergence Theorem that a Taking the limit of = we see that a + a = 0, i.e., a = 1, 0. Since increases from x 0 > 1, the limit is 0. If x 0 = 1, then = 1 for all n. If x 0 = 0, then = 0 for all n. Finally, it is easy to verify that if x 0 = l for l = 1 or 0, then = l for all n, hence l.3.. If x 1 = 0 then = 0 for all n, hence converges to 0. If 0 < x 1 < 1, then by 1.4.1c, is decreasing and bounded below. Thus the limit, a, exists by the Monotone Convergence Theorem. Taking the limit of +1 = 1 1, as n, we have a = 1 1 a, i.e., a = 0, 1. Since x 1 < 1, the limit must be zero. Finally, +1 = 1 1 xn = 1 (1 ) (1 + 1 ) = Case 1. x 0 =. Then = for all n, so the limit is. Case. < x 0 < 3. Suppose that < 1 3 for some n 1. Then 0 < 1 1 so 1 1, i.e., = Moreover, = = 3. Hence by induction, is increasing and bounded above by 3. It follows from the Monotone Convergence Theorem that a Taking the limit of + 1 = we see that a 5a + 6 = 0, i.e., a =, 3. Since increases from x 0 >, the limit is 3. Case 3. x 0 3. Suppose that 1 3 for some n 1. Then 1 1 so 1 1, i.e., = Moreover, = = 3. Hence by induction, is decreasing 13

5 and bounded above by 3. By repeating the steps in Case, we conclude that decreases from x 0 3 to the limit Case 1. x 0 < 1. Suppose 1 < 1. Then 1 = 1 < = < = 1. Thus { } is increasing and bounded above, so x. Taking the limit of = (1 + 1 )/ as n, we see that x = (1 + x)/, i.e., x = 1. Case. x 0 1. If 1 1 then 1 = = 1 = 1. Thus { } is decreasing and bounded below. Repeating the argument in Case 1, we conclude that 1 as n The result is obvious when x = 0. If x > 0 then by Example. and Theorem.6, lim x1/(n 1) = lim m x1/m = 1. If x < 0 then since n 1 is odd, we have by the previous case that x 1/(n 1) = ( x) 1/(n 1) a) Suppose that { } is increasing. If { } is bounded above, then there is an x R such that x (by the Monotone Convergence Theorem). Otherwise, given any M > 0 there is an N N such that x N > M. Since { } is increasing, n N implies x N > M. Hence b) If { } is decreasing, then is increasing, so part a) applies Choose by the Approximation Property an x 1 E such that sup E 1 < x 1 sup E. Since sup E / E, we also have x 1 < sup E. Suppose x 1 < x < < in E have been chosen so that sup E 1/n < < sup E. Choose by the Approximation Property an +1 E such that max{, sup E 1/(n + 1)} < +1 sup E. Then sup E 1/(n + 1) < +1 < sup E and < +1. Thus by induction, x 1 < x <... and by the Squeeze Theorem, sup E.3.8. a) This follows immediately from Exercise b) By a), +1 = ( + y n )/ < / =. Thus y n+1 < +1 < < x 1. Similarly, y n = y n < y n = y n+1 implies +1 > y n+1 > y n > y 1. Thus { } is decreasing and bounded below by y 1 and {y n } is increasing and bounded above by x 1. c) By b), +1 y n+1 = + y n y n < + y n y n = y n. Hence by induction and a), 0 < +1 y n+1 < (x 1 y 1 )/ n. d) By b), there exist x, y R such that x and y n y By c), x y (x 1 y 1 ) 0 = 0. Hence x = y Since x 0 = 1 and y 0 = 0, x n+1 y n+1 = ( + y n ) ( + y n ) = x n + y n = = ( 1) n (x 0 y 0 ) = ( 1) n. Notice that x 1 = 1 = y 1. If y n 1 n 1 and 1 1 then y n = 1 + y n (n 1) = n and = 1 + y n 1 1. Thus 1/y n 0 as n and 1 for all n N. Since x n yn = x n yn = 1 0 as n, it follows that /y n ± Since, y n > 0, the limit must be. y n 14 y n

6 a) Notice x 0 > y 0 > 1. If 1 > y n 1 > 1 then y n 1 1 y n 1 = y n 1 (y n 1 1 ) > 0 so y n 1 (y n ) < 1 y n 1. In particular, = 1y n y n 1 > y n 1. It follows that > y n 1 > 1, so > y n 1 = y n > 1 1 = 1. Hence by induction, > y n > 1 for all n N. Now y n < implies y n < + y n. Thus +1 = y n + y n <. Hence, { } is decreasing and bounded below (by 1). Thus by the Monotone Convergence Theorem, x for some x R. On the other hand, y n+1 is the geometric mean of +1 and y n, so by Exercise 1..6, y n+1 y n. Since y n is bounded above (by x 0 ), we conclude that y n y as n for some y R. b) Let n in the identity y n+1 = +1 y n. We obtain, from part a), y = xy, i.e., x = y. A direct calculation yields y 6 > and x 7 < Cauchy sequences a) False. a n = 1 is Cauchy and b n = ( 1) n is bounded, but a n b n = ( 1) n does not converge, hence cannot be Cauchy by Theorem.9. b) False. a n = 1 and b n = 1/n are Cauchy, but a n /b n = n does not converge, hence cannot be Cauchy by Theorem.9. c) True. If (a n + b n ) 1 converged to 0, then given any M R, M 0, there is an N N such that n N implies a n + b n 1 < 1/ M. It follows that n N implies a n + b n > M > 0 > M. In particular, a n + b n diverges to. But if a n and b n are Cauchy, then by Theorem.9, a n +b n x where x R. Thus a n +b n x, NOT. d) False. If x k = log k and = 0 for n k, then x k x k 1 = log(k/(k 1)) 0 as k, but x k does not converge, hence cannot be Cauchy by Theorem Since (n + 3)/(n 3 + 5n + 3n + 1) 0 as n, it follows from the Squeeze Theorem that 0 Hence by Theorem.9, is Cauchy..4.. If is Cauchy, then there is an N N such that n N implies x N < 1. Since x N Z, it follows that = x N for all n N. Thus set a := x N Suppose and y n are Cauchy and let ε > 0. a) If α = 0, then α = 0 for all n N, hence is Cauchy. If α 0, then there is an N N such that n, m N implies x m < ε/ α. Hence α αx m α x m < ε for n, m N. b) There is an N N such that n, m N implies x m and y n y m are < ε/. Hence + y n (x m + y m ) x m + y n y m < ε for n, m N. c) By repeating the proof of Theorem.8, we can show that every Cauchy sequence is bounded. Thus choose M > 0 such that and y n are both M for all n N. There is an N N such that n, m N implies x m and y n y m are both < ε/(m). Hence for n, m N. y n (x m y m ) x m y m + y n y m < ε.4.4. Let s n = n 1 x k for n =, 3,.... If m > n then s m+1 s n = m k=n x k. Therefore, s n is Cauchy by hypothesis. Hence s n converges by Theorem.9. 15

7 .4.5. Let = n ( 1)k /k for n N. Suppose n and m are even and m > n. Then S := m ( 1) k k=n k 1 ( 1 n n ) ( 1 n + m 1 1 ). m Each term in parentheses is positive, so the absolute value of S is dominated by 1/n. Similar arguments prevail for all integers n and m. Since 1/n 0 as n, it follows that satisfies the hypotheses of Exercise.4.4. Hence must converge to a finite real number By Exercise 1.4.4c, if m n then x m+1 = m (x k+1 x k ) k=n m k=n ( 1 a k = 1 1 a m (1 1 ) 1 a n ) a 1. Thus x m+1 (1/a n 1/a m )/(a 1) 0 as n, m since a > 1. Hence { } is Cauchy and must converge by Theorem a) Suppose a is a cluster point for some set E and let r > 0. Since E (a r, a + r) contains infinitely many points, so does E (a r, a + r) \ {a}. Hence this set is nonempty. Conversely, if E (a s, a + s) \ {a} is always nonempty for all s > 0 and r > 0 is given, choose x 1 E (a r, a + r). If distinct points x 1,..., x k have been chosen so that x k E (a r, a + r) and s := min{ x 1 a,..., x k a }, then by hypothesis there is an x k+1 E (a s, a + s). By construction, x k+1 does not equal any x j for 1 j k. Hence x 1,..., x k+1 are distinct points in E (a r, a + r). By induction, there are infinitely many points in E (a r, a + r). b) If E is a bounded infinite set, then it contains distinct points x 1, x,.... Since { } E, it is bounded. It follows from the Bolzano Weierstrass Theorem that contains a convergent subsequence, i.e., there is an a R such that given r > 0 there is an N N such that k N implies k a < r. Since there are infinitely many k s and they all belong to E, a is by definition a cluster point of E a) To show E := [a, b] is sequentially compact, let E. By the Bolzano Weierstrass Theorem, has a convergent subsequence, i.e., there is an x 0 R and integers n k such that k x 0 as k. Moreover, by the Comparison Theorem, E implies x 0 E. Thus E is sequentially compact by definition. b) (0, 1) is bounded and 1/n (0, 1) has no convergent subsequence with limit in (0, 1). c) [0, ) is closed and n [0, ) is a sequence which has no convergent subsequence..5 Limits supremum and infimum a) Since 3 ( 1) n = when n is even and 4 when n is odd, lim sup = 4 and lim inf =. b) Since cos(nπ/) = 0 if n is odd, 1 if n = 4m and 1 if n = 4m +, lim sup = 1 and lim inf = 1. c) Since ( 1) n+1 + ( 1) n /n = 1 + 1/n when n is even and 1 1/n when n is odd, lim sup = 1 and lim inf = 1. d) Since 1/ as n, lim sup = lim inf = 1/ by Theorem.36. e) Since y n M, y n /n M/n 0 Therefore, lim sup = lim inf = 0 by Theorem.36. f) Since n(1 + ( 1) n ) + n 1 (( 1) n 1) = n when n is even and /n when n is odd, lim sup = and lim inf = 0. g) Clearly Therefore, lim sup = lim inf = by Theorem By Theorem 1.0, lim inf ( ) := lim ( inf ( x k)) = lim A similar argument establishes the second identity. (sup x k ) = lim sup a) Since lim (sup x k ) < r, there is an N N such that sup k N x k < r, i.e., x k < r for all k N. b) Since lim (sup x k ) > r, there is an N N such that sup k N x k > r, i.e., there is a k 1 N such that x k1 > r. Suppose k ν N have been chosen so that k 1 < k < < k j and x kν > r for ν = 1,,..., j. Choose N > k j such that sup k N x k > r. Then there is a k j+1 > N > k j such that x kj+1 > r. Hence by induction, there are distinct natural numbers k 1, k,... such that x kj > r for all j N. 16

8 .5.4. a) Since inf x k + inf y k is a lower bound of x j + y j for any j n, we have inf x k + inf y k inf j n (x j + y j ). Taking the limit of this inequality as n, we obtain lim inf + lim inf y n lim inf ( + y n ). Note, we used Corollary 1.16 and the fact that the sum on the left is not of the form. Similarly, for each j n, inf (x k + y k ) x j + y j sup x k + y j. Taking the infimum of this inequality over all j n, we obtain inf (x k +y k ) sup x k +inf j n y j. Therefore, lim inf ( + y n ) lim sup + lim inf y n. The remaining two inequalities follow from Exercise.5.. For example, lim sup + lim inf y n = lim inf ( ) lim sup( y n ) lim inf ( y n ) = lim sup( + y n ). b) It suffices to prove the first identity. By Theorem.36 and a), lim + lim inf y n lim inf ( + y n ). To obtain the reverse inequality, notice by the Approximation Property that for each n N there is a j n > n such that inf (x k + y k ) > x jn 1/n + y jn. Hence inf (x k + y k ) > x jn 1 n + inf y k for all n N. Taking the limit of this inequality as n, we obtain lim inf ( + y n ) lim + lim inf y n. c) Let = ( 1) n and y n = ( 1) n+1. Then the limits infimum are both 1, the limits supremum are both 1, but + y n = 0 0 If = ( 1) n and y n = 0 then lim inf ( + y n ) = 1 < 1 = lim sup + lim inf y n a) For any j n, x j sup x k and y j sup y k. Multiplying these inequalities, we have x j y j (sup x k )(sup y k ), i.e., sup x j y j (sup x k )(sup y k ). j n Taking the limit of this inequality as n establishes a). The inequality can be strict because if { 0 n even = 1 y n = 1 n odd then lim sup ( y n ) = 0 < 1 = (lim sup )(lim sup y n ). b) By a), lim inf (y n ) = lim sup( y n ) lim sup( ) lim sup y n = lim inf lim sup y n Case 1. x =. By hypothesis, C := lim sup y n > 0. Let M > 0 and choose N N such that n N implies M/C and sup n N y n > C/. Then sup k N (x k y k ) y n (M/C)y n for any n N and sup k N (x k y k ) (M/C) sup n N y n > M. Therefore, lim sup ( y n ) =. 17

9 Case. 0 x <. By Exercise.5.6a and Theorem.36, lim sup ( y n ) (lim sup )(lim sup y n ) = x lim sup y n. On the other hand, given ɛ > 0 choose n N so that x k > x ɛ for k n. Then x k y k (x ɛ)y k for each k n, i.e., sup (x k y k ) (x ɛ) sup y k. Taking the limit of this inequality as n and as ɛ 0, we obtain lim sup( y n ) x lim sup y n It suffices to prove the first identity. Let s = inf n N (sup x k ). Case 1. s =. Then sup x k = for all n N so by definition, lim sup = lim (sup x k ) = = s. Case. s =. Let M > 0 and choose N N such that sup k N x k M. Then sup x k sup k N x k M for all n N, i.e., lim sup =. Case 3. < s <. Let ɛ > 0 and use the Approximation Property to choose N N such that sup k N x k < s + ɛ. Since sup x k sup k N x k < s + ɛ for all n N, it follows that for n N, i.e., lim sup = s. s ɛ < s sup x k < s + ɛ.5.8. It suffices to establish the first identity. Let s = lim inf. Case 1. s = 0. Then by Theorem.35 there is a subsequence k j such that x kj 0, i.e., 1/x kj as j. In particular, sup (1/x k ) = for all n N, i.e., lim sup (1/ ) = = 1/s. Case. s =. Then x k, i.e., 1/x k 0, as k. Thus by Theorem.36, lim sup (1/ ) = 0 = 1/s. Case 3. 0 < s <. Fix j n. Since 1/ inf x k 1/x j implies 1/ inf x k sup j n (1/x j ), it is clear that 1/s lim sup (1/ ). On the other hand, given ɛ > 0 and n N, choose j > N such that inf x k + ɛ > x j, i.e., 1/(inf x k + ɛ) < 1/x j sup (1/x k ). Taking the limit of this inequality as n and as ɛ 0, we conclude that 1/s lim sup (1/ ) If 0, then 0. Thus by Theorem.36, lim sup = 0. Conversely, if lim sup 0, then 0 lim inf lim sup 0, implies that the limits supremum and infimum of are equal (to zero). Hence by Theorem.36, the limit exists and equals zero. 18

Solutions Manual for Homework Sets Math 401. Dr Vignon S. Oussa

Solutions Manual for Homework Sets Math 401. Dr Vignon S. Oussa 1 Solutions Manual for Homework Sets Math 401 Dr Vignon S. Oussa Solutions Homework Set 0 Math 401 Fall 2015 1. (Direct Proof) Assume that x and y are odd integers. Then there exist integers u and v such

More information

Sequences. 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.

Sequences. 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 information

Midterm Review Math 311, Spring 2016

Midterm 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 information

Sequences. Limits of Sequences. Definition. A real-valued sequence s is any function s : N R.

Sequences. Limits of Sequences. Definition. A real-valued sequence s is any function s : N R. Sequences Limits of Sequences. Definition. A real-valued sequence s is any function s : N R. Usually, instead of using the notation s(n), we write s n for the value of this function calculated at n. We

More information

1. 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. 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 information

,... We would like to compare this with the sequence y n = 1 n

,... We would like to compare this with the sequence y n = 1 n Example 2.0 Let (x n ) n= be the sequence given by x n = 2, i.e. n 2, 4, 8, 6,.... We would like to compare this with the sequence = n (which we know converges to zero). We claim that 2 n n, n N. Proof.

More information

Subsequences and the Bolzano-Weierstrass Theorem

Subsequences and the Bolzano-Weierstrass Theorem Subsequences and the Bolzano-Weierstrass Theorem A subsequence of a sequence x n ) n N is a particular sequence whose terms are selected among those of the mother sequence x n ) n N The study of subsequences

More information

M17 MAT25-21 HOMEWORK 6

M17 MAT25-21 HOMEWORK 6 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

More information

Homework 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.

Homework 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 information

Week 2: Sequences and Series

Week 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 information

1. Theorem. (Archimedean Property) Let x be any real number. There exists a positive integer n greater than x.

1. Theorem. (Archimedean Property) Let x be any real number. There exists a positive integer n greater than x. Advanced Calculus I, Dr. Block, Chapter 2 notes. Theorem. (Archimedean Property) Let x be any real number. There exists a positive integer n greater than x. 2. Definition. A sequence is a real-valued function

More information

MATH 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. 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 information

We 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

We 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 information

MATH 131A: REAL ANALYSIS (BIG IDEAS)

MATH 131A: REAL ANALYSIS (BIG IDEAS) MATH 131A: REAL ANALYSIS (BIG IDEAS) Theorem 1 (The Triangle Inequality). For all x, y R we have x + y x + y. Proposition 2 (The Archimedean property). For each x R there exists an n N such that n > x.

More information

Mathematics 242 Principles of Analysis Solutions for Problem Set 5 Due: March 15, 2013

Mathematics 242 Principles of Analysis Solutions for Problem Set 5 Due: March 15, 2013 Mathematics Principles of Analysis Solutions for Problem Set 5 Due: March 15, 013 A Section 1. For each of the following sequences, determine three different subsequences, each converging to a different

More information

Math 117: Infinite Sequences

Math 117: Infinite Sequences Math 7: Infinite Sequences John Douglas Moore November, 008 The three main theorems in the theory of infinite sequences are the Monotone Convergence Theorem, the Cauchy Sequence Theorem and the Subsequence

More information

MATH 101, FALL 2018: SUPPLEMENTARY NOTES ON THE REAL LINE

MATH 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 information

Math LM (24543) Lectures 01

Math 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 information

Continuity. Chapter 4

Continuity. 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 information

Continuity. Chapter 4

Continuity. 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 information

Econ Slides from Lecture 1

Econ Slides from Lecture 1 Econ 205 Sobel Econ 205 - Slides from Lecture 1 Joel Sobel August 23, 2010 Warning I can t start without assuming that something is common knowledge. You can find basic definitions of Sets and Set Operations

More information

That is, there is an element

That 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 information

FINAL EXAM Math 25 Temple-F06

FINAL EXAM Math 25 Temple-F06 FINAL EXAM Math 25 Temple-F06 Write solutions on the paper provided. Put your name on this exam sheet, and staple it to the front of your finished exam. Do Not Write On This Exam Sheet. Problem 1. (Short

More information

A LITTLE REAL ANALYSIS AND TOPOLOGY

A 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 information

Structure of R. Chapter Algebraic and Order Properties of R

Structure of R. Chapter Algebraic and Order Properties of R Chapter Structure of R We will re-assemble calculus by first making assumptions about the real numbers. All subsequent results will be rigorously derived from these assumptions. Most of the assumptions

More information

MATH 301 INTRO TO ANALYSIS FALL 2016

MATH 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 information

2 Sequences, Continuity, and Limits

2 Sequences, Continuity, and Limits 2 Sequences, Continuity, and Limits In this chapter, we introduce the fundamental notions of continuity and limit of a real-valued function of two variables. As in ACICARA, the definitions as well as proofs

More information

Undergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics

Undergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics An Introductory Single Variable Real Analysis: A Learning Approach through Problem Solving Marcel B. Finan c All Rights

More information

MATH 117 LECTURE NOTES

MATH 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 information

Sequences. We know that the functions can be defined on any subsets of R. As the set of positive integers

Sequences. We know that the functions can be defined on any subsets of R. As the set of positive integers Sequences We know that the functions can be defined on any subsets of R. As the set of positive integers Z + is a subset of R, we can define a function on it in the following manner. f: Z + R f(n) = a

More information

MAT 570 REAL ANALYSIS LECTURE NOTES. Contents. 1. Sets Functions Countability Axiom of choice Equivalence relations 9

MAT 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 information

Real Analysis Math 131AH Rudin, Chapter #1. Dominique Abdi

Real 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 information

Definitions & Theorems

Definitions & Theorems Definitions & Theorems Math 147, Fall 2009 December 19, 2010 Contents 1 Logic 2 1.1 Sets.................................................. 2 1.2 The Peano axioms..........................................

More information

2.1 Convergence of Sequences

2.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 information

Read carefully the instructions on the answer book and make sure that the particulars required are entered on each answer book.

Read carefully the instructions on the answer book and make sure that the particulars required are entered on each answer book. THE UNIVERSITY OF WARWICK FIRST YEAR EXAMINATION: January 2011 Analysis I Time Allowed: 1.5 hours Read carefully the instructions on the answer book and make sure that the particulars required are entered

More information

In N we can do addition, but in order to do subtraction we need to extend N to the integers

In 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 information

MATH3283W LECTURE NOTES: WEEK 6 = 5 13, = 2 5, 1 13

MATH3283W LECTURE NOTES: WEEK 6 = 5 13, = 2 5, 1 13 MATH383W LECTURE NOTES: WEEK 6 //00 Recursive sequences (cont.) Examples: () a =, a n+ = 3 a n. The first few terms are,,, 5 = 5, 3 5 = 5 3, Since 5

More information

In N we can do addition, but in order to do subtraction we need to extend N to the integers

In 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 information

2.2 Some Consequences of the Completeness Axiom

2.2 Some Consequences of the Completeness Axiom 60 CHAPTER 2. IMPORTANT PROPERTIES OF R 2.2 Some Consequences of the Completeness Axiom In this section, we use the fact that R is complete to establish some important results. First, we will prove that

More information

Foundations of Mathematical Analysis

Foundations of Mathematical Analysis Foundations of Mathematical Analysis Fabio Bagagiolo Dipartimento di Matematica, Università di Trento email:fabio.bagagiolo@unitn.it Contents 1 Introduction 2 2 Basic concepts in mathematical analysis

More information

1 Homework. Recommended Reading:

1 Homework. Recommended Reading: Analysis MT43C Notes/Problems/Homework Recommended Reading: R. G. Bartle, D. R. Sherbert Introduction to real analysis, principal reference M. Spivak Calculus W. Rudin Principles of mathematical analysis

More information

Proof. We indicate by α, β (finite or not) the end-points of I and call

Proof. We indicate by α, β (finite or not) the end-points of I and call C.6 Continuous functions Pag. 111 Proof of Corollary 4.25 Corollary 4.25 Let f be continuous on the interval I and suppose it admits non-zero its (finite or infinite) that are different in sign for x tending

More information

Math 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 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 information

Logical Connectives and Quantifiers

Logical 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 information

Discrete Math, Spring Solutions to Problems V

Discrete Math, Spring Solutions to Problems V Discrete Math, Spring 202 - Solutions to Problems V Suppose we have statements P, P 2, P 3,, one for each natural number In other words, we have the collection or set of statements {P n n N} a Suppose

More information

Foundations of Mathematical Analysis

Foundations of Mathematical Analysis Foundations of Mathematical Analysis Fabio Bagagiolo Dipartimento di Matematica, Università di Trento email:bagagiol@science.unitn.it Contents 1 Introduction 3 2 Basic concepts in mathematical analysis

More information

Econ Lecture 3. Outline. 1. Metric Spaces and Normed Spaces 2. Convergence of Sequences in Metric Spaces 3. Sequences in R and R n

Econ Lecture 3. Outline. 1. Metric Spaces and Normed Spaces 2. Convergence of Sequences in Metric Spaces 3. Sequences in R and R n Econ 204 2011 Lecture 3 Outline 1. Metric Spaces and Normed Spaces 2. Convergence of Sequences in Metric Spaces 3. Sequences in R and R n 1 Metric Spaces and Metrics Generalize distance and length notions

More information

1. Let A R be a nonempty set that is bounded from above, and let a be the least upper bound of A. Show that there exists a sequence {a n } n N

1. Let A R be a nonempty set that is bounded from above, and let a be the least upper bound of A. Show that there exists a sequence {a n } n N Applied Analysis prelim July 15, 216, with solutions Solve 4 of the problems 1-5 and 2 of the problems 6-8. We will only grade the first 4 problems attempted from1-5 and the first 2 attempted from problems

More information

Limit and Continuity

Limit and Continuity Limit and Continuity Table of contents. Limit of Sequences............................................ 2.. Definitions and properties...................................... 2... Definitions............................................

More information

MA103 Introduction to Abstract Mathematics Second part, Analysis and Algebra

MA103 Introduction to Abstract Mathematics Second part, Analysis and Algebra 206/7 MA03 Introduction to Abstract Mathematics Second part, Analysis and Algebra Amol Sasane Revised by Jozef Skokan, Konrad Swanepoel, and Graham Brightwell Copyright c London School of Economics 206

More information

C.7. Numerical series. Pag. 147 Proof of the converging criteria for series. Theorem 5.29 (Comparison test) Let a k and b k be positive-term series

C.7. Numerical series. Pag. 147 Proof of the converging criteria for series. Theorem 5.29 (Comparison test) Let a k and b k be positive-term series C.7 Numerical series Pag. 147 Proof of the converging criteria for series Theorem 5.29 (Comparison test) Let and be positive-term series such that 0, for any k 0. i) If the series converges, then also

More information

MA131 - Analysis 1. Workbook 6 Completeness II

MA131 - Analysis 1. Workbook 6 Completeness II MA3 - Analysis Workbook 6 Completeness II Autumn 2004 Contents 3.7 An Interesting Sequence....................... 3.8 Consequences of Completeness - General Bounded Sequences.. 3.9 Cauchy Sequences..........................

More information

Advanced Calculus: MATH 410 Real Numbers Professor David Levermore 1 November 2017

Advanced Calculus: MATH 410 Real Numbers Professor David Levermore 1 November 2017 Advanced Calculus: MATH 410 Real Numbers Professor David Levermore 1 November 2017 1. Real Number System 1.1. Introduction. Numbers are at the heart of mathematics. By now you must be fairly familiar with

More information

Theorems. Theorem 1.11: Greatest-Lower-Bound Property. Theorem 1.20: The Archimedean property of. Theorem 1.21: -th Root of Real Numbers

Theorems. 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 information

REVIEW OF ESSENTIAL MATH 346 TOPICS

REVIEW 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 information

The Heine-Borel and Arzela-Ascoli Theorems

The 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 information

Part 2 Continuous functions and their properties

Part 2 Continuous functions and their properties Part 2 Continuous functions and their properties 2.1 Definition Definition A function f is continuous at a R if, and only if, that is lim f (x) = f (a), x a ε > 0, δ > 0, x, x a < δ f (x) f (a) < ε. Notice

More information

Advanced Calculus: MATH 410 Real Numbers Professor David Levermore 5 December 2010

Advanced 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 information

First In-Class Exam Solutions Math 410, Professor David Levermore Monday, 1 October 2018

First In-Class Exam Solutions Math 410, Professor David Levermore Monday, 1 October 2018 First In-Class Exam Solutions Math 40, Professor David Levermore Monday, October 208. [0] Let {b k } k N be a sequence in R and let A be a subset of R. Write the negations of the following assertions.

More information

Exercise Solutions to Functional Analysis

Exercise Solutions to Functional Analysis Exercise Solutions to Functional Analysis Note: References refer to M. Schechter, Principles of Functional Analysis Exersize that. Let φ,..., φ n be an orthonormal set in a Hilbert space H. Show n f n

More information

MATH 324 Summer 2011 Elementary Number Theory. Notes on Mathematical Induction. Recall the following axiom for the set of integers.

MATH 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 information

THE RADIUS OF CONVERGENCE FORMULA. a n (z c) n, f(z) =

THE RADIUS OF CONVERGENCE FORMULA. a n (z c) n, f(z) = THE RADIUS OF CONVERGENCE FORMULA Every complex power series, f(z) = (z c) n, n=0 has a radius of convergence, nonnegative-real or infinite, R = R(f) [0, + ], that describes the convergence of the series,

More information

1 The Real Number System

1 The Real Number System 1 The Real Number System The rational numbers are beautiful, but are not big enough for various purposes, and the set R of real numbers was constructed in the late nineteenth century, as a kind of an envelope

More information

MATH NEW HOMEWORK AND SOLUTIONS TO PREVIOUS HOMEWORKS AND EXAMS

MATH 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 information

Chapter 2. Real Numbers. 1. Rational Numbers

Chapter 2. Real Numbers. 1. Rational Numbers Chapter 2. Real Numbers 1. Rational Numbers A commutative ring is called a field if its nonzero elements form a group under multiplication. Let (F, +, ) be a filed with 0 as its additive identity element

More information

Solutions Final Exam May. 14, 2014

Solutions Final Exam May. 14, 2014 Solutions Final Exam May. 14, 2014 1. Determine whether the following statements are true or false. Justify your answer (i.e., prove the claim, derive a contradiction or give a counter-example). (a) (10

More information

Mid Term-1 : Practice problems

Mid 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 information

Solutions for Homework Assignment 2

Solutions 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 information

Notes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr.

Notes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr. Notes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr. Chapter : Logic Topics:. Statements, Negation, and Compound Statements.2 Truth Tables and Logical Equivalences.3

More information

a + b = b + a and a b = b a. (a + b) + c = a + (b + c) and (a b) c = a (b c). a (b + c) = a b + a c and (a + b) c = a c + b c.

a + b = b + a and a b = b a. (a + b) + c = a + (b + c) and (a b) c = a (b c). a (b + c) = a b + a c and (a + b) c = a c + b c. Properties of the Integers The set of all integers is the set and the subset of Z given by Z = {, 5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, }, N = {0, 1, 2, 3, 4, }, is the set of nonnegative integers (also called

More information

Properties of the Integers

Properties of the Integers Properties of the Integers The set of all integers is the set and the subset of Z given by Z = {, 5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, }, N = {0, 1, 2, 3, 4, }, is the set of nonnegative integers (also called

More information

MA2108S Tutorial Solution

MA2108S Tutorial Solution MA8S Tutorial Solution Zhang Liyang, Xiong Xi, Sun Bo Tutorial on limit superior and inferior (). Given lim(a n ) and (b n ) is bounded, show that lim a nb n = lim a n lim b n n n n Proof. Let u := lim

More information

Introduction to Analysis in One Variable. Michael E. Taylor

Introduction to Analysis in One Variable. Michael E. Taylor Introduction to Analysis in One Variable Michael E. Taylor 1 2 Contents Chapter I. Numbers 1. Peano arithmetic 2. The integers 3. Prime factorization and the fundamental theorem of arithmetic 4. The rational

More information

CHAPTER 3. Sequences. 1. Basic Properties

CHAPTER 3. Sequences. 1. Basic Properties CHAPTER 3 Sequences We begin our study of analysis with sequences. There are several reasons for starting here. First, sequences are the simplest way to introduce limits, the central idea of calculus.

More information

Math 324 Summer 2012 Elementary Number Theory Notes on Mathematical Induction

Math 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 information

CHAPTER 8: EXPLORING R

CHAPTER 8: EXPLORING R CHAPTER 8: EXPLORING R LECTURE NOTES FOR MATH 378 (CSUSM, SPRING 2009). WAYNE AITKEN In the previous chapter we discussed the need for a complete ordered field. The field Q is not complete, so we constructed

More information

Chapter 1 The Real Numbers

Chapter 1 The Real Numbers Chapter 1 The Real Numbers In a beginning course in calculus, the emphasis is on introducing the techniques of the subject;i.e., differentiation and integration and their applications. An advanced calculus

More information

Some Background Material

Some 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 information

CHAPTER 6. Limits of Functions. 1. Basic Definitions

CHAPTER 6. Limits of Functions. 1. Basic Definitions CHAPTER 6 Limits of Functions 1. Basic Definitions DEFINITION 6.1. Let D Ω R, x 0 be a limit point of D and f : D! R. The limit of f (x) at x 0 is L, if for each " > 0 there is a ± > 0 such that when x

More information

Studying Rudin s Principles of Mathematical Analysis Through Questions. August 4, 2008

Studying Rudin s Principles of Mathematical Analysis Through Questions. August 4, 2008 Studying Rudin s Principles of Mathematical Analysis Through Questions Mesut B. Çakır c August 4, 2008 ii Contents 1 The Real and Complex Number Systems 3 1.1 Introduction............................................

More information

Math 117: Topology of the Real Numbers

Math 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 information

Continuity. Matt Rosenzweig

Continuity. 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 information

Problem Set 2: Solutions Math 201A: Fall 2016

Problem 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 information

2.4 The Extreme Value Theorem and Some of its Consequences

2.4 The Extreme Value Theorem and Some of its Consequences 2.4 The Extreme Value Theorem and Some of its Consequences The Extreme Value Theorem deals with the question of when we can be sure that for a given function f, (1) the values f (x) don t get too big or

More information

Due date: Monday, February 6, 2017.

Due date: Monday, February 6, 2017. Modern Analysis Homework 3 Solutions Due date: Monday, February 6, 2017. 1. If A R define A = {x R : x A}. Let A be a nonempty set of real numbers, assume A is bounded above. Prove that A is bounded below

More information

Set, functions and Euclidean space. Seungjin Han

Set, 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 information

Numerical Sequences and Series

Numerical 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 information

Lecture 2. Econ August 11

Lecture 2. Econ August 11 Lecture 2 Econ 2001 2015 August 11 Lecture 2 Outline 1 Fields 2 Vector Spaces 3 Real Numbers 4 Sup and Inf, Max and Min 5 Intermediate Value Theorem Announcements: - Friday s exam will be at 3pm, in WWPH

More information

Infinite Sequences of Real Numbers (AKA ordered lists) DEF. An infinite sequence of real numbers is a function f : N R.

Infinite Sequences of Real Numbers (AKA ordered lists) DEF. An infinite sequence of real numbers is a function f : N R. Infinite Sequences of Real Numbers (AKA ordered lists) DEF. An infinite sequence of real numbers is a function f : N R. Usually (infinite) sequences are written as lists, such as, x n n 1, x n, x 1,x 2,x

More information

MATH202 Introduction to Analysis (2007 Fall and 2008 Spring) Tutorial Note #7

MATH202 Introduction to Analysis (2007 Fall and 2008 Spring) Tutorial Note #7 MATH202 Introduction to Analysis (2007 Fall and 2008 Spring) Tutorial Note #7 Real Number Summary of terminology and theorems: Definition: (Supremum & infimum) A supremum (or least upper bound) of a non-empty

More information

1 Topology Definition of a topology Basis (Base) of a topology The subspace topology & the product topology on X Y 3

1 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 information

Real Analysis - Notes and After Notes Fall 2008

Real Analysis - Notes and After Notes Fall 2008 Real Analysis - Notes and After Notes Fall 2008 October 29, 2008 1 Introduction into proof August 20, 2008 First we will go through some simple proofs to learn how one writes a rigorous proof. Let start

More information

Math 104: Homework 7 solutions

Math 104: Homework 7 solutions Math 04: Homework 7 solutions. (a) The derivative of f () = is f () = 2 which is unbounded as 0. Since f () is continuous on [0, ], it is uniformly continous on this interval by Theorem 9.2. Hence for

More information

Chapter 3 Continuous Functions

Chapter 3 Continuous Functions Continuity is a very important concept in analysis. The tool that we shall use to study continuity will be sequences. There are important results concerning the subsets of the real numbers and the continuity

More information

Scalar multiplication and addition of sequences 9

Scalar multiplication and addition of sequences 9 8 Sequences 1.2.7. Proposition. Every subsequence of a convergent sequence (a n ) n N converges to lim n a n. Proof. If (a nk ) k N is a subsequence of (a n ) n N, then n k k for every k. Hence if ε >

More information

2.7 Subsequences. Definition Suppose that (s n ) n N is a sequence. Let (n 1, n 2, n 3,... ) be a sequence of natural numbers such that

2.7 Subsequences. Definition Suppose that (s n ) n N is a sequence. Let (n 1, n 2, n 3,... ) be a sequence of natural numbers such that 2.7 Subsequences Definition 2.7.1. Suppose that (s n ) n N is a sequence. Let (n 1, n 2, n 3,... ) be a sequence of natural numbers such that n 1 < n 2 < < n k < n k+1

More information

UNIVERSITY OF CALICUT SCHOOL OF DISTANCE EDUCATION CORE COURSE. B.Sc. MATHEMATICS V SEMESTER. (2011 Admission onwards) BASIC MATHEMATICAL ANALYSIS

UNIVERSITY OF CALICUT SCHOOL OF DISTANCE EDUCATION CORE COURSE. B.Sc. MATHEMATICS V SEMESTER. (2011 Admission onwards) BASIC MATHEMATICAL ANALYSIS UNIVERSITY OF CALICUT SCHOOL OF DISTANCE EDUCATION CORE COURSE B.Sc. MATHEMATICS V SEMESTER (2011 Admission onwards) BASIC MATHEMATICAL ANALYSIS QUESTION BANK 1. Find the number of elements in the power

More information

Solution of the 8 th Homework

Solution of the 8 th Homework Solution of the 8 th Homework Sangchul Lee December 8, 2014 1 Preinary 1.1 A simple remark on continuity The following is a very simple and trivial observation. But still this saves a lot of words in actual

More information

Lecture 2: A crash course in Real Analysis

Lecture 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 information

Functions. Chapter Continuous Functions

Functions. Chapter Continuous Functions Chapter 3 Functions 3.1 Continuous Functions A function f is determined by the domain of f: dom(f) R, the set on which f is defined, and the rule specifying the value f(x) of f at each x dom(f). If f is

More information