Solutions to Homework 9

Size: px
Start display at page:

Download "Solutions to Homework 9"

Transcription

1 Solutions to Homework 9 Read the proof of proposition 1.7 on p. 271 (section 7.1). Write a more detailed proof. In particular, state the defintion of uniformly continuous and explain the comment whose sidelengths are less than δ/ n. Solution: Here are some additional details which further explain the content of Proposition 1.7. Definition: Let A R n. A function f : A R is said to be uniformly continuous if for every ɛ > 0 there exists a δ > 0 such that for all x, y A. x y < δ = f(x) f(y) The difference between the above definition and the definition of continuous is subtle. If f is continuous, then for each x X and for each ɛ > 0 there exists a δ > 0 (meaning that δ may depend on both x and ɛ) such that x y < δ = f(x) f(y) for all y A. But if f is uniformly continuous, then for each ɛ > 0 there exists a δ > 0 such that the above condition holds for all x, y A (meaning that δ does not depend on x). A uniformly continous function is obviously continuous. But the converse is not true. For example, if A = (0, 1) and f(x) = 1/x, then f is continuous on A, but it is not uniformly continuous on A. The point is that if x is close to zero, then δ needs to be chosen smaller than if x is not close to zero. (Draw a sketch and think about how small δ needs to be.) The following is a rigorous argument that f is not uniformly continuous: if f(x) = 1/x were uniformly continous on (0, 1), then given ɛ = 1/n, there would exist a δ > 0 such that 1 x 1 y = x y xy < δ xy < ɛ = 1 n for all x, y (0, 1) such that x y < δ. Thus, δ < xy n

