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.

Size: px
Start display at page:

Download "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."

Transcription

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 is a function whose domain is the natural numbers. We sometimes denote a sequence as {f(n)} n N, where f(n) is a function on the natural numbers, and we do not specify the range. Example 3.2. Let f(n) = n n n 2 ( ) n. Then f is a function from the natural numbers into 2 2 matrices, and {f(n)} n N is a sequence of 2 2 matrices. Example 3.3. Let f(n) = x n on [0, ]. Then f is a function from the natural numbers to functions on [0, ], and {f(n)} n N is sequence of functions. Example 3.4. Let f(n) = n. Then f is a function from the natural numbers to the real numbers, and {f(n)} n N is a sequence of numbers. Before proceeding to define the limit of a sequence, try to compute the following limits. If you find the limit, ask yourself how you did it and what does the limit represent. Imagine explaining the process to a freshman.. lim 2. lim n + 3n + 2 sin n n 3. lim (ln(n + ) ln n) 4. lim ( + n)/n Answers:. /3; 2. 0; 3. 0; 4.. 7

2 8 3. Sequences 3.. Convergence For the rest of this chapter we will only consider sequences of real numbers, typically denoted {a n } n N. Definition 3.5. A sequence of real numbers, {a n } n N, converges to a real number, a, if and only if, for each ǫ > 0, there exists a natural number N, such that, for all n N, a n a < ǫ. When {a n } n N converges to a we write lim a n = a or a n a as n. In plain language the definition says a n is close to a for large n. We note that implementing the definition requires a candidate for the limit. Later we will see that we can establish the existence of a limit without having to actually know the limit. Example 3.6. Prove lim n = 0. Proof. Let ǫ > 0. By the Archimedean Property we can find a natural number N so that ǫ < N, or N < ǫ. Thus for all n N n N < ǫ, or n 0 < ǫ, for n N. Sometimes a limit does not exist. We need methods to deal with limits not existing. One possibility would be to negate the definition. Lemma 3.7. A sequence {a n } n N does not converge to the number a if there exists a ǫ 0 > 0 such that, for all N N, there exists a n 0 N with a n0 a ǫ 0. Proof. In logic notation the definition of convergence of a sequence is ( ǫ > 0)( N N)( n N)( a n a < ǫ) or ( ǫ > 0)( N N)( n N)(n N a n a < ǫ). Negating the two, we find or ( ǫ 0 > 0)( N N)( n 0 N)( a n a ǫ) ( ǫ 0 > 0)( N N)( n 0 N)(n 0 N and a n a ǫ). Example 3.8. Prove the sequence {( ) n } n N does not have a limit. Proof. The difficulty in applying the lemma is that we have to show there is no limit for each real number a. Suppose a =. Set ǫ 0 =. Then, for all N N, one of a N or a N+ is 2, and for all N N there exists a n 0 N with a n0 ǫ 0. A similar argument follows for a =. Finally suppose a is not equal to or. Let ǫ 0 = min{ a, a + } n N. Then given any N N we have a n a ǫ 0 for all n N.

3 3.2. Some Topology 9 Here is another proof which uses contradiction. Proof. Suppose the limit did exist. Then, for ǫ =, there exists a N N such that a n a < for n N. But 2 = + = ( a) + (a + ) a + a + = a + a < + = 2, a contradiction. Theorem 3.9. The limit of a sequence, if it exists, is unique. Proof. Suppose there were two limits, say a and b. Given any ǫ > 0 there exists an N and N 2 such that a n a < ǫ/2 and a n b < ǫ/2 for all n max{n, N 2 }. Then a b = a a n + a n b a n a + a n b < ǫ, for all ǫ > 0. By trichotomy, either a b = 0 for a b > 0. If the latter holds, set ǫ = a b /2. Then a b < ǫ implies a b < a b /2 or < /2, a contradiction. Thus a b = 0 or a = b Some Topology A large part of mathematics consists of recognizing and generalizing patterns. If we look carefully at the definition of convergence for sequences we see that we really do not need the field axioms. All we require is the notion of closeness. We can have that concept without the use of addition or subtraction (or even absolute value). Definition 3.0. A subset O of R is called open in R if, for each point x O, there is a r > 0 such that all points y in R satisfying x y < r also belong to the set O. Example 3.. The set O = {x 0 < x < } is open in R. Example 3.2. The set O = {x 0 < x } is not open in R. We state without proof the following theorems. Theorem 3.3. Open Set Properties. (a) The empty set and R are open in R. (b) The intersection of any two open sets is open in R. (c) The union of any collection of open sets is open in R. Definition 3.4. in R. (a) A subset of R is called closed in R if its complement is open (b) A neighborhood of x R is any set containing an open set containing x. (c) A point x R is called an boundary point of a set S R if every neighborhood of x contains a point in S and a point not in S. (d) A point x R is called an interior point of a set S R if there exists a neighborhood of x contained in S. (e) A point x R is called an exterior point of a set S R if there is a neighborhood of x which is entirely contained in complement of S.

