Sequences and series

Size: px
Start display at page:

Download "Sequences and series"

Transcription

1 Sequences and series Jean-Marie Dufour McGill University First version: March 1992 Revised: January 2002, October 2016 This version: October 2016 Compiled: January 10, 2017, 15:36 This work was supported by the William Dow Chair in Political Economy (McGill University), the Bank of Canada (Research Fellowship), the Toulouse School of Economics (Pierre-de-Fermat Chair of excellence), the Universitad Carlos III de Madrid (Banco Santander de Madrid Chair of excellence), a Guggenheim Fellowship, a Konrad-Adenauer Fellowship (Alexander-von-Humboldt Foundation, Germany), the Canadian Network of Centres of Excellence [program on Mathematics of Information Technology and Complex Systems (MITACS)], the Natural Sciences and Engineering Research Council of Canada, the Social Sciences and Humanities Research Council of Canada, and the Fonds de recherche sur la société et la culture (Québec). William Dow Professor of Economics, McGill University, Centre interuniversitaire de recherche en analyse des organisations (CIRANO), and Centre interuniversitaire de recherche en économie quantitative (CIREQ). Mailing address: Department of Economics, McGill University, Leacock Building, Room 414, 855 Sherbrooke Street West, Montréal, Québec H3A 2T7, Canada. TEL: (1) ext ; FAX: (1) ; jean-marie.dufour@ mcgill.ca. Web page:

2 Contents List of Definitions, Assumptions, Propositions and Theorems iii 1. Definitions and notation 1 2. Convergence of sequences 4 3. Convergence of series 6 4. Convergence of transformed series Uniform convergence Proofs and references 15 i

3 List of Tables List of Figures List of Definitions, Assumptions, Propositions and Theorems 1.3 Definition : Bounded set in R Definition : Supremum and infimum Definition : Bounded set in C Definition : Sequence Definition : Subsequence Definition : Limit of a complex sequence Definition : Convergence in a set Definition : Convergence in the sense of Cauchy Definition : Infinite limits Definition : Monotonic sequence Definition : Upper and lower limits Definition : Accumulation point Definition : Partial sum and series Definition : Absolute and conditional convergence Definition : Two-sided sequence Definition : Double sequence Definition : Limit of a complex double sequence Theorem : Convergence criterion for complex sequences Theorem : Properties of convergent sequences Theorem : Convergence of transformed sequences Theorem : Convergence of Cauchy sequences Theorem : Convergence of real sequences Theorem : Limits of important special sequences Theorem : Cauchy criterion for convergence of a series Proposition : Alternative forms of the Cauchy criterion for series Theorem : Necessary conditions for convergence of a series Corollary : Divergence criterion for a series Theorem : Characterization of absolute convergence Theorem : Criterion for absolute convergence of a series Corollary : Divergence criterion for a series Theorem : Comparison criterion for convergence of a series Theorem : Convergence of a series of nonnegative numbers Proposition : Convergence of special series Theorem : Root convergence criterion (Cauchy) Theorem : Ratio convergence criterion (d Alembert) ii

4 3.14 Theorem : Relation between the root and ratio convergence tests Theorem : Cauchy criterion for convergence of a series Theorem : Gauss criterion for convergence of a series Theorem : Integral criterion for convergence of a series Theorem : Dirichlet criterion for convergence of a series of products Corollary : Alternating series convergence criterion (Leibniz) Theorem : Abel criterion for convergence of a series of products Theorem : Abel-Dini criterion for convergence of a series of ratios Theorem : Landau criterion for convergence of a series of products Theorem : Convergence of an arithmetically weighted mean Theorem : Cesaro convergence Theorem : Convergence of linearly transformed series Definition : Convolution Theorem : Sufficient condition for convergence of the product of two series (Cauchy- Mertens) Theorem : Limit of the product of two series (Abel) Theorem : Necessary and sufficient condition for convergence of the product of two series Theorem : Aggregation of terms in a series Definition : Rearrangement Definition : Commutatively convergent series Theorem : Rearrangement of an absolutely convergent series (Dirichlet) Theorem : Rearrangement of a conditionnally convergent series (Riemann) Theorem : Equivalence between absolute and commutative convergence Theorem : Condition for double series commutativity Definition : Uniform convergence Theorem : Cauchy criterion for uniform convergence Theorem : Supremum criterion for uniform convergence Theorem : Weierstrass uniform convergence criterion Theorem : Uniform convergence and continuity Theorem : Conditions of uniform convergence (Dini) Theorem : Uniform convergence and differentiation of functions of real variables Theorem : Uniform convergence and differentiation of functions of complex variables 14 iii

5 1. DEFINITIONS AND NOTATION 1 1. Definitions and notation 1.1 Notation We shall use the following notation: (1) iff : if and only if; (2) : if and only if; (3) : infinity ; (4) A c : complement of the set A; (5) : implies ; (6) : is distributed like; (7) : equal by definition; (8) C : set of complex numbers; (9) R : real numbers; (10) Z : integers; (11) N 0 = {0, 1, 2,...} : nonnegative integers; (12) N = {1, 2, 3,...} : positive integers; (13) R : extended real numbers : R = R {+} { }. 1.2 Notation 1.3 Definition BOUNDED SET IN R. Let E R. If there is an element y R such that x y, x R, we say that E has an upper bound (or is bounded from above). If there is an element z R such that x z, x E, we say that E has a lower bound (or is bounded from below). If E has both upper and lower bounds, we say that E is bounded. 1.4 Definition SUPREMUM AND INFIMUM. Let E R. sup(e) is the smallest element of R such that x sup(e), x E; inf(e) is the largest element of R such that inf(e) x, x E. 1.5 Definition BOUNDED SET IN C. Let E C. If there is a real number M and a complex number z 0 such that z z 0 < M for all z E, we say the set E is bounded. 1.6 Definition SEQUENCE. Let E be a set. A sequence in E is function f(n) = a n which associates to each element n N an element a n E. The sequence is usually denoted by the ordered set of the values of f(n): {a 1,a 2,...} {a n } n=1 {a n}

6 1. DEFINITIONS AND NOTATION 2 or (a 1,a 2,...) (a n ) n=1 (a n). If E = C, the sequence is complex. If E = R, the sequence is real. To indicate that all the elements of the sequence {a n } are in E, we write {a n } E. 1.7 Remark Let m Z and I m = {n Z : n m}. A function f (n) = b n which maps every element n I m to an element a n E can be viewed as a sequence in E on defining a n = b m+n 1, n = 1,2,... Such a sequence is usually denoted {b m,b m+1,...} {b n } n=m. Similarly, if I m = {n Z : n m}, we can define a n = b m n+1, n = 1,2,.... In this case, the sequence can be denoted as {...,b m 1,b m } {b n } m n=. 1.8 Definition SUBSEQUENCE. Let E be a set, {a n } n=1 E, and {n k} k=1 a sequence of positive integers such that n 1 < n 2 <. The sequence {a nk } k=1 is a subsequence of {a n} n= Definition LIMIT OF A COMPLEX SEQUENCE. Let a C and {a n } C. The sequence {a n } converges to a iff for any real number ε > 0, there is an integer N such that n N implies a n a < ε. In this case, we write a n a, or lim a n = a, and a is called the limit of {a n }. If there is a number a C such that a n a, we say that the sequence {a n } converges (or converges in C). If the sequence does not converge, we say it diverges Remark When there is no ambiguity, we can also write lim a n instead of lim a n Definition CONVERGENCE IN A SET. Let E C and {a n } E. If there exists an element a E such that a n a, we say that {a n } converges in E Definition CONVERGENCE IN THE SENSE OF CAUCHY. Let {a n } C. The sequence {a n } converges in the Cauchy sense iff for any ε > 0, there exists an integer N such that m N and n N imply a m a n < ε. A sequence which converges in the Cauchy sense is called a Cauchy sequence Definition INFINITE LIMITS. Let {a n } R. We say that the sequence {a n } diverges to iff for any real number M there exists an integer N such that n N implies a n M. In this case, we write a n or lim a n =. Similarly, we say the sequence {a n } diverges to iff for any real number M there is an integer N such that n N implies a n M. In this case, we write a n or lim a n =.

