Consequences of Continuity

Similar documents
Consequences of Continuity

The Limit Inferior and Limit Superior of a Sequence

Upper and Lower Bounds

Bolzano Weierstrass Theorems I

Lower semicontinuous and Convex Functions

The First Derivative and Second Derivative Test

Geometric Series and the Ratio and Root Test

M17 MAT25-21 HOMEWORK 6

The First Derivative and Second Derivative Test

Geometric Series and the Ratio and Root Test

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

5.5 Deeper Properties of Continuous Functions

Dirchlet s Function and Limit and Continuity Arguments

Uniform Convergence Examples

Filters in Analysis and Topology

The Existence of the Riemann Integral

2.31 Definition By an open cover of a set E in a metric space X we mean a collection {G α } of open subsets of X such that E α G α.

Convergence of Sequences

6.2 Deeper Properties of Continuous Functions

Project One: C Bump functions

Proofs Not Based On POMI

Problem Set 2: Solutions Math 201A: Fall 2016

Uniform Convergence Examples

Real Analysis. Joe Patten August 12, 2018

2 Metric Spaces Definitions Exotic Examples... 3

REVIEW OF ESSENTIAL MATH 346 TOPICS

We are going to discuss what it means for a sequence to converge in three stages: First, we define what it means for a sequence to converge to zero

Contents Ordered Fields... 2 Ordered sets and fields... 2 Construction of the Reals 1: Dedekind Cuts... 2 Metric Spaces... 3

General Power Series

Constrained Optimization in Two Variables

Convergence of Sequences

This chapter contains a very bare summary of some basic facts from topology.

Introductory Analysis 1 Fall 2009 Homework 4 Solutions to Exercises 1 3

Hölder s and Minkowski s Inequality

Math 421, Homework #6 Solutions. (1) Let E R n Show that = (E c ) o, i.e. the complement of the closure is the interior of the complement.

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

Mathematical Induction Again

Proofs Not Based On POMI

Mathematical Induction Again

Uniform Convergence and Series of Functions

Introduction to Topology

Math 320-2: Final Exam Practice Solutions Northwestern University, Winter 2015

Definition: A "system" of equations is a set or collection of equations that you deal with all together at once.

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

MTAEA Continuity and Limits of Functions

Math 117: Continuity of Functions

Stat 451: Solutions to Assignment #1

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

Some Background Material

MT804 Analysis Homework II

Math 410 Homework 6 Due Monday, October 26

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

Sequences. Limits of Sequences. Definition. A real-valued sequence s is any function s : N R.

Integration and Differentiation Limit Interchange Theorems

Dirchlet s Function and Limit and Continuity Arguments

MATH 117 LECTURE NOTES

Exam 2 extra practice problems

Economics 204 Fall 2012 Problem Set 3 Suggested Solutions

Convergence of Fourier Series

2.2 Some Consequences of the Completeness Axiom

Maths 212: Homework Solutions

Continuity. Chapter 4

MATH 102 INTRODUCTION TO MATHEMATICAL ANALYSIS. 1. Some Fundamentals

U e = E (U\E) e E e + U\E e. (1.6)

Constrained Optimization in Two Variables

MH 7500 THEOREMS. (iii) A = A; (iv) A B = A B. Theorem 5. If {A α : α Λ} is any collection of subsets of a space X, then

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

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

The Banach-Tarski paradox

A LITTLE REAL ANALYSIS AND TOPOLOGY

Metric Spaces and Topology

Sequences. Chapter 3. n + 1 3n + 2 sin n n. 3. lim (ln(n + 1) ln n) 1. lim. 2. lim. 4. lim (1 + n)1/n. Answers: 1. 1/3; 2. 0; 3. 0; 4. 1.

FUNCTIONAL ANALYSIS LECTURE NOTES: COMPACT SETS AND FINITE-DIMENSIONAL SPACES. 1. Compact Sets

Lebesgue Measure on R n

Real Analysis Math 131AH Rudin, Chapter #1. Dominique Abdi

1 Homework. Recommended Reading:

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

Basic Definitions: Indexed Collections and Random Functions

1. Supremum and Infimum Remark: In this sections, all the subsets of R are assumed to be nonempty.

Course 212: Academic Year Section 1: Metric Spaces

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

The Derivative of a Function

Integration and Differentiation Limit Interchange Theorems

Class Notes for MATH 255.

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

Lecture 2: A crash course in Real Analysis

5.5 Deeper Properties of Continuous Functions

Math 117: Topology of the Real Numbers

Introduction to Topology

