# n 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

Save this PDF as:

Size: px
Start display at page:

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

## Transcription

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 in X. Define a new sequence (s n ) in X by s n = x k, n N. k= The sequence (s n ) is called a series in X and is written as x k or k x k. The n-th term s n of the sequence (s n) is called the nth partial sum and x k is called the kth summand of the series k x k. Definition 6.. The series k x k converges or is convergent if the sequence (s n ) of partial sums converges. The limit lim n s n is called the value of the series k x k and is written as k= x k Finally, k x k diverges or is divergent if the sequence (s n ) diverges in X. Proposition 6. (Necessary condition for convergence). If the series xk converges, then x n 0. Proof. Denoting by s n the nth partial sum of the series x k, we have s n x for some x. Since the result follows. x n = s n+ s n x x = 0, Example 6.3. The series (/k!) converges in R. Its value is /k! = e. Example 6.4. The series /k converges in R. Indeed, if s n = n k= /k, then s n = /k ( + k(k ) = + k ) = + k n <. k= k= So, the sequence (s n ) of partial sums is bounded in R and since it is also increasing, it converges. Example 6.5. The harmonic series /k diverges. Indeed, if s n = n k= /k, then s n s n = n n n n = showing that (s n ) is not a Cauchy sequence and this implies that k /k is dirvergent. 30 k=

2 Example 6.6. The geometric series a k, where a R satisfies a <, converges. Indeed, s n = a k = ak+ a and since a <, we have a k+ 0 showing that lim s n = n If a, then k ak diverges. a k = a. Proposition 6.7. Let a k and b k be convergent series in a Banach space X and let α R. Then The series (a k + b k ) converges and k= (a k + b k ) = k= a k + k= b k. The series k= (αa k) converges and k= (αa k) = α k= a k. Theorem 6.8 (Cauchy criterion). For a series x k in a Banach space (X, ) the following conditions are equaivalent. (a) The series x k converges. (b) For every ε > 0 there is N N such that m x k < ε for all m > n N. k=n+ Proof. Let s n = n k= x k be the nth partial sum. Then s m s n = m k=n+ x k if m > n.thus (s n ) is Cauchy in X if and only if the condition (b) holds true. By assumption, (X, ) is a Banach space and the result follows. Theorem 6.9. If a k is a series in R and a k 0 for all k N, then a k converges if and only if the sequence (s n ) of partial sums is bounded. In this case, the series has the value equal to sup n N s n. Proof. Since a k 0 for all k N, the sequence (s n ) of partial sums is increasing. Hence (s n ) converges if and only if (s n ) is bounded. 3

3 6. Alternating series Definition 6.0. A series a k in R is called alternating if a k and a k+ have opposite signs. Any such series can be written as ± ( ) k a k with a k 0 for all k N. Theorem 6. (Leibniz criterion). Let (a k ) be a decreasing null sequence such that a k 0 for all k N. Then the alternating series ( ) k a k converges in R. Proof. Since s n+ s n = a n+ + a n+ 0, the sequence (s n ) is decreasing. Similarly, s n+3 s n+ = a n+ a n+3 0, implying that (s n+ ) is increasing. Moreover, s n+ s n so that s n+ s and s n 0 for all n. Hence, there are s and t such that s n s and s n+ t. Also t s = lim n (s n+ s n ) = lim n a n+ = 0 implying that t = s. Take ε > 0. Then there are N,N N such that s n s < ε, n N and s n+ s < ε, n + N. Thus, s n s < ε for all n > max{n,n }. Example 6.. The assumption that (a n ) is decreasing is necessary. For example, set a n = n and a n = (n ). Then a n = (n ) n so that 0 a n n showing that a n 0. Since a n < a n for n, the sequence (a n ) is not decreasing. However, the series ( ) n a n diverges. Arguing by contradiction we assume that the sequence (s n ) of partial sums converges. We have s n = k= = ( ) k a k = k= = A n + B n, ( )a k + k= (k ) + k 3 k= k= a k

4 where A n = n k= and B (k ) n = n k= k = n k= k. Since the series k converges, the sequence (A (k ) n ) converges. Consequently, the sequence B n = s n +A n converges. But this contradicts the fact that the series k k diverges. 6. Absolute convergence Definition 6.3. The series x k in a Banach space (X, ) converges absolutely or is absolutely convergent if the series x k is convergent in R. The series x k is conditionally convergent if x k converges but x k diverges. Example 6.4. The alternating harmonic series ( ) k /k converges in view of Leibniz criterion, however, the series of absolute values /k diverges. Hence the series ( ) k /k converges conditionally. Proposition 6.5. Every absolutely convergent series converges. Proof. The proposition is a consequence of Cauchy criterion and the triangle inequality. Indeed, m m x k x k. k=n+ k=n+ 6.3 Comparison, Root, and Ratio Tests From now on we only consider real sequences, however, you are invited to figure out which of the results can be stated in the full generality of Banach spaces. Proposition 6.6 (Comparison test). Let a k and b n be two sequences of nonnegative terms and assume that Then the following holds true, a n b n for all n. (a) If b k converges, then so is a k. (b) If a k diverges, then so is b k. 33

