POL502: Limits of Functions and Continuity

Similar documents
1 if 1 x 0 1 if 0 x 1

Notes on metric spaces

Metric Spaces. Chapter Metrics

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

MA4001 Engineering Mathematics 1 Lecture 10 Limits and Continuity

FIRST YEAR CALCULUS. Chapter 7 CONTINUITY. It is a parabola, and we can draw this parabola without lifting our pencil from the paper.

Real Roots of Univariate Polynomials with Real Coefficients

1. Prove that the empty set is a subset of every set.

Undergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics

36 CHAPTER 1. LIMITS AND CONTINUITY. Figure 1.17: At which points is f not continuous?

Practice with Proofs

The Mean Value Theorem

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

Vieta s Formulas and the Identity Theorem

BANACH AND HILBERT SPACE REVIEW

4 Lyapunov Stability Theory

Metric Spaces Joseph Muscat 2003 (Last revised May 2009)

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES

ON SEQUENTIAL CONTINUITY OF COMPOSITION MAPPING. 0. Introduction

H/wk 13, Solutions to selected problems

Rolle s Theorem. q( x) = 1

Continuity. DEFINITION 1: A function f is continuous at a number a if. lim

CHAPTER 3. Methods of Proofs. 1. Logical Arguments and Formal Proofs

88 CHAPTER 2. VECTOR FUNCTIONS. . First, we need to compute T (s). a By definition, r (s) T (s) = 1 a sin s a. sin s a, cos s a

TOPIC 4: DERIVATIVES

1. Let P be the space of all polynomials (of one real variable and with real coefficients) with the norm

I. Pointwise convergence

LIMITS AND CONTINUITY

Two Fundamental Theorems about the Definite Integral

Chapter 4. Polynomial and Rational Functions. 4.1 Polynomial Functions and Their Graphs

MA651 Topology. Lecture 6. Separation Axioms.

Finite dimensional topological vector spaces

Math 120 Final Exam Practice Problems, Form: A

Representation of functions as power series

Continued Fractions and the Euclidean Algorithm

MATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1.

Linear Algebra Notes for Marsden and Tromba Vector Calculus

U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, Notes on Algebra

Normal distribution. ) 2 /2σ. 2π σ

Differential Operators and their Adjoint Operators

4.3 Lagrange Approximation

Basic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011

Polynomial and Rational Functions

PYTHAGOREAN TRIPLES KEITH CONRAD

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

3.3 Real Zeros of Polynomials

THE BANACH CONTRACTION PRINCIPLE. Contents

10.2 Series and Convergence

MOP 2007 Black Group Integer Polynomials Yufei Zhao. Integer Polynomials. June 29, 2007 Yufei Zhao

Lectures 5-6: Taylor Series

LEARNING OBJECTIVES FOR THIS CHAPTER

Metric Spaces. Chapter 1

Section 3.7. Rolle s Theorem and the Mean Value Theorem. Difference Equations to Differential Equations

PUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include

Algebraic and Transcendental Numbers

MATH 4330/5330, Fourier Analysis Section 11, The Discrete Fourier Transform

Lecture 7: Continuous Random Variables

FUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES

SECTION 10-2 Mathematical Induction

How To Find Out How To Calculate A Premeasure On A Set Of Two-Dimensional Algebra

Math 55: Discrete Mathematics

Homework # 3 Solutions

Cartesian Products and Relations

Inner product. Definition of inner product

SOLUTIONS TO EXERCISES FOR. MATHEMATICS 205A Part 3. Spaces with special properties

Math 4310 Handout - Quotient Vector Spaces

Fixed Point Theorems

Separation Properties for Locally Convex Cones

I. GROUPS: BASIC DEFINITIONS AND EXAMPLES

DIFFERENTIABILITY OF COMPLEX FUNCTIONS. Contents

Section 1.3 P 1 = 1 2. = P n = 1 P 3 = Continuing in this fashion, it should seem reasonable that, for any n = 1, 2, 3,..., =

0 0 such that f x L whenever x a

6. Define log(z) so that π < I log(z) π. Discuss the identities e log(z) = z and log(e w ) = w.

THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS

2.2 Derivative as a Function

5.3 Improper Integrals Involving Rational and Exponential Functions

Sequences and Series

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

3. Mathematical Induction

Duality of linear conic problems

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

Application. Outline. 3-1 Polynomial Functions 3-2 Finding Rational Zeros of. Polynomial. 3-3 Approximating Real Zeros of.

GRE Prep: Precalculus

