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

Path Connected Spaces

College Depth 74 in the knowledge graph I know this Set as goal
35topics build on this
344prerequisites beneath it
See this on the map →
Connected SpacesHomotopy of Continuous Maps
path-connected connectedness

Core Idea

A space is path-connected if for every two points x,y, there exists a continuous path γ: [0,1] → X with γ(0) = x and γ(1) = y. Path-connected implies connected, but not conversely (topologist's sine curve). Most natural 'nice' spaces that are connected are path-connected; path-connectivity is more intuitive and stronger.

Explainer

From your study of connected spaces, you know that a topological space X is connected if it cannot be written as a disjoint union of two nonempty open sets. Connectedness captures a kind of "oneness" — the space cannot be split apart. But connectedness is defined in purely set-theoretic and topological terms, and it admits some counterintuitive examples. Path-connectedness offers a more geometric, hands-on version of the same intuition: a space is path-connected if you can draw a continuous curve between any two of its points without leaving the space.

Formally, a path from x to y is a continuous function γ: [0, 1] → X with γ(0) = x and γ(1) = y. The interval [0, 1] serves as the parameter domain — think of it as "time." At time 0 you are at x; at time 1 you are at y; at each intermediate time t you are at γ(t), continuously varying. The space X is path-connected if such a path exists for every pair of points. All of ℝⁿ is path-connected: the straight-line path γ(t) = (1−t)x + ty works. Open balls, spheres, and all manifolds you encounter in calculus are path-connected.

The relationship to connectedness is one-directional: path-connected implies connected, but not vice versa. The proof of the implication uses the intermediate value theorem in disguise — a continuous image of the connected space [0, 1] is connected, and if you can path-connect every pair of points, you can show X cannot be split. The classic counterexample to the converse is the topologist's sine curve: the closure of the graph of sin(1/x) for x > 0. This set is connected — it cannot be split into two separated open pieces — but there is no path from a point on the oscillating part to any point on the segment {0} × [−1, 1], because no continuous function can "cross" the accumulation behavior at x = 0.

For the spaces that arise naturally in analysis and geometry — open subsets of ℝⁿ, smooth manifolds, convex sets — path-connectedness and connectedness agree. The distinction matters most in algebraic topology, where path-connectedness is the right notion for defining the fundamental group and homotopy theory: the next topic you will study. Two paths from x to y that can be continuously deformed into each other represent the same "shape of connection," and comparing these shapes is how homotopy captures the topological holes and loops in a space.

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 EquivalencesDe Morgan's LawsNegation of Quantified StatementsProof by ContradictionTopological Spaces: Definition and ExamplesOpen Sets in Topological SpacesConnected SpacesPath Connected Spaces

Longest path: 75 steps · 344 total prerequisite topics

Prerequisites (1)

Leads To (1)