Topology

St. Marys College of Maryland Topology Class July 12, 2013

Topological Spaces

In this chapter we dene topological spaces and look at a number of examples. In addition, we dene subspaces and construct corresponding examples. Denition A topological space is a non-empty set X together with a collection T of subsets of X such that: 1. The empty set is in T . 2. The set X itself is in T . 3. Any nite intersection of sets in T is also in T . 4. Any union of sets in T is also in T . or more formally, 1. T . 2. X T . 3. Ai T , i = 1 n 4. A T , { Ai | i = 1 n } T .

{A | } T .

Denition Given a topological space {X, T }, T is called the topology, the elements of X are called points and the elements of T are called open sets. Denition A subset B of a topological space X is closed X \ B (the compliment of B ) is open. Lemma 1.1. If X is a set and T a collection of subsets of X such that A1 , A2 T , A1 A2 T , then property 3 is satised for T . Proof. Let X be a set and T a collection of subsets of X such that A1 , A2 T , A1 A2 T . We will proceed by induction on the number of sets in the union. First, we note that for n = 2, property 3 is the same as our assumption about T . Now, we assume that property 3 is true for intersections of n < k sets. Now we want to show that for k sets, Ai , {Ai |i = 1 . . . k } T . However, we can separate out any particular element of that intersection, and thus obtain that
k k 1

Ai =
i=1 i=1

Ai Ak .
k 1 i=1

By induction hypothesis when n = k 1, we know that =

k

T , and therefore,

= Ak ,
i=1

which is in T by our induction hypothesis for n = 2. 1

Denition If X is a collection of sets such that A, B X , A B or B A, then X is a chain. Theorem 1.2. Let X be a set and S be a collections of subsets of X such that X is a chain. Then S satises properties 3 of the denition of topological space. Proof. Let X be a set. Now let S be a collection of subsets of X such that S is a chain. Consider A, B S . Because S is a chain, we know that A B , or B A. Without loss of generality, let A B . Then we know that A B = A. Since A S , we conclude by lemma 1.1 that S satises property 3. Lemma 1.3. If X is a set and T a nite collection of subsets of X such that A1 , A2 T , A1 A2 T , then property 4 is satised for T . Proof. Let X be a set and T a nite collection of subsets of X such that A1 , A2 T , A1 A2 T . We will proceed by induction on the number of sets in the union. We take a moment to note that there cannot be more distinct sets in the union than there are in T , and that without loss of generality, we can take the union over distinct sets. It follows that the arbitrary union described in property 4 is a nite union. now, we move back to induction. First, we note that for n = 2, property 4 is the same as our assumption about T . Now, we assume that property 4 is true for intersections of n < k sets. Now we want to show that for k sets, Ai , {Ai |i = 1 . . . k } T . However, we can separate out any particular element of that intersection, and thus obtain that
k k 1

Ai =
i=1 i=1

Ai Ak .
k 1 i=1

By induction hypothesis when n = k 1, we know that =

k

T , and therefore,

= Ak ,
i=1

which is in T by our induction hypothesis for n = 2. Theorem 1.4. Let X be a set. Now let S be a nite collection of subsets of X such that S is a chain. Then S satises property 4 of the denition of topological space. Proof. Let X be a set. Now let S be a collection of n subsets of X such that S is a chain. Now, let A, B S . It follows that A B or B A. Without loss of generality, we let A B . Now, we note that A B = A. Since A S , we conclude by lemma 1.3 that S satises property 4. Example 1.5. Let X = {a, b} and T = {, {a}, {a, b}}, then {X, T } is a topological space. Proof. We rst note that T , and that X T . Therefore, it we must only verify properties 3 and 4. In order to verify these properties, we rst note that the elements of T form a chain. Consider two elements of T . If one of these two sets is the emptyset, the other set contains it. If either set is X , then it contains the other. If both are neither the empty set, nor X , then both are {a}, and therefore contain eachother. Then T is a chain. By theorem 1.2, we know that {X, T } satises property 3 of the denition of topological space. Furthermore, we know by theorem 1.4 that {X, T } satises property 4. Since {X, T } satises all of the parts of the denition of a topological space, it is one. Example 1.6. Let X = {a, b, c} and T = {, {a}, {b}, {a, b, c}}, then {X, T } is not a topological space. The set {a, b} = {a} {b} is not in T , so T does not satisfy property 3. However, if we add in the set {a, b}, then we have T = {, {a} , {b} , {a, b} , {a, b, c}} which is a topology. The proof here is tedious, and more dicult to write out than it is worth. However, there are only 24 intersections we need to check by the lemma 1.1 Remark 1.7. From here on we will use the word space to mean a topological space.

