Path-Connectedness

Can you always draw a curve between two points of a space without lifting your pen? This question, innocent as it sounds, splits into two different mathematical ideas. These ideas happen to agree in every situation a calculus student ever meets. They disagree in ways that are genuinely instructive. Connectedness asks only that a space cannot be split into two disjoint open pieces. Path-connectedness asks for an actual continuous journey, a map from the unit interval, joining any two points. The gap between these notions is where some of the richest pathology in point-set topology lives. Closing that gap correctly is a prerequisite for everything that follows in algebraic topology. The idea matters because path-connectedness is the notion topologists actually use to build the Fundamental Group and the theory of Covering Spaces. A space's fundamental group is defined using loops — paths that start and end at the same point. So before one can even ask "what is π1(X)\pi_1(X)?" one must know how paths behave. One must know whether they compose, whether they can be reversed. One must also know whether path-connected pieces of a space are well-defined objects (the path components). This article develops that foundation carefully. The big picture is a hierarchy of connectivity notions of increasing strength: connected, path-connected, locally path-connected, simply connected. Path-connectedness sits in the middle. It is strictly stronger than connectedness in general. But it becomes equivalent to it once mild regularity is imposed. This regularity is local path-connectedness, satisfied by all manifolds and CW complexes. The topologist's sine curve is the canonical witness that the implication cannot be reversed outright. Understanding exactly why it fails illuminates what "extra" a path-connected space possesses. This article gives the precise definitions of a path, path-connectedness, and path components. It proves that path-connectedness implies connectedness. It also proves that continuous images of path-connected spaces are path-connected. It establishes the standard closure properties (products, unions along a common point). It works the topologist's sine curve in full detail as the definitive counterexample. It closes with the scope table every student needs before opening a book on the fundamental group.

Key takeaways
  • A path in XX is a continuous map γ:[0,1]→X\gamma:[0,1]\to X; XX is path-connected if every pair of points is joined by some path.
  • Path-connectedness ⇒\Rightarrow connectedness always; the converse fails, witnessed by the topologist's sine curve.
  • Being joined by a path is an equivalence relation on XX; its classes are the path components, always subsets of the (ordinary) connected components.
  • Continuous images of path-connected spaces are path-connected, and arbitrary products of path-connected spaces are path-connected (with the The Product Topology).
  • If every point has a path-connected neighborhood base (local path-connectedness), path components equal connected components, and the two notions coincide.
  • Key idea: path-connectedness replaces the negative, indirect definition of connectedness with a positive, constructive one — an actual continuous witness — at the cost of sometimes being strictly stronger.

Where this lives today

Path-connectedness is the load-bearing hypothesis under the entire machinery of algebraic topology: the Fundamental Group π1(X,x0)\pi_1(X,x_0) is only independent of the choice of basepoint x0x_0 (up to isomorphism) when XX is path-connected, and the theory of Covering Spaces — used to classify subgroups of π1\pi_1 and to build universal covers — is stated for path-connected, locally path-connected base spaces. In complex analysis, path-connectedness of domains underlies the existence of analytic continuations and single-valued branches of functions like log⁡z\log z along a path avoiding a branch point. In differential geometry, a connected Riemannian manifold is automatically path-connected (even geodesically connected under completeness, by the Hopf–Rinow theorem), which is why "connected manifold" and "path-connected manifold" are used interchangeably by geometers. In dynamical systems and control theory, path-connectedness of a reachable set answers whether a system can be steered continuously between two states without discrete jumps. In computer graphics and mesh processing, testing path-connectedness of a discretized surface (via graph connectivity of a triangulation) is a basic sanity check before texture-mapping or physical simulation. In data analysis, "connected components" of a point cloud built from a neighborhood graph are really discrete analogues of path components, feeding into clustering algorithms and topological data analysis (persistent homology pipelines begin by identifying such components).

Ask the tutor: Can you show me step by step why removing just one point from the topologist's sine curve's limit segment still leaves it path-disconnected from the oscillating part?

DefinitionPath, Path-Connectedness, Path Components

Let XX be a topological space and let I=[0,1]I = [0,1] carry the standard (Euclidean subspace) topology.

Path. A path in XX from x0x_0 to x1x_1 is a continuous map

