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

Homotopy of Continuous Maps

Graduate Depth 77 in the knowledge graph ☐ I know this ☆ Set as goal
34topics build on this
357prerequisites beneath it
See this on the map →
Continuity in Topological SpacesPath Connected Spaces→→CW ComplexesChain Homotopy and Chain Equivalence+4 more
homotopy algebraic-topology

Core Idea

Maps f, g: X → Y are homotopic if there exists a continuous map H: X × [0,1] → Y with H(x,0) = f(x) and H(x,1) = g(x). Homotopy measures when maps are 'continuously deformable.' Homotopy equivalence is weaker than homeomorphism but strong enough to detect topological structure. Fundamental groups and higher homotopy groups are invariants of homotopy type.

Explainer

You know continuity in the topological sense: a map f: X → Y is continuous if preimages of open sets are open. Homotopy asks a different question — not whether a single map is continuous, but whether two continuous maps can be continuously *deformed* into each other. Think of two rubber-band paths on a surface: can you slide one into the other without leaving the surface? That geometric intuition is exactly what the definition captures.

The formal definition introduces a homotopy H: X × [0, 1] → Y, a continuous map on the product of X with the unit interval. The parameter t ∈ [0, 1] plays the role of "time": at t = 0 you have H(x, 0) = f(x), and at t = 1 you have H(x, 1) = g(x). For each fixed t, the map Hₜ(x) = H(x, t) is a continuous map from X to Y. As t varies from 0 to 1, these maps form a continuous one-parameter family interpolating from f to g. Continuity of H as a whole (on the product space) is what ensures the deformation has no jumps or tears. When such an H exists, f and g are homotopic, written f ≃ g.

Homotopy is an equivalence relation on the set of continuous maps from X to Y — it is reflexive (H(x,t) = f(x) works), symmetric (reverse the parameter: H(x, 1−t)), and transitive (concatenate two homotopies, spending t ∈ [0,½] on the first and t ∈ [½,1] on the second). The equivalence classes are homotopy classes of maps. Two spaces X and Y are homotopy equivalent if there exist maps f: X → Y and g: Y → X such that g∘f ≃ id_X and f∘g ≃ id_Y. This is weaker than homeomorphism — homeomorphism requires a single map to be a perfect bijection with continuous inverse, while homotopy equivalence allows a round trip that deforms but does not tear. A disk and a point are homotopy equivalent (the disk can be continuously contracted to a point), even though they are not homeomorphic.

The importance of homotopy is that it defines invariants: properties preserved by homotopy equivalence that can distinguish spaces. The fundamental group π₁(X, x₀) — the set of homotopy classes of loops based at x₀ — is the first such invariant. A simply connected space has trivial fundamental group (every loop can be contracted to a point); a circle does not (loops that wind around cannot be unlooped). Homotopy thus provides the bridge between topology (continuous structure) and algebra (groups), which is the central program of algebraic topology. Mastering the definition here is the gateway to that entire subject.

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

Longest path: 78 steps · 357 total prerequisite topics

Prerequisites (2)

Leads To (6)