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.
|
|
- Austin Reynolds
- 7 years ago
- Views:
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 ǫ = /2, there exists a N N such that a n a < /2 for n N. But 2 = + = ( a) + (a + ) a + a + = a + a < =, 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 = 0 for all n N and b = 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 ǫ = ǫ/2a. 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 bn b bn b. That is, b n + b for n N. Set M = max{ b, b 2,..., b N, + b }, and we find b n M for n N. Lemma Suppose {b n } n N converges to b with b n = 0 for all n N and b = 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 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 x 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 E (a r, a + r) contains infinitely many points for all r > 0. That is, a is a cluster point of E if and only if every neighborhood of a contains a point in E distinct from a, or for all neighborhoods, U of a, (U \{a}) E =. 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!, (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 = n k= (c) Show that x n+ x n 0 as n (compare this to the definition of a Cauchy sequence). k
CHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e.
CHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e. This chapter contains the beginnings of the most important, and probably the most subtle, notion in mathematical analysis, i.e.,
More informationUndergraduate 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 information1 if 1 x 0 1 if 0 x 1
Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or
More informationn k=1 k=0 1/k! = e. Example 6.4. The series 1/k 2 converges in R. Indeed, if s n = n then k=1 1/k, then s 2n s n = 1 n + 1 +...
6 Series We call a normed space (X, ) a Banach space provided that every Cauchy sequence (x n ) in X converges. For example, R with the norm = is an example of Banach space. Now let (x n ) be a sequence
More informationMetric Spaces Joseph Muscat 2003 (Last revised May 2009)
1 Distance J Muscat 1 Metric Spaces Joseph Muscat 2003 (Last revised May 2009) (A revised and expanded version of these notes are now published by Springer.) 1 Distance A metric space can be thought of
More information1. Prove that the empty set is a subset of every set.
1. Prove that the empty set is a subset of every set. Basic Topology Written by Men-Gen Tsai email: b89902089@ntu.edu.tw Proof: For any element x of the empty set, x is also an element of every set since
More informationMetric Spaces. Chapter 7. 7.1. Metrics
Chapter 7 Metric Spaces A metric space is a set X that has a notion of the distance d(x, y) between every pair of points x, y X. The purpose of this chapter is to introduce metric spaces and give some
More informationGod created the integers and the rest is the work of man. (Leopold Kronecker, in an after-dinner speech at a conference, Berlin, 1886)
Chapter 2 Numbers God created the integers and the rest is the work of man. (Leopold Kronecker, in an after-dinner speech at a conference, Berlin, 1886) God created the integers and the rest is the work
More information3. Mathematical Induction
3. MATHEMATICAL INDUCTION 83 3. Mathematical Induction 3.1. First Principle of Mathematical Induction. Let P (n) be a predicate with domain of discourse (over) the natural numbers N = {0, 1,,...}. If (1)
More informationHOMEWORK 5 SOLUTIONS. n!f n (1) lim. ln x n! + xn x. 1 = G n 1 (x). (2) k + 1 n. (n 1)!
Math 7 Fall 205 HOMEWORK 5 SOLUTIONS Problem. 2008 B2 Let F 0 x = ln x. For n 0 and x > 0, let F n+ x = 0 F ntdt. Evaluate n!f n lim n ln n. By directly computing F n x for small n s, we obtain the following
More informationMathematical Methods of Engineering Analysis
Mathematical Methods of Engineering Analysis Erhan Çinlar Robert J. Vanderbei February 2, 2000 Contents Sets and Functions 1 1 Sets................................... 1 Subsets.............................
More informationMA651 Topology. Lecture 6. Separation Axioms.
MA651 Topology. Lecture 6. Separation Axioms. This text is based on the following books: Fundamental concepts of topology by Peter O Neil Elements of Mathematics: General Topology by Nicolas Bourbaki Counterexamples
More informationx a x 2 (1 + x 2 ) n.
Limits and continuity Suppose that we have a function f : R R. Let a R. We say that f(x) tends to the limit l as x tends to a; lim f(x) = l ; x a if, given any real number ɛ > 0, there exists a real number
More informationNotes on metric spaces
Notes on metric spaces 1 Introduction The purpose of these notes is to quickly review some of the basic concepts from Real Analysis, Metric Spaces and some related results that will be used in this course.
More informationAn example of a computable
An example of a computable absolutely normal number Verónica Becher Santiago Figueira Abstract The first example of an absolutely normal number was given by Sierpinski in 96, twenty years before the concept
More informationIntroduction to Topology
Introduction to Topology Tomoo Matsumura November 30, 2010 Contents 1 Topological spaces 3 1.1 Basis of a Topology......................................... 3 1.2 Comparing Topologies.......................................
More informationsin(x) < x sin(x) x < tan(x) sin(x) x cos(x) 1 < sin(x) sin(x) 1 < 1 cos(x) 1 cos(x) = 1 cos2 (x) 1 + cos(x) = sin2 (x) 1 < x 2
. Problem Show that using an ɛ δ proof. sin() lim = 0 Solution: One can see that the following inequalities are true for values close to zero, both positive and negative. This in turn implies that On the
More informationNo: 10 04. Bilkent University. Monotonic Extension. Farhad Husseinov. Discussion Papers. Department of Economics
No: 10 04 Bilkent University Monotonic Extension Farhad Husseinov Discussion Papers Department of Economics The Discussion Papers of the Department of Economics are intended to make the initial results
More informationPractice with Proofs
Practice with Proofs October 6, 2014 Recall the following Definition 0.1. A function f is increasing if for every x, y in the domain of f, x < y = f(x) < f(y) 1. Prove that h(x) = x 3 is increasing, using
More informationSo let us begin our quest to find the holy grail of real analysis.
1 Section 5.2 The Complete Ordered Field: Purpose of Section We present an axiomatic description of the real numbers as a complete ordered field. The axioms which describe the arithmetic of the real numbers
More informationMathematical Induction
Mathematical Induction (Handout March 8, 01) The Principle of Mathematical Induction provides a means to prove infinitely many statements all at once The principle is logical rather than strictly mathematical,
More informationMetric Spaces. Chapter 1
Chapter 1 Metric Spaces Many of the arguments you have seen in several variable calculus are almost identical to the corresponding arguments in one variable calculus, especially arguments concerning convergence
More informationSOLUTIONS TO EXERCISES FOR. MATHEMATICS 205A Part 3. Spaces with special properties
SOLUTIONS TO EXERCISES FOR MATHEMATICS 205A Part 3 Fall 2008 III. Spaces with special properties III.1 : Compact spaces I Problems from Munkres, 26, pp. 170 172 3. Show that a finite union of compact subspaces
More informationBANACH AND HILBERT SPACE REVIEW
BANACH AND HILBET SPACE EVIEW CHISTOPHE HEIL These notes will briefly review some basic concepts related to the theory of Banach and Hilbert spaces. We are not trying to give a complete development, but
More informationMATH 4330/5330, Fourier Analysis Section 11, The Discrete Fourier Transform
MATH 433/533, Fourier Analysis Section 11, The Discrete Fourier Transform Now, instead of considering functions defined on a continuous domain, like the interval [, 1) or the whole real line R, we wish
More informationI. Pointwise convergence
MATH 40 - NOTES Sequences of functions Pointwise and Uniform Convergence Fall 2005 Previously, we have studied sequences of real numbers. Now we discuss the topic of sequences of real valued functions.
More informationt := maxγ ν subject to ν {0,1,2,...} and f(x c +γ ν d) f(x c )+cγ ν f (x c ;d).
1. Line Search Methods Let f : R n R be given and suppose that x c is our current best estimate of a solution to P min x R nf(x). A standard method for improving the estimate x c is to choose a direction
More informationContinued Fractions and the Euclidean Algorithm
Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction
More informationINCIDENCE-BETWEENNESS GEOMETRY
INCIDENCE-BETWEENNESS GEOMETRY MATH 410, CSUSM. SPRING 2008. PROFESSOR AITKEN This document covers the geometry that can be developed with just the axioms related to incidence and betweenness. The full
More informationTHE BANACH CONTRACTION PRINCIPLE. Contents
THE BANACH CONTRACTION PRINCIPLE ALEX PONIECKI Abstract. This paper will study contractions of metric spaces. To do this, we will mainly use tools from topology. We will give some examples of contractions,
More informationReal Roots of Univariate Polynomials with Real Coefficients
Real Roots of Univariate Polynomials with Real Coefficients mostly written by Christina Hewitt March 22, 2012 1 Introduction Polynomial equations are used throughout mathematics. When solving polynomials
More informationSOLUTIONS TO ASSIGNMENT 1 MATH 576
SOLUTIONS TO ASSIGNMENT 1 MATH 576 SOLUTIONS BY OLIVIER MARTIN 13 #5. Let T be the topology generated by A on X. We want to show T = J B J where B is the set of all topologies J on X with A J. This amounts
More informationMathematical Induction. Mary Barnes Sue Gordon
Mathematics Learning Centre Mathematical Induction Mary Barnes Sue Gordon c 1987 University of Sydney Contents 1 Mathematical Induction 1 1.1 Why do we need proof by induction?.... 1 1. What is proof by
More informationSolutions for Practice problems on proofs
Solutions for Practice problems on proofs Definition: (even) An integer n Z is even if and only if n = 2m for some number m Z. Definition: (odd) An integer n Z is odd if and only if n = 2m + 1 for some
More informationMathematics for Econometrics, Fourth Edition
Mathematics for Econometrics, Fourth Edition Phoebus J. Dhrymes 1 July 2012 1 c Phoebus J. Dhrymes, 2012. Preliminary material; not to be cited or disseminated without the author s permission. 2 Contents
More informationArkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan
Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan 3 Binary Operations We are used to addition and multiplication of real numbers. These operations combine two real numbers
More informationColumbia University in the City of New York New York, N.Y. 10027
Columbia University in the City of New York New York, N.Y. 10027 DEPARTMENT OF MATHEMATICS 508 Mathematics Building 2990 Broadway Fall Semester 2005 Professor Ioannis Karatzas W4061: MODERN ANALYSIS Description
More informationMA4001 Engineering Mathematics 1 Lecture 10 Limits and Continuity
MA4001 Engineering Mathematics 1 Lecture 10 Limits and Dr. Sarah Mitchell Autumn 2014 Infinite limits If f(x) grows arbitrarily large as x a we say that f(x) has an infinite limit. Example: f(x) = 1 x
More informationElementary Number Theory and Methods of Proof. CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook.
Elementary Number Theory and Methods of Proof CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook.edu/~cse215 1 Number theory Properties: 2 Properties of integers (whole
More informationMATHEMATICAL INDUCTION. Mathematical Induction. This is a powerful method to prove properties of positive integers.
MATHEMATICAL INDUCTION MIGUEL A LERMA (Last updated: February 8, 003) Mathematical Induction This is a powerful method to prove properties of positive integers Principle of Mathematical Induction Let P
More informationBasic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011
Basic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011 A. Miller 1. Introduction. The definitions of metric space and topological space were developed in the early 1900 s, largely
More informationFUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES
FUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES CHRISTOPHER HEIL 1. Cosets and the Quotient Space Any vector space is an abelian group under the operation of vector addition. So, if you are have studied
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES Contents 1. Random variables and measurable functions 2. Cumulative distribution functions 3. Discrete
More informationDiscrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2
CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2 Proofs Intuitively, the concept of proof should already be familiar We all like to assert things, and few of us
More informationTHE DIMENSION OF A VECTOR SPACE
THE DIMENSION OF A VECTOR SPACE KEITH CONRAD This handout is a supplementary discussion leading up to the definition of dimension and some of its basic properties. Let V be a vector space over a field
More informationSolutions to Homework 10
Solutions to Homework 1 Section 7., exercise # 1 (b,d): (b) Compute the value of R f dv, where f(x, y) = y/x and R = [1, 3] [, 4]. Solution: Since f is continuous over R, f is integrable over R. Let x
More informationSome Polynomial Theorems. John Kennedy Mathematics Department Santa Monica College 1900 Pico Blvd. Santa Monica, CA 90405 rkennedy@ix.netcom.
Some Polynomial Theorems by John Kennedy Mathematics Department Santa Monica College 1900 Pico Blvd. Santa Monica, CA 90405 rkennedy@ix.netcom.com This paper contains a collection of 31 theorems, lemmas,
More informationCS 103X: Discrete Structures Homework Assignment 3 Solutions
CS 103X: Discrete Structures Homework Assignment 3 s Exercise 1 (20 points). On well-ordering and induction: (a) Prove the induction principle from the well-ordering principle. (b) Prove the well-ordering
More informationExample 4.1 (nonlinear pendulum dynamics with friction) Figure 4.1: Pendulum. asin. k, a, and b. We study stability of the origin x
Lecture 4. LaSalle s Invariance Principle We begin with a motivating eample. Eample 4.1 (nonlinear pendulum dynamics with friction) Figure 4.1: Pendulum Dynamics of a pendulum with friction can be written
More informationWHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT?
WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT? introduction Many students seem to have trouble with the notion of a mathematical proof. People that come to a course like Math 216, who certainly
More information1 Norms and Vector Spaces
008.10.07.01 1 Norms and Vector Spaces Suppose we have a complex vector space V. A norm is a function f : V R which satisfies (i) f(x) 0 for all x V (ii) f(x + y) f(x) + f(y) for all x,y V (iii) f(λx)
More informationSection 1.3 P 1 = 1 2. = 1 4 2 8. P n = 1 P 3 = Continuing in this fashion, it should seem reasonable that, for any n = 1, 2, 3,..., = 1 2 4.
Difference Equations to Differential Equations Section. The Sum of a Sequence This section considers the problem of adding together the terms of a sequence. Of course, this is a problem only if more than
More informationSequences and Series
Sequences and Series Consider the following sum: 2 + 4 + 8 + 6 + + 2 i + The dots at the end indicate that the sum goes on forever. Does this make sense? Can we assign a numerical value to an infinite
More informationFIRST YEAR CALCULUS. Chapter 7 CONTINUITY. It is a parabola, and we can draw this parabola without lifting our pencil from the paper.
FIRST YEAR CALCULUS WWLCHENW L c WWWL W L Chen, 1982, 2008. 2006. This chapter originates from material used by the author at Imperial College, University of London, between 1981 and 1990. It It is is
More information3. INNER PRODUCT SPACES
. INNER PRODUCT SPACES.. Definition So far we have studied abstract vector spaces. These are a generalisation of the geometric spaces R and R. But these have more structure than just that of a vector space.
More informationa 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.
Chapter 1 LINEAR EQUATIONS 1.1 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,..., a n, b are given
More informationMOP 2007 Black Group Integer Polynomials Yufei Zhao. Integer Polynomials. June 29, 2007 Yufei Zhao yufeiz@mit.edu
Integer Polynomials June 9, 007 Yufei Zhao yufeiz@mit.edu We will use Z[x] to denote the ring of polynomials with integer coefficients. We begin by summarizing some of the common approaches used in dealing
More informationPUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include 2 + 5.
PUTNAM TRAINING POLYNOMIALS (Last updated: November 17, 2015) Remark. This is a list of exercises on polynomials. Miguel A. Lerma Exercises 1. Find a polynomial with integral coefficients whose zeros include
More informationMATH10040 Chapter 2: Prime and relatively prime numbers
MATH10040 Chapter 2: Prime and relatively prime numbers Recall the basic definition: 1. Prime numbers Definition 1.1. Recall that a positive integer is said to be prime if it has precisely two positive
More informationON SEQUENTIAL CONTINUITY OF COMPOSITION MAPPING. 0. Introduction
ON SEQUENTIAL CONTINUITY OF COMPOSITION MAPPING Abstract. In [1] there was proved a theorem concerning the continuity of the composition mapping, and there was announced a theorem on sequential continuity
More informationMath 104: Introduction to Analysis
Math 104: Introduction to Analysis Evan Chen UC Berkeley Notes for the course MATH 104, instructed by Charles Pugh. 1 1 August 29, 2013 Hard: #22 in Chapter 1. Consider a pile of sand principle. You wish
More informationMath 4310 Handout - Quotient Vector Spaces
Math 4310 Handout - Quotient Vector Spaces Dan Collins The textbook defines a subspace of a vector space in Chapter 4, but it avoids ever discussing the notion of a quotient space. This is understandable
More informationMATH PROBLEMS, WITH SOLUTIONS
MATH PROBLEMS, WITH SOLUTIONS OVIDIU MUNTEANU These are free online notes that I wrote to assist students that wish to test their math skills with some problems that go beyond the usual curriculum. These
More informationI. GROUPS: BASIC DEFINITIONS AND EXAMPLES
I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called
More informationCHAPTER 3. Methods of Proofs. 1. Logical Arguments and Formal Proofs
CHAPTER 3 Methods of Proofs 1. Logical Arguments and Formal Proofs 1.1. Basic Terminology. An axiom is a statement that is given to be true. A rule of inference is a logical rule that is used to deduce
More informationThe Ideal Class Group
Chapter 5 The Ideal Class Group We will use Minkowski theory, which belongs to the general area of geometry of numbers, to gain insight into the ideal class group of a number field. We have already mentioned
More informationAn Introduction to Real Analysis. John K. Hunter. Department of Mathematics, University of California at Davis
An Introduction to Real Analysis John K. Hunter Department of Mathematics, University of California at Davis Abstract. These are some notes on introductory real analysis. They cover the properties of the
More information36 CHAPTER 1. LIMITS AND CONTINUITY. Figure 1.17: At which points is f not continuous?
36 CHAPTER 1. LIMITS AND CONTINUITY 1.3 Continuity Before Calculus became clearly de ned, continuity meant that one could draw the graph of a function without having to lift the pen and pencil. While this
More informationSample Induction Proofs
Math 3 Worksheet: Induction Proofs III, Sample Proofs A.J. Hildebrand Sample Induction Proofs Below are model solutions to some of the practice problems on the induction worksheets. The solutions given
More information8 Divisibility and prime numbers
8 Divisibility and prime numbers 8.1 Divisibility In this short section we extend the concept of a multiple from the natural numbers to the integers. We also summarize several other terms that express
More informationLinear Algebra Notes for Marsden and Tromba Vector Calculus
Linear Algebra Notes for Marsden and Tromba Vector Calculus n-dimensional Euclidean Space and Matrices Definition of n space As was learned in Math b, a point in Euclidean three space can be thought of
More informationCritical points of once continuously differentiable functions are important because they are the only points that can be local maxima or minima.
Lecture 0: Convexity and Optimization We say that if f is a once continuously differentiable function on an interval I, and x is a point in the interior of I that x is a critical point of f if f (x) =
More informationDEGREES OF ORDERS ON TORSION-FREE ABELIAN GROUPS
DEGREES OF ORDERS ON TORSION-FREE ABELIAN GROUPS ASHER M. KACH, KAREN LANGE, AND REED SOLOMON Abstract. We construct two computable presentations of computable torsion-free abelian groups, one of isomorphism
More informationWRITING PROOFS. Christopher Heil Georgia Institute of Technology
WRITING PROOFS Christopher Heil Georgia Institute of Technology A theorem is just a statement of fact A proof of the theorem is a logical explanation of why the theorem is true Many theorems have this
More informationDuality of linear conic problems
Duality of linear conic problems Alexander Shapiro and Arkadi Nemirovski Abstract It is well known that the optimal values of a linear programming problem and its dual are equal to each other if at least
More informationBX in ( u, v) basis in two ways. On the one hand, AN = u+
1. Let f(x) = 1 x +1. Find f (6) () (the value of the sixth derivative of the function f(x) at zero). Answer: 7. We expand the given function into a Taylor series at the point x = : f(x) = 1 x + x 4 x
More informationCartesian Products and Relations
Cartesian Products and Relations Definition (Cartesian product) If A and B are sets, the Cartesian product of A and B is the set A B = {(a, b) :(a A) and (b B)}. The following points are worth special
More informationPYTHAGOREAN TRIPLES KEITH CONRAD
PYTHAGOREAN TRIPLES KEITH CONRAD 1. Introduction A Pythagorean triple is a triple of positive integers (a, b, c) where a + b = c. Examples include (3, 4, 5), (5, 1, 13), and (8, 15, 17). Below is an ancient
More information0 <β 1 let u(x) u(y) kuk u := sup u(x) and [u] β := sup
456 BRUCE K. DRIVER 24. Hölder Spaces Notation 24.1. Let Ω be an open subset of R d,bc(ω) and BC( Ω) be the bounded continuous functions on Ω and Ω respectively. By identifying f BC( Ω) with f Ω BC(Ω),
More informationLies My Calculator and Computer Told Me
Lies My Calculator and Computer Told Me 2 LIES MY CALCULATOR AND COMPUTER TOLD ME Lies My Calculator and Computer Told Me See Section.4 for a discussion of graphing calculators and computers with graphing
More informationTOPIC 4: DERIVATIVES
TOPIC 4: DERIVATIVES 1. The derivative of a function. Differentiation rules 1.1. The slope of a curve. The slope of a curve at a point P is a measure of the steepness of the curve. If Q is a point on the
More informationMathematics Review for MS Finance Students
Mathematics Review for MS Finance Students Anthony M. Marino Department of Finance and Business Economics Marshall School of Business Lecture 1: Introductory Material Sets The Real Number System Functions,
More informationChapter 7. Continuity
Chapter 7 Continuity There are many processes and eects that depends on certain set of variables in such a way that a small change in these variables acts as small change in the process. Changes of this
More informationU.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009. Notes on Algebra
U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009 Notes on Algebra These notes contain as little theory as possible, and most results are stated without proof. Any introductory
More informationINTRODUCTORY SET THEORY
M.Sc. program in mathematics INTRODUCTORY SET THEORY Katalin Károlyi Department of Applied Analysis, Eötvös Loránd University H-1088 Budapest, Múzeum krt. 6-8. CONTENTS 1. SETS Set, equal sets, subset,
More informationMATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1.
MATH10212 Linear Algebra Textbook: D. Poole, Linear Algebra: A Modern Introduction. Thompson, 2006. ISBN 0-534-40596-7. Systems of Linear Equations Definition. An n-dimensional vector is a row or a column
More informationFollow links for Class Use and other Permissions. For more information send email to: permissions@pupress.princeton.edu
COPYRIGHT NOTICE: Ariel Rubinstein: Lecture Notes in Microeconomic Theory is published by Princeton University Press and copyrighted, c 2006, by Princeton University Press. All rights reserved. No part
More informationGROUPS ACTING ON A SET
GROUPS ACTING ON A SET MATH 435 SPRING 2012 NOTES FROM FEBRUARY 27TH, 2012 1. Left group actions Definition 1.1. Suppose that G is a group and S is a set. A left (group) action of G on S is a rule for
More informationHomework # 3 Solutions
Homework # 3 Solutions February, 200 Solution (2.3.5). Noting that and ( + 3 x) x 8 = + 3 x) by Equation (2.3.) x 8 x 8 = + 3 8 by Equations (2.3.7) and (2.3.0) =3 x 8 6x2 + x 3 ) = 2 + 6x 2 + x 3 x 8
More informationTaylor and Maclaurin Series
Taylor and Maclaurin Series In the preceding section we were able to find power series representations for a certain restricted class of functions. Here we investigate more general problems: Which functions
More informationBasic Probability Concepts
page 1 Chapter 1 Basic Probability Concepts 1.1 Sample and Event Spaces 1.1.1 Sample Space A probabilistic (or statistical) experiment has the following characteristics: (a) the set of all possible outcomes
More informationSYSTEMS OF PYTHAGOREAN TRIPLES. Acknowledgements. I would like to thank Professor Laura Schueller for advising and guiding me
SYSTEMS OF PYTHAGOREAN TRIPLES CHRISTOPHER TOBIN-CAMPBELL Abstract. This paper explores systems of Pythagorean triples. It describes the generating formulas for primitive Pythagorean triples, determines
More informationSet theory as a foundation for mathematics
V I I I : Set theory as a foundation for mathematics This material is basically supplementary, and it was not covered in the course. In the first section we discuss the basic axioms of set theory and the
More information1 Homework 1. [p 0 q i+j +... + p i 1 q j+1 ] + [p i q j ] + [p i+1 q j 1 +... + p i+j q 0 ]
1 Homework 1 (1) Prove the ideal (3,x) is a maximal ideal in Z[x]. SOLUTION: Suppose we expand this ideal by including another generator polynomial, P / (3, x). Write P = n + x Q with n an integer not
More informationSection 1.1 Real Numbers
. Natural numbers (N):. Integer numbers (Z): Section. Real Numbers Types of Real Numbers,, 3, 4,,... 0, ±, ±, ±3, ±4, ±,... REMARK: Any natural number is an integer number, but not any integer number is
More informationMath 55: Discrete Mathematics
Math 55: Discrete Mathematics UC Berkeley, Fall 2011 Homework # 5, due Wednesday, February 22 5.1.4 Let P (n) be the statement that 1 3 + 2 3 + + n 3 = (n(n + 1)/2) 2 for the positive integer n. a) What
More informationAdvanced Microeconomics
Advanced Microeconomics Ordinal preference theory Harald Wiese University of Leipzig Harald Wiese (University of Leipzig) Advanced Microeconomics 1 / 68 Part A. Basic decision and preference theory 1 Decisions
More information9 More on differentiation
Tel Aviv University, 2013 Measure and category 75 9 More on differentiation 9a Finite Taylor expansion............... 75 9b Continuous and nowhere differentiable..... 78 9c Differentiable and nowhere monotone......
More informationCONTRIBUTIONS TO ZERO SUM PROBLEMS
CONTRIBUTIONS TO ZERO SUM PROBLEMS S. D. ADHIKARI, Y. G. CHEN, J. B. FRIEDLANDER, S. V. KONYAGIN AND F. PAPPALARDI Abstract. A prototype of zero sum theorems, the well known theorem of Erdős, Ginzburg
More informationSHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH
31 Kragujevac J. Math. 25 (2003) 31 49. SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH Kinkar Ch. Das Department of Mathematics, Indian Institute of Technology, Kharagpur 721302, W.B.,
More information