γ:I→X,γ(0)=x0, γ(1)=x1.\gamma : I \to X, \qquad \gamma(0) = x_0,\ \gamma(1) = x_1.

The point x0x_0 is the initial point and x1x_1 the terminal point of γ\gamma.

Path-connectedness. XX is path-connected if for every pair of points x0,x1∈Xx_0, x_1 \in X there exists a path in XX from x0x_0 to x1x_1. A subset A⊆XA \subseteq X is path-connected if it is path-connected as a subspace.

Relation "joined by a path." Define a relation ∼\sim on XX by

x∼y  ⟺  there exists a path in X from x to y.x \sim y \iff \text{there exists a path in } X \text{ from } x \text{ to } y.

Path components. The equivalence classes of ∼\sim (shown below to be an equivalence relation) are the path components of XX. The path component of xx is denoted PxP_x.

Intuition

Ordinary connectedness is a negative condition: a space is connected if it cannot be broken into two disjoint nonempty open sets. It says nothing constructive about how points relate to each other. Path-connectedness replaces this with a positive, hands-on condition: to certify that xx and yy "belong together," you must produce an actual continuous map from [0,1][0,1] landing on xx at time 00 and yy at time 11. This is a much more demanding — but also much more usable — requirement, because paths can be concatenated, reversed, and reparametrized, giving path-connectedness an algebraic flavor that pure connectedness lacks. Picture the plane. Any two points can obviously be joined by a straight line segment, so R2\mathbb{R}^2 is path-connected, and hence (as we will prove) connected. Now picture a graph like y=sin⁡(1/x)y = \sin(1/x) for x∈(0,1]x \in (0,1], together with the limiting segment {0}×[−1,1]\{0\}\times[-1,1] that the curve wiggles toward but never touches as x→0+x\to 0^+. The closure of the graph is connected — you cannot separate it into two disjoint open pieces, because the oscillating curve has points arbitrarily close to every point of the segment. But no path can travel from a point on the curve to a point on the segment: any such path would have to cross infinitely many oscillations in a finite amount of "time," which forces a discontinuity at the endpoint. This is the topologist's sine curve, and it is the standard proof that path-connectedness is strictly stronger.

Figure
The topologist's sine curve: connected but not path-connected
{0}×[-1,1] y = sin(1/x), x→0⁺ Closure S̄ is connected, but no path joins (0,0) to a point on the curve

The mathematician behind it

TheoremPath-Connectedness Implies Connectedness

Let XX be a topological space. If XX is path-connected, then XX is connected.

Proof

Proof technique: reduction to the connectedness of the interval, via the image of a continuous map.

Step 1: I=[0,1]I = [0,1] is connected. This is a standard fact (the connectedness of intervals in R\mathbb{R}), proved via the least-upper-bound property; we take it as a known prerequisite result about Connected Spaces and cite it rather than reprove it here, since it does not depend on path-connectedness.

Step 2: continuous images of connected spaces are connected. This is likewise a standard prerequisite fact: if f:Y→Zf:Y\to Z is continuous and YY is connected, then f(Y)f(Y) is connected, since a separation of f(Y)f(Y) would pull back (via continuity of ff) to a separation of YY. We use this as a known lemma.

Step 3: main argument. Suppose, for contradiction, that XX is path-connected but not connected. Then there is a separation

X=U∪V,U,V open, nonempty, disjoint.X = U \cup V, \qquad U, V \text{ open, nonempty, disjoint.}

Choose x0∈Ux_0 \in U and x1∈Vx_1 \in V (possible since both are nonempty). By path-connectedness there is a path γ:I→X\gamma: I \to X with γ(0)=x0\gamma(0) = x_0, γ(1)=x1\gamma(1)=x_1. Let γ(I)⊆X\gamma(I) \subseteq X be the image. By Step 2, γ(I)\gamma(I) is connected, being the continuous image of the connected space II (Step 1). Now consider U′=U∩γ(I)U' = U \cap \gamma(I) and V′=V∩γ(I)V' = V \cap \gamma(I). These are open in the subspace γ(I)\gamma(I) (as intersections of the open sets U,VU, V with γ(I)\gamma(I)), they are disjoint (since U,VU, V are disjoint), and

U′∪V′=(U∪V)∩γ(I)=X∩γ(I)=γ(I).U' \cup V' = (U\cup V)\cap \gamma(I) = X \cap \gamma(I) = \gamma(I).