4 20 3. Sequences Example 3.5. The set O = {x 0 x } is closed in R. Example 3.6. Consider the set O = {x 0 x }. The boundary points are x = 0 and x =. Moreover x = /2 is an interior point. Again without proof we have Theorem 3.7. Let O R. The following statements are equivalent (a) O is open in R; (b) every point in O is an interior point of O. (c) O is a neighborhood of each of its points. Theorem 3.8. A set is closed if and only if it contains all of its boundary points. Theorem 3.9. A subset of R is open if and only if it is the union of a countable collection of open intervals. Finally we can recast the definition 3.5. The advantage of doing so it that we do not need the field axioms to define an open set, and we could, if we had more time, generalize the notion of convergence to sets with less structure than the ones we consider here. A sequence {a n } n N eventually has a certain property if it has that property for all n N for some N N. Definition A sequence of real numbers {a n } n N converges to a number a if and only if, for each neighborhood of a, a n is eventually in that neighborhood Algebra of Limits In this section we establish some familiar properties of sequences. Theorem 3.2. Suppose {a n } n N and {b n } n N are convergent sequences, with limits a and b respectively. Then (a) For all α R, lim n = αa. (b) lim n + b n ) = a + b. (c) lim nb n = ab. (d) If b n 6= 0 for all n N and b 6= 0, then lim a n b n = a b. Proof. We will prove (c) and (d) and leave the other two as exercises. We are given the following. Given any ǫ > 0 there exists N, N 2, natural numbers, such that a n a < ǫ and b n b < ǫ for all n max{n, N 2 } n N. We calculate a n b n ab = (a n a)b n + a(b n b) b n a n a + a b n b. We know a n a and b n b are small. We have to worry about b n becoming large. Let us suppose for the moment that b n M for all n N and some M > 0. Then a n b n ab M a n a + a b n b.

5 3.3. Algebra of Limits 2 Let ǫ > 0 be given. In one case we choose ǫ = ǫ/2m, and in the other ǫ = ǫ/(2( a + )). Then a n b n ab M a n a + a b n b < ǫ 2 + ǫ 2 = ǫ for all n max{n, N 2 }. We show convergent sequences are bounded in the next lemma. The proof of (d) is similar. Indeed, a n a b n b = ba n ab n bb n = ba n ba + ba ab n bb n a n a + a b n b. b n b b n Again we must worry about / b n becoming large. Let us suppose for the moment that / b n M for n N 3, for some N 3 N and for some M. Then, as in Part (c), let ǫ > 0 be given. We choose ǫ = ǫ/(2m) for the bound on a n a and ǫ = b ǫ/(2 a ) for the bound on b n b. For n max{n, N 2, N 3 }, we have a n a b n b < ǫ 2 + ǫ 2. We have two bounds to establish. Lemma Suppose {b n } n N converges to b. b n M for all n N. Then a M > 0 exists so that Proof. Let ǫ = in Definition 3.5. Then a natural number N exists so that b n b < for all n N. The triangle inequality implies, for such n, b n = b n b + b b n b + b < + b. Set M = max{ b, b 2,..., b N, + b }. We find b n M for n N. Lemma Suppose {b n } n N converges to b with b n 6= 0 for all n N and b 6= 0. Then a N N and a M > 0 exists so that M for all n N. b n Proof. Here we have to worry about b n becoming small. Let ǫ = b /2 in Definition 3.5. A N N exists such that b n b < b /2 for n N. The triangle inequality shows b n = b n b + b b b n b > b 2 for all n N. Set M = 2/ b and the result follows. Theorem (Squeeze Theorem) Let {x n } n N,{y n } n N, and {z n } n N be three sequences of real numbers such that x n y n z n for all n. Suppose further that {x n } n N and {z n } n N converge to x. Then {y n } n N converges to x.

6 22 3. Sequences Proof. A good place to start would be to write down what we know: Given any ǫ > 0 there exists N i N, i =, 2, such that x n x < ǫ for all n N and z n x < ǫ for all n N 2. The above inequalities imply ǫ < x n x y n x z n x < ǫ for n max{n, N 2 }. That is, y n x < ǫ for such n. Corollary Given any ξ Q c, there exists sequence of rational numbers {r n } n N which converge to ξ. That is, irrational numbers can by approximated with rational numbers. Proof. Clearly ξ < ξ + n. By the density of rationals there exists r n such that ξ < r n < ξ + n. The squeeze theorem implies {r n} n N converges to ξ. While the supremum of a set may Not be in the set, it can however be approximated by elements in the set. Corollary Let E R be non empty and bounded from above. sequence {x n } n N exists in E such that x n α = sup E as n. Then a Proof. The set E has a supremum, α, by the completeness axiom. Since α n is no longer an upper bound there exists w n E with α n < w n α (Theorem 2.). The squeeze theorem shows {w n } n N converges to α Monotone Convergence Theorem We will develop two techniques to show a sequence converges without having to find the limit and apply Definition 3.5. The application of the Monotone Convergence Theorem is one of the techniques. It is equivalent to the completeness axiom. Theorem (Monotone Convergence Theorem) Suppose {a n } n N is a monotone increasing, bounded sequence of real numbers. That is, a n a n+ and a n M some M and for all n N. Then {a n } n N has a limit. Proof. To apply the definition for convergence we need a candidate for the limit. Set E = {a, a 2,...}. The set E is non empty and bounded. By the completeness axiom E has a supremum. Set a = sup E. Let ǫ > 0. Then a ǫ is no longer an upper bound for E. Hence a a N exist such that a ǫ < a N a. Since the sequence is increasing a ǫ < a n a for all n N. That is 0 a a n < ǫ or a a n < ǫ for all n N. Example Consider the sequence The sequence is bounded since a n = n + + n n. a n n + + n n + = n n +.

