Chapter V Connected Spaces

1. Introduction
In this chapter we introduce the idea of connectedness. Connectedness is a topological property quite different from any property we considered in Chapters 1-4. A connected space \ need not have any of the other topological properties we have discussed so far. Conversely, the only topological properties that imply \ is connected are very extreme such as l\l 1 or \ has the trivial topology.

2. Connectedness
Intuitively, a space is connected if it is all in one piece; equivalently a space is disconnected if it can be written as the union of two nonempty separated pieces. To make this precise, we need to decide what separated should mean. For example, we think of as connected even though can be written as the union of two disjoint pieces: for example, E F where E ! and F ! . Evidently, separated should mean something more than disjoint. On the other hand, if we remove the point ! to cut , then we probably think of the remaining space \ ! as disconnected. Here, we can write \ E F , where E ( ! and F ! . E and F are disjoint, nonempty sets and (unlike E and F in the preceding paragraph) they satisfy the following (equivalent) conditions: i) E and F are open in \ ii) E and F are closed in \ iii) F cl\ E E cl\ F g that is, each of E and F is disjoint from the closure of the other. (This is true, in fact, even if we use cl instead of cl\ .) Condition iii) is important enough to deserve a name. Definition 2.1 Suppose E and F are subspaces of \ g . E and F are called separated if each is disjoint from the closure of the other that is, if F cl\ E E cl\ F g. It follows immediately from the definition that i) separated sets must be disjoint, and ii) subsets of separated sets are separated: if E F are separated, G E and H F , then G and H are also separated. Example 2.2 1) In , the sets E ! and F ! are disjoint but not separated. Likewise in # , the sets E B C B# C# " and F B C B 2# C# " are disjoint but not separated

213

2) The intervals E ! and F ! are separated in but cl E cl F g The same is true for the open balls E B C B# C# " and F B C B 2# C# " in # . The condition that two sets are separated is stronger than saying they are disjoint, but weaker than saying that the sets have disjoint closures.

Theorem 2.3 In any space \ g , the following statements are equivalent: 1) 2) 3) 4) 5) g and \ are the only clopen sets in \ if E \ and Fr E g, then E g or E \ \ is not the union of two disjoint nonempty open sets \ is not the union of two disjoint nonempty closed sets \ is not the union of two nonempty separated sets.

Note: Condition 2) is not frequently used. However it is fairly expressive: to say that Fr E g says that no point B in \ can be approximated arbitrarily closely from both inside and outside E so, in that sense, E and F \ E are pieces of \ that are separated from each other. Proof 1) 2) This follows because E is clopen iff Fr E g (see Theorem II.4.5.3). 1) 3) Suppose 3) is false and that \ E F where E, F are disjoint, nonempty and open. Since \ E F is open and nonempty, we have that E is a nonempty proper clopen set in \ , which shows that 1) is false. 3) 4) This is clear. 4) 5) If 5) is false, then \ E F , where E F are nonempty and separated. Since cl F E g we conclude that cl F F , so F is closed. Similarly, E must be closed. Therefore 4) is false. 5) 1) Suppose 1) is false and that E is a nonempty proper clopen subset of \ . Then F \ E is nonempty and clopen, so E and F are separated. Since \ E F , 5) is false. Definition 2.4 A space \ g is connected if any (therefore all) of the conditions 1) - 5) in Theorem 2.3 hold. If G \ , we say that G is connected if G is connected in the subspace topology. According to the definition, a subspace G \ is disconnected if we can write G E F , where the following (equivalent) statements are true: 1) E and F are disjoint, nonempty and open in G 2) E and F are disjoint, nonempty and closed in G 3) E and F are nonempty and separated in G . If G is disconnected, such a pair of sets E F will be called a disconnection or separation of G .

The following technical theorem and its corollary are very useful in working with connectedness in subspaces.

214

Theorem 2.5 Suppose E F G \ Then E and F are separated in G iff E and F are separated in \ . Proof clG F G cl\ F (see Theorem III.7.6), so E clG F g iff E cl \ F G g iff E G cl \ F g iff E cl \ F g Similarly, F clG E g iff F cl\ E g Caution: According to Theorem 2.5, G is disconnected iff G E F where E and F are nonempty separated set in G iff G E F where E and F are nonempty separated set in \ . Theorem 2.5 is very useful because it means that we don't have to distinguish here between separated in G and separated in \ because these are equivalent. In contrast, when we say that G is disconnected if G is the union of two disjoint, nonempty open (or closed) sets E F in G , then phrase in G cannot be omitted: the sets E, F might not be open (or closed) in \ . " For example, suppose \ ! " and G ! " The sets E ! " # # ". # and " F # " are open, closed and separated in G . By Theorem 2.5, they are also separated in but they are neither open nor closed in .

Example 2.6 1) Clearly, connectedness is a topological property. More generally, suppose 0 \ ] is continuous and onto. If F is proper nonempty clopen set in ] , then 0 " F is a proper nonempty clopen set in \ . Therefore a continuous image of a connected space is connected. 2) A discrete space \ is connected iff l\l ". In particular, and are not connected. 3) is not connected since we can write as the union of two nonempty separated sets: ; ; # # ; ; # #. Similarly, we can show is not connected. More generally suppose G and that G is not an interval. Then there are points + D , where + , G but D G Then B G B D B G B D is a nonempty proper clopen set in G . Therefore G is not connected. In fact, a subset G of is connected iff G is an interval. It is not very hard, using the least upper bound property of , to prove that every interval in is connected. (Try it as an exercise! ) We will give a short proof soon (Corollary 2.12) using a different argument. 4) (The Intermediate Value Theorem) If \ is connected and 0 \ is continuous, then ran 0 is connected (by part 1) so ran0 is an interval (by part 3). Therefore if + , \ and 0 + D 0 ,, there must be a point - \ for which 0 - D 5) The Cantor set G is not connected (since it is not an interval). But much more is true. Suppose B C E G and that B C Since G is nowhere dense (see IV.10), the interval B C G , so we can choose D G with B D C. Then F D E D E is clopen in E, and F contains B but not C so E is not connected. It follows that every connected subset of G contains at most one point. A space \ g is called totally disconnected every connected subset E satisfies lEl " The spaces and are other examples of totally disconnected spaces.

