is connected when it admits no partition into two nonempty open subsets — equivalently, when its only subsets both open and closed are and . is path-connected when any two points are joined by a continuous map .
Examples
Example 4.28
is not connected: is continuous (a polynomial in the entries) onto , which is not connected; the preimages of and split . (Each piece is in fact path-connected — a pleasant exercise beyond our needs.) By contrast is path-connected: Exercise 4.10.
Example 4.29 (A fixed point from connectedness alone)
Every continuous has a fixed point — no contraction hypothesis, no iteration. Consider , continuous on the connected :
and the intermediate value theorem (Theorem 4.27 (2)) delivers a zero of , i.e. a fixed point of . Contrast with Banach (Theorem 4.12): here existence is topological and free, but uniqueness and the algorithm are lost — has every point fixed, and iteration of a non-contracting may cycle forever. The two fixed point theorems of this chapter answer different questions with different currencies.
Example 4.30 ( and are not homeomorphic)
Connectedness is a topological fingerprint. Suppose were a homeomorphism (a continuous bijection with continuous inverse). Remove one point : the restriction is still a homeomorphism. But minus a point is path-connected — join any two points by a segment, detouring along a second segment through an auxiliary point if blocks the direct one — hence connected (Theorem 4.27 (3)); while minus a point splits into two nonempty open half-lines: not connected. Connectedness is preserved by continuous maps: contradiction. The plane and the line are genuinely different as topological spaces — a fact that cardinality alone (Exercise 1.3-style bijections do exist!) is too coarse to see.