Blank Template

Efren Chaves
28 de julio de 2014
2

Indice general
1. Cap. 1 5
1.1. Exercises . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5
2. Ejercicios Cap. 2 9
2.1. Ejercicios 2.1 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9
2.2. Ejercicios 2.2 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12
2.3. Ejercicios 2.3 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16
3. Referencias 17
4. Anexos 19
3
4

INDICE GENERAL
Captulo 1
Cap. 1
1.1. Exercises
1. Let X = {a, b, c, d, e, f}. Determine whether (or) not each of the following collection of
subsets of X is a topology on X
a)
1
= {X, , {a}, {a, f}, {b, f}, {a, b, f}}
Note that {a, f}

{b, f} = {f} /
1
. Hence,
1
is not a topology.
b)
2
= {X, , {a, b, f}, {a, b, d}, {a, b, d, f}}
Again, note that {a, b, f}

{a, b, d} = {a, b} /
2
. Hence,
2
is not a topology.
c)
3
= {X, , {f}, {e, f}, {a, f}}
Note that {e, f}

{a, f} = {a, e, f} /
3
}. Hence,
3
is not a topology.
2. Let X = {a, b, c, d, e, f}. Which of the following collections of subsets of X is a topology
on X? (Justify your answers)
a)
1
= {X, , {c}, {b, d, e}, {b, c, d, e}, {b}}
Not a topology since {c}

{b} = {b, c} /
1
b)
2
= {X, , {a}, {b, d, e}, {a, b, d}, {a, b, d, e}}
Not a topology since {b, d, e}

{a, b, d} = {b, d} /
2
c)
3
= {X, , {b}, {a, b, c}, {d, e, f}, {b, d, e, f}}
It is a topology since
It contains X and .
Any union of sets in
3
is in
3
Any intersection of sets in
3
is in
3
3. Let X = {a, b, c, d, e, f} and is the discrete topology on X. Which of the following
statements are true?
a) X True
b) {X} False
c) {} False
d) True
e) X False
f ) {} X False
g) {a} True
h) a False
i) X True
j) {a} X False
k) {} X False
l ) a X True
5
6 CAP

ITULO 1. CAP. 1
m) X False
n) {a} False
n) {X} True
o) a False
4. Let (X, ) be any topological space. Verify that the intersection of any nite number of
members of is a member of .
Soluci on
Let P
n
be the statement that

If {A
i
}
n
i=1
=

n
i=1
A
i
. Let S = {n N :
P
n
is a true statement}. From the denition of a topology, we have 1 N. Assume that
k S i.e. P
k
is a true statement i.e. whenever {A
i
}
k
i=1
=

k
i=1
A
i
. Consider
{A
i
}
k+1
i=1
.

k+1
i=1
A
i
=
_

k
i=1
A
i
_

A
k+1
. By assumption, we have B =
_

k
i=1
A
i
_
.
Now from the denition of a topology, we get B

A
k+1
since B, A
k+1
. Hence, we
get

k+1
i=1
A
i
whenever {A
i
}
k+1
i=1
. Hence, P
k+1
is a true statement. Hence, k+1 S.
So by principle of mathematical induction we have 1 S, and k +1 S whenever k S.
Hence, S = N. Hence, the intersection of any nite number of members of is a member
of .
5. Let R be the set of all real numbers. Prove that each of the following collections of subsets
of R is a topology
a)
1
consists of R, and every interval (n, n), for any positive integer
Clearly, R,
1
First note that
1
is a countable set and hence all we are interested in is in nite
(or) countably innite unions. Let A
k
= (k, k). Note that A
k
s are monotone
increasing sequence of sets. Hence, any nite union of the form

m
l=1
A
k
l
= A
p
where p = m ax(k
1
, k
2
, . . . , k
m
). And A
p

1
and hence any nite union again
belongs to
1
. Any innite union

l=1
A
k
l
where k
l
N can be rewritten either as
a nite union of the form

m
l=1
A
k
l
(or) an innite union

l=1
A
k
l
where k
i
= k
j
.
The claim now is that any innite union where k
i
= k
j
is R i.e.

l=1
A
k
l
= R
where k
i
= k
j
. To prove this, we prove the two way inclusion. Note that A
k
l
R.
Hence,

l=1
A
k
l
R. Further given any x R, by archimedian property n N
such that x A
n
. Further since it is an innite union, k
l
such that x A
n

A
k
l
. Hence,