5 Example 6.7. Let m. Then the series /k m converges absolutely. Recall from Example 6.4 that the series converges. Since for m, k we have k m k for all k, it follows from Proposition 6.6 that the series /k m is indeed convergent. Proposition 6.8 (Limit comparison test). Let a k and b n be two sequences of positive terms and assume that a n b n L (Clearly, L [0, ) or L = ). Then the following holds true, (a) If L (0, ), then the convergence of b k implies the convergence of ak and the divergence of a k implies the divergence of b k. (b) Assume that L = 0. Then a k converges if b k converges. (c) Assume that L =. Then a k diverges, if b k diverges. Proof. We only prove (a). If L (0, ), then there is N so that L/ = L L/ < a n /b n < L+L/ = 3L/ for n N. So, (L/)b n < a n < (3L/)b n for n N and the result follows from Proposition 6.6. Theorem 6.9 (Root test). Let a k be a series of nonnegative real numbers and let α = lim sup n a n. Then a k converges absolutely if α <. a k diverges if α >. If α =, then both convergence and divergence of a k are possible. Theorem 6.0 (Ratio test). Let a k be a series of real numbers such that a k 0 for all k N. Then If lim a k+ a <, k k then a k converges absolutely. 34

6 If then a k diverges. lim a k+ a >, k k a If lim k+ k a k =, then both convergence and divergence of ak are possible. Proposition 6. (Cauchy s condensation test). Let (a k ) be a sequence of nonnegative and decreasing terms. Then a k converges if and only if the series k a k converges. Proof. Denote by s n = n k= and t n = n k= k a k. Then, if n < m, we have s n a + (a + a 3 ) (a m a m+ ) a + a m a m = t m. If k a k converges, then the sequence (t m ) is bounded and above estimate shows that (s n ) is bounded. Hence a k converges. For the converse, note that if n > m, then s n a + a + (a 3 + a 4 ) (a m a m) a + a + a m a m = t m. This shows that if a k converges, then the sequence (t m ) is bounded so that k a k converges. Example 6.. Consider the series n with p > 0. Then the condensation test implies that p n converges if and only if n p = ( ) n np p converges. We already know that the geometric series ( ) n converges p if and only if <, i.e., p >. p The next theorem is a generalization of the condensation test. Theorem 6.3 (Schlömlich theorem). Let (g k ) be a strictly increasing sequence of positive integers such that g k+ g k C(g k g k ) for some C > 0 and all k N. If (a k ) is a decreasing sequence of nonnegative numbers, then ak converges if and only if (g k+ g k )a gk converges. 35

7 Proof. The proof is similar to the proof of the condensation test. Let (S n ) be the sequence of the partial sums of the series a k and (T n ) the sequence of the partial sums of the series (g k+ g k )a gk. Now, if n < g k, then S n S gk (a a g ) + (a g a g ) (a gk a gk+ ) (a a g ) + (g g )a g (g k+ g k )a gk (a a g ) + T k. Consequently, if the sequence (T k ) converges and hence is bounded, then the sequence (S n ) is bounded so that a k converges. Conversely, assume that a k converges. If n > g k, then CS n CS gk C(a g a g ) C(a gk a gk C(g g )a g C(g k g k )a gk (g 3 g )a g (g k+ g k )a gk = T k (g g )a g. Consequently, the sequence (T k ) is bounded and the series (g k+ g k )a gk converges. Example 6.4. Take g k = 3 k. Then the sequence (g k ) satisfies the assumptions of the above theorem and g k+ g k = 3 k+ 3 k = 3 k. So, the following holds true. Assume that (a k ) is a decreasing sequence of nonnegative numbers, then ak converges if and only if 3 k a 3 k converges. Now consider the series. Since the sequence ( ) is decreasing 3 ln n 3 ln n and converges to 0, converges if and only if 3 n 3 ln n 3 = 3 n = ( ) ln3n 3 n ln3 n 3 converges. Since ln 3 >, it follows that 3 ln 3 > and ln3 < so that the series ( ) n 3 ln3 3 converges. Hence converges. ln3 3 ln n Consider g k = k, then the sequence (g k ) satisfies the assumptions of the theorem. Then the following is true. If (a k ) is a decreasing sequence of nonnegative numbers, then ak converges if and only if ka k converges. Indeed, since (k + ) k ) = k +, it follows from Theorem?? that a k converges if and only if (k +)a k converges. Since ka k (k +)a k 36

