Past exam of the mathematics course of the University of Cambridge 2007 ib Paper 3 4A a Solution Created 2026-09-24 Updated 2026-09-24
Path component Created 2026-09-24 Updated 2026-10-14
A path component of a topological space is a nonempty subset maximal among its path-connected subsets. The path component through can be described asEvery point along such a continuous path also belongs to : the initial part of the path reaches that point. Thus the paths witnessing membership stay inside . This makes path components useful for deciding which allowed positions can be reached from one another by continuous motion.
Every path component lies inside one connected component, because every path-connected space is connected. Thus each connected component is a union of path components. In a locally path-connected space the two classifications agree, by connected locally path-connected spaces are path-connected. For a subset of the real line with its usual subspace topology, the classifications also agree: every connected component is a real interval, and interpolation supplies a continuous path within it.
The topologist's sine curve shows why the distinction matters in general. Use specifically the closed versionwith the subspace topology from the usual Euclidean plane. It has one connected component, , but two path components, and . The graph of a function is a continuous image of a connected space, and its closure is , so closure of a connected set gives connectedness. Each of is path-connected, but a continuous path crossing from into would force its second coordinate to oscillate between and arbitrarily near its departure time, contradicting continuity; the topologist's sine curve article gives the short argument. Also is not closed in , so path components need not be closed, unlike connected components.[ref]
General Topology by Tom Leinster. p. 78, and the discussion after Lemma C4.12, p. 84: the sine-curve obstruction and nonclosed path components; here the positive graph is restricted to
Being joined by a continuous path is an equivalence relation. Proof outline: the constant path joins a point to itself; reverses a path; and a path from to followed by one from to gives a path from to . For the last construction, run each path on half of ; their values agree at , so the pasting lemma for closed subspaces gives continuity. The equivalence classes are path-connected, are maximal, and form a partition of a set of into path components.[ref]