l=1
A
k
l
R. Further, A
n

R = R
1
and A
n

= A
n

1
.
Hence, any union is also in
1
.
Now we need to prove the last claim that intersection of any two elements of

1
gives an element in
1
. Consider A
m
, A
n

1
. By well-ordering principle, we
get mn (or) m = n (or) mn. If m = n, then A
m

A
n
= A
n

1
. If mn, then
A
m

A
n
= A
m

1
. If mn, then A
m

A
n
= A
n

1
. Further, A
n

R = A
n

1
and A
n

=
1
. Hence, intersection of any two elements of
1
gives an
element in
1
.
b)
2
consists of R, and every interval [n, n], for any positive integer
Clearly, R,
2
First note that
2
is a countable set and hence all we are interested in is in nite
(or) countably innite unions. Let A
k
= [k, k]. Note that A
k
s are monotone
increasing sequence of sets. Hence, any nite union of the form

m
l=1
A
k
l
= A
p
where p = m ax(k
1
, k
2
, . . . , k
m
). And A
p

2
and hence any nite union again
belongs to
2
. Any innite union

l=1
A
k
l
where k
l
N can be rewritten either as
a nite union of the form

m
l=1
A
k
l
(or) an innite union

l=1
A
k
l
where k
i
= k
j
.
The claim now is that any innite union where k
i
= k
j
is R i.e.

l=1
A
k
l
= R
where k
i
= k
j
. To prove this, we prove the two way inclusion. Note that A
k
l
R.
1.1. EXERCISES 7
Hence,

l=1
A
k
l
R. Further given any x R, by archimedian property n N
such that x A
n
. Further since it is an innite union, k
l
such that x A
n

A
k
l
. Hence,

l=1
A
k
l
R. Further, A
n

R = R
2
and A
n

= A
n

2
.
Hence, any union is also in
2
.
Now we need to prove the last claim that intersection of any two elements of

2
gives an element in
2
. Consider A
m
, A
n

2
. By well-ordering principle, we
get mn (or) m = n (or) mn. If m = n, then A
m

A
n
= A
n

2
. If mn, then
A
m

A
n
= A
m

2
. If mn, then A
m

A
n
= A
n

2
. Further, A
n

R = A
n

2
and A
n

=
2
. Hence, intersection of any two elements of
2
gives an
element in
2
.
c)
3
consists of R, and every interval [n, ), for any positive integer
Clearly, R,
3
First note that
3
is a countable set and hence all we are interested in is in nite
(or) countably innite unions. Let A
k
= [k, ). Note that A
k
s are monotone
decreasing sequence of sets. Hence, any nite union of the form

m
l=1
A
k
l
= A
p
where p = mn(k
1
, k
2
, . . . , k
m
). And A
p

3
and hence any nite union again
belongs to
3
. Any innite union

l=1
A
k
l
where k
l
N equals A
p
where p =
mn(k
1
, k
2
, . . .). Further, A
n

R = R
3
and A
n

= A
n

3
. Hence, any
union is also in
3
.
Now we need to prove the last claim that intersection of any two elements of

3
gives an element in
3
. Consider A
m
, A
n

3
. By well-ordering principle, we
get mn (or) m = n (or) mn. If m = n, then A
m

A
n
= A
n

3
. If mn, then
A
m

A
n
= A
n

3
. If mn, then A
m

A
n
= A
m

3
. Further, A
n

R = A
n

3
and A
n

=
3
. Hence, intersection of any two elements of
3
gives an
element in
3
.
6. Let N be the set of all positive integers. Prove that each of the following collections of
subsets of N is a topology.
a)
1
consists of N, and every set of the form {1, 2, . . . , n} for any positive integer n.
This is called the initial segment topology.
b)
2
consists of N, and every set of the form {n, n + 1, . . .} for any positive integer
n. This is called the nal segment topology.
8 CAP

