MATH 3224 Topology Problem Set 5, Solutions

1. (a) We must show that given any > 0 we can nd N Z+ such that d(fn , fm ) < for all n, m N . Now d(fn , fm ) = = sup{|fn (x) fm (x)| : x [0, 1]} = sup{| (sup{|x| : x [0, 1]}) x x | : x [0, 1]} n m 1 1 1 1 = max{1/n, 1/m} n m n m

Hence, given > 0, we can choose any N Z+ such that N > 1/, since then for all n, m N , 1 < . d(fn , fm ) N (b) Again, the main job is to estimate d(fn , fm ): d(fn , fm ) = sup{|fn (x) fm (x)| : x [0, 1]} = sup{|(x + = sup{| 1 3 1 ) (x + )3 | : x [0, 1]} n m

3|n1 m1 | + 3|n2 m2 | + |n3 m3 | 3 max{n1 , m1 } + 3 max{n2 , m2 } + max{n3 , m3 }

1 3x2 1 3x 3x 3x2 + 2 + 3 + 2 + 3 | : x [0, 1]} n n n m m m sup{3x2 |n1 m1 | + 3x|n2 m2 | + |n3 m3 | : x [0, 1]}

3 max{n1 , m1 } + 3 max{n1 , m1 } + max{n1 , m1 } = 7 max{n1 , m1 }.

Hence, given > 0, we can choose any N Z+ such that N > 7/, since then for all n, m N , 1 d(fn , fm ) 7 < . N 2. (a) For all x, y [0, 1], d((x), (y )) = 1 1 x3 + 1 y 3 + 1 = |x3 y 3 | = |x y ||x2 + xy + y 2 | 4 4 4 4 1 1 3 |x y |{|x|2 + |x||y | + |y |2 } |x y |{1 + 1 + 1} = |x y |. 4 4 4

