# Math 317 HW #5 Solutions

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 Math 317 HW #5 Solutions 1. Exercise (a) Prove that the sequence defined by x 1 = 3 and converges. x n+1 = 1 4 x n Proof. I intend to use the Monotone Convergence Theorem, so my goal is to show that (x n ) is decreasing and bounded. To do so, I will prove by induction that, for any n {1, 2, 3,...}, 0 < x n+1 < x n < 4. Base Case When n = 1, we have that x 1 = 3 and x 2 = = 1, so 0 < x 2 < x 1. Inductive Step Suppose 0 < x k+1 < x k < 4; our goal is to show that this implies that 0 < x k+2 < x k+1 < 4. Since x k+1 < x k, we know that or, equivalently, x k+2 = Moreover, since x k+1 < x k < 4, we have 4 x k+1 > 4 x k 1 < 1 = x k+1. 4 x k+1 4 x k x k+2 < x k+1 < 4. The fact that x k+1 < 4 also implies that 4 x k+1 > 0, so 0 < 1 4 x k+1 = x k+2. Putting this all together, then, we see that 0 < x k+1 < x k < 4 implies that 0 < x k+2 < x k+1 < 4. Therefore, by induction, we can conclude that 0 < x n+1 < x n < 4 for all n {1, 2, 3,...}. Thus, the sequence (x n ) is a bounded, decreasing sequence and so, by the Monotone Convergence Theorem, it must converge. 1

2 (b) Now that we know lim x n exists, explain why lim x n+1 must also exist and equal the same value. Answer. Intuitively, lim x n+1 converges because (x n+1 ) is identical to (x n ) except for the very first term, which has no impact on the limiting behavior of the sequence. If I want to be really rigorous, here s how to do that: define the sequence (y n ) by y n = x n+1 for all n {1, 2, 3,...}. Let ɛ > 0. Since (x n ) converges to, say, L R, there exists an N N such that, if n N, Therefore, if n N 1, x n L < ɛ. y n L = x n+1 L < ɛ since n + 1 N. Therefore, since the choice of ɛ > 0 was arbitrary, we conclude that (y n ) L or, equivalently, (x n+1 ) L. (c) Take the limit of each side of the recursive equation in part (a) of this exercise to implicitly compute lim x n. Answer. On the one hand, if (x n ) L, we know that (x n+1 ) L. On the other hand, we know ( ) 1 (x n+1 ) = 4 x n 1 4 L by the Algebraic Limit Theorem (we know L 4 since 3 is an upper bound for (x n )). Therefore, it must be the case that L = 1 4 L or, equivalently, We can re-write this as so, by the quadratic formula, L(4 L) = 1. 0 = L 2 4L + 1, L = 4 ± ( 4) 2 4(1)(1) 2(1) = 4 ± = 2 ± 3. Since > 3, which is an upper bound for (x n ), we know L Therefore, we can conclude that L = Exercise Let (a n ) be a bounded sequence. (a) Prove that the sequence defined by y n = sup{a k : k n} converges. Proof. For any n {1, 2, 3,...}, define the set A n := {a n, a n+1, a n+2,...}. 2

3 In other words, y n = sup A n. As defined, A n+1 A n, so y n+1 y n. Since this is true for any n, we see that the sequence (y n ) is decreasing. Also, since (a n ) is bounded, there exists M > 0 such that a n M for all n {1, 2, 3,...}. In particular, for any n, M a n y n y 1, so we see that the sequence (y n ) is bounded. Therefore, since (y n ) is a bounded, decreasing sequence, the Monotone Convergence Theorem implies that it converges. (b) The limit superior of (a n ), or lim sup a n, is defined by lim sup a n = lim y n, where y n is the sequence from part (a) of this exercise. Provide a reasonable definition for lim inf a n and briefly explain why it always exists for any bounded sequence. Answer. Here s the definition of lim inf a n : For a bounded sequence (a n ), define the sequence (z n ) by z n = inf{a k : k n}. Then the limit inferior of (a n ) is defined to be lim inf a n := lim z n. The sequence (z n ) is increasing and bounded (it s bounded below by z 1 and above by the upper bound for (a n )), so the Monotone Convergence Theorem implies it converges, so the above limit definitely exists. (c) Prove that lim inf a n lim sup a n for every bounded sequence, and give an example of a sequence for which the inequality is strict. Proof. Note that, with (y n ) and (z n ) defined as above, z n a n y n for all n {1, 2, 3,...}. In particular, z n y n. Therefore, by Theorem 2.3.4(ii), lim inf a n = lim z n lim y n = lim sup a n. Consider the sequence (a n ) given by a n = 2 + ( 1) n (1 + 1/n). Then it s straightforward to show that lim inf a n = 1 and lim sup a n = 3, so the inequality is strict for this sequence. 3