ITULO 1. CAP. 1
Captulo 2
Ejercicios Cap. 2
2.1. Ejercicios 2.1
1. Prove that if a, b R with ab, then neither [a, b) nor (a, b] is an open subset of R. Also
show that neither is a closed subset of R.
a) We shall rst consider the interval [a, b).
We will prove that the interval [a, b) is not open. If [a, b) is open, then x [a, b),
we have an interval (c, d) containing x such that (c, d) [a, b). We will show
that the point a doesnt lie in any open interval (c, d) containing a such that
(c, d) [a, b). The proof goes by contradiction. If there exists (c, d) containing
a, such that (c, d) [a, b), consider x =
a+c
2
. Note that x (c, d) but x / [a, b).
Hence, (c, d) [a, b) for any open interval (c, d). Hence, [a, b) is not open.
We will now prove that the interval [a, b) is not closed. Look at the complement
in R and the argument is similar as above to prove that the complement in R is
not open as well. Hence, [a, b) is not closed.
b) Now consider the interval (a, b] and the argument is almost the same as above.
2. Prove that the sets [a, ) and (, a] are closed subsets of R.
a) Consider R\[a, ) = (, a). Consider any x (, a). Let = ax and consider
the subset (x , x + ). Clearly, x (x , x + ) (, a). This is true for any
x (, a). Hence, (, a) is an open subset. Hence, [a, ) is a closed set of R.
b) Consider R\(, a] = (a, ). Consider any x (a, ). Let = x a and consider
the subset (x , x + ). Clearly, x (x , x + ) (a, ). This is true for any
x (a, ). Hence, (a, ) is an open subset. Hence, (, a] is a closed set of R.
3. Show, by example, that the union of an innite number of closed subsets of R is not
necessarily a closed subset of R.
a) Let A
n
= [
1
n
, 1
1
n
]. Then, A =

n=2
A
n
=

n=2
[
1
n
, 1
1
n
] = (0, 1) which is clearly
an open set of R.
4. Prove each of the following statements.
a) The set Z of all integers is not an open subset of R.
Proof by contradiction. Assume that it is an open subset, then for each x Z,
there exists an open interval, say (a, b) such that x (a, b) and (a, b) Z. Let
= mn(xa, b x). By Archimedean property, choose a positive integer n 2
9
10 CAP

ITULO 2. EJERCICIOS CAP. 2

such that
1
n
. Then we have that x
1
n
(a, b) but x
1
n
is not an integer.
Hence, Z of all integers is not an open subset of R.
b) The set P of all prime numbers is a closed subset of R but not an open subset of R.
We shall rst prove that P is a closed subset of R. Consider C = R\P. We
will prove that this set is open. Note that since primes are a subset of natu-
ral numbers, it is well-ordered. In particular, we can write P = {p
k
N :
p
k
{isthe}k
th
prime} i.e. we have p
1
p
2
p
3
. This means C = (, p
1
)

k=1
(p
k
, p
k+1
).
Note that (, p
1
) and (p
k
, p
k+1
) are open sets. Since union of open sets is still
an open set, we get that C is an open set. Hence, we have that P is a closed
subset of R.
We shall now prove that P is not an open subset of R. The proof goes by
contradiction. Assume that it is an open subset, then given any p
k
P, there
exists and open subset (a, b) P such that p
k
(a, b). Let = mn({p
k
a, b
p
k
}). By Archimedean property, we have that there exists a positive integer n 2
such that
1
n
. Now we have p
k

1
n
(a, b) but p
k

1
n
/ P. CONTRADICTION.
Hence, P is not an open subset of R.
c) The set I of all irrational numbers is neither a closed subset nor an open subset of
R.
Note that if A is not open, then X\A is not closed and similarly if A is not
closed, then X\A is not open. We proved as a proposition earlier that the set
Q = R\I is neither open nor closed. Hence, I is neither open nor closed.
5. If F is a non-empty nite subset of R, then show that F is closed in R but that F is not
open in R.
a) Since F is a non-empty nite subset of R, we can write F = {f
1
, f
2
, . . . , f
n
} where
n Z
+
and f
1
f
2
f
n
.
We shall rst prove that F is closed. Let F
c
= R\F. Then we have F
c
=
(, f
1
)
_

n1
k=1
(f
k
, f
k+1
)
_
. Each of the set i.e. (, f
1
) and (f
k
, f
k+1
) are
open sets. Hence, union of open sets is again open. Hence, F
c
is open. Hence, F
is a closed set of R.
We shall not prove that F is not open in R. We shall prove by contradiction.
Assume F is open. This means that for any f
k
F, we have an open set say
(a, b) such that f
k
(a, b) and (a, b) F. Let = mn({f
k
a, b f
k
, f
k+1

f
k
, f
k
f
k1
}). By Archimedean property, we can choose a positive integer n
2, such that
1
n
. Consider f
k

1
n
. We have f
k

1
n
(a, b) but f
k