Moreover x0=γ(0)∈U′x_0 = \gamma(0) \in U' and x1=γ(1)∈V′x_1 = \gamma(1) \in V', so both are nonempty. Thus U′,V′U', V' form a separation of γ(I)\gamma(I), contradicting the connectedness of γ(I)\gamma(I) established in Step 2. This contradiction shows no such separation U,VU, V of XX can exist, i.e. XX is connected. ■\blacksquare

∎
LemmaThe relation "joined by a path" is an equivalence relation

Let XX be a topological space. The relation x∼yx \sim y ("there is a path in XX from xx to yy") is an equivalence relation on XX.

Proof

Proof technique: explicit construction of paths via constant, reversal, and concatenation maps.

Reflexivity. For x∈Xx\in X define γ:I→X\gamma:I\to X by γ(t)=x\gamma(t) = x for all tt (the constant path). This is continuous (constant maps are always continuous) and satisfies γ(0)=γ(1)=x\gamma(0)=\gamma(1)=x. Hence x∼xx\sim x.

Symmetry. Suppose x∼yx\sim y via a path γ:I→X\gamma: I\to X with γ(0)=x,γ(1)=y\gamma(0)=x,\gamma(1)=y. Define γˉ(t)=γ(1−t)\bar\gamma(t) = \gamma(1-t). The map t↦1−tt\mapsto 1-t is continuous I→II\to I, and γ\gamma is continuous, so γˉ=γ∘(t↦1−t)\bar\gamma = \gamma\circ(t\mapsto 1-t) is continuous as a composite of continuous maps. Also γˉ(0)=γ(1)=y\bar\gamma(0)=\gamma(1)=y and γˉ(1)=γ(0)=x\bar\gamma(1)=\gamma(0)=x. Hence y∼xy\sim x.

Transitivity. Suppose x∼yx\sim y via γ\gamma and y∼zy\sim z via δ\delta, with γ(0)=x,γ(1)=y=δ(0),δ(1)=z\gamma(0)=x,\gamma(1)=y=\delta(0),\delta(1)=z. Define the concatenation γ∗δ:I→X\gamma * \delta : I \to X by