4 (d) Show that lim inf a n = lim sup a n if and only if lim a n exists. In this case, all three share the same value. Proof. To show the forward implication, assume lim inf a n = lim sup a n. In other words, with (y n ) and (z n ) defined as above, lim z n = lim y n. Now, we know that z n a n y n for all n {1, 2, 3,...}, so the Squeeze Theorem implies that lim a n exists and is equal to the common limit of the y n s and z n s. Turning to the reverse implication, assume lim a n = L for some L R. Let ɛ > 0. Since (a n ) L, there exists N N such that, whenever n N, or, equivalently, a n L < ɛ/2 ɛ/2 < a n L < ɛ/2. Hence, L ɛ/2 < a n < L + ɛ for any n N, so L + ɛ is an upper bound for the set A n = {a k : k n}. Since y n = sup A n, this implies that y n L + ɛ/2, meaning that y n L ɛ/2. On the other hand, y n a n > L ɛ/2. Putting this all together, we see that, for any n N, which implies that L ɛ/2 y n L + ɛ/2, y n L ɛ/2 < ɛ, Since our choice of ɛ > 0 was arbitrary, we conclude that (y n ) L. A totally equivalent argument shows that (z n ) L as well, so we have that lim inf a n = lim sup a n = lim a n when (a n ) converges. Having proved both implications, we can conclude that lim inf a n = lim sup a n if an only if lim a n exists. 3. Exercise Give an example of each of the following, or argue that such a request is impossible. (a) A sequence that does not contain 0 or 1 as a term but contains subsequences converging to each of these values. Example. Consider the sequence (a n ) given by { 1 + 1/n if n is odd a n = 1/n if n is even. Clearly, (1 + 1/n) 1 and (1/n) 0, so the subsequence of odd terms converges to 1 and the subsequence of even terms converges to 0, even though neither 1 nor 0 appear as terms of the sequence. 4

5 (b) A monotone sequence that diverges but has a convergent subsequence. This is impossible. To see why, suppose (a n ) is a monotone sequence with a convergent subsequence (a nk ). In fact, for simplicity, assume (a n ) is increasing. Since (a nk ) converges, it must be bounded, so there exists M R such that a nk M for all of the a nk. Now, for any term a n from the original sequence, there exists k N such that n k > n; then a 1 a n a nk M. Since our choice of n was arbitrary, we see that a 1 a n M for all n {1, 2, 3,...}, so the sequence (a n ) must be bounded. A similar argument works when (a n ) is decreasing. Therefore, any monotone sequence with a convergent subsequence must be bounded and, therefore, convergent by the Monotone Convergence Theorem. (c) A sequence that contains subsequences converging to every point in the infinite set {1, 1/2, 1/3, 1/4, 1/5,...}. Example. Consider the sequence (1, 1, 1/2, 1, 1/2, 1/3, 1, 1/2, 1/3, 1/4, 1, 1/2, 1/3, 1/4, 1/5, 1,...). In other words, I m constructing the sequence by stringing together blocks of the form 1, 1/2, 1/3,..., 1/n, starting with the block corresponding to n = 1, then moving on to the block corresponding to n = 2, etc. Clearly, each number 1/k appears in the above sequence infinitely many times, which gives a subsequence converging to 1/k. (d) An unbounded sequence with a convergent subsequence. Example. Consider the sequence (a n ) given by { 0 if n is odd a n = n if n is even. Then, for any M > 0, there exists N N such that N > M (by the Archimedean Property); then either a N = N > M or a N+1 = N + 1 > M. Since this is true for any M > 0, we see that (a n ) is unbounded. On the other hand, the subsequence of odd terms is just the sequence (0, 0, 0, 0,...), which clearly converges to 0. (e) A sequence that has a subsequence that is bounded but contains no subsequence that converges. This is impossible. To see why, suppose (a n ) has a bounded subsequence (a nk ). Then (a nk ) is a bounded sequence and so, by the Bolzano-Weierstrass theorem, contains a convergent subsequence (a nkl ). But, of course, the sub-subsequence (a nkl ) is also a subsequence of the original sequence (a n ), so (a n ) must contain a convergent subsequence. 4. Exercise Assume (a n ) is a bounded sequence with the property that every convergent subsequence of (a n ) converges to the same limit a R. Show that (a n ) must converge to a. 5

6 Proof. I ll prove the contrapositive. In other words, I want to show that, if (a n ) is a bounded sequence that does not converge to the number a R, then not every convergent subsequence converges to a (or, more positively, there is some subsequence that converges to b a). To that end, suppose (a n ) is a bounded sequence that does not converge to a. In other words, it is not the case that, for every ɛ > 0, there is an N N such that, for all n N, a n a < ɛ. Passing the negation through the various quantifiers, this means that there is some ɛ 0 > 0 such that, for all N N, there is an n N such that a n a ɛ 0. Stated in plainer language, we re assuming that there is some ɛ 0 > 0 such that infinitely many of the a n s are at a distance at least ɛ 0 away from a. Now, these infinitely many a n s form a subsequence; call it (a nk ). Since (a n ) is bounded, the subsequence (a nk ) is also bounded and thus, by the Bolzano-Weierstrass Theorem, contains a convergent subsequence (a nkl ) b. Since each of the a nkl is at a distance at least ɛ 0 from a, we definitely have that b a, so we see that not every convergent subsequence of (a n ) converges to a, which is what we wanted to show. 5. Exercise Supply a proof for Theorem 2.6.2, which says that every convergent sequence is a Cauchy sequence. Proof. Suppose the sequence (a n ) converges to a. Let ɛ > 0. Then, by the definition of convergence, there exists N N such that, for any n N, Therefore, for any n, m N, we have that a n a < ɛ/2. a n a m = a n a + a a m a n a + a a m < ɛ/2 + ɛ/2 = ɛ, where the first inequality is just an application of the triangle inequality and the second follows from the assumption on n and m. Therefore, since our choice of ɛ > 0 was arbitrary, we see that for all ɛ > 0 there exists N N such that, if n, m N, a n a m < ɛ, which means that (a n ) is a Cauchy sequence. 6

### Thus, a sequence is not a Cauchy sequence if there exists ε > 0 and a subsequence (x nk : k N) with

Cauchy sequences. Definition: A sequence (x n ) is said to be a Cauchy sequence if given any ε > 0, there exists K N such that x n x m < ε for all n, m K. Thus, a sequence is not a Cauchy sequence if there

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

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

### 2 Sequences and Accumulation Points

2 Sequences and Accumulation Points 2.1 Convergent Sequences Formally, a sequence of real numbers is a function ϕ : N R. For instance the function ϕ(n) = 1 n 2 for all n N defines a sequence. It is customary,

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

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

### Math 317 HW #7 Solutions

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

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

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

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

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

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

### Section 3 Sequences and Limits

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

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

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

### Double Sequences and Double Series

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

### CHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e.

CHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e. This chapter contains the beginnings of the most important, and probably the most subtle, notion in mathematical analysis, i.e.,

### The Real Numbers. Here we show one way to explicitly construct the real numbers R. First we need a definition.

The Real Numbers Here we show one way to explicitly construct the real numbers R. First we need a definition. Definitions/Notation: A sequence of rational numbers is a funtion f : N Q. Rather than write

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

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

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

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

### Section 3 Sequences and Limits, Continued.

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

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

### Lecture 12: Sequences. 4. If E X and x is a limit point of E then there is a sequence (x n ) in E converging to x.

Lecture 12: Sequences We now recall some basic properties of limits. Theorem 0.1 (Rudin, Theorem 3.2). Let (x n ) be a sequence in a metric space X. 1. (x n ) converges to x X if and only if every neighborhood

### Prof. Girardi, Math 703, Fall 2012 Homework Solutions: Homework 13. in X is Cauchy.

Homework 13 Let (X, d) and (Y, ρ) be metric spaces. Consider a function f : X Y. 13.1. Prove or give a counterexample. f preserves convergent sequences if {x n } n=1 is a convergent sequence in X then

### INTRODUCTION TO THE CONVERGENCE OF SEQUENCES

INTRODUCTION TO THE CONVERGENCE OF SEQUENCES BECKY LYTLE Abstract. In this paper, we discuss the basic ideas involved in sequences and convergence. We start by defining sequences and follow by explaining

### Practice Problems Solutions

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

### Chapter 2 Sequences and Series

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

### 4.3 Limit of a Sequence: Theorems

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

### 1 if 1 x 0 1 if 0 x 1

Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or

### Sequences and Convergence in Metric Spaces

Sequences and Convergence in Metric Spaces Definition: A sequence in a set X (a sequence of elements of X) is a function s : N X. We usually denote s(n) by s n, called the n-th term of s, and write {s

### God created the integers and the rest is the work of man. (Leopold Kronecker, in an after-dinner speech at a conference, Berlin, 1886)

Chapter 2 Numbers God created the integers and the rest is the work of man. (Leopold Kronecker, in an after-dinner speech at a conference, Berlin, 1886) God created the integers and the rest is the work

### Convexity in R N Main Notes 1

John Nachbar Washington University December 16, 2016 Convexity in R N Main Notes 1 1 Introduction. These notes establish basic versions of the Supporting Hyperplane Theorem (Theorem 5) and the Separating

### Convergent Sequence. Definition A sequence {p n } in a metric space (X, d) is said to converge if there is a point p X with the following property:

Convergent Sequence Definition A sequence {p n } in a metric space (X, d) is said to converge if there is a point p X with the following property: ( ɛ > 0)( N)( n > N)d(p n, p) < ɛ In this case we also

### POSITIVE INTEGERS, INTEGERS AND RATIONAL NUMBERS OBTAINED FROM THE AXIOMS OF THE REAL NUMBER SYSTEM

MAT 1011 TECHNICAL ENGLISH I 03.11.2016 Dokuz Eylül University Faculty of Science Department of Mathematics Instructor: Engin Mermut Course assistant: Zübeyir Türkoğlu web: http://kisi.deu.edu.tr/engin.mermut/

### Section 1. Statements and Truth Tables. Definition 1.1: A mathematical statement is a declarative sentence that is true or false, but not both.

M3210 Supplemental Notes: Basic Logic Concepts In this course we will examine statements about mathematical concepts and relationships between these concepts (definitions, theorems). We will also consider

### Course 214 Section 1: Basic Theorems of Complex Analysis Second Semester 2008

Course 214 Section 1: Basic Theorems of Complex Analysis Second Semester 2008 David R. Wilkins Copyright c David R. Wilkins 1989 2008 Contents 1 Basic Theorems of Complex Analysis 1 1.1 The Complex Plane........................

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

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

### Theorem 2. If x Q and y R \ Q, then. (a) x + y R \ Q, and. (b) xy Q.

Math 305 Fall 011 The Density of Q in R The following two theorems tell us what happens when we add and multiply by rational numbers. For the first one, we see that if we add or multiply two rational numbers

### Chapter 6 Finite sets and infinite sets. Copyright 2013, 2005, 2001 Pearson Education, Inc. Section 3.1, Slide 1

Chapter 6 Finite sets and infinite sets Copyright 013, 005, 001 Pearson Education, Inc. Section 3.1, Slide 1 Section 6. PROPERTIES OF THE NATURE NUMBERS 013 Pearson Education, Inc.1 Slide Recall that denotes

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

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

### MATH : HONORS CALCULUS-3 HOMEWORK 6: SOLUTIONS

MATH 16300-33: HONORS CALCULUS-3 HOMEWORK 6: SOLUTIONS 25-1 Find the absolute value and argument(s) of each of the following. (ii) (3 + 4i) 1 (iv) 7 3 + 4i (ii) Put z = 3 + 4i. From z 1 z = 1, we have

### Completeness I. Chapter Rational Numbers

Chapter 5 Completeness I Completeness is the key property of the real numbers that the rational numbers lack. Before examining this property we explore the rational and irrational numbers, discovering

### 1.3 Induction and Other Proof Techniques

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

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

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

### Solutions to Tutorial 2 (Week 3)

THE UIVERSITY OF SYDEY SCHOOL OF MATHEMATICS AD STATISTICS Solutions to Tutorial 2 (Week 3) MATH3969: Measure Theory and Fourier Analysis (Advanced) Semester 2, 2016 Web Page: http://sydney.edu.au/science/maths/u/ug/sm/math3969/

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

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

### x a x 2 (1 + x 2 ) n.

Limits and continuity Suppose that we have a function f : R R. Let a R. We say that f(x) tends to the limit l as x tends to a; lim f(x) = l ; x a if, given any real number ɛ > 0, there exists a real number

### n k=1 k=0 1/k! = e. Example 6.4. The series 1/k 2 converges in R. Indeed, if s n = n then k=1 1/k, then s 2n s n = 1 n + 1 +...

6 Series We call a normed space (X, ) a Banach space provided that every Cauchy sequence (x n ) in X converges. For example, R with the norm = is an example of Banach space. Now let (x n ) be a sequence

### Second Project for Math 377, fall, 2003

Second Project for Math 377, fall, 003 You get to pick your own project. Several possible topics are described below or you can come up with your own topic (subject to my approval). At most two people

### Analysis MA131. University of Warwick. Term

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

### 0 ( x) 2 = ( x)( x) = (( 1)x)(( 1)x) = ((( 1)x))( 1))x = ((( 1)(x( 1)))x = ((( 1)( 1))x)x = (1x)x = xx = x 2.

SOLUTION SET FOR THE HOMEWORK PROBLEMS Page 5. Problem 8. Prove that if x and y are real numbers, then xy x + y. Proof. First we prove that if x is a real number, then x 0. The product of two positive

### Even Number: An integer n is said to be even if it has the form n = 2k for some integer k. That is, n is even if and only if n divisible by 2.

MATH 337 Proofs Dr. Neal, WKU This entire course requires you to write proper mathematical proofs. All proofs should be written elegantly in a formal mathematical style. Complete sentences of explanation

### The Real Numbers. Chapter An Overview of the Real Numbers

Chapter 2 The Real Numbers 2.1 An Overview of the Real Numbers Doing analysis in a rigorous way starts with understanding the properties of the real numbers. Readers will be familiar, in some sense, with

### Solutions to Section 1

Solutions to Section Exercise. Show tht nd. This follows from the fct tht mx{, } nd mx{, } Exercise. Show tht = { if 0 if < 0 Tht is, the bsolute vlue function is piecewise defined function. Grph this

### Introduction to Series and Sequences Math 121 Calculus II D Joyce, Spring 2013

Introduction to Series and Sequences Math Calculus II D Joyce, Spring 03 The goal. The main purpose of our study of series and sequences is to understand power series. A power series is like a polynomial

### HOMEWORK 5 SOLUTIONS. n!f n (1) lim. ln x n! + xn x. 1 = G n 1 (x). (2) k + 1 n. (n 1)!

Math 7 Fall 205 HOMEWORK 5 SOLUTIONS Problem. 2008 B2 Let F 0 x = ln x. For n 0 and x > 0, let F n+ x = 0 F ntdt. Evaluate n!f n lim n ln n. By directly computing F n x for small n s, we obtain the following

### The Alternating Series Test

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

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

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

### Math 140a - HW 1 Solutions

Math 140a - HW 1 Solutions Problem 1 (WR Ch 1 #1). If r is rational (r 0) and x is irrational, prove that r + x and rx are irrational. Solution. Given that r is rational, we can write r = a b for some

### Limits and convergence.

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

### Solutions of Equations in One Variable. Fixed-Point Iteration II

Solutions of Equations in One Variable Fixed-Point Iteration II Numerical Analysis (9th Edition) R L Burden & J D Faires Beamer Presentation Slides prepared by John Carroll Dublin City University c 2011

### Problem Set. Problem Set #2. Math 5322, Fall December 3, 2001 ANSWERS

Problem Set Problem Set #2 Math 5322, Fall 2001 December 3, 2001 ANSWERS i Problem 1. [Problem 18, page 32] Let A P(X) be an algebra, A σ the collection of countable unions of sets in A, and A σδ the collection

### PART I. THE REAL NUMBERS

PART I. THE REAL NUMBERS This material assumes that you are already familiar with the real number system and the representation of the real numbers as points on the real line. I.1. THE NATURAL NUMBERS

### Mathematical Induction

Mathematical Induction MAT30 Discrete Mathematics Fall 016 MAT30 (Discrete Math) Mathematical Induction Fall 016 1 / 19 Outline 1 Mathematical Induction Strong Mathematical Induction MAT30 (Discrete Math)

### 3. Mathematical Induction

3. MATHEMATICAL INDUCTION 83 3. Mathematical Induction 3.1. First Principle of Mathematical Induction. Let P (n) be a predicate with domain of discourse (over) the natural numbers N = {0, 1,,...}. If (1)

### Chap2: The Real Number System (See Royden pp40)

Chap2: The Real Number System (See Royden pp40) 1 Open and Closed Sets of Real Numbers The simplest sets of real numbers are the intervals. We define the open interval (a, b) to be the set (a, b) = {x

### MAT2400 Analysis I. A brief introduction to proofs, sets, and functions

MAT2400 Analysis I A brief introduction to proofs, sets, and functions In Analysis I there is a lot of manipulations with sets and functions. It is probably also the first course where you have to take

### Mathematical Induction

Mathematical Induction Victor Adamchik Fall of 2005 Lecture 2 (out of three) Plan 1. Strong Induction 2. Faulty Inductions 3. Induction and the Least Element Principal Strong Induction Fibonacci Numbers

### Riesz-Fredhölm Theory

Riesz-Fredhölm Theory T. Muthukumar tmk@iitk.ac.in Contents 1 Introduction 1 2 Integral Operators 1 3 Compact Operators 7 4 Fredhölm Alternative 14 Appendices 18 A Ascoli-Arzelá Result 18 B Normed Spaces

### 1. Write the following expressions in equivalent forms not involving absolute values.

Chapter 1 The Real Numbers 1.1 The Real Number System 1. Write the following expressions in equivalent forms not involving absolute values. b. a + b a b In order to eliminate the absolute value we distinguish

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

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

### BANACH AND HILBERT SPACE REVIEW

BANACH AND HILBET SPACE EVIEW CHISTOPHE HEIL These notes will briefly review some basic concepts related to the theory of Banach and Hilbert spaces. We are not trying to give a complete development, but

### Theorem (The division theorem) Suppose that a and b are integers with b > 0. There exist unique integers q and r so that. a = bq + r and 0 r < b.

Theorem (The division theorem) Suppose that a and b are integers with b > 0. There exist unique integers q and r so that a = bq + r and 0 r < b. We re dividing a by b: q is the quotient and r is the remainder,

### Math212a1010 Lebesgue measure.

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

### SEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION

CHAPTER 5 SEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION Alessandro Artale UniBZ - http://www.inf.unibz.it/ artale/ SECTION 5.2 Mathematical Induction I Copyright Cengage Learning. All rights reserved.

### WRITING PROOFS. Christopher Heil Georgia Institute of Technology

WRITING PROOFS Christopher Heil Georgia Institute of Technology A theorem is just a statement of fact A proof of the theorem is a logical explanation of why the theorem is true Many theorems have this

### Metric Spaces. Chapter 7. 7.1. Metrics

Chapter 7 Metric Spaces A metric space is a set X that has a notion of the distance d(x, y) between every pair of points x, y X. The purpose of this chapter is to introduce metric spaces and give some

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

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

### 10.2 Series and Convergence

10.2 Series and Convergence Write sums using sigma notation Find the partial sums of series and determine convergence or divergence of infinite series Find the N th partial sums of geometric series and

### v 1. v n R n we have for each 1 j n that v j v n max 1 j n v j. i=1

1. Limits and Continuity It is often the case that a non-linear function of n-variables x = (x 1,..., x n ) is not really defined on all of R n. For instance f(x 1, x 2 ) = x 1x 2 is not defined when x

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

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

### Math 115 Spring 2014 Written Homework 3 Due Wednesday, February 19

Math 11 Spring 01 Written Homework 3 Due Wednesday, February 19 Instructions: Write complete solutions on separate paper (not spiral bound). If multiple pieces of paper are used, they must be stapled with

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

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

### Cylinder Maps and the Schwarzian

Cylinder Maps and the Schwarzian John Milnor Stony Brook University (www.math.sunysb.edu) Bremen June 16, 2008 Cylinder Maps 1 work with Araceli Bonifant Let C denote the cylinder (R/Z) I. (.5, 1) fixed

### Series. Chapter Convergence of series

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

### No: 10 04. Bilkent University. Monotonic Extension. Farhad Husseinov. Discussion Papers. Department of Economics

No: 10 04 Bilkent University Monotonic Extension Farhad Husseinov Discussion Papers Department of Economics The Discussion Papers of the Department of Economics are intended to make the initial results

### Sequences of Functions

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

### Mathematical Methods of Engineering Analysis

Mathematical Methods of Engineering Analysis Erhan Çinlar Robert J. Vanderbei February 2, 2000 Contents Sets and Functions 1 1 Sets................................... 1 Subsets.............................

### Basic Proof Techniques

Basic Proof Techniques David Ferry dsf43@truman.edu September 13, 010 1 Four Fundamental Proof Techniques When one wishes to prove the statement P Q there are four fundamental approaches. This document

### Math 563 Measure Theory Project 1 (Funky Functions Group) Luis Zerón, Sergey Dyachenko

Math 563 Measure Theory Project (Funky Functions Group) Luis Zerón, Sergey Dyachenko 34 Let C and C be any two Cantor sets (constructed in Exercise 3) Show that there exists a function F: [,] [,] with

### Quantifiers are used to describe variables in statements. - The universal quantifier means for all. - The existential quantifier means there exists.

11 Quantifiers are used to describe variables in statements. - The universal quantifier means for all. - The existential quantifier means there exists. The phrases, for all x in R if x is an arbitrary

### Notes on metric spaces

Notes on metric spaces 1 Introduction The purpose of these notes is to quickly review some of the basic concepts from Real Analysis, Metric Spaces and some related results that will be used in this course.

### THE BANACH CONTRACTION PRINCIPLE. Contents

THE BANACH CONTRACTION PRINCIPLE ALEX PONIECKI Abstract. This paper will study contractions of metric spaces. To do this, we will mainly use tools from topology. We will give some examples of contractions,

### Metric Spaces. Chapter 1

Chapter 1 Metric Spaces Many of the arguments you have seen in several variable calculus are almost identical to the corresponding arguments in one variable calculus, especially arguments concerning convergence

### Compactness in metric spaces

MATHEMATICS 3103 (Functional Analysis) YEAR 2012 2013, TERM 2 HANDOUT #2: COMPACTNESS OF METRIC SPACES Compactness in metric spaces The closed intervals [a, b] of the real line, and more generally the

### KOLMOGOROV-SMIRNOV ISOMETRIES OF THE SPACE OF GENERALIZED DISTRIBUTION FUNCTIONS

KOLMOGOROV-SMIRNOV ISOMETRIES OF THE SPACE OF GENERALIZED DISTRIBUTION FUNCTIONS LAJOS MOLNÁR* AND PATRĆIA SZOKOL** Abstract. In this paper we describe the structure of surjective isometries of the space

### Markov Chains, part I

Markov Chains, part I December 8, 2010 1 Introduction A Markov Chain is a sequence of random variables X 0, X 1,, where each X i S, such that P(X i+1 = s i+1 X i = s i, X i 1 = s i 1,, X 0 = s 0 ) = P(X

### 2.3 Bounds of sets of real numbers

2.3 Bounds of sets of real numbers 2.3.1 Upper bounds of a set; the least upper bound (supremum) Consider S a set of real numbers. S is called bounded above if there is a number M so that any x S is less

### A Problem With The Rational Numbers

Solvability of Equations Solvability of Equations 1. In fields, linear equations ax + b = 0 are solvable. Solvability of Equations 1. In fields, linear equations ax + b = 0 are solvable. 2. Quadratic equations

### Finite Sets. Theorem 5.1. Two non-empty finite sets have the same cardinality if and only if they are equivalent.

MATH 337 Cardinality Dr. Neal, WKU We now shall prove that the rational numbers are a countable set while R is uncountable. This result shows that there are two different magnitudes of infinity. But we

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

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

### ON THE FIBONACCI NUMBERS

ON THE FIBONACCI NUMBERS Prepared by Kei Nakamura The Fibonacci numbers are terms of the sequence defined in a quite simple recursive fashion. However, despite its simplicity, they have some curious properties

### STAT 571 Assignment 1 solutions

STAT 571 Assignment 1 solutions 1. If Ω is a set and C a collection of subsets of Ω, let A be the intersection of all σ-algebras that contain C. rove that A is the σ-algebra generated by C. Solution: Let