2 for all x, y (0, 1) such that x y < δ. Choose y = x + δ/2 so that x y < δ. Substituting into the above inequality and solving for δ one obtains the following: δ < 2x2 2n x, for all x (0, 1). Now let x 0 +. Since the right-hand side of the above inequality approaches zero, δ = 0, which contradicts the assumption that δ > 0. If A is compact, then f is continous if and only if it is uniformly continuous. This is Theorem 1.4 in section 5.1. You should be aware of this result, as it plays an important role in many arguments involving partitions. It will be used in the proof of Proposition 1.7 below. Proposition 1.7 in section 7.1: Let R R n be a rectangle. Suppose f : R mathbbr is continuous. Then f is integrable. Proof (with extra details): To prove f is integrable, we appeal to the convenient criterion (Proposition 1.3). Let ɛ > 0. Since R is compact, by Theorem 1.4 in section 5.1, f is uniformly continous on R. Therefore, there exists a δ > 0 such that x y < δ = f(x) f(y) < ɛ vol(r). Choose a partition P of R such that every subrectangle has a side length less than r = δ/ n. This implies that if x and y belong to the same subrectangle, then x y < r r 2 = r n = δ n n = δ. Therefore, if x and y belong to the same rectangle, then f(x) f(y) < ɛ/vol(r). Since each subrectangle is compact and f is continous, f attains its maximum and minimum values, i.e. the supremum of all values of f(x) such that x belongs to a given rectangle is equal to f(x ) for some x 0 in the rectangle (and similarly, there exists a point x belonging to the subrectangle such that f(x ) is the minimum value. Saying this another way, if M is the supremum of f(x) for x belonging to a subrectangle S and m is the infimum, then there exist x, x S such that M = f(x ) and m = f(x ). Therefore, M m < ɛ/vol(r). It follows that

3 if the subrectangles in the partitition are enumerated S 1,..., S k, then U(f, P) L(f, P) = k (M i m i )vol(s i ) < ɛ vol(r) k vol(s i ) = ɛ. Therefore, f is integrable since it satisfies Proposition 1.3 (Convenient Criterion). Section 7.1, exercise #1: Suppose that f(x, y) = 0 if 0 y 1/2 and that f(x, y) = 1 if 1/2 < y 1. Prove that f is integrable on R = [0, 1] [0, 1] and compute R f da. Solution: Let ɛ > 0. Choose a positive integers n such that 1/2n < ɛ. Choose a partion P = P 1 P 2 as follows: let P 1 = {0 = x 0 < 1 2n = x 1 < 2 2n = x 2 < < 2n 2n = 1 = x 2n and let P 2 = {y 0 = 0 < y 1 }. By design, x n = 1/2. If we enurate the subrectangles S 1,..., S 2n, where S i = [x i 1, x i ] [0, 1], then M i = 0 if 1 i (n 1) and M i = 1 if n i 2n. (This is due to the fact that the line y = 1/2 intersects the subrectangle S n.) On the other hand, m i = 0 if 1 i n and m i = 1 if n + 1 i 2n. Therfore, U(f, P) L(f, P) = 2n (M i m i )area(s i ) = (M n m n ) 1 2n = 1 2n < ɛ. Therefore f is integrable by Proposition 1.3. Furthermore, since L(f, P) f da U(f, P) R it follows that R f da = 1/2. (A direct computation shows that L(f, P) = 1/2 and U(f, P) = (n + 1)/2n, and the latter decreases to a limit of 1/2 as n. ) Section 7.1, exercise #2: Show directly that the function f(x, y) = 1 if x = y and f(x, y) = 0 if x y is integrable on R = [0, 1] [0, 1] and compute R f da.

4 Solution: Let ɛ > 0. Choose a positive integer n such that 1/n < ɛ. Let P = P 1 P 2, where P 1 = P 2 = {0 < 1/n < 2/n < < n/n = 1}. The subrectangles can be enumerated by the doubly indexed sequence {S i,j } where i, j = 1,..., n and where S i,j is the subrectangle whose upper right vertex is (i/n, j/n). The line y = x intersects the rectangle S i,j if and only if i = j. Therefore M i,j = m i,j = 0 if i j. And if i = j, then M i,j = 1 and m i,j = 0. (The former is easy to see, and the latter seems clear. A clarification of the latter is that the line y = x can meet at most two vertices of a rectangle, and so there are at least two vertices which do not lie on this line. Therefore there are points in S i,i whose f-values are equal to zero.) A direct computation shows that n U(f, P) L(f, P) = (M i,j m i,j )area(s i,j ) = i,j=1 n (M i,i m i,i ) 1 n 2 = n 1 n 2 < ɛ. Therefore f is integrable by Proposition 1.3. As in the previous problem, the lower and upper sums with respect to P can be computed. The lower sum is equal to zero and the upper sum is equal to 1/n. Since 1/n limits to zero as n, it follows that R f da = 0. Section 7.1, exercise #3: Show directly that the function f(x, y) = 1 if y < x and f(x, y) = 0 if x y is integrable on R = [0, 1] [0, 1] and compute R f da. Solution: The solution is very similar to the previous exercise. Let ɛ > 0 and choose P as in the previous exercise. In this case, M i,j = 1 if j i and m i,j = 1 if j < i; similarly, M i,j = 0 if i < j and m i,j = 0 if i j. It follows that the difference of the upper and lower sums is again less that 1/n. (You ll want to write this out.) Therefore, f is integrable by Proposition 1.3. The lower and upper sums can be computed directly. The lower sum is equal to (n 1)n/2n 2 and the upper sum is equal to n(n + 1)/2n 2 ; both limit to 1/2, and so R f da = 1/2. (To compute these sums you will want to use the following identity: n = n(n + 1). 2

5 Section 7.1, exercise #4: Show directly that the function f(x, y) = 1 if x {1/2, 1/3, 1/4,... } and f(x, y) = 0 otherwise is integrable on R = [0, 1] [0, 1] and compute R f da. Strategy: We again appeal to the convenient criterion (Proposition 1.3). The idea is to choose a partition which cuts R into thin vertical strips which are very narrow if the strip contains the line x = 1/k for some k and which are as wide as possible if the strip does not contain such a line. This is not possible to achieve for all k, but it can be achieved for finitely many such k. And fortunately, the remaining such vertical lines, although infinite in number, accumulate in a region of smaller and smaller area. Solution: Let ɛ > 0. Choose a positive integer n such that 3/n < ɛ. Let P = P 1 P 2 where P 1 = {0 < 1 n + 1 n 2 < 1 n 1 1 n 2 < 1 n n 2 < 1 n 2 1 n 2 < < 1 k + 1 n 2 < 1 k 1 1 n 2 < 1 k n 2 < 1 k 2 1 n 2 < < n 2 < n 2 < 1 1 n 2 < 1} and let P 2 = {0 < 1}. The first subrectangle intersects the verticle line x = 1/n, and so M 1 = 1. The second subrectangle does not intersect any vertical line of the form x = 1/m for some positive integer m, and so M 2 = 0. Every other subrectangle has M = 1 followed by M = 0. The subrectangles having M = 1 have a width of 2/n with the exception of the first and last rectangle. Thus, U(f, P) = ( 1 n + 1 n 2 ) + 2 n n n 2 = ( 1 n + 1 n 2 ) + (n 2) 2 n n 2 = 1 n + (n 1) 2 n 2 < 3 n < ɛ Since L(f, P) = 0, f satisfies the criterion of Proposition 1.3 and so f is integrable. The value of R f da is equal to zero since the upper sum above is less than 3/n which tends to zero as n. Section 7.1, exercise #5: Let R R n be a rectangle. Suppose that f : R R is nonnegative, continuous, and positive at some point a R.

6 Prove that R f dv > 0. Show that the result is false if f is not assumed to be continuous. The solution below is short on details because the details will obscure the argument. Try to read it through once or twice and then try to identify which statements might require some justification. Can you justify these statments? Solution: Let W be the open interval (f(a)/2, ). Since f(a) > 0 and since f is continuous, the set U = f 1 (W ) is open and nonempty and contains a. Let V be the interior of R. The set V U is open and nonempty; it is nonempty since either a V or a belongs to the frontier of R in which case every open set containing a must intersect the interior of V. Let b V U and choose a closed square S with center b and with edges of length δ > 0 such that S V U. By design, f(x) > f(a)/2 for every x S. Let g(x) = f(a)/2 for all x S and let g(x) = 0 for all x / S. This function is integrable (since g is continous at every point of R except at points belonging to the frontier of S, and the frontier of S has volume zero so Proposition 1.8 applies) and f(x) g(x) for all x R. By Proposition 1.11, f dv g dv = 1 2 f(a)δ2 > 0. R R The result is false if f is not assumed to be continous. For example, let f be the function in exercise 2 of section 7.1. Section 7.1, exercise #6: Let R n be a region and suppose f : R is continuous. (a) If m and M are, respectively, the minimum and maximum values of f, prove that m vol() f dv M vol(). Solution: Let g(x) = m for all x R n. Then g is integrable on. By Proposition 1.11 and Proposition 1.5, f dv g dv = m 1 dv = m vol().

7 The inequality involving M is proved in a similar manner. (b) (Mean value theorem for integrals) Suppose that is (path) connected. Prove that there is a point c such that f dv = f(c) vol(). Solution: By part (a), the value of the integral lies between m vol() and M vol(). And the image of f is the interval [m, M] R. Since f is continous, the function f attains every value in between m and M by the intermediate value theorem, and so, in particular, f attains the value of f dv. The intermediate value theorem is not directly applicable since the domain is not a closed bounded interval in R. The following argument fills this gap in the above argument. Suppose that f(a) = m and f(b) = M, where a, b. Let g : [0, 1] be a path joining a to b. The function (f g) : [0, 1] R is continuous. Since f(g(0)) = m and f(g(1)) = M, by the intermediate value theorem there exists a t [0, 1] such that f(g(t)) = f dv. Let c = g(t).

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

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

REVIEW OF ESSENTIAL MATH 346 TOPICS

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

More information

5. Some theorems on continuous functions

5. Some theorems on continuous functions 5. Some theorems on continuous functions The results of section 3 were largely concerned with continuity of functions at a single point (usually called x 0 ). In this section, we present some consequences

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

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

Introduction to Proofs in Analysis. updated December 5, By Edoh Y. Amiran Following the outline of notes by Donald Chalice INTRODUCTION

Introduction to Proofs in Analysis. updated December 5, By Edoh Y. Amiran Following the outline of notes by Donald Chalice INTRODUCTION Introduction to Proofs in Analysis updated December 5, 2016 By Edoh Y. Amiran Following the outline of notes by Donald Chalice INTRODUCTION Purpose. These notes intend to introduce four main notions from

More information

1 Topology Definition of a topology Basis (Base) of a topology The subspace topology & the product topology on X Y 3

1 Topology Definition of a topology Basis (Base) of a topology The subspace topology & the product topology on X Y 3 Index Page 1 Topology 2 1.1 Definition of a topology 2 1.2 Basis (Base) of a topology 2 1.3 The subspace topology & the product topology on X Y 3 1.4 Basic topology concepts: limit points, closed sets,

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

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

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

Exam 2 extra practice problems

Exam 2 extra practice problems Exam 2 extra practice problems (1) If (X, d) is connected and f : X R is a continuous function such that f(x) = 1 for all x X, show that f must be constant. Solution: Since f(x) = 1 for every x X, either

More information

Analysis II - few selective results

Analysis II - few selective results Analysis II - few selective results Michael Ruzhansky December 15, 2008 1 Analysis on the real line 1.1 Chapter: Functions continuous on a closed interval 1.1.1 Intermediate Value Theorem (IVT) Theorem

More information

2 Sequences, Continuity, and Limits

2 Sequences, Continuity, and Limits 2 Sequences, Continuity, and Limits In this chapter, we introduce the fundamental notions of continuity and limit of a real-valued function of two variables. As in ACICARA, the definitions as well as proofs

More information

Maths 212: Homework Solutions

Maths 212: Homework Solutions Maths 212: Homework Solutions 1. The definition of A ensures that x π for all x A, so π is an upper bound of A. To show it is the least upper bound, suppose x < π and consider two cases. If x < 1, then

More information

MATH NEW HOMEWORK AND SOLUTIONS TO PREVIOUS HOMEWORKS AND EXAMS

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

Recitation 7: Existence Proofs and Mathematical Induction

Recitation 7: Existence Proofs and Mathematical Induction Math 299 Recitation 7: Existence Proofs and Mathematical Induction Existence proofs: To prove a statement of the form x S, P (x), we give either a constructive or a non-contructive proof. In a constructive

More information

Math 341 Summer 2016 Midterm Exam 2 Solutions. 1. Complete the definitions of the following words or phrases:

Math 341 Summer 2016 Midterm Exam 2 Solutions. 1. Complete the definitions of the following words or phrases: Math 34 Summer 06 Midterm Exam Solutions. Complete the definitions of the following words or phrases: (a) A sequence (a n ) is called a Cauchy sequence if and only if for every ɛ > 0, there exists and

More information

converges as well if x < 1. 1 x n x n 1 1 = 2 a nx n

converges as well if x < 1. 1 x n x n 1 1 = 2 a nx n Solve the following 6 problems. 1. Prove that if series n=1 a nx n converges for all x such that x < 1, then the series n=1 a n xn 1 x converges as well if x < 1. n For x < 1, x n 0 as n, so there exists

More information

Thus f is continuous at x 0. Matthew Straughn Math 402 Homework 6

Thus f is continuous at x 0. Matthew Straughn Math 402 Homework 6 Matthew Straughn Math 402 Homework 6 Homework 6 (p. 452) 14.3.3, 14.3.4, 14.3.5, 14.3.8 (p. 455) 14.4.3* (p. 458) 14.5.3 (p. 460) 14.6.1 (p. 472) 14.7.2* Lemma 1. If (f (n) ) converges uniformly to some

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

REAL ANALYSIS II: PROBLEM SET 2

REAL ANALYSIS II: PROBLEM SET 2 REAL ANALYSIS II: PROBLEM SET 2 21st Feb, 2016 Exercise 1. State and prove the Inverse Function Theorem. Theorem Inverse Function Theorem). Let f be a continuous one to one function defined on an interval,