7 1. DEFINITIONS AND NOTATION 3 We also wrote + instead of Definition MONOTONIC SEQUENCE. Let {a n } R. If a n a n+1, for all n N, we say that the sequence {a n } is monotonically increasing (or monotonic increasing). If a n a n+1 for all n N, we say the sequence {a n } is monotonically decreasing (monotonic decreasing). If {a n } is monotonically increasing and a n a, we write a n a. If {a n } is monotonically decreasing and a n a, we write a n a Definition UPPER AND LOWER LIMITS. Let {a n } R. The upper limit of the sequence {a n } is defined by { } lim sup a n = inf sup a n inf{sup{a n : n N} : N 1}. N 1 n N The lower limit of the sequence {a n }is defined by { } lim inf a n = sup inf a n sup{inf{a n : n N} : N 1}. N 1 n N We also write lim instead of limsup, and lim instead of liminf Remark The upper and lower limits of the sequence {a n } R always exist in R Definition ACCUMULATION POINT. Let {a n } C and a C. a is an accumulation point of {a n } iff for any real number ε > 0, the inequality a n a < ε is satisfied for an infinity of elements of the sequence {a n } Definition PARTIAL SUM AND SERIES. Let {a n } C and S N = N n=1 a n. We call {S N } N=1 the sequence of partial sums associated with {a n }. The symbol n=1 a n represents the series associated with {a n }. If lim N S N = S where S C, we say the series n=1 a n converges (or converges to S) and we write a n = S. n=1 If the series n=1 a n does not converge, we say it diverges Remark If we consider a sequence of the form {a n } n=m where m Z, we say that the series n=m a n converges to S if lim N S N = S, where S N = N+(m 1) n=m a n. Similarly, for a sequence of the form {a n } m n=, where m Z, we say that the series m n= a n converges to S if lim N S N = S, where S N = m+1 N n=m a n Definition ABSOLUTE AND CONDITIONAL CONVERGENCE. Let {a n } C. If the series n=1 a n converges, we say that the series n=1 a n converges absolutely. If n=1 a n converges, but n=1 a n does not converge, we say that n=1 a n converges conditionally.

8 2. CONVERGENCE OF SEQUENCES Definition TWO-SIDED SEQUENCE. Let {a n } n=0 and {a n} 1 n= be two sequences of complex numbers. If the series n=0 a n converges to S 1 C and if the series 1 n= a n converges to S 2 C, we say that the two-sided series n= a n converges to S 1 + S Definition DOUBLE SEQUENCE. A double sequence in E is a function f (m, n) = a mn which maps each pair (m,n) N 2 to an element a mn E. We usually denote the double sequence by {a mn } m,n=1 {a mn }. To indicate that all the elements of the double sequence {a mn } are in E, we write {a mn } E Definition LIMIT OF A COMPLEX DOUBLE SEQUENCE. Let a C and {a mn } C. The double sequence {a mn } converges to a when m, n iff for any real number ε > 0, there is an integer N such that m, n N implies a mn a < ε. In this case, we write a mn a, or m, and a is called the limit of {a mn } when m, n. lim a mn = a, m, 1.24 Remark For double sequences, we can consider several different limits: lim m a mn, lim a mn, lim m [lim a mn ], lim [lim m a mn ]. In general, these limits are not equal. Even if lim m a mn b n, lim a mn = c m exist, we can have [ ] [ ] lim lim a mn lim b n lim c m lim lim a mn. m m m 2. Convergence of sequences 2.1 Theorem CONVERGENCE CRITERION FOR COMPLEX SEQUENCES. Let {c n } C, where c n = a n + i b n, a n R, b n R, for all n, and i = 1. Then the sequence {c n } converges iff each one of the sequences {a n } and {b n } converges. Furthermore, if {c n } converges, we have: lim c n = ( lim a n ) + i ( lim b n 2.2 Theorem PROPERTIES OF CONVERGENT SEQUENCES. Let {a n } C, a C and a C. (a) Limit unicity. If a n a and a n a, then a = a. (b) Boundedness of convergent sequences. If the sequence {a n } converges, then the set {a 1, a 2,...} is bounded. ).

9 2. CONVERGENCE OF SEQUENCES 5 (c) Convergence of bounded sequences (Bolzano-Weierstrass). If the sequence {a n } is bounded, then {a n } contains a convergent subsequence {a nk }. In other words, a bounded sequence {a n } has at least one accumulation point. (d) Convergence of subsequences. {a n } converges to a each subsequence {a nk } of {a n } converges to a each subsequence {a nk } of {a n } contains another subsequence {a mk } which converges to a. (e) Accumulation and convergence. If the sequence {a n } is bounded and has exactly one accumulation point a, then a n a. If the sequence {a n } has no finite accumulation point or has several, then it diverges. 2.3 Theorem CONVERGENCE OF TRANSFORMED SEQUENCES. Let {a n } C and {b n } C two sequences such that lim a n = a, lim b n = b where a, b C. Then (a) lim (a n + b n ) = a+b ; (b) lim (c a n ) = c a, lim (a n + c) = a+c, c C ; (c) lim (a n b n ) = a b; (d) lim(a n /b n ) = a/b, provided b 0 ; (e) lim g(a n ) = g(a) for any function g : C C continuous at x = a. 2.4 Theorem CONVERGENCE OF CAUCHY SEQUENCES. Let {a n } C. (a) If the sequence {a n } converges, then {a n } converges in the Cauchy sense. (b) Completeness. If the sequence {a n } converges in the Cauchy sense, then the sequence {a n } converges. 2.5 Theorem CONVERGENCE OF REAL SEQUENCES. Let {a n } R, {b n } R, a R and b R. (a) liminf a n limsup a n. (b) lim a n = a liminf (c) If a n b n for n N, then a n = limsup a n = a. lim inf n liminf n, lim sup a n limsup b n.

10 3. CONVERGENCE OF SERIES 6 (d) If a n b n for n N and if {a n } and {b n } are convergent sequences, then lim a n lim b n. (e) If the sequence {a n } is monotonically increasing, then {a n } converges in R or lim a n =. ( f) If the sequence {a n } is monotonically decreasing, then {a n } converges in R or lim a n =. (g) If the sequence {a n } is monotonic (increasing or decreasing) and bounded, then {a n } converges in R. 2.6 Theorem LIMITS OF IMPORTANT SPECIAL SEQUENCES. Let p and α be real numbers and x a complex number. 1 (a) If p > 0, lim n = 0. p (b) If p > 0, lim p 1/n = 1. (c) lim n 1/n = 1. (d) If p > 0, lim (1+p) n = 0. n α (e) If x < 1, lim x n = 0. ( f) If b > 0 and b 1, lim [log b (n)/n] = Convergence of series 3.1 Theorem CAUCHY CRITERION FOR CONVERGENCE OF A SERIES. Let {a n } C. The series n=1 a n converges iff, for any ε > 0, there is an integer N such that n m N implies n k=m a k < ε. 3.2 Proposition ALTERNATIVE FORMS OF THE CAUCHY CRITERION FOR SERIES. Let {a n } C. The series n=1 a n converges for any ε > 0, there is an integer N such that n N implies < ε for any p 1 for any ε > 0, there is an integer N such that n N implies sup n+p k=n+1 a n n+p k=n+1 a n p 1 < ε

