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

Homotopy of Paths

Graduate Depth 80 in the knowledge graph ☐ I know this ☆ Set as goal
16topics build on this
380prerequisites beneath it
See this on the map →
Continuity in Topological SpacesPath Connectedness+1 more→→The Fundamental Group
homotopy homotopic-paths path-deformation

Core Idea

Two paths are homotopic if one can be continuously deformed into the other while keeping endpoints fixed. This is an equivalence relation on paths, and the set of equivalence classes can be given a group structure (under concatenation) when the basepoint is fixed. Homotopy captures the intuition that topologically equivalent deformations preserve path structure.

Explainer

From path-connectedness, you know that a space X is path-connected when any two points can be joined by a continuous path — a continuous map γ: [0, 1] → X with γ(0) = p and γ(1) = q. But path-connectedness only tells you that paths exist; it says nothing about how many "essentially different" paths there are. Homotopy is the tool for measuring that difference. Two paths α, β from p to q are homotopic (rel endpoints) if there exists a continuous map H: [0, 1] × [0, 1] → X such that H(t, 0) = α(t), H(t, 1) = β(t), H(0, s) = p, and H(1, s) = q for all t and s. Think of the second coordinate s as a "deformation parameter": at s = 0 you have the path α; at s = 1 you have the path β; in between, H(−, s) is a continuously varying family of paths, all sharing the same endpoints.

The geometric picture is immediate: imagine drawing two paths between the same two points on a piece of paper. You can always continuously deform one into the other by sliding it across the paper — the plane has no obstacles. Now imagine the same two paths on a surface with a hole (like an annulus, or the punctured plane ℝ² \ {0}). A path that loops around the hole and a path that does not loop around the hole cannot be deformed into each other without passing through the hole. Homotopy detects this topological obstruction. The paths live in the same space but belong to different homotopy classes — equivalence classes under the "can be continuously deformed" relation.

That homotopy is an equivalence relation (reflexive, symmetric, transitive) is a standard verification using the continuity you know from your second prerequisite: identity homotopies, reversals, and compositions of homotopies are all continuous. The deeper payoff is that homotopy classes of loops (paths with γ(0) = γ(1) = basepoint) can be composed by concatenation — traverse α then traverse β — and this composition is well-defined on equivalence classes. The resulting structure is the fundamental group π₁(X, p), the key invariant built in the next topic. The word "group" is justified because the concatenation operation has an identity (the constant loop at p) and inverses (the reverse path), with associativity holding up to homotopy.

The constraint that endpoints stay fixed throughout the deformation is essential and not merely technical. Without fixing endpoints, two paths between different pairs of points could be "homotoped" into each other in a connected space, losing all information. Fixing endpoints ensures homotopy measures how paths differ in their traversal of the space between two fixed points. This is the distinction between a free homotopy (endpoints can wander) and a homotopy rel endpoints, and in the context of the fundamental group, it is always the latter that matters. Every path has a homotopy class; those classes compose; and the resulting group carries deep information about the shape of the space — whether it has holes, handles, or other features that no amount of continuous deformation can remove.

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 → Homotopy of Paths

Longest path: 81 steps · 380 total prerequisite topics

Prerequisites (3)

Leads To (1)