More information

Definition: For nonempty sets X and Y, a function, f, from X to Y is a relation that associates with each element of X exactly one element of Y.

Definition: For nonempty sets X and Y, a function, f, from X to Y is a relation that associates with each element of X exactly one element of Y. Functions Definition: A relation is a correspondence between two sets. If x and y are two elements in these sets and if a relation exists between x and y, then we say that x corresponds to y or that y

More information

Solutions to Homework 11

Solutions to Homework 11 Solutions to Homework 11 Read the statement of Proposition 5.4 of Chapter 3, Section 5. Write a summary of the proof. Comment on the following details: Does the proof work if g is piecewise C 1? Or did

More information

Introduction to Topology

Introduction to Topology Introduction to Topology Randall R. Holmes Auburn University Typeset by AMS-TEX Chapter 1. Metric Spaces 1. Definition and Examples. As the course progresses we will need to review some basic notions about

More information

Homework 5 Solutions

Homework 5 Solutions Homework 5 Solutions ECS 0 (Fall 17) Patrice Koehl koehl@cs.ucdavis.edu ovember 1, 017 Exercise 1 a) Show that the following statement is true: If there exists a real number x such that x 4 +1 = 0, then

More information

Math 328 Course Notes

Math 328 Course Notes Math 328 Course Notes Ian Robertson March 3, 2006 3 Properties of C[0, 1]: Sup-norm and Completeness In this chapter we are going to examine the vector space of all continuous functions defined on the

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

