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

Size: px
Start display at page:

Download "Homework 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."

Transcription

1 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 ɛ > 0. Then for n n = we have 2 n 4ɛ 2 ɛ > 0, and so a n 0 = n + n = ( n+ n)( n++ n) n++ n = n++ n < 2 n ɛ. 2..2(k) The sequence a n = { if n is odd /n if n is even diverges. Proof. Assume not. Then the sequence converges to some limit A R. By definition of convergence (with ɛ = /4) there exists n such that a n A < /4 for n n. Choose an integer k n /2. Then 2k n and 2k + n, so a 2k A < /4 and a 2k+ A < /4. So /(2k) A < /4 and A < /4. The second inequality implies A > 3/4, and the first one A < /(2k) + /4 /2 + /4 = 3/4. This is a contradiction, so the statement is proved If lim a 2n = A and lim a 2n = A, then lim a n = A. Proof. Let ɛ > 0. Then there exist n and n 2 such that a 2n A < ɛ for n n and a 2n A < ɛ for n n 2. Let n = max(2n, 2n 2 ), and let n n be arbitrary. If n is even, then there exists k N such that n = 2k. Since n n 2n we get that k n, and thus a n A = a 2k A < ɛ. If n is odd, then there exists k N such that n = 2k. Since n n 2n 2, we get k n 2, and thus a n A = a 2k A < ɛ. Every number n is either even or odd, so we have proved the claim. The converse is also true: If lim a n = A, then lim a 2n = lim a 2n = A. Proof. Let ɛ > 0. Then there exists n such that a n A < ɛ for n n. For n n = (n + )/2 we get 2n 2n n and thus a 2n A < ɛ and a 2n A < ɛ. This shows the claim. The first direction helps with 2(j), since lim a 2n = lim /(2n) = 0 and lim a 2n = 0, so the results implies that the sequence converges to 0.

2 2 The converse helps with 2(k), since lim a 2n = lim /(2n) = 0 and lim a 2n =. If the sequence would converge, these two limits would have to be the same. Since they are different, the sequence itself diverges If {a n } converges to A, then the sequence {b n } defined by b n = (a n + a n+ )/2 converges to A, too. Proof. Let ɛ > 0. Then there exists n such that a n A < ɛ for n n. Then b n A = (a n + a n+ )/2 A = (a n A) + (a n+ A) /2 a n A /2 + a n+ A /2 < ɛ/2 + ɛ/2 = ɛ for n n Consider sequences {a n } and {b n }, where b n = n a n. (a) If {b n } converges to, does the sequence {a n } necessarily converge? No. Example is a n = n, b n = n n. (b) If {b n } converges to, does the sequence {a n } necessarily diverge? No. Example is a n = b n =. (c) Does {b n } have to converge to? No. Example is a n = b n = (c) lim = 0 by Theorem n r n 2.2.(d) lim n! = 0. Proof. We will write a n = rn n!. Choose n N with n r. Let M = a n = r n = r n! r 2 r. n We first claim that a n M for all n n. Proof by induction: The case n = n is immediate by definition of M. Now if we already know the claim for some n n, then a n+ = r n+ (n + )! = r n n! r n + M r n + M. (We used n+ n r in the last inequality, and the induction hypothesis in the second-to-last inequality.) Now let n > n be arbitrary. Then n n, so r n (n )! M, and thus a n = r n n! = r n (n )! r n M r n. M r We know that lim n = 0. The squeeze theorem then implies that {a n } converges to 0, too. n 2.2.(i) lim n + n =.

3 Proof. This follows from the squeeze theorem, the estimate n n + n n 2n = n 2 n n n, and lim 2 = lim n n = (a) Suppose that {a n } and {a n b n } both converge, and a n 0 for large n. Is it true that {b n } must converge? No. Example: a n = /n, b n = n (b) Suppose that {a n } converges to a non-zero number and {a n b n } converges. Prove that {b n } must also converge. Proof. This follows immediately from the limit theorems. Let A = lim a n and C = lim a nb n. Then b n = anbn a n is the quotient of two convergent sequences, where the denominator converges to a non-zero limit. From Theorem 2.2.(c) we get that {b n } converges to C/A (a) Is it possible to have an unbounded sequence {a n } such that lim a n/n = 0? Yes. Example a n = n (b) Prove that if the sequence {a n } satisfies lim a n/n = L 0, then {a n } is unbounded. Proof. Assume not. Then there exists M such that a n M for all n, and thus a n /n M/n. We know lim M/n = 0, and the squeeze theorem implies lim a n/n = 0, contradicting the assumption If 0 α β, then lim n α n + β n = β. Proof. This is again the squeeze theorem. We know β n α n + β n 2β n, so β n α n + β n n n 2 β. In class we proved lim 2 =, so the sequence in the middle of the inequalities also has to converge to β Prove the Comparison Theorem: If {a n } diverges to +, and a n b n for n n, then {b n } also diverges to +. Proof. Let M > 0 be arbitrary. Then there exists n 2 such that a n > M for n n 2. For n n = max(n, n 2 ) we get b n a n > M (a) Prove that a n = (n 2 + )/(n 2) diverges to +. Proof. For n 3 we have a n n 2 /n = n, and we already know that lim n = +. By comparison theorem {a n} diverges to +, too.

4 Give an example of a sequence that diverges to + but is not eventually increasing. a n = n + ( ) n Give an example of a converging sequence that does not attain a maximum value. a n = /n. 2.4.(a) Let the sequence {a n } be recursively defined by a = 6 and a n+ = 6 + a n for n N. Find the limit if it exists. First claim: The sequence is increasing. Proof by induction: a 2 = = a. Assume that we know a n+ a n. Then a n+2 = 6 + a n+ 6 + an = a n+. Second claim: The sequence is bounded by 30. Proof by induction: a = If we know an 30, then a n+ = 6 + a n = We know that monotone bounded sequences converge, so there exists some limit A R. We can pass to the limit in the recursive equation to get A = lim a n+ = lim 6 + an = 6 + A by limit theorems. From the equation A = 6 + A we see that A 0, and that A 2 = 6 + A. The two solutions of this equation are 2 and 3, and since A 0, we get A = (g) Same question as previous problem for a = and a n+ = + a n /2. First claim: The sequence is increasing. Proof by induction: a 2 = + /2 = a. Assuming that we know a n+ a n, we get a n+2 = + a n+ /2 + a n /2 = a n+. Second claim: The sequence is bounded by 30. Proof by induction: a = 30. Assuming we know a n 30, we get a n+ = + a n /2 + 30/2 = Again we know that the sequence converges to some limit A R because it is monotone and bounded. Passing to the limit in the recursive equation we get A = lim a n+ = lim ( + a n/2) = + A/2 by limit theorems. The equation A = + A/2 has only one solution A = 2, so the limit is Let s 0 be an accumulation point of S. Prove that the following two statements are equivalent. (a) Any neighborhood of s 0 contains at least one point of S different from s 0. (b) Any neighborhood of s 0 contains infinitely many points of S. The statement of this problem is unfortunately slightly screwed up. Kosmala assumes from the outset that s 0 is an accumulation point. Then (a) is always true, since it is the definition of accumulation points. So the direction (b)

5 implies (a) is trivial, since (a) is true. It would also make both of these statements equivalent to completely unrelated true statements such as (c) The angle sum in a Euclidean triangle is π. We will show that (a) is equivalent to (b) for any s 0 R, without any assumptions about s 0 being an accumulation point. Proof. (b) = (a): Let ɛ > 0 be arbitrary. Then (s 0 ɛ, s 0 + ɛ) contains infinitely many points of S, so it contains at least two different points s, s 2 S. If s s 0, we have found a point of S in the neighborhood different from s 0. Otherwise we have s 2 s = s 0, so s 2 is the desired point. (a) = (b): Assume not. Then there exists ɛ > 0 such that the neighborhood (s 0 ɛ, s 0 + ɛ) contains only finitely many points of S. Denote this finite set of points by T, and let D = { s s 0 : s T, s s 0 } {ɛ}. The set D is finite (since T is finite) and non-empty (ɛ D), and all the numbers in D are positive. So ɛ = min D > 0 exists. Claim: There are no points of S different from s 0 in the neighborhood (s 0 ɛ, s 0 + ɛ ). Assume not. Then there exists s S (s 0 ɛ, s 0 + ɛ ) with s s 0. This implies 0 < s s 0 < ɛ ɛ, so s T. By definition s s 0 D, and thus ɛ s s 0. However, this contradicts s s 0 < ɛ. This contradiction proves the claim, and the claim itself contradicts (a), finishing the proof of this direction (a) Give an example of a sequence for which the set S = {a n : n N} has exactly two accumulation points. a n = ( ) n ( /n), accumulation points and (b) Give an example of a set S that contains infinitely many points but not every point of S is an accumulation point of S (c) Give an example of a set S where both sup S and exactly one accumulation point exist, but the values are not equal (d) Give an example of a set S where inf S and sup S are in S, but the accumulation point (points) is (are) not. Example for (b), (c), and (d): S = {( ) n /n : n N}. This set contains infinitely many points, the only accumulation point 0 is not in S, and both sup S = /2 and inf S = are in S. 5

Numerical Sequences and Series

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

Section 11.1 Sequences

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

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

M17 MAT25-21 HOMEWORK 6

M17 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 information

Solutions to Homework Assignment 2

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

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

Math 104: Homework 7 solutions

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

Sequences of Real Numbers

Sequences of Real Numbers Chapter 8 Sequences of Real Numbers In this chapter, we assume the existence of the ordered field of real numbers, though we do not yet discuss or use the completeness of the real numbers. In the next

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

This exam contains 5 pages (including this cover page) and 4 questions. The total number of points is 100. Grade Table

This exam contains 5 pages (including this cover page) and 4 questions. The total number of points is 100. Grade Table MAT25-2 Summer Session 2 207 Practice Final August 24th, 207 Time Limit: Hour 40 Minutes Name: Instructor: Nathaniel Gallup This exam contains 5 pages (including this cover page) and 4 questions. The total

More information

MATH 301 INTRO TO ANALYSIS FALL 2016

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

We 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

We 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 information

,... We would like to compare this with the sequence y n = 1 n

,... We would like to compare this with the sequence y n = 1 n Example 2.0 Let (x n ) n= be the sequence given by x n = 2, i.e. n 2, 4, 8, 6,.... We would like to compare this with the sequence = n (which we know converges to zero). We claim that 2 n n, n N. Proof.

More information

Continuity. Chapter 4

Continuity. 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 information

MATH 101, FALL 2018: SUPPLEMENTARY NOTES ON THE REAL LINE

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

Mid Term-1 : Practice problems

Mid Term-1 : Practice problems Mid Term-1 : Practice problems These problems are meant only to provide practice; they do not necessarily reflect the difficulty level of the problems in the exam. The actual exam problems are likely to

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

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

Infinite Series. Copyright Cengage Learning. All rights reserved.

Infinite Series. Copyright Cengage Learning. All rights reserved. Infinite Series Copyright Cengage Learning. All rights reserved. Sequences Copyright Cengage Learning. All rights reserved. Objectives List the terms of a sequence. Determine whether a sequence converges

More information

Set, functions and Euclidean space. Seungjin Han

Set, functions and Euclidean space. Seungjin Han Set, functions and Euclidean space Seungjin Han September, 2018 1 Some Basics LOGIC A is necessary for B : If B holds, then A holds. B A A B is the contraposition of B A. A is sufficient for B: If A holds,

More information

Homework #2 Solutions Due: September 5, for all n N n 3 = n2 (n + 1) 2 4

Homework #2 Solutions Due: September 5, for all n N n 3 = n2 (n + 1) 2 4 Do the following exercises from the text: Chapter (Section 3):, 1, 17(a)-(b), 3 Prove that 1 3 + 3 + + n 3 n (n + 1) for all n N Proof The proof is by induction on n For n N, let S(n) be the statement

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

Econ Slides from Lecture 1

Econ 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 information

Contribution of Problems

Contribution of Problems Exam topics 1. Basic structures: sets, lists, functions (a) Sets { }: write all elements, or define by condition (b) Set operations: A B, A B, A\B, A c (c) Lists ( ): Cartesian product A B (d) Functions

More information

Discrete Mathematics. Spring 2017

Discrete Mathematics. Spring 2017 Discrete Mathematics Spring 2017 Previous Lecture Principle of Mathematical Induction Mathematical Induction: rule of inference Mathematical Induction: Conjecturing and Proving Climbing an Infinite Ladder

More information

We are now going to go back to the concept of sequences, and look at some properties of sequences in R

We 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 information

MADHAVA MATHEMATICS COMPETITION, December 2015 Solutions and Scheme of Marking

MADHAVA MATHEMATICS COMPETITION, December 2015 Solutions and Scheme of Marking MADHAVA MATHEMATICS COMPETITION, December 05 Solutions and Scheme of Marking NB: Part I carries 0 marks, Part II carries 30 marks and Part III carries 50 marks Part I NB Each question in Part I carries

More information

Continuity. Chapter 4

Continuity. 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 information

FINAL EXAM Math 25 Temple-F06

FINAL 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 information

1 Homework. Recommended Reading:

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

Math 410 Homework 6 Due Monday, October 26

Math 410 Homework 6 Due Monday, October 26 Math 40 Homework 6 Due Monday, October 26. Let c be any constant and assume that lim s n = s and lim t n = t. Prove that: a) lim c s n = c s We talked about these in class: We want to show that for all

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