6) \ is connected iff every continuous 0 \ ! " is constant: certainly, if 0 is continuous and not constant, then 0 " ! is a proper nonempty clopen set in \ so \ is not

215

connected. Conversely, if \ is not connected and E is a proper nonempty clopen set, then the characteristic function ;E \ ! " is continuous but not constant. Theorem 2.7 Suppose 0 \ ] . Let > B C \ ] C 0 B the graph of 0 If 0 is continuous, then graph of 0 is homeomorphic to the domain of 0 ; in particular, the graph of a continuous function is connected iff its domain is connected. Proof We want to show that \ is homeomorphic to >. Let 2 \ > be defined by 2B B 0 B Clearly 2 is a one-to-one map from \ onto >. Let + \ and suppose Y Z > is a basic open set containing 2+ + 0 + Since 0 is continuous and 0 + Z there exists an open set S in \ containing + and such that 0 S Z Then + Y S, and 2Y S Y Z >, so 2 is continuous at +. If Y is open in \ , then 2Y Y ] > is open in >, so 2 is open. Therefore 2 is a homeomorphism. Note: It is not true that a function 0 with a connected graph must be continuous. See Example 2.22.

The following lemma makes a simple but very useful observation. Lemma 2.8 Suppose Q R are separated subsets of \ . If G Q R and G is connected, then G Q or G R . Proof G Q and G R are separated (since G Q Q and G R R ) and G G Q G R . But G is connected so G Q and G R cannot form a disconnection of G . Therefore either G Q g (so G R or G R g (so G Q ).

The next theorem and its corollaries are simple but powerful tools for proving that certain sets are connected. Roughly, the theorem states that if we have one central connected set G and other connected sets none of which is separated from G , then the union of all the sets is connected. Theorem 2.9 Suppose G and G ( M ) are connected subsets of \ and that for each , G and G are not separated. Then W G G is connected. Proof Suppose that W Q R where Q and R are separated. By Lemma 2.8, either G Q or G R . Without loss of generality, assume G Q . By the same reasoning we conclude that for each , either G Q or G R But if some G R , then G and G would be separated. Hence every G Q . Therefore R g and the pair Q R is not a disconnection of W.

Corollary 2.10 Suppose that for each M , C is a connected subset of \ and that for all " M , C G" g. Then C M is connected.

216

Proof If M g then C M g is connected. If M g, pick an ! M and let G! be the central set G in Theorem 2.9. For all M , G G! g, so G and G! are not separated. By Theorem 2.9, C M is connected. Corollary 2.11 For each 8 , suppose G8 is a connected subset of \ and that G8 Gn" g. Then 8" G8 is connected.

Proof Let E8 8 5" G5 . Corollary 2.10 (and simple induction) shows that the E8 's are connected. Then g E" E# E8 Another application of Corollary 2.10 gives that 8" E8 8" G8 is connected. Corollary 2.12 Let M Then M is connected iff M is an interval. In particular, is connected, so and g are the only clopen sets in . Proof We have already shown that if M is not an interval, then M is not connected (Example 2.6.3). So suppose M is an interval. If M g or M <, then M is connected. Suppose M ! " and that E F are nonempty disjoint closed sets in M . Then there are points +! E and ,! F for which l+! ,! l .+! ,! .E F To see this, define 0 E F ! " by 0 B C lB Cl E F is a closed bounded set in # so E F is compact. Therefore 0 has a minimum value, occurring at some point +! ,! E F see Exercise IV.E23.)
,! ,! ! ". Since lD ,! l l +! ,! l l +! l+! ,! l, we # # l conclude D E. Similarly, D F . Therefore ! " E F , so ! "] is connected.

Let D

+! ,! #

Suppose + , The interval + , is homeomorphic to ! ", so each interval + , is " " connected. Since + , 8" + 8 , 8 , Corollary 2.10 implies that + , is connected. Similarly, Corollary 2.10 shows that each of the following unions is connected:
" 81 [+ , 8 + , 81 [+ " , + , 8 [ + + 8 + 8" + + 8 + 8" 81 [+ 8 + + 81 [+ 8 + + 81 [ 8 8

Corollary 2.13 For every 8 , 8 is connected Proof By Corollary 2.12, " is connected. 8 can be written as a union of straight lines (each homeomorphic to ) through the origin and Corollary 2.10 implies that 8 is connected.

217

Corollary 2.14 Suppose that for all B C \ there exists a connected set CBC \ with B C GBC . Then \ is connected. Proof Certainly \ g is connected. If \ g, choose + \ By hypothesis there is, for each C \ , a connected set G+C containing both + and C. By Corollary 2.10, \ G+C C \ is connected. Example 2.15 Suppose G is a countable subset of 8 , where 8 # Then 8 G is connected. In particular, 8 8 is connected. To see this, suppose B C are any two points in 8 G . Choose a straight line P which is perpendicular to the line segment BC joining B and C. For each : P let G: be the union of the two line segments B: :C. G: is the union of two intervals with a point in common, so G: is connected.

If :w :, then G:w G: B C. So if D G , then D is in at most one G: . Therefore (since G is countable), there is a : P for which G: G g. Then B C G: 8 G So Corollary 2.14 (with GBC G: shows that 8 G is connected. The definition of connectedness agrees with our intuition in the sense that every set that you think (intuitively) should be connected is actually connected according to Definition 2.4. But according to Definition 2.4, certain strange sets also turn out unexpectedly to be connected. 8 8 might fall into that category. So the official definition forces us to try to expand our intuition about what connected means. Question: Is 8 8 connected? This situation is analogous to what happens with the %-$ definition of continuity. Using that definition it turns out that every function that you expect (intuitively) should be continuous actually is continuous. If you have a problem with the official definition of continuity, it would be that it almost seems too generous it allows some unexpected functions also to be

218

continuous. An example is the well-known function from elementary analysis: where " if B : ; in lowest terms 0 B ; ! if B is irrational 0 is continuous at B iff B is irrational.

0 ,

Definition 2.16 Suppose \ is connected. If \ : is not connected, then : is called a cut point in \ If 0 \ ] is a homeomorphism, then it is easy to check that : is a cut point in \ iff 0 : is a cut point in ] Therefore homeomorphic spaces have the same number of cut points. Example 2.17 8 is not homeomorphic to if 8 2 Proof Every point : is a cut point. But Example 2.15 shows that 8 has no cut points when 8 2 It is also true but much harder to prove that 7 and 8 are not homeomorphic whenever 7 8. One way to prove this is to develop theorems about a topological property called dimension. Then it turns out (thankfully) that dim 7 7 8 dim 8 so these spaces are not homeomorphic. One can also prove this result using homology theory a topic developed in algebraic topology. Example 2.18 How is W " topologically different from ! "? Both are compact connected metric spaces with cardinality - , and there is no topological property from Chapters 1-4 that can distinguish between these spaces. The difference has to do with connectivity. The interval ! " has cut points : (if : is not an endpoint, then : is a cut point) but W " has no cut points since W " : is homeomorphic to ! " for every : W " Corollary 2.19 Suppose \ g and ] g w are nonempty topological spaces. Then \ ] is connected iff \ and ] are connected. (It follows by induction that the same result holds for any finite product of spaces. When infinite products are defined in Chapter 6, it will turn out that the product of any collection of connected spaces is connected.) Proof Suppose \ ] is connected. Since \ ] g, we have \ 1\ \ ] . Therefore \ is the continuous image of a connected space, so \ is connected. Similarly, ] is connected. Let \ and ] be nonempty connected spaces, and consider any two points + , and - . in \ ] Then \ , and - ] are homeomorphic to \ and ] , so these slices of the product are connected and both contain the point - ,. By Corollary 2.10, G \ , - ] is a connected set that contains both + , and - .. By Corollary 2.14, we conclude that \ ] is connected. (Corollary 2.19 gives an another reason why 8 is connected for 8 ".

219

Corollary 2.20 Suppose G is a connected subset of \ . If G E cl G , then E is connected. In particular, the closure of a connected set is connected. Proof For each + E + and E G + + E is connected. G are not separated. By Theorem 2.9,

Example 2.21 By Corollary 2.20, the completion of a connected pseudometric space \ . must be connected. sin 1 !B" " B . Then 0 8 ! for every 8 and the graph ! B! oscillates more and more rapidly between " and " as B ! Part of the graph is pictured below. Of course, 0 is not continuous at B ! Let > be the graph of the restricted function 1 0 l! " Since 1 is continuous, Theorem 2.7 shows that > is homeomorphic to ! " so > is connected. Example 2.22 Let 0 B

> is sometimes called the topologist's sine curve. Because cl > > ! " ", Corollary 2.20 gives that > E is connected for any set E ! " " In particular, >0 > ! ! the graph of 0 is connected. Therefore, a function 0 with a connected graph need not be continuous. However, it is true that if the graph of a function 0 is a closed connected subset of # , then 0 is continuous. (The proof is easy enough to read: see C.E. Burgess, Continuous Functions and Connected Graphs, The American Mathematical Monthly, April 1990, 337-339.)

3. Path Connectedness and Local Path Connectedness

220

In some spaces \ , every pair of points can be joined by a path in \ . This seems like a very intuitive way to describe connectedness. However, this property is actually stronger than our definition for a connected space. . Definition 3.1 A path in \ is a continuous map 0 ! " \ The path starts at its initial point 0 ! and ends at its terminal point 0 " We say 0 is a path from 0 ! to 0 "

Sometimes it helps to visualize a path by thinking of a point moving in \ from 0 ! to 0 " with 0 > representing its position at time > ! ". Remember, however, that the path, by definition, is the function 0 , not the set ran0 \ . To illustrate the distinction: suppose 0 is a path from B to C. Then the function 1 ! " \ defined by 1> 0 " > is a different path (running in the opposite direction, from C to B), even though ran0 ran1

Definition 3.2 A topological space \ is called path connected if, for every pair of points B C \ , there is a path from B to C in \ . Note: \ is called arcwise connected if, for every pair of points B C \ , there exists a homeomorphism 0 ! " \ with 0 ! B and 0 " C. Such a path 0 is called an arc from B to C. If a path 0 in a Hausdorff space \ is not an arc, the reason must be that 0 is not one-to-one (why?). It can be proven that a Hausdorff space is path connected iff \ is arcwise connected. Therefore some books use arcwise connected to mean the same thing as path connected. Theorem 3.3 A path connected space \ is connected. Proof g is connected, so assume \ g and choose a point + \ . For each B \ , there is a path 0B from + to B. Let GB ran0B . Each GB is connected and contains +. By Corollary 2.10, \ GB B \ is connected.

221

Sometimes path connectedness and connectedness are equivalent. For example, a subset M is connected iff M is an interval iff M is path connected. But in general, the converse to Theorem 3.,3 is false as the next example shows. sin 1 !B" B . In Example 2.22, we showed that the ! B! graph >0 is connected. However, we claim that there is no path in >0 from ! ! to " ! and therefore >0 is not path connected. Example 3.4 Suppose, on the contrary, that 2 ! " >0 is a path from ! ! to " ! For > ! ", write 2> 2" > 2# > >0 . 2" and 2# are continuous (why? ). Since ! " is compact, 2 is uniformly continuous (Theorem IV.9.6) so we can choose $" ! for which l? @l $" .2? 2@ " l2# ? 2# @l " We have ! 2" ! !. Let > sup 2" ! ! Then ! > ". Since 2" ! ! is a closed set, > 2" ! ! so 2> ! ! (We can think of t as the last time that the path 2 goes through the origin). Choose a positive $ $" so that ! > > $ ". Since 2" > ! and 2" > $ !, we can choose a positive integer R for which ! 2" >
# R "

Consider 0 B

# R

2" > $
# R "

By the Intermediate Value Theorem, there exist points ? @ > > $ where 2" ?

"1 # 1 and 2" @ R . Then 2# ? sin R and 2# @ sin R # # , so l2# ? 2# @l ". But this is impossible since l? @l $ $" and therefore l2# ? 2# @l "

Note: Let > be the graph of the restriction 1 0 l! ". For any set E ! " ", a similar argument shows that > E is not path connected. In particular, cl > > ! " " is not path connected. But > is homeomorphic to ! ", so > is path connected. So the closure of a path connected space need not be path connected. Definition 3.5 A space \ g is called a) locally connected if for each point B \ and for each neighborhood R of B, there is a connected open set Y such that B Y R . b) locally path connected if for each point B \ and for each neighborhood R of B, there is a path connected open set Y such that B Y R . Note: to say Y is path connected means that any two points in U can be joined by a path in U. Roughly, locally path connected means that nearby points can be joined by short paths. Example 3.6 1) 8 is connected, locally connected, path connected and locally path connected. 2) A locally path connected space is locally connected.