1
n
/ F.
CONTRADICTION. Hence, F is not an open subset of R.
6. If F is a non-empty countable subset of R, prove that F is not an open set.
a) F is a countable subset of R. We shall prove by contradiction that F is not open.
Assume the F is a open subset of R. Then this means that for every x F, there
exists an open interval (a, b) F. Hence, we now have (a, b) F. However note
that (a, b) is an uncountable set whereas F is a countable set. But any subset of a
countable set is again a countable set. CONTRADICTION. Hence, F is not an open
set.
7. (7)
a) Let S = {0, 1,
1
2
,
1
3
, . . . ,
1
n
, . . .}. Prove that the set S is closed in the euclidean topology
on R.
2.1. EJERCICIOS 2.1 11
Let S
c
= R\S. Hence, we have S
c
=
_

k=1
_
1
k+1
,
1
k
__
(, 0) (1, ). Note
that each of the interval in the union is an open interval. Hence, the set S
c
is
also an open set. Hence, S is a closed set on R.
b) Is the set T = {1,
1
2
,
1
3
, . . . ,
1
n
, . . .} closed in R?
Let T
c
= R\T. Hence, we have T
c
=
_

k=1
_
1
k+1
,
1
k
__
(, 0] (1, ). We
shall prove that T
c
is not open. Again, the proof is by contradiction. Assume
that the set T
c
is open. Consider the point 0. Since T
c
is assumed to be open,
there exists an open set (a, b) containing 0 and (a, b) T
c
. Let = mn(a, b).
By Archimedean property, there exists an integer n 2 such that
1
n
. Hence,
1
n
(a, b). However,
1
n
/ T
c
. This CONTRADICTS the fact the (a, b) T
c
.
Hence, T
c
is not open. Hence, T is not closed.
c) Is the set S = {

2, 2

2, 3

2, . . . , n

2, . . .} closed in R?
We have S
c
=
_

k=1
(k

2, (k + 1)

2)
_
(,

2). S
c
is a union of open in-
tervals which are open sets. Hence, S
c
is a open set. Hence, S is a closed set in
R.
8. (8)
a) Let (X, ) be a topological space. A subset S of X is said to be an F

-set if it is the
union of a countable number of closed sets. Prove that all open intervals (a, b) and
all closed intervals [a, b], are F

-sets in R.
We have (a, b) =

k=1
_
a +
1
k
, b
1
k
_
. Hence, any open interval is a F

set.
We have [a, b] =

k=1
[a, b]. Hence, any closed interval is a F

set.
b) Let (X, ) be a topological space. A subset S of X is said to be an G

-set if it is the
intersection of a countable number of open sets. Prove that all open intervals (a, b)
and all closed intervals [a, b], are G

-sets in R.
We have (a, b) =

k=1
(a, b). Hence, any open interval is a G

set.
We have [a, b] =

k=1
_
a
1
k
, b +
1
k
_
. Hence, any closed interval is a G

set.
c) Prove that the set of rationals is an F

set in R.
The rationals form a countable set. Hence, we can list the rationals as Q =
{q
k
}

k=1
. We proved in one of the propositions earlier that the set {a} is a closed
set in R. Hence, we have Q =

k=1
{q
k
} which means Q is a countable union of
closed sets in R. Hence, the set of rationals is an F

set in R.
d) Verify that the complement of an F

-set is a G

-set and the complement of a G

-set
is a F

-set.
First we shall prove that the complement of an F

-set is a G

-set. Let A be an
F

-set. This means that A =

k=1
F
k
where F
k
are closed sets. This means that
F
c
k
are open sets. We have A
c
=

k=1
F
c
k
, where F
c
k
are open sets and hence A
c
is a countable intersection of open sets. Hence, A
c
is a G

-set.
Now we shall prove that the complement of a G

-set is a F

-set. Let A be a
G

-set. This means that A =

k=1
G
k
where G
k
are open sets. This means that
G
c
k
are closed sets. We have A
c
=

k=1
G
c
k
, where G
c
k
are closed sets and hence
A
c
is a countable union of closed sets. Hence, A
c
is a F

-set.
12 CAP

ITULO 2. EJERCICIOS CAP. 2

2.2. Ejercicios 2.2
1. In this exercise, you will prove that the disc {(x, y) : x
2
+ y
2
< 1} is an open subset of
R
2
, and then that every open disc in the plane is an open set.
a) Let (a, b) be any point in the disc D = {(x, y) : x
2
+ y
2
< 1}. Put r =