Topology Homework Assignment 1 Solutions

Derivatives in 2D. Outline. James K. Peterson. November 9, Derivatives in 2D! Chain Rule

2. Introduction to commutative rings (continued)

THE INVERSE PROBLEM FOR DIRECTED CURRENT ELECTRICAL NETWORKS

Math 4603: Advanced Calculus I, Summer 2016 University of Minnesota Homework Schedule

After taking the square and expanding, we get x + y 2 = (x + y) (x + y) = x 2 + 2x y + y 2, inequality in analysis, we obtain.

are Banach algebras. f(x)g(x) max Example 7.4. Similarly, A = L and A = l with the pointwise multiplication

Locally convex spaces, the hyperplane separation theorem, and the Krein-Milman theorem

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

S. Mrówka introduced a topological space ψ whose underlying set is the. natural numbers together with an infinite maximal almost disjoint family(madf)

MATH Green s Theorem Fall 2016

Transcription:

Consequences of Continuity James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University October 4, 2017 Outline Domains of Continuous Functions The Intermediate Value Theorem Consequences of a compact domain for a continuous function Continuity in terms of inverse images of open sets

In our discussions of continuity, we always assume that f is defined locally at the point p which means there is a radius r so that if x Br (p), f (x) is defined. If at each point p in dom(f ), f is locally defined, this says each such p is an interior point of dom(f ) and so dom(f ) is an open set. Because of the requirement of f being locally defined at each p, we see dom(f ) can not have isolated boundary points. Hence, any boundary points dom(f ) has must be accumulation points. This means if p (dom(f )), there has to be a sequence (xn) in dom(f ), each xn p, with xn p. If for any sequence like this, we know f (xn) a for some value a, this implies limx p f (x) exists and equals a. Hence, we can define f (p) = a and f therefore has a removeable discontinuity at such a p. Now subsets of R can be very complicated, so let s restrict our attention to intervals. An interval of R is a subset I of the following form I = (, a) infinite open interval I = {, a} I = (, a] infinite closed interval I = {, a} I = (a, ) infinite open interval I = {a,, } I = [a, ) infinite closed interval I = {a,, } I = (, ) infinite open and closed interval I = {, } I = (a, b), a < b finite open interval I = {a, b} I = [a, b), a < b finite half open interval I = {a, b} I = (a, b], a < b finite half open interval I = {a, b} I = [a, b], a < b finite closed interval I = {a, b} Continuity at the points in I is possible but not guaranteed. Examples: 1/x is continuous on (0, ) and the boundary point 0 can not be included. x sin(1/x) on (0, 1] can be extended to the boundary point 0 so that x sin(1/x) has a removeable discontinuity at 0. It is possible to talk about boundary points at ± but we won t do that here.

Theorem The Intermediate Value Theorem for [a, b] Let f : [a, b] R be continuous with f (a) f (b). Then if y is between f (a) and f (b), there is at least one c between a and b so that f (c) = y. For concreteness, let s assume f (a) < f (b). We then have f (a) < y < f (b) and we want to find a c so that a < c < b and f (c) = y. Our argument here will be very abstract! So lot s of fun! Let A = {x [a, b] : f (x) y}. Since f (a) < y we know A is non empty. Further, since x = b is the largest value allowed, we see A is bounded. So by the completeness axiom, sup(a) exists and is finite. Let c = sup(a). Since b is an upper bound of A, we see by the definition of supremum, that c b. We now show f (c) = y. (Step 1: f (c) y): (Case (a) ): if c A, then by the definition of A, we must have f (c) y. (Case (b) ): Assume c A. Then applying the Supremum Tolerance Lemma using the sequence of tolerances ɛ = 1/n, we can construct a sequence (xn) with c 1/n < xn c and xn A. Since we are in Case (b), none of these xn can be c. Since f is continuous at c, we then must have limn f (xn) = f (c). But since xn A, we also must have f (xn) y for all n. In general, if an a and bn b with an bn, this implies a b. To see this, note for any ɛ > 0, there is an N1 so that n > N1 implies a ɛ/2 < an < a + ɛ/2 and there is an N2 so that n > N2 implies b ɛ/2 < bn < b + ɛ/2. So for n > max{n1, N2}, we have a ɛ/2 < an bn < b + ɛ/2. But this tells us that a b < ɛ.