11 3. CONVERGENCE OF SERIES 7 lim [ sup n+p k=n+1 a n p 1 ] = Theorem NECESSARY CONDITIONS FOR CONVERGENCE OF A SERIES. Let {a n } C. (a) If the series n=1 a n converges, then lim a n = 0. (b) If the series n=1 a n converges and if a n+1 a n for n N, then lim (na n ) = Corollary DIVERGENCE CRITERION FOR A SERIES. Let {a n } C and c > 0. If a n c for an infinite number values of n, then the series n=1 a n diverges. 3.5 Theorem CHARACTERIZATION OF ABSOLUTE CONVERGENCE. Let {a n } C. The series n=1 a n does not converge absolutely n=1 a n diverges n=1 a n =. 3.6 Remark To indicate that the series n=1 a n converges absolutely, we can write n=1 a n <. 3.7 Theorem CRITERION FOR ABSOLUTE CONVERGENCE OF A SERIES. Let {a n } C. If the series n=1 a n converges absolutely, then n=1 a n converges. 3.8 Corollary DIVERGENCE CRITERION FOR A SERIES. Let {a n } C. If the series n=1 a n diverges, then n=1 a n =. 3.9 Theorem COMPARISON CRITERION FOR CONVERGENCE OF A SERIES. Let {a n } C, {c n } R and {d n } R. (a) If a n c n for n n 0, where n 0 is a given integer, and if the series n=1 c n converges, then the series n=1 a n converges absolutely. (b) If a n d n 0 for n n 0, where n 0 is a given integer, and if n=1 d n diverges, then n=1 a n = but n=1 a n can converge or diverge Theorem CONVERGENCE OF A SERIES OF NONNEGATIVE NUMBERS. Let {a n } R where a n 0 for all n. (a) The series n=1 a n converges iff the sequence of partial sums { N n=1 a n} N=1 is bounded. (b) Cauchy s condensation criterion. If the sequence {a n } is monotonically decreasing (a 1 a 2 a 3...), the series n=1 a n converges iff the series converges. 2 k a 2 k = a 1 + 2a 2 + 4a a (3.1) k=0

12 3. CONVERGENCE OF SERIES Proposition CONVERGENCE OF SPECIAL SERIES. Let x a complex number and p a real number. (a) Geometric series. If x < 1, x n = 1 n=0 1 x where If x 1, the series n=0 xn diverges. (b) The series n=1 1/np converges if p > 1 and diverges if p 1. (c) The series 1 n=2 p converges if p > 1 and diverges if p 1. n(logn) (d) e = n=0 1 n! = lim ( 1+ 1 n. n) 3.12 Theorem ROOT CONVERGENCE CRITERION (CAUCHY). Let {a n } C and α = lim sup a n 1/n. (a) If α < 1, the series n=1 a n converges absolutely. (b) If α > 1, n=1 a n diverges. (c) If a n 1/n δ < 1 for n n 0, where n 0 is a given integer, the series n=1 a n converges absolutely. (d) If a n 1/n 1 for an infinite number of values of n, n=1 a n diverges. (e) If none of the preceding conditions holds, we can find cases where n=1 a n converges and cases where n=1 a n diverges Theorem RATIO CONVERGENCE CRITERION (D ALEMBERT). Let {a n } C and 0/0 0. (a) If limsup a n+1 a n < 1, the series n=1 a n converges absolutely. (b) If ε < 1 for n n0, where n 0 is a given integer, the series n=1 a n converges absolutely. (c) If a n+1 a n a n+1 a n (d) If liminf (e) If liminf 1 for n n0, where n 0 is a given integer, the series n=1 a n diverges. a n+1 a n a n+1 a n > 1, the series n=1 a n diverges. 1 limsup a n+1 a n, the series n=1 a n can converge or diverge.

13 3. CONVERGENCE OF SERIES Theorem RELATION BETWEEN THE ROOT AND RATIO CONVERGENCE TESTS. Let {a n } C a sequence such that a n 0 for n n 0, where n 0 is a given integer. Then lim inf a n+1 a n liminf a n 1/n limsup a n 1/n limsup a n+1 a n. If we define 0/0 0 and x/0 = for x 0, the above inequalities hold for any sequence {a n } C Theorem CAUCHY CRITERION FOR CONVERGENCE OF A SERIES. Let {a n } C and ( ) ( ) L = liminf n 1 a n+1 a n, U = limsup n 1 a n+1 a n where L, U R. (a) If L > 1, the series n=1 a n converges absolutely. (b) If U < 1, n=1 a n = but the series n=1 a n can converge or diverge. (c) If L = U = 1, the series n=1 a n can converge or diverge, and similarly for n=1 a n Theorem GAUSS CRITERION FOR CONVERGENCE OF A SERIES. Let {a n } C, {c n } R and suppose that a n+1 a n = 1 L n + c n n p where p > 1 and c n M <, n. (a) If L > 1, the series n=1 a n converges absolutely. (b) If L 1, n=1 a n = but n=1 a n can converge or diverge Theorem INTEGRAL CRITERION FOR CONVERGENCE OF A SERIES. Let f(x), x R, a real-valued continuous function, non-negative and non decreasing for x A, and let {a n } C a sequence such that a n = f(n) for n A. Then (a) A f(x)dx < n=1 a n converges absolutely; (b) A f(x)dx = n=1 a n = Theorem DIRICHLET CRITERION FOR CONVERGENCE OF A SERIES OF PRODUCTS. Let {a n } C and {b n } R two sequences such that (a) N n=1 a n M, for all N 1, where M 0, (b) b n+1 b n, n, (c) lim b n = 0.

14 3. CONVERGENCE OF SERIES 10 Then the series n=1 a nb n converges Corollary ALTERNATING SERIES CONVERGENCE CRITERION (LEIBNIZ). Let {a n } R a sequence such that (a) a n+1 a n, n, (b) a n = ( 1) n+1 a n, n, (c) lim a n = 0. Then the series n=1 a n converges and n=1 a n a Theorem ABEL CRITERION FOR CONVERGENCE OF A SERIES OF PRODUCTS. Let {a n } C and {b n } R be two sequences such that (a) n=1 a n converges, (b) b n is a monotonic bounded sequence. Then the series n=1 a nb n converges Remark In contrast with most criteria described above, the Abel and Dirichlet criteria do not entail absolute convergence Theorem ABEL-DINI CRITERION FOR CONVERGENCE OF A SERIES OF RATIOS. If the series n=1 a n diverges such that S N = N n=1 a n > 0, N, and S N N, then (a) the series n=1 a n/s δ n diverges for any δ 1, (b) the series n=1 a n/s δ n converges for any δ > Theorem LANDAU CRITERION FOR CONVERGENCE OF A SERIES OF PRODUCTS. Let {a n } R. The series n=1 a n p, where p > 1, converges the series n=1 a nb n converges for all sequences {b n } C such that n=1 b n q converges, where q = p/(p 1) Remark The Landau theorem implies: if n=1 a n p < and n=1 b n q <, where p > 1 and q = p/(p 1), then the series n=1 a nb n and n=1 a nb n convergent. Further, it gives a necessary condition for the convergence of n=1 a n p when p > Theorem CONVERGENCE OF AN ARITHMETICALLY WEIGHTED MEAN. Let {a n } C. If the series n=1 a n converges, then lim N N n=1 (1 n N )a n = a n n=1 and N lim N n=1 n N a 1 n = lim N N N n a n = 0. n=1

15 4. CONVERGENCE OF TRANSFORMED SERIES Theorem CESARO CONVERGENCE. Let {a n } C a sequence such that a n a C. Then N 1 lim N N a n = a. n=1 4. Convergence of transformed series 4.1 Theorem CONVERGENCE OF LINEARLY TRANSFORMED SERIES. Let {a n } n=0 C and {b n } n=0 C be two sequences such that a n = A and n=0 n=0 b n = B where A, B C. Then the sequences n=0 (a n + b n ) and n=0 ca n converge for any c C, and n=0 (a n + b n ) = A+B, ca n = c. n=0 4.2 Definition CONVOLUTION. Let {a n } n=0 C and {b n} n=0 C. We call the sequence c n = n k=0 a k b n k,n = 0,1,2,... the convolution of the sequences {a n } n=0 and {b n} n=0. Further, the series n=0 c n is called the product of the series n=0 a n and n=0 b n. 4.3 Remark We denote the convolution of the sequences a n and b n by a n b n : a n b n = n k=0 a k b n k. 4.4 Theorem SUFFICIENT CONDITION FOR CONVERGENCE OF THE PRODUCT OF TWO SERIES (CAUCHY-MERTENS).. Let {a n } n=0 C and {b n} n=0 C be two sequences such that (a) n=0 a n = A and n=0 b n = B, where A, B C, and (b) n=0 a n converges absolutely. Then the series n=0 c n, where c n = n k=0 a kb n k, converges and c n = AB. n=0 (Mertens) If, furthermore, n=0 b n converges absolutely, the series n=0 c n converges absolutely.