222

3) Connectedness and path connected are global properties of a space \ : they are statements about \ as a whole. Local connectedness and local path connectedness are statement about what happens locally (in arbitrarily small neighborhoods of points) in \ In general, global properties do not imply local properties, nor vice-versa. a) Let \ ! " " #. \ is not connected (and therefore not path connected) but \ is locally path connected (and therefore locally connected). The same relations hold in a discrete space \ with more than one point. b) Let \ be the subset of # pictured below. Note that \ contains the topologist's sine curve as a subspace you need to imagine it continuing to oscillate faster and faster as it approaches the vertical line segment in the picture:

The \ is path connected (therefore connected, but \ is not locally connected: if : ! ! there is no open connected set containing : inside the neighborhood R F " : \ . Therefore \ is also not locally path connected.
#

Notice that Examples a) and b) also show that neither (path) connected nor locally (path) connected implies the other.

Lemma 3.7 Suppose that 0 is a path in \ from + to , and 1 is a path from , to - . Then there exists a path 2 in \ from + to - . Proof 0 ends where 1 begins, so we feel intuitively that we can join the two paths end-toend to get a path 2 from + to - . The only technical detail to handle is that, by definition, a path 2 must be a function with domain ! ". To get 2 we simply join and reparametrize:

223

Define 2 ! " \ by 2>

