Skip to content

Connectedness and Path-Connectedness

CSIR NET topology: connected and path-connected spaces, components, local connectedness, cut points, and counting components of matrix groups and plane sets.

  • 21 min read
  • Updated
On this page · 14 sections
  1. Prerequisites
  2. The Hook: Two Kinds of Invertible Matrix
  3. Connected Spaces
  4. Path-Connected Spaces
  5. Components and Path Components
  6. Connectedness as a Homeomorphism Invariant
  7. Counting Components: Matrix Groups and Plane Sets
  8. Memory Tricks
  9. Don’t Confuse
  10. Common Mistakes
  11. Practice
  12. Quick Revision Table
  13. Key Takeaways
  14. What’s Next

Prerequisites

The Hook: Two Kinds of Invertible Matrix

Connected Spaces

A separation of \( X \) is a pair of disjoint non-empty open sets \( U \), \( V \) with \( X = U \cup V \). \( X \) is connected if it has no separation. Equivalent conditions:

\( X \) is connected iffUse it when
the only clopen subsets are \( \varnothing \) and \( X \)you can spot a clopen set
every continuous \( f : X \to \{0, 1\} \) (discrete) is constantyou want a slick proof
\( X \) is not a union of two disjoint non-empty closed setsclosed pieces are easier to see

A subset \( Y \subseteq X \) is connected if it is connected in the subspace topology. For subsets of a space: \( Y \) is disconnected iff there are open \( U \), \( V \) in \( X \) with \( Y \subseteq U \cup V \), \( U \cap V \cap Y = \varnothing \), and both \( U \cap Y \), \( V \cap Y \) non-empty.

The connected subsets of R

So \( \mathbb{Q} \), \( \mathbb{R} \setminus \mathbb{Q} \), \( \mathbb{R} \setminus \{0\} \), \( \mathbb{Z} \) and the Cantor set are disconnected, and every interval, ray and singleton is connected.

Theorems that build connected sets

  1. Continuous images. If \( X \) is connected and \( f \) is continuous, \( f(X) \) is connected. With the theorem above this is the intermediate value theorem: a continuous \( f : X \to \mathbb{R} \) on a connected \( X \) takes every value between two of its values.
  2. Common point. A union of connected sets that share a point is connected. More generally, a union of connected sets each meeting a fixed connected set \( A \) is connected.
  3. Squeeze. 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.
  4. Products. Any product of connected spaces is connected in the product topology (not in the box topology; see Subspace and Product Topology).
  5. Chain. If \( A_1, A_2, \dots \) are connected and \( A_n \cap A_{n+1} \ne \varnothing \), then \( \bigcup A_n \) is connected.

The interior of a connected set need not be connected (two closed discs touching at a point), and neither need the intersection of two connected sets (two arcs of a circle meeting at both ends).

Connectedness in the standard topologies

SpaceConnected?Why
Indiscreteyesno proper non-empty open set
Discrete, \( \ge 2 \) pointsnoevery singleton is clopen
Cofinite, \( X \) infiniteyesany two non-empty open sets meet
Cocountable, \( X \) uncountableyesany two non-empty open sets meet
\( \mathbb{R}_\ell \)no; totally disconnected\( (-\infty, b) \) and \( [b, \infty) \) are both open
Particular point topologyyesevery non-empty open set contains \( p \)
Usual \( \mathbb{R}^n \)yespath-connected

Path-Connected Spaces

A path from \( x \) to \( y \) is a continuous \( \gamma : [0, 1] \to X \) with \( \gamma(0) = x \), \( \gamma(1) = y \). \( X \) is path-connected if any two points are joined by a path.

$$\boxed{\text{path-connected} \Rightarrow \text{connected}}$$

(If \( U \), \( V \) separated \( X \), a path from a point of \( U \) to a point of \( V \) would separate \( [0, 1] \).) Path-connectedness is also preserved by continuous images and by arbitrary products, and a union of path-connected sets with a common point is path-connected. It is not preserved by closures.

The converse fails: the topologist’s sine curve

$$S = \{(x, \sin\tfrac{1}{x}) : 0 < x \le 1\} \cup (\{0\} \times [-1, 1]).$$
  • Connected: \( S \) is the closure of the graph \( G = \{(x, \sin\frac{1}{x}) : 0 < x \le 1\} \), which is connected (continuous image of \( (0, 1] \)); apply the squeeze theorem.
  • Not path-connected: suppose \( \gamma(t) = (x(t), y(t)) \) were a path from \( (0, 0) \) to \( (1, \sin 1) \). Let \( t_0 \) be the last time \( \gamma \) lies on the closed segment \( \{0\} \times [-1, 1] \); then \( x(t_0) = 0 \) and \( x(t) > 0 \) for \( t > t_0 \). By the IVT applied to \( x \) on \( [t_0, t_0 + \delta] \), every small positive value is taken by \( x \) arbitrarily close to \( t_0 \); in particular there are times \( s_n \to t_0 \) with \( x(s_n) = \frac{1}{(2n + \frac{1}{2})\pi} \), where \( y(s_n) = 1 \), and times \( r_n \to t_0 \) with \( x(r_n) = \frac{1}{(2n - \frac{1}{2})\pi} \), where \( y(r_n) = -1 \). So \( y \) is not continuous at \( t_0 \). Contradiction.
  • Not locally connected at the points of the segment.
  • It has two path components: \( G \) and the segment.