(γ∗δ)(t)={γ(2t),0≤t≤12,δ(2t−1),12≤t≤1.(\gamma*\delta)(t) = \begin{cases} \gamma(2t), & 0\le t \le \tfrac12,\\ \delta(2t-1), & \tfrac12 \le t \le 1. \end{cases}

This is well-defined at t=12t=\tfrac12 since both formulas give γ(1)=y=δ(0)\gamma(1) = y = \delta(0). To check continuity, note I=[0,12]∪[12,1]I = [0,\tfrac12]\cup[\tfrac12,1] is a union of two closed sets, and γ∗δ\gamma*\delta restricted to each piece is continuous (a composite of the continuous map t↦2tt\mapsto 2t or t↦2t−1t\mapsto 2t-1 with a continuous path). By the pasting lemma for closed covers (a standard fact: a function that is continuous on each of finitely many closed sets covering the domain, and agrees on overlaps, is continuous on the whole domain), γ∗δ\gamma * \delta is continuous on II. Since (γ∗δ)(0)=γ(0)=x(\gamma*\delta)(0) = \gamma(0) = x and (γ∗δ)(1)=δ(1)=z(\gamma*\delta)(1) = \delta(1) = z, we get x∼zx \sim z. Reflexivity, symmetry, and transitivity together show ∼\sim is an equivalence relation. ■\blacksquare

∎
CorollaryPath components partition XX, and refine into connected components

The path components of XX (equivalence classes of ∼\sim) partition XX. Moreover, each path component is contained in a single connected component of XX; that is, the partition into path components refines the partition into connected components.

Proof

Proof technique: general equivalence-relation partitioning, plus a direct application of <span class="wiki-link-missing">Path-Connectedness Implies Connectedness</span>. Since ∼\sim is an equivalence relation (previous Lemma), its equivalence classes partition XX: this is the standard fact that equivalence classes of any equivalence relation are pairwise disjoint and cover the whole set, because xx always lies in its own class (reflexivity), and if two classes share a point they coincide entirely (using symmetry and transitivity). For the refinement claim, fix a path component PxP_x. As a subspace, PxP_x is path-connected: given y,z∈Pxy,z\in P_x, both are ∼x\sim x, so by symmetry and transitivity y∼zy\sim z, and the path witnessing this can be taken to have image in PxP_x (if γ\gamma is a path from yy to zz in XX, every point γ(t)\gamma(t) satisfies γ(t)∼y∼x\gamma(t)\sim y \sim x by restricting γ\gamma to [0,t][0,t] and reparametrizing, so γ(t)∈Px\gamma(t) \in P_x; hence γ\gamma actually maps into PxP_x, and remains continuous into the subspace PxP_x by the universal property of the subspace topology). So PxP_x, with the subspace topology, is path-connected. By the Theorem, PxP_x is therefore connected as a subspace of XX. A connected subspace of XX is always contained in a single connected component of XX (a standard fact about connected components: they are the maximal connected subsets, so any connected set lies inside the component containing any one of its points). Hence PxP_x lies inside the connected component of XX containing xx. ■\blacksquare

∎

Worked examples

Example 1: The comb space is path-connected but shows how fragile the property can be under removing a point. Let

C=({0}×[0,1])  ∪  ⋃n=1∞({1n}×[0,1])  ∪  ([0,1]×{0})⊂R2,C = \big(\{0\}\times[0,1]\big) \;\cup\; \bigcup_{n=1}^{\infty}\Big(\big\{\tfrac1n\big\}\times[0,1]\Big) \;\cup\; \big([0,1]\times\{0\}\big) \subset \mathbb{R}^2,

the union of the vertical segment at x=0x=0, vertical "teeth" at x=1,12,13,…x = 1, \tfrac12, \tfrac13,\dots, and the horizontal base segment, with the subspace topology from R2\mathbb{R}^2. Claim: CC is path-connected. Take any two points p=(a,b),q=(c,d)∈Cp=(a,b), q=(c,d)\in C. Each point of CC lies either on the base [0,1]×{0}[0,1]\times\{0\} or on a tooth {1/n}×[0,1]\{1/n\}\times[0,1] or on the limit segment {0}×[0,1]\{0\}\times[0,1]. Construct a path from pp to qq in three (or fewer) straight-line stages, each an explicit continuous map: 1. From p=(a,b)p=(a,b) move straight down to (a,0)(a,0) along {a}×[0,b]\{a\}\times[0,b]: the map γ1(t)=(a,b(1−t))\gamma_1(t) = (a, b(1-t)) for t∈[0,1]t\in[0,1] is continuous (each coordinate is a polynomial in tt, hence continuous, and continuity into a product/subspace is checked coordinatewise), and its image lies in CC since a∈{0,1,12,13,… }∪[0,1]a\in\{0,1,\tfrac12,\tfrac13,\dots\}\cup[0,1] is one of the teeth-or-base xx-values, wait — more carefully: since (a,b)∈C(a,b)\in C, the vertical fiber {a}×[0,1]\{a\}\times[0,1] is entirely contained in CC whenever a=0a=0 or a=1/na=1/n; if instead pp lies on the base itself (b=0b=0) this step is trivial (constant path). 2. Travel along the base from (a,0)(a,0) to (c,0)(c,0): the map γ2(t)=(a+t(c−a),0)\gamma_2(t) = (a+t(c-a),0), t∈[0,1]t\in[0,1], is continuous and its image lies in the base [0,1]×{0}⊂C[0,1]\times\{0\}\subset C. 3. From (c,0)(c,0) move straight up to (c,d)=q(c,d)=q along {c}×[0,d]\{c\}\times[0,d], by the same reasoning as step 1. Concatenating γ1,γ2,γ3\gamma_1,\gamma_2,\gamma_3 (reparametrized to [0,13],[13,23],[23,1][0,\tfrac13],[\tfrac13,\tfrac23],[\tfrac23,1] exactly as in the transitivity proof above, extended to three pieces by the same pasting-lemma argument) gives a single continuous path from pp to qq in CC. Hence CC is path-connected. Note the subtlety: this construction crucially uses that every tooth, including the limiting one at x=0x=0, is a full vertical segment attached to the base. If one deletes even a single point of the base — say removes (0,0)(0,0) but keeps the rest of {0}×[0,1]\{0\}\times[0,1] — the resulting "deleted comb space" is connected (a limit-point argument, since every neighborhood of a point on the limit segment meets infinitely many teeth) but fails to be path-connected: no path can reach the segment {0}×(0,1]\{0\}\times(0,1] from a tooth, by an oscillation argument entirely analogous to the topologist's sine curve below. This shows how a single point's removal can silently destroy path-connectedness while connectedness survives — exactly the kind of asymmetric, easy-to-miss failure the theorem's converse is guarding against.

Example 2: Products of path-connected spaces are path-connected — verified explicitly for a genuinely asymmetric case. Let X=S1X = S^1 (the unit circle, with its subspace topology from R2\mathbb{R}^2, known to be path-connected via γ(t)=(cos⁡2πt,sin⁡2πt)\gamma(t) = (\cos 2\pi t, \sin 2\pi t)) and let Y=[0,1)Y = [0,1) with the subspace topology from R\mathbb{R} (path-connected via straight-line paths γ(t)=a+t(b−a)\gamma(t) = a + t(b-a) for a,b∈[0,1)a,b\in[0,1), since [0,1)[0,1) is convex). We verify directly, without quoting a general product theorem as a black box, that X×YX\times Y is path-connected, to display the mechanism. Take two points p=(eiθ0,s0)p = (e^{i\theta_0}, s_0) and q=(eiθ1,s1)q=(e^{i\theta_1}, s_1) in X×YX\times Y (writing points of S1S^1 as eiθe^{i\theta}). Since XX is path-connected, fix a path α:I→X\alpha: I \to X with α(0)=eiθ0\alpha(0) = e^{i\theta_0}, α(1)=eiθ1\alpha(1) = e^{i\theta_1} — explicitly α(t)=ei(θ0+t(θ1−θ0))\alpha(t) = e^{i(\theta_0 + t(\theta_1-\theta_0))} works (continuous since t↦θ0+t(θ1−θ0)t\mapsto \theta_0+t(\theta_1-\theta_0) is continuous and θ↦eiθ\theta \mapsto e^{i\theta} is continuous). Since YY is path-connected, fix β(t)=s0+t(s1−s0)\beta(t) = s_0 + t(s_1-s_0), a straight-line path in [0,1)[0,1) from s0s_0 to s1s_1 (valid because [0,1)[0,1) is convex, so the segment stays inside YY). Define Γ:I→X×Y\Gamma: I \to X\times Y by

Γ(t)=(α(t),β(t)).\Gamma(t) = (\alpha(t), \beta(t)).

By the universal property of the product topology (a map into a product is continuous iff each coordinate map is continuous — a standard fact about The Product Topology), and since α,β\alpha,\beta are each continuous, Γ\Gamma is continuous. Also Γ(0)=(α(0),β(0))=(eiθ0,s0)=p\Gamma(0) = (\alpha(0),\beta(0)) = (e^{i\theta_0}, s_0) = p and Γ(1)=q\Gamma(1) = q. So Γ\Gamma is a path from pp to qq in X×YX\times Y. Since p,qp,q were arbitrary, X×Y=S1×[0,1)X\times Y = S^1 \times [0,1) is path-connected. This exact coordinatewise construction generalizes verbatim to any product ∏αXα\prod_\alpha X_\alpha of path-connected spaces (finite or infinite, using the same universal-property argument coordinate by coordinate), giving the general fact that arbitrary products of path-connected spaces are path-connected.

CounterexampleWhy local path-connectedness is needed for the converse

The Theorem shows path-connected ⇒\Rightarrow connected always. One might hope for a converse — perhaps with some mild extra hypothesis, connected spaces are automatically path-connected. We show that dropping the hypothesis of local path-connectedness breaks even this weakened converse, using the topologist's sine curve. Let

S={(x,sin⁡(1/x)):0<x≤1},Sˉ=S∪({0}×[−1,1])⊂R2,S = \Big\{(x,\sin(1/x)) : 0 < x \le 1\Big\}, \qquad \bar S = S \cup \big(\{0\}\times[-1,1]\big) \subset \mathbb{R}^2,

both with the subspace topology from R2\mathbb{R}^2. We claim Sˉ\bar S is connected but not path-connected, and not locally path-connected at any point of {0}×[−1,1]\{0\}\times[-1,1].

Sˉ\bar S is connected. The set SS is the image of the connected set (0,1](0,1] under the continuous map x↦(x,sin⁡(1/x))x \mapsto (x,\sin(1/x)), hence SS is connected (continuous images of connected sets are connected). A standard fact about connectedness states: if AA is connected and A⊆B⊆A‾A \subseteq B \subseteq \overline{A} (closure taken in the ambient space), then BB is connected. Here one checks {0}×[−1,1]⊆S‾\{0\}\times[-1,1] \subseteq \overline{S}: for any y0∈[−1,1]y_0\in[-1,1], choose θ\theta with sin⁡θ=y0\sin\theta = y_0, and let xn=1/(θ+2πn)→0x_n = 1/(\theta + 2\pi n) \to 0; then (xn,sin⁡(1/xn))=(xn,y0)→(0,y0)(x_n, \sin(1/x_n)) = (x_n, y_0) \to (0,y_0), so (0,y0)(0,y_0) is a limit point of SS. Hence Sˉ=S∪({0}×[−1,1])\bar S = S \cup (\{0\}\times[-1,1]) satisfies S⊆Sˉ⊆S‾S \subseteq \bar S \subseteq \overline{S}, so Sˉ\bar S is connected.

Sˉ\bar S is not path-connected. Suppose, for contradiction, γ:I→Sˉ\gamma: I \to \bar S is a path with γ(0)=(0,0)\gamma(0) = (0,0) and γ(1)=(1,sin⁡1)∈S\gamma(1) = (1,\sin 1) \in S. Write γ(t)=(x(t),y(t))\gamma(t) = (x(t), y(t)); both coordinate functions are continuous (x,y:I→Rx,y: I\to\mathbb{R}), since projections are continuous and composites of continuous maps are continuous. Let T=x−1(0)={t∈I:x(t)=0}T = x^{-1}(0) = \{t \in I : x(t) = 0\}. This is nonempty (0∈T0\in T) and closed (preimage of the closed set {0}\{0\} under the continuous map xx). Let t∗=sup⁡Tt^* = \sup T; since TT is closed and bounded, t∗∈Tt^*\in T, so x(t∗)=0x(t^*) = 0, meaning γ(t∗)∈{0}×[−1,1]\gamma(t^*) \in \{0\}\times[-1,1]. Since γ(1)∈S\gamma(1)\in S has nonzero first coordinate, t∗<1t^* < 1. By definition of t∗t^* as the supremum, for every t∈(t∗,1]t \in (t^*,1] we have x(t)≠0x(t) \ne 0, i.e. γ(t)∈S\gamma(t) \in S, so y(t)=sin⁡(1/x(t))y(t) = \sin(1/x(t)). We now derive a contradiction by exploiting continuity of yy at t∗t^* together with the wild oscillation of sin⁡(1/x(t))\sin(1/x(t)) as t→t∗+t \to t^{*+}. Since xx is continuous at t∗t^* with x(t∗)=0x(t^*)=0, for any ε>0\varepsilon>0 there is δ>0\delta>0 with ∣x(t)∣<ε|x(t)| < \varepsilon for t∈(t∗,t∗+δ)t\in (t^*, t^*+\delta). Because xx is continuous and x(t∗)=0x(t^*)=0 while x(t)≠0x(t)\ne0 for t∈(t∗,1]t\in(t^*,1], and because sin⁡(1/x)\sin(1/x) oscillates between −1-1 and 11 infinitely often on every interval (0,ε)(0,\varepsilon), we argue as follows. Pick a strictly decreasing sequence tn→t∗t_n \to t^* (from the right) such that x(tn)=1π/2+2πnx(t_n) = \dfrac{1}{\pi/2 + 2\pi n} (possible: by the Intermediate Value Theorem applied to the continuous function xx on suitable subintervals of (t∗,t∗+δ)(t^*, t^* + \delta), since xx takes values arbitrarily close to 00 there, and xx restricted to (t∗,1](t^*,1] is a continuous real function whose values accumulate at 00, so by IVT it hits every sufficiently small positive value — or its negative — infinitely often as t→t∗+t\to t^{*+}; a symmetric argument handles the case where xx is eventually negative near t∗t^*). Then

y(tn)=sin⁡ ⁣(1x(tn))=sin⁡ ⁣(π2+2πn)=1for all n.y(t_n) = \sin\!\left(\frac{1}{x(t_n)}\right) = \sin\!\left(\frac{\pi}{2} + 2\pi n\right) = 1 \quad \text{for all } n.

Similarly, choose sn→t∗s_n \to t^* with x(sn)=13π/2+2πnx(s_n) = \dfrac{1}{3\pi/2 + 2\pi n}, giving y(sn)=sin⁡(3π/2+2πn)=−1y(s_n) = \sin(3\pi/2 + 2\pi n) = -1 for all nn. Both (tn)(t_n) and (sn)(s_n) converge to t∗t^*, so by continuity of yy at t∗t^*,

y(t∗)=lim⁡n→∞y(tn)=1,y(t∗)=lim⁡n→∞y(sn)=−1,y(t^*) = \lim_{n\to\infty} y(t_n) = 1, \qquad y(t^*) = \lim_{n\to\infty} y(s_n) = -1,

which is a contradiction since 1≠−11 \ne -1. This contradiction shows no path from (0,0)(0,0) to (1,sin⁡1)(1,\sin 1) exists in Sˉ\bar S; hence Sˉ\bar S is connected but not path-connected. The single ingredient that fails is local path-connectedness at points of {0}×[−1,1]\{0\}\times[-1,1]: every neighborhood of such a point, intersected with Sˉ\bar S, contains infinitely many disconnected-looking arcs of SS that a small neighborhood cannot "smooth into" a path-connected piece. This is precisely the missing hypothesis that would force the converse of the Theorem to hold.

Scope, edge cases & common traps

SituationPath-connected?Connected?Note
Rn\mathbb{R}^n, convex setsYesYesstraight-line paths
SnS^n (n≥1n\ge1)YesYesgreat-circle arcs
Topologist's sine curve Sˉ\bar SNoYesthe canonical gap example
Locally path-connected connected space (manifolds, CW complexes)YesYesconverse does hold here
Discrete space with ≥2\ge 2 pointsNoNocomponents = path components = points
Q⊂R\mathbb{Q}\subset\mathbb{R}NoNototally disconnected
Product of path-connected spacesYesYescoordinatewise path construction
Union of two path-connected sets sharing a pointYesYesconcatenate through shared point

The mathematician behind it

Origins · 1 minCamille Jordan (foundational curve/connectivity ideas) and the Topology school of the 1900s–1930s and how this was discovered
CJ
Camille Jordan (foundational curve/connectivity ideas) and the Topology school of the 1900s–1930s
1838–1922 (Jordan); path-connectedness formalized 1900s–1930s · Foundational point-set topology

The precise concept of "path-connectedness" as distinct from "connectedness" crystallized during the systematic axiomatization of topology in the early twentieth century, following Cantor's set theory and Fréchet's metric spaces. Camille Jordan's work on curves (the Jordan Curve Theorem) pushed mathematicians to ask what it means for a shape to be traced by a continuous parametrized path, as opposed to merely being "in one piece." Felix Hausdorff's 1914 book Grundzüge der Mengenlehre gave the first fully general topological space axioms, within which both connectedness and path-connectedness could finally be stated with total precision — and immediately shown to differ, via examples in the spirit of the topologist's sine curve, which circulated among topologists of the Polish and German schools (Kuratowski, Sierpiński) in the 1920s as a standard cautionary example.

History
- 1838–1922: Camille Jordan's lifetime; his curve theorem forces rigorous thought about what a "path" traces out.
- 1895–1901: Poincaré's Analysis Situs papers lay groundwork for algebraic topology, implicitly using path-connected loops.
- 1914: Hausdorff's Grundzüge der Mengenlehre gives the first general axiomatic topological spaces, enabling a clean statement of both connectedness and path-connectedness.
- 1920s: Kuratowski, Sierpiński, and collaborators popularize the topologist's sine curve as the standard example separating the two notions.
- 1930s: Point-set topology matures into the standard textbook form (Alexandroff–Hopf, later Munkres) in which path-connectedness is stated as a prerequisite to defining the Fundamental Group.
Is every connected open subset of Rn\mathbb{R}^n automatically path-connected?

Yes. Every open subset of Rn\mathbb{R}^n is locally path-connected: any open ball is convex, hence path-connected by straight-line segments, and open balls form a neighborhood base at every point. A locally path-connected connected space is always path-connected (stated as a standard corollary strengthening the theorem in this article; the proof shows path components are open, so if there were more than one, they would form a separation, contradicting connectedness). So for domains in Rn\mathbb{R}^n or on manifolds, "connected" and "path-connected" can be used interchangeably — this is exactly why calculus and complex-analysis courses never need to distinguish them.

Can a path revisit the same point twice, or even be constant?

Yes to both. A path is simply required to be a continuous function γ:[0,1]→X\gamma:[0,1]\to X; there is no injectivity requirement. The constant path γ(t)=x0\gamma(t) = x_0 for all tt is a perfectly valid path (used to prove reflexivity of the "joined by a path" relation), and paths that cross themselves, like a figure-eight parametrization, are common and important — the fundamental group is built precisely from loops, paths that revisit their starting point at t=1t=1. If you additionally require injectivity you get an arc, a stronger and less flexible notion.

Are path components always open or always closed?

Neither, in general. In the topologist's sine curve Sˉ\bar S, the path component of (1,sin⁡1)(1,\sin1) is SS itself, which is open in Sˉ\bar S but not closed (its closure adds the segment); the path component of (0,0)(0,0) is {0}×[−1,1]\{0\}\times[-1,1], which is closed in Sˉ\bar S but not open (every neighborhood of (0,0)(0,0) meets SS). If XX is locally path-connected, however, every path component is both open and closed, because each point has a path-connected neighborhood, which must lie entirely within a single path component.

Does path-connectedness pass to closures, the way connectedness does?

No, and this is one of the most important asymmetries between the two notions. If AA is connected and A⊆B⊆A‾A \subseteq B \subseteq \overline A, then BB is connected — this closure-sandwich property fails for path-connectedness. The topologist's sine curve is the exact counterexample: SS is path-connected (it's the continuous image of the interval (0,1](0,1], itself path-connected), S⊆Sˉ⊆S‾S \subseteq \bar S \subseteq \overline{S}, yet Sˉ\bar S is not path-connected. So closures of path-connected sets need not be path-connected.