0 #> !> " # . (You can imagine a point moving 1#> " " > " # twice as fast as before: first along the path 0 and then continuing along the path 1.) The function 2 is continuous by the Pasting Lemma (see Exercise III.E22 ). Theorem 3.8 If \ is connected and locally path connected, then \ is path connected. Proof If \ g, then \ is path connected. So assume \ g. For + \ , let G B \ there exists a path in \ from + to B. Then G g since + G (why?). We want to show that G \ Suppose B G . Let 0 be a path in \ from + to B. Choose a path connected open set Y containing B. For any point C Y , there is a path 1 in Y from B to C. By Lemma 3.7, there is a path 2 in \ from + to C, so C G Therefore B Y G so G is open. Suppose B G and choose a path connected open set Y containing B. If C Y , there is a path 1 in Y from C to B. Therefore there cannot exist a path in \ from + to C or else, by Lemma 3.7, there would be a path 2 from + to B and B would be in G . Therefore C G , so B Y \ G , so G is closed and therefore clopen. \ is connected and G is a nonempty clopen set, so G \ . Therefore \ is path connected. Here is another situation (particularly useful in complex analysis) where connectedness and path connected coincide: Corollary 3.9 An open connected set S in 8 is path connected.

Proof Suppose B S. If R is any neighborhood of B in S , then B intS R Y S . Since S is open in 8 , and Y is open in S, Y is also open in 8 Therefore there is an % ! such that F% B Y R Since F% B is an ordinary ball in 8 F% B is path connected (Of course,

224

this might not be true for a ball in an arbitrary metric space.) We conclude that S is locally path connected so, by Theorem 3.8, S is path connected.

4. Components
Informally, the components of a space \ are its largest connected subspaces. A connected space \ has exactly one component \ itself. In a totally disconnected space, for example , the components are the singletons B In very simple examples, the components look like just what you imagine. In more complicated situations, some mild surprises can occur. Definition 4.1 A component G of a space \ is a maximal connected subspace. (Here, maximal connected means: G is connected and if G H \ where H is connected, , then G H)

