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
|
|
- Vivien Hoover
- 7 years ago
- Views:
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
Undergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics
Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics An Introductory Single Variable Real Analysis: A Learning Approach through Problem Solving Marcel B. Finan c All Rights
More informationCONTINUED 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.
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 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 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 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 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 informationCHAPTER 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 information6.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
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 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 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 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 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 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 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 informationk, 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
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 informationBipan 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
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 informationINDISTINGUISHABILITY 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
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 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 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 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 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 informationEvery 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
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 informationv 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
More informationSection 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,
More information1. 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
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 informationInner 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
More informationTriangle 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,
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 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 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 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 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 informationSolution to Homework 2
Solution to Homework 2 Olena Bormashenko September 23, 2011 Section 1.4: 1(a)(b)(i)(k), 4, 5, 14; Section 1.5: 1(a)(b)(c)(d)(e)(n), 2(a)(c), 13, 16, 17, 18, 27 Section 1.4 1. Compute the following, if
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 informationLecture L3 - Vectors, Matrices and Coordinate Transformations
S. Widnall 16.07 Dynamics Fall 2009 Lecture notes based on J. Peraire Version 2.0 Lecture L3 - Vectors, Matrices and Coordinate Transformations By using vectors and defining appropriate operations between
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 informationA characterization of trace zero symmetric nonnegative 5x5 matrices
A characterization of trace zero symmetric nonnegative 5x5 matrices Oren Spector June 1, 009 Abstract The problem of determining necessary and sufficient conditions for a set of real numbers to be the
More informationParabolic Equations. Chapter 5. Contents. 5.1.2 Well-Posed Initial-Boundary Value Problem. 5.1.3 Time Irreversibility of the Heat Equation
7 5.1 Definitions Properties Chapter 5 Parabolic Equations Note that we require the solution u(, t bounded in R n for all t. In particular we assume that the boundedness of the smooth function u at infinity
More informationTiers, Preference Similarity, and the Limits on Stable Partners
Tiers, Preference Similarity, and the Limits on Stable Partners KANDORI, Michihiro, KOJIMA, Fuhito, and YASUDA, Yosuke February 7, 2010 Preliminary and incomplete. Do not circulate. Abstract We consider
More information9.2 Summation Notation
9. Summation Notation 66 9. Summation Notation In the previous section, we introduced sequences and now we shall present notation and theorems concerning the sum of terms of a sequence. We begin with a
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 informationP. Jeyanthi and N. Angel Benseera
Opuscula Math. 34, no. 1 (014), 115 1 http://dx.doi.org/10.7494/opmath.014.34.1.115 Opuscula Mathematica A TOTALLY MAGIC CORDIAL LABELING OF ONE-POINT UNION OF n COPIES OF A GRAPH P. Jeyanthi and N. Angel
More informationEXISTENCE AND NON-EXISTENCE RESULTS FOR A NONLINEAR HEAT EQUATION
Sixth Mississippi State Conference on Differential Equations and Computational Simulations, Electronic Journal of Differential Equations, Conference 5 (7), pp. 5 65. ISSN: 7-669. UL: http://ejde.math.txstate.edu
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 informationON NONNEGATIVE SOLUTIONS OF NONLINEAR TWO-POINT BOUNDARY VALUE PROBLEMS FOR TWO-DIMENSIONAL DIFFERENTIAL SYSTEMS WITH ADVANCED ARGUMENTS
ON NONNEGATIVE SOLUTIONS OF NONLINEAR TWO-POINT BOUNDARY VALUE PROBLEMS FOR TWO-DIMENSIONAL DIFFERENTIAL SYSTEMS WITH ADVANCED ARGUMENTS I. KIGURADZE AND N. PARTSVANIA A. Razmadze Mathematical Institute
More informationSECTION 10-2 Mathematical Induction
73 0 Sequences and Series 6. Approximate e 0. using the first five terms of the series. Compare this approximation with your calculator evaluation of e 0.. 6. Approximate e 0.5 using the first five terms
More informationMathematical Induction. Lecture 10-11
Mathematical Induction Lecture 10-11 Menu Mathematical Induction Strong Induction Recursive Definitions Structural Induction Climbing an Infinite Ladder Suppose we have an infinite ladder: 1. We can reach
More informationUnified Lecture # 4 Vectors
Fall 2005 Unified Lecture # 4 Vectors These notes were written by J. Peraire as a review of vectors for Dynamics 16.07. They have been adapted for Unified Engineering by R. Radovitzky. References [1] Feynmann,
More informationMath 319 Problem Set #3 Solution 21 February 2002
Math 319 Problem Set #3 Solution 21 February 2002 1. ( 2.1, problem 15) Find integers a 1, a 2, a 3, a 4, a 5 such that every integer x satisfies at least one of the congruences x a 1 (mod 2), x a 2 (mod
More informationLecture Notes on Measure Theory and Functional Analysis
Lecture Notes on Measure Theory and Functional Analysis P. Cannarsa & T. D Aprile Dipartimento di Matematica Università di Roma Tor Vergata cannarsa@mat.uniroma2.it daprile@mat.uniroma2.it aa 2006/07 Contents
More informationLecture 13: Martingales
Lecture 13: Martingales 1. Definition of a Martingale 1.1 Filtrations 1.2 Definition of a martingale and its basic properties 1.3 Sums of independent random variables and related models 1.4 Products of
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 informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS 1. SYSTEMS OF EQUATIONS AND MATRICES 1.1. Representation of a linear system. The general system of m equations in n unknowns can be written a 11 x 1 + a 12 x 2 +
More informationSection 4.2: The Division Algorithm and Greatest Common Divisors
Section 4.2: The Division Algorithm and Greatest Common Divisors The Division Algorithm The Division Algorithm is merely long division restated as an equation. For example, the division 29 r. 20 32 948
More informationLecture 1: Schur s Unitary Triangularization Theorem
Lecture 1: Schur s Unitary Triangularization Theorem This lecture introduces the notion of unitary equivalence and presents Schur s theorem and some of its consequences It roughly corresponds to Sections
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 informationIntroduction. Appendix D Mathematical Induction D1
Appendix D Mathematical Induction D D Mathematical Induction Use mathematical induction to prove a formula. Find a sum of powers of integers. Find a formula for a finite sum. Use finite differences to
More informationSeparation Properties for Locally Convex Cones
Journal of Convex Analysis Volume 9 (2002), No. 1, 301 307 Separation Properties for Locally Convex Cones Walter Roth Department of Mathematics, Universiti Brunei Darussalam, Gadong BE1410, Brunei Darussalam
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 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 informationThe Heat Equation. Lectures INF2320 p. 1/88
The Heat Equation Lectures INF232 p. 1/88 Lectures INF232 p. 2/88 The Heat Equation We study the heat equation: u t = u xx for x (,1), t >, (1) u(,t) = u(1,t) = for t >, (2) u(x,) = f(x) for x (,1), (3)
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 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 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 informationPOLYNOMIAL RINGS AND UNIQUE FACTORIZATION DOMAINS
POLYNOMIAL RINGS AND UNIQUE FACTORIZATION DOMAINS RUSS WOODROOFE 1. Unique Factorization Domains Throughout the following, we think of R as sitting inside R[x] as the constant polynomials (of degree 0).
More informationMEASURE AND INTEGRATION. Dietmar A. Salamon ETH Zürich
MEASURE AND INTEGRATION Dietmar A. Salamon ETH Zürich 12 May 2016 ii Preface This book is based on notes for the lecture course Measure and Integration held at ETH Zürich in the spring semester 2014. Prerequisites
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 information5.3 Improper Integrals Involving Rational and Exponential Functions
Section 5.3 Improper Integrals Involving Rational and Exponential Functions 99.. 3. 4. dθ +a cos θ =, < a
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 informationSection 4.4 Inner Product Spaces
Section 4.4 Inner Product Spaces In our discussion of vector spaces the specific nature of F as a field, other than the fact that it is a field, has played virtually no role. In this section we no longer
More informationT ( a i x i ) = a i T (x i ).
Chapter 2 Defn 1. (p. 65) Let V and W be vector spaces (over F ). We call a function T : V W a linear transformation form V to W if, for all x, y V and c F, we have (a) T (x + y) = T (x) + T (y) and (b)
More informationChapter 17. Orthogonal Matrices and Symmetries of Space
Chapter 17. Orthogonal Matrices and Symmetries of Space Take a random matrix, say 1 3 A = 4 5 6, 7 8 9 and compare the lengths of e 1 and Ae 1. The vector e 1 has length 1, while Ae 1 = (1, 4, 7) has length
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 informationMathematics Course 111: Algebra I Part IV: Vector Spaces
Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are
More informationNote on some explicit formulae for twin prime counting function
Notes on Number Theory and Discrete Mathematics Vol. 9, 03, No., 43 48 Note on some explicit formulae for twin prime counting function Mladen Vassilev-Missana 5 V. Hugo Str., 4 Sofia, Bulgaria e-mail:
More informationNonlinear Algebraic Equations. Lectures INF2320 p. 1/88
Nonlinear Algebraic Equations Lectures INF2320 p. 1/88 Lectures INF2320 p. 2/88 Nonlinear algebraic equations When solving the system u (t) = g(u), u(0) = u 0, (1) with an implicit Euler scheme we have
More informationSCORE SETS IN ORIENTED GRAPHS
Applicable Analysis and Discrete Mathematics, 2 (2008), 107 113. Available electronically at http://pefmath.etf.bg.ac.yu SCORE SETS IN ORIENTED GRAPHS S. Pirzada, T. A. Naikoo The score of a vertex v in
More informationA Uniform Asymptotic Estimate for Discounted Aggregate Claims with Subexponential Tails
12th International Congress on Insurance: Mathematics and Economics July 16-18, 2008 A Uniform Asymptotic Estimate for Discounted Aggregate Claims with Subexponential Tails XUEMIAO HAO (Based on a joint
More informationarxiv:0909.4913v2 [math.ho] 4 Nov 2009
IRRATIONALITY FROM THE BOOK STEVEN J. MILLER AND DAVID MONTAGUE arxiv:0909.4913v2 [math.ho] 4 Nov 2009 A right of passage to theoretical mathematics is often a proof of the irrationality of 2, or at least
More informationLecture 3: Finding integer solutions to systems of linear equations
Lecture 3: Finding integer solutions to systems of linear equations Algorithmic Number Theory (Fall 2014) Rutgers University Swastik Kopparty Scribe: Abhishek Bhrushundi 1 Overview The goal of this lecture
More informationGröbner Bases and their Applications
Gröbner Bases and their Applications Kaitlyn Moran July 30, 2008 1 Introduction We know from the Hilbert Basis Theorem that any ideal in a polynomial ring over a field is finitely generated [3]. However,
More information10.2 Series and Convergence
10.2 Series and Convergence Write sums using sigma notation Find the partial sums of series and determine convergence or divergence of infinite series Find the N th partial sums of geometric series and
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 informationMath 115 Spring 2011 Written Homework 5 Solutions
. Evaluate each series. a) 4 7 0... 55 Math 5 Spring 0 Written Homework 5 Solutions Solution: We note that the associated sequence, 4, 7, 0,..., 55 appears to be an arithmetic sequence. If the sequence
More informationIRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL. 1. Introduction
IRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL R. DRNOVŠEK, T. KOŠIR Dedicated to Prof. Heydar Radjavi on the occasion of his seventieth birthday. Abstract. Let S be an irreducible
More informationTHE NUMBER OF GRAPHS AND A RANDOM GRAPH WITH A GIVEN DEGREE SEQUENCE. Alexander Barvinok
THE NUMBER OF GRAPHS AND A RANDOM GRAPH WITH A GIVEN DEGREE SEQUENCE Alexer Barvinok Papers are available at http://www.math.lsa.umich.edu/ barvinok/papers.html This is a joint work with J.A. Hartigan
More informationLemma 5.2. Let S be a set. (1) Let f and g be two permutations of S. Then the composition of f and g is a permutation of S.
Definition 51 Let S be a set bijection f : S S 5 Permutation groups A permutation of S is simply a Lemma 52 Let S be a set (1) Let f and g be two permutations of S Then the composition of f and g is a
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 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 informationSystems of Linear Equations
Systems of Linear Equations Beifang Chen Systems of linear equations Linear systems A linear equation in variables x, x,, x n is an equation of the form a x + a x + + a n x n = b, where a, a,, a n and
More informationHomework until Test #2
MATH31: Number Theory Homework until Test # Philipp BRAUN Section 3.1 page 43, 1. It has been conjectured that there are infinitely many primes of the form n. Exhibit five such primes. Solution. Five such
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 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 information