Its relatives behave the same way: the deleted comb space \( ([0, 1] \times \{0\}) \cup \bigcup_n (\{\frac{1}{n}\} \times [0, 1]) \cup \{(0, 1)\} \) is connected but not path-connected.

When connected does imply path-connected

(The set of points reachable from a fixed point by a path is open, and so is its complement, by local path-connectedness; connectedness does the rest.)

Components and Path Components

The component of \( x \) is the union of all connected subsets containing \( x \), the largest connected set containing \( x \). The path component is the set of points joined to \( x \) by a path.

FactComponentsPath components
Partition \( X \)yesyes
Connectedyesyes (path-connected)
Closedalwaysnot always (the graph \( G \) in the sine curve is not closed)
Openif \( X \) is locally connectedif \( X \) is locally path-connected
Relationeach path component lies in a componentequal when \( X \) is locally path-connected (e.g. open subsets of \( \mathbb{R}^n \))

A space is totally disconnected if its components are single points: \( \mathbb{Q} \), \( \mathbb{R} \setminus \mathbb{Q} \), the Cantor set, \( \mathbb{R}_\ell \), any discrete space. Totally disconnected is not discrete: \( \mathbb{Q} \) has no isolated points.

Countable spaces are (almost) never connected

  • A connected metric space with at least two points is uncountable. For \( x_0 \ne x_1 \), the map \( x \mapsto d(x, x_0) \) is continuous, so its image is a connected subset of \( \mathbb{R} \) containing \( 0 \) and \( d(x_0, x_1) > 0 \): an interval, hence uncountable.
  • The same argument, with an Urysohn function in place of the metric, works for any normal (indeed completely regular) space.
  • Every continuous \( f : \mathbb{R} \to \mathbb{R} \) with countable image is constant, for the same reason. So is every continuous map from a connected space into \( \mathbb{Q} \) or \( \mathbb{Z} \).
  • Without separation axioms, countable connected spaces exist: \( \mathbb{N} \) with the cofinite topology is connected.

Connectedness as a Homeomorphism Invariant

If \( h : X \to Y \) is a homeomorphism, then \( h \) restricts to a homeomorphism \( X \setminus \{x\} \to Y \setminus \{h(x)\} \). So the number of components left after removing a point is a topological invariant. A cut point is a point whose removal disconnects the space.

PairHomeomorphic?Invariant that decides
\( (0, 1) \) and \( \mathbb{R} \)yes (\( x \mapsto \tan(\pi x - \frac{\pi}{2}) \))
\( \mathbb{R} \) and \( \mathbb{R}^2 \)noremoving a point disconnects \( \mathbb{R} \), not \( \mathbb{R}^2 \)
\( [0, 1) \) and \( (0, 1) \)no\( [0, 1) \) has a non-cut point (0); every point of \( (0, 1) \) is a cut point
\( [0, 1] \) and \( [0, 1) \)notwo non-cut points vs one (or: compact vs not)
\( S^1 \) and \( [0, 1] \)no\( S^1 \) has no cut points
\( S^1 \) and any subset of \( \mathbb{R} \)noconnected subsets of \( \mathbb{R} \) are intervals, which have cut points (or use the antipodal argument)
The letters T and the segment \( [0, 1] \)noremoving the junction of T leaves 3 components
\( \mathbb{R}^2 \) and \( \mathbb{R}^3 \)nonot provable by removing a point (both stay connected); needs invariance of domain or homology, which CSIR NET does not test

Counting Components: Matrix Groups and Plane Sets

Matrix groups

The determinant, the trace and the eigenvalues are continuous functions of the entries, so they are the natural tools.

Set (real \( n \times n \) unless stated)ComponentsReason
\( GL(n, \mathbb{R}) \)2\( \det > 0 \), \( \det < 0 \); each piece is path-connected
\( GL(n, \mathbb{C}) \)1the zero set of \( \det \) has real codimension 2; a path from \( A \) to \( B \) through \( (1 - z)A + zB \) can avoid the finitely many \( z \) with \( \det = 0 \)
\( SL(n, \mathbb{R}) \), \( SO(n) \), \( U(n) \), \( SU(n) \)1path-connected
\( O(n) \)2\( \det \) takes only the values \( \pm 1 \)
invertible upper triangular\( 2^n \)the signs of the \( n \) diagonal entries cannot change; each sign pattern gives a convex set
nilpotent matrices1star-shaped: \( tN \) is nilpotent for \( t \in [0, 1] \)
real-diagonalisable matrices1star-shaped about 0
\( \{A : A^2 = I\} \), \( n = 2 \)3\( \{I\} \), \( \{-I\} \), and the matrices with eigenvalues \( 1, -1 \)
symmetric positive definite1convex

