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 ?" 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.
- A path in is a continuous map ; is path-connected if every pair of points is joined by some path.
- Path-connectedness connectedness always; the converse fails, witnessed by the topologist's sine curve.
- Being joined by a path is an equivalence relation on ; 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 is only independent of the choice of basepoint (up to isomorphism) when is path-connected, and the theory of Covering Spaces — used to classify subgroups of 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 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?
Let be a topological space and let carry the standard (Euclidean subspace) topology.
Path. A path in from to is a continuous map
The point is the initial point and the terminal point of .
Path-connectedness. is path-connected if for every pair of points there exists a path in from to . A subset is path-connected if it is path-connected as a subspace.
Relation "joined by a path." Define a relation on by
Path components. The equivalence classes of (shown below to be an equivalence relation) are the path components of . The path component of is denoted .
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 and "belong together," you must produce an actual continuous map from landing on at time and at time . 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 is path-connected, and hence (as we will prove) connected. Now picture a graph like for , together with the limiting segment that the curve wiggles toward but never touches as . 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.
The mathematician behind it
Let be a topological space. If is path-connected, then is connected.
Proof technique: reduction to the connectedness of the interval, via the image of a continuous map.
Step 1: is connected. This is a standard fact (the connectedness of intervals in ), 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 is continuous and is connected, then is connected, since a separation of would pull back (via continuity of ) to a separation of . We use this as a known lemma.
Step 3: main argument. Suppose, for contradiction, that is path-connected but not connected. Then there is a separation
Choose and (possible since both are nonempty). By path-connectedness there is a path with , . Let be the image. By Step 2, is connected, being the continuous image of the connected space (Step 1). Now consider and . These are open in the subspace (as intersections of the open sets with ), they are disjoint (since are disjoint), and
Moreover and , so both are nonempty. Thus form a separation of , contradicting the connectedness of established in Step 2. This contradiction shows no such separation of can exist, i.e. is connected.
∎Let be a topological space. The relation ("there is a path in from to ") is an equivalence relation on .
Proof technique: explicit construction of paths via constant, reversal, and concatenation maps.
Reflexivity. For define by for all (the constant path). This is continuous (constant maps are always continuous) and satisfies . Hence .
Symmetry. Suppose via a path with . Define . The map is continuous , and is continuous, so is continuous as a composite of continuous maps. Also and . Hence .
Transitivity. Suppose via and via , with . Define the concatenation by
This is well-defined at since both formulas give . To check continuity, note is a union of two closed sets, and restricted to each piece is continuous (a composite of the continuous map or 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), is continuous on . Since and , we get . Reflexivity, symmetry, and transitivity together show is an equivalence relation.
∎The path components of (equivalence classes of ) partition . Moreover, each path component is contained in a single connected component of ; that is, the partition into path components refines the partition into connected components.
Proof technique: general equivalence-relation partitioning, plus a direct application of <span class="wiki-link-missing">Path-Connectedness Implies Connectedness</span>. Since is an equivalence relation (previous Lemma), its equivalence classes partition : this is the standard fact that equivalence classes of any equivalence relation are pairwise disjoint and cover the whole set, because 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 . As a subspace, is path-connected: given , both are , so by symmetry and transitivity , and the path witnessing this can be taken to have image in (if is a path from to in , every point satisfies by restricting to and reparametrizing, so ; hence actually maps into , and remains continuous into the subspace by the universal property of the subspace topology). So , with the subspace topology, is path-connected. By the Theorem, is therefore connected as a subspace of . A connected subspace of is always contained in a single connected component of (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 lies inside the connected component of containing .
∎Worked examples
Example 1: The comb space is path-connected but shows how fragile the property can be under removing a point. Let
the union of the vertical segment at , vertical "teeth" at , and the horizontal base segment, with the subspace topology from . Claim: is path-connected. Take any two points . Each point of lies either on the base or on a tooth or on the limit segment . Construct a path from to in three (or fewer) straight-line stages, each an explicit continuous map: 1. From move straight down to along : the map for is continuous (each coordinate is a polynomial in , hence continuous, and continuity into a product/subspace is checked coordinatewise), and its image lies in since is one of the teeth-or-base -values, wait — more carefully: since , the vertical fiber is entirely contained in whenever or ; if instead lies on the base itself () this step is trivial (constant path). 2. Travel along the base from to : the map , , is continuous and its image lies in the base . 3. From move straight up to along , by the same reasoning as step 1. Concatenating (reparametrized to exactly as in the transitivity proof above, extended to three pieces by the same pasting-lemma argument) gives a single continuous path from to in . Hence is path-connected. Note the subtlety: this construction crucially uses that every tooth, including the limiting one at , is a full vertical segment attached to the base. If one deletes even a single point of the base — say removes but keeps the rest of — 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 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 (the unit circle, with its subspace topology from , known to be path-connected via ) and let with the subspace topology from (path-connected via straight-line paths for , since is convex). We verify directly, without quoting a general product theorem as a black box, that is path-connected, to display the mechanism. Take two points and in (writing points of as ). Since is path-connected, fix a path with , — explicitly works (continuous since is continuous and is continuous). Since is path-connected, fix , a straight-line path in from to (valid because is convex, so the segment stays inside ). Define by
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 are each continuous, is continuous. Also and . So is a path from to in . Since were arbitrary, is path-connected. This exact coordinatewise construction generalizes verbatim to any product 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.
The Theorem shows path-connected 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
both with the subspace topology from . We claim is connected but not path-connected, and not locally path-connected at any point of .
is connected. The set is the image of the connected set under the continuous map , hence is connected (continuous images of connected sets are connected). A standard fact about connectedness states: if is connected and (closure taken in the ambient space), then is connected. Here one checks : for any , choose with , and let ; then , so is a limit point of . Hence satisfies , so is connected.
is not path-connected. Suppose, for contradiction, is a path with and . Write ; both coordinate functions are continuous (), since projections are continuous and composites of continuous maps are continuous. Let . This is nonempty () and closed (preimage of the closed set under the continuous map ). Let ; since is closed and bounded, , so , meaning . Since has nonzero first coordinate, . By definition of as the supremum, for every we have , i.e. , so . We now derive a contradiction by exploiting continuity of at together with the wild oscillation of as . Since is continuous at with , for any there is with for . Because is continuous and while for , and because oscillates between and infinitely often on every interval , we argue as follows. Pick a strictly decreasing sequence (from the right) such that (possible: by the Intermediate Value Theorem applied to the continuous function on suitable subintervals of , since takes values arbitrarily close to there, and restricted to is a continuous real function whose values accumulate at , so by IVT it hits every sufficiently small positive value — or its negative — infinitely often as ; a symmetric argument handles the case where is eventually negative near ). Then
Similarly, choose with , giving for all . Both and converge to , so by continuity of at ,
which is a contradiction since . This contradiction shows no path from to exists in ; hence is connected but not path-connected. The single ingredient that fails is local path-connectedness at points of : every neighborhood of such a point, intersected with , contains infinitely many disconnected-looking arcs of 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
| Situation | Path-connected? | Connected? | Note |
|---|---|---|---|
| , convex sets | Yes | Yes | straight-line paths |
| () | Yes | Yes | great-circle arcs |
| Topologist's sine curve | No | Yes | the canonical gap example |
| Locally path-connected connected space (manifolds, CW complexes) | Yes | Yes | converse does hold here |
| Discrete space with points | No | No | components = path components = points |
| No | No | totally disconnected | |
| Product of path-connected spaces | Yes | Yes | coordinatewise path construction |
| Union of two path-connected sets sharing a point | Yes | Yes | concatenate 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
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.
Is every connected open subset of automatically path-connected?
Yes. Every open subset of 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 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 ; there is no injectivity requirement. The constant path for all 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 . 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 , the path component of is itself, which is open in but not closed (its closure adds the segment); the path component of is , which is closed in but not open (every neighborhood of meets ). If 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 is connected and , then is connected — this closure-sandwich property fails for path-connectedness. The topologist's sine curve is the exact counterexample: is path-connected (it's the continuous image of the interval , itself path-connected), , yet 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 is continuous and surjective and is path-connected, then given , pick preimages , join them by a path in , and is a path in from to (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 is defined using loops based at , and its isomorphism class (forgetting the basepoint) is only guaranteed to be independent of when 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 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 (with the product topology, not the box topology) of path-connected spaces is path-connected, by exactly the coordinatewise construction used in Worked Example 2, generalized to infinitely many coordinates. Given points in the product, choose a path in each from to , and define ; continuity of follows from the universal property of the product topology, which only requires each coordinate projection to be continuous — true by construction, regardless of how large the index set is.