Final Exam Solutions June 10, 2004

Final Exam Solutions June 10, 2004 Math 0400: Analysis in R n II Spring 004 Section 55 P. Achar Final Exam Solutions June 10, 004 Total points: 00 There are three blank pages for scratch work at the end of the exam. Time it: hours 1. True

More information

Structure of R. Chapter Algebraic and Order Properties of R

Structure of R. Chapter Algebraic and Order Properties of R Chapter Structure of R We will re-assemble calculus by first making assumptions about the real numbers. All subsequent results will be rigorously derived from these assumptions. Most of the assumptions

More information

REAL VARIABLES: PROBLEM SET 1. = x limsup E k

REAL VARIABLES: PROBLEM SET 1. = x limsup E k REAL VARIABLES: PROBLEM SET 1 BEN ELDER 1. Problem 1.1a First let s prove that limsup E k consists of those points which belong to infinitely many E k. From equation 1.1: limsup E k = E k For limsup E

More information

Metric Spaces Math 413 Honors Project

Metric Spaces Math 413 Honors Project Metric Spaces Math 413 Honors Project 1 Metric Spaces Definition 1.1 Let X be a set. A metric on X is a function d : X X R such that for all x, y, z X: i) d(x, y) = d(y, x); ii) d(x, y) = 0 if and only

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