Inner Product Spaces

CONTINUED FRACTIONS AND PELL S EQUATION. Contents 1. Continued Fractions 1 2. Solution to Pell s Equation 9 References 12

MEASURE AND INTEGRATION. Dietmar A. Salamon ETH Zürich

FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z

it is easy to see that α = a

MATH 425, PRACTICE FINAL EXAM SOLUTIONS.

Mathematical Induction

Mathematical Methods of Engineering Analysis

Econometrics Simple Linear Regression

5.1 Radical Notation and Rational Exponents

MA107 Precalculus Algebra Exam 2 Review Solutions

Critical points of once continuously differentiable functions are important because they are the only points that can be local maxima or minima.

The sample space for a pair of die rolls is the set. The sample space for a random number between 0 and 1 is the interval [0, 1].

Prime Numbers and Irreducible Polynomials

Limits and Continuity

So let us begin our quest to find the holy grail of real analysis.

Reference: Introduction to Partial Differential Equations by G. Folland, 1995, Chap. 3.

Transcription:

POL502: Limits of Functions and Continuity Kosuke Imai Department of Politics, Princeton University October 18, 2005 In this chapter, we study limits of functions and the concept of continuity. Now that we have a good understanding of limits of sequences, it should not be too difficult to investigate limits of functions. Indeed, as we shall see below, there exists a strong connection between sequential and functional limits. Throughout the chapter, we focus on real-valued functions, f : X R where X R. 1 Limits of Functions First, we formally define the limit of functions Definition 1 Let f : X R, and let c be an accumulation point of the domain X. Then, we say f has a limit L at c and write lim x c f(x) = L, if for any ɛ > 0, there exists a δ > 0 such that 0 < x c < δ and x X imply f(x) L < ɛ. A few remarks about this definition are worthwhile. First, 0 < x c is an economical way of saying that x differs from c. Second, recall the definition of an accumulation point (or limit point) of a set. Every neighborhood of such a point must contain infinitely many points of the set that are different from itself. Also, recall that an accumulation point does not have to belong to the set. That is, c might not belong to X. Together, the definition says that we must find δ > 0 such that if x (c δ, c + δ), then f(x) (L ɛ, L + ɛ). Note that the choice of δ often depends on the choice of ɛ. Finally, if f has a limit L at c, it is unique. You should be able to prove this fact by now. Example 1 Find the following limits if they exist. 1. f : R R and lim x 2 f(x) where f(x) = 2x + 1. 2. f : R R and lim x 1 f(x) where f(x) = x2 1 x 1 if x 1 and f(x) = 6 if x = 1. 3. f : R \ 0 R and lim x 0 f(x) where f(x) = x x. 4. f : (0, 1) R and lim x 0 f(x) where f(x) = 1/x. In some cases, there is no finite limit but the function is approaching to infinity (or minus infinity). Then, we write lim x c f(x) = or lim x c f(x) =. Definition 2 Let f : X R be a function and c X be an accumulation point of X. lim x c f(x) = if for every m > 0 there exists δ > 0 such that f(x) m for any x with 0 < x c < δ. 1

lim x c f(x) = can be defined in a similar way. In the above example, we saw that the function 1/x does not have a limit at zero because it blows up near zero. This fact can be generalized by the following theorem, Theorem 1 (Limits and Bounds of Functions) Let f : X R and suppose c is an accumulation point of X. If f has a limit at c, then there is a neighborhood Q of c and a real number m such that for all x Q X, f(x) m. By now, you might guess that there is the strong connection between limits of sequences and functions. The next theorem directly establishes this connection. Once we prove it, we can apply to limits of functions many results that we have derived for limits of sequences. In fact, the previous theorem can also be proved by applying this theorem. Theorem 2 (Sequential and Functional Limits) Let f : X R, and let c be an accumulation point of X. Then, f has a limit L at c if and only if the sequence {f(x)} n=1 converges to L for any sequence {x n } n=1 converging to c with x n X and x n c for all n. The following results follow immediately from this theorem. Theorem 3 (Algebraic Operations of Functional Limits) Let f, g : X R with c being an accumulation point of X. Assume that lim x c f(x) = L and lim x c g(x) = M. 1. lim x c kf(x) = kl for all k R. 2. lim x c {f(x) + g(x)} = L + M. 3. lim x c {f(x)g(x)} = LM. 4. lim x c f(x) g(x) = L M provided M 0. The functional limits also respect the order, Theorem 4 (Order of Functional Limits) Let f, g : X R and c be an accumulation point of X. Assume that lim x c f(x) = L and lim x c g(x) = M. If f(x) g(x) for all x X, then L M. Finally, monotone functions can be defined in a manner completely analogous to monotone sequences. Definition 3 (Monotone Functions) Let f : X R. 1. The function f is said to be increasing if f(x 1 ) f(x 2 ) for all x 1, x 2 X with x 1 x 2. 2. The function f is said to be decreasing if f(x 1 ) f(x 2 ) for all x 1, x 2 X with x 1 x 2. 3. If f is either increasing or decreasing, then f is said to be monotone. 2