Read carefully the instructions on the answer book and make sure that the particulars required are entered on each answer book.

Read 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 information

EC 521 MATHEMATICAL METHODS FOR ECONOMICS. Lecture 1: Preliminaries

EC 521 MATHEMATICAL METHODS FOR ECONOMICS. Lecture 1: Preliminaries EC 521 MATHEMATICAL METHODS FOR ECONOMICS Lecture 1: Preliminaries Murat YILMAZ Boğaziçi University In this lecture we provide some basic facts from both Linear Algebra and Real Analysis, which are going

More information

HOMEWORK ASSIGNMENT 6

HOMEWORK ASSIGNMENT 6 HOMEWORK ASSIGNMENT 6 DUE 15 MARCH, 2016 1) Suppose f, g : A R are uniformly continuous on A. Show that f + g is uniformly continuous on A. Solution First we note: In order to show that f + g is uniformly

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

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

MT804 Analysis Homework II

MT804 Analysis Homework II MT804 Analysis Homework II Eudoxus October 6, 2008 p. 135 4.5.1, 4.5.2 p. 136 4.5.3 part a only) p. 140 4.6.1 Exercise 4.5.1 Use the Intermediate Value Theorem to prove that every polynomial of with real

More information

Iowa State University. Instructor: Alex Roitershtein Summer Exam #1. Solutions. x u = 2 x v

