7.3 Connectedness
A space is connected when it cannot be split into two disjoint nonempty open pieces. Connected subsets of $\mathbb{R}$ are exactly the intervals, continuous images of connected sets are connected, and counting the pieces left after removing a point tells spaces apart.
The intermediate value theorem (§3.1) says that a continuous function on an interval cannot jump over a value. Look closely at its proof and you will see that the only property of the interval being used is that it is "in one piece": it cannot be split into two parts that are each open, disjoint and nonempty. That property makes sense in every metric space, and it is called connectedness. Once it is isolated, the intermediate value theorem becomes a one-line consequence of a much more general fact — continuous maps send connected sets to connected sets — and it suddenly applies to functions on discs, spheres, matrix groups and spaces of functions.
Connectedness is also the cheapest tool for proving that two spaces are not homeomorphic: $\mathbb{R}$ falls into two pieces when a point is removed, $\mathbb{R}^2$ does not, so no continuous bijection with continuous inverse can exist between them. CSIR NET uses this material constantly — "which of the following subsets of $\mathbb{R}^2$ (or of $M_n(\mathbb{R})$) are connected?", "how many components does this set have?", "which of these spaces are homeomorphic?", and the topologist's sine curve as the standard trap separating connected from path-connected. This section develops the theory with complete proofs and then trains exactly those skills.
Connected Sets and Their Continuous Images
Throughout, $(X,d)$ is a metric space (§7.1). A subset $A\subseteq X$ is always given the restricted metric; recall that a set $W\subseteq A$ is open in $A$ (relatively open) if and only if $W=A\cap U$ for some open $U\subseteq X$, and similarly for closed sets. The closure of $P$ in $X$ is written $\overline P$; the closure of $P\subseteq A$ inside $A$ is $\overline P\cap A$.
A separation of a metric space $X$ is a pair $U,V$ of disjoint, nonempty, open subsets of $X$ with $X=U\cup V$. The space $X$ is connected if it has no separation, and disconnected otherwise.
A subset $A\subseteq X$ is connected if it is connected as a metric space with the restricted metric. Unwinding the definition of relatively open sets: $A$ is disconnected if and only if there are open sets $U,V\subseteq X$ with $$A\subseteq U\cup V,$$ $$A\cap U\ne\varnothing\ne A\cap V,$$ $$A\cap U\cap V=\varnothing.$$ The empty set and every one-point set are connected.
Notice that $U$ and $V$ themselves may intersect, outside $A$; only their traces on $A$ have to be disjoint. For example $A=\{0,1\}\subseteq\mathbb{R}$ is disconnected via $U=(-\infty,0.6)$, $V=(0.4,\infty)$.
- $X$ is connected;
- the only subsets of $X$ that are both open and closed (clopen) are $\varnothing$ and $X$;
- every continuous function $f:X\to\{0,1\}$ is constant (here $\{0,1\}$ carries the metric of $\mathbb{R}$, which is the discrete metric on two points);
- $X$ is not the union of two nonempty separated sets, i.e. sets $P,Q$ with $\overline P\cap Q=\varnothing=P\cap\overline Q$.
Proof. (1)$\Leftrightarrow$(2). If $U,V$ is a separation, then $U=X\setminus V$ is closed as well as open, and $U\ne\varnothing,X$. Conversely, if $C$ is clopen with $C\ne\varnothing,X$, then $C$ and $X\setminus C$ are disjoint, nonempty, open and cover $X$.
(2)$\Leftrightarrow$(3). Let $f:X\to\{0,1\}$ be continuous. The set $\{1\}$ is open in $\{0,1\}$ (it is the ball of radius $\tfrac12$ about $1$) and closed, so $C=f^{-1}(\{1\})$ is clopen in $X$. Under (2), $C=\varnothing$ or $C=X$, i.e. $f$ is constant. Conversely, if $C$ is clopen with $C\ne\varnothing,X$, its indicator function $\mathbf 1_C$ is continuous — the preimage of any subset of $\{0,1\}$ is one of $\varnothing$, $C$, $X\setminus C$, $X$, all open — and not constant.
(1)$\Leftrightarrow$(4). If $X=P\cup Q$ with $P,Q$ nonempty and separated, then $\overline P\subseteq X\setminus Q=P$, so $P$ is closed; likewise $Q$ is closed; hence $P=X\setminus Q$ and $Q=X\setminus P$ are also open, and $P,Q$ is a separation. Conversely, the two sets $U,V$ of a separation are complements of each other, hence closed, so $\overline U\cap V=U\cap V=\varnothing$ and similarly $U\cap\overline V=\varnothing$. For a subset $A$, apply (4) to the metric space $A$: the closure of $P$ in $A$ is $\overline P\cap A$, and since $Q\subseteq A$, the condition $(\overline P\cap A)\cap Q=\varnothing$ is the same as $\overline P\cap Q=\varnothing$. ∎
Form (3) is the one to use in proofs: to show something is connected, take an arbitrary continuous $f$ into $\{0,1\}$ and show that it is constant. Form (4) is the one to use for subsets: it lets us work with closures in the big space.
Proof. ($\Rightarrow$) Suppose $A$ is not an interval: there are $x,y\in A$ and $z\notin A$ with $x\lt z\lt y$. Then $U=(-\infty,z)$ and $V=(z,\infty)$ are open, $A\subseteq U\cup V$ (because $z\notin A$), $x\in A\cap U$, $y\in A\cap V$, and $U\cap V=\varnothing$. So $A$ is disconnected.
($\Leftarrow$) Let $I$ be an interval and $f:I\to\{0,1\}$ continuous; we show $f$ is constant. Suppose not: $f(a)=0$ and $f(b)=1$ for some $a,b\in I$. Replacing $f$ by $1-f$ if necessary we may assume $a\lt b$; then $[a,b]\subseteq I$. Let $S=\{t\in[a,b]:f(t)=0\}$; it contains $a$ and is bounded above by $b$, so $c=\sup S$ exists by the completeness axiom (§1.2), and $a\le c\le b$. Because $f$ is continuous at $c$ and takes only the values $0$ and $1$, applying the definition with $\varepsilon=\tfrac12$ gives $\delta\gt0$ such that $f$ is constant on $(c-\delta,c+\delta)\cap[a,b]$.
- If $f(c)=1$: then $c\ne a$, and by the $\varepsilon$-characterisation of the supremum there is $s\in S$ with $c-\delta\lt s\le c$. But $f(s)=0\ne f(c)$ although $s$ lies in the interval of constancy — a contradiction.
- If $f(c)=0$: then $c\ne b$ (as $f(b)=1$), and every $t\in[c,\min(c+\delta/2,b)]$ has $f(t)=0$, so $S$ contains points larger than $c$ — contradicting $c=\sup S$.
Either way we reach a contradiction, so $f$ is constant and $I$ is connected. ∎
The completeness axiom was essential: $\mathbb{Q}$ is not connected, since $U=(-\infty,\sqrt2)$, $V=(\sqrt2,\infty)$ separate it. Connectedness of $\mathbb{R}$ is, in a precise sense, the same thing as its completeness.
Proof. Let $g:f(X)\to\{0,1\}$ be continuous. Then $g\circ f:X\to\{0,1\}$ is continuous, hence constant by Theorem 7.21(3). Every point of $f(X)$ is $f(x)$ for some $x$, so $g$ takes the single value $g(f(x))$: $g$ is constant, and $f(X)$ is connected. For real-valued $f$, combine with Theorem 7.22. ∎
Two immediate consequences are used all the time. A homeomorphism (§7.1) preserves connectedness, so connectedness is a topological property. And a continuous function on a connected space whose values lie in a set containing no nondegenerate interval — $\mathbb{Z}$, $\mathbb{Q}$, $\mathbb{R}\setminus\mathbb{Q}$, the Cantor set, a finite set — must be constant.
- Unions with a common point. If $\{A_i:i\in I\}$ are connected subsets and $\bigcap_iA_i\ne\varnothing$, then $\bigcup_iA_i$ is connected. More generally, if $A_0$ is connected and every $A_i$ is connected and meets $A_0$, then $A_0\cup\bigcup_iA_i$ is connected.
- Chains. If $A_1,A_2,\dots$ are connected and $A_n\cap A_{n+1}\ne\varnothing$ for every $n$, then $\bigcup_nA_n$ is connected.
- Squeezing between a set and its closure. If $A$ is connected and $A\subseteq B\subseteq\overline A$, then $B$ is connected. In particular the closure of a connected set is connected.
- Products. If $X,Y$ are nonempty metric spaces and $X\times Y$ carries any of the usual product metrics (max, sum or Euclidean combination of $d_X$ and $d_Y$), then $X\times Y$ is connected if and only if $X$ and $Y$ are. Hence $\mathbb{R}^n$ is connected.
Proof. (1) Let $p\in\bigcap A_i$ and let $f:\bigcup A_i\to\{0,1\}$ be continuous. Its restriction to each $A_i$ is continuous, hence constant, and that constant is $f(p)$ because $p\in A_i$. So $f\equiv f(p)$. For the general form, each $A_0\cup A_i$ is connected by the first form (two connected sets with a common point), and all the sets $A_0\cup A_i$ contain the points of $A_0$; apply the first form again (if $A_0=\varnothing$ there is nothing to prove).
(2) Put $B_n=A_1\cup\cdots\cup A_n$. By induction $B_n$ is connected: $B_{n+1}=B_n\cup A_{n+1}$ and $B_n\supseteq A_n$ meets $A_{n+1}$. The sets $B_n$ all contain $A_1$, so their union is connected by (1).
(3) Let $f:B\to\{0,1\}$ be continuous; on the connected set $A$ it is constant, say $f\equiv0$ on $A$. If $b\in B\subseteq\overline A$, choose $a_n\in A$ with $a_n\to b$; continuity of $f$ at $b$ (sequential criterion) gives $f(b)=\lim f(a_n)=0$. So $f$ is constant.
(4) The coordinate projections $X\times Y\to X$ and $X\times Y\to Y$ are continuous (they do not increase distances) and onto, so if $X\times Y$ is connected so are $X$ and $Y$ (Theorem 7.23). Conversely, suppose $X,Y$ are connected and fix $y_0\in Y$. For $x\in X$ the map $y\mapsto(x,y)$ is continuous, so the "vertical fibre" $\{x\}\times Y$ is connected; likewise the "horizontal fibre" $X\times\{y_0\}$. The cross $K_x=(\{x\}\times Y)\cup(X\times\{y_0\})$ is connected by (1), the two pieces sharing the point $(x,y_0)$. Every cross contains $X\times\{y_0\}$, so $X\times Y=\bigcup_xK_x$ is connected by (1). Induction on $n$ gives $\mathbb{R}^n$. ∎
Path-Connectedness and the Topologist's Sine Curve
A more intuitive notion is "any two points can be joined by a continuous curve". It implies connectedness, it is what one usually checks in practice, and — the crucial point for the exam — it is genuinely stronger.
A path in $X$ from $p$ to $q$ is a continuous map $\gamma:[0,1]\to X$ with $\gamma(0)=p$ and $\gamma(1)=q$. The space $X$ (or a subset with the restricted metric) is path-connected if every two of its points are joined by a path in it.
A subset of $\mathbb{R}^n$ is polygonally connected if any two of its points are joined by a polygonal path — finitely many line segments $[p_0,p_1],[p_1,p_2],\dots,[p_{k-1},p_k]$, where $[p,q]=\{(1-t)p+tq:0\le t\le1\}$ — lying in the set.
Paths can be reversed ($t\mapsto\gamma(1-t)$) and concatenated (run $\gamma_1$ at double speed on $[0,\tfrac12]$, then $\gamma_2$ on $[\tfrac12,1]$; continuity at $t=\tfrac12$ holds because $\gamma_1(1)=\gamma_2(0)$). So "$p$ and $q$ can be joined by a path" is an equivalence relation, and to prove path-connectedness it suffices to join every point to one fixed point.
Proof. Fix $p\in X$ (if $X=\varnothing$ there is nothing to prove). For each $q\in X$ choose a path $\gamma_q$ from $p$ to $q$. Its image $\gamma_q([0,1])$ is connected, being a continuous image of the interval $[0,1]$ (Theorems 7.22, 7.23), and it contains $p$ and $q$. Thus $X=\bigcup_q\gamma_q([0,1])$ is a union of connected sets with the common point $p$, connected by Theorem 7.24(1). A convex set is path-connected by the segments $\gamma(t)=(1-t)p+tq$, which are continuous since $\|\gamma(t)-\gamma(s)\|=|t-s|\,\|q-p\|$; a set star-shaped about $c$ contains all segments $[c,q]$, so every point is joined to $c$. ∎
Proof. Polygonally connected $\Rightarrow$ path-connected $\Rightarrow$ connected (Theorem 7.25). Now let $U$ be open and connected, nonempty, and fix $p\in U$. Let $P$ be the set of points of $U$ that can be joined to $p$ by a polygonal path in $U$; $p\in P$.
$P$ is open. If $q\in P$, choose $r\gt0$ with $B(q,r)\subseteq U$. For $z\in B(q,r)$, the segment $[q,z]$ lies in the convex ball $B(q,r)\subseteq U$, so appending it to a polygonal path from $p$ to $q$ gives one from $p$ to $z$. Thus $B(q,r)\subseteq P$.
$U\setminus P$ is open. If $q\in U\setminus P$ and $B(q,r)\subseteq U$, then no $z\in B(q,r)$ lies in $P$: otherwise a polygonal path from $p$ to $z$ followed by $[z,q]$ would put $q$ in $P$. So $B(q,r)\subseteq U\setminus P$.
Hence $P$ is a nonempty clopen subset of the connected space $U$, and $P=U$ (Theorem 7.21(2)). ∎
- $GL_n(\mathbb{R})$ is disconnected; so is the orthogonal group $O(n)$.
- $GL_n(\mathbb{C})$ is path-connected.
- $GL_n^+(\mathbb{R})=\{A:\det A\gt0\}$ and $SO(n)=\{Q\in O(n):\det Q=1\}$ are path-connected. Hence $GL_n(\mathbb{R})$ and $O(n)$ have exactly two components each, distinguished by the sign of the determinant.
Proof. (1) $\det$ is a polynomial in the entries, hence continuous. It maps $GL_n(\mathbb{R})$ onto $\mathbb{R}\setminus\{0\}$ (consider $\mathrm{diag}(t,1,\dots,1)$) and $O(n)$ onto $\{-1,1\}$; neither image is connected, so neither domain is (Theorem 7.23).
(2) Let $A,B\in GL_n(\mathbb{C})$ and put $p(z)=\det\big((1-z)A+zB\big)$ for $z\in\mathbb{C}$. This is a polynomial in $z$ with $p(0)=\det A\ne0$, so it is not the zero polynomial and has a finite set $F$ of roots, with $0,1\notin F$. By Example 2(b), $\mathbb{C}\setminus F\cong\mathbb{R}^2\setminus F$ contains a path $\sigma$ from $0$ to $1$. Then $t\mapsto(1-\sigma(t))A+\sigma(t)B$ is a path from $A$ to $B$, and it stays in $GL_n(\mathbb{C})$ because its determinant is $p(\sigma(t))\ne0$. (Over $\mathbb{R}$ this fails exactly because a real path from $0$ to $1$ cannot avoid a root of $p$ lying in $(0,1)$.)
(3) Proof sketch. Let $\det A\gt0$. Gram–Schmidt applied to the columns of $A$ (§10.1) writes $A=QR$ with $Q$ orthogonal and $R$ upper triangular with positive diagonal; $\det Q=\det A/\det R\gt0$, so $Q\in SO(n)$. The path $R_t=(1-t)I+tR$ consists of upper triangular matrices with positive diagonal, hence invertible, and joins $I$ to $R$. For $Q\in SO(n)$, the real normal form of orthogonal matrices (§10.2) gives $Q=P\,\mathrm{diag}\big(R(\theta_1),\dots,R(\theta_k),\pm1,\dots,\pm1\big)P^{T}$ with $P$ orthogonal and $R(\theta)$ the $2\times2$ rotation by $\theta$; as $\det Q=1$ the $-1$'s come in pairs, and each pair $\mathrm{diag}(-1,-1)=R(\pi)$. Replacing every $\theta_j$ by $t\theta_j$ gives a path in $SO(n)$ from $I$ to $Q$. Multiplying the two paths, $t\mapsto Q_tR_t$ joins $I$ to $A$ in $GL_n^+(\mathbb{R})$. Finally $A\mapsto\mathrm{diag}(-1,1,\dots,1)A$ is a homeomorphism of $GL_n^+(\mathbb{R})$ onto $\{\det\lt0\}$ (and of $SO(n)$ onto $O(n)\setminus SO(n)$), so both pieces are path-connected, and they are separated by the continuous function $\operatorname{sign}\det$. ∎
Components and Totally Disconnected Sets
A disconnected space falls into pieces. The right notion of "piece" is a maximal connected subset.
- $C(x)$ is connected; it is the largest connected subset of $X$ containing $x$.
- The components form a partition of $X$, and every connected subset of $X$ lies in exactly one component.
- Every component is closed in $X$.
- Path components are path-connected, partition $X$, and each lies inside a component.
- If $U\subseteq\mathbb{R}^n$ is open, its components are open, they coincide with its path components, and there are at most countably many of them.
Proof. (1) $C(x)$ is a union of connected sets all containing $x$, so it is connected by Theorem 7.24(1); by definition it contains every connected set containing $x$. (2) $x\in\{x\}\subseteq C(x)$, so the components cover $X$. If $z\in C(x)\cap C(y)$, then $C(x)\cup C(y)$ is connected (common point $z$) and contains $x$, so it lies in $C(x)$; thus $C(y)\subseteq C(x)$ and symmetrically $C(x)=C(y)$. A connected $A$ containing some $x$ lies in $C(x)$. (3) $\overline{C(x)}$ is connected (Theorem 7.24(3)) and contains $x$, so $\overline{C(x)}\subseteq C(x)$. (4) "Joined by a path" is an equivalence relation (reversal and concatenation), whose classes are the path components; each is path-connected, hence connected, hence inside one component.
(5) Let $C$ be a component of $U$ and $x\in C$. Choose a ball $B(x,r)\subseteq U$; it is connected and meets $C$, so $B(x,r)\subseteq C$ by (2). Hence $C$ is open, and $C$ itself is an open connected subset of $\mathbb{R}^n$, so it is path-connected (Theorem 7.26) — it is a path component. Each component, being nonempty and open, contains a point of the countable set $\mathbb{Q}^n$; distinct components are disjoint, so this gives an injection of the set of components into $\mathbb{Q}^n$. ∎
Proof. By Theorem 7.28(5) the components of $G$ are open, pairwise disjoint and countably many; each is connected, hence an interval (Theorem 7.22), and an open interval because it is an open set. If $G=\bigsqcup_jI_j$ is any decomposition into disjoint open intervals, each $I_j$ is connected, so it lies in a component $C$; and $I_j$ is clopen in $C$ (its complement in $C$ is the union of the other $I_k$ meeting $C$, which is open), so $I_j=C$. ∎
This theorem is the reason that the Lebesgue measure of an open subset of $\mathbb{R}$ is simply the sum of the lengths of its component intervals (§4.4). In $\mathbb{R}^2$ nothing so simple holds: an open set is a countable union of open discs, but not of disjoint ones in general (the open square is not).
Proof. A connected subset of $A$ is an interval contained in $A$ (Theorem 7.22). If $A$ contains no nondegenerate interval, such an interval is a point or empty. Conversely, if $[a,b]\subseteq A$ with $a\lt b$, then $[a,b]$ is a connected subset with more than one point. A countable set, or a set of measure zero, cannot contain an interval $[a,b]$ (which is uncountable and has measure $b-a\gt0$). The Cantor set $\mathcal{C}$ is contained, for each $n$, in a union of $2^n$ disjoint closed intervals of length $3^{-n}$ (§4.4); an interval inside $\mathcal{C}$ is connected, so it lies in one of them, and has length at most $3^{-n}$ for every $n$ — it is a point. In a discrete space every subset is open, so any set with two points $p\ne q$ is separated by $\{p\}$ and its complement. ∎
The Cantor set is the striking example: it is compact, uncountable, has no isolated points — and yet it is totally disconnected. In the plane, $\mathbb{Q}^2$ and $(\mathbb{R}\setminus\mathbb{Q})^2$ are totally disconnected (a connected subset projects onto connected subsets of $\mathbb{Q}$, resp. $\mathbb{R}\setminus\mathbb{Q}$, in each coordinate), while $\mathbb{R}^2\setminus\mathbb{Q}^2$ is connected (Example 2).
Connectedness as an Invariant: Ruling Out Homeomorphisms
- $h$ maps each component (path component) of $X$ onto a component (path component) of $Y$; in particular $X$ and $Y$ have the same number of components, and $X$ is connected iff $Y$ is;
- for every $p\in X$, $h$ restricts to a homeomorphism $X\setminus\{p\}\to Y\setminus\{h(p)\}$; hence $X\setminus\{p\}$ and $Y\setminus\{h(p)\}$ have the same number of components;
- consequently, for each $k$, $h$ maps the cut points of order $k$ of $X$ bijectively onto those of $Y$, and the non-cut points onto the non-cut points.
Proof. (1) If $C$ is a component of $X$, then $h(C)$ is connected (Theorem 7.23), so it lies in a component $D$ of $Y$; and $h^{-1}(D)$ is connected and meets $C$, so $h^{-1}(D)\subseteq C$, i.e. $D\subseteq h(C)$. Thus $h(C)=D$, and $C\mapsto h(C)$ is a bijection between the sets of components (its inverse is $D\mapsto h^{-1}(D)$). Paths are carried to paths by $h$ and $h^{-1}$, which gives the statement for path components. (2) The restriction of $h$ to $X\setminus\{p\}$ is a continuous bijection onto $Y\setminus\{h(p)\}$ (as $h$ is injective), with inverse the restriction of $h^{-1}$, which is continuous. Apply (1). (3) follows from (2). ∎
Interactive 2 lets you compute these invariants for a gallery of shapes. Remember the direction of the logic: different invariants prove that spaces are not homeomorphic; equal invariants prove nothing.
- To prove connected, try in this order: (i) is it an interval / convex / star-shaped? (ii) is it a continuous image of something connected — a parametrised curve, the image of $\mathbb{R}^k$ under a continuous map? (iii) is it a union of connected pieces with a common point or a chain of overlapping pieces (Theorem 7.24)? (iv) is it squeezed between a connected set and its closure (sine curves, combs)? (v) for an open set in $\mathbb{R}^n$, connected = path-connected.
- To prove disconnected, find a continuous function onto a disconnected set: $\det$ onto $\mathbb{R}\setminus\{0\}$, $x$-coordinate onto $(-\infty,-1]\cup[1,\infty)$, trace onto a two-point set. Or exhibit two open sets (in the big space) that split it.
- To count components, split the set into pieces that are each connected, then show the pieces are relatively open (or separated by a continuous function into a discrete set). For matrix sets, the determinant, trace, rank and signature are the usual separating functions.
- To show path-connected fails, imitate the sine-curve argument: a path starting on the "limit part" must, by the IVT applied to one coordinate, pass through points where the other coordinate is far from its starting value.
- To rule out a homeomorphism, remove a point (or two, or a finite set) and count components; or compare compactness, number of components, or non-cut points.
- Connected $\not\Rightarrow$ path-connected. The topologist's sine curve $S$ (Example 3) and $T$ of Example 5(e) are connected but not path-connected. For open subsets of $\mathbb{R}^n$ the two notions agree (Theorem 7.26).
- The closure of a path-connected set need not be path-connected ($S=\overline{S_+}$), although the closure of a connected set is connected.
- The interior of a connected set need not be connected. Two closed discs touching at one point form a connected set whose interior is two disjoint open discs. Nor need the interior be nonempty: a segment in $\mathbb{R}^2$.
- Intersections of connected sets need not be connected. A circle and a line through its centre: both connected, intersection two points. (In $\mathbb{R}$ the intersection of two intervals is an interval.)
- Dense does not help. $\mathbb{Q}$ is dense in $\mathbb{R}$ and totally disconnected; $\mathbb{R}^2\setminus\mathbb{Q}^2$ is connected; $\mathbb{Q}^2$ is not.
- Totally disconnected does not mean discrete. $\mathbb{Q}$ and the Cantor set have no isolated points, yet every component is a point.
- Components need not be open. The components of $\mathbb{Q}$ are singletons, which are not open in $\mathbb{Q}$. Components are always closed; they are open when there are finitely many of them, or in open subsets of $\mathbb{R}^n$.
- Continuous preimages of connected sets need not be connected. $x\mapsto x^2$ maps $\{-1,1\}$ onto $\{1\}$. Only images are controlled.
- $GL_n(\mathbb{R})$ versus $GL_n(\mathbb{C})$. The real group has two components ($\det\gt0$, $\det\lt0$); the complex group is connected. $O(n)$ has two components, $SO(n)$, $U(n)$, $SL_n(\mathbb{R})$ are connected.
- Same cut-point count does not mean homeomorphic. The circle and the letter θ both have no cut points; they are still not homeomorphic (removing two suitable points from θ leaves it connected, never so for the circle).
- A continuous bijection need not be a homeomorphism. $t\mapsto(\cos2\pi t,\sin2\pi t)$ maps $[0,1)$ bijectively and continuously onto $S^1$, but $[0,1)\not\cong S^1$ ($0$ is a non-cut point of $[0,1)$ — the others are all cut points — while no point of $S^1$ is a cut point).
Exercises
- 1 Which of the following subsets of $\mathbb{R}$ are connected? (a) $\{x:x^2\gt2\}$; (b) $\{x:x^3-x\ge0\}$; (c) $\{x: \sin x\ge -1\}$; (d) $\{x:\lfloor x\rfloor=1\}$.
- 2 Prove that a set with at least two points and the discrete metric is disconnected, and that its only nonempty connected subsets are singletons.
- 3 Prove that $X$ is connected if and only if every nonempty proper subset of $X$ has nonempty boundary.
- 4 Let $A,B$ be connected subsets of $X$ with $\overline A\cap B\ne\varnothing$. Prove that $A\cup B$ is connected. Is "$A\cap B=\varnothing$ and $\overline A\cap\overline B\ne\varnothing$" enough?
- 5 Prove that the intersection of two connected subsets of $\mathbb{R}$ is connected, and give two connected subsets of $\mathbb{R}^2$ whose intersection is disconnected.
- 6 Find all continuous $f:\mathbb{R}\to\mathbb{R}$ with $f(x)^2=x^2(x-1)^2$ for all $x$.
- 7 Let $X$ be connected and $f:X\to\mathbb{R}$ continuous and locally constant (each point has a neighbourhood on which $f$ is constant). Prove that $f$ is constant. Is "connected" needed?
- 8 Let $f:[0,1]\to\mathbb{R}$ be continuous with $f(0)\gt0$, $f(1)\lt1$. Prove that $f(x)=x$ for some $x$, and deduce that the equation $\cos x=x$ has a root in $(0,1)$.
- 1 Prove that the unit sphere $S^{n-1}\subseteq\mathbb{R}^n$ is path-connected for $n\ge2$. What happens for $n=1$?
- 2 Prove that $\mathbb{R}^n$ minus a finite set is path-connected for $n\ge2$, and that the annulus $\{1\le\|x\|\le2\}\subseteq\mathbb{R}^2$ is path-connected.
- 3 Prove that the graph of a continuous function $f:I\to\mathbb{R}$ on an interval $I$ is path-connected.
- 4 Show that the set of nilpotent matrices in $M_n(\mathbb{R})$ is path-connected.
- 5 How many components does the set of idempotent matrices $\{A\in M_2(\mathbb{R}):A^2=A\}$ have?
- 6 Assuming that $SO(n)$ is path-connected, show that $O(n)$ has exactly two components and find them.
- 7 Show that $\{A\in M_2(\mathbb{R}):A\text{ has a real eigenvalue}\}$ is path-connected, and that $\{A\in M_2(\mathbb{R}):A\text{ has no real eigenvalue}\}$ has exactly two components.
- 8 Is the set of $n\times n$ real matrices of rank exactly $1$ connected ($n\ge2$)?
- 1 Count the components of (a) $\{xy=1\}$; (b) $\{|xy|=1\}$; (c) $\{x^2-y^2\le1\}$; (d) $\{x^2+y^2\ne1\}$ (all in $\mathbb{R}^2$).
- 2 Show that a countable metric space with at least two points is totally disconnected.
- 3 Prove that $(\mathbb{R}\setminus\mathbb{Q})^2$ is totally disconnected, while $\mathbb{R}^2\setminus(\mathbb{R}\setminus\mathbb{Q})^2$ is path-connected.
- 4 Prove that $S^1$ is not homeomorphic to the figure eight, and that $\mathbb{R}\not\cong[0,\infty)$.
- 5 Prove that the letters T and Y are homeomorphic, but T and the letter O are not.
- 6 Let $U\subseteq\mathbb{R}^n$ be open and let $C$ be a component of $U$. Prove that $\partial C\subseteq\partial U$.
- 7 Show that the components of $\mathbb{R}^2\setminus\{(x,y):y=\sin x\}$ are the two regions above and below the graph.
- 1 (Universal chord theorem.) Let $f:[0,1]\to\mathbb{R}$ be continuous with $f(0)=f(1)$ and let $n\in\mathbb{N}$. Prove that $f(x+\tfrac1n)=f(x)$ for some $x\in[0,1-\tfrac1n]$.
- 2 Let $X$ be connected, $A\subseteq X$, and let $C\subseteq X$ be a connected set meeting both $A$ and $X\setminus A$. Prove that $C$ meets $\partial A$.
- 3 Prove that a connected metric space with at least two points has cardinality at least $\mathfrak{c}$.
- 4 (Deleted comb.) Let $K=([0,1]\times\{0\})\cup\bigcup_{n\ge1}\big(\{\tfrac1n\}\times[0,1]\big)$ and $D=K\cup\{(0,1)\}$. Prove that $D$ is connected but not path-connected.
- 5 Prove that there is no continuous $f:\mathbb{R}\to\mathbb{R}$ taking every real value exactly twice.
- 6 A metric space is locally path-connected if every ball contains a path-connected open neighbourhood of its centre. Prove that a connected, locally path-connected space is path-connected, and explain why the topologist's sine curve is not locally path-connected.
E1. CSIR Part B GATE MA Which of the following subsets of $\mathbb{R}^2$ is not connected? (A) the graph of $y=x\sin\frac1x$ ($x\ne0$) together with the origin; (B) $\{(x,y):x^2-y^2=1\}$; (C) $\mathbb{R}^2\setminus\mathbb{Q}^2$; (D) the union of the two closed unit discs centred at $(0,0)$ and $(2,0)$.
E2. CSIR Part B The number of connected components of $\{A\in M_2(\mathbb{R}):A^2=I\}$ is (A) $1$; (B) $2$; (C) $3$; (D) infinitely many.
E3. CSIR Part B Which of the following pairs of spaces (with the usual metrics) are homeomorphic? (A) $[0,1)$ and $(0,1)$; (B) $S^1$ and $[0,1]$; (C) $\mathbb{R}$ and $(0,1)$; (D) $\mathbb{R}$ and $\mathbb{R}^2$.
E4. CSIR Part C Let $n\ge2$. Which of the following subsets of $M_n(\mathbb{R})$ are connected? (One or more options may be correct.) (A) $GL_n(\mathbb{R})$; (B) $\{A:\det A\gt0\}$; (C) $O(n)$; (D) the set of nilpotent matrices.
E5. CSIR Part C Let $X\subseteq\mathbb{R}^2$. Which of the following statements are true? (A) If $X$ is connected, then $\overline X$ is connected. (B) If $X$ is connected, then its interior $X^\circ$ is connected. (C) If $\overline X$ is connected, then $X$ is connected. (D) If $X$ is open and connected, then $X$ is path-connected.
E6. CSIR Part C Which of the following statements are true? (A) Every continuous injective $f:\mathbb{R}\to\mathbb{R}$ is strictly monotone. (B) There is no continuous injective map $\mathbb{R}^2\to\mathbb{R}$. (C) If $f:\mathbb{R}\to\mathbb{R}$ is continuous and $f(x)\in\mathbb{Q}$ for every irrational $x$, then $f$ is constant. (D) Every continuous $f:\mathbb{R}\to\mathbb{R}$ maps open intervals onto open intervals.
Suggested plan — 3 lectures × 60 min.
- Connectedness. Start from the proof of the IVT and ask what property of $[a,b]$ it really uses. Definition 7.16 and the four forms (Theorem 7.21) — insist that students learn form (3). Theorem 7.22 with the full supremum proof; note that $\mathbb{Q}$ fails. Theorem 7.23, Example 1 on the board (let students guess the number of solutions in (d) first), then Theorem 7.24 with the "cross" picture for products.
- Paths. Definition 7.17, Theorems 7.25–7.26 (the clopen argument of 7.26 is a template worth repeating). Example 2(b) — the "uncountably many routes" argument is short and memorable. Example 3 in full, then project Interactive 1: first zoom mode at $y_0=0.5$ and $y_0=1$, then walk mode, counting swings aloud. Theorem 7.27 and Example 4 as a CSIR-style session ("which matrix sets are connected?").
- Components and invariants. Theorems 7.28–7.30 with the Cantor set; Example 5 as a quick-fire round. Theorem 7.31 and Interactive 2: ask the class to predict the profile of each shape before pressing Play, and to explain why the circle and θ share a profile. Examples 6–7 (the $\tfrac25$-chord counterexample always surprises). Close with E2 and E6 live.
Discussion questions. (1) The IVT is false on $\mathbb{Q}$. Which axiom of $\mathbb{R}$ makes it true, and where exactly does it enter the proof of Theorem 7.22? (2) Why is "connected" defined negatively (no separation) rather than positively? Is there a positive characterisation for open subsets of $\mathbb{R}^n$? (3) How would you prove that $\mathbb{R}^2\not\cong\mathbb{R}^3$? Why does removing a point no longer help?
Misconceptions to watch for. Believing connected and path-connected always coincide; thinking the interior or the intersection of connected sets is connected; using preimages instead of images; assuming totally disconnected means discrete; concluding "homeomorphic" from equal cut-point counts; forgetting that $U$ and $V$ in Definition 7.16 may overlap outside $A$; treating $GL_n(\mathbb{C})$ like $GL_n(\mathbb{R})$.
Suggested homework. I(1, 3, 4, 6), II(1, 4, 5, 7), III(1, 3, 4, 6), IV(1, 4, 5); Exam corner E1, E4, E5.
Research question. If each square of a large grid is independently "open" with probability $p$, when does the union of open squares contain a connected path from the left side to the right side — and why does the answer switch so abruptly from "almost never" to "almost always"?
Why it matters. This is percolation, the mathematics of connectedness in random media. Petroleum engineers use it for oil flowing through porous rock, epidemiologists for infections spreading through contact networks, materials scientists for the conductivity of composites (carbon nanotubes in a polymer suddenly conduct once a connected cluster spans the sample), and forest managers for whether a fire can cross a woodland. In every case the question is whether a random set has a component joining two boundaries.
What to do.
- Write a short program that fills an $n\times n$ grid with open sites (probability $p$, using a seeded random generator), and finds the components of the open set by flood fill or union–find (two open sites are joined if they share an edge).
- For $n=20,50,100$ and $p=0.40,0.42,\dots,0.80$, estimate by $500$ trials the probability $\theta_n(p)$ that some component touches both the left and right columns. Plot $\theta_n(p)$ against $p$ for the three sizes on one graph.
- Locate the value of $p$ where the curves for different $n$ cross; observe that the transition sharpens as $n$ grows.
- At that critical $p$, record the size of the largest component as a fraction of $n^2$ for each $n$, and test whether it behaves like a power $n^{-\beta}$.
Tools: Python with numpy (or scipy.ndimage.label for components), a plotting library; any language with arrays works.
Hand in: The three crossing-probability curves, your estimate of the critical probability with an error bar, and a paragraph relating "crossing cluster" to components (Definition 7.18).
Going further. Repeat with bond percolation (edges open instead of sites) and with the triangular lattice; read about Kesten's theorem (1980) that the critical probability for bond percolation on the square lattice is exactly $\tfrac12$, and about the duality argument behind it.
🧪 Self-check quiz
Q1. Which of these subsets of $\mathbb{R}$ is connected?
Q2. The topologist's sine curve $\{(x,\sin\frac1x):0\lt x\le1\}\cup(\{0\}\times[-1,1])$ is
Q3. The number of connected components of $GL_2(\mathbb{R})$ is
Q4. If $f:\mathbb{R}\to\mathbb{R}$ is continuous and $f(x)\in\mathbb{Q}$ for every $x$, then
Q5. Which pair of spaces is homeomorphic?