Topology. Xiaolong Han. Department of Mathematics, California State University, Northridge, CA 91330, USA address:

Topology. Xiaolong Han. Department of Mathematics, California State University, Northridge, CA 91330, USA  address: Topology Xiaolong Han Department of Mathematics, California State University, Northridge, CA 91330, USA E-mail address: Xiaolong.Han@csun.edu Remark. You are entitled to a reward of 1 point toward a homework

More information

x y More precisely, this equation means that given any ε > 0, there exists some δ > 0 such that

x y More precisely, this equation means that given any ε > 0, there exists some δ > 0 such that Chapter 2 Limits and continuity 21 The definition of a it Definition 21 (ε-δ definition) Let f be a function and y R a fixed number Take x to be a point which approaches y without being equal to y If there

More information

Elementary Analysis Math 140D Fall 2007

Elementary Analysis Math 140D Fall 2007 Elementary Analysis Math 140D Fall 2007 Bernard Russo Contents 1 Friday September 28, 2007 1 1.1 Course information............................ 1 1.2 Outline of the course........................... 1

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

Review of Multi-Calculus (Study Guide for Spivak s CHAPTER ONE TO THREE)

Review of Multi-Calculus (Study Guide for Spivak s CHAPTER ONE TO THREE) Review of Multi-Calculus (Study Guide for Spivak s CHPTER ONE TO THREE) This material is for June 9 to 16 (Monday to Monday) Chapter I: Functions on R n Dot product and norm for vectors in R n : Let X

More information

Supremum and Infimum

Supremum and Infimum Supremum and Infimum UBC M0 Lecture Notes by Philip D. Loewen The Real Number System. Work hard to construct from the axioms a set R with special elements O and I, and a subset P R, and mappings A: R R

More information

Writing proofs for MATH 51H Section 2: Set theory, proofs of existential statements, proofs of uniqueness statements, proof by cases

Writing proofs for MATH 51H Section 2: Set theory, proofs of existential statements, proofs of uniqueness statements, proof by cases Writing proofs for MATH 51H Section 2: Set theory, proofs of existential statements, proofs of uniqueness statements, proof by cases September 22, 2018 Recall from last week that the purpose of a proof

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

Quick Tour of the Topology of R. Steven Hurder, Dave Marker, & John Wood 1

Quick Tour of the Topology of R. Steven Hurder, Dave Marker, & John Wood 1 Quick Tour of the Topology of R Steven Hurder, Dave Marker, & John Wood 1 1 Department of Mathematics, University of Illinois at Chicago April 17, 2003 Preface i Chapter 1. The Topology of R 1 1. Open

More information

1 Definition of the Riemann integral

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

More information

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

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

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

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

More information

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

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

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

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

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

More information

Math 117: Continuity of Functions

Math 117: Continuity of Functions Math 117: Continuity of Functions John Douglas Moore November 21, 2008 We finally get to the topic of ɛ δ proofs, which in some sense is the goal of the course. It may appear somewhat laborious to use

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

Solutions to Homework 7

Solutions to Homework 7 Solutions to Homework 7 Exercise #3 in section 5.2: A rectangular box is inscribed in a hemisphere of radius r. Find the dimensions of the box of maximum volume. Solution: The base of the rectangular box

More information

cse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska

cse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska cse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska LECTURE 1 Course Web Page www3.cs.stonybrook.edu/ cse303 The webpage contains: lectures notes slides; very detailed solutions to