2 Continuous Functions In the discussion of functional limits, we did not care at all about the value of f at c, i.e., f(c). In fact, c, an accumulation point of X, did not have to belong to X. When discussing continuity on the other hand, we need to focus our attention on the value of f at c. Definition 4 (Continuity) Let f : X R be a function. 1. f is said to be continuous at c X if for any ɛ > 0, there exists a δ > 0 such that x c < δ and x X imply f(x) f(c) < ɛ. 2. f is said to be continuous on X if it is continuous at every x X. In words, f is continuous at c if f(x) is close to f(c) whenever x is sufficiently close to c. Let s compare this definition with the definition of functional limits. There is no requirement that c be an accumulation point. Instead, c must belong to the set X. Finally, we do not require x to be different from c. In fact, if c is not an accumulation point and c belongs to X, then f is automatically continuous at c because you can always find δ > 0 small enough so that x c < δ and x X imply x = c and hence f(x) f(c) = 0 < ɛ for any ɛ > 0. Therefore, the only interesting case is that c is an accumulation point and belongs to X. In this case, the definition of continuity requires that f(c) to be the limit at c. Now, let s look at examples. Example 2 Are the following functions continuous? 1. f : [0, ) R where f(x) = x. 2. f : R \ 0 R where f(x) = 1 x. We characterize the relationship between continuity and limit with the following theorem, Theorem 5 (Characterization of Continuity) Let f : X R be a function and c X be an accumulation point of X. Then, the following three statements are equivalent. 1. f is continuous at c. 2. lim x c f(x) = f(c). 3. For every sequence {x n } n=1 converging to c with x n X for all n, {f(x n )} n=1 converges to f(c). As expected, usual algebraic operations work well with continuous functions. Theorem 6 (Algebraic Operations of Continuous Functions) Let f : X R and g : X R be continuous at c X. Then, 1. f + g is continuous at c. 2. fg is continuous at c. 3. f g is continuous at c provided g(c) 0. The following theorem allows one to expand the class of continuous functions easily. Theorem 7 (Continuity of Compound Functions) Let f : X R and g : Y R with f(x) Y. Assume that f is continuous at c X and g is continuous at f(c). Then, g f is continuous at c. These two theorems are very powerful. For example, you can very easily prove f : R R where f(x) = 2x 2 + 1 is continuous. 3

3 Uniform Continuity and Compact Sets In this section, we consider the concept of uniform continuity, which is formally defined as follows Definition 5 A function f : X R is uniformly continuous on X if for any ɛ > 0, there exists a δ > 0 such that x y < δ and x, y X imply f(x) f(y) < ɛ. Compare this with the definition of continuity. Uniform continuity is stronger than continuity. That is, a function can be continuous even if it is not uniformly continuous, though every uniformly continuous function is also continuous. Continuity says that given ɛ > 0 and a particular point c X we can find a δ > 0 such that f(x) f(c) < ɛ. The choice of δ may depend on c as well as ɛ. In contrast, uniform continuity says that for all c X and any given ɛ, we can find a δ such that f(x) f(c) < ɛ. Here, the choice of δ cannot depend on c though it may depend on ɛ. To further help us distinguish these two concepts, consider the following examples. Example 3 Are the following functions uniformly continuous? 1. f : R R defined by f(x) = 3x + 1. 2. f : (2.5, 3) R defined by f(x) = 3/(x 2). 3. f : R R defined by f(x) = x 2. 4. f : (0, 1) R defined by f(x) = 1/x. The next theorem proves the connection between uniform continuity and limit. Theorem 8 (Uniform Continuity and Limits) Let f : X R be a uniformly continuous function. If c is an accumulation point of X, then f has a limit at c. In order to further investigate the relationship between continuity and uniform continuity, we need to introduce some new concepts. Definition 6 Let X R be a set. 1. X is an open set if for each x X there exists a neighborhood Q of x such that Q X. 2. X is a closed set if every accumulation point of X belongs to X. As we expect, an open interval is an open set and a closed interval is a closed set. Example 4 Let a, b R. Then, 1. (a, b) = {x : a < x < b} is open. 2. [a, b] = {x : a x b} is closed. [a, b] is an example of a perfect set, a closed set X such that every x X is also an accumulation point of X. Now, we establish the relationship between open and closed sets. Theorem 9 (Open and Closed Sets) Let X R be a set. X is closed if and only if R \ X is open. We define the notion of a compact set. Before doing so, we must introduce some terminology. 4