8 3ka k, the comparison test shows that (k +)a k converges if and only if kak converges. showing our claim. Now consider the series. Since n the sequence / n ) is decreasing and converges to 0, the series n converges if and only if the series n n = n converges. Using the n ratio test, we see that n converges and so n converges. n 6.4 The Dirichlet and Abel Test We start with the following lemma. Lemma 6.5 (Abels lemma). Let (x n ) and (y n ) be two sequences of real numbers. Let (s n ) be a sequence of partial sums of (y n ) and s 0 = 0. Then m k=n+ x k y k = (x m s m x n+ s n ) + Proof. Note that y k = s k s k. So, m k=n+ x k y k = m k=n+ x k (s k s k ) m k=n+ (x k x k+ )s k. = x n+ (s n+ s n ) + x n+ (s n+ s n+ ) x m (s m s m ) = x m (x m x n+ s n ) + s n+ (x n+ x n+ ) s m (x m x m ) = x m (x m x n+ s n ) + m k=n+ x k (s k s k ) We use this lemma to obtain a test for convergence of the series x k y k. Theorem 6.6 (Dirichlet s test). Suppose that (x n ) is a decreasing sequence such that x n 0 and the sequence (s n ) of the partial sums of (y n ) is bounded. Then the series x k y k converges. Proof. Since (s n ) is bounded, s n C for all n. Since (x k ) is decreasing, x k x k+ 0. Thus, by the above lemma, m k=n+ x k y k x m s m + x n+ s n + m k=n+ (x k x k+ ) s k ((x n+ + x m ) + (x n+ x m ))C = x n+ C. 37

9 Example 6.7. Consider ( ) n x n where x n is a decreasing sequence of nonnegative numbers converging to 0. Then the series converges in view of alternating series test. However, this also follows from Dirichlet s test. Indeed, let y n = ( ) n. Then s n = n k= b k = n k= ( )k is equal to if n is odd and is equal to 0 if n is even. Hence the sequence (s n ) is bounded, and Dirichlet s test implies that the series ( ) n a n converges. Example 6.8. One can show, using for example the principle of mathematical induction, that sin ϑ (cos ϑ + cos ϑ cos nϑ) = cos (n + )ϑ Hence if ϑ πk for all k Z, then Similarly, cos ϑ + cos ϑ cos nϑ = sin ϑ which implies that cos (n+)ϑ sin nϑ sin ϑ (sin ϑ + sin ϑ sin nϑ) = sin (n + )ϑ sin ϑ + sinϑ sin nϑ sin ϑ sin nϑ. sin ϑ. sin nϑ if ϑ πk for all k Z. Hence, in view of Dirichlet s test, one has the following result. Corollary 6.9. If (x n ) is a decreasing sequence converging to 0 and ϑ πk for all k Z, then the series x n cos nϑ and x n sinnϑ converge. Theorem 6.30 (Abel s test). If (x n ) is a monotone convergent sequence and the series y k converges, then x k y k converges. Proof. Without loss of generality, we may assume that (x n ) is decreasing. If x = lim x n, set u n = x n x is decreasing and converging to 0. Thus, x n = x + u n and x n y n = xy n + u n y n. Now note that the series xy k converges since y k converges and the series u n y n converges in view of the Dirichlet s test. Hence, the series x n y n converges. 38

10 6.5 Cauchy Product Definition 6.3. The Cauchy product of two series n 0 a n and n 0 b n is the series n 0 c n where c n = a k b n k. n 0. Example 6.3. Let n 0 c n be the Cauchy product of the alternating series ( ) n n+ with itself. That is, c n = ( ) k k + ( ) n k = ( ) n (n k) + (k + )(n k). Note that, in view of the alternating series test, the series ( ) n n+ converges conditionally. However, the Cauchy product diverges. To see this we show that the sequence (c n ) does not converge to 0. Indeed, we have ( n ) ( n ) (n k + )(k + ) = + k and hence (n k + )(k + ) = (n/ + ) (n/ k) n/ + ) = n +. Using this we find that c n = (k + )(n k) n/ + = (n + ) n + showing that the sequence (c n ) does not converge to 0. Theorem 6.33 (Mertens theorem). Assume that n 0 converges absolutely, n=0 a n = A, n=0 b n = B, and n 0 is the Cauchy product of n 0 a n and n 0 b n. Then n 0 c n converges and n=0 c n = AB. Proof. Define A n = a n, B n = b n, C n = c n, β n = B n B. 39

