Assignment 4 MATH2320

Jaron Lee
May 4, 2014
1
Dinis theorem can be written as follows: If the following conditions hold:
1. (f
n
) a decreasing sequence of real-valued continuous functions
2. (f
n
) are functions on some compact set X
3. f
n
f pointwise
4. f is continuous
Then f
n
f uniformly.
This proof revolves around the fact that we can apply Dinis theorem to the distance function on
a metric.
For (1) we have that ((f
n
(x), f(x))) is a decreasing sequence of real-valued continuous functions.
We have the decreasing property given. We have real-valued given because is a metric. We also
have that the metric function is continuous. Consider the following:
Consider for some xed n:
lim
yx
(f
n
(y), f(y)) lim
yx
((f
n
(y), f
n
(x)) + (f
n
(x), f(x)) + (f(x), f(y)))
Since f
n
, f are continuous, terms consisting of only f
n
or f are zero in the limit:
= lim
yx
(f
n
(x), f(x))
= (f
n
(x), f(x))
lim
yx
(f
n
(y), f(y)) lim
yx
((f
n
(x), f(x)) (f(y), f(x)) (f
n
(y), f
n
(x)))
By the same argument as above, we nd that (f(y), f(x)), (f
n
(y), f
n
(x)) are zero in the limit,
giving:
= lim
yx
(f
n
(x), f(x))
= (f
n
(x), f(x))
lim
yx
(f
n
(y), f(y)) = (f
n
(x), f(x))
By this last line, we have continuity of the distance function.
1
For (2) we are given that (f
n
(x), f(x)) : Y Y R. However, if for f : X Y the set X is
compact, then the continuous image of f is compact. Thus Y is compact. A product of compact
sets is itself compact.
For (3) we have that (f
n
(x), f(x)) 0 as n for x X. Then because the sequence
(f
n
(x), f(x))) has a greatest lower bound of zero, and is monotone decreasing, it converges to
zero. Thus we can state the following denition: > 0 x X N N : n > N =
(f
n
(x), f(x)) < . This implies that f
n
f pointwise.
For (4) we have that (f
n
(x), f(x)) decreases to zero. The function f(x) = 0 for all x X is
continuous.
Then (f
n
(x), f(x)) 0 uniformly. This is equivalent to saying > 0 N N f
n
(x), f(x)
Y : |(f
n
(x), f(x)) 0| < which is precisely the denition of uniform continuity.
2
If f
n
f uniformly: > 0 N
1
N x X : n > N
1
= |f
n
(x) f(x)| < .
Assume for the sake of contradiction that |f(x)| M > . Then |f(x) f
n
(x)| ||f(x)| |f
n
(x)||
by the reverse triangle inequality. But by applying the assumption we get that ||f(x)| |f
n
(x)|| =
|f(x)| |f
n
(x)| since |f(x)| > |f
n
(x)|.
Now M |f
n
(x)| = M |f
n
(x)|. Then:
|f(x)| |f
n
(x)| |f(x)| M

This is a contradiction since f
n
f uniformly implies that |f(x)| |f
n
(x)| < . Therefore it must
be the case that |f(x)| M , which implies that |f(x)| M + which is bounded. Without
loss of generality the same procedure can be performed to obtain |g(x)| N + for n > N
2
.
Now we aim to show that > 0 N
3
N x X : n > N
3
= |f
n
(x)g
n
(x)f(x)g(x)| < .
First, pick max(N
1
, N
2
) such that |g
n
(x) g(x)| < and |f
n
(x) f(x)| < .
|f
n
(x)g
n
(x) f(x)g(x)| = |f
n
(x)g
n
(x) f(x)g(x) + f
n
(x)g(x) f
n
(x)g(x)|
= |f
n
(x)(g
n
(x) g(x)) + g(x)(f
n
(x) f(x))|
|f
n
(x)||g
n
(x) g(x)| +|g(x)||f
n
(x) f(x)|
(M + ) + N
= (M + N + )

Hence for max(N
1
, N
2
, N
3
) we have that f
n
g
n
fg uniformly.
3
3.a
An equivalence relation satises the following three properties:
2
1. Reexive: (X, d) (X, d)
2. Symmetric: (X, d) (Y, ) (Y, ) (X, d)
3. Transitive: (Y, ) (X, d) and (Z, ) (Y, ) imply (Z, ) (X, d)
For (1), let f : X X, x x be the identity map. Then f is a bijection. Now f is uni-
formly continuous if it satises the following: > 0 > 0 x, x

X : d(x, x

) < =
d(f(x), f(x

)) < . But since d(f(x), f(x

)) = d(x, x

) < = we are done.

For (2), if (X, d) (Y, ) then there is a bijective function f : X Y such that f, f
1
are
uniformly continuous. But this implies the existence of f
1
: Y X such that f, f
1
are
uniformly continuous.
For (3), (Y, ) (X, d) implies that f : Y X is bijective and f, f
1
are uniformly continuous.
(Z, ) (Y, ) implies that g : Z Y is bijective and that g, g
1
are uniformly continuous.
A composition of uniformly continuous functions is uniformly continuous if > 0 > 0 z
Z : (z, z

) < = d(f(g(z)), f(g(z

))) < .
g uniformly continuous implies > 0 > 0 z, z

Z : (z, z

) < = (f(z), f(z

)) < .
f uniformly continuous implies > 0 > 0 y, y