16 4. CONVERGENCE OF TRANSFORMED SERIES Theorem LIMIT OF THE PRODUCT OF TWO SERIES (ABEL). If {a n } n=0 C, {b n} n=0 C and {c n } n=0 C are three sequences such that the series n=0 a n, n=0 b n and n=0 c n converge to A, B and C respectively, and if then c n = n k=0 a k b n k, C = AB. 4.6 Theorem NECESSARY AND SUFFICIENT CONDITION FOR CONVERGENCE OF THE PRODUCT OF TWO SERIES. Let {a n } R. The series n=0 c n, where c n = k=0 a kb n k, converges for all sequences {b n } R such that n=0 b n converges n=0 a n <. 4.7 Theorem AGGREGATION OF TERMS IN A SERIES. Let {a n } n=0 C be a sequence such that n=0 a n = A C, {r n } n=0 N 0 a monotonically increasing sequence of nonnegative integers such that r 0 = 0 and r n, and {b n } n=1 the sequence defined by r n 1 b n = a k,n = 1,2,.... k=r n 1 Then the series n=1 b n converges and b n = A. n=1 4.8 Definition REARRANGEMENT. Let {k n } n=0 be a sequence of nonnegative integers such that each nonnegative integer appears once and only once in the sequence. If a n = a kn, n = 0,1,2,..., we call the series n=0 a n a rearrangement of the series n=0 a n. 4.9 Definition COMMUTATIVELY CONVERGENT SERIES. Let {a n } n=0 C be a sequence such that n=0 a n converges to A C. The series n=0 a n is commutatively convergent if all the rearrangements n=0 a n of the series n=0 a n converge to A Theorem REARRANGEMENT OF AN ABSOLUTELY CONVERGENT SERIES (DIRICHLET). Let {a n } n=0 be a sequence such that n=0 a n converges absolutely to A C. Then all the rearrangements of the series n=0 a n converge to A Theorem REARRANGEMENT OF A CONDITIONNALLY CONVERGENT SERIES (RIEMANN). Let {a n } n=0 R be a series such that the series n=0 a n converges conditionally and let α β.