11 Then C n = c 0 + c c n = a 0 b 0 + (a 0 b + a b 0 ) (a 0 b n + a b n a n b 0 ) = a 0 (b 0 + b b n ) + a (b 0 + b b n ) a n b 0 = a 0 B n + a B n a n B 0 = a 0 (β n + B) + a (β n + B) a n (β 0 + B) = (a a n )B + (a 0 β n + a β n a n β n ) = A n B + γ n where we have abbreviated γ n = a 0 β n + a β n a n β n. Since A n B AB, it suffices to show that γ n 0. In order to show that γ n 0, pick ε > 0. Then, since β n 0, there is N such that Let Â = β n < ε for all n N. a n and β n M. n=0 (The series n 0 a n converges and (β n ) is bounded since it converges.) Then γ n = a 0 β n + a β n a n β 0 a 0 β n + a β n a n N β N + a n N+ β N + a n N+ β N a n β 0 ε Â + M ( a n N+ + a n N a n ) Keeping N fixed and letting n, we get lim sup γ n εâ since a n 0. Since ε > 0 was arbitrary, we conclude that lim sup γ n = 0 which implies that lim γ n = 0 as claimed Theorem 6.34 (Abel s theorem). If n=0 a n = A, n=0 b n = B, and n=0 c n = C, where c n = n a kb n k for all n 0, then C = AB. 40

12 6.6 Double Sums Let (X, ) be a normed space, let (a ij ) (i,j) N N be a double sequence in X, and the double series a ij. We have a function a : N N N, (j,k) a jk. Since N N is countable, there is a bijection σ : N N N. If σ is such bijection, the series n a σ(n) is called an ordering of the double series a jk. If we fix j N (or k N ), then the series a jk is called the jth row series (or the kth column series). If every row series (or column series) converges, then we may consider the series of row sums j ( a jk) (or the series of column sums k ( j=0 a jk)). Finally, the double series a jk is summable if sup n a jk <. Theorem Let a jk be a summable double series. Then j,k (a) Every ordering n a σ(n) of a jk is converges absolutely to a value s X which is independent of σ. (b) The series of row sums j ( a jk) and the series of column sums k ( j=0 a jk) converge absolutely and ( j=0 a jk ) = k ( a jk ). j=0 To prove (a) we will need the following result. Let a n be a series and let σ : N N be a bijection. Define b n = a σ(n). Then the series b n is called a rearrangement of of a n. Proposition Assume that a n converges absolutely. Then any rearrangement of a n converges absolutely. (They all converge to the same value). Proof. Assume that a n converges absolutely. Take a bijection σ : N N and consider b n with b n = a σ(n). Denote by (A n ) and (B n ) the sequences of partial sums of a n and b n, respectively. Since a n converges absolutely, given ε > 0, there is N such that m a k < ε () k=n 4

13 for all m > n N. Let K be such that {,...,N} {σ(),...,σ(k)}. Take n > K and consider the difference A n B n Note that the terms a,...,a N appear in both partial sums A n and B n. So, by () A n B n < ε. Hence lim A n = lim B n, proving that b n converges to the same value as an. The same argument in which A n and B n are partial sums of a n and b n, respectively, shows that b n converges absolutely. Proof of Theorem (a) Abbreviate M = n n j, a jk. Let σ : N N N be a bijection and let N N. Then there is some K N such that {σ(0),...,σ(n)} {(0,0),(,0),...,(K,0),...,(K,K)}. () Together with the summability of a jk this imples N aσ(n) n=0 K j, a jk M. This implies that n a σ(n) converges absolutely. Let δ : N N N be another bijection. Then α = σ δ : N N is a bijection. Set y m = x σ(m). Then b α(n) = a σ(α(n)) = a δ(n), n N. Thus n a δ(n) is a rearrangement of n a σ(n). Since n a σ(n) converges absolutely, the series n a δ(n) also converges absolutely. (b) The row series a jk, j N, and the column series j=0 a jk, k N, converge absolutely. This follows from the summability of a jk. So, the series of row series j ( a jk) and the series of column series k ( j=0 a jk). To see that these series converge absolutely, consider the following inequalities, l m l m m a jk a jk a jk M, l m. j=0 j=0 Taking the limit m, we get l j=0 a jk M, l N. This proves the absolute convergence of the series of row series j ( a jk). A similar argument proves the absolute convergence of the series of column series k ( j=0 a jk). j,k 4

14 Now let σ : N N N be a bijection and let s = n a σ(n). Then for every ε > 0, there is N N such that n=n+ aσ(n) <. Also there is some K N such that () is satisfied. Then l m N a jk a σ(n) a σ(n) < ε/, l,m K. j=0 n=0 n=n+ Taking the limit m and l, we get N a jk a σ(n) j=0 n=0 Applying the triangle inequality to N s a σ(n) n=0 n=n+ n=n+ aσ(n) ε/. aσ(n) < ε/, we get a jk s ε. j=0 A similar argument shows that the value of k ( j=0 a jk) is also s. 43

### x if x 0, x if x < 0.

Chapter 3 Sequences In this chapter, we discuss sequences. We say what it means for a sequence to converge, and define the limit of a convergent sequence. We begin with some preliminary results about the

### Section 3 Sequences and Limits, Continued.

