Romyar SharifiLECTURE NOTES
READING EDITIONPDF

LECTURE NOTES / Chapter 5

Point-Set Topology

Romyar Sharifi

Chapter 5 Homotopy theory

Book contents

Chapter 5
Homotopy theory

5.1. Path homotopies

Recall that a path on a topological space X is a continuous function γ : [0,1] X.

Definition 5.1.1.

Let X be a space and a,b X. Let γ and γ be paths in X from a to b. A path homotopy from γ to γ is a continuous function F : [0,1]2 X from γ to γ such that

F (s,0) = γ(s) and F (s,1) = γ(s)

for all s [0,1] and

F (0,t) = a and F (1,t) = b

for all t [0,1].

Example 5.1.2.

Consider the two paths γ,γ from (1,0) to (1,0) in given by γ(s) = e𝜋𝑖𝑠 and γ(s) = e𝜋𝑖𝑠. We have a path homotopy between them given by F (s,t) = cos(𝜋𝑠)+i(12t)sin(𝜋𝑠). However, no such path homotopy exists in {0}, the idea being that for any path homotopy F, there must exist a t such that the path γt(s) = F (s,t) for s [0,1] passes through 0. This may be intuitively clear, but it takes some work to show.

Definition 5.1.3.

We say that two paths γ,γ in X from a point a to a point b are path homotopic if there exists a path homotopy from γ to γ.

Notation 5.1.4.

We write γ γ if two paths with the same endpoints are path homotopic.

Proposition 5.1.5.

The relation of path homotopy on the set Π(X,a,b) of paths with fixed endpoints a,b X forms an equivalence relation.

Proof.

If γ Π(X,a,b), then the map F : [0,1]2 X given by F (s,t) = γ(s) for all s,t [0,1] is a path homotopy from γ to itself, so is reflective. If γΠ(X,a,b) with γ γ and F : [0,1]2 X is a path homotopy from γ to γ, then G(s,t) = F (s,1t) is a path homotopy from γ to γ, so γ γ. Thus, is symmetric. Finally, if γ Π(X,a,b) as well and we have both γ γ and γ γ, with F a path homotopy from γ to γ and G a path homotopy from γ to γ, then H : [0,1]2 X defined by

H(s,t) = { F (s,2t) t [0,12], G(s,2t 1)t [12,1]

is a path homotopy from γ to γ, so is transitive. To see this, one should note that F (s,1) = γ(s) = G(s,0) for all s [0,1].

Notation 5.1.6.

Let π1(X,a,b) denote the set of path homotopy classes of paths on X from a to b. We write [γ] for the path homotopy class of a path γ.

Definition 5.1.7.

If γ Π(X,a,b) and μ Π(X,b,c), we define the composition of γ and μ to be the path γ μ Π(X,a,c) given by

(γμ)(s) = { γ(2s) s [0,12], μ(2s1)s [12,1].

If one replaces γ,μ with path homotopic paths, the result of composition is path homotopic to γ μ.

Proposition 5.1.8.

Let γ,γΠ(X,a,b) and μ,μΠ(X,b,c) with γ γ and μ μ. Then γ μ γμ.

Proof.

Let F be a path homotopy from γ to γ and G be a path homotopy from μ to μ. Define H : [0,1]2 X by

H(s,t) = { F (2s,t) s [0,12], G(2s1,t)s [12,1]

for s,t [0,1]. Then H is a path homotopy from γ μ to γμ. For this, one should note that F (1,t) = b = G(0,t) for all t [0,1].

Remark 5.1.9.

By Proposition 5.1.8, composition of paths induces product maps

π1(X,a,b)×π1(X,b,c) π1(X,a,c),

and we have [γ][μ] = [γ μ] under these products.

5.2. The fundamental group

Let us briefly explore the properties of the products that we have constructed on paths and their path homotopy classes.

Notation 5.2.1.

a.

For a X, let ea Π(X,a,a) denote the constant path ea(s) = a for s [0,1].

b.

For a,b X and γ Π(X,a,b), let γ~ Π(X,b,a) denote the reversed path γ~(s) = γ(1s) for s [0,1].

Remark 5.2.2.

If γ Π(X,a,b) and μ Π(X,b,c), then γ μ~ = μ~γ~.

We check some useful path homotopy relations among compositions of paths.

Lemma 5.2.3.

Let γ Π(X,a,b) with a,b X.

a.

If γΠ(X,a,b) with γ γ, then γ~ γ~.

b.

We have eaγ γ γ eb,

c.

We have γ γ~ ea and γ~γ eb.

d.

If μ Π(X,b,c) and ν Π(X,c,d) for some c,d X, then (γ μ)ν γ (μ ν).

Proof.

a.

If F is a homotopy from γ to γ, then we define G: [0,1]2 X by

G(s,t) = F (1s,t),

and this is a homotopy from γ~ to γ~.

b.

Define Fa: [0,1]2 X by

Fa(s,t) = { a s [0, 1t 2 ], γ(2s1+t 1+t )s [1t 2 ,1].

Note that for s = 1t 2 , the second case yields γ(0) = a, so we have continuity. We then check that Fa(s,0) = a = ea(2s) for s [0, 1 2] while Fa(s,0) = γ(2s1) for s [12,1], so Fa(s,0) = (eaγ)(s) for all s [0,1]. We also have Fa(s,1) = γ(s) for all s [0,1] and Fa(0,t) = a and Fa(1,t) = γ(1) = b for all t [0,1]. Thus Fa is a path homotopy from eaγ to γ.

If we replace γ by γ~, we get ebγ~ γ~, and then

γ eb = ebγ~~ γ~~ = γ.
c.

Define H : [0,1]2 X by

H(s,t) = { γ(2s(1t)) s [0,12], γ((22s)(1t))s [12,1].

The H is a path homotopy from γ γ~ to ea. We have γ~γ eb by replacing γ by γ~.

d.

Define I : [0,1]2 X by

I(s,t) = { γ(4(1+t)1s) s [0,14(1+t)], μ(4s1t) s [14(1+t),14(2+t)], ν((2t)1(4s2t))s [14(2+t),1].

We leave it to the reader to check that I is a path homotopy from (γ μ)ν to γ (μ ν).

Definition 5.2.4.

A loop in a topological space X based at a point a X is a path in X from a to a. The point a is called the basepoint of the loop.

Notation 5.2.5.

For a X, we set Π(X,a) = Π(X,a,a) and π1(X,a) = π1(X,a,a).

If we restrict our product maps on set of path homotopies to loops based at a point x0 X, we obtain an operation on the classes of paths

π1(X,x0)×π1(X,x0) π1(X,x0).

This operation makes π1(X,x0) into what is known as a group.

Definition 5.2.6.

A group G is a set together with an operation G×G G such that

i.

(ab)c = a(bc) for all a,b,c G,

ii.

there exists an identity element e G such that ea = a = ae for all a G, and

iii.

for every a G, there exists an inverse element a1 G such that aa1 = e.

Here are just a few interesting groups.

Examples 5.2.7.

a.

The integers with the operation + forms a group. In this group, e = 0 and the inverse of a is a.

b.

The nonzero real numbers {0} together with the operation forms a group. In it, e = 1 and the inverse of a is a1.

c.

Given a set X, the set SX of bijections f : X X forms a group with respect to the operation of composition. In it, the identity element is idX and the inverse of a bijection f is its inverse function f1.

Proposition 5.2.8.

For any x0 X, the set π1(X,x0) is a group under the operation induced by composition of paths.

Proof.

The operation in question is given on the classes of loops γ,μ Π(X,x0) by [γ][μ] = [γ μ]. That this makes G into a group follows from the various parts of Lemma 5.2.3: that is, the operation is associative by part d, the identity element is [ea] by part b, and the inverse of [γ] is [γ~] by part c.

Definition 5.2.9.

The fundamental group of a space X relative to a basepoint x0 X is the group π1(X,x0) together with the operation induced by composition of paths.

One might ask how the fundamental group depends upon the choice of basepoint. For this, we need a notion of equivalence among groups. Such an equivalence should be a bijection that respects the operation on its domain and codomain. A function between groups that respects these operations is called a homomorphism.

Definition 5.2.10.

A function f : G G of groups is a homomorphism from the group G to the group G if f(ab) = f(a)f(b) for all a,b G.

Note that in the latter definition, the operation on the left is the operation on G and the operation on the ring is the operation on G.

Examples 5.2.11.

a.

For any group G, the constant map taking value the identity of a group is a homomorphism called a trivial homomorphism.

b.

For n , the map n: given by multiplication by n is a homomorphism. It is trivial if n = 0.

Definition 5.2.12.

A homomorphism from G to G is an isomorphism if it is a bijection.

Lemma 5.2.13.

If f : G G is an isomorphism of groups, then so is the inverse function f1: G G.

Proof.

Since f is a bijection, its inverse f1 is as well. We must show that f1 is a homomorphism. Let a,b G, and note that there exist unique a,b G with f(a) = a and f(b) = b. We then have

f1(ab) = f1(f(a)f(b)) = f1(f(ab)) = ab.

Example 5.2.14.

The function exp: >0 given by exp(x) = ex is an isomorphism from the real numbers with the operation of addition to the positive real numbers with the operation of multiplication. That is, it is clearly bijective, and we have ea+b = eaeb for a,b . Its inverse is the logarithm function log: >0 .

Definition 5.2.15.

We say that two groups G and G are isomorphic if there exists an isomorphism f : G G, in which case we write 𝐺≅G.

There is no such thing as the set of all groups, as it is too large. However, the following still makes sense.

Proposition 5.2.16.

The relation is an equivalence relation on any set of groups.

Proof.

Let G, H and K be groups. Then 𝐺≅𝐺 via the identity map. If 𝐺≅𝐻, then 𝐻≅𝐺 by Lemma 5.2.13. If 𝐺≅𝐻 and 𝐻≅𝐾, then we have isomorphisms f : G H and f: H K. Then ff is still a bijection, and f(f(ab)) = f(f(a)f(b)) = f(f(a))f(f(b)) for a,b G, so ff is a homomorphism as well, and therefore 𝐺≅𝐾.

So, we can now answer our question regarding fundamental groups relative to different basepoints.

Proposition 5.2.17.

The fundamental groups π1(X,x0) and π1(X,x1) of a space X relative to basepoints x0 and x1 are isomorphic if there exists a path λ in X from x0 to x1. Explicitly, the isomorphism ψλ: π1(X,x0) π1(X,x1) determined by λ is

ψλ([γ]) = [λ~][γ][λ].
Proof.

Let λ : [0,1] X be a path with λ(0) = x0 and λ(1) = x1. Define a map

Π(X,x0) Π(X,x1),γ(λ~γ)λ

for γ Π(X,x0). If γ γ, then (λ~γ)λ (λ~γ)λ, so this map induces the function ψλ. This is a bijection since it has an inverse induced by μ(λ μ)λ~. It is then an isomorphism, since

ψλ([γγ]) = [λ~][γγ][λ] = [λ~][γ][γ][λ] = [λ~][γ][λ][λ~][γ][λ] = ψ λ([γ])ψλ([γ]).

Terminology 5.2.18.

We call ψλ as in Lemma 5.2.17 conjugation by the path λ.

Remark 5.2.19.

When X is path connected, we often refer to the fundamental group of X to mean the fundamental group relative to some basepoint, since all choices are isomorphic.

Remark 5.2.20.

The isomorphism we constructed in the proof of Proposition 5.2.17 depends on the choice of a path from one basepoint to another. It is not in general unique, nor is it even necessarily the identity if the two points are the same.

Definition 5.2.21.

A space X is simply connected if it is path connected and π1(X,x0) is the trivial group for some (equivalently, all) x0 X.

Lemma 5.2.22.

If X is a simply connected space and a,b X, then any two paths in X from a to b are path homotopic.

Proof.

Let γ,γΠ(X,a,b). Then γ1 γΠ(X,a). Since X is simply connected, γ1 γ ea, so γ (γ1 γ) eaγ, from which it follows that γ γ.

Continuous maps between topological spaces give rise to maps between homotopy groups.

Lemma 5.2.23.

Let f : X Y be continuous, and let x0 X.

a.

The path homotopy class of f γ in Π(Y,f(x0)) depends only on the path homotopy class of γ Π(X,x0).

b.

If μ Π(X,x0), then f (γ μ) = (f γ)(f μ).

Proof.

If γ γ for some γΠ(X,x0), and F : [0,1]2 X is a path homotopy from γ to γ, then f F is a homotopy from f γ to f γ. Part b is immediate from the definition of composition of paths.

By Lemma 5.2.23, the following definition makes sense.

Definition 5.2.24.

For a continuous function f : X Y and x0 X, the map

f: π1(X,x0) π1(Y,f(x0))

given by f([γ]) = [f γ] is the homomorphism induced by f on fundamental groups based at x0 and f(x0).

The following property is immediate from the definitions.

Lemma 5.2.25.

If f : X Y and g: Y Z are continuous functions of topological spaces, then (gf) = gf for any x0 X. Moreover, (idX) is the identity homomorphism on π1(X,x0) for any x0 X.

In particular, if f is a homeomorphism, then f is an isomorphism.

Corollary 5.2.26.

Let f : X Y be a homeomorphism of topological spaces. Then for any x0 X, the homomorphism f: π1(X,x0) π1(Y,f(x0)) is an isomorphism with inverse (f1).

Proof.

Since f1 f = idX, we have (f1)f = idπ1(X,x0) by Lemma 5.2.25, and similarly for the other composition.

Definition 5.2.27.

A retraction of X onto a subspace A is continuous function r: X A such that r(a) = a for all a A.

Examples 5.2.28.

a.

Let X be a topological space, and for x0 X. Then the unique map r: X {x0} is a retraction of X onto x0.

b.

Consider the closed disk D = B¯(0,1) in 2. Then the map r: 2 D given by the identity on D and

r(x,y) = ( x x2 + y2, y x2 + y2 )

for (x,y)D is a retraction.

Lemma 5.2.29.

If r: X A is a retraction of a space X onto a subspace A, then for any a0 A, the map r: π1(X,a0) π1(A,a0) is surjective, and for the inclusion map ι : A X, the map ι: π1(A,a0) π(X,a0) is injective with rι = idπ1(A,a0).

Proof.

Let γ be a loop in A based at a0. Then γ is also a loop in X based at a0, and rγ = γ, so r is surjective. Since rι = idA, we have the last equality of the statement, which forces ι to be injective.

5.3. Covering spaces

Definition 5.3.1.

Let f : C X be a continuous map of topological spaces, and let U be an open set in X contained in f(C). We say that U is evenly covered by f if f1(U) is a disjoint union of open subspaces of C, each of which is mapped homeomorphically onto U by f.

Remark 5.3.2.

If U is an open subset of X evenly covered by f : C X and x U, then

f1(U) = cf1(x)Vc,

where Vc is an open neighborhood of c in C such that f|Vc: Vc U is a homeomorphism.

Definition 5.3.3.

We say that a continuous surjective function p: C X between topological spaces is a covering map if for each x X, there exists an open neighborhood U of x X such that U is evenly covered by p. The space C, together with its covering map, is then said to be a covering space of X.

Example 5.3.4.

View S1 as the unit circle in . The function p: S1 given by p(x) = e2𝜋𝑖𝑥 is a covering map. Inside any open neighborhood of 1 S1, we have an open set U = p(𝜖,𝜖) for a sufficiently small 𝜖 < 1 2. The set p1(U) is the disjoint union of the open sets (n𝜖,n+𝜖) for n . This U is a disjoint union of open neighborhoods of the points n forming the inverse image p1(1).

Example 5.3.5.

The function f : S1 S1 defined by f(z) = zn is a covering map. Since the polynomial xna for a S1 has exactly n roots in , all of which have complex absolute value 1, every point has n points in its inverse image. (If a = e2𝜋𝑖𝜃 for some 𝜃 , then these roots have the form e2𝜋𝑖(𝜃+j)n, where 0 j n1.) The inverse image of any proper open arc centered at a is the disjoint union of open arcs centered at these points of f1(a), where the latter arcs are of arc length 1n times that of the original arc.

The following is easily verified.

Lemma 5.3.6.

Covering maps are surjective local homeomorphisms. In particular, they are open maps.

Remark 5.3.7.

The converse to Lemma 5.3.6 not hold. For instance, consider the restriction f of the map p: S1 of Example 5.3.4 to >0. It is a surjective local homeomorphism. Let U = p(𝜖,𝜖) be an arbitrarily small neighborhood of 1 as in said example. Then p1(U)(𝜖,𝜖) = (0,𝜖), and it does not map homeomorphically onto U: in fact, its image does not even contain 1T . Thus, p is not a covering map.

Lemma 5.3.8.

Let p: C X be a covering map, and let B = p1(Y ) be the inverse image in C of an open subspace Y of X. Then p|B: B Y is a covering map.

Proof.

By definition, the restriction p|B is a continuous surjective map. Let x Y, and let U be an open neighborhood of x in Y (hence in X) contained in p(B). By Remark 5.3.2, the open set p1(U) is a disjoint union of open sets Vc in C for each c p1(x) with p|Vc: Vc U a homeomorphism. For b p1(x) B, since p(Vb) = U Y, we have Vb B. That is, p|B takes Vb homeomorphically onto its image U.

Lemma 5.3.9.

Let p: C X and p: C X be covering maps. Then the product map P : C×C X ×X with P(c,c) = (p(c),p(c)) is a covering map as well.

Proof.

For (x,x) X ×X, let U and U be open neighborhoods of x and x in X and X respectively such that p1(U) and (p)1(U) are disjoint unions of open neighborhoods of the points in the inverse images of x and x, respectively, such that the images of these open neighborhoods map homeomorphically under p and p to U and U, again respectively. Then P1(U ×U) is a disjoint union of all products of these sets, one for each point in P1(x,x), and again, they each map homeomorphically to U ×U under P by construction.

Example 5.3.10.

Consider the product map 2 (S1)2 of of the map p of Example 5.3.4 with itself. By Lemma 5.3.9, it is a covering map. That is, the plane is a covering space of the torus.

We next discuss the notion of lifting of paths to covering spaces.

Definition 5.3.11.

Let f : X Y be a continuous function, and let p: C Y be a surjective continuous function. A (continuous) lifting of f to C is a continuous function f~: X C such that pf~ = f. We say that f~ lifts f if f~ is a lifting of f.

Proposition 5.3.12.

Let p: C X be a covering map, let c0 C, and set x0 = p(c0). If γ : [0,1] X is a path in X with initial point x0, then there exists a unique lifting γ~: [0,1] C of γ to a path in C with initial point c0.

Proof.

Since p is a covering map, there exists an open cover 𝒰 of X by sets that are evenly covered by p. Then 𝒱 = {γ1(U)U 𝒰} is an open cover of [0,1]. By Lemma 3.3.8, there exists N 1 such that the intervals Ai = [ iN : i+1 N] with 0 i N 1 are each contained in some element of 𝒱, which has the form γ1(Ui) for some Ui 𝒰.

We define γ~ with γ~(0) = c0 on each Ai recursively. Suppose we have defined γ~ on [0, i N] for some i 0. Let ci = γ~( iN). Since p evenly covers Ui, we have an open neighborhood Vi of ci which maps homeomorphically to Ui under p. Let fi = (p|Vi)1: Ui Vi be the inverse homeomorphism, and define γ~(s) = fiγ(s) for s Ai. The map γ~ on [0, i+1 N] is then continuous by Lemma 2.1.12. Note that this is the only continuous extension of γ~(s) from [0, i N] to [0, i+1 N]. That is, γ~( iN) Vi and f1(Ui) is the disjoint union of Vi and its complement in the inverse image, so in that γ~|Ai must have connected image, its entire image must lie in Vi. But then the map p|Vi: Vi Ui is bijective, so fiγ|Ai is the only continuous lift of γ|Ai to C in Vi. Thus, we have defined our unique path γ~: [0,1] C lifting γ with γ~(0) = c0.

Similarly, we have the following, which we leave unproven. The proof is similar to that Proposition 5.3.12, replacing the even subdivision of [0,1] into intervals with the subdivision of [0,1]2 into N2 squares with vertices ( iN, j N) with 0 i,j N, for some N.

Lemma 5.3.13.

Let p: C X be a covering map with p(c0) = x0 for some c0 C and x0 X. If F : [0,1]2 X is a continuous map with F (0,0) = c0, then there exists a unique lifting F~: [0,1]2 C with F~(0,0) = c0.

We use this to prove the following.

Proposition 5.3.14.

Let p: C X be a covering, let γ,γ: [0,1] X be path homotopic paths. Set x0 = γ(0) = γ(0), and let c0 p1(x0). Let γ~ and γ~ be the unique lifts of γ and γ, respectively, to paths in C with initial point c0. Then γ~ and γ~ satisfy γ~(1) = γ~(1) and are path homotopic.

Proof.

Let F be a path homotopy between γ and γ, and use Lemma 5.3.13 to uniquely lift it to F~: [0,1]2 C with F~(0,0) = c0. We repeatedly use the uniqueness of Proposition 5.3.12. Then F~(s,0) is a path lifting γ with initial point c0, so must be γ~. Similarly, F~(0,t) is a path lifting the constant path ex0 with initial point c0, so must be the constant path ec0. Then F~(0,1) = c0, and F~(s,1) is a path lifting γ with initial point c0, so must be γ~. Finally, F~(1,t) is a path lifting the constant path eγ(1) with F~(1,t) = γ~(1), so must also be constant. Thus, γ~ and γ~ have the same final point, and F~ is a path homotopy from γ~ to γ~.

We are now ready to prove a theorem connecting covering spaces and the fundamental group.

Theorem 5.3.15.

Let p: C X be a covering, let x0 X and c0 C with p(c0) = x0. The function ϕc0 : π1(X,x0) p1(x0) taking [γ] for γ Π(X,x0) to the endpoint of the unique lift of γ to C with initial point c0 is well-defined. If C is path connected, then ϕc0 is surjective, and if C is simply connected, then ϕc0 is bijective.

Proof.

That ϕc0 is well-defined is an immediate consequence of Proposition 5.3.14. If C is path connected and c1 p1(x0), then choose a path λ Π(C,c0,c1). Then λ is a lift of γ = pλ Π(X,x0), and ϕc0([γ]) = c1.

Suppose that C is simply connected, and let γ,μ Π(X,x0) with ϕc0([γ]) = ϕc0([μ]). Let c1 denote the latter point. Let γ~ and μ~ be the unique lifts to C of γ and μ, respectively, with initial point c0. Then have final point c1 by assumption. Since C is simply connected, there then exists a homotopy F~ from γ~ to μ~, and then pF~ is a homotopy from γ to μ. In other words, we have [γ] = [μ], so ϕc0 is injective.

We can now compute the fundamental group of S1 relative to any basepoint.

Theorem 5.3.16.

The fundamental group of S1 is isomorphic to the integers with the operation of addition.

Proof.

The map p: S1 given by p(x) = e2𝜋𝑖𝑥 is a covering. Since is simply connected and the inverse image of 1 is , Theorem 5.3.15 tells us that the map ϕ0: π1(S1,1) is a bijection.

We need only show that ϕ0 is a homomorphism. So, let γ,μ Π(S1,1), and set n = ϕ0([γ]) and m = ϕ0([μ]). Let γ~ be a lift of γ with initial point 0; its final point is then n. Let μ~ be the unique lift of μ with initial point 0, and note that the function μ~ = n+μ~ is a lift of μ with initial point n and final point n+μ~(1) = n+m. Then γ~μ~ lifts γ μ and has final point n+m, so ϕ0([γ][μ]) = n+m = ϕ0([γ])+ϕ0([μ]).

This has some fascinating applications. We give a few.

Example 5.3.17.

There is no retract from the closed unit disk (i.e., ball) D about the origin in 2 to S1. That is, D is simply connected, and S1 has nontrivial fundamental group. Any retract would induce a nonexistent surjection from the fundamental group of D based at a point of S1, which is trivial, to the nontrivial fundamental group of S1 based at that point.

Definition 5.3.18.

A fixed point of a function f : S S from a set S to itself is x S such that f(x) = x.

The following is the Brouwer fixed point theorem for the unit disk in 2.

Theorem 5.3.19 (Brouwer fixed-point theorem).

Let D be the closed unit disk in 2. If f : D D is continuous, then h has a fixed point.

Proof.

Suppose f : D D has no fixed point. Define g: D S1 by letting g(x) for x D be the unique point of S1 on the ray from f(x) to x in 2. Then g is a retract from D onto S1, as the reader will verify. But this contradicts Example 5.3.17.

5.4. Homotopies

We now consider a more general notion of homotopy than path homotopy, which is less restrictive (and therefore somewhat simpler to define) even in the case of paths.

Definition 5.4.1.

Let X and Y be topological spaces, and let f,f: X Y be continuous functions. A homotopy from f to f is a continuous function F : X ×[0,1] Y such that F (x,0) = f(x) and F (x,1) = f(x) for all x X.

Definition 5.4.2.

We say that two continuous functions f,f: X Y are homotopic if there exists a homotopy from f to f.

Lemma 5.4.3.

The property of being homotopic is an equivalence relation on the set C(X,Y ) of continuous functions from a topological space X to a topological space Y.

Proof.

Let denote the relation on C(X,Y ) given by f f if there exists a homotopy from f to f. Given f C(X,Y ), the function F : X ×[0,1] Y given by F (x,t) = f(x) is a homotopy from f to itself, so f f. If F : X ×[0,1] Y is a homotopy from f to f, then F~: X ×[0,1] Y defined by F~(x,t) = F (x,1t) is a homotopy from f to f, so is symmetric. If f f and f f and F is a homotopy from f to f and G is a homotopy from f to f, then H : X ×[0,1] Y defined by

H(x,t) = { F (x,2t) if t [0, 1 2] G(x,2t 1)if t [12,1]

is a homotopy from f to f.

Examples 5.4.4.

a.

Any two continuous functions f,f: X n are homotopic. That is, F : X ×[0,1] n given by F (x,t) = 𝑡𝑓(x)+(1t)f(x) provides a homotopy.

b.

Let X = {x} and Y be a discrete space. Then no two distinct functions f,f: X Y are homotopic. That is, any continuous function F : X ×[0,1] Y has connected image, and is therefore constant.

c.

Let γ and γ be the paths in given by γ(s) = e𝜋𝑖𝑠 and γ(s) = e𝜋𝑖𝑠, as in Example 5.1.2. Since γ~γ is a simple loop in the complex unit circle S1, we see from Theorem 5.3.16 that γ and γ are not path homotopic. On the other hand, they are homotopic via F : S1 ×[0,1] S1 given by F (e2𝜋𝑖𝜃,t) = γ(𝜃)12t. Thus, homotopic paths need not be path homotopic.

Lemma 5.4.5.

Let X and Y be topological spaces, and let x0 X. Let F : X ×[0,1] Y be a homotopy from a continuous f : X Y to a continuous function f: X Y such that F (x0,t) is a constant function of t [0,1]. Set y0 = F (x0,t). Then the homomorphisms

f,f: π1(X,x0) π1(Y,y0)

are equal.

Proof.

Let γ Π(X,x0). We claim that

H = F (γ,id[0,1]): [0,1]2 Y

is a path homotopy from f γ to fγ. That is, H(s,0) = F (γ(s),0) = f(γ(s)) and H(s,1) = F (γ(s),1) = f(γ(s)), while H(0,t) = F (x0,t) = y0 and H(1,t) = F (x0,t) = y0. We then have

f([γ]) = [f γ] = [fγ] = f ([γ]).

In fact, we may improve Lemma 5.4.5 as follows.

Proposition 5.4.6.

Let X and Y be topological spaces, and let x0 X. Let F : X ×[0,1] Y be a homotopy from a continuous f : X Y to a continuous function f: X Y. Then λ : [0,1] Y defined by λ(t) = F (x0,t) for t [0,1] is a path from y0 = f(x0) to y0 = f(x0) in Y, and we have

f = ψ λf: π1(X,x0) π1(X,y0),

where ψλ is conjugation by λ as in Lemma 5.2.17.

Proof.

Let γ Π(X,x0). We wish to show that [fγ] = [λ~][f γ][λ], or equivalently, that there is a homotopy

λ (fγ) (f γ)λ

of paths from y0 to y0. Note that f(γ(s)) = F (γ(s),0) and f(γ(s)) = F (γ(s),1) are loops in Y based at y0 and y0, respectively. We define G: [0,1]2 Y by

G(s,t) = { λ(2s) if s [0, 1t 2 ], F (γ(2s1+t),1t)if s [1t 2 ,1t 2], λ(2s1) if s [1t 2,1].

Then G is continuous as the values

λ(1t) = F (γ(0),1t) and F (γ(1),1t) = λ(1t)

of G(s,t) agree at s = 1t 2 and s = 1t 2, respectively. At s {0,1}, we have

G(0,t) = λ(0) = y0 and G(1,t) = λ(1) = y1.

And at t {0,1}, we have G(s,0) = λ(2s) and G(s,1) = F (γ(2s),0) = f(γ(2s)) if s [0, 1 2], and G(s,0) = F (γ(2s1),1) = f(γ(2s1)) and G(s,1) = λ(2s1) if s [12,1]. Thus, G is the desired path homotopy.

Corollary 5.4.7.

If f and f are homotopic continuous maps X Y, then for any basepoint in X, the map f is injective (resp., surjective) if and only if f is.

Definition 5.4.8.

A continuous map f : X Y of topological spaces is nullhomotopic if f is homotopic to a constant map from X to Y.

Corollary 5.4.9.

If f : X Y is nullhomotopic, then the homomorphism f is trivial.

Proof.

Suppose that f is homotopic to the constant function cy with value y Y. Fix x0 X, set y0 = f(x0), and consider f: π1(X,x0) π1(Y,y0). By Proposition 5.4.6, we have f = ψλ(cy) where λ is a path in y from y0, and note that ψλ(cy) = (cy0), which is trivial.

We also have the following rather profound consequence.

Theorem 5.4.10 (Fundamental theorem of algebra).

Every nonconstant polynomial with complex coefficients has a root in .

Proof.

Suppose that p is a polynomial of degree n with leading coefficient 1 (by scaling, without loss of generality). Then p(z)zn is a polynomial of degree less than n, which means that there exists r > 0 such that rn > |p(z)zn| for all z with |z| r: i.e., we can choose any r greater than the sum of the absolute values of the coefficients of p(z).

We claim that the map f : S1 S1 given by

f(z) = p(𝑟𝑧) |p(𝑟𝑧)|,

which is well-defined as p has no roots, is homotopic to g: S1 S1 given by g(z) = zn. Consider H : S1 ×[0,1] S1 given by

H(z,t) = (1t)(p(𝑟𝑧)(𝑟𝑧)n)+(𝑟𝑧)n |(1t)(p(𝑟𝑧)(𝑟𝑧)n)+(𝑟𝑧)n|.

It satisfies H(z,0) = f(z) and H(z,1) = g(z) for all z S1. Also, for z S1 and t [0,1], we have

|(1t)(p(𝑟𝑧)(𝑟𝑧)n)||p(𝑟𝑧)(𝑟𝑧)n| < rn = |(𝑟𝑧)n|,

and therefore the denominator in H is always nonzero. That is, the function H is a well-defined homotopy from f to g.

If p has no roots in , then f extends to a map f~: S1 on the simply connected space by the same formula, so if ι : S1 is the inclusion, then f = f~ι: π1(S1,1) π1(S1,1) factors through the trivial group π(,1), so is trivial. On the other hand, g induces multiplication by n on π1(S1,1)≅ℤ. By Corollary 5.4.7, this forces n = 0. That is, p is constant.

Definition 5.4.11.

A deformation retraction from a topological space X to a subspace A is a homotopy R: X ×[0,1] X from the identity map on X to a retraction from X to A such that R(a,t) = a for all a A and t [0,1]. If a deformation retraction from X to A exists, we say that A is a deformation retract of X.

Example 5.4.12.

The unit circle S1 in is a deformation retract of {0} via the function R: ({0})×[0,1] {0} given by

R(re𝑖𝜃,t) = ((1t)r+t)e𝑖𝜃

for r > 0 and 𝜃 [0,2π).

Proposition 5.4.13.

Let A be a deformation retract of X, and let a0 A. Then the inclusion map ι : A X gives rise to an isomorphism

ι: π1(A,a0) π1(X,a0).
Proof.

Let R: X ×[0,1] X be a deformation retraction from X to A. It satisfies the conditions of Lemma 5.4.5 for the basepoint a0 A, and therefore r: X A defined by r(x) = R(x,1) is a retraction satisfying

ιr = (ι r) = (idX) = idπ1(X,a0).

Since rι = idA, we also have

rι = (rι) = (idA) = idπ1(A,a0).

Thus, ι is an isomorphism with inverse r.

As a special case, we have the notion of a contractible space.

Definition 5.4.14.

A space X is contractible, or contractible to a point x X if the subspace {x} is a deformation retract of X.

Remark 5.4.15.

If X is contractible to a point in X, then it is contractible to every point in X.

The following is immediate from Proposition 5.4.13.

Corollary 5.4.16.

If X is contractible, then its fundamental group is trivial.

In Corollary 5.2.26, we may obtain an isomorphism on fundamental groups under a weaker condition on our continuous map. For this, we make the following definition.

Definition 5.4.17.

A continuous map f : X Y of topological spaces is a homotopy equivalence if there exists a continuous function g: Y X such that gf is homotopic to idX and f g is homotopic to idY . We say that g is a homotopy inverse to f.

Examples 5.4.18.

a.

If f : X Y is a homeomorphism, then it is a homotopy equivalence with homotopy inverse its inverse f1.

b.

If A is deformation retract of X, then the inclusion map ι : A X is a homotopy equivalence with homotopy inverse a retraction r: X A.

c.

The inclusion map of the open unit disk B about the origin in 2 into 2 is a homotopy equivalence. Note that any continuous map from 2 to itself that fixes B also fixes B¯, so there does not exist a retraction from 2 to B.

Proposition 5.4.19.

Let f : X Y be a homotopy equivalence, let x0 X and y0 = f(x0). Then

f: π1(X,x0) π1(Y,y0)

is an isomorphism for any x0 X.

Proof.

Let g: Y X be a homotopy inverse to f. For a homotopy F from idX to gf, set x1 = g(f(x0)). Let λ(t) = F (x0,t) for t [0,1], which is a path from x0 to x1 in X. By Propsition 5.4.6, we have

gf = ψλidπ1(X,x0) = ψλ,

but ψλ: π1(X,x0) π1(X,x1) is an isomorphism with inverse ψλ~, so gf is an isomorphism. Switching the roles of f and g, we see that fg is also an isomorphism, so f and g are mutually inverse.

Find in the notes