For any : \ , let G: E : E \ and E is connected Then : G: ; since G: is a union of connected sets each containing :, G: is connected (Corollary 2.10). If G: H and H is connected, then H was one of the sets E in the collection whose union defines G: so H G: and therefore G: H Therefore G: is a component of \ that contains :, so can be written as the union of components: \ :\ G: . Of course it can happen that G: G; when : ; for example, in a connected space \ , G: \ for every : \ But if G: G; , then G: G; g if B G: G; , then G: G; would be a connected set strictly larger than G: . The preceding paragraphs show that the distinct components of \ form a partition of \ a pairwise disjoint collection whose union is \ . If we define : ; to mean that : and ; are in the same component of \ , then it is easy to see that is an equivalence relation on \ and that G: is the equivalence class of :. Theorem 4.2 \ is the union of its components. Distinct components of \ are disjoint and each component is a closed connected set. Proof In light of the preceding comments, we only need to show that each component G: is closed. But this is clear: G: cl G: and cl G: is connected (Corollary 2.20). By maximality, we conclude that G cl G:

It should be clear that a homeomorphism maps components to components. homeomorphic spaces have the same number of components. Example 4.3

Therefore

1) Let \ " # $ % & ' \ has three components: " #, $ %, and & '. For each ! : ", we have G: ! " If G is a component in a space \ that has only finitely many components, then \ G is the union of the other finitely many (closed) components. Therefore G is clopen.

225

However, a space can have infinitely many components and in general they need not be " open. For example, if \ ! 8 8 , then the components are the singleton sets B (why?). The component ! is not open in \ . $ 2) In # , \ # 8" B"% 8 ! is not homeomorphic to ] 8" B"% 8 ! because \ has two components but ] has three. 3) If G \ and G is nonempty connected and clopen, then G is a component of \ : for if g G H \ , then G is clopen in H so if H is connected, then G H 4) The sets \ and ] in # pictured below are not homeomorphic since \ contains a cut point : for which \ : has three components. ] contains no such cut point.

Example 4.4 The following examples are meant to help fine-tune your intuition about components by pointing out some false assumptions that you need to avoid. (Take a look back at Definition 2.4 to be sure you understand what is meant by a disconnection.)
" 1) Let \ ! 8 8 One of the components of \ is !}, but ! " is not clopen in \ . Therefore the sets E ! and F 8 8 do not form a disconnection of \ . A component and its complement may not form a disconnection of \

2) If a space \ is the union of disjoint closed connected sets, these sets need not be components. For example, ! " <!" < .

226

3) If B and C are in different components of \ , then there might not exist a disconnection # E F of \ for which B E and C F For example, consider \ P" P# 8" V8 , where: P" and P# are the straight lines with equations C # and C #
" For each 8 V8 is the rectangle B C lBl 8 and lCl # 8 (The top and bottom edges of the V8 's approach the lines P" and P# ) The first four V8 's are pictured:

Each V8 is connected and clopen in \ . Therefore each V8 is a component of \ . (See Example 4.3.3.) The other components of \ are P" and P# . For example: P" is connected. Let G be the component that contains P" . G must be disjoint from each component V8 , so if P" G , then the additional points in G are from P# that is, G P" H where H P# But in that case, P" would be a nontrivial clopen set in G and G would not be connected. Therefore P" G Suppose that E and F are disjoint clopen sets in \ for which \ E F E and F are separated so, by Lemma 2.8, P# is either a subset of E or a subset of F : without loss of generality, assume that P# E and let : P# Since E is open, : has a neighborhood R E But R intersects infinitely many connected V8 's, each of which, therefore, must also be a subset of E. Since the top edges of these V8 's approach P" , there are points on P" in cl E E Therefore P" intersects E, so P" E So P" P# E In particular: ! # P" and ! # P# are in different components of \ , but both are in the same piece E of a disconnection. Conversely, however: suppose E F is a disconnection of some space ] , with B E and C F . Then B and C must be in different components of ] . (Why?)

227

4) Suppose \ is a connected space with a cut point @. Let G be a component of \ @. (Draw a few simple pictures before reading on.) It can happen that @ cl\ G (Would you have guessed that @ must be in cl\ G ?) For example, consider the following subspace \ G F of # where G is the interval " # " on the B-axis and F ! ! 8" G8 is a broom made up of disjoint straws G8 (each a copy of ! " ) extending out from the origin and arranged so that slopeG8 !