Iowa State University. Instructor: Alex Roitershtein Summer Exam #1. Solutions. x u = 2 x v Math 501 Iowa State University Introduction to Real Analysis Department of Mathematics Instructor: Alex Roitershtein Summer 015 Exam #1 Solutions This is a take-home examination. The exam includes 8 questions.

More information

Math 324 Summer 2012 Elementary Number Theory Notes on Mathematical Induction

Math 324 Summer 2012 Elementary Number Theory Notes on Mathematical Induction Math 4 Summer 01 Elementary Number Theory Notes on Mathematical Induction Principle of Mathematical Induction Recall the following axiom for the set of integers. Well-Ordering Axiom for the Integers If

More information

MATH 324 Summer 2011 Elementary Number Theory. Notes on Mathematical Induction. Recall the following axiom for the set of integers.

MATH 324 Summer 2011 Elementary Number Theory. Notes on Mathematical Induction. Recall the following axiom for the set of integers. MATH 4 Summer 011 Elementary Number Theory Notes on Mathematical Induction Principle of Mathematical Induction Recall the following axiom for the set of integers. Well-Ordering Axiom for the Integers If

More information

Solution of the 8 th Homework

Solution of the 8 th Homework Solution of the 8 th Homework Sangchul Lee December 8, 2014 1 Preinary 1.1 A simple remark on continuity The following is a very simple and trivial observation. But still this saves a lot of words in actual