7 3.4. Monotone Convergence Theorem 23 It is also monotone since a n+ a n = n n n + 2n + + 2n + 2 n + + n n = 2n + 2(n + ) = 2 (n + )(2n + ) 0 By the monotone convergence theorem, the sequence {a n } n N has a limit (in fact, we will see later that lim a n = ln 2). Example Suppose 0 < a <. Prove lim an = 0. Proof. Set a n = a n. The sequence is a monotone decreasing sequence in this case. The monotone convergence theorem still applies (see Exercise 3.2). We need to show the sequence is bounded from below. This is easy since a n = a n = a n 0. We show the sequence is monotone decreasing. That is, a n+ a n. We do this by induction. Since a <, a 2 < a. This is the base step. Suppose a n < a n. That is, a n < a n. Multiplying by a, we find a n+ < a n. That is, a n+ a n. By induction a n+ a n for all n N, and the sequence is decreasing. By the monotone convergence theorem, {a n } n N has a limit. To find the limit, we apply the algebra of limits (we had to know the limit existed to do this!). Set lim a n = L. Then L = lim an+ = lim aan = a lim an = al. That is, L( a) = 0. This implies L = 0. Example Suppose the sequence {x n } n N is defined recursively by x n+ = 2 /x n with x = 2. Prove that {x n } n N has a limit and find the limit. Proof. Notice x n 2 for all n N. Indeed, the inequality is true for n =. Suppose x n 2. Then x n = 2 /x n, and under the assumption on x n, x n 2. By induction, the inequality is true for all n. The sequence is also decreasing. Indeed, for all n x n+ x n = 2 x n = (x n ) 2 < 0. x n x n By the monotone convergence theorem the sequence has a limit. Moreover, by the algebra of limits, the limit satisfies x = 2 /x, or x =. Example 3.3. Find a rational sequence converging to 2. Proof. We know by Corollary 3.25 such a sequence exists. Newton s method for finding zeros of a differentiable function is x n+ = x n f(x n) f (x n ).

8 24 3. Sequences We do not need to study Newton s method - we just use it to find a candidate for the sequence. Applying the method to the function f(x) = x 2 2, we find (3.) x n+ = x n x n We arbitrarily choose x 0 = 2. Then x = 3/2, x 2 = 7/2, x 3 = 577/ You can check that the sequence of rational numbers seems to converge (rapidly) to 2. To prove the convergence we apply the monotone convergence theorem. We first show the sequence {x n } n N is bounded. Clearly, 2 x 0 = Suppose 2 xn 2. Then, using (3.), min x + 2 x n+ max x x 2 2 x 2 x 2 2 x The function g(x) = 2 x + 2 x has a minimum of 2 at x = 2. The right side is bounded by max 2 x 2 2 x + 2 x x max 2 x max 2 x 2 By induction 2 x n 2 for all n N. x Next we prove {x n } n N is monotone decreasing. Clearly x x 0 = /2 0. Suppose x n x n 0. Again using (3.), x n+ x n = (x n x n ) 2. x n x n Since x n 2 for all n N, 2 x n x n Hence, x n+ x n 0, and, by induction, x n x n 0 for all n N. The monotone convergence applies, and {x n } n N has a limit. Suppose the limit is L. Then, using the algebra of limits, L = lim x n+ = lim x n + 2 = L x n 2 L Solving for L, we find L = 2. We have one final application of the monotone convergence theorem. As we will see shortly, we need to know when an infinite intersection of intervals is non empty. Example Set I n = (0, /n) = {x 0 < x < /n}. The set {I n } n N is a sequence of intervals. We will be interested in the infinite intersection \ E := = {x x I n, n N}. In this case note E =. n=

9 3.5. Subsequences and The Bolzano-Weierstrass Theorem 25 Example Set I n = (n, ) = {x n < x}. Again the set {I n } n N is a sequence of intervals. Here \ E := = {x x I n, n N} =. n= Definition A sequence of intervals {I n } n N is called nested if and only if I I 2 I Here are sufficient conditions for the intersection to be non empty. Theorem (Nested-Cell Theorem) Let {I n } n N be a sequence of nested, closed, \ bounded intervals. Then = {x x I n, n N} is non empty. n= Proof. By assumption I n = [a n, b n ] with a a 2... and b b For any natural numbers n and k a k a n b n for k < n a k b k b n for k n. The two inequalities imply a k b n for all k N and any n. Thus the monotone increasing sequence {a n } n N is bounded by b n for any n. By the monotone convergence theorem lim a n = a := sup{a n }. The same two inequalities above now imply that a is a lower bound for {b n } n N. Since {b n } n N is monotone decreasing and bounded below, the monotone convergence theorem implies lim b n = b := inf{b n }. Moreover a b. Finally, let x [a, b]. Then a i a x b b i for all i N. That is, x T n= I n Subsequences and The Bolzano-Weierstrass Theorem A subsequence of a sequence {a n } n N is a subset of {a n } n N which is ordered. More specifically, Definition Let {a n } n N be a sequence and {n k } k N be any sequence of natural numbers such that n < n 2 < n 3 <.... The sequence {a nk } k N is called a subsequence of {a n } n N. Example The sequence with a n = +( )n 2 does not converge. However, if n k = 2k, {a 2k } k N = {0, 0, 0,...}. Similarly, n k = 2k produces the subsequence {a 2k } k N = {,,,...}. Theorem A sequence converges to a if and only if each of its subsequences converges to a. In fact, if every subsequence converges, they all converge to the same limit. Proof. If all subsequences converge to a, the sequence converges to a since the sequence is a subsequence of itself. Conversely, suppose the sequence converges to a and {a nk } k N is a subsequence. Let ǫ > 0. There exists a natural number N such that a n a < ǫ for all n N. By the construction of the {n k } k N we have k n k for all k N. Thus, for k N,