a
2
+ b
2
.
Let R
(a,b)
be the open rectangle with vertices at the points
_
a
1r
8
, b
1r
8
_
. Verify
that R
(a,b)
D.
All we need to show is that all the four vertices lies inside the disc, for which we
need to show that the distance from the origin to each of the four vertices is less
than unity. To show that all we need to show is that the distance of the farthest
vertex from the origin is less than unity. The distance of the farthest vertex from
the origin is given by d = r +

2
1r
8
=

2
8
+ r
_
1

2
8
_
. Since 0 r1, we get

2
8
d1. Hence, we get that R
(a,b)
D.
b) Using the previous part show that D =

(a,b)D
R
(a,b)
.
Consider any point (a, b) D. Clearly, (a, b) R
(a,b)
. Hence, any point in
the disc is contained in an open rectangle centered about that point. Hence,
D

(a,b)D
R
(a,b)
. From the previous part, we have that for any (a, b) we
have R
(a,b)
D. Hence, D

(a,b)D
R
(a,b)
. Combining the two, we get D =

(a,b)D
R
(a,b)
.
c) Deduce from above that D is an open set in R
2
.
Every open rectangle is an open set. Hence, any arbitrary union of open sets is
again an open set. From the previous part, we have that D is an arbitrary union
of open rectangles. Hence, D is an open set.
d) Show that every disc {(x, y) : (x a)
2
+ (y b)
2
c
2
, a, b, c R} is open in R
2
.
Let (m, n) be any point in the disc D = {(x, y) : (x a)
2
+ (y b)
2
c
2
}. Put
r =
_
(ma)
2
+ (n b)
2
. Let R
(a,b)
be the open rectangle with vertices at the
points (a + m
cr
8
, b + n
cr
8
). Now the same arguments as the above three
gives us that the disc D = {(x, y) : (x a)
2
+ (y b)
2
c
2
} is open in R
2
.
2.2. EJERCICIOS 2.2 13
2. In this exercise you will show that the collection of all open discs in R
2
is a basis for a
topology on R
2
. [Later we shall see that this is the euclidean topology.]
a) Let D
1
and D
2
be any open discs in R
2
with D
1
D
2
= . If (a, b) is any point
in D
1
D
2
, show that there exists an open disc D
(a,b)
with centre (a, b) such that
D
(a,b)
D
1
D
2
.
We are given that D
1
D
2
= . Let the center and radius of D
1
be (a
1
, b
1
) and
r
1
respectively. Let the center and radius of D
2
be (a
2
, b
2
) and r
2
respectively.
Since, we have D
1
D
2
= , we have r
1
+ r
2
_
(a
1
a
2
)
2
+ (b
1
b
2
)
2
. Let r =
mn(r
1

_
(a a
1
)
2
+ (b b
1
)
2
, r
2

_
(a a
2
)
2
+ (b b
2
)
2
). Consider the disc
centered at (a, b) with radius r. This disc lies completely inside D
1
D
2
.
b) Show that
D
1
D
2
=
_
(a,b)D
1
D
2
D
(a,b)
.
Consider any (x, y) D
1
D
2
. Note that (x, y) D
(x,y)
. (x, y) is one such (a, b)
in the union. Hence (x, y) D
(x,y)

(a,b)D
1
D
2
D
(a,b)
. Hence, we get D
1
D
2

(a,b)D
1
D
2
D
(a,b)
. Now, for any (x, y) D
1
D
2
, we have D
(x,y)
D
1
D
2
.
Hence, we get

(a,b)D
1
D
2
D
(a,b)
D
1
D
2
.
c) Using the above and the proposition proved earlier, prove that the collection of all
open discs in R
2
is a basis for a topology on R
2
.
First note that we have R
2
=

D
(a,b)
(n) where D
(a,b)
(n) denotes an open unit
disc of radius n centered at (a, b). The proof is trivial since any D
(a,b)
(n) R
2
and also for any point (x, y) R
2
, we have n N such that n

x
2
+ y
2
and hence
(x, y) D
(0,0)
(n). Next note that from the part above, we have that intersection
of any two discs is again a union of open discs. Hence, by the proposition proved
earlier we have that the collection of all open discs in R
2
is a basis for a topology
on R
2
.
3. Let B be the collection of all open intervals (a, b) in R with ab and a and b rational
numbers. Prove that B is a basis for the euclidean topology on R.
14 CAP

