1

MATH3390-Introduction to Metric and Topological Spaces

Problem Paper 1
Due: 04/02/2013
Identification Number

QUESTION 1
Let A, V be subsets of a set X. Prove that ) / ( ) /( V X A A V A =
PROOF
According to our definition of equality of sets we must show ) / ( ) /( V X A A V A _ and
) /( ) / ( A V A V X A _ or equivalently ) /( A V A x e iff ) / ( V X A x e .
Let us begin by showing that ) /( A V A x e implies that ) / ( V X A x e
If ) /( A V A x e then A x e and ) ( A V x e . By definition of intersection ) ( A V x e implies
V xe and A x e but A x e therefore we have ) / ( V X A x e as required. Thus
) / ( ) /( V X A A V A _ .
Conversely if ) / ( V X A x e then by definition of intersection A x e and ) / ( V X x e .
) / ( V X x e means that A x e and V xe . Since A x e and V xe we have ) /( A V A x e as
required. Hence ) /( ) / ( A V A V X A _ .

QUESTION 2
According to our definition of equality of sets we must show )) ( ( ) ( ) (
1 1 1
U g f U f g

_ and
) ( ) ( )) ( (
1 1 1
U f g U g f

_ or equivalently ) ( ) (
1
U f g

iff )) ( (
1 1
U g f

.
Suppose ) ( ) (
1
U f g x

e then ) ( ) )( ( )) ( ( U x f g x f g e = . By the definition of inverse images
)) ( (
1 1
U g f x

e showing that )) ( ( ) ( ) (
1 1 1
U g f U f g

_ .

Conversely suppose that )) ( (
1 1
U g f x

e then )) ( ( ) (
1
U g x f

e so U x f g e )) ( ( which is equal
to ) ( ) )( ( U x f g e . By definition of inverse images ) ( ) (
1
U f g x

e . Hence
) ( ) ( )) ( (
1 1 1
U f g U g f

_ .




2

QUESTION 3
]} 1 , 0 [ : ) 2 , { ]) 1 , 0 ([ e = x x f . This is a straight line segment in R2 joining the origin with the point
with coordinate (0, 2).

] 1 , 0 [ ] 1 , 0 [ : ) 2 , ( e x x iff
2
1
0 s s x therefore ]
2
1
, 0 [ ]) 1 , 0 [ ] 1 , 0 ([
1
=

f
D x x e ) 2 , ( iff R x e and 1 ) ) 2 ( (
2 2
s + x x , 1 5
2
s x therefore ]
5
1
,
5
1
[ ) (
1

=

D f

QUESTION 4
Let A ae then ) ( ) ( A f x f e . So ) ( ) ( { A f x f x x e e which is by definition ) (
1
A f f

. This holds
for all A ae so ) (
1
A f f A

_ .

Proving now that the reverse inclusion holds under the assumption that f is an injective.
Let ) (
1
A f f x

e then ) ( ) ( A f x f e and so ) ( ) ( a f x f = for some A ae . Since f is an injective
the equation ) ( ) ( a f x f = gives a x = and so A x e . Since x was any element of ) (
1
A f f

then
A A f f _

) (
1
as is required.


QUESTION 5
Suppose ) ( B A x e , then A x e and ) sup , max(sup sup B A A x s s or B xe so
) sup , max(sup sup B A B x s s . ) sup , (sup B A Max is therefore an upper bound for B A , so
B A is bounded above and ) sup , max(sup ) sup( B A B A s .

Let ) sup , max(sup B A = o and let 0 > c . If A sup = o then there exist A x e with c o > x
likewise if B sup = o then there exists B xe with c o > x . It follows that there exists
B A x e with c o > x . Thus o the least upper bound of B A . Demonstrating that
) sup , max(sup ) sup( B A B A = .