The broom F is connected (because it's path connected), so cl\ F \ is connected. Let @ ! !. Each straw G8 is connected and clopen in \ @. Therefore each G8 is a component of \ @ and the remaining connected subset, G is the remaining component of \ @ So @ is a cut point of \ and @ cl\ G . Note: for this example, @ cl\ G , but @ is in the closure of the each of the other components G8 of \ @ There is a much more complicated example, due to Knaster and Kuratowski (Fundamenta Mathematicae, v. 2, 1921). There, \ is a connected set in # with a cut point @ such that \ @ is totally disconnected. Intuitively, all the singleton sets B are tied together at the point @ to create the connected space \ ; removing @ causes \ to explode into one-element fragments. In contrast to the broom space, all components in \ @ are singletons, so @ is not in the closure (in \ ) of any of them.

228

Here is a description of the Knaster-Kuratowski space \ (sometimes called Cantor's teepee). The proof that is has the properties mentioned is omitted. (You can find it on p. 145 of the book Counterexamples in Topology (Steen & Seebach). Define G the Cantor set ( ! " on the B-axis in # , and let @ " # ". H {: G : is the endpoint of one of the deleted middle thirds in the construction of G : G : !+" +# +$ +8 base three , where the +8 's are eventually equal to ! or eventually equal to #} Of course, H is countable. I G H ( the points in G that are not isolated on either side in G ) Then G H I H I g and both H and I are dense in G . For each : G , let @: the line segment from @ to : and define a subset of @: by G: B C @: C is irrational B C @: C is rational if : H if : I

Cantor's teepee is the space \ :G G: . One can show that \ is connected and that \ @ is totally disconnected.

5. Sierpinski's Theorem
Let g be the cofinite topology on . Clearly, g is connected. But is it path connected? (Try to prove or disprove it.) This innocent sounding question turns out to be harder than you might expect. If 0 ! " g is a path from (say) " to # in g . Then ran0 is a connected set containing at least two points. But every finite subspace of g is discrete, so ran0 must be " infinite. Therefore ! " 8, where infinitely many of the sets 0 " 8 are nonempty. 8" 0 Is this possible? The question is not particularly easy. In fact, the question of whether g is path connected is equivalent to the question of whether ! " can be written as a countable union of pairwise disjoint nonempty closed sets. The answer lies in a famous old theorem of Sierpinski which states that a compact connected Hausdorff space \ cannot be written as a countable union of two or more nonempty pairwise disjoint closed sets. (Of course, countable includes finite. But thefinite union case is trivial: \ is not a union of 8 nonempty disjoint closed sets 8 # since each set would be clopen an impossibility since \ is connected.) We will prove Sierpinski's result after a series of several lemmas. The line of argument used is due to R. Engelking. (It is possible to prove Sierpinski's theorem just for the special case \ ! ". That proof is a little easier but still nontrivial.)

229

Lemma 5.1 If E and F are disjoint closed sets in a compact Hausdorff space \ , then there exist disjoint open sets Y and Z with E Y and F Z Proof Consider first the case where E B, a singleton set. For each C F , choose disjoint open sets YC and ZC with B YC and C ZC . The open sets ZC cover the compact set F so a finite number of them cover F , say F ZC" ZC8 Z . Let Y YC" YC8 . Then E Y F Z and Y , Z are disjoint open sets. Suppose now that E and F are any pair of disjoint closed sets in \ . For each B E pick disjoint open sets YB and ZB such that B YB and F ZB . The open YB 's cover the compact set E, so a finite number of them cover E, say E YB" YB8 Y Let Z ZB" ZB8 . Then E Y F Z and Y Z are disjoint open sets. Note: If E and F were both finite, an argument analogous to the proof given above would work in any Hausdorff space \ . The proof of Lemma 5.1 illustrates the rule of thumb that compact sets act like finite sets. Lemma 5.2 Suppose S is an open set in the compact space \ g . If Y J M is a family of closed sets in \ for which Y S, then there exist " 8 M such that J" J# J8 S Proof For each C \ S, there is an such that C J . Therefore \ J M is an open cover of the compact set \ S. There exist " 8 M such that \ J" \ J2 \ J8 \ S. Taking complements gives that J" J# J8 S Definition 5.3 Suppose : \ . The set U: G \ : G and G is clopen in \ is called the quasicomponent of \ containing :. U: is always a closed set in \ . The next two lemmas give some relationships between the component G: containing : and the quasicomponent U:

Lemma 5.4 If : \ , then G: U: Proof If G is any clopen set containing :, then G: G for otherwise G: G and G: \ G disconnect G: . Therefore G: G : G and G is clopen U: .

230

Example 5.5 An example where G: U: In # , let P8 be the horizontal line segment " ! " 8 and define \ 8" P8 ! ! " !.

The components of \ are the sets P8 and the singleton sets ! ! and " ! If G is any clopen set in \ containing ! !, then G intersects infinitely many P8 's so (since the P8 's are connected) G contains those P8 's. Hence the closed set G contains points arbitrarily close to " ! so " ! is also in G . Therefore ! ! and " ! are both in U!! , so G!! U!! . (In fact, it is easy to check that U!! ! ! " !)

Lemma 5.6 If \ is a compact Hausdorff space and : \ , then G: U: . Proof G: is a maximal connected set and G: U: ; therefore G: U: if we can prove that U: is connected. Suppose U: E F, where E F are disjoint closed sets in U: . We can assume that : E. We will show that F g in other words, that there is no disconnection of U: . U: is closed in \ , so E and F are also closed in \ . By Lemma 5.1, we can choose disjoint open sets Y and Z in \ with : E Y and F Z . Then U: E F Y Z Since \ is compact and U: is an intersection of clopen sets in \ , Lemma 5.2 lets us pick finitely many clopen sets G" G8 such that U: G" G8 Y Z . Let G G" G8 . G is clopen in \ and U: G Y Z . Y G is open in \ and, in fact, Y G is also closed in \ : since cl Y \ Z we have that Y G cl Y G cl Y cl G cl Y G Therefore Y G is one of the clopen sets containing : whose intersection defines U: , so U: Y G Y . Therefore U: F g so F g

Definition 5.7 A continuum is a compact connected Hausdorff space.

231

Lemma 5.8 Suppose E is a closed subspace of a continuum \ and that g E \ . If G is a component of E, then G Fr E g. Proof Let G be a component of E and let : G Since G E cl E, we have that G Fr E G cl E cl \ E G cl \ E, so we need to show that G cl \ E g We do this by contraposition: assuming G cl \ E g, we will prove E \ .

E is compact so Lemma 5.6 gives G G: U: G E : G and G is clopen in E By assumption, G \ cl\ E, so by Lemma 5.2 there exist indices " , # ,..., 8 for which G G! G" G# G8 \ cl\ E. Since G! cl \ E g, we have G! Fr E g. G! is clopen in E and G! E Fr E int E Since G! is open in int E which is open in \ , G! is open in \ . But G! is also closed in the closed set E, so G! is closed in \ . Since \ is connected, we conclude that E \ . Lemma 5.9 Suppose \ is a continuum and that \ J8 8 where the J8 's are pairwise disjoint closed sets and J8 g for at least two values of 8. Then for each 8 there exists a continuum G8 \ such that G8 J8 g and G8 J3 g for at least two 3

Before proving Lemma 5.9, consider the formal statement of Sierpinski's Theorem.. Theorem 5.10 (Sierpinski) Let \ be a continuum. If \ J8 8 where the J8 's are pairwise disjoint closed sets, then at most one J8 is nonempty. (Of course, the statement of the theorem includes the easy finite union case.) In proving Sierpinski's theorem we will assume that \ J8 8 where the J8 's are pairwise disjoint closed sets and J8 g for at least two values of 8. Then we will apply Lemma 5.9 to arrive at a contradiction. When all the smoke clears we see that, in fact, there are no continua which satisfy the hypotheses of Lemma 5.9. Lemma 5.9 is really the first part of the proof (by contradiction) of Sierpinski's theorem set off as a preliminary lemma to break the argument into more manageable pieces.

Proof of Lemma 5.9 If J8 g, let G8 \ Assume J8 g. Choose 7 8 with J7 g and pick a point : J7 By Lemma 5.1, we can choose disjoint open sets Y Z in \ with J8 Y and : J7 Z . Let G8 be the component of : in cl Z Certainly G8 is a continuum, and we prove that this choice of G8 works. We have that G8 J8 g (since G8 cl Z \ Y ) and that G8 J7 g (since : G8 J7 ). Therefore, to complete proof, we need only show that for some 3 7 8 G8 J3 g Since : cl Z \ Y , we have that cl Z g; and cl Z \ because

232

g J8 Y . Therefore, by Lemma 5.8, there is a point ; G8 Fr cl Z . Since ; Fr cl Z and J7 Z intcl Z we have ; J7 . And since ; Fr cl Z cl Z \ Y , we have that ; J8 . But \ is covered by the J3 's, so ; J3 for some 3 7 8 Therefore G8 J3 g Proof of Theorem 5.10 We want to show that if \ 8" J8 where the J8 's are disjoint closed sets, then at most one J8 g. Looking for a contradiction, we suppose at least two J8 's are nonempty By Lemma 5.9, there is a continuum G" in \ with G" J" g and such that G" has nonempty intersection with a least two J8 's. We can write G" G" \ G" 8" J8 G J G J G J8 are nonempty. , where at least two of the sets " 8 " 8 " 8" 8# Applying Lemma 5.9 again (to the continuum G" ) we find a continuum G# G" such that G# G" J# G# J# g and G# intersects at least two of the sets G" J8 Then G# G# G" 8# G# G" J8 8# G# J8 8$ G# J8 , where at least two of the sets G# J8 are nonempty. We continue this process inductively, repeatedly applying Lemma 5.9, to and generate a decreasing sequence of nonempty continua G" G# G8 such that for each 8 G8 J8 g. This gives g 8" G8 8" J8 8" G8 \ 8" G8 But this is impossible: the G8 's have the finite intersection property and \ is compact, so 8" G8 g. Example 5.11 By Theorem 5.10, we know that ! " cannot be written as the union of 7 pairwise disjoint nonempty closed sets if " 7 i! . And, of course, ! " can easily be written as the union of 7 - such sets: for example, ! " B!" B. What if i! 7 - ? There are other related questions you could ask yourself. For example, can ! " be written as the union of - disjoint closed sets each of which is uncountable? The answer is yes. For example, take a continuous onto function 0 ! " ! "# (a space-filling curve, whose existence you should have seen in an advanced calculus course ). For each B ! ", let PB B ! " the vertical line segment at B in ! "# . Then the sets 0 " PB do the job. We could also ask: is it possible to write ! " as the union of uncountably many pairwise disjoint closed sets each of which is countably infinite? (See Exercise VIII.E27).

233

Exercises
E1. Suppose \ E F where E F and F E are separated. a) Prove that for any G \ , cl\ G clE E G clF F G. b) Conclude that G is closed if G E is closed in E and G F is closed in F . c) Conclude that G is open if G E is open in E and G F is open in F . d) Suppose \ E F where E F and F E are separated. Prove that if 0 \ ] and both 0 lE and 0 lF are continuous, then 0 is continuous.