Denition Two spaces {X, T } and {X , T } are homeomorphic if there exists a renaming if the renaming of every open set is open, and upon renaming, no sets that were not open become open. Remark 1.8. We will revisit this concept in the next chapter. For now, a renaming is literally an assignment of a new name to each element of X with a few properties. Things that have dierent names need to have dierent names assigned to them. Property 2 implies that unless every element of X has something assigned to it, then there will be an open set X that isnt just the renaming of an old open set. Example 1.9. Let X = {a, b}, T1 = {, {a}, {a, b}}, T2 = {, {b}, {a, b}}, T3 = {, {a, b}}. T3 has a dierent cardinality than the other two, so there can be no bijection between T3 and the other two spaces. However, letting : X X (a) = b, and (b) = a, we see that T1 and T2 are the same. Proof. We will go over why satises denition 1. Since is dened to give each input uniquely one output, phi is injective. Since each element of X is mapped to by the other element of X , is surjective. Then satises the denition of a bijection. In order to do this we look at the images of all of the open sets in T1 and T2 : () = T2 ({a}) = {b} T2 ({a, b}) = {a, b} T2 1 () = T1 1 ({b}) = {a} T1 1 ({a, b}) = {a, b} T1

Example 1.10. The following are all the dierent topologies for X = {a, b, c} {, X } {, {a} , X } {, {a, b} , X } {, {a} , {a, b} , X } {, {a} , {b, c} , X } {, {a} , {a, b} , {a, c} , X } {, {a} , {b} , {a, b} , X } {, {a} , {b} , {a, b} , {a, c} , X } {, {a} , {b} , {c} , {a, b} , {a, c} , {b, c} , X } (1) (2) (3) (4) (5) (6) (7) (8) (9)

Remark 1.11. Here we see the power of the idea of renaming. To literally switch two letters corresponds precisely to a renaming, and therefore to a homeomorphism. Since the sets we are looking at are the topologies in this case, if we switch every instance of one with another, we get the image of some homeomorphism. Theorem 1.12. Let X be a non-empty set and T = {, X }. Then T is a topology for X . Proof. We know that properties 1 and 2 are satised by the denition of T . Furthermore, since X , we know that T is a chain, and therefore satises properties 3 and 4 by theorems 1.2 and 1.4. Denition We call the topology in the theorem above the trivial topology for X . Theorem 1.13. Let X be a non-empty set and T = {all subsets of X }. Then T is a topology for X . Proof. T satises properties 1 and 2 by denition. Furthermore, the union and intersection of subsets of X will always be a subset of X , and therefore T satises properties 3 and 4 as well. 3

Denition We call the topology in the theorem above the discrete topology for X . Denition Let {X, TX } be a space, and B a collection of subsets of X such that every element of B is in TX , and every element of TX can be written as a union of members of B . We call B a basis for TX , and TX the topology induced by B . Theorem 1.14. Let X be a non-empty set and B a collection of subsets of X satisfying: 1. The union of all elements of B is X. 2. The intersection of any pair of elements of B is the union of elements of B . Let S = {the set of all possible unions of elements of B}. Then S is a topology for X with basis B . Proof. Let S be such a set. The empty set is in S by denition. Furthermore, by property 1 of B , we know that X S . Furthermore, S satises property 4 by denition. It is therefore left to verify property 3. Consider A, B S . We want to show that A B S . By the denition of S , we know that A = and B = . We note that AB =(

) (
M

) ))

= =