ITULO 2. EJERCICIOS CAP. 2

a) We shall prove that if S R is an open set then given any x S we can nd an
open interval (a
q
, b
q
) S where a
q
, b
q
Q. Since S is an open set, we know that
there exists a, b R such that x (a, b) S. Further, since the rationals are dense
in R, given any r R, there exists a sequence of rationals monotonously converging
to r. For instance, there exists a sequence of monotonously increasing b
n
Q such
that lm
n
b
n
= b. Similarly, there exists a sequence of monotonously decreasing
a
n
Q such that lm
n
a
n
= a. This means that (a, b) =

n
(a
n
, b
n
). Hence, if
x (a, b), then x (a
n
, b
n
) for some n where a
n
, b
n
Q. Hence, given any open set
S, for every x S, there exists an open interval with rational end points containing
x lying within S. Hence, the set of open intervals with rational end points generate
the same topology as the euclidian topology.
4. A topological space (X, ) is said to satisfy the second axiom of countability or to be
second countable if there exists a basis B for , where B consists of only a countable
number of sets.
a) Using the previous exercise show that R satises the second axiom of countability.
We have B = {(a
q
, b
q
) : a
q
, b
q
Q} is a basis for the euclidean topology. We
have the set of rational numbers to be countable. The set B can be written as
B =

a
q
b
q
;a
q
Q

b
q
Q
(a
q
, b
q
) which is again a countable set.
b) Prove that the discrete topology on an uncountable set does not satisfy the second
axiom of countability.
Let B be a basis for the discrete topology. For every x X, we have {x} to
be an open set in the discrete topology. This means that we have {x} to be
a union of elements in B. This means that the singleton sets should be in the
basis B. Hence, we have {{x} : x X} B. Since X is uncountable, we have
{{x} : x X} to be an uncountable set. Hence, we have that B to be an
uncountable set. Hence, (X, ) satises the second axiom of countability.
c) Prove that R
n
satises the second axiom of countability, for each positive integer n.
We proceed by induction. Let P(n) be the statement that R
n
satises the second
axiom of countability. Let S = {n N : P(n) is true}. From the rst part of
this problem, we have 1 S i.e there exists a countable basis B for the euclidean
topology on R. Assume that k S. Note that R
k+1
= R
k
R. By induction
hypothesis, we have that there exists a countable basis B
k
for the euclidean
topology on R
k
. From the question 6, which is proved later we have that B
k
B
is a basis for R
k
R = R
k+1
. Product of two countable sets is again a countable
set. Hence, B
k
B is a countable basis for R
k
R = R
k+1
. Hence, R
n
satises
the second axiom of countability, for each positive integer n.
d) Let (X, ) be the set of all integers with the nite-closed topology. Does the space
(X, ) satisfy the second axiom of countability?
Let
c
= {A X : X\A } i.e.
c
contains all the closed sets induced by
the topology . In this case, we have
c
= {A X : A is nite}. Note that
is equivalent to
c
since there is a clear bijection from to
c
as A i
X\A
c
. We shall prove that
c
is a countable set. This would mean that is
a countable set and since any basis B we would have proved that the (X, ),
with the nite-closed topology, satises the second axiom of countability. Since
X is a countable set, list the element of X as {x
0
, x
1
, . . . , x
n
, . . .}. Any nite
subset B of X is of the form B = {x
k
0
, x
k
1
, . . . , x
k
n
} where n N and k
i
N
2.2. EJERCICIOS 2.2 15
for i {0, 1, . . . , n}. Let f(B) =
n

l=0
2
k
l
. It is not hard to see that f :
c
N
is a bijection. Hence,
c
is a countable set. This means that the topology, , is
also countable and hence any basis is also a countable set. Hence, (X, ), with
the nite-closed topology, satises the second axiom of countability.
5. Prove the following statements.
a) Let m and c be real numbers, with m = 0. Then the line L = {(x, y) : y = mx + c}
is a closed subset of R
2
.
Consider L
c
= R
2
\L. We shall prove that L
c
is an open set. Consider (a, b) L
c
.
We shall prove that there is a rectangle R L
c
such that (a, b) R. Let d denote
the distance of the point (a, b) from the line L. We have d =
bamc