Now if a > b, we could choose ɛ = (a b)/2 and then we would have a b < (a b)/2 implying (a b)/2 < 0 which contradicts our assumption. Hence, we must have a b. Applying this result here, f (xn) y for all n thus implies f (c) y. So in either Case (a) or Case (b). f (c) y. (Step 2: f (c) = y): Assume f (c) < y. Since we know y < f (b), this says c < b. Choose ɛ = (1/2)(y f (c)) > 0. Since f is continuous at c, for this ɛ, there is a δ > 0 so that Bδ(c) [a, b] and x c < δ f (x) f (c) < ɛ. Rewriting, we have c δ < x < c + δ f (c) ɛ < f (x) < f (c) + ɛ Since Bδ(c) [a, b], we know (c, c + δ) (c, b]. Now pick a point z in (c, c + δ). Then, f (z) < f (c) + ɛ. But ɛ = (1/2)(y f (c)). Thus, f (z) < (y + f (c))/2. Now we assumed f (c) < y so the average (f (c) + y)/2 < y also. So we have f (z) < y. But this says z A with z > c which is the supremum of A. This is not possible and so our assumption that f (c) < y is wrong and we must have f (c) = y. Theorem The Intermediate Value Theorem for Intervals Let f : I R be continuous. Let a and b be any two points in I with a b and f (a) f (b). Then if y is between f (a) and f (b), there is at least one c between a and b so that f (c) = y.

Apply the Intermediate Value Theorem for [a, b] I and the result follows. Theorem Let I be an interval and assume f is continuous on I. Then f (I ) is also an interval. Let u, v be in f (I ) with u < v. Then there are s, t I so that f (s) = u and f (t) = v. Choose any number y so that u < y < v. (Case (a)): If s < t, since f is continuous on [s, t], by the Intermediate Value Theorem for finite closes intervals, there is a number c with s < c < t with f (c) = y. Thus, y f (I ). (Case (b)) If t < s, we apply the same sort of argument to again show y f (I ). Combining these arguments, we see for any u, v f (I ) with u < v, all u < y < v are also in f (I ). This shows f (I ) is an interval.

What if the domain of a continuous function f is compact? What are the consequences? Theorem If f : dom(f ) R with dom(f ) a compact set, then f (dom(f )) is a compact set also. For convenience, let K = dom(f ). Then f (K) = {f (x) : x K}. Let (yn) be any sequence in f (K). Then there is a sequence (xn) K with yn = f (xn) for all n. Since K is compact, there is a subsequence (x 1 n ) of (xn) so that x 1 n p for some p K. Since f is continuous at p, we then have f (x 1 n ) f (p). ( Recall at a boundary point of K, we would interpret continuity at this point in terms of right or left continuity). Hence (yn) has a subsequence (y 1 n ) = (f (x 1 n )) which converges to an element of f (K). Thus, f (K) is sequentially compact and topologically compact and closed and bounded. Let s recall what we know about minima and maxima of sets. First if a set Ω is nonempty and bounded, it has a finite infimum and supremum. It is a straightforward argument to show there are sequences (x m n ) and (x M n ) so that x m n inf(ω) and x M n sup(ω). If the inf(ω) Ω, then we say the minimum of the set Ω is achieved by at least the point xm = inf(ω) and xn m xm. This is also called the absolute minimum of Ω. If the sup(ω) Ω, then we say the maximum of the set Ω is achieved by at least the point xm = sup(ω) and xn M xm. This is also called the absolute maximum of Ω. So Ω compact implies Ω always has an absolute minimum and maximum value. If K is compact with f continuous, f (K) is compact. Thus, f (K) has an absolute minimum and maximum; i.e. there exist xm, xm K f (xm) f (x) and f (xm) f (x) x K. The points xm and xm need not be unique, of course.

Here are more consequences. If f : [a, b] R is continuous on [a, b], first note this means f is left continuous at b and right continuous at a. Note, to use full circles, we could redefine f like this: f (a), x < a ˆf (x) = f (x), x [a, b] f (b), x > b i.e. we extend f to the right and left based on the f (a) and f (b) value. Then f is continuous at a and b in the usual sense. We don t usually need to be so precise however. So from what we have said f ([a, b]) is compact when f is continuous on K. Thus, f ([a, b]) must have a minimum and maximum value, m and M so that f (x) M = f (xm) and f (x) f (xm) for all x [a, b]. Theorem Let f : [a, b] R be continuous. Then f ([a, b]) = [f (xm), f (xm)] where xm, xm are in [a, b] and f (xm) and f (xm) are the absolute minimum and maximum of f on [a, b], respectively. We already know f ([a, b]) is an interval and it is a compact set. and we have f (xm) f (x) f (xm) for all x [a, b]. Thus f ([a, b]) = [f (xm), f (xm)].

