Solutions Manual for Homework Sets Math 401. Dr Vignon S. Oussa
|
|
- Patricia Fitzgerald
- 5 years ago
- Views:
Transcription
1 1 Solutions Manual for Homework Sets Math 401 Dr Vignon S. Oussa
2 Solutions Homework Set 0 Math 401 Fall (Direct Proof) Assume that x and y are odd integers. Then there exist integers u and v such that Next, Put Then Thus, xy is an odd integer. x = 2u + 1 and y = 2v + 1. xy = (2u + 1) (2v + 1) = 4uv + 2u + 2v + 1 = 2 (2uv + u + v) + 1. w = 2uv + u + v. xy = 2w (Direct Proof) Let a and b be positive real numbers. Assume that Then Now, since a < b then and it follows that a < b. b 2 a 2 = (b a) (b + a). a b < 0 b a > 0. Additionally, since a and b are positive integers then clearly, a + b > 0 (the sum of two positive numbers is positive). Next, since the product of two numbers of the same sign is positive then b 2 a 2 = (b a) (b + a) > 0. This completes the proof. 1
3 3. (Proof by contradiction). Assume that there exists an integer m such that m 2 is even and m is odd. Then m = 2n + 1 for some integer n. Now, squaring each side of the equation above gives m 2 = (2n + 1) 2. Next, foiling (2n + 1) 2, we obtain m 2 = (2n + 1) 2 = 4n 2 + 4n + 1 ( ) = 2 2n 2 + 2n + 1 and it follows that m 2 is odd, and this contradicts our assumption. Thus, it is not possible to find an odd number whose square is even. This completes the proof. 4. (Proof by contradiction) Let us suppose that 2 is a rational number. That is, there exist nonzero integers n, m such that 2 = n m. We shall furthermore assume that the fraction m n is given in its reduced form (n and m have no common divisor). Next, squaring each side of the equation above gives: It follows that 2 = n2 m 2. n 2 = 2m 2. (1) Thus n 2 is an even integer. Now, since n 2 is even then n is also even (see Problem 1). So, there exists an integer k such that n = 2k 2
4 and this implies that n 2 = 4k 2. Next, coming back to (1) we obtain So, 4k 2 = n 2 = 2m 2. m 2 = 2k 2 and this implies that m is also even. Thus, 2 divides both n and m. However this is impossible since the fraction is in its reduced form (the integers n, m have no common factor). 5. (Proof by contradiction) Let us suppose that the set of primes is actually finite. Let us suppose that n m {p 1, p 2,, p k } is the set of all prime numbers. Now, let n = p 1 p 2 p k + 1. Next, let q be a prime divisor of the number n. Then clearly n > 1. Next, since q is a prime number then q must be an element of the set {p 1, p 2,, p k }. Consequently, q must divide the number obtained by taking the product of the elements of {p 1, p 2,, p k } : p 1 p 2 p k. Next, since q also divides n then q must divide However, n p 1 p 2 p k. n p 1 p 2 p k = 1. So q divides 1. This means that q = 1 which contradicts our assumption. We conclude that our assumption that the set of primes is finite is a false assertion. As a consequence, the set of primes must be infinite. 3
5 6. There are two statements to prove here. First, we need to show that if m and n have the same parity then m 2 + n 2 is even. Secondly, we must also show that if m 2 + n 2 is even then m and n have the same parity. For the first statement, let m and n be integers. Assume that m and n have the same parity. There are two cases to consider. First let us assume that m, n are both even. That is, for some integers k, j. Then m = 2k and n = 2j m 2 + n 2 = (2k) 2 + (2j) 2 = 4j 2 + 4k 2 (this is an even number). Secondly, assume that m, n are both odd. That is for some integers k, j. Then m = 2k + 1 and n = 2j + 1 m 2 + n 2 = (2k + 1) 2 + (2j + 1) 2 = 4j 2 + 4j + 4k 2 + 4k + 2 ( ) = 2 2j 2 + 2j + 2k 2 + 2k + 1 which is also clearly even. For the second part of the proof, we want to show that if m 2 + n 2 is even then m and n have the same parity. By ways of contradiction, assume that m 2 + n 2 is even and m and n do not have the same parity. Then, it must be the case that m 2 + n 2 = (2k + 1) 2 + (2j) 2 for some integers k and j. Observe that m 2 + n 2 = (2k + 1) 2 + (2j) 2 = 4j 2 + 4k 2 + 4k + 1 ( ) = 2 2j 2 + 2k 2 + 2k + 1. Thus, m 2 + n 2 is odd and this contradicts our assumption. 4
6 1) Proof
7
8 2)
9 3)
10 (b)
11 4) Proof
12 5)
13 6)
14 7)
15 8)
16 9)
17
18 10) Proof
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40 Homework Set 4 Review 1 Review 2
41 Review 3 Review 4
42 Review 5 Review 5
43
44
45
46
47
48 Scrap work
49 Solutions
50 Solutions
51
52 Homework Set 4 Part 2 Objectives Sharpening skills required to successfully manipulate various inequalities. Mastering techniques used to formally establish the convergence of a sequence. 1. Prove that for any natural number n n n n 7 2n n Prove formally (using the ɛ-n definition) that if lim s n = s then lim ( s n ) = s. 3. Prove formally (using the ɛ-n definition) that lim n n n + 1 = (a) Prove the following identities max {x, y} = 1 (x + y + x y ) 2 (b) Prove that if lim n s n = s and lim r n = r then lim (max {s n, r n }) = max {s, r}. n 1
53 Solutions 1. Given any natural number n, we observe that n n n 7 2n + 1 n n n 5 5n 7 2n n = 5 5n 7 2n n = 5 5n 7 2n n5 5n 7 2n. The first inequality is obtained by using the fact that n 3 is less or equal to n 5 and 1 is also less or equal to the fifth power of any natural number. The third equality is due to the fact that 5n 7 2n + 1 is a positive number for any natural number n. Finally, the last inequality follows from 5n 7 2n + 1 5n 7 2n. Next, we want to show that for any natural number n, there exists a positive number B such that In other words, we want to show that 5n 7 2n Bn 7. (5 B) n 7 2n for all n N. For this to holds, it is enough to pick B = 3. Indeed, since 5n 7 2n 3n 7 for all n N, it follows that n n n 7 2n n5 5n 7 2n 29n5 3n 7 = 29 3n 2 29 n 2 for all natural numbers n. This completes the proof. 2. Assume that lim (s n) = s. n Given any ε > 0 there exists N > 0 such that if n > N then the distance between s n and s is less than ε. That is s n s < ε. Now, let us consider the distance between the opposite of s n and the opposites of s : s n ( s) = s n + s. Since any number is equal to its opposite, and since the opposite of s n + s is s n s then it is clear that s n + s = s n s. Appealing to our stated assumption, for any prescribed positive number ε, there is a positive number N such that as long as n is bigger than N then s n ( s) = s n s < ε. This establishes the desired result lim ( s n ) = s. 2
54 3. We want to show that for any given positive real number ε, there exists a corresponding positive number N such that as long as n > N then n 1 n + 1 < ε. We observe that n 1 n + 1 = n n + 1. n + 1 Multiplying the numerator as well as the denominator of the following fraction n n + 1 n + 1 by the conjugate of n n + 1 yields n n + 1 n + 1 = ( n n + 1 ) ( n + n + 1 ) n + 1 ( n + n + 1 ). Using the difference of perfect square formula, we proceed as follows: n n + 1 n + 1 = = = ( n ) 2 ( n + 1 ) 2 n + 1 ( n + n + 1 ) n (n + 1) n + 1 ( n + n + 1 ) 1 n + 1 n + (n + 1). Therefore the absolute value of the quantity n n+1 1 is given by n 1 n + 1 = 1. n + 1 n + (n + 1) Next, since n + 1 n + (n + 1) is larger or equal to n + 1, we obtain that n 1 n + 1 = 1 1 n + 1 n + (n + 1) n n. Letting N = 1 ε, if n > N then n 1 n n < ε, giving us the desired result. 4. (a) Let x and y be two real numbers. If we assume that x is less or equal to y then x y is less or equal to zero and it follows from the definition of the absolute value that x y = (x y). 3
55 As a result, the quantity 1 2 (x + y + x y ) becomes Since y is either bigger or equal to x then 1 (x + y (x y)) = y 2 1 (x + y (x y)) = y = max {x, y}. 2 Next, let us suppose that x is greater than y. So, the distance between x and y which is given by x y is equal to x y. Next, the quantity 1 2 (x + y + x y ) becomes In summary, we have proved that for any given real numbers. 1 (x + y + x y) = max {x, y}. 2 max {x, y} = 1 (x + y + x y ) 2 (b) Given a positive number ε, we want to establish the existence of a number N such that as long as n > N then max {s n, r n } max {s, r} < ε. In other words, given a positive number ε, we want to establish the existence of a number N such that as long as n > N then 1 2 (s n + r n + s n r n ) 1 (s + r + s r ) 2 < ε. We observe that 1 2 (s n + r n + s n r n ) 1 (s + r + s r ) 2 = s n + r n + s n r n s r s r 2 = (s n s) + (r n r) + s n r n s r. 2 Next, applying the triangle inequality, we obtain (s n s) + (r n r) + s n r n s r ( (s n s) + (r n r) + s n r n s r ) = 1 2 ( (s n + r n ) (s + r) + s n r n s r ). By assumption, we can assert that the limit of the sequence (s n + r n ) n is convergent to the real number s + r. Similarly, the sequence ( s n r n ) n converges to s r. As such, there exists N 1 > 0 such that if n > N 1 then (s n + r n ) (s + r) < ε. 4
56 Additionally, there exists N 2 > 0 such that if n > N 2 then s n r n s r < ε. Put N = max {N 1, N 2 }. As long as n > N, we have (s n s) + (r n r) + s n r n s r 2 1 ε ε {}}{{}}{ (s n + r n ) (s + r) + s n r n s r 2 This completes the proof. = 1 2 (ε + ε) = 1 (2ε) = ε. 2 5
57
58
59
60
61
62
63
64 Solutions Homework Set 6 Focus monotone sequences, Cauchy sequences, lim sup, lim inf, Relation between Cauchy sequences and convergent sequences. 1. We consider the quantity s n+1 s n. Computing this s n+1 s n for any natural number n, we obtain that s n+1 s n = Thus, for any natural number n (n + 1) (n + 1) n + 3 5n = 3 5n (n + 1) < 0. s n+1 < s n. It follows that (s n ) is a nonincreasing sequence. 2. First, we observe that for natural numbers n, m n s n s m = cos (t) dt t 2 1 m 1 cos (t) t 2 dt. Without loss of generality, we may assume that n is less than m. So, m s n s m = cos (t) dt n t 2 m cos (t) dt n m n t 2 1 t 2 dt = 1 n 1 m. Now, given any positive ɛ, let N = 2 ɛ. If n, m > N then s n s m 1 n 1 m < ɛ 2 + ɛ 2 = ɛ. We conclude that the sequence is a Cauchy sequence. 3. We complete the table as follows. ( n 1 ) cos (t) dt t 2 n N s n = cos ( 2πn 8 ) lim sup s n lim inf s n 1 1 s n = ( 1 2) n 0 0
65 Justification. For s n = cos ( ) 2πn 8, we observe that ( ) 2πn { cos 8 } { 1 2 : n N =, 0, 1 }, 1, 1 2 It follows that Next, ( lim sup s n = lim sup N ( = lim N { cos ( ) 2πn 8 }) : n > N }) sup { 1 2, 0, 1 2, 1, 1 = lim N 1 since sup = 1. ( lim inf s n = lim N = lim N = lim N ( 1) = 1. { cos { 1 2, 0, 1 2, 1, 1 ( ) 2πn } }) : n > N }) inf 8 ( { 1 2 inf, 0, 1, 1, 1 2 = 1 For s n = ( 1 2) n, and 4. By definition lim sup s n = lim N = lim N = lim = 0 lim inf s n = lim N ( { (1 ) N+1 sup, 2 ( sup 1 N 2 N+1 = lim N 0 = 0. { 1 2 N+1, 1 2 N+2, ( { (1 ) N+1 inf, 2 ( ) }) N+2 1, 2 }) ( ) }) N+2 1, 2 lim sup (x n + y n ) = lim N (sup {x n + y n : n > N}).
66 Since sup {x n + y n : n > N} is the lowest upper bound for the set {x n + y n : n > N} and since sup {x n : n > N} + sup {y n : n > N} is an upperbound for {x n + y n : n > N}, it follows that Thus, sup {x n + y n : n > N} sup {x n : n > N} + sup {y n : n > N}. lim sup (x n + y n ) lim (sup {x n : n > N} + sup {y n : n > N}) N lim (sup {x n : n > N}) + lim (sup {y n : n > N}) N N lim sup (x n ) + lim sup (y n ). No, we do not have equality in general. Here is an example. Let Using the definition of lim sup, we obtain However, Here, x n = ( 1) n and y n = ( 1) n+1. lim sup x n = 1 and lim sup y n = 1. ( { }) lim sup x n + y n = lim sup ( 1) n + ( 1) n+1 : n > N N = lim 0 N = 0. 0 = lim sup x n + y n < lim sup (x n ) + lim sup (y n ) = 2. We have a strict inequality! Now, can you make another example? 5. Let n and m be natural numbers. Then s n s m = 2n + 1 n + 1 2m + 1 m + 1 m n = (m + 1) (n + 1) m + n (m + 1) (n + 1) m + n mn = 1 n + 1 m For any ɛ > 0, let n, m > N = 2 ɛ. Then if Thus, the sequence s n = ( ) 2n+1 n+s n N s n s m 1 n + 1 m < ɛ 2 + ɛ 2 = ɛ. is Cauchy.
67 6. (( s 2n s n = ) ( 1 + n n )) ( n ) n = 1 n n 1 n + n + 1 n + n + 1 ( ) 2n 1 = n = 1 2n 2. Thus, for ɛ = 1 2 and for any given N, we have n > N and s 2n s n 1 2. Clearly, this implies that the sequence (s n ) is not Cauchy. By Theorem 10.11, the sequence is not convergent.
68 Solutions Homework Set 7 1. Let (a n ) n2n be a sequence of real numbers. Let a 2 R: Then there is a positive number, such that for any given real number N; there exists a natural number n such that n > N and Next, let ja n aj : (N 1 ; N 2 ; ; N k ; N k+1 ; ) be a sequence of increasing real numbers. For each natural number k; we choose n k 2 N such that n k > N k : By assumption, it follows that ja nk aj for every natural number k: 2. The statement is true. Indeed, since the sequence (sin (n)) n2n is a bounded sequence, appealing to Bolzano-Weierstrass theorem, it follows that there exists a subsequence (sin n k ) k2n which is convergent. 3. The statement is true. Let (a n ) n2n be a sequence of real numbers. Given a natural number n ja n j < 1 + ja n j : Dividing each side of the inequality above by 1 + ja n j yields ja n j 1 + ja n j < 1 + ja nj 1 + ja n j = 1: Thus the sequence jan j 1 + ja n j n2n is bounded. As such, it admits a convergent subsequence. 4. Let us de ne s n = a ( 1) n + b + 1 n : Next, we verify that lim s 2n = a + b and lim s 2n+1 = a + b: 1
69 Now, solving the system of equations a + b = 1 a + b = 0 we obtain a = 1; b = 1 : The desired result follows then if 2 2 s n = 1 2 ( 1)n n : 5. Let us assume that (a n ) n2n is a bounded sequence. First, we observe that every subsequence of (a n ) n2n is bounded. Next, applying the Bolzano Weierstrass theorem to any xed subsequence of (a n ) n2n, we may safely assert that every subsequence of the given sequence has a convergent subsequence. Secondly, in order to prove the converse of the result, let us suppose that (a n ) n2n is unbounded. Assume that the sequence (a n ) n2n is not bounded above. That is given any real number M > 0 there is a natural number n such that a n > M: Now, choose an increasing sequence 0 < M 1 < M 2 < of real numbers. For a xed natural number k; there is a natural number n k such that a nk > M k : Thus clearly, the subsequence (a n1 ; a n2 ; ) is divergent. Next, assume that the sequence (a n ) n2n is not bounded below. That is given any real number M < 0 there is a natural number n such that a n < M: Now, let us choose a decreasing sequence of real numbers satisfying the conditions 0 > M 1 > M 2 > For a xed natural number k there is a corresponding natural number n k such that a nk < M k : It follows that the subsequence (a n1 ; a n2 ; ) is divergent. This completes the proof. 2
70 Solutions Homework Set 7 1. We consider the subsequence (t k ) given by ( ) 2π (7k + 1) t k = s 7k+1 = cos 7 ( ) 2π (7k) 2π (1) = cos ( = cos 2πk + 2π ) ( ) 2π = cos. 7 7 Clearly, (t k ) is a monotonic sequence, since it is constant. 2. (a) If n = 3k then If n = 3k + 1 then If n = 3k + 2 then ( ) 2πn cos = 1 3 ( ) 2πn cos = cos 3 ( ) 2πn cos = cos 3 ( ) 2π = ( ) 4π = Thus, the set of subsequential limits of (s n ) n N is given by { 1, 1 } 2 (b) { lim sup s n = sup 1, 1 } = 1 2 { lim inf s n = inf 1, 1 } = (c) Since lim sup s n = lim inf s n, the sequence is not convergent. 3. (a) The set of subsequential limits of (s n ) n N is { 5, 1 }. 5 1
71 (b) { lim sup s n = sup 5, 1 } = 5 5 { lim inf s n = inf 5, 1 } = (c) Since lim sup s n = lim inf s n, the sequence is not convergent. 4. lim sup (ks n ) = lim N sup {ks n : n > N} = lim (k sup {s n : n > N}) N ( ) = k lim sup {s n : n > N} N = k lim sup s n 2
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
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 informationCopyright 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 informationFINAL EXAM Math 25 Temple-F06
FINAL EXAM Math 25 Temple-F06 Write solutions on the paper provided. Put your name on this exam sheet, and staple it to the front of your finished exam. Do Not Write On This Exam Sheet. Problem 1. (Short
More informationHomework 4, 5, 6 Solutions. > 0, and so a n 0 = n + 1 n = ( n+1 n)( n+1+ n) 1 if n is odd 1/n if n is even diverges.
2..2(a) lim a n = 0. Homework 4, 5, 6 Solutions Proof. Let ɛ > 0. Then for n n = 2+ 2ɛ we have 2n 3 4+ ɛ 3 > ɛ > 0, so 0 < 2n 3 < ɛ, and thus a n 0 = 2n 3 < ɛ. 2..2(g) lim ( n + n) = 0. Proof. Let ɛ >
More informationMath 104: Homework 7 solutions
Math 04: Homework 7 solutions. (a) The derivative of f () = is f () = 2 which is unbounded as 0. Since f () is continuous on [0, ], it is uniformly continous on this interval by Theorem 9.2. Hence for
More informationSequences. 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 informationSubsequences and the Bolzano-Weierstrass Theorem
Subsequences and the Bolzano-Weierstrass Theorem A subsequence of a sequence x n ) n N is a particular sequence whose terms are selected among those of the mother sequence x n ) n N The study of subsequences
More informationMath 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 informationEcon Slides from Lecture 1
Econ 205 Sobel Econ 205 - Slides from Lecture 1 Joel Sobel August 23, 2010 Warning I can t start without assuming that something is common knowledge. You can find basic definitions of Sets and Set Operations
More informationMATH 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 information2.7 Subsequences. Definition Suppose that (s n ) n N is a sequence. Let (n 1, n 2, n 3,... ) be a sequence of natural numbers such that
2.7 Subsequences Definition 2.7.1. Suppose that (s n ) n N is a sequence. Let (n 1, n 2, n 3,... ) be a sequence of natural numbers such that n 1 < n 2 < < n k < n k+1
More informationMATH 301 INTRO TO ANALYSIS FALL 2016
MATH 301 INTRO TO ANALYSIS FALL 016 Homework 04 Professional Problem Consider the recursive sequence defined by x 1 = 3 and +1 = 1 4 for n 1. (a) Prove that ( ) converges. (Hint: show that ( ) is decreasing
More informationWeek 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 informationHomework 3 Solutions, Math 55
Homework 3 Solutions, Math 55 1.8.4. There are three cases: that a is minimal, that b is minimal, and that c is minimal. If a is minimal, then a b and a c, so a min{b, c}, so then Also a b, so min{a, b}
More informationMATH 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 informationMATH 271 Summer 2016 Practice problem solutions Week 1
Part I MATH 271 Summer 2016 Practice problem solutions Week 1 For each of the following statements, determine whether the statement is true or false. Prove the true statements. For the false statement,
More informationUndergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics
Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics An Introductory Single Variable Real Analysis: A Learning Approach through Problem Solving Marcel B. Finan c All Rights
More informationmeans is a subset of. So we say A B for sets A and B if x A we have x B holds. BY CONTRAST, a S means that a is a member of S.
1 Notation For those unfamiliar, we have := means equal by definition, N := {0, 1,... } or {1, 2,... } depending on context. (i.e. N is the set or collection of counting numbers.) In addition, means for
More informationMIDTERM REVIEW FOR MATH The limit
MIDTERM REVIEW FOR MATH 500 SHUANGLIN SHAO. The limit Define lim n a n = A: For any ε > 0, there exists N N such that for any n N, a n A < ε. The key in this definition is to realize that the choice of
More informationMath 430/530: Advanced Calculus I Chapter 1: Sequences
Math 430/530: Advanced Calculus I Chapter 1: Sequences Fall 2018 Sequences A sequence is just a list of real numbers a 1, a 2,... with a definite order. We write a = (a n ) n=1 for a sequence a with n
More informationMathematics 242 Principles of Analysis Solutions for Problem Set 5 Due: March 15, 2013
Mathematics Principles of Analysis Solutions for Problem Set 5 Due: March 15, 013 A Section 1. For each of the following sequences, determine three different subsequences, each converging to a different
More informationMATH 101, FALL 2018: SUPPLEMENTARY NOTES ON THE REAL LINE
MATH 101, FALL 2018: SUPPLEMENTARY NOTES ON THE REAL LINE SEBASTIEN VASEY These notes describe the material for November 26, 2018 (while similar content is in Abbott s book, the presentation here is different).
More informationScalar multiplication and addition of sequences 9
8 Sequences 1.2.7. Proposition. Every subsequence of a convergent sequence (a n ) n N converges to lim n a n. Proof. If (a nk ) k N is a subsequence of (a n ) n N, then n k k for every k. Hence if ε >
More informationDefinition 2.1. A metric (or distance function) defined on a non-empty set X is a function d: X X R that satisfies: For all x, y, and z in X :
MATH 337 Metric Spaces Dr. Neal, WKU Let X be a non-empty set. The elements of X shall be called points. We shall define the general means of determining the distance between two points. Throughout we
More informationMATH 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 informationSection 11.1 Sequences
Math 152 c Lynch 1 of 8 Section 11.1 Sequences A sequence is a list of numbers written in a definite order: a 1, a 2, a 3,..., a n,... Notation. The sequence {a 1, a 2, a 3,...} can also be written {a
More informationWe are going to discuss what it means for a sequence to converge in three stages: First, we define what it means for a sequence to converge to zero
Chapter Limits of Sequences Calculus Student: lim s n = 0 means the s n are getting closer and closer to zero but never gets there. Instructor: ARGHHHHH! Exercise. Think of a better response for the instructor.
More informationSolutions for Homework Assignment 2
Solutions for Homework Assignment 2 Problem 1. If a,b R, then a+b a + b. This fact is called the Triangle Inequality. By using the Triangle Inequality, prove that a b a b for all a,b R. Solution. To prove
More information(3,1) Methods of Proof
King Saud University College of Sciences Department of Mathematics 151 Math Exercises (3,1) Methods of Proof 1-Direct Proof 2- Proof by Contraposition 3- Proof by Contradiction 4- Proof by Cases By: Malek
More informationMA103 Introduction to Abstract Mathematics Second part, Analysis and Algebra
206/7 MA03 Introduction to Abstract Mathematics Second part, Analysis and Algebra Amol Sasane Revised by Jozef Skokan, Konrad Swanepoel, and Graham Brightwell Copyright c London School of Economics 206
More informationAdvanced 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 informationIn 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 informationMath 140: Foundations of Real Analysis. Todd Kemp
Math 140: Foundations of Real Analysis Todd Kemp Contents Part 1. Math 140A 5 Chapter 1. Ordered Sets, Ordered Fields, and Completeness 7 1. Lecture 1: January 5, 2016 7 2. Lecture 2: January 7, 2016
More informationMath 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 informationIntroduction to Analysis in One Variable. Michael E. Taylor
Introduction to Analysis in One Variable Michael E. Taylor 1 2 Contents Chapter I. Numbers 1. Peano arithmetic 2. The integers 3. Prime factorization and the fundamental theorem of arithmetic 4. The rational
More informationSolutions 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 informationNumerical Sequences and Series
Numerical Sequences and Series Written by Men-Gen Tsai email: b89902089@ntu.edu.tw. Prove that the convergence of {s n } implies convergence of { s n }. Is the converse true? Solution: Since {s n } is
More informationFrom 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 informationProof by Contradiction
Proof by Contradiction MAT231 Transition to Higher Mathematics Fall 2014 MAT231 (Transition to Higher Math) Proof by Contradiction Fall 2014 1 / 12 Outline 1 Proving Statements with Contradiction 2 Proving
More informationMidterm 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 informationWe are now going to go back to the concept of sequences, and look at some properties of sequences in R
4 Lecture 4 4. Real Sequences We are now going to go back to the concept of sequences, and look at some properties of sequences in R Definition 3 A real sequence is increasing if + for all, and strictly
More informationProof. 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 informationMath 163 (23) - Midterm Test 1
Name: Id #: Math 63 (23) - Midterm Test Spring Quarter 208 Friday April 20, 09:30am - 0:20am Instructions: Prob. Points Score possible 26 2 4 3 0 TOTAL 50 Read each problem carefully. Write legibly. Show
More information1 + 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 informationSolution Set 2. Problem 1. [a] + [b] = [a + b] = [b + a] = [b] + [a] ([a] + [b]) + [c] = [a + b] + [c] = [a + b + c] = [a] + [b + c] = [a] + ([b + c])
Solution Set Problem 1 (1) Z/nZ is the set of equivalence classes of Z mod n. Equivalence is determined by the following rule: [a] = [b] if and only if b a = k n for some k Z. The operations + and are
More informationMATH CSE20 Homework 5 Due Monday November 4
MATH CSE20 Homework 5 Due Monday November 4 Assigned reading: NT Section 1 (1) Prove the statement if true, otherwise find a counterexample. (a) For all natural numbers x and y, x + y is odd if one of
More informationContinuity. Chapter 4
Chapter 4 Continuity Throughout this chapter D is a nonempty subset of the real numbers. We recall the definition of a function. Definition 4.1. A function from D into R, denoted f : D R, is a subset of
More informationProblem List MATH 5143 Fall, 2013
Problem List MATH 5143 Fall, 2013 On any problem you may use the result of any previous problem (even if you were not able to do it) and any information given in class up to the moment the problem was
More informationMeasure and Integration: Solutions of CW2
Measure and Integration: s of CW2 Fall 206 [G. Holzegel] December 9, 206 Problem of Sheet 5 a) Left (f n ) and (g n ) be sequences of integrable functions with f n (x) f (x) and g n (x) g (x) for almost
More information1 Homework. Recommended Reading:
Analysis MT43C Notes/Problems/Homework Recommended Reading: R. G. Bartle, D. R. Sherbert Introduction to real analysis, principal reference M. Spivak Calculus W. Rudin Principles of mathematical analysis
More informationEcon Lecture 3. Outline. 1. Metric Spaces and Normed Spaces 2. Convergence of Sequences in Metric Spaces 3. Sequences in R and R n
Econ 204 2011 Lecture 3 Outline 1. Metric Spaces and Normed Spaces 2. Convergence of Sequences in Metric Spaces 3. Sequences in R and R n 1 Metric Spaces and Metrics Generalize distance and length notions
More informationSolutions 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 informationMath 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 informationMath Homework # 4
Math 446 - Homework # 4 1. Are the following statements true or false? (a) 3 5(mod 2) Solution: 3 5 = 2 = 2 ( 1) is divisible by 2. Hence 2 5(mod 2). (b) 11 5(mod 5) Solution: 11 ( 5) = 16 is NOT divisible
More informationDefinitions & Theorems
Definitions & Theorems Math 147, Fall 2009 December 19, 2010 Contents 1 Logic 2 1.1 Sets.................................................. 2 1.2 The Peano axioms..........................................
More informationMath 140A - Fall Final Exam
Math 140A - Fall 2014 - Final Exam Problem 1. Let {a n } n 1 be an increasing sequence of real numbers. (i) If {a n } has a bounded subsequence, show that {a n } is itself bounded. (ii) If {a n } has a
More informationT H O M A S D E M U Y N C K M AT H - S M AT H E M AT I C S A N D E C O N O M I C M O D E L L I N G
T H O M A S D E M U Y N C K M AT H - S - 4 0 0 M AT H E M AT I C S A N D E C O N O M I C M O D E L L I N G Contents Logic and proofs 5 Sequences and limits 19 Functions 41 Extreme and intermediate value
More informationC.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 informationMATH 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 informationLogical 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 informationRead carefully the instructions on the answer book and make sure that the particulars required are entered on each answer book.
THE UNIVERSITY OF WARWICK FIRST YEAR EXAMINATION: January 2011 Analysis I Time Allowed: 1.5 hours Read carefully the instructions on the answer book and make sure that the particulars required are entered
More informationSequences. 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 informationChapter 1 The Real Numbers
Chapter 1 The Real Numbers In a beginning course in calculus, the emphasis is on introducing the techniques of the subject;i.e., differentiation and integration and their applications. An advanced calculus
More informationMATH NEW HOMEWORK AND SOLUTIONS TO PREVIOUS HOMEWORKS AND EXAMS
MATH. 4433. NEW HOMEWORK AND SOLUTIONS TO PREVIOUS HOMEWORKS AND EXAMS TOMASZ PRZEBINDA. Final project, due 0:00 am, /0/208 via e-mail.. State the Fundamental Theorem of Algebra. Recall that a subset K
More informationMA131 - Analysis 1. Workbook 6 Completeness II
MA3 - Analysis Workbook 6 Completeness II Autumn 2004 Contents 3.7 An Interesting Sequence....................... 3.8 Consequences of Completeness - General Bounded Sequences.. 3.9 Cauchy Sequences..........................
More informationh(x) lim H(x) = lim Since h is nondecreasing then h(x) 0 for all x, and if h is discontinuous at a point x then H(x) > 0. Denote
Real Variables, Fall 4 Problem set 4 Solution suggestions Exercise. Let f be of bounded variation on [a, b]. Show that for each c (a, b), lim x c f(x) and lim x c f(x) exist. Prove that a monotone function
More informationSequences. We know that the functions can be defined on any subsets of R. As the set of positive integers
Sequences We know that the functions can be defined on any subsets of R. As the set of positive integers Z + is a subset of R, we can define a function on it in the following manner. f: Z + R f(n) = a
More informationReal 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 informationa) Let x,y be Cauchy sequences in some metric space. Define d(x, y) = lim n d (x n, y n ). Show that this function is well-defined.
Problem 3) Remark: for this problem, if I write the notation lim x n, it should always be assumed that I mean lim n x n, and similarly if I write the notation lim x nk it should always be assumed that
More informationContinuity. Chapter 4
Chapter 4 Continuity Throughout this chapter D is a nonempty subset of the real numbers. We recall the definition of a function. Definition 4.1. A function from D into R, denoted f : D R, is a subset of
More informationINTRODUCTION 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 informationBernoulli 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 informationMATH 152 Problem set 6 solutions
MATH 52 Problem set 6 solutions. Z[ 2] is a Euclidean domain (i.e. has a division algorithm): the idea is to approximate the quotient by an element in Z[ 2]. More precisely, let a+b 2, c+d 2 Z[ 2] (of
More informationSolutions to Homework Assignment 2
Solutions to Homework Assignment Real Analysis I February, 03 Notes: (a) Be aware that there maybe some typos in the solutions. If you find any, please let me know. (b) As is usual in proofs, most problems
More informationMATH10040: Numbers and Functions Homework 1: Solutions
MATH10040: Numbers and Functions Homework 1: Solutions 1. Prove that a Z and if 3 divides into a then 3 divides a. Solution: The statement to be proved is equivalent to the statement: For any a N, if 3
More informationA lower bound for X is an element z F such that
Math 316, Intro to Analysis Completeness. Definition 1 (Upper bounds). Let F be an ordered field. For a subset X F an upper bound for X is an element y F such that A lower bound for X is an element z F
More informationChapter 11: Sequences; Indeterminate Forms; Improper Integrals
Chapter 11: Sequences; Indeterminate Forms; Improper Integrals Section 11.1 The Least Upper Bound Axiom a. Least Upper Bound Axiom b. Examples c. Theorem 11.1.2 d. Example e. Greatest Lower Bound f. Theorem
More informationA 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 informationChapter 2. Real Numbers. 1. Rational Numbers
Chapter 2. Real Numbers 1. Rational Numbers A commutative ring is called a field if its nonzero elements form a group under multiplication. Let (F, +, ) be a filed with 0 as its additive identity element
More informationIn 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 informationMath 319 Problem Set #2 Solution 14 February 2002
Math 39 Problem Set # Solution 4 February 00. (.3, problem 8) Let n be a positive integer, and let r be the integer obtained by removing the last digit from n and then subtracting two times the digit ust
More informationMATH 409 Advanced Calculus I Lecture 10: Continuity. Properties of continuous functions.
MATH 409 Advanced Calculus I Lecture 10: Continuity. Properties of continuous functions. Continuity Definition. Given a set E R, a function f : E R, and a point c E, the function f is continuous at c if
More informationMathematics 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 informationNotes 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 informationLimit and Continuity
Limit and Continuity Table of contents. Limit of Sequences............................................ 2.. Definitions and properties...................................... 2... Definitions............................................
More informationMath 361: Homework 1 Solutions
January 3, 4 Math 36: Homework Solutions. We say that two norms and on a vector space V are equivalent or comparable if the topology they define on V are the same, i.e., for any sequence of vectors {x
More informationM17 MAT25-21 HOMEWORK 6
M17 MAT25-21 HOMEWORK 6 DUE 10:00AM WEDNESDAY SEPTEMBER 13TH 1. To Hand In Double Series. The exercises in this section will guide you to complete the proof of the following theorem: Theorem 1: Absolute
More informationCSE 215: Foundations of Computer Science Recitation Exercises Set #5 Stony Brook University. Name: ID#: Section #: Score: / 4
CSE 215: Foundations of Computer Science Recitation Exercises Set #5 Stony Brook University Name: ID#: Section #: Score: / 4 Unit 10: Proofs by Contradiction and Contraposition 1. Prove the following statement
More informationMath 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 informationNotes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr.
Notes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr. Chapter : Logic Topics:. Statements, Negation, and Compound Statements.2 Truth Tables and Logical Equivalences.3
More informationFirst In-Class Exam Solutions Math 410, Professor David Levermore Monday, 1 October 2018
First In-Class Exam Solutions Math 40, Professor David Levermore Monday, October 208. [0] Let {b k } k N be a sequence in R and let A be a subset of R. Write the negations of the following assertions.
More informationA-2. Polynomials and Factoring. Section A-2 1
A- Polynomials and Factoring Section A- 1 What you ll learn about Adding, Subtracting, and Multiplying Polynomials Special Products Factoring Polynomials Using Special Products Factoring Trinomials Factoring
More informationThe Heine-Borel and Arzela-Ascoli Theorems
The Heine-Borel and Arzela-Ascoli Theorems David Jekel October 29, 2016 This paper explains two important results about compactness, the Heine- Borel theorem and the Arzela-Ascoli theorem. We prove them
More informationSolutions, Project on p-adic Numbers, Real Analysis I, Fall, 2010.
Solutions, Project on p-adic Numbers, Real Analysis I, Fall, 2010. (24) The p-adic numbers. Let p {2, 3, 5, 7, 11,... } be a prime number. (a) For x Q, define { 0 for x = 0, x p = p n for x = p n (a/b),
More informationNumber Theory. Final Exam from Spring Solutions
Number Theory. Final Exam from Spring 2013. Solutions 1. (a) (5 pts) Let d be a positive integer which is not a perfect square. Prove that Pell s equation x 2 dy 2 = 1 has a solution (x, y) with x > 0,
More informationMAT 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 informationPrinciple of Mathematical Induction
Advanced Calculus I. Math 451, Fall 2016, Prof. Vershynin Principle of Mathematical Induction 1. Prove that 1 + 2 + + n = 1 n(n + 1) for all n N. 2 2. Prove that 1 2 + 2 2 + + n 2 = 1 n(n + 1)(2n + 1)
More informationNotes 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 informationAlgebra Summer Review Packet
Name: Algebra Summer Review Packet About Algebra 1: Algebra 1 teaches students to think, reason, and communicate mathematically. Students use variables to determine solutions to real world problems. Skills
More informationUNIVERSITY OF CALICUT SCHOOL OF DISTANCE EDUCATION CORE COURSE. B.Sc. MATHEMATICS V SEMESTER. (2011 Admission onwards) BASIC MATHEMATICAL ANALYSIS
UNIVERSITY OF CALICUT SCHOOL OF DISTANCE EDUCATION CORE COURSE B.Sc. MATHEMATICS V SEMESTER (2011 Admission onwards) BASIC MATHEMATICAL ANALYSIS QUESTION BANK 1. Find the number of elements in the power
More information