1+m
2
0. Consider
the open rectangle R with vertices (a
d
2
, b
d
2
). We get (a, b) R and R L
c
.
Hence, L
c
is an open set. Hence, L is a closed set.
b) Let S
1
be the unit circle given by S
1
= {(x, y) R
2
: x
2
+ y
2
= 1}. Then S
1
is a
closed subset of R
2
.
Consider T = R
2
\S
1
. We shall prove that T is open. Consider any (a, b) T.
Let r = abs(1

a
2
+ b
2
). Consider the open rectangle R with vertices at
(a
r
2
, b
r
2
). Clearly, we have (a, b) R T. This is true for any (a, b) T.
Hence, T is an open set. Hence, S
1
is a closed set of R
2
.
c) Let S
n
be the unit n-sphere given by
S
n
= {(x
1
, x
2
, . . . , x
n
, x
n+1
) R
n+1
: x
2
1
+ x
2
2
+ + x
2
n+1
= 1}.
Then S
n
is a closed subset of R
n+1
.
Consider T = R
n+1
\S
n
. We shall prove that T is open. Consider any (a
1
, a
2
, . . . , a
n+1
)
T. Let r = abs
_
1
_
a
2
1
+ a
2
2
+ + a
2
n
+ a
2
n+1
_
. Consider the open rectangle R
with vertices at
_
a
1

r
n+1
, a
2

r
n+1
, . . . , a
n

r
n+1
, a
n+1

r
n+1
_
. Clearly, we have
(a
1
, a
2
, . . . , a
n
, a
n+1
) R T. Hence, T is an open set. Hence, S
n
is a closed
subset of R
n+1
.
d) Let B
n
be the closed unit n-ball given by
B
n
= {(x
1
, x
2
, . . . , x
n
) : x
2
1
+ x
2
2
+ + x
2
n
1}.
Then B
n
is a closed subset of R
n
.
16 CAP

ITULO 2. EJERCICIOS CAP. 2

Consider T = R
n
\B
n
. We shall prove that T is open. Consider any (a
1
, a
2
, . . . , a
n
)
T. Let r =
_
a
2
1
+ a
2
2
+ + a
2
n
1. Consider the open rectangle R with vertices
at
_
a
1

r
n+1
, a
2

r
n+1
, . . . , a
n

r
n+1
, a
n+1

r
n+1
_
. Clearly, we have (a
1
, a
2
, . . . , a
n
, a
n+1
)
R T. Hence, T is an open set. Hence, B
n
is a closed subset of R
n
.
e) The curve C = {(x, y) R
2
: xy = 1} is a closed subset of R
2
.
Consider T = R
2
\C. We shall prove that T is open. Consider any (a, b) T. Let
r be the minimum distance from the point (a, b) to the curve C. Consider the
open rectangle R with vertices at (a
r
2
, b
r
2
). Clearly, we have (a, b) R T.
This is true for any (a, b) T. Hence, T is an open set. Hence, C is a closed set
of R
2
.
6. Let B
1
be a basis for the topology
1
on a set X and B
2
be a basis for the topology
2
on
a set Y . The set X Y consists of all ordered pairs (x, y), x X and y Y . Let B be
the collection of subsets of X Y consisting of all the sets B
1
B
2
where B
1
B
1
and
B
2
B
2
. Prove that B is a basis for a topology on X Y . The topology so dened is
called the product topology on X Y .
a) All we need to do is to check the denitions of a basis. We are given that B
1
and B
2
are a basis for
1
and
2
respectively. Hence, we have
BB
1
B = X and
BB
2
B = Y .
Also, if we have C, D B
1
, then C D B
1
. Similarly, if we have C, D B
2
, then
C D B
2
. Now consider any element in B
1
B
2
. It is of the form B
1
B
2
where
B
1
B
1
and B
2
B
2
. Now the union over all elements in B
1
B
2
can be written as

B
1
B
1
,B
2
B
2
B
1
B
2
. We then have
B
1
B
1
,B
2
B
2
B
1
B
2
=
B
1
B
1
(B
1

B
2
B
2
B
2
) =

B
1
B
1
B
1
Y =
B
1
B
1
(B
1
) Y = X Y . Also, if we have A, B B, then
A = A
1
A
2
and B = B
1
B
2
where A
1
, B
1
B
1
and A
2
, B
2
B
2
. Then AB = ().
2.3. Ejercicios 2.3
Captulo 3
Referencias
Tomado de http://adhvaithist.blogspot.com/2011/08/11-exercises.html
17
18 CAP

ITULO 3. REFERENCIAS
Captulo 4
Anexos
19