There are even more ways to look at continuity. We know that f is continuous at p if ɛ > 0 δ > 0 x p < δ f (x) f (p) < ɛ, where δ is small enough to fit inside the circle Br (p) on which f is locally defined. Now suppose V was an open set in the range of f. This means every point in V can be written as y = f (x) for some point in the domain of f. Consider f 1 (V ), the inverse image of V under f. This is defined to be f 1 (V ) = {x dom(f ) : f (x) V } Is f 1 (V ) open? Let y0 = f (x0) V for some x0 dom(f ). Since V is open, y0 is an interior point of V and so there is an R > 0 so that BR(y0) V. Then since f is continuous at x0, choose ɛ = R and we see there is a δ > 0 so that if x x0 < δ, where we choose δ < r, with f (x) f (x0) < R. This says Bδ(x0) f 1 (V ) telling us x0 is an interior point of f 1 (V ). Since x0 is arbitrary, we see f 1 (V ) is open. Thus, the inverse image f 1 (V ) of an open set V is open. We can use the idea of inverse images to rewrite continuity at a point p this way. ɛ > 0 δ > 0 x Bδ(p) f (x) Bɛ(f (p)) or ɛ > 0 δ > 0 f (Bδ(p)) Bɛ(f (p)) or ɛ > 0 δ > 0 Bδ(p) f 1 (Bɛ(f (p))) Theorem f is continuous on the set D if and only if f 1 (V ) is an open set whenever V is open.

( ): We assume f is continuous on the set D. Let V in the range of f be an open set. By the arguments we have already shown you earlier, we know every point x0 f 1 V is an interior point and so f 1 (V ) is an open set. ( ): We assume f 1 (V ) is an open set when V is open. Since V is open, given y0 in V, there is a radius R so that BR(y0) is contained in V. Choose any ɛ > 0. If ɛ R, argue this way: The set BR(y0) is open and so by assumption, f 1 (BR(y0)) is open. Thus there is an x0 f 1 (BR(y0)) so that y0 = f (x0). By assumption, x0 must be an interior point of f 1 (BR(y0)). So there is a radius r so that Br (x0) is contained in f 1 (BR(y0)). So x Br (x0) f (x) BR(y0). Said another way, x x0 < r f (x) f (x0) < R ɛ. On the other hand, if ɛ < R, we can argue almost the same way: instead of using the set BR(y0), we just use the set Bɛ(y0) which is still open. The rest of the argument goes through as expected! Comment Note here we are explicitly talking about continuity on the full domain not just at one point! This suggests how to generalize the idea of continuity to very general situations. A topology is a collection of subsets T of a set of objects X which is closed under arbitrary unions, closed under finite intersections and which contains both the empty set and the whole set X also. Our open sets in R as we have defined them are a collection like this. In this more general setting, we simply define the members of this set T to be what are called open sets even though they may not obey our usual definition of open.

Comment (Continued): Now the set X with the topology T is called a topological space and we denote it by the pair (X, T ). If (Y, S) is another topological space, based on what we have seen, an obvious way to generalize continuity is to say f : Ω X Y is continuous on Ω means f 1 (V ) is in T for all V S. Again, inverse images of open sets are open is a characterization of continuity. Note a set of objects can have many different topologies so continuity depends on the choice of topology really. For us we always use the topology of open sets in R which is nice and comfortable! This is very abstract but it is generalizations like this that have let us solve some very hard problems! Homework 17 17.1 Prove limx 1 14x + 25 exists. using an ɛ δ argument. 17.2 Prove limx 2(3x + 2)/(4x 2 + 8) exists using an ɛ δ argument. 17.3 f (x) = 3x 2 5 on [ 3, 6]. Find f ([ 3, 6]) which requires you to find the minimum and maximum of f on this domain. f (x) = 1/x 2 on (0, ). Find f (0, ). Note this is an interval. f (x) = 4x 4 + 35x 2 + 10 on (0, 4). Is f (0, 4) an interval? f (x) = 5x 7 23x 2 + 85 on ( 1, 6). Is f ( 1, 6) compact? This is meant to be a thought provoking question. In general, this is hard to answer. For example, if f (x) = sin(x), on ( π, π), we know the image f (( π, π)) is an interval. The domain is not compact, so we are NOT guaranteed that the image is compact. But here, the maximum occures at +1 and the minimum occurs at 1. So the range f (( π, π)) = [ 1, 1] which is compact even though the domain is not compact. So to answer this question, you need information about the minimum and maximum of this function. So graph it in MatLab, Sage etc and see what you find.