EF9904: Dr.

Yu

Problem 2

Jeremey Ponrajah

3. If (M,d) is a metric space, define.

d0 (x, y) =

d(x, y)
1 + d(x, y)

(a) Prove that d is a metric on M.

Let M be a nonempty set. A function d: M M R is a metric on M if
(i) d0 (x, y) 0
(ii) d0 (x, y) = 0 x = y
(iii) d0 (x, y) = d0 (y, x)
(iv) d0 (x, y) d0 (x, y) + d0 (x, y)
Proof: (i) Given that d(x, y) satisfies the definition of a metric it must follow that
d(x, y) 0. Thus, it is quite obvious that the following must be true d0 (x, y)
0.
(ii) We know that d(x, y) = 0 x = y which, is equivalent to d(x, x) = 0 then
d(x, x)
=0
1 + d(x, x)

d0 (x, x) =

(iii) This property directly follows from the fact that d(x, y) = d(y, x). Thus,
we can conclude the following:
d0 (x, y) = d0 (y, x) =

d(x, y)
d0 (x, y)
=
1 + d(x, y)
1 + d0 (x, y)

(iv) We have to show given d(x, y) d(x, z) + d(z, y) that the following is true
d(x, z)
d(z, y)
d(x, y)

+
1 + d(x, y)
1 + d(x, z) 1 + d(z, y)
d(x, y)[(1 + d(x, z))(1 + d(z, y))] [d(x, z)(1 + d(z, y)) + d(z, y)(1 + d(x, z))][1 + d(x, y)]
(

(
(((

(
(((y) + d(x,
(((z) + d(x,(
((z)d(z,
LHS : d(x, y) + (
d(x,
y)d(z,
y)d(x,
y)d(x,
y)
((
(((
(( (
LHS : d(x, y)

(
((((

(
(((y) + d(x, z)d(x,
(((y)
RHS : d(x, z) + d(x, z)d(z, y)+(
d(x,
z)d(x,
+ d(z, y)...
((
(((y)d(z,
(
(
(
(
(
(
(
... + (
d(x,
y)d(z,
y) + d(x, z)d(z, y) + d(x, z)d(x, y)d(z, y)
((

RHS : d(x, z) + d(x, z)d(z, y) + d(z, y) + d(x, z)d(z, y) + d(x, z)d(x, y)d(z, y)

EF9904: Dr. Yu

Problem 2

Jeremey Ponrajah

After we clean up everything

d(x, y) d(x, z) + d(x, z)d(z, y) + d(z, y) + d(x, z)d(z, y) + d(x, z)d(x, y)d(z, y)
The above inequality must hold because of the original inequality we start with
namely, d(x, y) d(x, z) + d(z, y).

is a monotonically
(b) Show that for any any  0, the mapping f () = (1+)
increasing ( and hence, one-to-one) mapping. Show the A M is open under
the metric d if and only if it is open under the metric d.

Proof: We have to show that if 1 > 2 then for the mapping to be monotonically
increasing f (1 ) > f (2 ).
1
2
>
1 (1 + 2 ) > 2 (1 + 1 )
1 + 1
1 + 2
1
2
1
2 > 2 + 
1 + 
1 > 2
For the second part let us assume that A is a open set. Thus, a neighbourhood
of a point a M is a set Nr (a) = {b M, d(a, b) < r} r > 0. The interior of a
set A, int(A), is the set of all interior points of A.
int(A) = {x A|Nr (a) A for some r > 0}
Moreover, if A is open under the metric d then we have A int(A) and int(A)
A. Thus, because r is arbitrarily chosen if the set A is open under d then it
must be open under d. Both ways of the iff statement follows for the definition
of the neighbourhood.
(c) Let d denote the Euclidean metric of R and let d as defined above. Show
that R+ is closed and bounded under the metric d which is not compact.
Proof :
The fact that R+ is closed directly follows from the fact that we can always a
have neighbourhood Nr (x) for any point x R+ that contains another element
in R+ .
Lastly, R is bounded if there is a real number M and point a x R+ such that
d0 (x, y) < M for all y R+ . This is of course true because 0 d0 (x, y) < 1 for
all x, y in R+ .
4. If K is compact subset of a metric space X, show that every sequence in K has
a convergent.
2

EF9904: Dr. Yu

Problem 2

Jeremey Ponrajah

Proof: First, we know that a set is closed iff it contains the limit of every convergent
sequence of its elements. Hence, given K is compact it contains the limit of
every convergent sequence of its element. Thus, any sequence {pn } in K has a
limit p. Choose n1 such that d(p, pn1 ) < 1. Having chosen n1 , ..., ni1 , we can
see that there is an integer ni > ni1 such that d(p, pni ) < 1i . Therefore, {pni }
converges to p.
5. Let S be the collection of all sequences whose terms are the integers 0 and 1.
Show that S is uncountable.
Proof: If all the sequences whose terms are the integers 0 and 1 are countable then we
can associate every sequence with a positive integer. Starting from 1 indicate
a 1 at the first position and 2 to indicate a 1 at the second position and zero
every else and so on.
1
2
3
4
..
.

1
01
001
0001
..
.

Now, let us create a new rule to construct a new number such that we look at
the nth number and if the digit is zero then we put a 1 instead at that position.
On the other hand if the digit is 1 we instead put a zero at that position. For
example, for the number 4 we have 0001 if were to convert it according to the
rule we would have 1110, which is a new number not on the list. This shows
that every sequence of ones and zeros is not countable.

6. Prove that a collection of disjoint open sets in R is necessarily countable.

Proof: For a collection of disjoint set open sets {G } such that G ={0
}. Given that
each set in {G } is open and disjoint it follows that there can only exist a finite
number of sets that can accomplish this property because if the number of sets
were infinite the property of the sets being disjoint and open will not follow.