More information

Calculus (Real Analysis I)

Calculus (Real Analysis I) Calculus (Real Analysis I) (MAT122β) Department of Mathematics University of Ruhuna A.W.L. Pubudu Thilan Department of Mathematics University of Ruhuna Calculus (Real Analysis I)(MAT122β) 1/172 Chapter

More information

2.2 Some Consequences of the Completeness Axiom

2.2 Some Consequences of the Completeness Axiom 60 CHAPTER 2. IMPORTANT PROPERTIES OF R 2.2 Some Consequences of the Completeness Axiom In this section, we use the fact that R is complete to establish some important results. First, we will prove that

More information

Infinite Continued Fractions

Infinite Continued Fractions Infinite Continued Fractions 8-5-200 The value of an infinite continued fraction [a 0 ; a, a 2, ] is lim c k, where c k is the k-th convergent k If [a 0 ; a, a 2, ] is an infinite continued fraction with

More information

Solution. 1 Solution of Homework 7. Sangchul Lee. March 22, Problem 1.1

Solution. 1 Solution of Homework 7. Sangchul Lee. March 22, Problem 1.1 Solution Sangchul Lee March, 018 1 Solution of Homework 7 Problem 1.1 For a given k N, Consider two sequences (a n ) and (b n,k ) in R. Suppose that a n b n,k for all n,k N Show that limsup a n B k :=