10 26 3. Sequences n k N. This implies a nk a < ǫ for all k N, and the subsequence {a nk } k N converges to a. A restatement of part of the theorem gives Corollary If {a n } n N converges, all of its subsequences converge to the same limit. This gives us another technique for showing a sequence does not converge. We need only find two convergent subsequences with distinct limits. Example Show the sequence a n = ( ) n does not converge using three different methods. Proof. We have already shown non convergence using two difference methods in Example 3.8. Note that {a 2k } k N and {a 2k } k N converge to and respectively. Thus {a n } n N does not converge. The importance of the following theorem cannot be overstated. Theorem 3.4. (Bolzano-Weierstrass Theorem) Every bounded sequence of real numbers has a convergent subsequence. Proof. Let us denote the sequence {x n } n N. We apply the Nested-Cell Theorem, Theorem We will construct inductively a sequence of intervals such that I I 2 I Since the sequence is bounded, a x n b for all n N and some a and b. Set I = [a, b]. Choose a x n I. We define I = b a. Consider I = I I = a, a + b a + b 2 2, b. One of I or I contains infinitely many of the x n. Call it I 2. Then I 2 = (b a)/2. Choose x n2 I 2 with n 2 > n. Note that I 2 I. This is the base step. Suppose I,..., I k have been chosen so that I I 2 I 3... I k with I k = b a 2 k 2, and x n I, x n2 I 2,..., x nk I k, with n < n 2 <... < n k. By construction I k contains infinitely many of the x n. Bisect it as before, I k = I I with one of the I or I containing infinitely many of the x n. Call the interval I k. Choose x nk I k I k with n k > n k. Note that I k = b a 2 k. By induction this defines I k and x nk for all k N. The {I k } k N satisfy the hypothesis of the Nested-Cell Theorem. Thus their \ intersection is non empty and there is an x I n. We need to show the subsequence {x nk } converges to x as k. Let ǫ > 0. By Example 3.29 there is a N n=

11 3.6. Cauchy Sequences 27 such that b a 2 k < ǫ for all k N. Since x nk I k and x I k x nk x I k = b a 2 k < ǫ (see HW 2.) for all k N. There is a nice geometric interpretation of the Bolzano-Weierstrass Theorem. Definition Let E R. A point a R is called a cluster point or accumulation point of E if and only if every neighborhood of a contains a point in E distinct from a. Example If E = (0, ), the cluster points are [0, ]. Note that a cluster point need not be in E. Example If E = Q, the cluster points are all of R, since Q is dense in R. Example The set E = {, 2, 3} has no cluster points. In fact, all points in E are isolated points of E (see Exercise 3.20). Example Suppose {x n } n N is a convergent sequence of real numbers converging to x R. Then x is a cluster point of the set {x, x 2,...}. We may restate the Bolzano-Weierstrass Theorem as follows. Theorem (Bolzano-Weierstrass Theorem for Sets) Every bounded infinite subset of R has a cluster point. Proof. We will call the infinite set E. We first construct a sequence of distinct points in E. Since E is non empty, a x E exists. Consider the set E \ {x }. It too is non empty. Thus a x 2 exists in E \ {x }. Suppose the distinct points x, x 2,..., x k have been similarly chosen. Then the set E \ {x, x 2,..., x k } is non empty, and there exists a x k E \ {x, x 2,..., x k }. By induction we have constructed a sequence {x n } n N of distinct points in E. The sequence {x n } n N is bounded since E is bounded. By the Bolzano- Weierstrass theorem, a subsequence of {x n } n N, {x nk } k N exists and converges to some x R. Given any neighborhood of x, the sequence {x n } n N is eventually in that neighborhood. Thus every neighborhood of x contains a point in E, and x is a cluster point of E Cauchy Sequences There is yet another way to show a sequence has a limit without finding the limit (the monotone convergence theorem was the other). Definition A sequence {x n } n N is called Cauchy (pronounced Co She) if and only if for all ǫ > 0 there exists a N N such that x n x m < ǫ for all n, m N.

