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 78 in the knowledge graph ☐ I know this ☆ Set as goal
18topics build on this
371prerequisites beneath it
See this on the map →
Continuous Functions in Topological SpacesProduct Topology+1 more→→Path Connectedness
homotopy paths

Core Idea

Two paths γ, σ: [0,1] → X with the same endpoints are homotopic if there is a continuous deformation H: [0,1] × [0,1] → X connecting them while keeping endpoints fixed. Homotopy is an equivalence relation on paths.

Explainer

A path in a topological space X is a continuous function γ: [0,1] → X — it traces a journey from the starting point γ(0) to the endpoint γ(1). You already know what continuous functions in topology mean: preimages of open sets are open. Two paths with the same endpoints might take wildly different routes through X. The question homotopy theory asks is: can one path be continuously deformed into the other without lifting the pen from the space and without moving the endpoints?

The formal answer is given by a homotopy: a continuous map H: [0,1] × [0,1] → X satisfying H(s, 0) = γ(s) and H(s, 1) = σ(s) for all s (the "time slices" start at γ and end at σ), and H(0, t) = γ(0) = σ(0) and H(1, t) = γ(1) = σ(1) for all t (the endpoints stay fixed throughout the deformation). Think of the first coordinate s as position along the path and the second coordinate t as time. At time t = 0 you are walking along γ; at time t = 1 you are walking along σ; at intermediate times t you are walking along some intermediate path H(·, t). The product topology on [0,1] × [0,1] — which you know from your prerequisite — is exactly the right structure to make "continuous deformation" precise.

The geometric intuition is that of a rubber band being slid along a surface. If X is the plane ℝ², any two paths with the same endpoints are homotopic: you can always slide one smoothly into the other, because the plane has no obstacles. But if X is the plane with a hole punched out — say ℝ² minus the origin — then a path that loops around the hole cannot be deformed into one that does not loop around it. The hole is an obstruction. This is the heart of algebraic topology: the topological structure of X is detected by asking which paths are homotopic to which others.

Homotopy is an equivalence relation on the set of paths from p to q: it is reflexive (every path is homotopic to itself via the constant deformation), symmetric (run the deformation backwards), and transitive (concatenate the two deformations in time). The equivalence classes under homotopy — called homotopy classes — are the objects that will be combined in the next topic to form the fundamental group. Two spaces that have the same pattern of homotopy classes (in a precise sense) are topologically "the same" from the perspective of path structure. Homotopy of paths is thus not just an isolated definition but the foundation of a powerful invariant for distinguishing topological spaces.

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

Longest path: 79 steps · 371 total prerequisite topics

Prerequisites (3)

Leads To (1)