More information

Chapter 2. Real Numbers. 1. Rational Numbers

Chapter 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 information

Real Analysis - Notes and After Notes Fall 2008

Real Analysis - Notes and After Notes Fall 2008 Real Analysis - Notes and After Notes Fall 2008 October 29, 2008 1 Introduction into proof August 20, 2008 First we will go through some simple proofs to learn how one writes a rigorous proof. Let start

More information

Math 4317 : Real Analysis I Mid-Term Exam 1 25 September 2012

Math 4317 : Real Analysis I Mid-Term Exam 1 25 September 2012 Instructions: Answer all of the problems. Math 4317 : Real Analysis I Mid-Term Exam 1 25 September 2012 Definitions (2 points each) 1. State the definition of a metric space. A metric space (X, d) is set

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

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

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

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

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

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

means 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 information

Climbing an Infinite Ladder

Climbing an Infinite Ladder Section 5.1 Section Summary Mathematical Induction Examples of Proof by Mathematical Induction Mistaken Proofs by Mathematical Induction Guidelines for Proofs by Mathematical Induction Climbing an Infinite

More information

MA103 Introduction to Abstract Mathematics Second part, Analysis and Algebra

MA103 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 information

a) 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.

a) 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 information

Sequence. A list of numbers written in a definite order.

Sequence. A list of numbers written in a definite order. Sequence A list of numbers written in a definite order. Terms of a Sequence a n = 2 n 2 1, 2 2, 2 3, 2 4, 2 n, 2, 4, 8, 16, 2 n We are going to be mainly concerned with infinite sequences. This means we

More information

Real Variables: Solutions to Homework 3

Real Variables: Solutions to Homework 3 Real Variables: Solutions to Homework 3 September 3, 011 Exercise 0.1. Chapter 3, # : Show that the cantor set C consists of all x such that x has some triadic expansion for which every is either 0 or.

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

5.5 Deeper Properties of Continuous Functions

5.5 Deeper Properties of Continuous Functions 5.5. DEEPER PROPERTIES OF CONTINUOUS FUNCTIONS 195 5.5 Deeper Properties of Continuous Functions 5.5.1 Intermediate Value Theorem and Consequences When one studies a function, one is usually interested

More information

MATH 55 - HOMEWORK 6 SOLUTIONS. 1. Section = 1 = (n + 1) 3 = 2. + (n + 1) 3. + (n + 1) 3 = n2 (n + 1) 2.

MATH 55 - HOMEWORK 6 SOLUTIONS. 1. Section = 1 = (n + 1) 3 = 2. + (n + 1) 3. + (n + 1) 3 = n2 (n + 1) 2. MATH 55 - HOMEWORK 6 SOLUTIONS Exercise Section 5 Proof (a) P () is the statement ( ) 3 (b) P () is true since ( ) 3 (c) The inductive hypothesis is P (n): ( ) n(n + ) 3 + 3 + + n 3 (d) Assuming the inductive

More information

Continuity. Matt Rosenzweig

Continuity. Matt Rosenzweig Continuity Matt Rosenzweig Contents 1 Continuity 1 1.1 Rudin Chapter 4 Exercises........................................ 1 1.1.1 Exercise 1............................................. 1 1.1.2 Exercise