Plane sets

Subset of \( \mathbb{R}^2 \)Components
\( \mathbb{R}^2 \setminus \) (union of \( k \) distinct lines through the origin)\( 2k \)
\( \mathbb{R}^2 \setminus \) (circle)2
\( \mathbb{R}^2 \setminus \) (finite or countable set)1
\( \{xy = 1\} \), \( \{x^2 - y^2 = 1\} \)2
\( \{xy = 0\} \), \( \{x^2 = y^2\} \)1 (lines through a common point)
\( \{x^2 + y^2 = 1\} \cup \{(x, 0) : x \in \mathbb{R}\} \)1
\( \{y^2 = x^3 - x\} \)2 (\( x^3 - x \ge 0 \) on \( [-1, 0] \cup [1, \infty) \): a loop and an unbounded branch)
\( \mathbb{Q} \times \mathbb{R} \)countably many: the vertical lines \( \{q\} \times \mathbb{R} \) (a connected subset projects to a connected subset of \( \mathbb{Q} \), a single point)
\( (\mathbb{Q} \times \mathbb{R}) \cup (\mathbb{R} \times \mathbb{Q}) \)1 (path-connected through the grid)

Memory Tricks

Don’t Confuse

ThisvsThat
connectedpath-connected (stronger; equal for open subsets of \( \mathbb{R}^n \))
component (always closed)path component (may fail to be closed)
totally disconnected (\( \mathbb{Q} \))discrete (\( \mathbb{Z} \))
connectedlocally connected (independent properties)
closure of connected is connectedclosure of path-connected may not be path-connected (sine curve)
\( GL(n, \mathbb{R}) \): 2 components\( GL(n, \mathbb{C}) \): connected
\( O(n) \): 2 components\( SO(n) \), \( U(n) \): connected

Common Mistakes

Practice

All questions below are original practice questions written for this page. They are not from any CSIR NET paper. In Level 3, as in Part C, one or more options may be correct.

Level 1: Foundation

  1. Is \( \mathbb{Q} \) connected? Is it discrete?
  2. What are the components of \( \mathbb{R}_\ell \)?
  3. Is \( S^1 \) homeomorphic to \( [0, 1] \)?
Answers
  1. Not connected (\( (-\infty, \sqrt{2}) \) and \( (\sqrt{2}, \infty) \) separate it) and not discrete (no point is isolated). It is totally disconnected.
  2. Single points. For \( a < b \), the open sets \( (-\infty, b) \) and \( [b, \infty) \) separate \( a \) from \( b \).
  3. No. Removing any point leaves \( S^1 \) connected; removing \( \frac{1}{2} \) disconnects \( [0, 1] \).

Level 2: Part B Style

Practice Q1. The number of connected components of \( \{(x, y) \in \mathbb{R}^2 : xy(x - y) \ne 0\} \) is:

(a) 3 (b) 4 (c) 6 (d) 8

Answer: (c)

The removed set is the union of three distinct lines through the origin (\( x = 0 \), \( y = 0 \), \( y = x \)). Three lines through a point cut the plane into \( 2 \times 3 = 6 \) open sectors, each convex, hence connected.

Practice Q2. The number of path components of the group of invertible \( 3 \times 3 \) real upper triangular matrices is:

(a) 1 (b) 2 (c) 6 (d) 8

Answer: (d)

An invertible upper triangular matrix has non-zero diagonal entries \( d_1, d_2, d_3 \). Each \( d_i \) is a continuous function that cannot vanish, so its sign is constant on a path component. For each of the \( 2^3 = 8 \) sign patterns, the set is convex (convex combinations keep the signs and the triangular shape), hence path-connected.

Practice Q3. Which of the following spaces is connected?

(a) \( \mathbb{R}_\ell \) (b) \( \mathbb{Q} \) (usual) (c) \( \mathbb{N} \) with the cofinite topology (d) \( \{(x, y) : x^2 - y^2 = 1\} \)

Answer: (c)

In the cofinite topology on an infinite set any two non-empty open sets meet, so no separation exists. (a) and (b) are totally disconnected; (d) is the union of the disjoint closed branches \( x \ge 1 \) and \( x \le -1 \).

Practice Q4. Which pair of spaces (usual topologies) are homeomorphic?