12 28 3. Sequences Theorem (Cauchy Theorem) A sequence {x n } n N converges if and only if it is Cauchy. Proof. Suppose {x n } n N converges. Let ǫ > 0. Then there exists N N such that x n x < ǫ/2 for all n N. Then x m x n = x m x + x x n x m x + x n x < ǫ 2 + ǫ 2 = ǫ for all n, m N. That is, {x n } n N is Cauchy. Suppose {x n } n N is Cauchy. We need a candidate for the limit. We apply the Bolzano-Weierstrass theorem to find the candidate. To do so we need to show the sequence is bounded. We copy the proof of Lemma 3.22 for this. Let ǫ = in the definition of a Cauchy sequence. Then a natural number N exists such that x m x n < for all m, n N. That is, x m = x m x N + x N x m x N + x N < + x N for all m N. Thus x m max{ x, x 2,..., x N, + x N } for all m N. The Bolzano-Weierstrass theorem applies and there exists a subsequence {x nk } k N converging to some x R. We need to show the whole sequence converges to x. Let ǫ > 0. There exists N and N 2 such that x m x n < ǫ 2 m, n N, and x nk x < ǫ 2 k N 2. Set N = max{n, N 2 }, and fix K N. Then n K N, and x n x = x n x nk + x nk x x n x nk + x nk x < ǫ 2 + ǫ 2 = ǫ, for all n N. Example Consider the sequence given recursively by x n = x n 2 + x n 2 with x = and x 2 = 2. One can check by writing out the first few terms that the sequence is not monotone. Indeed, the sequence oscillates. We could try to obtain a candidate for the limit by assuming it exists and using the algebra of limits. If lim x n = L, taking the limit of x n above, we would find L = (L + L)/2, which gives us no useful information. Our only hope is to show the sequence is Cauchy (if we believe it converges). Note that x n x n+ = x n x n + x n 2 = 2 x n x n. Homework Exercise 3.30 shows that the sequence {x n } n N is Cauchy. Moreover, Cauchy s theorem shows that the sequence has a limit. We need only find the limit.

13 3.6. Cauchy Sequences 29 Recall that, if the sequence converges, all subsequences converge to the same limit (Corollary 3.39). We will find the limit of the subsequence {x 2n+ } n N. We claim that x 2n x 2n = 4 n. Indeed, the equality is true for n =. Suppose it is true for n. Then x 2(n+) x 2(n+) = x 2n+2 x 2n+ = 2 (x 2n + x 2n+ ) x 2n+ = 2 (x 2n x 2n+ ) = x 2n 2 2 (x 2n + x 2n ) = 4 (x 2n x 2n ) = 4 n, and the result follows by induction. We have discovered that x 2n = x 2n + 4 n. Thus x = x 3 = 2 ( + 2) = + 2 x 5 = 2 (x 4 + x 3 ) = x x 3 x 7 = 2 (x 6 + x 5 ) = x x 5 = Proceeding inductively, we find Taking the limit, we find x 2n+ = + 2 = + 2 = = n. 4 4 n lim x n = lim x 2n+ = 5 3.

14 30 3. Sequences 3.7. Review Techniques to show limit converges Apply the definition of a limit Algebra of limits Show sequence monotone and bounded Show sequence Cauchy Techniques to show no limit Negate the definition of a limit Show sequence not bounded Show sequence not Cauchy Find a contradiction More than one convergent subsequence with different limits

15 3.7. Review 3 Summary of theorems so far. Try to understand the idea behind the proof of each theorem. The Completeness Axiom Monotone-Convergence Theorem Nested Cell Bolzano-Weierstrass Archimedean Principle Cauchy Thm Denisty of Q

16 32 3. Sequences 3.8. Homework Exercise 3.. Give example of two sequences that do not converge but whose (a) sum converges (b) product converges (c) quotient converges Exercise 3.2. Give an example of a convergent sequence {x n } (0, ], but whose limit is not in (0, ]. Exercise 3.3. Use the Definition 3.5 to establish the following limits. (a) (b) (c) lim lim lim n 2 = 0 2n n + 3 = 2 2n + 4 5n + = 2 5 Exercise 3.4. If a convergent sequence is rearranged, prove that the new sequence has the same limit. Exercise 3.5. Let 0 < x n < 4 for all n N. Show that the sequence {x n } n N has a convergent subsequence. In what interval will the limit of this subsequence lie? Exercise 3.6. Suppose a n a > 0 as n and that a n > 0 for all n N. Show that m > 0 exists so that a n m for all n N. Exercise 3.7. (Cesàro Summable) If the sequence {x n } n N converges to x, then the sequence {σ n } also converges to x. Here σ n = n (x + x x n ). Exercise 3.8. Show that the sequence {sin n} n N does not converge. Exercise 3.9. Let a n = n n odd n even. Does the limit exist? Proof required. Exercise 3.0. Suppose {x n } n N converges to x and satisfies 2 < x n < 3 for all n N. Show that the limit satisfies 2 x 3. Exercise 3.. Let {a n } n N be a sequence of real numbers converging to a R. (a) Prove lim a n = a. (b) If lim a n = 0, then lim a n = 0. (c) Show by example that lim a n may exist, while {a n } n N may not converge. Exercise 3.2. Let x n 0 for all n N with x n x as n. Prove x n x as n. Exercise 3.3. Suppose {x n } n N is a convergent sequence of integers. Show that the sequence is eventually constant.

