Test I

REAL ANALYSIS I
November 29, 2015

Name
ID No
1.
Miliyon Tilahun . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . GSR/1401/08

Problems

Give the precise answer for each of the following questions neatly on the space provided.
1. Let (X, d) be a metric space and let A be a subset of X.
(a) What is meant by A is an open set?
Definition 1.1. The set A is open if every point of A is an interior of A.
(b) Define a Cauchy sequence (xn ) in (X, d).
Definition 1.2. A sequence {xn } is Cauchy if for every > 0 there exists an N N such that

m, n > N

d(xm , xn ) < .

(c) Define a compact metric space (X, d).

Definition 1.3. A subset K of a metric space X is said to be compact if every open cover {V }
of K contains a finite subcover.
(d) Define a complete metric space (X, d).
Definition 1.4. If every Cauchy sequence in X converges in X, then X is said to be complete.

Workout Problems

Show all the necessary steps clearly and neatly on the space provided.
1. Let Pn denotes the set of all polynomial functions of degree less than or equal to n,
f (x) = a0 + a1 x + a2 x2 + + an xn
where n is fixed positive integer and the coefficients, a0 , a1 , . . . , an are all integers. Prove that Pn is
countable.
Proof. For each pair of integers (n, m) N N, let Pnm denote the set of polynomials of degree m in
which
|a0 | + |a1 | + + |am | = n
Pnm is finite for each n, m N. Hence
P =

{Pnm : (n, m) N N}

is countable since it is a countable union of countable sets.

2. Let A be a non-empty set of real numbers which is bounded below. Let A = {x : x A}
Prove that, inf A = sup(A)
Proof. A 6= is given.
We need to show that sup(A) is the greatest lower bound of A.
For simplicity, let = sup(A). We are expected to show that x, for all x A and if
is any lower bound of A.
Suppose x A. Then, x A and hence x sup(A). It follows that x sup(A) which
means x. Thus, is a lower bound of A. Now, let be any lower bound of A. This means x,
for all x A. Hence, x , for all x A, which says y , for all y A. This means
is the upper bound of A. Hence sup(A) by definition of sup, which implies sup(A).
Therefore, sup(A) is the greatest lower bound of A.

3. Let (X, d) be a metric space. Show that

d1 (x, y) := ln(1 + d(x, y))
for all x, y X defines a new metric on X.
Solution. Given d is a metric on X. We want to show d1 (x, y) := ln(1 + d(x, y)) is a metric on X.
(i) Positive definite:
d1 (x, y) = 0 ln(1 + d(x, y)) = 0
d(x, y) = 0
x = y,

d is a metric.

(ii) Symmetry:
d1 (x, y) = ln(1 +d(x, y)) = ln(1+ d(y, x)) = d1 (y, x)
|
{z
}
d(x,y)=d(y,x)

(iii) Triangle inequality: For all x, y and z in X, we observe the following inequality
1 + d(x, y) 1 + d(x, z) + d(z, y)

(1)

The inequality (1) holds, because d is a metric.

Now, we have
1 + d(x, y) 1 + d(x, z) + d(z, y) + d(x, z)d(z, y)
{z
}
|
0

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

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

(Applying ln both side)

= ln(1 + d(x, z)) + ln(1 + d(z, y))

Hence,
ln(1 + d(x, y)) ln(1 + d(x, z)) + ln(1 + d(z, y))
|
{z
} |
{z
} |
{z
}
:=d1 (x,y)

:=d1 (x,z)

:=d1 (z,y)

