Scribd
Upload
36 views

MIT18 100CF12 Prob Set 3

This document contains solutions to problems from an 18.100C real analysis course. It proves several results about metric spaces, dense subsets, and the existence of fixed points for contracting mappings on compact metric spaces. It shows that if (X,d) is a metric space, then (X,d') where d'(x,y)=d(x,y) is also a metric space with the same open sets. It proves Qn is dense in Rn and that isolated subsets of metric spaces are at most countable. It establishes properties of finite subsets used to show any space where infinite subsets have limit points is separable. Finally, it proves any contracting function on a compact metric space has a fixed point.

Uploaded by

Daniel Lee Eisenberg Jacobs
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
36 views

MIT18 100CF12 Prob Set 3

This document contains solutions to problems from an 18.100C real analysis course. It proves several results about metric spaces, dense subsets, and the existence of fixed points for contracting mappings on compact metric spaces. It shows that if (X,d) is a metric space, then (X,d') where d'(x,y)=d(x,y) is also a metric space with the same open sets. It proves Qn is dense in Rn and that isolated subsets of metric spaces are at most countable. It establishes properties of finite subsets used to show any space where infinite subsets have limit points is separable. Finally, it proves any contracting function on a compact metric space has a fixed point.

Uploaded by

Daniel Lee Eisenberg Jacobs
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

Problem Set 3 Solutions, 18.

100C, Fall 2012

September 26, 2012

1
We have a metric space (X, d), and dene the function d' (x, y ) = d(x, y ). We wish to show that (X, d' ) is also a metric space with the same open sets as (X, d). We rst check that d' is a metric. (a) If x = y , then d' (x, y ) = larly d' (x, x) = 0. (b) d' (x, y ) = d(x, y ) = d(x, y ) > 0 since d(x, y ) > 0, and simi

d(y, x) = d' (y, x)

(c) For the triangle inequality, we rst need the following elementary Fact: If a, b 0, then a+b a+ b.

Indeed, squaring the right hand side gives a + b + 2 ab a + b, and the square root function is order preserving. Using this fact, for x, y, z X we have d' (x, z ) = d(x, z ) d(x, y ) + d(y, z ) d(x, y )+ d(y, z ) = d' (x, y )+d' (y, z )

Now, let E be an open set for E . We need to show that it is open for d' . Let x E . Then there is some r > 0 such that the ball of radius r around x is contained in E , where the ball is taken with respect to d, i.e. Nr (x) E . But the ball of radius r with respect to d is the ball of radius r with respect to d' , so there is a neighbourhood of x with respect to d' contained in E . In other words, E is open with respect to d' . Similarly, a set that is open with respect to d' is also open with respect to d. 1

2
We prove the result for Rn . Lemma: Qn is dense in Rn . Proof: Just use the density of Q in R for each coordinate. Theorem: Let n N and let S Rn be a set such that every point in S is isolated. Then S is at most countable. Proof: Fix s S . Since s is an isolated point, there exists an r s > 0 such that Nr s /2 and pick an element ts Nrs (s) Qn . s (s) S = {s}; let rs = r Doing this for each s denes a function f : S Qn , s ts . We now go about showing that f is injective; since Qn is countable this will show S is at most countable. Suppose f (s) = f ( s) and let t = f (s). Then t = ts = ts s). Nrs (s) Nrs ( Thus s , r s d(s, s ) d(t, s) + d(t, s ) < rs + rs max{r } s) or s Nr . so either s Nr s s (s). In either case we obtain s = s (

3
X is a space where every innite subset has a limit point. We rst prove the following Lemma 1: Let > 0. Then there exists a nite set N with the follow ing properties: (a) For every x, y N , x = y , d(x, y ) 0. (b) For every z X , there exists a y N such that d(z, y ) < . Fix > 0. We construct N inductively. Pick an arbitrary x1 X . Assume we have x1 , x2 . . . xm with d(xi , xj ) for i = j . If every point of X is within of {x1 , . . . xm }, then we can take N = {x1 , . . . xm } which satises (a) and (b) of the lemma. If not, we choose xm+1 such that d(xm+1 , xi ) for 1 i m.

We claim that this process must terminate at some nite M , at which point we are done. If not, then by this process we have constructed an innite set C = {x1 , x2 , x3 . . .} with d(xi , xj ) for i = j . By our assumption on X , this set has a limit point x. Now consider the open neighbourhood N/4 (x). This must contain two distinct points xi = xj = x (in fact, innitely many points, by Theorem 2.20.) Using the triangle inequality, we have d(xi , xj ) d(xi , x) + d(x, xj ) < /4 + /4 = /2 A contradiction. Using the above Lemma, for each m N, we have a nite set N1/m such that every point of X is within 1/m of some point of N1/m . Let D = m N1/m . D is a countable union of nite sets, and hence is countable. We claim that D is dense. Take any x X , and r > 0. Pick an m suciently large that 1/m < r. Then by denition there is a y N1/m D such that d(x, y ) < 1/m. But then y Nr (x). Since x and r are arbitrary, this proves that D is dense.

4
Let A = {p R|p = d(x, f (x) for some x X }. Since distances are non negative A is bounded below by 0. Let a = inf A. Obviously a 0. We make the following claim, which we will prove later Claim: There exists x X such that d(x, f (x)) = a. In other words, the inmum is actually attained in A. Now, assuming the claim, if a = 0, then we are done, since 0 = d(x, f (x)) so x = f (x) is a xed point. So suppose a > 0. Then x = f (x). Set y = f (x). Then we have d(y, f (y )) A, and d(y, f (y )) = d(f (x), f (y )) < d(x, y ) = d(x, f (x)) = a

Which is a contradiction, since a is a lower bound for A. So a = 0 and we are done. Proof of the claim: suppose the claim is false. Dene the set Un = {x 3

X |d(x, f (x)) > a +1/n}. We claim that the sets Un cover X . For any x X , since the inf is not attained, we must have d(x, f (x)) = a + r where r > 0. Take n N suciently large that r > 1/n. Then d(x, f (x)) > a + 1/n, so x Un and the Un s cover X . We claim that Un is open. To see this, let x Un . Then d(x, f (x) > a + 1/n. Choose a small E > 0 such that E < (d(x, f (x)) a 1/n)/2; then d(x, f (x)) 2E > a + 1/n. Then we have NE (x) Un . To see this, let y NE (x). Note that d(f (x), f (y )) < d(x, y ) < E since f is contracting. Then using the triangle inequality twice, we have

d(x, f (x)) d(x, y )+d(y, f (x)) d(x, y )+d(y, f (y ))+d(f (y ), f (x)) < E+d(y, f (y ))+E

Rearranging this, we get d(y, f (y )) > d(x, f (x)) 2E > a + 1/n

So y Un . Thus we have showed that every point of Un has a neighbour hood contained entirely in Un , so Un is open. In other words, we have constructed an open cover {Un } of X . Since X is compact, this cover has a nite subcover {Un1 , . . . Unm }; assume we have labelled these such that ni < nj for i < j . Note that the Un are increasing, i.e. Um Un if m < n. Thus Uni Unm , and so {Unm } also covers X , i.e. X = Unm . But then for all x X , we have d(x, f (x)) > a + 1/nm by the denition of Unm . Thus a + 1/nm is a lower bound for A strictly larger than a, which contradicts the fact that a = inf A. This proves the claim, and hence the result.

MIT OpenCourseWare http://ocw.mit.edu

18.100C Real Analysis


Fall 2012

For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy