Tutorials › Topology (Undergraduate) › Homotopy Equivalence Is an Equivalence Relation

Homotopy of Maps and Paths · Tutorial 662 of 799

Homotopy Equivalence Is an Equivalence Relation

Learn how to build homotopy inverses for identity, reversed, and composite equivalences, with explicit homotopies in each case.

Advanced 10 min read

What You'll Learn

  • State homotopy equivalence using maps and homotopies to identity maps
  • Verify reflexivity with identity maps and constant-in-time homotopies
  • Obtain symmetry by reversing the roles of a homotopy inverse pair
  • Compose homotopy inverses in the correct order for transitivity
  • Concatenate homotopies and check their endpoints and continuity
  • Identify common errors involving map domains and equality versus homotopy

Homotopy Equivalence as a Relation

A homotopy equivalence does not require two spaces to have inverse maps whose composites are exactly identity maps. Instead, those composites need only be homotopic to the identities. This distinction matters when proving that homotopy equivalence is transitive: the inverse maps must be composed in the right order, and the homotopies must then be joined with matching endpoints.

Throughout, all products with \(I=[0,1]\) have the product topology. A homotopy between continuous maps \(a,b:X\to Y\) is a continuous map \(H:X\times I\to Y\) such that \(H(x,0)=a(x)\) and \(H(x,1)=b(x)\) for every \(x\in X\). We write \(a\simeq b\). The identity map on \(X\) is \(\operatorname{id}_X\).

Definition: Topological spaces \(X\) and \(Y\) are homotopy equivalent if there are continuous maps \(f:X\to Y\) and \(g:Y\to X\) such that \(g\circ f\simeq\operatorname{id}_X\) and \(f\circ g\simeq\operatorname{id}_Y\). In this case, \(g\) is a homotopy inverse of \(f\), and \(f\) is a homotopy inverse of \(g\).

Each direction in the definition is required: one composite is a map from \(X\) to \(X\), and the other is a map from \(Y\) to \(Y\). The maps \(f\) and \(g\) need not be inverse maps in the strict sense that both composites equal identity maps.

Two Facts About Homotopies

We will use two elementary constructions. First, a homotopy can be composed with continuous maps on either side. More precisely, if \(H:a\simeq b\), \(\alpha:X'\to X\) is continuous, and \(\beta:Y\to Y'\) is continuous, then \(\beta\circ a\circ\alpha\simeq\beta\circ b\circ\alpha\). A homotopy is given by \((x',t)\mapsto\beta(H(\alpha(x'),t))\). This map is continuous because it is a composition of continuous maps, using the product topology on \(X'\times I\).

Second, homotopies can be concatenated when the ending map of the first is the starting map of the second. If \(H:a\simeq b\) and \(K:b\simeq c\), define

$$ J(x,t)= \begin{cases} H(x,2t), & 0\le t\le \frac12,\\ K(x,2t-1), & \frac12\le t\le 1. \end{cases} $$

At \(t=\frac12\), the first formula gives \(H(x,1)=b(x)\), and the second gives \(K(x,0)=b(x)\), so the formulas agree. Each formula is continuous on its closed part of \(X\times I\). The finite closed pasting lemma says that functions continuous on finitely many closed subsets covering a space combine to a continuous function if they agree on overlaps. Thus \(J\) is continuous, with \(J(x,0)=a(x)\) and \(J(x,1)=c(x)\); hence \(a\simeq c\). This gives the precise way we will join the homotopies below.

The Equivalence-Relation Theorem

Theorem: Homotopy equivalence is an equivalence relation on the topological spaces under consideration: it is reflexive, symmetric, and transitive.

Proof. Reflexivity. For any space \(X\), choose \(f=g=\operatorname{id}_X\). Both composites are \(\operatorname{id}_X\). The map \(H:X\times I\to X\) defined by \(H(x,t)=x\) is continuous, since it is the projection onto \(X\), and satisfies \(H(x,0)=H(x,1)=x\). Thus both required homotopies hold. If \(X=\varnothing\), the same map is the unique map from \(\varnothing\times I\), so the argument also covers the empty space.

Symmetry. Suppose \(X\) is homotopy equivalent to \(Y\), witnessed by \(f:X\to Y\) and \(g:Y\to X\), with \(g\circ f\simeq\operatorname{id}_X\) and \(f\circ g\simeq\operatorname{id}_Y\). To witness that \(Y\) is homotopy equivalent to \(X\), use \(g\) as the map from \(Y\) to \(X\) and \(f\) as the map from \(X\) to \(Y\). The two required composites are \(f\circ g\) on \(Y\) and \(g\circ f\) on \(X\), and the given homotopies verify them. Therefore the relation is symmetric.

Transitivity. Suppose \(X\) is homotopy equivalent to \(Y\), with maps \(f:X\to Y\) and \(g:Y\to X\), and \(Y\) is homotopy equivalent to \(Z\), with maps \(u:Y\to Z\) and \(v:Z\to Y\). Choose homotopies \(H:g\circ f\simeq\operatorname{id}_X\), \(K:f\circ g\simeq\operatorname{id}_Y\), \(L:v\circ u\simeq\operatorname{id}_Y\), and \(M:u\circ v\simeq\operatorname{id}_Z\). We claim that \(u\circ f:X\to Z\) and \(g\circ v:Z\to X\) are homotopy inverses.

For the composite on \(X\), first use \(L\), with \(f\) before it and \(g\) after it. The resulting homotopy is \(P(x,t)=g(L(f(x),t))\), from \(g\circ v\circ u\circ f\) to \(g\circ f\). Follow it by \(H\), which goes from \(g\circ f\) to \(\operatorname{id}_X\). The endpoints match, so concatenation gives \((g\circ v)\circ(u\circ f)\simeq\operatorname{id}_X\).

For the composite on \(Z\), use \(K\) with \(v\) before it and \(u\) after it. This gives \(Q(z,t)=u(K(v(z),t))\), from \(u\circ f\circ g\circ v\) to \(u\circ v\). Follow it by \(M\), from \(u\circ v\) to \(\operatorname{id}_Z\). Concatenating gives \((u\circ f)\circ(g\circ v)\simeq\operatorname{id}_Z\). Both composites therefore satisfy the definition of homotopy equivalence, proving transitivity. \(\square\)

Worked Constructions

Worked Example: Reflexivity on the Unit Interval

Let \(X=[0,1]\) with its standard subspace topology from \(\mathbb{R}\). Take \(f=g=\operatorname{id}_X\). The two composites are both \(\operatorname{id}_X\), and the homotopy \(H(x,t)=x\) verifies each required homotopy. For instance, with \(x=3/7\) and \(t=2/3\), the value is \(H(3/7,2/3)=3/7\); at \(t=0\) and \(t=1\), it is still \(3/7\). The map is continuous because it is the projection from \(X\times I\) to \(X\). Thus \(X\) is homotopy equivalent to itself.

Worked Example: A Homotopy Inverse Pair on Two Discrete Spaces

Give \(X=\{a,b\}\) and \(Y=\{r,s\}\) the discrete topologies, in which every subset is open. Define \(f:X\to Y\) by \(f(a)=r\), \(f(b)=s\), and \(g:Y\to X\) by \(g(r)=a\), \(g(s)=b\). Every map with a discrete domain is continuous, because the preimage of every open set is a subset of the domain and therefore open.

Computing the composites point by point gives \((g\circ f)(a)=g(r)=a\) and \((g\circ f)(b)=g(s)=b\), so \(g\circ f=\operatorname{id}_X\). Also \((f\circ g)(r)=f(a)=r\) and \((f\circ g)(s)=f(b)=s\), so \(f\circ g=\operatorname{id}_Y\). Constant-in-time homotopies verify these equalities: on \(X\), use \(H(x,t)=x\), and on \(Y\), use \(K(y,t)=y\). These maps are continuous as projections. Hence \(f\) and \(g\) are homotopy inverses, with the stronger fact that their composites are exactly identities.

Check: applying the computed composites to \(a\) returns \(a\), and applying them to \(b\) returns \(b\); on \(Y\), they return \(r\) and \(s\), respectively. Each endpoint calculation agrees with the claimed identity maps.

Worked Example: Homotopy Inverses Need Not Be Exact Inverses

Give \(I=[0,1]\) its standard topology, and define \(f:I\to I\) and \(g:I\to I\) by \(f(x)=0\) and \(g(y)=0\). These constant maps are continuous. Their composites are both constant at zero: \((g\circ f)(x)=g(0)=0\), and \((f\circ g)(y)=f(0)=0\). In particular, at \(x=3/5\), \((g\circ f)(3/5)=0\), which is not \(\operatorname{id}_I(3/5)=3/5\).

Nevertheless, define \(H(x,t)=tx\). This is continuous, with \(H(x,0)=0=(g\circ f)(x)\) and \(H(x,1)=x=\operatorname{id}_I(x)\). The same formula, with input \(y\), gives a homotopy from \(f\circ g\) to \(\operatorname{id}_I\). As a numerical check, \(H(3/5,1/4)=(1/4)(3/5)=3/20\); the endpoint values are \(H(3/5,0)=0\) and \(H(3/5,1)=3/5\). Thus the constant maps are homotopy inverses even though neither composite equals the identity.

Worked Example: Transitivity for Three Intervals

Let \(X=[0,1]\), \(Y=[0,2]\), and \(Z=[0,3]\), each with the standard subspace topology from \(\mathbb{R}\). Define \(f:X\to Y\) by \(f(x)=2x\), \(g:Y\to X\) by \(g(y)=y/2\), \(u:Y\to Z\) by \(u(y)=3y/2\), and \(v:Z\to Y\) by \(v(z)=2z/3\). These affine maps are continuous. Direct calculation gives \(g(f(x))=(2x)/2=x\) and \(f(g(y))=2(y/2)=y\). It also gives \(v(u(y))=(2/3)(3y/2)=y\) and \(u(v(z))=(3/2)(2z/3)=z\). Thus each pair is an exact inverse pair.

The composite maps from \(X\) to \(Z\) and back are \(u(f(x))=(3/2)(2x)=3x\) and \(g(v(z))=(2z/3)/2=z/3\). Their composites are \((g\circ v)(u(f(x)))=(3x)/3=x\) and \((u\circ f)(g(v(z)))=3(z/3)=z\). Constant-in-time homotopies verify these identities. For a numerical check, take \(x=2/5\): \(u(f(2/5))=u(4/5)=6/5\), and \(g(v(6/5))=g(4/5)=2/5\). Starting instead with \(z=9/5\), \(g(v(9/5))=g(6/5)=3/5\), and \(u(f(3/5))=u(6/5)=9/5\). The composites are identity maps, so these endpoint checks agree with the formulas on the whole intervals.

Composition Order and a Common Pitfall

The transitivity proof depends on types as well as formulas. Starting with \(x\in X\), the map \(f\) sends \(x\) to \(Y\), then \(u\) sends it to \(Z\). Thus the map from \(X\) to \(Z\) is \(u\circ f\), not \(f\circ u\). In the reverse direction, \(v\) first sends \(z\in Z\) to \(Y\), and \(g\) then sends that point to \(X\), so the map is \(g\circ v\).

Common pitfall. One might write \(v\circ g\) as the reverse composite. But \(g\) has output in \(X\), while \(v\) accepts inputs in \(Z\); the composition \(v\circ g\) is not defined for the interval maps in the preceding example, because \(X=[0,1]\) and \(Z=[0,3]\) are different domains for the next map. The valid composite is \(g\circ v\). It sends \(z\in[0,3]\) to \(v(z)=2z/3\in[0,2]\), then to \(g(2z/3)=z/3\in[0,1]\). A correct transitivity argument must verify both that each composite is defined and that it has the required domain and codomain.

There is a second, related error: replacing “homotopic to the identity” with “equal to the identity.” The constant-map example shows why this is not permitted. At \(x=3/5\), the composite has value \(0\), not \(3/5\), yet the displayed homotopy verifies the definition. In transitivity, the composite homotopies need not become equalities; they are joined because the ending map of one homotopy is exactly the starting map of the next.

The three properties proved here let us use homotopy equivalence consistently as a relation: every space belongs to its own class, an equivalence can be read in either direction, and equivalences can be chained. The transitive construction also gives a practical method: compose the forward maps in forward order, compose the inverse maps in reverse order, and check the two composite homotopies separately.

Check Your Understanding

For each question, keep track of the domain and codomain of every map as well as the endpoints of each homotopy.

  1. Write down the maps that witness reflexivity of a topological space \(X\), and specify the homotopy for each composite.
  2. If \(f:X\to Y\) and \(g:Y\to X\) are homotopy inverses, which maps witness that \(Y\) is homotopy equivalent to \(X\)?
  3. Suppose \(f:X\to Y\), \(g:Y\to X\), \(u:Y\to Z\), and \(v:Z\to Y\) are the maps in the transitivity proof. State the proposed maps from \(X\) to \(Z\) and from \(Z\) to \(X\).
  4. In the homotopy \(P(x,t)=g(L(f(x),t))\), identify the maps at \(t=0\) and \(t=1\).
  5. Why does the concatenation of two homotopies require their middle endpoint maps to agree, and how is continuity at the joining time ensured?