Therefore,
d1 (x, y) d1 (x, z) + d1 (z, y)
Using (i),(ii) and (iii), we conclude that d1 is indeed a metric on X.
4. Let (X, d) be a metric space and let A be a subset of X.
(a) Show that A is open iff the compliment Ac is closed.
Solution. () Suppose A is open.
Let x be a limit point of Ac . Then every neighborhood N of x contains a point of Ac . Then x is
not an interior point of A (x N ( A). Since A is open, this implies x Ac . Hence, Ac contains
all of its limit points(since x was arbitrary). Therefore Ac is closed.
() Suppose Ac is closed.
Let x A. This implies x
/ Ac and x is not a limit point of Ac (Ac is is closed). Then there
exists a neighborhood N of x such that Ac N = . Hence N A. Therefore, A is open(by
definition).
3

(b) Show that a compact metric space (X, d) is complete.

Solution. Since X is a compact metric space it is sequentially compact.
Let xn be a Cauchy sequence in the metric space X. Since X is sequentially compact there is a
convergent subsequence xnk x X.
All that now remains to be shown is that xn x. Since xnk x there is N1 with nk N1
implies |xnk x| < 2 . Let N2 be such that n, m N2 implies |xn xm | < 2 .
Then n > N = max(N1 , N2 ) implies
|xn x| |xn xN | + |xN x| <
Hence X is complete.
5. Let (X, d) be a metric space such that X has finitely many points. Prove that for every x X, the
singleton set {x} is open.
Proof. For arbitrary x X define r(x) = min{d(x, y) : y X, y 6= x}. Since all d(x, y) > 0 when x 6= y,
r(x) is a minimum of finitely many positive numbers(since there are finitely many points). So r(x) > 0.
Consider the open ball B(x, r(x)). Now, suppose y B(x, r(x)) and y 6= x. Then by definition of
being in the ball d(x, y) < r(x) but r(x) d(x, y) by definition of r(x). This is a contradiction, so
B(x, r(x)) = {x}. Therefore, as x was arbitrary the set {x} is open for any x X.
6. Let (R2 , d) be a metric space. The distance function d : R2 R2 R on R2 is defined by
p
d((x1 , x2 ), (y1 , y2 )) = (x1 y1 )2 + (x2 y2 )2
(a) Show that (xn , yn ) (x, y) if and only if xn x and yn y.
Solution. () Let pn = (xn , yn ) and p0 = (x, y). If pn p0 , then we have, for every > 0, N
such that
nN

d(pn , p0 ) < .

We want to show that

(i) For each > 0, N such that
nN

d(xn , x) < .

nN

d(yn , y) < .

(ii) For each > 0, N such that

For (i); from (2) we have, given > 0, N such that

p
nN

(xn x)2 + (yn y)2 < .

But
|xn x| =

(xn x)2

((xn x)2 + (yn y)2 < .

This implies, for each > 0, N such that

nN

d(xn , x) < .

Therefore, {xn } x, similarly {yn } y.

() Suppose {xn } x, and {yn } y. So we have, for each > 0, N such that
n N1

d(xn , x) <

.
2

(2)

and
n N2

d(yn , y) <

.
2

Put N = max{N1 , N2 } thus,

p
(xn x)2 + (yn y)2
p
p
(xn x)2 + ((yn y)2

= d(xn , x) + d(yn , y) < + = .
2 2

d(pn , p0 ) =

Hence for every > 0, N such that

nN

d(pn , p0 ) < .

Therefore, pn p.


n+1
3/2
(b) Show that sin(n
), ln( n ) (0, 0) in the metric space (R2 , d).

Solution. Let pn =

sin(n

3
2


), ln( n+1
)
and p0 = (0, 0).
n

WTS: For every > 0, there exists an N such that

nN
But, {sin(n

3
2

d(pn , p0 ) < .

)} 0, and {ln( n+1

n )} 0 as n . So we have
n N1

d(sin(n

n N2

d(ln(

and

3
2

), 0) <

.
2

n+1

), 0) < .
n
2

Put N = max{N1 , N2 }, then

r

n+1 2
))2 + (ln(
))
n
r
q
n+1 2
3
(sin(n 2 ))2 + (ln(
))
n
3
n+1
), 0)
= d(sin(n 2 ), 0) + d(ln(
n

< + = .
2 2

d(pn , p0 ) =

(sin(n

3
2

Hence, for every > 0, there exists an N such that

nN



)
(0, 0).
Therefore, sin(n3/2 ), ln( n+1
n

d(pn , p0 ) < .