( (
M

( )
M

Since and are both in B , we know that B by property 2 of B . It follows that S is a topology. Finally, since S is dened to be the unions of elements of B , we know that B is a basis for S . Denition Let R be the set of real numbers, x R, and > 0 then

N (x, ) = {y R|x < y < x + }. Note that N (x, ) can also be written as {y R||x y | < }. We call N (x, ) an -ball about x. Theorem 1.15. Let X = R and B = {N (x, )|x R, > 0} then B is a basis for a topology on R. Proof. Let X and B be dened as above. We want to show that B satises the conditions from theorem 1.14. First we note that R=
xR

N (x, 1).

It follows that B satises the rst criteria of theorem 1.14. Now let N (x, ), N (y, ) B . If N (x, ) N (y, ) = , then it can be written as the union of no sets of B . In the case that it is not empty, let z N (x, ) N (y, ). Now let (z ) = min( |x z |, |y z |). We claim that N (z, (z )) N (x, ) N (y, ). In fact, this follows directly from the triangle inequality, which says that for a point w N (z, (z )) |x w| |x z | + |z w| < (z ) + |x z | |y w| |y z | + |z w| < (z ) + |y z | Therefore, we note that since z is arbitrary we can express N (x, ) N (y, ) =
z N (x, )N (y, )

N (z, (z )).

Since each of those N (z, (z )) is an element of B , it follows that B satises the second requirement of theorem 1.14. Therefore, we conclude by theorem 1.14 that B is a basis for a topology on R 4

Denition Let X be a metric space. The metric ball N (x, ) = {y : d(x, y ) < }. Theorem 1.16. Let X be a metric space and B = {N (x, )|x X, > 0} then B is a basis for a topology on X . Proof. Let X and B be dened as above. We want to show that B satises the conditions from theorem 1.14. First we note that X=
x X

N (x, 1).

It follows that B satises the rst criteria of theorem 1.14. Now let N (x, ), N (y, ) B . If N (x, ) N (y, ) = , then it can be written as the union of no sets of B . In the case that it is not empty, let z N (x, ) N (y, ). Now let (z ) = min( |x z |, |y z |). We claim that N (z, (z )) N (x, ) N (y, ). In fact, this follows directly from the triangle inequality, which says that for a point w N (z, (z )) |x w| |x z | + |z w| < (z ) + |x z | |y w| |y z | + |z w| < (z ) + |y z | Therefore, we note that since z is arbitrary we can express N (x, ) N (y, ) =
z N (x, )N (y, )

N (z, (z )).

Since each of those N (z, (z )) is an element of B , it follows that B satises the second requirement of theorem 1.14. Therefore, we conclude by theorem 1.14 that B is a basis for a topology on X Denition With B dened as above we dene En to be the topology induced by B and refer to En as the Euclidean topology for Rn . We sometimes just refer to En instead of {Rn , En } for the whole space. Theorem 1.17. En = {A Rn |x A, > 0 such that N (x, ) A}. Proof. We prove this using mutual set containment. First, we note that {A Rn |x A, > 0 such that N (x, ) a} E n by the denition of basis. Next let X E n . We note that X = N (x, ). We will prove that for each N (x, ), we can view it as yN (x, ) N (y, (y )). From there, the property carries over to the union, and the proof is complete. Let y N (x, ). We know that |y x| < , and therefore that |x y | > 0. Therefore, we let (y ) = |x y |. Now consider z N (y, (y )). |x z | |x y | + |y z | < |x y | + (y ) < |x y | + | x y | = , and so z N (x, ). We conclude that N (y, (y )) N (x, ). Furthermore, since y is arbitrary, we can conclude that y N (x, ), N (y, (y )) N (x, ). And furthermore that N (x, ) = yN (x, ) N (y, (y )). This property transfers to the union, and concludes the proof. (x, ) = {y R|x < y x}. Denition Dene N 5

 = {N (x, )|x R, > 0} then B is a basis for a topology on R. Theorem 1.18. Let X = R and B (x, ) N (y, ) = N (min(x, y ), min(x, y ) max(x , y delta)). We further note Proof. We note that N that xR) N (x, 1) = R. By theorem 1.14, we conclude the proof. Denition We will call H1 the half-open topology for R. Theorem 1.19. Let F1 = {A R|R \ A is a nite set} . Then the pair {R, F1 } is a topological space. Proof. First we note that is nite, and so R F1 . Furthermore let A, B F1 . It follows that R \ A and R \ B are nite, and therefore that (R \ A) (R \ B ) is also nite. Furthermore R \ (A B ) = ((R \ A) (R \ B )) by DeMorgans laws. Since the compliment of A B is nite, then A B F1 , and F1 satises property 3 of the denition of topological space. Now consider an arbitrary union of elements of F1 . We know by DeMorgans laws that R\

O =

R \ O

Since each compliment is nite, we know that their intersection (the subset of a nite set), is also nite. Denition We call F1 the Finite-Complement Topology for R. Denition Denote R with the trivial topology as {R, T1 }, and R with the discrete topology as {R, D1 }. Theorem 1.20. Let X be a space. If {x} is open, and B is a basis for X , then we know that {x} B . Proof. Let X and B be described as above. Now let {x} be open in X . Then {x} = {B | }. Since x {x}, then x {B }, and therefore, there must exist at least one such that x B . Since x is the only element of {x}, we know that {x} B . Furthermore, we know that B {x} by the denition of union. It therefore follows that B = {x}, and {x} B , which completes the proof. Example 1.21. Determine whether sets consisting of single points are open in any of the ve topologies E1 , H1 , F1 , T and D1 . Considering our bases for the spaces, we know that any basis element of E is uncountable. We know the same things about H1 , T1 , and F1 . Then E, H1 , F1 and T1 are denitely out. On the other hand, singleton points are in the power set, so D1 does have single point sets. Denition Let {X, T } be a topological space, A X and x X . Then, x is a limit point of A (O T such that x O)(O (A \ {x}) = ). Cl(A) (the closure of A) = A {limit points of A}. Denition Let {X, T } be a topological space, A X and x X . Then, x is a interior point of A (O T such that x O and O A), Int(A) (the interior of A) = {interior points of A}. Example 1.22. Let X = {p, q, r}, T = {, {r}, {p, q }, {p, q, r}} and A = {p, r}. Int(A) = {r}. There is no set in T such that contains {p} and is contained by A. Cl(A) = {p, q, r}. Any set in T that contains q also contains p, therefore q is a limit point of A. Example 1.23. Let X = E2 (really, X = R2 , TX = E2 ) and A = {(x, y )|0 x < 2, 0 y < 2}. Consider the point (0, 0). Let O be an open set such that (0, 0) O. Then O can be written as the union of basis elements {N (x , )| }. Since (0, 0) is in the union, we know that it is in at least one N (x, ).

 Now, let = |(0, 0) x|. Since (0, 0) N (x, ), we know that < . Then letting y = ( 2 , 2 ), we see by the triangle inequality that

|y x| |y (0, 0)| + |(0, 0) x| = + 2 < which shows that y N (x, ). Since y / A, we know that (0, 0) is not an interior point of A. Keeping the same , x and , we note that z = 2 , 2 allows us to construct a parallel triangle inequality |z x| |z (0, 0)| + |(0, 0) x| = + 2 < to show that z N (x, ). Furthermore, z A. It follows that (0, 0) is a limit point of A. Now consider the point (1, 1). First, we note that N ((1, 1), 1) A, so (1, 1) is an interior point. Now let O be an open set containing (1, 1). We know by argument from above that there exists a basis element N (x, ) containing (1, 1). Again letting = |x (1, 1)|, we let y = (1 + min( 2 , 1), 1 + min( 2 , 1). By the triangle inequality, we know that |y x| |y (0, 0)| + |(0, 0) x| = + 2 < or y N (x, ). Furthermore, we know that y A, since each componenet is less than or equal to 2. Therefore, y (N (x, ) A {(1, 1)}), and therefore (1, 1) is a limit point of A. Finally consider (3, 3). Let O be an open set containing (3, 3). We know that (3, 3) O, and therefore that O is not a subset of A, because (3, 3) / A. Therefore (3, 3) is not an interior point of A. Furthermore, 1 N ((3, 3), 1 ) is an open set containing (3 , 3) such that N ((3, 3), 2 ) A = , so (3, 3) is not a limit point of A. 2 Theorem 1.24. In any space X , a set A X is open All points of A are interior. Proof. Let X be a space, and A X be an open set. Let a A. Since A is open, and A A, we know that a is an interior point of A. This completes the proof. Let X be a space, and A X such that every point of A is interior. Then for each a A, we dene Oa to be the open set containing a such that Oa A. Then we know that {Oa |a A} is open by property 4, and we know that {Oa |a A} = A, because each Oa contains a. Therefore, A is open. Theorem 1.25. In any space X , a set A X is closed A contains all of its limit points. Proof. Let X be a space, A X be closed, and x X \ A. Since A is closed, then X \ A is open. Therefore by theorem 1.24, we know that there is an open set O such that O X \ A and x O. It follows that x is not a limit point of A. Let X be a space, A X contain all of its limit points. Now let x X \ A. Since x X \ A, we know that x is not a limit point of A. Therefore, there exists an open set O such that x O, and O A = . This in turn means that O X \ A. Therefore, X \ A is open, and A is closed. Theorem 1.26. The closure of S is closed.

Proof. Let X be a space, with S X . Now let A be the closure of S . We will prove that A is closed using theorem 25 from chapter 1. Let x be a limit point of A. Furthermore, assume for the sake of contradiction that x / A. By the denition of closure, we know that x is not a limit point of S . Therefore, there exists an open set O such that x O, and A (O \ {x}) = A O = . However, x is a limit point of A, so a A such that a O. Since A = S {Limit points of S }, we know that a is a limit point of S . However, a O, and S (S \ {a}) S O = , which means that a is not a limit point of S , which is a contradiction. Theorem 1.27. If C is closed and S C , then Cl(S ) C . Proof. Let S be a set, and C be a closed set such that S C . Now let x Cl(S ). If x S , then x C by assumption. Therefore, we only deal with the case where x / S . Then since x Cl(S ), we know that x must be a limit point of S . Now let O be an open set such that x O. Then since x is a limit point of S , O (S \ {x}) = . Furthermore, since S C , we know that O (S \ {x}) O (C \ {x}), and therefore O (C \ {x}) = . This means that x is a limit point of C , and by theorem 25 from chapter 1, x C . Therefore Cl(S ) C . Denition Let X be a space with topology TX , and Y X where Y = . Let TY = {A Y | O open in X (ie.O TX ) with A = O Y }. Theorem 1.28. The collection TY is a topology for Y . Proof. Since X Tx , and X Y = Y , Y TY . Furthermore, since TX and Y = , TY . Now let A, B TY . Then A = A Y where A TX and B = B Y where B TX . Then by property 3, we know that A B TX . Furthermore, we know that A B = (A Y ) (B Y ) = (A B ) Y TY , which by lemma 1.1 means that TY satises property 3. Now let O TY . We know that for each O , there exists O TX such that O = O Y . We know by property 4 that {O | } TX , and therefore that (

O ) Y = =

(O Y )

TY . We conclude that {Y, TY } satises all 4 properties of topological spaces, and is therefore a topological space. Denition With this topology, we call Y a subspace of X and we call TY the subspace topology for Y . Example 1.29. Let X = {a, b, c, d}, TX = {, {a}, {a, b}, {a, c}, {a, b, c}, {a, b, c, d}}, and Y = {a, b, d}. Give Y the subspace topology. Let us consider the open sets in Y . Taking each set in turn, we get {a, b, d} = {a} {a, b, d} = {a} {a, b} {a, b, d} = {a, b} {a, c} {a, b, d} = {a} {a, b, c} {a, b, d} = {a, b} {a, b, c, d} {a, b, d} = {a, b, d}

Removing the duplicates, we get that TY = {{a} , {a, b} , {a, b, d}}. We take a moment to note that {a} is open in both sets, {a, b, d} is only open in Y , and {a, b, c} is only open in X .

Example 1.30. Let X = E2 and Y = {(x, y )|0 x < 1, 0 y < 1}. Give Y the subspace topology. Since there are innitely many of them, we will not list all of the open sets for each topology in this example. Instead, we note that {(x, y )|0 x < 1, 0 y < 1} is open in Y but not in X , and that R2 is not open in Y , but is in X . However, {(x, y )|0 < x < 1, 0 < y < 1} is open in both spaces. Theorem 1.31. If A is an open set in a topological space {X, TX }, then the subspace topology on A is TA = {O TX : O A} Proof. Let A, X , TX and TA be dened as above. Now consider the subspace topology on A. Let O TX . We know that O A TX by property 3. Therefore, we know that O A is an open subset of A. Therefore, we know that {open subsets of A under the subspace topology} TA . Now let Oa TX such that Oa A. We know that Oa A = Oa , so Oa TA . This completes the proof.

Problem: 1.1 Prove or disprove the following satisfy the denition of topology on the set X . a X = Q, T =
m n |m

N |n N

b X = R, T = {{(cos(), sin())|a < < b} |a, b R} c X = {Continuous functions from [0, 1] to [0, 1]}, T = {A P (X )| and f, g Ax [0, 1]s.t. f (x) = g (x)} d X = R, T = {[a, b], a < b} Problem: 1.2 Prove or disprove the following are basis for topological spaces on the set X . a X = R, B = P (Q) b X = Q, B = {{xi |i n} n N} (this question implies the rationals are countable.) c X = R, B = {A|
A

= 15} (ignoring potential convergence issues.)

10