17 3.8. Homework 33 Exercise 3.4. Let {a n } n N be a sequence of positive real numbers with the ratio a n+ /a n converging to L as n. If L <, show that lim a n = 0. Show a n as n if L >, and no conclusion can be made if L =. Apply this to the sequences (a) x n = rn n!, r > 0, (b) x n = np n!, p > 0, (c) x n = nn n!. Exercise 3.5. Suppose {x n } n N is a bounded sequence (not necessarily convergent), and {y n } n N is a sequence converging to zero. Prove that {x n y n } n N converges to zero. Show by example that the result is not true if either hypothesis on {x n } n N or {y n } n N is dropped. Exercise 3.6. Establish, by using any definition or theorem, the limits of the following sequences. (a) (b) sin n n n N ( π + ) 2 n n N Exercise 3.7. Prove Theorem 3.8. (c) 2n + 4 5n + n N (d) n n + n N (e) lim n 3 2n + n 4 + 5n sin(n3 ) Exercise 3.8. Show that every bounded, non empty closed subset of R has a maximum. (Hint: show the supremum of a set is a boundary point of the set). Exercise 3.9. What are the cluster points of the irrational numbers? Exercise Suppose a R is not a cluster point of set E. Prove there exists a r > 0 such that (E \ {a}) (a r, a + r) =. If a E, a point a with this property is called an isolated point of E. Exercise 3.2. Prove the Monotone Convergence Theorem for a decreasing sequence which is bounded below. Exercise Suppose 0 < a. Prove that the sequence {a /n } n N converges to one. Exercise Show the following recursively defined sequences are convergent and find the limit (a) Let x = and x n = 4 (2x n + 3). (b) Let x = 3 and x n = 2 /x n. (c) Let x = 2 and x n = 2 + x n. Exercise Give an example of a sequence whose set of convergent subsequences converge to {, /2, /3, /4...} {0}. Exercise Give an example of a sequence with no convergent subsequences.

18 34 3. Sequences Exercise Give an example of two sequences {x n } n N and {y n } n N that satisfy {x n } {y n } as sets, but with {x n } n N not a subsequence of {y n } n N. Exercise The next two statements are equivalent - they are contrapositives. Prove one of them. (a) Suppose {x n } n N is a bounded sequence. If all its convergent subsequences have the same limit, then the sequence is convergent. (b) Show that a nonconvergent bounded sequence has two convergent subsequences each with distinct limits. Exercise Suppose {x n } n N is unbounded. Show there exists a subsequence {x nk } such that /x nk 0 as k. Exercise Give an example of a Cauchy sequence with {x n } n N (0, ], but whose limit is not in (0, ]. Exercise Let {x n } n N be a sequence and 0 < r <. Suppose that x n+ x n r x n x n for n 2. Show that the sequence is Cauchy. Exercise 3.3. Use Exercise 3.30 to show the sequence x n = /(2 + x n ) for n 2 and x > 0 is Cauchy. Find the limit. Exercise (b) Show that the sequence is not Cauchy. (a) Negate the definition of a Cauchy sequence. x n = nx k= (c) Show that x n+ x n 0 as n (compare this to the definition of a Cauchy sequence). k

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

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

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

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

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

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

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

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

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

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

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

Copyright 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 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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Real Analysis Notes. Thomas Goller

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

Math 4603: Advanced Calculus I, Summer 2016 University of Minnesota Homework Schedule

Math 4603: Advanced Calculus I, Summer 2016 University of Minnesota Homework Schedule Math 4603: Advanced Calculus I, Summer 2016 University of Minnesota Homework Schedule Notations I will use the symbols N, Z, Q and R to denote the set of all natural numbers, the set of all integers, the

More information

Metric Spaces and Topology

Metric Spaces and Topology Chapter 2 Metric Spaces and Topology From an engineering perspective, the most important way to construct a topology on a set is to define the topology in terms of a metric on the set. This approach underlies

More information

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

means 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 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

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

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

Principle of Mathematical Induction

Principle of Mathematical Induction Advanced Calculus I. Math 451, Fall 2016, Prof. Vershynin Principle of Mathematical Induction 1. Prove that 1 + 2 + + n = 1 n(n + 1) for all n N. 2 2. Prove that 1 2 + 2 2 + + n 2 = 1 n(n + 1)(2n + 1)

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

Sequences of Real Numbers

Sequences of Real Numbers Chapter 8 Sequences of Real Numbers In this chapter, we assume the existence of the ordered field of real numbers, though we do not yet discuss or use the completeness of the real numbers. In the next

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

Definition 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 :

Definition 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 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

HW 4 SOLUTIONS. , x + x x 1 ) 2

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

Math 430/530: Advanced Calculus I Chapter 1: Sequences

Math 430/530: Advanced Calculus I Chapter 1: Sequences Math 430/530: Advanced Calculus I Chapter 1: Sequences Fall 2018 Sequences A sequence is just a list of real numbers a 1, a 2,... with a definite order. We write a = (a n ) n=1 for a sequence a with n

More information

Analysis I. Classroom Notes. H.-D. Alber

Analysis I. Classroom Notes. H.-D. Alber Analysis I Classroom Notes H-D Alber Contents 1 Fundamental notions 1 11 Sets 1 12 Product sets, relations 5 13 Composition of statements 7 14 Quantifiers, negation of statements 9 2 Real numbers 11 21

More information

Analysis Finite and Infinite Sets The Real Numbers The Cantor Set

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

REAL ANALYSIS: INTRODUCTION

REAL ANALYSIS: INTRODUCTION REAL ANALYSIS: INTRODUCTION DR. RITU AGARWAL EMAIL: RAGARWAL.MATHS@MNIT.AC.IN MALVIYA NATIONAL INSTITUTE OF TECHNOLOGY JAIPUR Contents 1. The real number system 1 2. Field Axioms 1 3. Order Axioms 2 4.