Definition 7 Let X R be a set and {Y α } α A be a collection of sets. 1. {Y α } α A is a cover of X if X α A Y α. 2. {Y α } α A is an open cover of X if {Y α } α A is a cover of X and each Y α is an open set. 3. {Y α } α B is a subcover of X if both {Y α } α A and {Y α } α B are a cover of X and B A. 4. {Y α } α B is a finite subcover of X if {Y α } α B is a subcover of X and B is a finite set. Definition 8 Let X R be a set. X is compact if every open cover of X has a finite subcover. What a mess! We will try to understand this definition first by examples and then an important theorem about compactness. Example 5 Find an open cover for the following sets. Can you also find a finite subcover? 1. (0, 1). 2. [0, 1]. 3. (0, 1]. 4. N. Notice that (0, 1) is open and bounded, [0, 1] is closed and bounded, and N is closed and unbounded. Now, we can guess that compact sets must be closed and bounded. This intuition is confirmed by the following important theorem. Theorem 10 (Heine-Borel) Let X R be a set. X is compact if and only if it is closed and bounded. Finally, we show that a continuous function with the domain being a compact set is uniformly continuous. Theorem 11 (Continuity and Uniform Continuity) Let f : X R be a continuous function. If X is compact, then f is uniformly continuous. 5

4 Properties of Continuous Functions The results of the previous section has many important implications, which we further explore in this section. First, we show that uniformly continuous functions preserve bounded sets. Theorem 12 (Preservation of Bounded Sets) If f : X R is uniformly continuous on a bounded set X, then f(x) is a bounded set. Next, suppose f : X R is continuous with X compact. Then, f is uniformly continuous and X is bounded. Therefore, f(x) is also bounded. If we can prove that f(x) is closed, then it implies that continuous functions preserve compact sets. Before we prove this, we need to establish a connection between compact sets and convergence of sequences by recalling some key properties of bounded sequences (i.e., Bolzano-Weirstrass Theorem). Theorem 13 (Sequences and Compact Sets) A set X is compact if and only if every sequence in X has a subsequence that converges to a limit x X. Next, we are ready to prove the theorem, Theorem 14 (Preservation of Compact Sets) Let f : X R be a continuous function. If Y X is a compact set, then f(y ) is also compact. Given this result, the following theorem is immediate, Theorem 15 (Extreme Value Theorem) If f : X R is continuous on a compact set X, then there exists x 0, x 1 X such that f(x 0 ) f(x) f(x 1 ) for all x X. In words, this theorem implies that a continuous function on a compact set is guaranteed to have a maximum and a minimum. This leads to the next theorem. Theorem 16 (Intermediate Value Theorem) Let f : [x 0, x 1 ] R be a continuous function. If f(x 0 ) < 0 < f(x 1 ) or f(x 0 ) > 0 > f(x 1 ), then there exists c (x 0, x 1 ) such that f(c) = 0. The intermediate theorem holds even if one replaces 0 with an arbitrary number y R. One can easily prove this by considering a function g(x) = f(x) y. Now, we use the Intermediate Value theorem to prove a couple of useful theorems. Theorem 17 (Root of Polynomial) Let f : R R be a polynomial of odd degree with real coefficients, i.e., f(x) = a 0 + a 1 x +... + a n x n where n is odd. Then the equation f(x) = 0 has at least one real root. The story about the next theorem goes as follows. Consider two sheets of papers of identical size, one lying on top of the other. Now, you crumple the top sheet (be careful not to rip it) and put it back on top of the other sheet. It turns out that there exists at least one point on the top sheet which lies exactly above the corresponding point of the bottom sheet. Let s prove this. Definition 9 Let f be a real-valued function. x is a fixed point of f if f(x) = x. Theorem 18 (Fixed Point Theorem) Let f : [a, b] [a, b] be continuous on [a, b]. Then, f has a fixed point in [a, b]. The proof was so easy, wasn t it? Do you feel empowered now? Armed with the solid understanding of functional limits and continuity, we now move on to the next topic, calculus. 6