E2. Prove that ! " is connected directly from the definition of connected. (Use the least upper bound property of . E3. Suppose both E F are closed subsets of \ g . Prove that E F is separated from F E . Do the same assuming instead that E and F are both open. E4. Suppose W is a connected subset of \ g Prove that if W I g and W \ I g, then W Fr I g. E5. Let \ . and ] . w be two connected metric spaces. Suppose 5 ! and that + , \ ] . Let O B C \ ] .B + 5 and . w C , 5. a) Give an example to show that the complement of O in \ ] might not be connected. b) Prove that the complement of O in \ ] is connected if \ . and ] . w are unbounded spaces.

E6. Prove that there does not exist a continuous function 0 such that 0 and 0 . Hint: One method: What do you know about ran 0 ? What else do you know? ) " Another method: if such an 0 exists, let 1 " l0 l and let 2 1l! ". What do you know about 2? E7. a) Find the cardinality of the collection of all compact connected subsets of # . b) Find the cardinality of the collection of all connected subsets of # . E8. Suppose \ . is a connected metric space with l\l ". Prove that l\l - .

E9. Suppose each point in a metric space \ . has a neighborhood base consisting of clopen sets (such a metric space is sometimes called zero-dimensional). Prove that \ . is totally disconnected.

234

E10. A metric space \ . satisfies the %-chain condition if for all % ! and all B, C \ , there exists a finite set of points B" , B# , ... , B8" , B8 where B" B B8 C, and .B3 B3" % for all 3 1, ..., 8 ". a) Give an example of a metric space which satisfies the % -chain condition but which is not connected. b) Prove that if \ . is connected, then \ . satisfies the %-chain condition. c) Prove that if \ . is compact and satisfies the %-chain condition, then \ is connected.
" d) Prove that ! " " B sin B ! B " # is connected. (Use c) to give a different proof than the one given in Example 3.4.)