More information

Math 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 = (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 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

Contribution of Problems

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

Contents Ordered Fields... 2 Ordered sets and fields... 2 Construction of the Reals 1: Dedekind Cuts... 2 Metric Spaces... 3

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

POL502: Foundations. Kosuke Imai Department of Politics, Princeton University. October 10, 2005

POL502: Foundations. Kosuke Imai Department of Politics, Princeton University. October 10, 2005 POL502: Foundations Kosuke Imai Department of Politics, Princeton University October 10, 2005 Our first task is to develop the foundations that are necessary for the materials covered in this course. 1

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

MATH 131A: REAL ANALYSIS

MATH 131A: REAL ANALYSIS MATH 131A: REAL ANALYSIS NICKOLAS ANDERSEN The textbook for the course is Ross, Elementary Analysis [2], but in these notes I have also borrowed from Tao, Analysis I [3], and Abbott, Understanding Analysis

More information

DR.RUPNATHJI( DR.RUPAK NATH )

DR.RUPNATHJI( DR.RUPAK NATH ) Contents 1 Sets 1 2 The Real Numbers 9 3 Sequences 29 4 Series 59 5 Functions 81 6 Power Series 105 7 The elementary functions 111 Chapter 1 Sets It is very convenient to introduce some notation and terminology

More information

1/12/05: sec 3.1 and my article: How good is the Lebesgue measure?, Math. Intelligencer 11(2) (1989),

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

106 CHAPTER 3. TOPOLOGY OF THE REAL LINE. 2. The set of limit points of a set S is denoted L (S)

106 CHAPTER 3. TOPOLOGY OF THE REAL LINE. 2. The set of limit points of a set S is denoted L (S) 106 CHAPTER 3. TOPOLOGY OF THE REAL LINE 3.3 Limit Points 3.3.1 Main Definitions Intuitively speaking, a limit point of a set S in a space X is a point of X which can be approximated by points of S other

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

Sequences CHAPTER 3. Definition. A sequence is a function f : N R.

Sequences CHAPTER 3. Definition. A sequence is a function f : N R. CHAPTER 3 Sequences 1. Limits and the Archimedean Property Our first basic object for investigating real numbers is the sequence. Before we give the precise definition of a sequence, we will give the intuitive

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

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

Section 21. The Metric Topology (Continued)

Section 21. The Metric Topology (Continued) 21. The Metric Topology (cont.) 1 Section 21. The Metric Topology (Continued) Note. In this section we give a number of results for metric spaces which are familar from calculus and real analysis. We also

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

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

Quick Tour of the Topology of R. Steven Hurder, Dave Marker, & John Wood 1

Quick Tour of the Topology of R. Steven Hurder, Dave Marker, & John Wood 1 Quick Tour of the Topology of R Steven Hurder, Dave Marker, & John Wood 1 1 Department of Mathematics, University of Illinois at Chicago April 17, 2003 Preface i Chapter 1. The Topology of R 1 1. Open

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

Proofs. Chapter 2 P P Q Q

Proofs. Chapter 2 P P Q Q Chapter Proofs In this chapter we develop three methods for proving a statement. To start let s suppose the statement is of the form P Q or if P, then Q. Direct: This method typically starts with P. Then,

More information

INTRODUCTION TO REAL ANALYSIS II MATH 4332 BLECHER NOTES

INTRODUCTION TO REAL ANALYSIS II MATH 4332 BLECHER NOTES INTRODUCTION TO REAL ANALYSIS II MATH 4332 BLECHER NOTES You will be expected to reread and digest these typed notes after class, line by line, trying to follow why the line is true, for example how it

More information

Lecture Notes in Advanced Calculus 1 (80315) Raz Kupferman Institute of Mathematics The Hebrew University

Lecture Notes in Advanced Calculus 1 (80315) Raz Kupferman Institute of Mathematics The Hebrew University Lecture Notes in Advanced Calculus 1 (80315) Raz Kupferman Institute of Mathematics The Hebrew University February 7, 2007 2 Contents 1 Metric Spaces 1 1.1 Basic definitions...........................

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

Seunghee Ye Ma 8: Week 2 Oct 6

Seunghee Ye Ma 8: Week 2 Oct 6 Week 2 Summary This week, we will learn about sequences and real numbers. We first define what we mean by a sequence and discuss several properties of sequences. Then, we will talk about what it means

More information

h(x) lim H(x) = lim Since h is nondecreasing then h(x) 0 for all x, and if h is discontinuous at a point x then H(x) > 0. Denote

h(x) lim H(x) = lim Since h is nondecreasing then h(x) 0 for all x, and if h is discontinuous at a point x then H(x) > 0. Denote Real Variables, Fall 4 Problem set 4 Solution suggestions Exercise. Let f be of bounded variation on [a, b]. Show that for each c (a, b), lim x c f(x) and lim x c f(x) exist. Prove that a monotone function

More information

Solutions to Homework Assignment 2

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

Chapter 2 Metric Spaces

Chapter 2 Metric Spaces Chapter 2 Metric Spaces The purpose of this chapter is to present a summary of some basic properties of metric and topological spaces that play an important role in the main body of the book. 2.1 Metrics

More information

METRIC SPACES KEITH CONRAD

METRIC SPACES KEITH CONRAD METRIC SPACES KEITH CONRAD 1. Introduction As calculus developed, eventually turning into analysis, concepts first explored on the real line (e.g., a limit of a sequence of real numbers) eventually extended

More information

MAT 544 Problem Set 2 Solutions

MAT 544 Problem Set 2 Solutions MAT 544 Problem Set 2 Solutions Problems. Problem 1 A metric space is separable if it contains a dense subset which is finite or countably infinite. Prove that every totally bounded metric space X is separable.

More information

Topological properties

Topological properties CHAPTER 4 Topological properties 1. Connectedness Definitions and examples Basic properties Connected components Connected versus path connected, again 2. Compactness Definition and first examples Topological

More information

ABSTRACT INTEGRATION CHAPTER ONE

ABSTRACT INTEGRATION CHAPTER ONE CHAPTER ONE ABSTRACT INTEGRATION Version 1.1 No rights reserved. Any part of this work can be reproduced or transmitted in any form or by any means. Suggestions and errors are invited and can be mailed

More information

COMPLEX ANALYSIS TOPIC XVI: SEQUENCES. 1. Topology of C

COMPLEX 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 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

Part III. 10 Topological Space Basics. Topological Spaces

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

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

Chapter One. The Real Number System

Chapter One. The Real Number System Chapter One. The Real Number System We shall give a quick introduction to the real number system. It is imperative that we know how the set of real numbers behaves in the way that its completeness and

More information

Copyright c 2007 Jason Underdown Some rights reserved. statement. sentential connectives. negation. conjunction. disjunction

Copyright c 2007 Jason Underdown Some rights reserved. statement. sentential connectives. negation. conjunction. disjunction Copyright & License Copyright c 2007 Jason Underdown Some rights reserved. statement sentential connectives negation conjunction disjunction implication or conditional antecedant & consequent hypothesis

More information

MATH 1A, Complete Lecture Notes. Fedor Duzhin

MATH 1A, Complete Lecture Notes. Fedor Duzhin MATH 1A, Complete Lecture Notes Fedor Duzhin 2007 Contents I Limit 6 1 Sets and Functions 7 1.1 Sets................................. 7 1.2 Functions.............................. 8 1.3 How to define a

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

Lecture 3 - Tuesday July 5th

Lecture 3 - Tuesday July 5th Lecture 3 - Tuesday July 5th jacques@ucsd.edu Key words: Identities, geometric series, arithmetic series, difference of powers, binomial series Key concepts: Induction, proofs of identities 3. Identities

More information

MAT 417, Fall 2017, CRN: 1766 Real Analysis: A First Course

MAT 417, Fall 2017, CRN: 1766 Real Analysis: A First Course MAT 47, Fall 207, CRN: 766 Real Analysis: A First Course Prerequisites: MAT 263 & MAT 300 Instructor: Daniel Cunningham What is Real Analysis? Real Analysis is the important branch of mathematics that

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

HOMEWORK #2 - MA 504

HOMEWORK #2 - MA 504 HOMEWORK #2 - MA 504 PAULINHO TCHATCHATCHA Chapter 1, problem 6. Fix b > 1. (a) If m, n, p, q are integers, n > 0, q > 0, and r = m/n = p/q, prove that (b m ) 1/n = (b p ) 1/q. Hence it makes sense to

More information

Chapter 8. P-adic numbers. 8.1 Absolute values

Chapter 8. P-adic numbers. 8.1 Absolute values Chapter 8 P-adic numbers Literature: N. Koblitz, p-adic Numbers, p-adic Analysis, and Zeta-Functions, 2nd edition, Graduate Texts in Mathematics 58, Springer Verlag 1984, corrected 2nd printing 1996, Chap.

More information

The Real Number System

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

MATH 51H Section 4. October 16, Recall what it means for a function between metric spaces to be continuous:

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

Practice Test III, Math 314, Spring 2016

Practice Test III, Math 314, Spring 2016 Practice Test III, Math 314, Spring 2016 Dr. Holmes April 26, 2016 This is the 2014 test reorganized to be more readable. I like it as a review test. The students who took this test had to do four sections

More information

Introduction to Real Analysis Alternative Chapter 1

Introduction to Real Analysis Alternative Chapter 1 Christopher Heil Introduction to Real Analysis Alternative Chapter 1 A Primer on Norms and Banach Spaces Last Updated: March 10, 2018 c 2018 by Christopher Heil Chapter 1 A Primer on Norms and Banach Spaces

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

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

Introduction to Proofs in Analysis. updated December 5, By Edoh Y. Amiran Following the outline of notes by Donald Chalice INTRODUCTION Introduction to Proofs in Analysis updated December 5, 2016 By Edoh Y. Amiran Following the outline of notes by Donald Chalice INTRODUCTION Purpose. These notes intend to introduce four main notions from

More information

Proofs. Chapter 2 P P Q Q

Proofs. Chapter 2 P P Q Q Chapter Proofs In this chapter we develop three methods for proving a statement. To start let s suppose the statement is of the form P Q or if P, then Q. Direct: This method typically starts with P. Then,

More information

P-adic Functions - Part 1

P-adic Functions - Part 1 P-adic Functions - Part 1 Nicolae Ciocan 22.11.2011 1 Locally constant functions Motivation: Another big difference between p-adic analysis and real analysis is the existence of nontrivial locally constant

More information