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 more→→Homotopy 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 Zero → The Number Zero → Counting to Five → Counting to 10 → Counting to 20 → Counting a Set of Objects Up to 20 → Cardinality: The Last Number Counted → Matching Numerals to Quantities → Subitizing Small Quantities → Addition Within 10 → Number Bonds to 10 → Addition Within 20 → Doubles and Near Doubles → Doubles Facts Within 10 → Near Doubles Facts Within 20 → Mental Math Strategies for Addition → Mental Math: Adding and Subtracting Tens → Addition Within 100 → Repeated Addition as Multiplication → Multiplication as Equal Groups → Multiplication: Arrays → Basic Multiplication Facts (0s, 1s, 2s, 5s, 10s) → Multiplication Facts Within 100 → Division as Equal Sharing → Division as Grouping (Measurement Division) → Division: Grouping (Repeated Subtraction) Model → Division: Fair Sharing Model → Division as Equal Sharing → Division as Grouping → Basic Division Facts → Division Facts Within 100 → Multiplication and Division Fact Families → Relationship Between Multiplication and Division → Division Facts as Inverse of Multiplication → Remainders and Quotients in Division → Division Word Problems → Multi-Step Word Problems → Solving Multi-Step Word Problems → Multiplication Word Problems → Division Word Problems → Introduction to Long Division → Factors and Multiples → Prime and Composite Numbers → Equivalent Fractions → Relating Fractions and Decimals → Decimal Place Value → Integers and the Number Line → Comparing and Ordering Integers → Absolute Value → Adding Integers → Subtracting Integers → Multiplying Integers → Introduction to Exponents → Order of Operations → Integer Order of Operations → Variable Expressions → The Distributive Property → Variables and Expressions Review → Introduction to Polynomials → Adding and Subtracting Polynomials → Multiplying Polynomials → Factorial → Permutations → Combinations → Counting Principles: Addition and Multiplication Rules → Introduction to Graph Theory → Propositional Logic Foundations → Logical Equivalences → Set Operations: Union, Intersection, and Complement → Cartesian Products and Relations → Partial Orders → Binary Relations → Equivalence Relations → Topological Spaces: Definition and Examples → Open Sets in Topological Spaces → Neighborhoods and Neighborhood Bases → Continuity in Topological Spaces → Homotopy of Continuous Maps → Homotopy of Paths → Path Connectedness

Longest path: 80 steps · 374 total prerequisite topics

Prerequisites (3)

Leads To (1)