17 5. UNIFORM CONVERGENCE 13 Then there is a rearrangement n=0 a n such that ) lim inf ( n a m m=0 = α,limsup ( n a m m=0 ) = β Theorem EQUIVALENCE BETWEEN ABSOLUTE AND COMMUTATIVE CONVERGENCE. Let {a n } C be a sequence such that the series n=0 a n converges. Then n=0 a n converges absolutely iff n=0 a n converges commutatively Theorem CONDITION FOR DOUBLE SERIES COMMUTATIVITY. Let {a mn : m, n = 0, 1, 2,...} C be a double sequence such that a mn = b m,m = 0,1,2,... n=0 and m=0 b m converges. Then m=0 n=0 a mn = n=0 m=0 a mn. 5. Uniform convergence 5.1 Notation In this section, f n and f refer to functions on a set E to the complex numbers C, i.e. f n : E C and f : E C. 5.2 Definition UNIFORM CONVERGENCE. We say that the sequence of functions { f n } n=0 converges uniformly on E to the function f if, for any ε > 0, there is an integer N such that In this case, we write f n f uniformly on E. n N f n (x) f(x) < ε, x E. 5.3 Remark We dit that the series i=0 f i(x) converges uniformly on E if the sequence of partial sums s n (x) = n i=0 f i(x), n = 0, 1,... converges uniformly on E. 5.4 Theorem CAUCHY CRITERION FOR UNIFORM CONVERGENCE. The sequence of functions { f n } n=0 converges uniformly on E to a function f if and only if, for any ε > 0, there is an integer N such that m,n N f m (x) f n (x) < ε, x E. 5.5 Theorem SUPREMUM CRITERION FOR UNIFORM CONVERGENCE. Suppose lim f n(x) = f(x), x E,

18 5. UNIFORM CONVERGENCE 14 and let M n = sup f n (x) f(x). x E Then, f n f uniformly on E if and only if lim M n = Theorem WEIERSTRASS UNIFORM CONVERGENCE CRITERION. Suppose f n (x) M n, x E, n = 0,1, 2,... and n=0 M n <. Then the series n=0 f n(x) converges uniformly on E. 5.7 Theorem UNIFORM CONVERGENCE AND CONTINUITY. If { f n } n=0 is a sequence of continuous functions on E and if f n f uniformly on E, then the function f is continuous on E. 5.8 Remark A sequence of continuous functions { f n } n=0 can converge to a continuous function f without uniform convergence. 5.9 Theorem CONDITIONS OF UNIFORM CONVERGENCE (DINI). If (a) K is a compact set, (b) { f n } n=0 is a sequence of continuous functions on K, (c) lim f n (x) = f (x), x K, where f is a continuous function on K, (d) f n (x) f n+1 (x), x K, n = 0, 1, 2,..., then f n f uniformly on K Theorem UNIFORM CONVERGENCE AND DIFFERENTIATION OF FUNCTIONS OF REAL VARIABLES. Suppose [a, b] E R and let f n : E C, a sequence of differentiable functions on the interval [a,b] such that the sequence { f n (x 0 )} n=0 converges for at least one x 0 [a,b]. If the sequence { f n } n=0 converges uniformly on [a,b], then { f n} n=0 converges uniformly on [a,b] to a differentiable function f on E, and f (x) = lim f n(x), x [a,b] Theorem UNIFORM CONVERGENCE AND DIFFERENTIATION OF FUNCTIONS OF COMPLEX VARIABLES. Let E C and f n : E C, n = 0, 1, 2,..., a sequence of differentiable functions on E. If the sequence { f n } n=0 converges to a function f in E and { f n} n=0 converges uniformly in E, then the function f is differentiable in E and f (z) = lim f n(z), z E.

19 6. PROOFS AND REFERENCES Proofs and references 1. Rudin (1976, Chapters 1 and 3) Royden (1968, Section 2.4, pp ) Iyanaga and Kawada (1977, article 374, p. 1162). 2. Rudin (1976, Chapter 3) Ahlfors (1979, Chapter 1, p. 62), Gillert, Küstner, Kellwich and Kästner (1986, Section 18.1, p. 422), and Rudin (1976, Chapter 3) Rudin (1976, Theorem 3.20, p. 57), and Gillert et al. (1986, Section 18.1, p. 420) Rudin (1976, Chapter 3) Gillert et al. (1986, Section 18.2, p. 428) Knopp (1956, Section 2.6.2, Theorem 1, p. 49, and Section 3.3, Theorem 1, p. 61) Devinatz (1968, section 3.2.4, p. 112) and Taylor (1955, Section 17.4, pp ) Taylor (1955, Section 17.4, pp ) Taylor (1955, Section 17.21, pp ) Anderson (1971, Lemma 8.3.1, p. 460) Piskounov (1980, 1980, chapitre XVI(7), pp ) Hardy, Littlewood and Polya (1952, Theorem 162, p. 120) and Knopp (1956, Section 2.6.2, Theorem 1, p. 49, and Section 3.3, Theorem 1, p. 61) Beckenbach and Bellman (1965, Chapter 3, Theorem 11, pp ) Fuller (1976, Lemma 3.1.5, p. 112). 4. Rudin (1976, Chapter 3) Rudin (1976, Section 3.50, pp ), Taylor (1955, Section 17.6, pp ) and Iyanaga and Kawada (1977, article 374, p. 1162) Beckenbach and Bellman (1965, Chapter 3, Theorem 12, p. 117) Gillert et al. (1986, Chapter 18, p. 428) Gillert et al. (1986, Section 18.2, p. 429) Iyanaga and Kawada (1977, article 374, p. 1162) Gillert et al. (1986, section 18.2, p. 429). 5. Ahlfors (1979, Chapter 2) and Rudin (1976, Chapter 7) Ahlfors (1979, Section 2.3, p. 36) and Rudin (1976, Definition 7.7, p. 147) Ahlfors (1979, Section 2.3, p. 36) and Rudin (1976, Theorem 7.8, p. 147) Rudin (1976, Theorem 7.9, p. 148) Rudin (1976, Theorem 7.10, p. 148) Ahlfors (1979, Section 2.3, p. 36) and Rudin (1976, Theorem 7.12, p. 150) Rudin (1976, Sections 7.12 and 7.6, p. 150 and 146) Rudin (1976, Theorem 7.13, p. 150) Rudin (1976, Theorem 7.17, p. 152). Other useful references include: Devinatz (1968), Gradshteyn and Ryzhik (1980), Rudin (1987), and Spiegel (1964).

20 REFERENCES 16 References Ahlfors, L. V. (1979), Complex Analysis: An Introduction to the Theory of Analytic Functions of One Complex Variable, International Series in Pure and Applied Mathematics, third edn, McGraw-Hill, New York. Anderson, T. W. (1971), The Statistical Analysis of Time Series, John Wiley & Sons, New York. Beckenbach, E. F. and Bellman, R. (1965), Inequalities, second edn, Springer-Verlag, Berlin and New York. Devinatz, A. (1968), Advanced Calculus, Holt, Rinehart and Winston, New York. Fuller, W. A. (1976), Introduction to Statistical Time Series, John Wiley & Sons, New York. Gillert, W., Küstner, Kellwich, H. and Kästner, H. (1986), Petite encyclopédie des mathématiques, Éditions K. Pagoulatos, Paris and Athens. Gradshteyn, I. S. and Ryzhik, I. M. (1980), Table of Integrals, Series, and Products. Corrected and Enlarged Edition, Academic Press, New York. Hardy, G., Littlewood, J. E. and Polya, G. (1952), Inequalities, second edn, Cambridge University Press, Cambridge, U.K. Iyanaga, S. and Kawada, Y., eds (1977), Encyclopedic Dictionary of Mathematics, Volumes I and II, 1977, Cambridge, Massachusetts. Knopp, K. (1956), Infinite Sequences and Series, Dover Publications, New York. Piskounov, N. (1980), Calcul différentiel et intégral, Éditions de Moscou, Moscow. Royden, H. L. (1968), Real Analysis, second edn, MacMillan, New York. Rudin, W. (1976), Principles of Mathematical Analysis, Third Edition, McGraw-Hill, New York. Rudin, W. (1987), Real and Complex Analysis, third edn, McGraw-Hill, New York. Spiegel, M. R. (1964), Theory and Problems of Complex Variables with an Introduction to Conformal Mapping and its Applications, Schaum Publishing Company, New York. Taylor, A. E. (1955), Advanced Calculus, Blaisdell Publishing Company, Waltham, Massachusetts.

Distribution and quantile functions

Distribution and quantile functions Distribution and quantile functions Jean-Marie Dufour McGill University First version: November 1995 Revised: June 2011 This version: June 2011 Compiled: April 7, 2015, 16:45 This work was supported by

More information

Statistical models and likelihood functions

Statistical models and likelihood functions Statistical models and likelihood functions Jean-Marie Dufour McGill University First version: February 1998 This version: February 11, 2008, 12:19pm This work was supported by the William Dow Chair in

More information

Binary variables in linear regression

Binary variables in linear regression Binary variables in linear regression Jean-Marie Dufour McGill University First version: October 1979 Revised: April 2002, July 2011, December 2011 This version: December 2011 Compiled: December 8, 2011,

More information

Specification errors in linear regression models

Specification errors in linear regression models Specification errors in linear regression models Jean-Marie Dufour McGill University First version: February 2002 Revised: December 2011 This version: December 2011 Compiled: December 9, 2011, 22:34 This

More information

Asymptotic theory for linear regression and IV estimation

Asymptotic theory for linear regression and IV estimation Asymtotic theory for linear regression and IV estimation Jean-Marie Dufour McGill University First version: November 20 Revised: December 20 his version: December 20 Comiled: December 3, 20, : his work

More information

Math 117: Infinite Sequences

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

More information

Comments on Weak instrument robust tests in GMM and the new Keynesian Phillips curve by F. Kleibergen and S. Mavroeidis

Comments on Weak instrument robust tests in GMM and the new Keynesian Phillips curve by F. Kleibergen and S. Mavroeidis Comments on Weak instrument robust tests in GMM and the new Keynesian Phillips curve by F. Kleibergen and S. Mavroeidis Jean-Marie Dufour First version: August 2008 Revised: September 2008 This version:

More information

Appendix A. Sequences and series. A.1 Sequences. Definition A.1 A sequence is a function N R.

Appendix A. Sequences and series. A.1 Sequences. Definition A.1 A sequence is a function N R. Appendix A Sequences and series This course has for prerequisite a course (or two) of calculus. The purpose of this appendix is to review basic definitions and facts concerning sequences and series, which

More information

Logical Connectives and Quantifiers

Logical Connectives and Quantifiers Chapter 1 Logical Connectives and Quantifiers 1.1 Logical Connectives 1.2 Quantifiers 1.3 Techniques of Proof: I 1.4 Techniques of Proof: II Theorem 1. Let f be a continuous function. If 1 f(x)dx 0, then

More information

Model selection criteria Λ

Model selection criteria Λ Model selection criteria Λ Jean-Marie Dufour y Université de Montréal First version: March 1991 Revised: July 1998 This version: April 7, 2002 Compiled: April 7, 2002, 4:10pm Λ This work was supported

More information

Analysis II: Basic knowledge of real analysis: Part IV, Series

Analysis II: Basic knowledge of real analysis: Part IV, Series .... Analysis II: Basic knowledge of real analysis: Part IV, Series Kenichi Maruno Department of Mathematics, The University of Texas - Pan American March 1, 2011 K.Maruno (UT-Pan American) Analysis II

More information

INTRODUCTION TO REAL ANALYSIS II MATH 4332 BLECHER NOTES

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

More information

Week 2: Sequences and Series

Week 2: Sequences and Series QF0: Quantitative Finance August 29, 207 Week 2: Sequences and Series Facilitator: Christopher Ting AY 207/208 Mathematicians have tried in vain to this day to discover some order in the sequence of prime

More information

Math 141: Lecture 19

Math 141: Lecture 19 Math 141: Lecture 19 Convergence of infinite series Bob Hough November 16, 2016 Bob Hough Math 141: Lecture 19 November 16, 2016 1 / 44 Series of positive terms Recall that, given a sequence {a n } n=1,

More information

Exogeneity tests and weak-identification

Exogeneity tests and weak-identification Exogeneity tests and weak-identification Firmin Doko Université de Montréal Jean-Marie Dufour McGill University First version: September 2007 Revised: October 2007 his version: February 2007 Compiled:

More information

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

Copyright 2010 Pearson Education, Inc. Publishing as Prentice Hall. .1 Limits of Sequences. CHAPTER.1.0. a) True. If converges, then there is an M > 0 such that M. Choose by Archimedes an N N such that N > M/ε. Then n N implies /n M/n M/N < ε. b) False. = n does not converge,

More information

From Calculus II: An infinite series is an expression of the form

From Calculus II: An infinite series is an expression of the form MATH 3333 INTERMEDIATE ANALYSIS BLECHER NOTES 75 8. Infinite series of numbers From Calculus II: An infinite series is an expression of the form = a m + a m+ + a m+2 + ( ) Let us call this expression (*).

More information

MATH 409 Advanced Calculus I Lecture 7: Monotone sequences. The Bolzano-Weierstrass theorem.

MATH 409 Advanced Calculus I Lecture 7: Monotone sequences. The Bolzano-Weierstrass theorem. MATH 409 Advanced Calculus I Lecture 7: Monotone sequences. The Bolzano-Weierstrass theorem. Limit of a sequence Definition. Sequence {x n } of real numbers is said to converge to a real number a if for

More information

1. Supremum and Infimum Remark: In this sections, all the subsets of R are assumed to be nonempty.