More information

1 The Well Ordering Principle, Induction, and Equivalence Relations

1 The Well Ordering Principle, Induction, and Equivalence Relations 1 The Well Ordering Principle, Induction, and Equivalence Relations The set of natural numbers is the set N = f1; 2; 3; : : :g. (Some authors also include the number 0 in the natural numbers, but number

More information

Walker Ray Econ 204 Problem Set 3 Suggested Solutions August 6, 2015

Walker Ray Econ 204 Problem Set 3 Suggested Solutions August 6, 2015 Problem 1. Take any mapping f from a metric space X into a metric space Y. Prove that f is continuous if and only if f(a) f(a). (Hint: use the closed set characterization of continuity). I make use of

More information

EC9A0: Pre-sessional Advanced Mathematics Course. Lecture Notes: Unconstrained Optimisation By Pablo F. Beker 1

EC9A0: Pre-sessional Advanced Mathematics Course. Lecture Notes: Unconstrained Optimisation By Pablo F. Beker 1 EC9A0: Pre-sessional Advanced Mathematics Course Lecture Notes: Unconstrained Optimisation By Pablo F. Beker 1 1 Infimum and Supremum Definition 1. Fix a set Y R. A number α R is an upper bound of Y if

More information

International Competition in Mathematics for Universtiy Students in Plovdiv, Bulgaria 1994

International Competition in Mathematics for Universtiy Students in Plovdiv, Bulgaria 1994 International Competition in Mathematics for Universtiy Students in Plovdiv, Bulgaria 1994 1 PROBLEMS AND SOLUTIONS First day July 29, 1994 Problem 1. 13 points a Let A be a n n, n 2, symmetric, invertible

More information

Immerse Metric Space Homework

Immerse Metric Space Homework Immerse Metric Space Homework (Exercises -2). In R n, define d(x, y) = x y +... + x n y n. Show that d is a metric that induces the usual topology. Sketch the basis elements when n = 2. Solution: Steps

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

Chapter 2: Functions, Limits and Continuity

Chapter 2: Functions, Limits and Continuity Chapter 2: Functions, Limits and Continuity Functions Limits Continuity Chapter 2: Functions, Limits and Continuity 1 Functions Functions are the major tools for describing the real world in mathematical

More information

Consequences of Continuity

Consequences of Continuity Consequences of Continuity James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University October 4, 2017 Outline 1 Domains of Continuous Functions 2 The

More information

Connectedness. Proposition 2.2. The following are equivalent for a topological space (X, T ).

Connectedness. Proposition 2.2. The following are equivalent for a topological space (X, T ). Connectedness 1 Motivation Connectedness is the sort of topological property that students love. Its definition is intuitive and easy to understand, and it is a powerful tool in proofs of well-known results.

More information

A Short Journey Through the Riemann Integral

A Short Journey Through the Riemann Integral A Short Journey Through the Riemann Integral Jesse Keyton April 23, 2014 Abstract An introductory-level theory of integration was studied, focusing primarily on the well-known Riemann integral and ending

More information

Advanced Calculus I Chapter 2 & 3 Homework Solutions October 30, Prove that f has a limit at 2 and x + 2 find it. f(x) = 2x2 + 3x 2 x + 2

Advanced Calculus I Chapter 2 & 3 Homework Solutions October 30, Prove that f has a limit at 2 and x + 2 find it. f(x) = 2x2 + 3x 2 x + 2 Advanced Calculus I Chapter 2 & 3 Homework Solutions October 30, 2009 2. Define f : ( 2, 0) R by f(x) = 2x2 + 3x 2. Prove that f has a limit at 2 and x + 2 find it. Note that when x 2 we have f(x) = 2x2

More information

Math 541 Fall 2008 Connectivity Transition from Math 453/503 to Math 541 Ross E. Staffeldt-August 2008

Math 541 Fall 2008 Connectivity Transition from Math 453/503 to Math 541 Ross E. Staffeldt-August 2008 Math 541 Fall 2008 Connectivity Transition from Math 453/503 to Math 541 Ross E. Staffeldt-August 2008 Closed sets We have been operating at a fundamental level at which a topological space is a set together

More information

Problems for Chapter 3.

Problems for Chapter 3. Problems for Chapter 3. Let A denote a nonempty set of reals. The complement of A, denoted by A, or A C is the set of all points not in A. We say that belongs to the interior of A, Int A, if there eists

More information

Homework 5 Solutions

Homework 5 Solutions Homework 5 Solutions ECS 0 (Fall 17) Patrice Koehl koehl@cs.ucdavis.edu February 8, 019 Exercise 1 a) Show that the following statement is true: If there exist two integers n and m such that n + n + 1