(a) \( [0, 1) \) and \( (0, 1) \) (b) \( \mathbb{R} \) and \( \mathbb{R}^2 \) (c) \( (0, 1) \) and \( \mathbb{R} \) (d) \( S^1 \) and \( [0, 1] \)

Answer: (c)

\( x \mapsto \tan(\pi x - \frac{\pi}{2}) \) is a homeomorphism \( (0, 1) \to \mathbb{R} \). (a): removing 0 leaves \( (0, 1) \) connected, while removing any point disconnects \( (0, 1) \). (b): removing a point disconnects \( \mathbb{R} \) only. (d): \( S^1 \) has no cut points.

Level 3: Part C Style

Practice Q5. Let \( X = \{A \in M_2(\mathbb{R}) : A^2 = I\} \) with the topology from \( \mathbb{R}^4 \). Which statements are true?

(a) \( X \) has exactly three connected components. (b) \( X \) is compact. (c) \( X \) is closed in \( M_2(\mathbb{R}) \). (d) \( X \setminus \{I, -I\} \) is path-connected.

Answer: (a), (c) and (d)
  • (a) True. \( X = \{I\} \cup \{-I\} \cup Y \) with \( Y \) the matrices of trace 0 and determinant \( -1 \); the trace (2, \( -2 \), 0) separates the pieces, and \( Y \) is connected (worked example above).
  • (b) False. \( \begin{pmatrix} 1 & t \\ 0 & -1 \end{pmatrix} \in X \) for all real \( t \), so \( X \) is unbounded.
  • (c) True. \( X \) is the zero set of the continuous map \( A \mapsto A^2 - I \).
  • (d) True. \( Y \) is the hyperboloid \( a^2 + u^2 - v^2 = 1 \) in suitable coordinates, a path-connected surface.

Practice Q6. Let \( S = \{(x, \sin\frac{1}{x}) : 0 < x \le 1\} \cup (\{0\} \times [-1, 1]) \subseteq \mathbb{R}^2 \). Which statements are true?

(a) \( S \) is connected. (b) \( S \) is path-connected. (c) \( S \) is locally connected. (d) \( S \) is compact.

Answer: (a) and (d)
  • (a) True. \( S \) is the closure of the connected graph of \( \sin\frac{1}{x} \) on \( (0, 1] \).
  • (b) False. No path joins \( (0, 0) \) to \( (1, \sin 1) \): the \( y \)-coordinate would have to oscillate between \( \pm 1 \) as the \( x \)-coordinate tends to 0.
  • (c) False. Small balls around \( (0, 0) \) meet \( S \) in infinitely many disjoint arcs plus a segment; no small connected neighbourhood exists.
  • (d) True. \( S \) is closed (it is a closure) and bounded in \( \mathbb{R}^2 \).

Practice Q7. Which statements are true?

(a) Every countable metric space with at least two points is disconnected. (b) \( \mathbb{R}^2 \setminus \mathbb{Q}^2 \) is path-connected. (c) Every continuous \( f : [0, 1] \to \mathbb{R} \) with \( f(x) \in \mathbb{Q} \) for all \( x \) is constant. (d) \( \mathbb{R} \setminus \mathbb{Q} \) (usual topology) is connected.

Answer: (a), (b) and (c)
  • (a) True. \( d(\cdot, x_0) \) maps a connected space onto an interval containing 0 and a positive number, which is uncountable.
  • (b) True. \( \mathbb{Q}^2 \) is countable; the plane minus a countable set is path-connected.
  • (c) True. \( f([0, 1]) \) is a connected subset of \( \mathbb{Q} \), so a single point.
  • (d) False. \( (-\infty, 0) \) and \( (0, \infty) \) separate it, since 0 is rational.

Quick Revision Table

IdeaFact
Connectedno proper clopen set; every continuous map to \( \{0, 1\} \) constant
In \( \mathbb{R} \)connected \( \iff \) interval
Preserved bycontinuous images, closures, unions with a common point, products
Path-connected\( \Rightarrow \) connected; converse fails (sine curve, deleted comb)
Open connected in \( \mathbb{R}^n \)path-connected
Componentsclosed, partition \( X \); open if locally connected
Totally disconnected\( \mathbb{Q} \), irrationals, Cantor set, \( \mathbb{R}_\ell \)
Countable metric connectedsingle point
\( GL(n, \mathbb{R}) \), \( O(n) \)2 components
\( GL(n, \mathbb{C}) \), \( SL(n, \mathbb{R}) \), \( SO(n) \), \( U(n) \)connected
Upper triangular invertible\( 2^n \) components
\( \mathbb{R}^2 \setminus k \) lines through 0\( 2k \) components
Cut points\( \mathbb{R} \not\cong \mathbb{R}^2 \), \( S^1 \not\cong [0, 1] \), \( [0, 1) \not\cong (0, 1) \)

Key Takeaways

What’s Next

Advertisement
Advertisement