3 ). Hence is a contraction mapping (with k = 4

(b) Since is dierentiable, we can use the Mean Value Theorem. For all x, y R with x = y , there is some c between x and y such that d((x), (y )) 1 + c2 1 (x) (y ) 1 1 c2 = = . = (c) = 2 2 d(x, y ) xy 2(1 + c ) 2(1 + c2 )2 2(1 + c2 ) 2
1 Hence, for all x, y , x = y , d((x), (y )) 2 d(x, y ). The same inequality holds trivially if 1 x = y , so we conclude that is a contraction mapping (with contraction factor k = 2 ).

(c) For all f, g C ([0, 1], R), d(f, g ) = and d((f ), (g )) Now |(f )(x) (g )(x)| = = 85 sup{|f (x) g (x)| : x [0, 1]} sup{|(f )(x) (g )(x)| : x [0, 1]}. 1 |f (0) + xf (1 x) g (0) xg (1 x)| 3 |x| 1 |f (0) g (0)| + |f (1 x) g (1 x)| 3 3 1 1 |f (0) g (0)| + |f (1 x) g (1 x)|, 3 3

for all x [0, 1]. But |f (0) g (0)| d(f, g ) and sup{|f (1 x) g (1 x)| : x [0, 1]} = d(f, g ) since 1 x [0, 1] if and only if x [0, 1]. Hence d((f ), (g )) 1 2 1 d(f, g ) + d(f, g ) = d(f, g ), 3 3 3

so is a contraction mapping (with contraction factor k = 2 3 ). (d) For all f, g C ([1, 1], R), and all x [1, 1],
x x

|(f )(x) (g )(x)|

=
1 x

t3 sin t(f (t) g (t)) dt

|t3 || sin t||f (t) g (t)| dt

x 1 1

|t3 | 1 d(f, g ) dt = d(f, g )

1 0

|t3 | dt d(f, g )

|t3 | dt

= 2d(f, g ) Since this holds for all x [1, 1],

1 t3 dt = d(f, g ). 2

d(f, g ) = sup{|(f )(x) (g )(x)| : x [1, 1]} so is a contraction mapping (with contraction factor k = 1 2 ).

1 d(f, g ), 2

(e) The important thing to note in this example is that f C ([0, 1], [0, 1]) implies 0 f (t) 1 for all t [0, 1], so we have immediate pointwise bounds on f (t). So, for all f, g C ([0, 1], [0, 1]), and all x [0, 1],
x

|(f )(x) (g )(x)|

=
0 x

t(f (t) sin f (t) g (t) sin g (t)) dt t|f (t) sin f (t) g (t) sin g (t)| dt

0 x 0 x

t|f (t) sin f (t) f (t) sin g (t) + f (t) sin g (t) g (t) sin g (t)| dt t{|f (t)|| sin f (t) sin g (t)| + |f (t) g (t)|| sin g (t)|} dt.

Since f, g : [0, 1] [0, 1] we know that |f (t)| 1 for all t. Furthermore sin is strictly increasing on [0, 1] and sin 0 = 0, so | sin g (t)| sin 1 < 1. Using the Mean Value Theorem, we see that | sin f (t) sin g (t)| |f (t) g (t)| since there is some c between f (t) and g (t) such that | sin f (t) sin g (t)| = |f (t) g (t)|| cos c|. Hence
x

|(f )(x) (g )(x)|

t{|f (t) g (t)| + |f (t) g (t)|| sin 1|} dt

x

(1 + sin 1)d(f, g ) Since this holds for all x [0, 1],

t dt =
0

x2 (1 + sin 1)d(f, g ). 2

d(f, g ) = sup{|(f )(x) (g )(x)| : x [1, 1]}

1 (1 + sin 1)d(f, g ), 2

so is a contraction mapping (with contraction factor k = 1 2 (1 + sin 1) < 1).

86

3. We can show this directly by exhibiting a pair of points x, y such that |(x) (y )| |x y |. Heres a slicker argument. Since (R, d) is complete, if were a contraction mapping, it would have a unique xed point, by the Contraction Mapping Theorem. But has three xed points, 0 and log 2 (you nd these by solving (x) = x), so it cant be a contraction mapping.
3 4. Note that x solves the equation if and only if it is a xed point of the mapping (x) = 1 5 (2 x ). This maps [0, 1] into [0, 1], and [0, 1] equipped with the metric d(x, y ) = |x y | is a complete metric space, so the result follows from the Contraction Mapping Theorem if we can show that : [0, 1] [0, 1] is a contraction mapping. Now

|(x) (y )| =

1 3 1 3 |x y 3 | = |x y ||x2 + xy + y 2 | |x y |, 5 5 5

3 ). Hence has a unique xed so is a contraction mapping (with contraction factor k = 5 point in [0, 1], so the equation has a unique solution in [0, 1].

5. (a) Let f : X Y be locally Lipschitz and xn x in X . There exists a neighbourhood U of x and a constant k > 0 such that (f (x ), f (x )) kd(x x ) for all x , x U . Since xn x, there exists N Z+ such that n N implies xn U . But then, for all n N , (f (xn ), f (x)) kd(xn , x), and d(xn , x) 0, so f (xn ) f (x) by the Squeeze Rule. Hence f is sequentially continuous. Since X is a metric space, it follows that f is continuous (Theorem 136). (b) Let X = Y = R with the usual metric, d(x, y ) = (x, y ) = |x y |. Then f (x) = x 3 is continuous but is not locally Lipschitz. To see this, imagine f were locally Lipschitz. Then there would exist some neighbourhood U of 0 and some constant k > 0 such that 1 1 for all x U , |x 3 0 3 | k |x 0|. But 1/n 0, so there is some N Z+ such that 1 2 1/n U for all n N , and hence |(1/n) 3 | = n 3 k for all n N . But his is false (the 2 sequence n 3 is unbounded above). (c) Let X = Y = R with the usual metric as above, and let f (x) = x2 . Then |f (x ) f (x )| = |x + x ||x x | so for each x R we may take the neighbourhood U = (x 1, x + 1) and the constant k = 2|x| + 2 > 0. Hence f is locally Lipschitz. It is not globally Lipschitz however since, for example |f (x) f (0)|/|x 0| = |x| is an unbounded function on R\{0} (so there is no k > 0 such that |f (x) f (0)| k |x 0| for all x R).
1

(d) By assumption f : [a, b] R is continuous, hence bounded ([a, b] is compact, so f ([a, b]) is a compact subset of R, which is a metric space, so f ([a, b]) is bounded). Let k = 1 + sup{|f (x)| : x [a, b]} > 0. Then for all x , x [a, b], if x = x then, by the Mean Value Theorem, there is x between x , x such that f (x ) f (x ) = |f (x)| k. x x Hence f is globally Lipschitz. 6. We seek a mapping : C ([0, 1], R) C ([0, 1], R) such that y = f (x) solves the dierential equation if and only if f is a xed point of . In this case, the correct is
x

(f ) = a +
0

(t2 f (t) + (t)) dt.

Check: if f is continuous, then (f )(x) exists for all x [0, 1] and is dierentiable and hence continuous. So is a well-dened map C ([0, 1], R) C ([0, 1], R). Also (f )(0) = a for all f . Furthermore d (f )(x) = x2 f (x) + (x) dx by the Fundamental Theorem of Calculus, so y = f (x) solves the initial value problem if and only if f is a xed point of . Since C ([0, 1], R) (with the sup metric) is complete, the desired 87

result follows immediately from the Contraction Mapping Theorem once we show that is a contraction mapping. Now for all f, g C ([0, 1], R) and all x [0, 1],
x x x

|(f )(x) (g )(x)|

=
0 x

(t2 f (t) + (t)) dt

(t2 g (t) + (t)) dt =

0 x 0

t2 (f (t) g (t)) dt

t2 |f (t) g (t)| dt d(f, g )

t2 dt =
0

x2 d(f, g ). 2

Since this holds for all x [0, 1], we have that d((f ), (g )) = sup{|(f )(x) (g )(x)| : x [0, 1]} 1 d(f, g ) 2

so is a contraction mapping (with contraction factor k = 1 2 ). The result now follows. 7. We seek a mapping : C ([0, 1], R) C ([0, 1], R) such that y = f (x) solves the dierential equation if and only if f is a xed point of . In this case, the correct is (f ) = + 1 2
x

sin(t2 + f (t)) dt.

0

Check: if f is continuous, then (f )(x) exists for all x [0, 1] and is dierentiable and hence continuous. So is a well-dened map C ([0, 1], R) C ([0, 1], R). Also (f )(0) = for all f . Furthermore 1 d (f )(x) = sin(x2 + f (x)) dx 2 by the Fundamental Theorem of Calculus, so y = f (x) solves the initial value problem if and only if f is a xed point of . Since C ([0, 1], R) (with the sup metric) is complete, the desired result follows immediately from the Contraction Mapping Theorem once we show that is a contraction mapping. Establishing this will be slightly harder work than in previous examples. First, I claim that for all a, b R | sin a sin b| |a b|. () By the Mean Value Theorem applied to the continuously dierentiable function (x) = sin x, there is, given any a, b R, with a = b, some c between a and b such that (a) (b) = | (c)| = | cos c| 1. ab Now for all f, g C ([0, 1], R) and all x [0, 1], |(f )(x) (g )(x)| = = 1 2 1 2 1 2
x 0 x 0 x 0

() follows immediately.

[sin(t2 + f (t)) sin(t2 + g (t))] dt |(t2 + f (t)) (t2 + g (t))| dt |f (t) g (t)| dt 1 d(f, g ) 2
x 0

by () dt = x d(f, g ). 2

Since this holds for all x [0, 1], we have that d((f ), (g )) = sup{|(f )(x) (g )(x)| : x [0, 1]} 1 d(f, g ) 2

so is a contraction mapping (with contraction factor k = 1 2 ). The result now follows.

88