More information

Lecture Notes on Metric Spaces

Lecture Notes on Metric Spaces Lecture Notes on Metric Spaces Math 117: Summer 2007 John Douglas Moore Our goal of these notes is to explain a few facts regarding metric spaces not included in the first few chapters of the text [1],

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

Real Analysis Chapter 4 Solutions Jonathan Conder

Real Analysis Chapter 4 Solutions Jonathan Conder 2. Let x, y X and suppose that x y. Then {x} c is open in the cofinite topology and contains y but not x. The cofinite topology on X is therefore T 1. Since X is infinite it contains two distinct points

More information

Hence, (f(x) f(x 0 )) 2 + (g(x) g(x 0 )) 2 < ɛ

Hence, (f(x) f(x 0 )) 2 + (g(x) g(x 0 )) 2 < ɛ Matthew Straughn Math 402 Homework 5 Homework 5 (p. 429) 13.3.5, 13.3.6 (p. 432) 13.4.1, 13.4.2, 13.4.7*, 13.4.9 (p. 448-449) 14.2.1, 14.2.2 Exercise 13.3.5. Let (X, d X ) be a metric space, and let f

More information

MATH 51H Section 4. October 16, Recall what it means for a function between metric spaces to be continuous:

MATH 51H Section 4. October 16, Recall what it means for a function between metric spaces to be continuous: MATH 51H Section 4 October 16, 2015 1 Continuity Recall what it means for a function between metric spaces to be continuous: Definition. Let (X, d X ), (Y, d Y ) be metric spaces. A function f : X Y is

More information

Notes on Complex Analysis

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

More information

2 (Bonus). Let A X consist of points (x, y) such that either x or y is a rational number. Is A measurable? What is its Lebesgue measure?

2 (Bonus). Let A X consist of points (x, y) such that either x or y is a rational number. Is A measurable? What is its Lebesgue measure? MA 645-4A (Real Analysis), Dr. Chernov Homework assignment 1 (Due 9/5). Prove that every countable set A is measurable and µ(a) = 0. 2 (Bonus). Let A consist of points (x, y) such that either x or y is

More information

Real Analysis. Joe Patten August 12, 2018

Real Analysis. Joe Patten August 12, 2018 Real Analysis Joe Patten August 12, 2018 1 Relations and Functions 1.1 Relations A (binary) relation, R, from set A to set B is a subset of A B. Since R is a subset of A B, it is a set of ordered pairs.

More information

SOLUTIONS TO ADDITIONAL EXERCISES FOR II.1 AND II.2

SOLUTIONS TO ADDITIONAL EXERCISES FOR II.1 AND II.2 SOLUTIONS TO ADDITIONAL EXERCISES FOR II.1 AND II.2 Here are the solutions to the additional exercises in betsepexercises.pdf. B1. Let y and z be distinct points of L; we claim that x, y and z are not

More information

Metric Spaces and Topology

Metric Spaces and Topology Chapter 2 Metric Spaces and Topology From an engineering perspective, the most important way to construct a topology on a set is to define the topology in terms of a metric on the set. This approach underlies

More information

Math 409 Final Exam Solutions May 9, 2005

Math 409 Final Exam Solutions May 9, 2005 Math 49 Final Exam Solutions May 9, 25 1. 25) State and prove the monotone convergence theorem. Then use it to show that the recursive sequence defined below converges to some number l. What must l equal?

More information

Most Continuous Functions are Nowhere Differentiable

Most Continuous Functions are Nowhere Differentiable Most Continuous Functions are Nowhere Differentiable Spring 2004 The Space of Continuous Functions Let K = [0, 1] and let C(K) be the set of all continuous functions f : K R. Definition 1 For f C(K) we

More information

MATH 102 INTRODUCTION TO MATHEMATICAL ANALYSIS. 1. Some Fundamentals

MATH 102 INTRODUCTION TO MATHEMATICAL ANALYSIS. 1. Some Fundamentals MATH 02 INTRODUCTION TO MATHEMATICAL ANALYSIS Properties of Real Numbers Some Fundamentals The whole course will be based entirely on the study of sequence of numbers and functions defined on the real

More information

DR.RUPNATHJI( DR.RUPAK NATH )