More information

Chapter 1 The Real Numbers

Chapter 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 information

Math 421, Homework #7 Solutions. We can then us the triangle inequality to find for k N that (x k + y k ) (L + M) = (x k L) + (y k M) x k L + y k M

Math 421, Homework #7 Solutions. We can then us the triangle inequality to find for k N that (x k + y k ) (L + M) = (x k L) + (y k M) x k L + y k M Math 421, Homework #7 Solutions (1) Let {x k } and {y k } be convergent sequences in R n, and assume that lim k x k = L and that lim k y k = M. Prove directly from definition 9.1 (i.e. don t use Theorem

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

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

Section 11.1: Sequences

Section 11.1: Sequences Section 11.1: Sequences In this section, we shall study something of which is conceptually simple mathematically, but has far reaching results in so many different areas of mathematics - sequences. 1.

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

CHAPTER 8: EXPLORING R

CHAPTER 8: EXPLORING R CHAPTER 8: EXPLORING R LECTURE NOTES FOR MATH 378 (CSUSM, SPRING 2009). WAYNE AITKEN In the previous chapter we discussed the need for a complete ordered field. The field Q is not complete, so we constructed

More information

A lower bound for X is an element z F such that

A 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 information

1 More concise proof of part (a) of the monotone convergence theorem.

1 More concise proof of part (a) of the monotone convergence theorem. Math 0450 Honors intro to analysis Spring, 009 More concise proof of part (a) of the monotone convergence theorem. Theorem If (x n ) is a monotone and bounded sequence, then lim (x n ) exists. Proof. (a)

More information

Bolzano Weierstrass Theorems I

Bolzano Weierstrass Theorems I Bolzano Weierstrass Theorems I James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University September 8, 2017 Outline The Bolzano Weierstrass Theorem Extensions

More information

Mathematics 242 Principles of Analysis Solutions for Problem Set 5 Due: March 15, 2013

Mathematics 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 information

Analysis III. Exam 1

Analysis III. Exam 1 Analysis III Math 414 Spring 27 Professor Ben Richert Exam 1 Solutions Problem 1 Let X be the set of all continuous real valued functions on [, 1], and let ρ : X X R be the function ρ(f, g) = sup f g (1)

More information

COMPLEX ANALYSIS TOPIC XVI: SEQUENCES. 1. Topology of C

COMPLEX ANALYSIS TOPIC XVI: SEQUENCES. 1. Topology of C COMPLEX ANALYSIS TOPIC XVI: SEQUENCES PAUL L. BAILEY Abstract. We outline the development of sequences in C, starting with open and closed sets, and ending with the statement of the Bolzano-Weierstrauss

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

Metric Space Topology (Spring 2016) Selected Homework Solutions. HW1 Q1.2. Suppose that d is a metric on a set X. Prove that the inequality d(x, y)

Metric Space Topology (Spring 2016) Selected Homework Solutions. HW1 Q1.2. Suppose that d is a metric on a set X. Prove that the inequality d(x, y) Metric Space Topology (Spring 2016) Selected Homework Solutions HW1 Q1.2. Suppose that d is a metric on a set X. Prove that the inequality d(x, y) d(z, w) d(x, z) + d(y, w) holds for all w, x, y, z X.

More information

MATH115. Sequences and Infinite Series. Paolo Lorenzo Bautista. June 29, De La Salle University. PLBautista (DLSU) MATH115 June 29, / 16

MATH115. Sequences and Infinite Series. Paolo Lorenzo Bautista. June 29, De La Salle University. PLBautista (DLSU) MATH115 June 29, / 16 MATH115 Sequences and Infinite Series Paolo Lorenzo Bautista De La Salle University June 29, 2014 PLBautista (DLSU) MATH115 June 29, 2014 1 / 16 Definition A sequence function is a function whose domain

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

Austin Mohr Math 704 Homework 6

Austin Mohr Math 704 Homework 6 Austin Mohr Math 704 Homework 6 Problem 1 Integrability of f on R does not necessarily imply the convergence of f(x) to 0 as x. a. There exists a positive continuous function f on R so that f is integrable

More information