1. Supremum and Infimum Remark: In this sections, all the subsets of R are assumed to be nonempty. 1. Supremum and Infimum Remark: In this sections, all the subsets of R are assumed to be nonempty. Let E be a subset of R. We say that E is bounded above if there exists a real number U such that x U for

More information

Limit and Continuity

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

More information

Solutions Final Exam May. 14, 2014

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

More information

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

MAT 570 REAL ANALYSIS LECTURE NOTES. Contents. 1. Sets Functions Countability Axiom of choice Equivalence relations 9 MAT 570 REAL ANALYSIS LECTURE NOTES PROFESSOR: JOHN QUIGG SEMESTER: FALL 204 Contents. Sets 2 2. Functions 5 3. Countability 7 4. Axiom of choice 8 5. Equivalence relations 9 6. Real numbers 9 7. Extended

More information

CHAPTER 2 INFINITE SUMS (SERIES) Lecture Notes PART 1

CHAPTER 2 INFINITE SUMS (SERIES) Lecture Notes PART 1 CHAPTER 2 INFINITE SUMS (SERIES) Lecture Notes PART We extend now the notion of a finite sum Σ n k= a k to an INFINITE SUM which we write as Σ n= a n as follows. For a given a sequence {a n } n N {0},

More information

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

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

More information

Sequences. Chapter 3. n + 1 3n + 2 sin n n. 3. lim (ln(n + 1) ln n) 1. lim. 2. lim. 4. lim (1 + n)1/n. Answers: 1. 1/3; 2. 0; 3. 0; 4. 1.

Sequences. Chapter 3. n + 1 3n + 2 sin n n. 3. lim (ln(n + 1) ln n) 1. lim. 2. lim. 4. lim (1 + n)1/n. Answers: 1. 1/3; 2. 0; 3. 0; 4. 1. Chapter 3 Sequences Both the main elements of calculus (differentiation and integration) require the notion of a limit. Sequences will play a central role when we work with limits. Definition 3.. A Sequence

More information

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

In N we can do addition, but in order to do subtraction we need to extend N to the integers Chapter The Real Numbers.. Some Preliminaries Discussion: The Irrationality of 2. We begin with the natural numbers N = {, 2, 3, }. In N we can do addition, but in order to do subtraction we need to extend

More information

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

Theorems. Theorem 1.11: Greatest-Lower-Bound Property. Theorem 1.20: The Archimedean property of. Theorem 1.21: -th Root of Real Numbers Page 1 Theorems Wednesday, May 9, 2018 12:53 AM Theorem 1.11: Greatest-Lower-Bound Property Suppose is an ordered set with the least-upper-bound property Suppose, and is bounded below be the set of lower

More information

On the convergence of sequences of random variables: A primer

On the convergence of sequences of random variables: A primer BCAM May 2012 1 On the convergence of sequences of random variables: A primer Armand M. Makowski ECE & ISR/HyNet University of Maryland at College Park armand@isr.umd.edu BCAM May 2012 2 A sequence a :

More information

Differentiating an Integral: Leibniz Rule

Differentiating an Integral: Leibniz Rule Division of the Humanities and Social Sciences Differentiating an Integral: Leibniz Rule KC Border Spring 22 Revised December 216 Both Theorems 1 and 2 below have been described to me as Leibniz Rule.

More information

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

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

More information

Solutions Final Exam May. 14, 2014

Solutions Final Exam May. 14, 2014 Solutions Final Exam May. 14, 2014 1. (a) (10 points) State the formal definition of a Cauchy sequence of real numbers. A sequence, {a n } n N, of real numbers, is Cauchy if and only if for every ɛ > 0,

More information

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

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

More information

INDEX. Bolzano-Weierstrass theorem, for sequences, boundary points, bounded functions, 142 bounded sets, 42 43

INDEX. Bolzano-Weierstrass theorem, for sequences, boundary points, bounded functions, 142 bounded sets, 42 43 INDEX Abel s identity, 131 Abel s test, 131 132 Abel s theorem, 463 464 absolute convergence, 113 114 implication of conditional convergence, 114 absolute value, 7 reverse triangle inequality, 9 triangle

More information

Analysis Finite and Infinite Sets The Real Numbers The Cantor Set

Analysis Finite and Infinite Sets The Real Numbers The Cantor Set Analysis Finite and Infinite Sets Definition. An initial segment is {n N n n 0 }. Definition. A finite set can be put into one-to-one correspondence with an initial segment. The empty set is also considered

More information

1 Definition of the Riemann integral

1 Definition of the Riemann integral MAT337H1, Introduction to Real Analysis: notes on Riemann integration 1 Definition of the Riemann integral Definition 1.1. Let [a, b] R be a closed interval. A partition P of [a, b] is a finite set of

More information

Similar to sequence, note that a series converges if and only if its tail converges, that is, r 1 r ( 1 < r < 1), ( 1) k k. r k =

Similar to sequence, note that a series converges if and only if its tail converges, that is, r 1 r ( 1 < r < 1), ( 1) k k. r k = Infinite Series We say an infinite series a k converges to s if its sequence of initial sums converges to s, that is, lim( n a k : n N) = s. Similar to sequence, note that a series converges if and only

More information

Mathematics 324 Riemann Zeta Function August 5, 2005

Mathematics 324 Riemann Zeta Function August 5, 2005 Mathematics 324 Riemann Zeta Function August 5, 25 In this note we give an introduction to the Riemann zeta function, which connects the ideas of real analysis with the arithmetic of the integers. Define

More information

That is, there is an element

That is, there is an element Section 3.1: Mathematical Induction Let N denote the set of natural numbers (positive integers). N = {1, 2, 3, 4, } Axiom: If S is a nonempty subset of N, then S has a least element. That is, there is

More information

SYLLABUS UNDER AUTONOMY MATHEMATICS

SYLLABUS UNDER AUTONOMY MATHEMATICS SYLLABUS UNDER AUTONOMY SEMESTER III Calculus and Analysis MATHEMATICS COURSE: A.MAT.3.01 [45 LECTURES] LEARNING OBJECTIVES : To learn about i) lub axiom of R and its consequences ii) Convergence of sequences

More information

,

, NATIONAL ACADEMY DHARMAPURI 97876 60996, 7010865319 Unit-II - Real Analysis Cardinal numbers - Countable and uncountable cordinals - Cantor s diagonal process Properties of real numbers - Order - Completeness

More information

Stochastic processes: basic notions

Stochastic processes: basic notions Stochastic processes: basic notions Jean-Marie Dufour McGill University First version: March 2002 Revised: September 2002, April 2004, September 2004, January 2005, July 2011, May 2016, July 2016 This

More information

Notes on uniform convergence

Notes on uniform convergence Notes on uniform convergence Erik Wahlén erik.wahlen@math.lu.se January 17, 2012 1 Numerical sequences We begin by recalling some properties of numerical sequences. By a numerical sequence we simply mean

More information

3 Integration and Expectation

3 Integration and Expectation 3 Integration and Expectation 3.1 Construction of the Lebesgue Integral Let (, F, µ) be a measure space (not necessarily a probability space). Our objective will be to define the Lebesgue integral R fdµ

More information

CHAPTER 4. Series. 1. What is a Series?

CHAPTER 4. Series. 1. What is a Series? CHAPTER 4 Series Given a sequence, in many contexts it is natural to ask about the sum of all the numbers in the sequence. If only a finite number of the are nonzero, this is trivial and not very interesting.

More information

Math LM (24543) Lectures 01

Math LM (24543) Lectures 01 Math 32300 LM (24543) Lectures 01 Ethan Akin Office: NAC 6/287 Phone: 650-5136 Email: ethanakin@earthlink.net Spring, 2018 Contents Introduction, Ross Chapter 1 and Appendix The Natural Numbers N and The

More information

9. Series representation for analytic functions

9. Series representation for analytic functions 9. Series representation for analytic functions 9.. Power series. Definition: A power series is the formal expression S(z) := c n (z a) n, a, c i, i =,,, fixed, z C. () The n.th partial sum S n (z) is

More information