DR.RUPNATHJI( DR.RUPAK NATH ) Contents 1 Sets 1 2 The Real Numbers 9 3 Sequences 29 4 Series 59 5 Functions 81 6 Power Series 105 7 The elementary functions 111 Chapter 1 Sets It is very convenient to introduce some notation and terminology

More information

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

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

More information

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

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

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

Lecture 8. Q = [a 1, b 1 ] [a n, b n ], (3.10) width(q) = sup(b i a i ). (3.12) i. from which we define the lower and upper Riemann sums,

Lecture 8. Q = [a 1, b 1 ] [a n, b n ], (3.10) width(q) = sup(b i a i ). (3.12) i. from which we define the lower and upper Riemann sums, Lecture 8 3.2 iemann Integral of Several Variables Last time we defined the iemann integral for one variable, and today we generalize to many variables. Definition 3.3. A rectangle is a subset of n of

More information

Problem List MATH 5143 Fall, 2013

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

The Existence of the Riemann Integral

The Existence of the Riemann Integral The Existence of the Riemann Integral James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University September 18, 2018 Outline The Darboux Integral Upper

More information

Sets and Functions. (As we will see, in describing a set the order in which elements are listed is irrelevant).

Sets and Functions. (As we will see, in describing a set the order in which elements are listed is irrelevant). Sets and Functions 1. The language of sets Informally, a set is any collection of objects. The objects may be mathematical objects such as numbers, functions and even sets, or letters or symbols of any

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

MATH41011/MATH61011: FOURIER SERIES AND LEBESGUE INTEGRATION. Extra Reading Material for Level 4 and Level 6

MATH41011/MATH61011: FOURIER SERIES AND LEBESGUE INTEGRATION. Extra Reading Material for Level 4 and Level 6 MATH41011/MATH61011: FOURIER SERIES AND LEBESGUE INTEGRATION Extra Reading Material for Level 4 and Level 6 Part A: Construction of Lebesgue Measure The first part the extra material consists of the construction

More information

14 Increasing and decreasing functions

14 Increasing and decreasing functions 14 Increasing and decreasing functions 14.1 Sketching derivatives READING Read Section 3.2 of Rogawski Reading Recall, f (a) is the gradient of the tangent line of f(x) at x = a. We can use this fact to

More information

Homework for Section 1.4, Continuity and One sided Limits. Study 1.4, # 1 21, 27, 31, 37 41, 45 53, 61, 69, 87, 91, 93. Class Notes: Prof. G.

Homework for Section 1.4, Continuity and One sided Limits. Study 1.4, # 1 21, 27, 31, 37 41, 45 53, 61, 69, 87, 91, 93. Class Notes: Prof. G. GOAL: 1. Understand definition of continuity at a point. 2. Evaluate functions for continuity at a point, and on open and closed intervals 3. Understand the Intermediate Value Theorum (IVT) Homework for

More information

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

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

More information

FIRST YEAR CALCULUS W W L CHEN

FIRST YEAR CALCULUS W W L CHEN FIRST YER CLCULUS W W L CHEN c W W L Chen, 994, 28. This chapter is available free to all individuals, on the understanding that it is not to be used for financial gain, and may be downloaded and/or photocopied,

More information

Problem Set 2: Solutions Math 201A: Fall 2016

Problem Set 2: Solutions Math 201A: Fall 2016 Problem Set 2: s Math 201A: Fall 2016 Problem 1. (a) Prove that a closed subset of a complete metric space is complete. (b) Prove that a closed subset of a compact metric space is compact. (c) Prove that

More information

Analysis Finite and Infinite Sets The Real Numbers The Cantor Set

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

More information

We say that the function f obtains a maximum value provided that there. We say that the function f obtains a minimum value provided that there

We say that the function f obtains a maximum value provided that there. We say that the function f obtains a minimum value provided that there Math 311 W08 Day 10 Section 3.2 Extreme Value Theorem (It s EXTREME!) 1. Definition: For a function f: D R we define the image of the function to be the set f(d) = {y y = f(x) for some x in D} We say that

More information

Lecture Notes in Advanced Calculus 1 (80315) Raz Kupferman Institute of Mathematics The Hebrew University

Lecture Notes in Advanced Calculus 1 (80315) Raz Kupferman Institute of Mathematics The Hebrew University Lecture Notes in Advanced Calculus 1 (80315) Raz Kupferman Institute of Mathematics The Hebrew University February 7, 2007 2 Contents 1 Metric Spaces 1 1.1 Basic definitions...........................

More information