8.1 Sequences. Example: A sequence is a function f(n) whose domain is a subset of the integers. Notation: *Note: n = 0 vs. n = 1.

8.1 Sequences. Example: A sequence is a function f(n) whose domain is a subset of the integers. Notation: *Note: n = 0 vs. n = 1. 8. Sequences Example: A sequence is a function f(n) whose domain is a subset of the integers. Notation: *Note: n = 0 vs. n = Examples: 6. Find a formula for the general term a n of the sequence, assuming

More information

p-adic Analysis Compared to Real Lecture 1

p-adic Analysis Compared to Real Lecture 1 p-adic Analysis Compared to Real Lecture 1 Felix Hensel, Waltraud Lederle, Simone Montemezzani October 12, 2011 1 Normed Fields & non-archimedean Norms Definition 1.1. A metric on a non-empty set X is

More information

Arkansas Tech University MATH 2924: Calculus II Dr. Marcel B. Finan

Arkansas Tech University MATH 2924: Calculus II Dr. Marcel B. Finan Arkansas Tech University MATH 2924: Calculus II Dr. Marcel B. Finan 8. Sequences We start this section by introducing the concept of a sequence and study its convergence. Convergence of Sequences. An infinite

More information

2.1 Convergence of Sequences

2.1 Convergence of Sequences Chapter 2 Sequences 2. Convergence of Sequences A sequence is a function f : N R. We write f) = a, f2) = a 2, and in general fn) = a n. We usually identify the sequence with the range of f, which is written

More information

COM S 330 Homework 08 Solutions. Type your answers to the following questions and submit a PDF file to Blackboard. One page per problem.

COM S 330 Homework 08 Solutions. Type your answers to the following questions and submit a PDF file to Blackboard. One page per problem. COM S 0 Homework 08 Solutions Type your answers to the following questions and submit a PDF file to Blackboard. One page per problem. Problem 1. [10pts] Let M = (S, T, s 0 ) be the state machine where

More information

Homework 11. Solutions

Homework 11. Solutions Homework 11. Solutions Problem 2.3.2. Let f n : R R be 1/n times the characteristic function of the interval (0, n). Show that f n 0 uniformly and f n µ L = 1. Why isn t it a counterexample to the Lebesgue

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

6.2 Deeper Properties of Continuous Functions

6.2 Deeper Properties of Continuous Functions 6.2. DEEPER PROPERTIES OF CONTINUOUS FUNCTIONS 69 6.2 Deeper Properties of Continuous Functions 6.2. Intermediate Value Theorem and Consequences When one studies a function, one is usually interested in

More information

Homework 1 (revised) Solutions

Homework 1 (revised) Solutions Homework 1 (revised) Solutions 1. Textbook, 1.1.1, # 1.1.2 (p. 24) Let S be an ordered set. Let A be a non-empty finite subset. Then A is bounded and sup A, inf A A Solution. The hint was: Use induction,

More information

Real Analysis Notes. Thomas Goller

Real Analysis Notes. Thomas Goller Real Analysis Notes Thomas Goller September 4, 2011 Contents 1 Abstract Measure Spaces 2 1.1 Basic Definitions........................... 2 1.2 Measurable Functions........................ 2 1.3 Integration..............................

More information

Homework 3 Solutions, Math 55

Homework 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 information

Discrete Math, Spring Solutions to Problems V

Discrete Math, Spring Solutions to Problems V Discrete Math, Spring 202 - Solutions to Problems V Suppose we have statements P, P 2, P 3,, one for each natural number In other words, we have the collection or set of statements {P n n N} a Suppose

More information

HOMEWORK #2 - MA 504

HOMEWORK #2 - MA 504 HOMEWORK #2 - MA 504 PAULINHO TCHATCHATCHA Chapter 1, problem 6. Fix b > 1. (a) If m, n, p, q are integers, n > 0, q > 0, and r = m/n = p/q, prove that (b m ) 1/n = (b p ) 1/q. Hence it makes sense to

More information

Fall 2017 Test II review problems

Fall 2017 Test II review problems Fall 2017 Test II review problems Dr. Holmes October 18, 2017 This is a quite miscellaneous grab bag of relevant problems from old tests. Some are certainly repeated. 1. Give the complete addition and

More information