A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

Path Connectedness

Graduate Depth 79 in the knowledge graph I know this Set as goal
17topics build on this
374prerequisites beneath it
See this on the map →
Connectedness: Definition and ExamplesContinuous Functions in Topological Spaces+1 moreHomotopy of Paths
path-connectedness paths arcs

Core Idea

A space is path-connected if any two points can be joined by a continuous path (image of a continuous map from [0,1]). Path-connectedness implies connectedness but not conversely. It provides a more intuitive and constructive notion of connectedness amenable to algebraic topology.

Explainer

You already know that a topological space is connected if it cannot be split into two disjoint nonempty open sets. That is a "global" condition — it says the space has no partition of a certain kind. Path-connectedness gives a "local-to-global" version that is often easier to work with and closer to geometric intuition: a space X is path-connected if for every pair of points p, q ∈ X, there exists a continuous function γ : [0, 1] → X with γ(0) = p and γ(1) = q. The function γ is called a path from p to q. The image γ([0, 1]) is a continuous arc connecting the two points within X.

The interval [0, 1] is the standard parameter space for paths because it is compact, connected, and conveniently normalizes endpoints to 0 and 1. A path is not a route — it is a function, so it can double back on itself, slow down, or even be constant. What matters is continuity: no teleportation allowed. Any two points in ℝⁿ can be joined by a straight-line path γ(t) = (1−t)p + tq, so ℝⁿ is path-connected. Any convex set is path-connected for the same reason. Most spaces you have intuition for — spheres, tori, circles — are path-connected.

Path-connectedness implies connectedness, but the converse fails. The classic counterexample is the topologist's sine curve: the closure of the graph of sin(1/x) for x > 0. This set is connected — you cannot separate it into two open pieces — but it is not path-connected because no continuous path can cross from the oscillating part to the limit segment on the y-axis. The oscillation becomes infinitely rapid as x → 0, preventing any path from reaching the y-axis without "jumping." This example shows that connectedness is a weaker condition, and path-connectedness is the right hypothesis when you need to actually construct a path between points.

Path-connectedness is the entry point to algebraic topology because paths compose. If γ₁ goes from p to q and γ₂ goes from q to r, then concatenating them gives a path from p to r (reparametrize so γ₁ runs over [0, 1/2] and γ₂ over [1/2, 1]). The set of paths in a space, up to continuous deformation, organizes into algebraic structures — the fundamental group being the first. This is why path-connectedness is a prerequisite to homotopy theory: before asking how paths deform, you need to know paths exist between any two points.

Practice Questions 5 questions

Prerequisite Chain

Understanding ZeroThe Number ZeroCounting to FiveCounting to 10Counting to 20Counting a Set of Objects Up to 20Cardinality: The Last Number CountedMatching Numerals to QuantitiesSubitizing Small QuantitiesAddition Within 10Number Bonds to 10Addition Within 20Doubles and Near DoublesDoubles Facts Within 10Near Doubles Facts Within 20Mental Math Strategies for AdditionMental Math: Adding and Subtracting TensAddition Within 100Repeated Addition as MultiplicationMultiplication as Equal GroupsMultiplication: ArraysBasic Multiplication Facts (0s, 1s, 2s, 5s, 10s)Multiplication Facts Within 100Division as Equal SharingDivision as Grouping (Measurement Division)Division: Grouping (Repeated Subtraction) ModelDivision: Fair Sharing ModelDivision as Equal SharingDivision as GroupingBasic Division FactsDivision Facts Within 100Multiplication and Division Fact FamiliesRelationship Between Multiplication and DivisionDivision Facts as Inverse of MultiplicationRemainders and Quotients in DivisionDivision Word ProblemsMulti-Step Word ProblemsSolving Multi-Step Word ProblemsMultiplication Word ProblemsDivision Word ProblemsIntroduction to Long DivisionFactors and MultiplesPrime and Composite NumbersEquivalent FractionsRelating Fractions and DecimalsDecimal Place ValueIntegers and the Number LineComparing and Ordering IntegersAbsolute ValueAdding IntegersSubtracting IntegersMultiplying IntegersIntroduction to ExponentsOrder of OperationsInteger Order of OperationsVariable ExpressionsThe Distributive PropertyVariables and Expressions ReviewIntroduction to PolynomialsAdding and Subtracting PolynomialsMultiplying PolynomialsFactorialPermutationsCombinationsCounting Principles: Addition and Multiplication RulesIntroduction to Graph TheoryPropositional Logic FoundationsLogical EquivalencesSet Operations: Union, Intersection, and ComplementCartesian Products and RelationsPartial OrdersBinary RelationsEquivalence RelationsTopological Spaces: Definition and ExamplesOpen Sets in Topological SpacesNeighborhoods and Neighborhood BasesContinuity in Topological SpacesHomotopy of Continuous MapsHomotopy of PathsPath Connectedness

Longest path: 80 steps · 374 total prerequisite topics

Prerequisites (3)

Leads To (1)