Advanced Calculus II Unit 7.3: 7.3.1a, 7.3.3a, 7.3.6b, 7.3.6f, 7.3.6h Unit 7.4: 7.4.1b, 7.4.1c, 7.4.2b, 7.4.3, 7.4.6, 7.4.7

Advanced Calculus II Unit 7.3: 7.3.1a, 7.3.3a, 7.3.6b, 7.3.6f, 7.3.6h Unit 7.4: 7.4.1b, 7.4.1c, 7.4.2b, 7.4.3, 7.4.6, 7.4.7 Advanced Calculus II Unit 73: 73a, 733a, 736b, 736f, 736h Unit 74: 74b, 74c, 74b, 743, 746, 747 Megan Bryant October 9, 03 73a Prove the following: If lim p a = A, for some p >, then a converges absolutely

More information

Undergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics

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

More information

G1CMIN Measure and Integration

G1CMIN Measure and Integration G1CMIN Measure and Integration 2003-4 Prof. J.K. Langley May 13, 2004 1 Introduction Books: W. Rudin, Real and Complex Analysis ; H.L. Royden, Real Analysis (QA331). Lecturer: Prof. J.K. Langley (jkl@maths,

More information

Analysis Qualifying Exam

Analysis Qualifying Exam Analysis Qualifying Exam Spring 2017 Problem 1: Let f be differentiable on R. Suppose that there exists M > 0 such that f(k) M for each integer k, and f (x) M for all x R. Show that f is bounded, i.e.,

More information

d(x n, x) d(x n, x nk ) + d(x nk, x) where we chose any fixed k > N

d(x n, x) d(x n, x nk ) + d(x nk, x) where we chose any fixed k > N Problem 1. Let f : A R R have the property that for every x A, there exists ɛ > 0 such that f(t) > ɛ if t (x ɛ, x + ɛ) A. If the set A is compact, prove there exists c > 0 such that f(x) > c for all x

More information

Lecture 2: A crash course in Real Analysis

Lecture 2: A crash course in Real Analysis EE5110: Probability Foundations for Electrical Engineers July-November 2015 Lecture 2: A crash course in Real Analysis Lecturer: Dr. Krishna Jagannathan Scribe: Sudharsan Parthasarathy This lecture is

More information

Czechoslovak Mathematical Journal

Czechoslovak Mathematical Journal Czechoslovak Mathematical Journal Oktay Duman; Cihan Orhan µ-statistically convergent function sequences Czechoslovak Mathematical Journal, Vol. 54 (2004), No. 2, 413 422 Persistent URL: http://dml.cz/dmlcz/127899

More information

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

Contents Ordered Fields... 2 Ordered sets and fields... 2 Construction of the Reals 1: Dedekind Cuts... 2 Metric Spaces... 3 Analysis Math Notes Study Guide Real Analysis Contents Ordered Fields 2 Ordered sets and fields 2 Construction of the Reals 1: Dedekind Cuts 2 Metric Spaces 3 Metric Spaces 3 Definitions 4 Separability

More information

Doubly Indexed Infinite Series

Doubly Indexed Infinite Series The Islamic University of Gaza Deanery of Higher studies Faculty of Science Department of Mathematics Doubly Indexed Infinite Series Presented By Ahed Khaleel Abu ALees Supervisor Professor Eissa D. Habil

More information

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

In N we can do addition, but in order to do subtraction we need to extend N to the integers Chapter 1 The Real Numbers 1.1. Some Preliminaries Discussion: The Irrationality of 2. We begin with the natural numbers N = {1, 2, 3, }. In N we can do addition, but in order to do subtraction we need

More information

Chapter 3 Continuous Functions

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

More information

MATH 117 LECTURE NOTES

MATH 117 LECTURE NOTES MATH 117 LECTURE NOTES XIN ZHOU Abstract. This is the set of lecture notes for Math 117 during Fall quarter of 2017 at UC Santa Barbara. The lectures follow closely the textbook [1]. Contents 1. The set

More information

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

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

More information

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

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

More information

MATH 409 Advanced Calculus I Lecture 9: Limit supremum and infimum. Limits of functions.

MATH 409 Advanced Calculus I Lecture 9: Limit supremum and infimum. Limits of functions. MATH 409 Advanced Calculus I Lecture 9: Limit supremum and infimum. Limits of functions. Limit points Definition. A limit point of a sequence {x n } is the limit of any convergent subsequence of {x n }.

More information

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

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

More information

Introduction to Real Analysis

Introduction to Real Analysis Christopher Heil Introduction to Real Analysis Chapter 0 Online Expanded Chapter on Notation and Preliminaries Last Updated: January 9, 2018 c 2018 by Christopher Heil Chapter 0 Notation and Preliminaries:

More information

1 + lim. n n+1. f(x) = x + 1, x 1. and we check that f is increasing, instead. Using the quotient rule, we easily find that. 1 (x + 1) 1 x (x + 1) 2 =

1 + lim. n n+1. f(x) = x + 1, x 1. and we check that f is increasing, instead. Using the quotient rule, we easily find that. 1 (x + 1) 1 x (x + 1) 2 = Chapter 5 Sequences and series 5. Sequences Definition 5. (Sequence). A sequence is a function which is defined on the set N of natural numbers. Since such a function is uniquely determined by its values

More information

ECARES Université Libre de Bruxelles MATH CAMP Basic Topology

ECARES Université Libre de Bruxelles MATH CAMP Basic Topology ECARES Université Libre de Bruxelles MATH CAMP 03 Basic Topology Marjorie Gassner Contents: - Subsets, Cartesian products, de Morgan laws - Ordered sets, bounds, supremum, infimum - Functions, image, preimage,

More information

Estimates for probabilities of independent events and infinite series

Estimates for probabilities of independent events and infinite series Estimates for probabilities of independent events and infinite series Jürgen Grahl and Shahar evo September 9, 06 arxiv:609.0894v [math.pr] 8 Sep 06 Abstract This paper deals with finite or infinite sequences

More information

Random Bernstein-Markov factors

Random Bernstein-Markov factors Random Bernstein-Markov factors Igor Pritsker and Koushik Ramachandran October 20, 208 Abstract For a polynomial P n of degree n, Bernstein s inequality states that P n n P n for all L p norms on the unit

More information

A Measure and Integral over Unbounded Sets

A Measure and Integral over Unbounded Sets A Measure and Integral over Unbounded Sets As presented in Chaps. 2 and 3, Lebesgue s theory of measure and integral is limited to functions defined over bounded sets. There are several ways of introducing

More information

A LITTLE REAL ANALYSIS AND TOPOLOGY

A LITTLE REAL ANALYSIS AND TOPOLOGY A LITTLE REAL ANALYSIS AND TOPOLOGY 1. NOTATION Before we begin some notational definitions are useful. (1) Z = {, 3, 2, 1, 0, 1, 2, 3, }is the set of integers. (2) Q = { a b : aεz, bεz {0}} is the set

More information

MATH 131A: REAL ANALYSIS (BIG IDEAS)

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

More information

Lebesgue Integration: A non-rigorous introduction. What is wrong with Riemann integration?

Lebesgue Integration: A non-rigorous introduction. What is wrong with Riemann integration? Lebesgue Integration: A non-rigorous introduction What is wrong with Riemann integration? xample. Let f(x) = { 0 for x Q 1 for x / Q. The upper integral is 1, while the lower integral is 0. Yet, the function

More information

MATH 140B - HW 5 SOLUTIONS

MATH 140B - HW 5 SOLUTIONS MATH 140B - HW 5 SOLUTIONS Problem 1 (WR Ch 7 #8). If I (x) = { 0 (x 0), 1 (x > 0), if {x n } is a sequence of distinct points of (a,b), and if c n converges, prove that the series f (x) = c n I (x x n

More information

Homework for MATH 4603 (Advanced Calculus I) Fall Homework 13: Due on Tuesday 15 December. Homework 12: Due on Tuesday 8 December

Homework for MATH 4603 (Advanced Calculus I) Fall Homework 13: Due on Tuesday 15 December. Homework 12: Due on Tuesday 8 December Homework for MATH 4603 (Advanced Calculus I) Fall 2015 Homework 13: Due on Tuesday 15 December 49. Let D R, f : D R and S D. Let a S (acc S). Assume that f is differentiable at a. Let g := f S. Show that

More information

THEOREMS, ETC., FOR MATH 515

THEOREMS, ETC., FOR MATH 515 THEOREMS, ETC., FOR MATH 515 Proposition 1 (=comment on page 17). If A is an algebra, then any finite union or finite intersection of sets in A is also in A. Proposition 2 (=Proposition 1.1). For every

More information

Existence of a Limit on a Dense Set, and. Construction of Continuous Functions on Special Sets

Existence of a Limit on a Dense Set, and. Construction of Continuous Functions on Special Sets Existence of a Limit on a Dense Set, and Construction of Continuous Functions on Special Sets REU 2012 Recap: Definitions Definition Given a real-valued function f, the limit of f exists at a point c R

More information

CHAPTER 3. Sequences. 1. Basic Properties

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

More information

Math 118B Solutions. Charles Martin. March 6, d i (x i, y i ) + d i (y i, z i ) = d(x, y) + d(y, z). i=1

Math 118B Solutions. Charles Martin. March 6, d i (x i, y i ) + d i (y i, z i ) = d(x, y) + d(y, z). i=1 Math 8B Solutions Charles Martin March 6, Homework Problems. Let (X i, d i ), i n, be finitely many metric spaces. Construct a metric on the product space X = X X n. Proof. Denote points in X as x = (x,

More information

Bernoulli Numbers and their Applications

Bernoulli Numbers and their Applications Bernoulli Numbers and their Applications James B Silva Abstract The Bernoulli numbers are a set of numbers that were discovered by Jacob Bernoulli (654-75). This set of numbers holds a deep relationship

More information

Advanced Calculus of a Single Variable

Advanced Calculus of a Single Variable Advanced Calculus of a Single Variable Tunc Geveci Advanced Calculus of a Single Variable 123 Tunc Geveci Department of Mathematics and Statistics San Diego State University San Diego, CA, USA ISBN 978-3-319-27806-3

More information

Definitions & Theorems

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

More information

Absolute Convergence in Ordered Fields

Absolute Convergence in Ordered Fields Absolute Convergence in Ordered Fields Kristine Hampton Abstract This paper reviews Absolute Convergence in Ordered Fields by Clark and Diepeveen [1]. Contents 1 Introduction 2 2 Definition of Terms 2

More information

A Note on the 2 F 1 Hypergeometric Function

A Note on the 2 F 1 Hypergeometric Function A Note on the F 1 Hypergeometric Function Armen Bagdasaryan Institution of the Russian Academy of Sciences, V.A. Trapeznikov Institute for Control Sciences 65 Profsoyuznaya, 117997, Moscow, Russia E-mail:

More information

We have been going places in the car of calculus for years, but this analysis course is about how the car actually works.

We have been going places in the car of calculus for years, but this analysis course is about how the car actually works. Analysis I We have been going places in the car of calculus for years, but this analysis course is about how the car actually works. Copier s Message These notes may contain errors. In fact, they almost

More information

Problem set 1, Real Analysis I, Spring, 2015.

Problem set 1, Real Analysis I, Spring, 2015. Problem set 1, Real Analysis I, Spring, 015. (1) Let f n : D R be a sequence of functions with domain D R n. Recall that f n f uniformly if and only if for all ɛ > 0, there is an N = N(ɛ) so that if n

More information

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

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

More information

What to remember about metric spaces

What to remember about metric spaces Division of the Humanities and Social Sciences What to remember about metric spaces KC Border These notes are (I hope) a gentle introduction to the topological concepts used in economic theory. If the

More information

REVIEW OF ESSENTIAL MATH 346 TOPICS

REVIEW OF ESSENTIAL MATH 346 TOPICS REVIEW OF ESSENTIAL MATH 346 TOPICS 1. AXIOMATIC STRUCTURE OF R Doğan Çömez The real number system is a complete ordered field, i.e., it is a set R which is endowed with addition and multiplication operations

More information

Convex Analysis and Economic Theory Winter 2018

Convex Analysis and Economic Theory Winter 2018 Division of the Humanities and Social Sciences Ec 181 KC Border Convex Analysis and Economic Theory Winter 2018 Supplement A: Mathematical background A.1 Extended real numbers The extended real number

More information

Contents. 2 Sequences and Series Approximation by Rational Numbers Sequences Basics on Sequences...

Contents. 2 Sequences and Series Approximation by Rational Numbers Sequences Basics on Sequences... Contents 1 Real Numbers: The Basics... 1 1.1 Notation... 1 1.2 Natural Numbers... 4 1.3 Integers... 5 1.4 Fractions and Rational Numbers... 10 1.4.1 Introduction... 10 1.4.2 Powers and Radicals of Rational

More information

Paul-Eugène Parent. March 12th, Department of Mathematics and Statistics University of Ottawa. MAT 3121: Complex Analysis I

Paul-Eugène Parent. March 12th, Department of Mathematics and Statistics University of Ottawa. MAT 3121: Complex Analysis I Paul-Eugène Parent Department of Mathematics and Statistics University of Ottawa March 12th, 2014 Outline 1 Holomorphic power Series Proposition Let f (z) = a n (z z o ) n be the holomorphic function defined

More information

ON A DISTANCE DEFINED BY THE LENGTH SPECTRUM ON TEICHMÜLLER SPACE

ON A DISTANCE DEFINED BY THE LENGTH SPECTRUM ON TEICHMÜLLER SPACE Annales Academiæ Scientiarum Fennicæ Mathematica Volumen 28, 2003, 315 326 ON A DISTANCE DEFINED BY THE LENGTH SPECTRUM ON TEICHMÜLLER SPACE Hiroshige Shiga Tokyo Institute of Technology, Department of

More information

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

Real Analysis Math 131AH Rudin, Chapter #1. Dominique Abdi Real Analysis Math 3AH Rudin, Chapter # Dominique Abdi.. If r is rational (r 0) and x is irrational, prove that r + x and rx are irrational. Solution. Assume the contrary, that r+x and rx are rational.

More information

STAT 7032 Probability Spring Wlodek Bryc

STAT 7032 Probability Spring Wlodek Bryc STAT 7032 Probability Spring 2018 Wlodek Bryc Created: Friday, Jan 2, 2014 Revised for Spring 2018 Printed: January 9, 2018 File: Grad-Prob-2018.TEX Department of Mathematical Sciences, University of Cincinnati,

More information

Introduction and Preliminaries

Introduction and Preliminaries Chapter 1 Introduction and Preliminaries This chapter serves two purposes. The first purpose is to prepare the readers for the more systematic development in later chapters of methods of real analysis

More information

Supplementary Notes for W. Rudin: Principles of Mathematical Analysis

Supplementary Notes for W. Rudin: Principles of Mathematical Analysis Supplementary Notes for W. Rudin: Principles of Mathematical Analysis SIGURDUR HELGASON In 8.00B it is customary to cover Chapters 7 in Rudin s book. Experience shows that this requires careful planning

More information

Integral mean value theorems and the Ganelius inequality

Integral mean value theorems and the Ganelius inequality Proceedings of the Royal Society of Edinburgh, 97.4, 145-150, 1984 Integral mean value theorems and the Ganelius inequality Ian Knowles Department of Mathematics, University of Alabama in Birmingham, Birmingham,

More information

Midterm Review Math 311, Spring 2016

Midterm Review Math 311, Spring 2016 Midterm Review Math 3, Spring 206 Material Review Preliminaries and Chapter Chapter 2. Set theory (DeMorgan s laws, infinite collections of sets, nested sets, cardinality) 2. Functions (image, preimage,

More information

Notes on Complex Analysis

Notes on Complex Analysis Michael Papadimitrakis Notes on Complex Analysis Department of Mathematics University of Crete Contents The complex plane.. The complex plane...................................2 Argument and polar representation.........................

More information

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

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

More information

Foundations of Mathematical Analysis

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

More information