e) In any space \ g , a simple chain from + to , is a finite collection of sets E" E8 such that: + E" and + E3 if 3 " , E8 and , E3 if 3 8 for all 3 " 8 " E3 E3" g E3 E4 g if l4 3l " Prove \ is connected iff for every open cover h and every pair of points + , \ there is a simple chain from + to , consisting of sets taken from h . E11. a) Prove that \ is locally connected iff the components of every open set S are also open in \. b) The path components of a space are its maximal path connected subsets. Show that \ is locally path connected iff the path components of every open set S are also open in \ . E12. Let g be the cofinite topology on . We know that g is not path connected (because of Sierpinski's Theorem applied to the closed interval ! " ). Prove that the statement g is not path connected is equivalent to Sierpinski's Theorem for the case \ ! " E13. Let 8 " and suppose 0 ! " 8 is a homeomorphism (into); then ran0 is called an arc in 8 Use a connectedness argument to prove that an arc is nowhere dense in 8 . Is the same true if ! " is replaced by the circle W " ?

235

E14. a) Prove that for any space \ and 8 # if \ has 8 components, then there are nonempty pairwise separated sets L" L8 for which \ L" L8 (**) Hints. For a given 8, do not start with the components and try to group them to form the L8 's. Start with the fact that \ is not connected. Use induction. When \ has infinitely many components, then \ has n components for every 8. b) Recall that a disconnection of \ means a pair of nonempty separated sets E F for which \ E F Remember also that if G is a component of \ , G is not necessarily one piece in a disconnection of \ (see Example 4.4). Prove that \ has only finitely many components 8 8 # iff \ has only finitely many disconnections. E15. A metric space \ . is called locally separable if, for each B \ , there is an open set Y containing B such that Y . is separable. Prove that a connected, locally separable metric space is separable.

E16. In \ g , define B C if there does not exist a disconnection \ E F with B E and C F i.e., if \ can't be split between B and C. Prove that is an equivalence relation and that the equivalence class of a point : is the quasicomponent U: (It follows that \ is the disjoint union of its quasicomponents. )

E17. For the following alphabet (capital Arial font), decide which letters are homeomorphic to each other:

ABCDEFGHIJKLMNOPQRSTUVWXYZ
E18. Suppose 0 \ B C # B ! or C ! is continuous and onto. Prove that 0 " ! ! contains at least 3 points. E19. Show how to write # E F where E and F are nonempty, disjoint, connected, dense and congruent by translation (i.e., b ? @ # such that F B ? C @ B C E .

E20. Suppose \ is connected and l\l # Show that \ can be written as E F where E and F are connected proper subsets of \ . E21. Prove or disprove: a nonempty product \ ] is totally disconnected iff both \ and ] are totally disconnected.

236

Chapter V Review
Explain why each statement is true, or provide a counterexample.

1. There exists a continuous function 0 which is onto and for which 0 2. Let g be the right ray topology on . Then ( g is path connected. 3. There exists a countably infinite compact connected metric space. 4. The letter T is homeomorphic to the letter F. 5. If E and F are connected and not separated, then E F is connected. 6. If E and F are nonempty and E F is connected, then cl E cl F g 7. If the graph of a function 0 is connected, then 0 is continuous. 8. , with the cofinite topology, is connected. 9. In a space \ g ), the component containing the point : is a subset of the intersection of all clopen sets containing a point :. 10. If E F \ g and E is clopen in E F , then \ is not connected. 11. If 0 \ g ] g w is continuous and onto and \ g is path connected, then ] g w is path connected. 12. Suppose E , E ". If E is nowhere dense, then E is not connected. 13. Let G be the Cantor set. There exists a nonempty space \ for which \ G is connected. 14. Let G be the Cantor set. Then # G # is connected. 15. If G is a component of the complete metric space \ ., then G . is complete. 16. Let S " denote the unit circle in # . S " is homeomorphic to a subspace of the Cantor set. 17. If \ is the union of an uncountable collection of disjoint nonempty, connected closed sets G , then the G 's are components of \ . 18. If \ is the union of a finite collection of disjoint nonempty connected closed sets G , then the G 's are components of \ . 19. If \ is the union of a countable collection of disjoint connected closed sets G , then the G 's are components of \ .

237

 20. If \ . is connected, then its completion (\ ,. ) is connected. 21. If E is connected and F is clopen and E F g, then E F 22. Suppose 0 8 8 is continuous, that 0 ! ! ! ! ! ! and 0 " ! ! # ! !. Let E denote the set of all fixed points of 0 . It is possible that E is open in 8 ( Note: we are not assuming f is a contraction, so f may have more than one fixed point.) 23. Suppose \ . is a connected separable metric space with \ ". Then \ = - . 24. If a subset E of contains an open interval around each of its points, then E must be connected. 25. There exists a connected metric space \ . with l\l i! . 26. If # E" A# ... A8 ... is a nested sequence of connected sets in the plane, then 8" A8 is connected. 27. is a connected set in # .
" 28. Let E B sin B B ! # and suppose 0 cl E ! " is continuous. Then 0 must be constant.

29. Suppose \ g \ is connected if and only if there are exactly two functions 0 G\ such that 0 # 0 . 30. If \ is nonempty, countable and connected, then every 0 G\ is constant. 31. Every path connected set in # is locally path connected. 32 If F is a dense connected set in , then F 33. In a metric space \ . the sets E and F are separated iff .E F ! 34. A nonempty clopen subset of a space \ must be a component of \ . 35. Suppose g and g \ g w is connected.
w

are topologies on \ and that g g w If \ g is connected, then

36. The letter X is homeomorphic to the letter Y.

238