Z : (y, y

) < = d(g(y), g(y

)) < .
Now for > 0 pick
1
such that (y, y

) <
1
= d(g(y), g(y

)) < . For this

1
, pick
2
such that
(z, z

) <
2
= (f(z), f(z

)) <
1
, and set y = f(z), y

= f(z

). Then z, z

Z (z, z

) <

2
= d(g(f(z)), g(f(z

))) < which implies g(f(z)) is uniformly continuous. By using (2), the
same process allows us to obtain that f(g(x)) is uniformly continuous.
g(f(z)), f(g(x)) are also bjiective as a composition of bjiective functions.
3.b
If (X, d) (Y, ) then there exists f : X Y a bijection with f, f
1
uniformly continuous.
Let (x
n
) be a Cauchy sequence in X. We want to show that (f(x
n
)) is a Cauchy sequence in Y .
If (x
n
) is Cauchy then
1
> 0 n, m, N
1
N x
m
, x
n
X : n, m > N
1
= d(x
n
, x
m
) <
1
.
If (f(x
n
)) is Cauchy then:

2
> 0 n, m, N
2
N n, m > N
2
f(x
n
), f(x
m
) Y : n, m > N
2
= (f(x
n
), f(x
m
)) <
2
.
Because f is a uniformly continuous function, then the following holds: > 0 > 0 x
n
, x
m

X n, m N : d(x
n
, x
m
) < = (f(x
n
), f(x
m
)) < .
Now for some > 0 we set a > 0. Since (x
n
) is Cauchy, select an N
1
large enough so that
n, m > N
1
N : d(x
n
, x
m
) < = (f(x
n
), f(x
m
)) < . But then this implies that
> 0 n, m, N
1
N : n, m > N
1
= (f(x
n
), f(x
m
)) < .
Thus we conclude that (f(x
n
)) is Cauchy.
We now want to show that if (X, d) is complete, so is (Y, ). If (X, d) is complete then a Cauchy
sequence (x
n
) has a limit x X - that is, > 0 x
n
, x X n N : n > N = d(x
n
, x) < .
It follows that (f(x
n
)) Y approaches a limit f(x) such that > 0 f(x
n
) Y n N : n >
N = (f(x
n
), f(x)) < .
3
For (Y, ) to be complete, it must be that f(x) Y . But we have this from the bijectivity of f -
otherwise x X would not map to a point in Y , so f
1
(obviously bijective) would not be onto.
4
4.a
By Corollary 12.3.5 we are able to say that C[0, T] mapping into R is complete with the sup
metric. It remains to establish that is such a metric. More precisely, we must show that
(x, y) = e
Lt
|x(t) y(t)|
(x, y) is clearly always positive. Symmetry is satised because |x(t) y(t)| is itself a metric. We
must demonstrate the triangle inequality for the metric:
(x, y) = e
Lt
|x(t) y(t)|
= e
Lt
(|x(t) z(t) + z(t) y(t)|
e
Lt
(|x(t) z(t)| +|z(t) y(t)| by the triangle inequality for |x(t) y(t)| :
= e
Lt
|x(t) z(t)| + e
Lt
|z(t) y(t)|
= (x, z) + (z, y)
Hence (C[0, T], ) is a complete metric space.
4.b
Consider the following integral operator map: K(x(t)) = x
0
+

t
0
f(s, x(s)) ds. This is a continuous
map because integrals of continuous functions are continuous.
e
Lt
|K(x(t)), K(y(t))| = e
Lt
|x
0
+

t
0
f(s, x(s)) ds x
0

t
0
f(s, y(s)) ds|
= e
Lt
|

t
0
f(s, x(s)) f(s, y(s)) ds|

t
0
e
Lt
|f(s, x(s)) f(s, y(s))| ds

t
0
Le
Lt
|x(s) y(s)| ds
L

t
0
e
Lt
|x(s) y(s)| ds
L sup
t[0,T]
Te
Lt
|x(t) y(t)|
= LT sup
t[0,T]
e
Lt
|x(t) y(t)|
sup
t[0,T]
e
Lt
|K(x(t)), K(y(t))| LT sup
t[0,T]
e
Lt
|x(t) y(t)|
4
We pick T to make LT < 1, since L is a xed constant depending on the particular initial value
problem. Then this is a contraction map by the contraction mapping theorem. Because it is a
contraction map, it has a unique xed point. The xed point of this contraction map is precisely
the solution of the initial value problem. This implies that the integral equation has a unique
C
0
[0, T] solution to the IVP. But by Theorem 13.8.1 we nd that x is a C
1
[0, T] solution to the
IVP (*).
4.c
We try to extend the solution to C
1
[0, ). We have that a unique solution exists in [0, T]. In
particular, note that T was chosen independently of the initial values t
0
= 0 and x
0
since the
condition imposed was TL < 1. Therefore we can create a new problem:
x

(t) = f(t, x(t)) t t

0
x(t
0
) = x
1
Set t
0
= T/2 and x
1
= x(T/2). Then we can obtain a solution x C
1
[T/2, 3T/2]. It is clear that
x, x solve the same dierential equation on the interval [T/2, T]. This is because x(T/2) = x(T/2)
which by the uniqueness result proved above in part b) gives us that x, x must coincide on the
interval [T/2, T].
Hence we can dene x to be x on the interval [T, 3T/2], so that we obtain a C
1
function on all of
[0, 3T/2]. Further iteration of this argument gives us a C
1
solution x on the interval [0, ).
5