Section 3 Sequences and Limits, Continued. Lemma 3.6 Let {a n } n N be a convergent sequence for which a n 0 for all n N and it α 0. Then there exists N N such that for all n N. α a n 3 α In particular

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

### The Limit of a Sequence of Numbers: Infinite Series

Connexions module: m36135 1 The Limit of a Sequence of Numbers: Infinite Series Lawrence Baggett This work is produced by The Connexions Project and licensed under the Creative Commons Attribution License

### Series. Chapter Convergence of series

Chapter 4 Series Divergent series are the devil, and it is a shame to base on them any demonstration whatsoever. Niels Henrik Abel, 826 This series is divergent, therefore we may be able to do something

### 3.1. Sequences and Their Limits Definition (3.1.1). A sequence of real numbers (or a sequence in R) is a function from N into R.

CHAPTER 3 Sequences and Series 3.. Sequences and Their Limits Definition (3..). A sequence of real numbers (or a sequence in R) is a function from N into R. Notation. () The values of X : N! R are denoted

### S = k=1 k. ( 1) k+1 N S N S N

Alternating Series Last time we talked about convergence of series. Our two most important tests, the integral test and the (limit) comparison test, both required that the terms of the series were (eventually)

### CONTINUED FRACTIONS AND PELL S EQUATION. Contents 1. Continued Fractions 1 2. Solution to Pell s Equation 9 References 12

CONTINUED FRACTIONS AND PELL S EQUATION SEUNG HYUN YANG Abstract. In this REU paper, I will use some important characteristics of continued fractions to give the complete set of solutions to Pell s equation.

### The Alternating Series Test

The Alternating Series Test So far we have considered mostly series all of whose terms are positive. If the signs of the terms alternate, then testing convergence is a much simpler matter. On the other

### Chapter 2 Sequences and Series

Chapter 2 Sequences and Series 2. Sequences A sequence is a function from the positive integers (possibly including 0) to the reals. A typical example is a n = /n defined for all integers n. The notation

### ANALYTICAL MATHEMATICS FOR APPLICATIONS 2016 LECTURE NOTES Series

ANALYTICAL MATHEMATICS FOR APPLICATIONS 206 LECTURE NOTES 8 ISSUED 24 APRIL 206 A series is a formal sum. Series a + a 2 + a 3 + + + where { } is a sequence of real numbers. Here formal means that we don

### Series Convergence Tests Math 122 Calculus III D Joyce, Fall 2012

Some series converge, some diverge. Series Convergence Tests Math 22 Calculus III D Joyce, Fall 202 Geometric series. We ve already looked at these. We know when a geometric series converges and what it

### 1. R In this and the next section we are going to study the properties of sequences of real numbers.

+a 1. R In this and the next section we are going to study the properties of sequences of real numbers. Definition 1.1. (Sequence) A sequence is a function with domain N. Example 1.2. A sequence of real

### 61. REARRANGEMENTS 119

61. REARRANGEMENTS 119 61. Rearrangements Here the difference between conditionally and absolutely convergent series is further refined through the concept of rearrangement. Definition 15. (Rearrangement)

### Math 317 HW #5 Solutions

Math 317 HW #5 Solutions 1. Exercise 2.4.2. (a) Prove that the sequence defined by x 1 = 3 and converges. x n+1 = 1 4 x n Proof. I intend to use the Monotone Convergence Theorem, so my goal is to show

### Double Sequences and Double Series

Double Sequences and Double Series Eissa D. Habil Islamic University of Gaza P.O. Box 108, Gaza, Palestine E-mail: habil@iugaza.edu Abstract This research considers two traditional important questions,

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

### Limits and convergence.

Chapter 2 Limits and convergence. 2.1 Limit points of a set of real numbers 2.1.1 Limit points of a set. DEFINITION: A point x R is a limit point of a set E R if for all ε > 0 the set (x ε,x + ε) E is

### Notes: Chapter 2 Section 2.2: Proof by Induction

Notes: Chapter 2 Section 2.2: Proof by Induction Basic Induction. To prove: n, a W, n a, S n. (1) Prove the base case - S a. (2) Let k a and prove that S k S k+1 Example 1. n N, n i = n(n+1) 2. Example

### 0 <β 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(Ω),

### 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.,

### Mathematical 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.............................

### Sequences of Functions

Sequences of Functions Uniform convergence 9. Assume that f n f uniformly on S and that each f n is bounded on S. Prove that {f n } is uniformly bounded on S. Proof: Since f n f uniformly on S, then given

### Taylor Series and Asymptotic Expansions

Taylor Series and Asymptotic Epansions The importance of power series as a convenient representation, as an approimation tool, as a tool for solving differential equations and so on, is pretty obvious.

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

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

### Practice Problems Solutions

Practice Problems Solutions The problems below have been carefully selected to illustrate common situations and the techniques and tricks to deal with these. Try to master them all; it is well worth it!