Is path-connectedness preserved by continuous surjections, quotient maps, or homeomorphisms?

Continuous images of path-connected spaces are always path-connected: if f:X→Yf:X\to Y is continuous and surjective and XX is path-connected, then given y0,y1∈Yy_0,y_1\in Y, pick preimages x0,x1x_0,x_1, join them by a path γ\gamma in XX, and f∘γf\circ\gamma is a path in YY from y0y_0 to y1y_1 (a composite of continuous maps is continuous). This immediately implies homeomorphisms preserve path-connectedness (and hence it is a genuine topological invariant), and it also implies quotient maps preserve it, since quotient maps are continuous surjections.

How does path-connectedness relate to the fundamental group and covering spaces?

The fundamental group π1(X,x0)\pi_1(X,x_0) is defined using loops based at x0x_0, and its isomorphism class (forgetting the basepoint) is only guaranteed to be independent of x0x_0 when XX is path-connected — otherwise different path components can have unrelated, even wildly different, fundamental groups. Covering space theory likewise assumes the base space is path-connected (and usually locally path-connected and semi-locally simply connected) so that the lifting criterion and the classification of coverings by subgroups of π1\pi_1 behave correctly; without path-connectedness the whole classification theorem needs to be run separately, component by component.

Is there a "path-connectedness" analogue for uncountable index sets, like infinite products?

Yes: an arbitrary product ∏α∈AXα\prod_{\alpha \in A} X_\alpha (with the product topology, not the box topology) of path-connected spaces XαX_\alpha is path-connected, by exactly the coordinatewise construction used in Worked Example 2, generalized to infinitely many coordinates. Given points p,qp,q in the product, choose a path γα\gamma_\alpha in each XαX_\alpha from pαp_\alpha to qαq_\alpha, and define Γ(t)=(γα(t))α\Gamma(t) = (\gamma_\alpha(t))_{\alpha}; continuity of Γ\Gamma follows from the universal property of the product topology, which only requires each coordinate projection πα∘Γ=γα\pi_\alpha \circ \Gamma = \gamma_\alpha to be continuous — true by construction, regardless of how large the index set AA is.

Before this

Where this leads