### HOMEWORK 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

### k=1 k2, and therefore f(m + 1) = f(m) + (m + 1) 2 =

Math 104: Introduction to Analysis SOLUTIONS Alexander Givental HOMEWORK 1 1.1. Prove that 1 2 +2 2 + +n 2 = 1 n(n+1)(2n+1) for all n N. 6 Put f(n) = n(n + 1)(2n + 1)/6. Then f(1) = 1, i.e the theorem

### Chapter 6 SEQUENCES. sn 1+1,s 1 =1 is again an abbreviation for the sequence { 1, 1 2, 1 } n N ε,d (s n,s) <ε.

Chapter 6 SEQUENCES 6.1 Sequences A sequence is a function whose domain is the set of natural numbers N. If s is a sequence, we usually denote its value at n by s n instead of s (n). We may refer to the

### sin(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

ADVANCED CALCULUS Lecture notes for MA 440/540 & 441/541 2015/16 Rudi Weikard log x 1 1 2 3 4 5 x 1 2 Based on lecture notes by G. Stolz and G. Weinstein Version of September 3, 2016 1 Contents First things

### Analysis MA131. University of Warwick. Term

Analysis MA131 University of Warwick Term 1 01 13 September 8, 01 Contents 1 Inequalities 5 1.1 What are Inequalities?........................ 5 1. Using Graphs............................. 6 1.3 Case

### 1.3 Induction and Other Proof Techniques

4CHAPTER 1. INTRODUCTORY MATERIAL: SETS, FUNCTIONS AND MATHEMATICAL INDU 1.3 Induction and Other Proof Techniques The purpose of this section is to study the proof technique known as mathematical induction.

### Metric 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

### 2 1 2 s 3 = = s 4 = =

Infinite Series - EPM c CNMiKnO PG - The word series as used in mathematics is different from the way it is used in everyday speech. Webster s Third New International Dictionary includes the following

### 6.2 Permutations continued

6.2 Permutations continued Theorem A permutation on a finite set A is either a cycle or can be expressed as a product (composition of disjoint cycles. Proof is by (strong induction on the number, r, of

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

### Notes 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.

### 5. Convergence of sequences of random variables

5. Convergence of sequences of random variables Throughout this chapter we assume that {X, X 2,...} is a sequence of r.v. and X is a r.v., and all of them are defined on the same probability space (Ω,

### x 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

### I. 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

### No: 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

### Course 221: Analysis Academic year , First Semester

Course 221: Analysis Academic year 2007-08, First Semester David R. Wilkins Copyright c David R. Wilkins 1989 2007 Contents 1 Basic Theorems of Real Analysis 1 1.1 The Least Upper Bound Principle................

### 1. Please write your name in the blank above, and sign & date below. 2. Please use the space provided to write your solution.

Name : Instructor: Marius Ionescu Instructions: 1. Please write your name in the blank above, and sign & date below. 2. Please use the space provided to write your solution. 3. If you need extra pages

### k, then n = p2α 1 1 pα k

Powers of Integers An integer n is a perfect square if n = m for some integer m. Taking into account the prime factorization, if m = p α 1 1 pα k k, then n = pα 1 1 p α k k. That is, n is a perfect square

### Section 3 Sequences and Limits

Section 3 Sequences and Limits Definition A sequence of real numbers is an infinite ordered list a, a 2, a 3, a 4,... where, for each n N, a n is a real number. We call a n the n-th term of the sequence.

### 6. Metric spaces. In this section we review the basic facts about metric spaces. d : X X [0, )

6. Metric spaces In this section we review the basic facts about metric spaces. Definitions. A metric on a non-empty set X is a map with the following properties: d : X X [0, ) (i) If x, y X are points

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

### 4.3 Limit of a Sequence: Theorems

4.3. LIMIT OF A SEQUENCE: THEOREMS 5 4.3 Limit of a Sequence: Theorems These theorems fall in two categories. The first category deals with ways to combine sequences. Like numbers, sequences can be added,

### 1 Fixed Point Iteration and Contraction Mapping Theorem

1 Fixed Point Iteration and Contraction Mapping Theorem Notation: For two sets A,B we write A B iff x A = x B. So A A is true. Some people use the notation instead. 1.1 Introduction Consider a function

### Bipan Hazarika ON ACCELERATION CONVERGENCE OF MULTIPLE SEQUENCES. 1. Introduction

F A S C I C U L I M A T H E M A T I C I Nr 51 2013 Bipan Hazarika ON ACCELERATION CONVERGENCE OF MULTIPLE SEQUENCES Abstract. In this article the notion of acceleration convergence of double sequences

### v w is orthogonal to both v and w. the three vectors v, w and v w form a right-handed set of vectors.

3. Cross product Definition 3.1. Let v and w be two vectors in R 3. The cross product of v and w, denoted v w, is the vector defined as follows: the length of v w is the area of the parallelogram with

### MATH 289 PROBLEM SET 1: INDUCTION. 1. The induction Principle The following property of the natural numbers is intuitively clear:

MATH 89 PROBLEM SET : INDUCTION The induction Principle The following property of the natural numbers is intuitively clear: Axiom Every nonempty subset of the set of nonnegative integers Z 0 = {0,,, 3,

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

### Chapter 2 Limits Functions and Sequences sequence sequence Example

Chapter Limits In the net few chapters we shall investigate several concepts from calculus, all of which are based on the notion of a limit. In the normal sequence of mathematics courses that students

### INDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS

INDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS STEVEN P. LALLEY AND ANDREW NOBEL Abstract. It is shown that there are no consistent decision rules for the hypothesis testing problem

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

### Proof: A logical argument establishing the truth of the theorem given the truth of the axioms and any previously proven theorems.

Math 232 - Discrete Math 2.1 Direct Proofs and Counterexamples Notes Axiom: Proposition that is assumed to be true. Proof: A logical argument establishing the truth of the theorem given the truth of the

### NOTES ON MEASURE THEORY. M. Papadimitrakis Department of Mathematics University of Crete. Autumn of 2004

NOTES ON MEASURE THEORY M. Papadimitrakis Department of Mathematics University of Crete Autumn of 2004 2 Contents 1 σ-algebras 7 1.1 σ-algebras............................... 7 1.2 Generated σ-algebras.........................

### INTRODUCTION TO PROOFS: HOMEWORK SOLUTIONS

INTRODUCTION TO PROOFS: HOMEWORK SOLUTIONS STEVEN HEILMAN Contents 1. Homework 1 1 2. Homework 2 6 3. Homework 3 10 4. Homework 4 16 5. Homework 5 19 6. Homework 6 21 7. Homework 7 25 8. Homework 8 28

### BANACH 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

### 2 n = n=1 a n is convergent and we let. i=1

Lecture 4 : Series So far our definition of a sum of numbers applies only to adding a finite set of numbers. We can extend this to a definition of a sum of an infinite set of numbers in much the same way

### Mathematical Induction

Chapter 2 Mathematical Induction 2.1 First Examples Suppose we want to find a simple formula for the sum of the first n odd numbers: 1 + 3 + 5 +... + (2n 1) = n (2k 1). How might we proceed? The most natural

### This chapter describes set theory, a mathematical theory that underlies all of modern mathematics.

Appendix A Set Theory This chapter describes set theory, a mathematical theory that underlies all of modern mathematics. A.1 Basic Definitions Definition A.1.1. A set is an unordered collection of elements.

### MATH31011/MATH41011/MATH61011: FOURIER ANALYSIS AND LEBESGUE INTEGRATION. Chapter 4: Fourier Series and L 2 ([ π, π], µ) ( 1 π

MATH31011/MATH41011/MATH61011: FOURIER ANALYSIS AND LEBESGUE INTEGRATION Chapter 4: Fourier Series and L ([, π], µ) Square Integrable Functions Definition. Let f : [, π] R be measurable. We say that f

### Triangle deletion. Ernie Croot. February 3, 2010

Triangle deletion Ernie Croot February 3, 2010 1 Introduction The purpose of this note is to give an intuitive outline of the triangle deletion theorem of Ruzsa and Szemerédi, which says that if G = (V,

### THE 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,

### Vectors, Gradient, Divergence and Curl.

Vectors, Gradient, Divergence and Curl. 1 Introduction A vector is determined by its length and direction. They are usually denoted with letters with arrows on the top a or in bold letter a. We will use

### Chapter 5: Application: Fourier Series

321 28 9 Chapter 5: Application: Fourier Series For lack of time, this chapter is only an outline of some applications of Functional Analysis and some proofs are not complete. 5.1 Definition. If f L 1

### CARDINALITY, COUNTABLE AND UNCOUNTABLE SETS PART ONE

CARDINALITY, COUNTABLE AND UNCOUNTABLE SETS PART ONE With the notion of bijection at hand, it is easy to formalize the idea that two finite sets have the same number of elements: we just need to verify

### Math 421, Homework #5 Solutions

Math 421, Homework #5 Solutions (1) (8.3.6) Suppose that E R n and C is a subset of E. (a) Prove that if E is closed, then C is relatively closed in E if and only if C is a closed set (as defined in Definition

### CS 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

### Math212a1010 Lebesgue measure.

Math212a1010 Lebesgue measure. October 19, 2010 Today s lecture will be devoted to Lebesgue measure, a creation of Henri Lebesgue, in his thesis, one of the most famous theses in the history of mathematics.

### Matrix Norms. Tom Lyche. September 28, Centre of Mathematics for Applications, Department of Informatics, University of Oslo

Matrix Norms Tom Lyche Centre of Mathematics for Applications, Department of Informatics, University of Oslo September 28, 2009 Matrix Norms We consider matrix norms on (C m,n, C). All results holds for

### 1 Limiting distribution for a Markov chain

Copyright c 2009 by Karl Sigman Limiting distribution for a Markov chain In these Lecture Notes, we shall study the limiting behavior of Markov chains as time n In particular, under suitable easy-to-check

### Every Positive Integer is the Sum of Four Squares! (and other exciting problems)

Every Positive Integer is the Sum of Four Squares! (and other exciting problems) Sophex University of Texas at Austin October 18th, 00 Matilde N. Lalín 1. Lagrange s Theorem Theorem 1 Every positive integer

### p 2 1 (mod 6) Adding 2 to both sides gives p (mod 6)

.9. Problems P10 Try small prime numbers first. p p + 6 3 11 5 7 7 51 11 13 Among the primes in this table, only the prime 3 has the property that (p + ) is also a prime. We try to prove that no other

### SOLUTIONS 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

### Math 317 HW #7 Solutions

Math 17 HW #7 Solutions 1. Exercise..5. Decide which of the following sets are compact. For those that are not compact, show how Definition..1 breaks down. In other words, give an example of a sequence

### Section 6.1 - Inner Products and Norms

Section 6.1 - Inner Products and Norms Definition. Let V be a vector space over F {R, C}. An inner product on V is a function that assigns, to every ordered pair of vectors x and y in V, a scalar in F,

### Metric 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

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

### Our goal first will be to define a product measure on A 1 A 2.

1. Tensor product of measures and Fubini theorem. Let (A j, Ω j, µ j ), j = 1, 2, be two measure spaces. Recall that the new σ -algebra A 1 A 2 with the unit element is the σ -algebra generated by the

### Some 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,

### Course 421: Algebraic Topology Section 1: Topological Spaces

Course 421: Algebraic Topology Section 1: Topological Spaces David R. Wilkins Copyright c David R. Wilkins 1988 2008 Contents 1 Topological Spaces 1 1.1 Continuity and Topological Spaces...............

### God 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

The Hadamard Product Elizabeth Million April 12, 2007 1 Introduction and Basic Results As inexperienced mathematicians we may have once thought that the natural definition for matrix multiplication would

### 8.7 Mathematical Induction

8.7. MATHEMATICAL INDUCTION 8-135 8.7 Mathematical Induction Objective Prove a statement by mathematical induction Many mathematical facts are established by first observing a pattern, then making a conjecture

### Power Series. Chapter Introduction

Chapter 10 Power Series In discussing power series it is good to recall a nursery rhyme: There was a little girl Who had a little curl Right in the middle of her forehead When she was good She was very,

### A sequence of real numbers or a sequence in R is a mapping f : N R.

A sequence of real numbers or a sequence in R is a mapping f : N R. A sequence of real numbers or a sequence in R is a mapping f : N R. Notation: We write x n for f(n), n N and so the notation for a sequence

### PROPERTIES OF SOME NEW SEMINORMED SEQUENCE SPACES DEFINED BY A MODULUS FUNCTION

STUDIA UNIV. BABEŞ BOLYAI, MATHEMATICA, Volume L, Number 3, September 2005 PROPERTIES OF SOME NEW SEMINORMED SEQUENCE SPACES DEFINED BY A MODULUS FUNCTION YAVUZ ALTIN AYŞEGÜL GÖKHAN HIFSI ALTINOK Abstract.

### 1 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)

### 1. Let P be the space of all polynomials (of one real variable and with real coefficients) with the norm

Uppsala Universitet Matematiska Institutionen Andreas Strömbergsson Prov i matematik Funktionalanalys Kurs: F3B, F4Sy, NVP 005-06-15 Skrivtid: 9 14 Tillåtna hjälpmedel: Manuella skrivdon, Kreyszigs bok

### Ri and. i=1. S i N. and. R R i

The subset R of R n is a closed rectangle if there are n non-empty closed intervals {[a 1, b 1 ], [a 2, b 2 ],..., [a n, b n ]} so that R = [a 1, b 1 ] [a 2, b 2 ] [a n, b n ]. The subset R of R n is an

### 1. Periodic Fourier series. The Fourier expansion of a 2π-periodic function f is:

CONVERGENCE OF FOURIER SERIES 1. Periodic Fourier series. The Fourier expansion of a 2π-periodic function f is: with coefficients given by: a n = 1 π f(x) a 0 2 + a n cos(nx) + b n sin(nx), n 1 f(x) cos(nx)dx

### Inner Product Spaces

Math 571 Inner Product Spaces 1. Preliminaries An inner product space is a vector space V along with a function, called an inner product which associates each pair of vectors u, v with a scalar u, v, and

### Metric 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