Professional Documents
Culture Documents
2 Homotopy 7
2.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7
2.2 Homotopy and relative homotopy - some examples and basic properties . . . 9
2.3 Contractible spaces . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13
2.4 Retracts and Deformation retracts . . . . . . . . . . . . . . . . . . . . . . . . 17
2.5 Extension of a continuous function . . . . . . . . . . . . . . . . . . . . . . . 19
1
Chapter 1
Example 1.0.1. An open interval (i.e., a line segment without its end points) and a semi-
circular arc (without its end points) are homeomorphic.
An open interval is nothing but a line segment without its end points, whereas a semi-circular
arc (without end-points) is a bended line segment. So the obvious way of getting the home-
omorphism is just flattening the circular arc into a straight line. The actual correspondence
is obtained trivially as follows :
Draw a line through the centre of the semi-circular arc that intersect both the objects.
The correspondence is x ↔ y.
Another well-known technique in point set topology, called puncturing objects, is also used
to establish that two spaces are not topologically same (i.e., not homeomorphic). In the next
example, we explain this technique by showing that a circle is not homeomorphic to an open
interval, though ‘compactness’ is enough to show this.
In fact, in the last example, there is nothing special about R2 and so, the same arguments
establish that Rn is not homeomorphic to R, for any n > 1. But, it is not possible to argue
in the same line to obtain in general that Rm is not homeomorphic to Rn , for any m ̸= n.
Unlike the case of a 2-sphere S2 and a torus (i.e., S 1 × S 1 ), it is highly difficult even to prove
that S 3 is not homeomorphic to S 1 × S 1 × S 1 .
Algebraic topology partially solves ‘Homeomorphism problems’. The general scheme is as
follows :
If the induced homomorphism is not an isomorphism then the given topological spaces
are not homeomorphic.
The algebraic object H(X) as mentioned above, may be a group, module, a sequence of
modules, etc. There are several methods of construction of such algebraic objects. In this
two semester course on Algebraic Topology, we explore two constructions of H(X):
2. Homology group
One should note carefully that by using the techniques of algebraic topology, ‘homeomor-
phism problems’ can be solved partially - not completely. In fact, we prove that
homeo iso
X −→ Y =⇒ H(X) −→ H(Y )
But the converse of this result is not in general true. So, this result helps to distinguish
topological spaces than establishing homeomorphisms.
2. If IX : X → X is the identity map of the space X, then H(IX ) = IH(X) is the identity
map of the group H(X)
It is evident that these properties establish that H is a functor (either covariant or con-
travariant) from the Category of topological spaces to the category of groups. These two
properties are thus referred to as functorial properties.
Syllabus
Algebraic Topology I
PM3/11, Group B (Full marks 25)
Fundamental theorem of algebra and Brouwer fixed point theorem. Covering projec-
tion, covering spaces, lifting of paths and homotopies, the fundamental group of a cov-
ering space. The Monodromy theorem, The Borsuk-Ulam theorem and ham-sandwich
theorem.
References
Homotopy
Throughout this course, whenever we write ‘a function’ or ‘a map’ we always mean a con-
tinuous function, unless stated otherwise.
2.1 Introduction
In this chapter we learn a concept called ‘equivalence’ of two spaces, which is much broader
than homeomorphism. We introduce here, mainly four interrelated terms - Homotopy (and
homotopy relative to a subspace), deformation retract, homotopy equivalence and con-
tractible spaces. Let us first try to understand the concepts intuitively. Suppose, we start
with an annulus and draw a middle circle, as shown in the following figure:
and x. We further put a restriction on this process by saying that the points on the middle
circle A remains stationary throughout 0 ≤ t ≤ 1.
ϕ0 = f
ϕ1 = g
then {ϕt : X → Y : t ∈ [0, 1]} is called a homotopy between f and g. Further, to formalize
‘ϕt changes continuously with t’, we make use of the product space X ×I, where I stands
for the closed interval [0, 1] and get the following:
If in particular, one chooses A = ∅, then the definition of relative homotopy reduces to that
of a homotopy. Hence, homotopy is a special case of relative homotopy.
Before exploring homotopy and relative homotopy further, we formalize the idea of defor-
mation retraction, using Definition 2.1.1.Described in terms of functions, the initial state of
X (before deformation) is realised as the identity map IX : X → X (i.e., IX (x) = x for all
x ∈ X) and the final state (after deformation) by a surjective map f : X → A such that
f |A = IA ( f |A = IA means that in the process of deformation A remains unchanged or
stationary), then considering the inclusion map i : A → X, we feel that ϕt : X → A is a
homotopy from IX to i ◦ f relative to A. Equivalently,
Exercise 2.1.1. Show that the definition of deformation retraction given by the family of
functions ϕt , t ∈ [0, 1] is equivalent to Definition 2.1.2.
The name ‘contractiblity’ of a space relative to a point seems quite understandable. For
contracting a space to a point there is no need to put the restriction of keeping the point x0
stationary. This leads to the definition of a contractible space. i.e.,
In Section 3 of this chapter we discuss contractible spaces in more details and will see that
a contractible space need not be contractible w.r.t a point, though the other implication is
immediate.
It is already mentioned before, if A is a subspace of X and there exists a continuous function
f : X → A such that f |A = IA and i ◦ f ∼ =A IX then A is a deformation retract of X. It is
not hard to observe that in such case, f ◦ i = IA ∼ = IA holds. Generalizing this idea we get
the definition of homotopy equivalence, as given below:
Exercise 2.1.2. Show that the relation X ∼ Y if and only if X and Y are of the same
homotopy type is an equivalence relation.
Example 2.2.1. Let f, g : Rn → Rn are given by f (x) = x and g(x) = 0, for all x ∈ Rn .
F
Define F : Rn × I → Rn by F (x, t) = (1 − t)x then f ∼
= g.
A. Deb Ray, C.U. 10
In Example 2.2.1, we have constructed one F such that F is continuous, F (x, 0) = f (x)
and F (x, 1) = g(x). But one may note that F is not the only function satisfying those
conditions. In fact, H : Rn × I → Rn given by H(x, t) = (1 − t2 )x also serves the purpose.
So, there are several ways a function can homotope to another function.
The following example explains that there is nothing special about the chosen functions
f and g on Rn in Example 2.2.1:
Example 2.2.2. Let f, g : Rn → Rn are any two continuous functions. Define F : Rn × I →
Rn by F (x, t) = tg(x)+(1−t)f (x). Then F is a continuous function such that F (x, 0) = f (x)
F
and F (x, 1) = g(x). i.e., f ∼
= g.
Even further, the domain of f and g in Example 2.2.2 need not be Rn and can be replaced
by any topological space X. What is so special about Rn in the co-domain? The only thing
we need is that the convex combination of two points of Rn should be inside Rn . Therefore,
we get a more general example :
Example 2.2.3. Let X be a topological space and Y a convex subset of Rn (or, Y be
a topological vector space) and f, g : X → Y be any two continuous functions. Define
F : X × I → Y by F (x, t) = tg(x) + (1 − t)f (x). Then F is a continuous function such that
F
F (x, 0) = f (x) and F (x, 1) = g(x). i.e., f ∼
= g.
The homotopy described in Example 2.2.1 and 2.2.2 is called straight line homotopy.
However, ‘convexity’ of the co-domain space is not mandatory for any two continuous func-
tions to be homotopic.
Example 2.2.4. Let X be a topological space and S n−1 be the n − 1-sphere of unit radius.
Then of course, S n−1 ⊆ Rn \ {0}. If f, g : X → S n−1 are any two continuous functions such
that f (x) and g(x) are not antipodal (i.e., f (x) ̸= −g(x)) then F : X × I → S n−1 given by
tg(x)+(1−t)f (x)
F (x, t) = ||tg(x)+(1−t)f (x)||
is a homotopy. It is easy to see that if f (x) ̸= −g(x), each point on
tg(x)+(1−t)f (x)
the line segment tg(x) + (1 − t)f (x) has norm > 0. So, ||tg(x)+(1−t)f (x)||
has unit length and
n−1
therefore, ∈ S for each x ∈ X and t ∈ I. The continuity of F follows from the facts that
the function ϕ : X × I → Rn \ {0} given by ϕ(x, t) = tg(x) + (1 − t)f (x) is continuous and
x
ψ : Rn \ {0} → S n−1 given by ψ(x) = ||x|| is continuous. (check!)
This example leads to a result that follows next:
Theorem 2.2.1. Any non-surjective continuous function f : X → S n−1 is null homotopic.
Proof. Since f is non-surjective, we can choose s ∈ S n−1 \f (X) and define a constant function
g : X → S n−1 by g(x) = −s. Clearly, f (x) ̸= −g(x) holds for all x ∈ X. Proceeding as
Example 2.2.4, f ∼ = g.
Theorem 2.2.2. Consider the collection C(X, Y ) of all continuous functions from X to Y .
Define a relation on C(X, Y ) by
f∼
= g ⇔ f is homotopic to g
Then ∼
= is an equivalence relation.
A. Deb Ray, C.U. 11
Proof. For any f ∈ C(X, Y ) set H(x, t) = f (x) for all x ∈ X and t ∈ I. So, ∼ = is reflexive.
∼
If f, g ∈ C(X, Y ) are such that f = g then there exists a homotopy H : X × I → Y
such that H(x, 0) = f (x) and H(x, 1) = g(x). Consider the map F : X × I → Y defined
by F (x, t) = H(x, 1 − t). Then F is also a continuous map such that F (x, 0) = g(x) and
F (x, 1) = f (x) and hence, g ∼
= f . i.e., ∼
= is symmetric.
H1 H2
Let f, g, h ∈ C(X, Y ) are such that f ∼ = g and g ∼ = h. Define H : X × I → Y by
(
H1 (x, 2t) if 0 ≤ t ≤ 12
H(x, t) =
H2 (x, 2t − 1) if 21 ≤ t ≤ 1
for all x ∈ X. By pasting lemma, H is continuous. Further, H(x, 0) = f (x) and H(x, 1) =
h(x) for all x ∈ X. Therefore, f ∼
= h and consequently, ∼
= is transitive.
Exercise 2.2.1. Let X and Y be topological spaces and A ⊆ X. Show that the ‘homotopy
relative to A’ is an equivalence relation on C(X, Y ) of all continuous functions from X to Y .
That ∼ = is an equivalence relation is efficiently utilized to establish a very useful result
regarding composition of homotopic maps.
Theorem 2.2.3. If f1 , g1 : X → Y and f2 , g2 : Y → Z are continuous functions such that
f1 ∼
= g1 and f2 ∼
= g2 then f2 ◦ f1 ∼
= g2 ◦ g1 .
H1 2H
Proof. Let f1 ∼= g1 and f2 ∼
= g2 . H1 : X × I → Y and f2 : Y → Z are continuous imply that
f2 ◦ H1 : X × I → Z is a continuous function. Again (f2 ◦ H1 )(x, 0) = f2 (f1 (x)) = (f2 ◦ f1 )(x)
f2 ◦H1
and (f2 ◦ H1 )(x, 1) = f2 (g1 (x)) = (f2 ◦ g1 )(x), for all x ∈ X. Hence f2 ◦ f1 ∼
= f 2 ◦ g1 .
Define ψ : X × I → Y × I by ψ(x, t) = (g1 (x), t) and H : X × I → Z by H = H2 ◦ ψ. Then H
is a continuous function such that H(x, 0) = (H2 ◦ ψ)(x, 0) = H2 (g1 (x), 0) = (f2 ◦ g1 )(x) and
H
H(x, 1) = (H2 ◦ ψ)(x, 1) = H2 (g1 (x), 1) = (g2 ◦ g1 )(x), for all x ∈ X. Hence f2 ◦ g1 ∼
= g2 ◦ g1 .
Since ‘being homotopic to’ is a transitive relation, f2 ◦ f1 ∼ = g2 ◦ g1 .
Recall that for any two continuous functions f : X1 → Y1 and g : X2 → Y2 , f ×g : X1 ×X2 →
Y1 ×Y2 given by (f ×g)(x, y) = (f (x), g(y)) is continuous. Similarly, the continuous functions
f : X → Y and g : X → Z also define a continuous function h : X → Y × Z described by
h(x) = (f (x), g(x)).
Theorem 2.2.4. (1) If f1 , f2 : X1 → X2 and g1 , g2 : Y1 → Y2 are such that f1 ∼ = f2 and
∼ ∼
g1 = g2 , then f1 × g1 = f2 × g2 .
(2) If f1 , f2 : X → Y and g1 , g2 : X → Z are such that f1 ∼ = f2 and g1 ∼ = g2 then h1 ∼
= h2 ,
where hi (x) = (fi (x), gi (x)), for i = 1, 2.
H 1 H 2
Proof. (1) Let f1 ∼ = f2 and g1 ∼
= g2 . Define H : (X1 × Y1 ) × I → X2 × Y2 by H((x, y), t) =
(H1 (x, t), H2 (y, t)). Then H is a continuous function such that H((x, y), 0) = (f1 (x), g1 (y)) =
H
(f1 × g1 )(x, y) and H((x, y), 1) = (f2 (x), g2 (y)) = (f2 × g2 )(x, y). So, f1 × g1 ∼
= f2 × g2 .
H 1 H 2
(2) Let f1 ∼ = f2 and g1 ∼= g2 . Define H : X × I → Y × Z by H(x, t) = (H1 (x, t), H2 (x, t)).
Then H is a continuous function with H(x, 0) = (f1 (x), g1 (x)) = h1 (x) and H(x, 1) =
H
(f2 (x), g2 (x)) = h2 (x). Therefore, h1 ∼
= h2 .
A. Deb Ray, C.U. 12
More generally,
Q
Theorem 2.2.5. Let X and Yα (α ∈ Λ) be topological spaces and f, g : X → Y = Yα
α∈Λ
be continuous. f ∼
= g if and only if pα ◦ f ∼
= pα ◦ g, for all α ∈ Λ. (Here pα denotes the α-th
projection map)
Proof. If f ∼= g then pα ◦ f ∼= pα ◦ g, for all α ∈ Λ, follows from Theorem 2.2.3 and that ∼=
is a reflexive relation.
Conversely, let pα ◦ f ∼ = pα ◦ g, for all α ∈ Λ. For each α ∈ Λ, there is a continuous
function Hα : X × I → Yα such that Hα (x, 0) = (pα ◦ f )(x), Hα (x, 1) = (pα ◦ g)(x). Define
H : X ×I → Y by H(x, t) = (Hα (x, t)α . Then H is a continuous function such that H(x, 0) =
(Hα (x, 0))α = ((pα ◦ f )(x))α = f (x) and H(x, 1) = (Hα (x, 1))α = ((pα ◦ g)(x))α = g(x), for
H
all x ∈ X. Hence, f ∼ = g.
We have already observed that the definition of homotopy can be derived from the definition
of relative homotopy, by choosing in particular the set A as an empty set. But a ‘homotopy’
is not always a ‘homotopy relative to a given set A’, where A is a nonempty set. Before
giving an example, we prove an important characteristic to homotopy relative to a set.
Theorem 2.2.6. If X is a topological space such that the identity map IX is homotopic to
a constant map Ca relative to {a} then for each neighbourhood U of a in X, there exists a
neighbourhood V of a contained in U such that any point of V can be joined to a by a path
lying completely inside U .
Exercise 2.2.3. If f and g are continuous functions from a topological space X to Rn such
that f (x) = g(x) for all x ∈ A ⊆ X, then show that f ∼A g.
Exercise 2.2.5. Find an example to establish that any two constant functions from any
space X to any space Y need not be homotopic. (Solution : Choose X to be a connected
space and Y a disconnected space (hence, not path connected). Choose y, z from two distinct
A. Deb Ray, C.U. 13
components of Y and consider the constant functions on X as f (x) = y and g(x) = z. Then
f is not homotopic to g. For if there is a homotopy H : X × I → Y , then H(X × I) (being
a continuous image of a connected space) is a connected subset of Y and so can not contain
both y and z, a contradiction to the fact that H(x, 0) = y and H(x, 1) = z.)
Exercise 2.2.6. Show that any two constant functions from any space X to a path connected
space Y are homotopic.
One may feel that ‘homotopy’ does not only depend on the nature of the continuous functions
but also on the characteristic of the space Y . We may even generalize the last exercise as
follows:
Exercise 2.2.7. Any two constant functions from a topological space X to a topological
space Y are homotopic if and only if their images lie in one path component of Y .
Note that a star-shaped subspace of Rn need not be a convex subspace, though the re-
verse implication certainly holds. For example, if we take two lines L1 and L2 in Rn with
L1 ∩ L2 = {a} for some a ∈ Rn , then L1 ∪ L2 is a star-shaped non-convex subspace of Rn .
In view of Example 2.2.5, Comb space is contractible. A rigorous proof of this statement is
given later.
Example 2.2.2 shows that a discrete space (with at least two points) is not contractible.
For if any constant function Cx is homotopic to IX then Cx = IX , proving that X is a
singleton.
In the next theorem we show that path connectedness is a necessary condition for a space
to be contractible. That the condition is not sufficient is well understood by visualizing the
unit circle S 1 . For a rigorous proof, we have to wait till the next chapter where we discuss
the fundamental group of S 1 . It is quite expected that if a space X is contractible to {x0 }
then it is surely contractible to any point x ∈ X.
Theorem 2.3.1. Any two continuous functions from a topological space to a contractible
space are homotopic.
A. Deb Ray, C.U. 14
H((x, y), t) = (x, y)(1−t)+(x, 0)t = (x, (1−t)y) is a continuous map such that H((x, y), 0) =
IC (x, y) and H((x, y), 1) = i◦p(x, y), for all (x, y) ∈ C. Hence i◦p ∼
= IC . So, p is a homotopy
equivalence. i.e., C and L are of the same homotopy type. Since L is contractible by the
homotopy F : L × [0, 1] → L given by F ((x, 0), t) = tIL (x, 0) + (1 − t)C(0,0) (x, 0), we get that
C is contractible. (why?)
Exercise 2.3.1. Show that the annulus A = {z ∈ C : 2 ≤ |z| ≤ 3} is of the same homotopy
type with S 1 .
Though it is generally hard to prove that two spaces are not of the same homotopy type,
the following theorem can be used to distinguish homotopy nonequivalent spaces.
Theorem 2.3.5. A 2-point discrete space is not of the same homotopy type with a point
space.
Proof. Let X = {a, b} be a 2-point discrete space and Y = {p} is a point space. If possible, let
X and Y are of the same homotopy type. Then there exist continuous functions f : X → Y
and g : Y → X such that g ◦ f ∼ = IX and f ◦ g ∼= IY . Clearly, f is the constant map Cp and
thus, f ◦ g = IY . Without loss of generality, we assume that g(p) = a. Let H : X × I → X
be a homotopy between g ◦ f and IX . Define w : I → X by w(t) = H(b, t). Then
and
w(1) = H(b, 1) = IX (b) = b.
Since I is connected and w is continuous, w(I) is also connected. But. X being a discrete
space, it is disconnected. So, w(I) can not be the whole of X. This contradiction proves
that X and Y are not of the same homotopy type.
Theorem 2.3.6. If X is connected and Y is disconnected then X and Y are not of the same
homotopy type.
A. Deb Ray, C.U. 16
Proof. If possible let X and Y are of the same homotopy type. Then there are continuous
H F
maps f : X → Y and g : Y → X such that g ◦ f ∼ = IX and f ◦ g ∼= IY . So, F (y, 0) = f (g(y))
and F (y, 1) = y, for all y ∈ Y`. Y is disconnected implies that there are nonempty open sets
U , V in Y such that Y = U V . There exists a continuous map p : Y → {a, b}, such that
(
a, y ∈ U
p(y) =
b, y ∈ V
On the other hand, X being connected, f (X) ⊆ U or f (X) ⊆ V . Without loss of generality
assume, f (X) ⊆ U . Choose v ∈ V (such a choice is possible as V ̸= ∅). Define h : I → {a, b}
by h(t) = p(F (v, t)). Then
h(0) = p(F (v, 0)) = p(f (g(v))) = a (since f (g(v)) ∈ f (X) ⊆ U ) and h(1) = p(F (v, 1)) =
p(v) = b. i.e., h is a continuous surjection from a connected set I to a 2-point discrete space
{a, b}. This is a contradiction.’
Remark 2.3.1. Stating contrapositively, Theorem 2.3.6 reads as : If two spaces are of the
same homotopy type then either both of them are connected or both are disconnected. So,
‘connectedness’ can be used to distinguish spaces which are not of the same homotopy type.
But, ‘compactness’ can not be used for a similar purpose. There are examples of non-compact
spaces (e.g., R) that are of the same homotopy type with compact spaces (e.g., point space).
Lemma 2.3.1. Let X, Y be arbitrary topological spaces and Γ(X), Γ(Y ) denote the set of
all components of X and Y respectively. For any continuous function f : X → Y , define
a function Γ(f ) : Γ(X) → Γ(Y ) by Γ(f )(α) = β whenever f (α) ⊆ β. If f, g : X → Y are
homotopic then Γ(f ) = Γ(g).
Since no special property of two dimensional space is utilized here, one may generalize
Example 2.4.2 for any n ∈ N :
In the following example we observe that a space X may have more than one deformation
retracts, say, Y1 and Y2 , but none of Y1 and Y2 will deformation retract to the other.
Example 2.4.6. Consider a doubly punctured plane, i.e., a space obtained by removing
two points p, q from R2 . θ-space and figure-8 space are deformation retracts of a doubly
punctured plane R2 \ {p, q}.
The following figure shows how R2 \ {p, q} deformation retracts to figure-8 space :
On the otherhand, the following diagram shows how R2 \ {p, q} deformation retracts to a
θ-space:
A. Deb Ray, C.U. 19
But neither θ-space deformation retracts to figure-8 space nor it is a deformation retract
of a figure-8 space. However, Y1 and Y2 are of the same homotopy type with the doubly
punctured disc and hence, they are the same homotopy type with each other.
Proof. Suppose f is null homotopic. Then there exist y0 ∈ Y and a continuous function
H : S n × I → Y such that H(x, 0) = f (x), H(x, 1) = y0 , for all x ∈ S n . Define a function
F : Dn+1 → Y as follows:
(
y0 , if 0 ≤ ||x|| ≤ 21
F (x) = x
H( ||x|| , 2 − 2||x||), if 12 ≤ ||x|| ≤ 1
It is easy to see that 2 − 2||x|| ∈ I whenever 12 ≤ ||x|| ≤ 1. So, the map F is well-
defined. By pasting lemma, F is continuous. (Because, F is continuous on the closed sets
{x ∈ Dn+1 : 0 ≤ ||x|| ≤ 12 } and {x ∈ Dn+1 : 12 ≤ ||x|| ≤ 1} and F (x) = y0 = H(x, 1) for
||x|| = 12 .) Also, F (x) = f (x) for all x ∈ S n . Therefore, F is a continuous extension of f .
A. Deb Ray, C.U. 20
The following theorem shows that ‘null homotopy’ provides a necessary and sufficient con-
dition for a continuous function on X to be extended to T X.
Theorem 2.5.2. Let X be any topological space and T X the cone over X. A continuous
function f : X → Y is null homotopic if and only if f has a continuous extension F : T X → Y
(where Y is any topological space).
H
Proof. Let f : X → Y be null homotopic. Then there exists some y0 ∈ Y such that f ∼ = C y0 ,
where Cy0 : X → Y is given by Cy0 (x) = y0 . If p : X ×I → T X is the identification map, then
p|X×{0} : X × {0} → p(X × {0}) is a homeomorphism (check!) and so, we identify X with
p(X × {0}) (as X and X × {0} are homeomorphic). Now, H(x, 0) = f (x) and H(x, 1) = y0 ,
for all x ∈ X. Then (H ◦ p−1 ) (z) is a single valued continuous function T X → Y such that
H ◦ p−1 (p(a, 0)) = f (a) for all a ∈ X. Hence, H ◦ p−1 : T X → Y is a continuous extension
of f .
Conversely, let f : X → Y has a continuous extension F : T X → Y . Consider F ◦ p :
X × I → Y . Then (F ◦ p)(x, 0) = f (x) for all x ∈ X. Also, (F ◦ p)(x, 1) is a single point,
say y0 ∈ Y . Hence, we get a homotopy H : X × I → Y given by H(x, t) = F ◦ p between f
and the constant map C(x) = y0 , for all x ∈ X. i.e., f ∼= 0.
The following example shows that f ∼
= g and f is extendible may not imply that g is
extendible.
Note that H of the above definition is a special case of Homotopy relative to {0, 1}, as
discussed before. The following theorem guarantees that for three compatible paths α, β
and γ, (α ∗ β) ∗ γ and α ∗ (β ∗ γ) are path homotopic.
(α ∗ β) ∗ γ ∼{x0 ,x3 } α ∗ (β ∗ γ)
Schematically,
and
α(2s),
if 0 ≤ s ≤ 12
(α ∗ (β ∗ γ))(s) = β(4s − 2), if 12 ≤ s ≤ 34
γ(4s − 3), if 34 ≤ s ≤ 1
So,
4s (t+1)
(1+t) ,
α if 0 ≤ s ≤ 4
, 0≤ t≤1
(t+1)
H(s, t) =
β (4s − 1 − t) , if 4
≤ s ≤ (t+2)
4
,0≤t≤1
γ 4s−2−t ,
(t+2)
2−t
if 4
≤ s ≤ 1, 0 ≤ t ≤ 1.
It is left as an exercise to the reader that H, as constructed above, is continuous (by pasting
lemma) and satisfies the desired conditions for being a path homotopy between the paths
(α ∗ β) ∗ γ and α ∗ (β ∗ γ).
As a special case of Theorem 3.1.1, we get
Theorem 3.1.2. If α, β, γ are loops based at some x0 ∈ X, then (α ∗ β) ∗ γ ∼{x0 } α ∗ (β ∗ γ).
Some important results are proved next, that we require in our subsequent discussion.
Theorem 3.1.3. Let α, α1 be two homotopic paths joining x0 , x1 and β, β1 be two homotopic
paths joining x1 , x2 . Then α ∗ β is path homotopic to α1 ∗ β1 . i.e.,
Then H is continuous and H(s, 0) = (α ∗ β)(s), H(s, 1) = (α1 ∗ β1 )(s), H(0, t) = x0 and
H(1, t) = 1. This implies H is a path homotopy between α ∗ β and α1 ∗ β1 .
A. Deb Ray, C.U. 24
Corollary 3.1.1. Let α, α1 be two homotopic paths from x0 to x1 and β be any path from
x1 to x2 . Then α ∗ β is path homotopic to α1 ∗ β.
Throughout our discussion, we use the following definitions / notations, without any further
clarification.
Exercise 3.1.1. If α and β are paths from x0 to x1 ∈ X, then show that α ∼ β if and only
if α ∗ β −1 ∼ Cx0 .
Theorem 3.2.1. Let (X, x0 ) be a pointed topological space and π(X, x0 ), the collection
of all equivalence classes of loops in X based at x0 , arising from the equivalence relation
α ∼ β iff α is path homotopic to β. Then ([α], [β]) 7→ [α] ◦ [β] = [α ∗ β] is a well defined
binary operation on π(X, x0 ).
Proof. For any α, β ∈ P, α ∗ β ∈ P so that [α ∗ β] ∈ π(X, x0 ). Let [α] = [α1 ] and [β] = [β1 ],
where α, β, α1 and β1 ∈ P. Then α ∼ α1 and β ∼ β1 . Now, α ∗ β ∼ α1 ∗ β1 . Hence,
[α] ◦ [β] = [α1 ] ◦ [β1 ], which shows that the operation is well defined.
Theorem 3.2.2. For any pointed topological space (X, x0 ), (π(X, x0 ), ◦) is a group; where
[α] ◦ [β] = [α ∗ β].
Definition 3.2.1. The group π(X, x0 ), obtained in Theorem 3.2.2 is called the first fun-
damental group or Poincaré group of X based at x0 .
The definition of fundamental group depends on the base point x0 . So, fundamental groups
are associated to pointed topological spaces rather than topological spaces, in general. Later,
we may convince ourselves by constructing examples of fundamental groups of topological
spaces that depend on the base point. However, we shall see next that if x0 and x1 are two
points lying in the same path component then their fundamental groups are isomorphic.
Proof. Let ω : [0, 1] → X be a path connecting x0 and x1 . Then ω(0) = x0 and ω(1) = x1 .
Define fω : π(X, x0 ) → π(X, x1 ) by fω ([α]) = [ω −1 ∗ α ∗ ω]. We first see that this map is
well defined. Let [α] = [β]. Then α ∼x0 β and therefore, ω −1 ∗ α ∗ ω ∼x1 ω −1 ∗ β ∗ ω. So,
fω ([α]) = fω ([β]).
If α ∼x0 α1 and β ∼x0 β1 then α ∗ α1 ∼x0 β ∗ β1 . Using this and a Theorem that we have
obtained in Chapter 5, we get
Conversely, let the condition hold and [α], [β] ∈ π(X, x0 ). Since X is path connected, there is
a path ω (say) from x0 to x1 . Then β ∗ω is also a path from x0 to x1 . By the hypothesis, fω =
fβ∗ω . i.e., for all [α] ∈ π(X, x0 ), fω ([α]) = fβ∗ω ([α]). So, [ω −1 ∗ α ∗ ω] = [(β ∗ ω)−1 ∗ α ∗ (β ∗ ω)]
= [(ω −1 ∗ β −1 ) ∗ α ∗ (β ∗ ω)]. So, ω −1 ∗ α ∗ ω ∼ ω −1 ∗ (β −1 ∗ α ∗ β) ∗ ω which gives α ∼ β −1 ∗ α ∗ β,
i.e., β ∗ α ∼ α ∗ β. Hence, [β ∗ α] = [α ∗ β].
In what follows, we shall mean a trivial fundamental group when we write π(X, x0 ) = 0.
We observe next that a continuous function between pointed topological spaces induces
a homomorphism between the corresponding fundamental groups.
Therefore, f# is a homomorphism.
Theorem 3.2.7. (i) If I : (X, x0 ) → (X, x0 ) is the identity map then I# : π(X, x0 ) →
π(X, x0 ) is the identity homomorphism.
(ii) If f : (X, x0 ) → (Y, y0 ) and g : (Y, y0 ) → (Z, z0 ) are continuous maps then (g ◦ f )# =
g# ◦ f# .
A. Deb Ray, C.U. 28
Proof. (i) For each [α] ∈ π(X, x0 ), (I ◦ α)(t) = α(t), for all t ∈ [0, 1] and hence, we have
I# ([α]) = [I ◦ α] = [α]. So, the induced homomorphism I# : π(X, x0 ) → π(X, x0 ) is the
identity map.
(ii) For all [α] ∈ π(X, x0 ),
(g ◦ f )# ([α]) = [(g ◦ f ) ◦ α]
= [g ◦ (f ◦ α)]
= g# ([f ◦ α])
= g# (f# ([α]))
= (g# ◦ f# )([α])
Hence, (g ◦ f )# = g# ◦ f# .
In view of Theorem 3.2.7, we conclude that π is a covariant functor π : T op∗ ⇒ Grp described
as follows:
(X, x0 ) 7−→ π(X, x0 )
f f#
(Y, y0 ) 7−→ π(Y, y0 )
The properties mentioned in Theorem 3.2.7 are referred to as functorial properties of π.
Theorem 3.3.1. If X and Y are two path connected homeomorphic topological spaces,
then π(X) is isomorphic to π(Y ).
and
(f ◦ f −1 )# = (IY )# ⇒ f# ◦ (f −1 )# = (IY )# = Iπ(Y,y0 ) .
Hence f# becomes a group isomorphism, as desired.
Theorem 3.3.2. If f, g : (X, x0 ) → (Y, y0 ) are two continuous functions between two pointed
topological spaces such that f ∼x0 g, then f# = g# : π(X, x0 ) → π(Y, y0 ).
Remark 3.3.1. As discussed before, the figure-8 space and θ-space are the deformation
retracts of the same space (a disc with two holes), and so, their fundamental groups are
isomorphic. But figure-8 space and θ-space are not deformation retracts of each other.
Hence, this cites an example of spaces whose fundamental groups are same though one is
not a deformation retract of the other.
Suppose, X and Y are two topological spaces and x0 ∈ X. In Theorem 3.3.3 we have shown
that if f : X → Y is a homotopy equivalence such that the base points x0 and f (x0 ) remain
unaltered during homotopy, then the induced homomorphism f# is an isomorphism. We see
next that even if the base points are not kept fixed during homotopy, the homomorphism
induced by a homotopy equivalence is an isomorphism.
A. Deb Ray, C.U. 30
Theorem 3.3.4. Let f, g : X → Y be continuous maps such that f (x0 ) = y0 and g(x0 ) = y1 .
If f is homotopic to g then there exists a path η in Y connecting y0 and y1 , determined by
the homotopy, such that the following diagram commutes:
π(X, x0 ) / π(Y, y0 )
f#
ηb
g#
&
π(Y, y1 )
where ηb : π(Y, y0 ) → π(Y, y1 ) is given by ηb([β]) = [η −1 ∗ β ∗ η].
Proof. Suppose H : X × I → Y is the homotopy between f and g. i.e., H : X × I → Y is
a continuous function such that H(x, 0) = f (x) and H(x, 1) = g(x). Define η : [0, 1] → Y
by η(t) = H(x0 , t). Then η is certainly a continuous map with η(0) = y0 and η(1) = y1 . So,
η is a path in Y determined by the homotopy H. We claim that ηb ◦ f# = g# . In order to
establish our claim, we need to show [η −1 ∗ (f ◦ α) ∗ η] = [g ◦ α], for all [α] ∈ π(X, x0 ); i.e.,
to show η −1 ∗ (f ◦ α) ∗ η ∼ (g ◦ α).
We prove this result in two steps:
Step 1. Define a continuous map G : I × I → Y by G(s, t) = H(α(s), t). Then for each
s, t ∈ I
G(s, 0) = H(α(s), 0) = (f ◦ α)(s), G(s, 1) = F (α(s), 1) = (g ◦ α)(s)
and
G(0, t) = H(α(0), t) = H(x0 , t) = η(t), G(1, t) = H(α(1), t) = H(x0 , t) = η(t)
Step 2. Define a map F : I × I → Y as follows:
−1
η (2s),
if 0 ≤ s ≤ 1−t
2
(1−t)
F (s, t) = G (4s + 2t − 2)/(3t + 1), t) , if 2 ≤ s ≤ t+3 4
η(4s − 3), if t+3 ≤ s ≤ 1
4
Using pasting lemma it is easy to see that F is a continuous function such that,
F (s, 0) = η −1 ∗ (f ◦ α) ∗ η
F (s, 1) = g ◦ α
F (0, t) = F (1, t) = g(x0 ).
Hence F is path homotopy between η −1 ∗ (f ◦ α) ∗ η and g ∗ α, as desired.
Corollary 3.3.2. If f : X → Y is homotopic to a constant map C : X → Y and x0 ∈ X
then the induced homomorphism f# : π(X, x0 ) → π(Y, f (x0 )) is the zero map.
Proof. Choose any [α] ∈ Π(X, x0 ). To show that f# ([α]) = [Cf (x0 ) ]. Let C : X → Y
be the constant map described by x 7→ y0 . Then by Theorem 3.3.4, we get the following
commutative diagram:
π(X, x0 ) f / π(Y, f (x0 ))
#
ηb
C# '
π(Y, y0 )
Here C# ([α]) = [C ◦ α] = [Cy0 ] and ηb ◦ f# = C# implies [η −1 ∗ (f ◦ α) ∗ η] = [Cy0 ]. So,
f ◦ α ∼ η ∗ Cy0 ∗ η −1 ∼ Cf (x0 ) . Hence, f# ([α]) = [f ◦ α] = [Cf (x0 ) ].
A. Deb Ray, C.U. 31
where ηb is described as in Theorem 3.3.4, induced from η(t) = H(x0 , t). By commutativity
of the diagram, we get, for all [α] ∈ π(X, x0 ),
η ◦ I# )([α]) = [η −1 ∗ α ∗ η]
[Cx0 ] = C# ([α]) = (b
Consequently, Cx0 ∼ η −1 ∗ α ∗ η, i.e., η −1 ∗ Cx0 ∗ η ∼ α and hence, Cx0 ∼ α. Therefore, by
arbitrariness of [α], we get π(X, x0 ) = {[Cx0 ]}.
Exercise 3.3.1. Find π(Rn ).
Solution. Let I : Rn → Rn be the identity map and C0 : Rn → Rn be the constant map
x 7→ 0. Define H : Rn × I → Rn by H(x, t) = tx which is a homotopy between I and
C0 . Therefore, Rn is contractible. Again Rn being contractible, it is path connected and
therefore the fundamental group does not depend on the base point. Hence, π(Rn ) is trivial
(by Corollary 3.3.3).
Theorem 3.3.5. If X and Y are two path connected spaces which are of the same homotopy
type then their fundamental groups are isomorphic.
Proof. By the definition of homotopy type, there are continuous functions f : X → Y and
H G
g : Y → X such that g ◦ f ∼= IX and f ◦ g ∼= IY . Let x0 ∈ X. Suppose f (x0 ) = y0 , g(y0 ) = x1
and f (x1 ) = y1 . Then (g ◦ f )(x0 ) = x1 and (f ◦ g)(y0 ) = y1 . Since X is path connected,
define a path from x0 to x1 by η(t) = H(x0 , t) and hence, applying Theorem 3.3.4, we get
the following commutative diagram:
π(X, x0 ) / π(X, x0 )
I#
ηb
(g◦f )# &
π(X, x1 )
In this chapter, we explore in details certain general properties of covering maps and
covering spaces and prove Path Lifting property and Homotopy Lifting property
of any covering map. It is to be noted that ‘covering spaces’ are important in their own
right and have a wide range of applications in various branches of mathematics, but for our
purpose, we only discuss their use as a tool to compute fundamental groups.
e → X be a continuous surjection.
Definition 4.1.1. Let p : X
Example 4.1.1. (i) Let X be a topological space and IX : X → X be the identity map.
−1
For each x ∈ X, consider the open set X containing x. Then IX (X) = X is certainly evenly
32
A. Deb Ray, C.U. 33
covered by IX and the partition is {X}. So, IX is a covering map and X is a covering space
of itself.
(ii) Let X be a topological space. Consider the space X e = X × {1, 2, . . . , n}. Then of
ǹ
course, Xe is a disjoint union of copies of X, i.e., X
e= (X × {i}). Defining p : X e → X by
i=1
p(x, i) = x, we observe that p is a covering map and hence X
e is a covering space of X.
(iv) Let Y be a discrete space and X any topological space. Then the projection map
p`: X × Y → X given by (x, y) 7→ x is a covering map. Because, p−1 (X) = X × Y =
X × {y} and each X × {y} is homeomorphic to X.
y∈Y
Example 4.1.2. Consider exp : R → S 1 given by exp(t) = (cos 2πt, sin 2πt). Clearly exp is a
continuous surjection. For any point x ∈ S 1 \ {(1, 0)}, consider the open neighbourhood U =
∞
S 1 \{(1, 0)}. Then exp−1 (U ) =
`
(n, n+1) such that each (n, n+1) is homeomorphic to U ,
n=−∞
i.e., U is evenly covered by exp. For the point (1, 0), consider the open set V = S 1 \{(−1, 0)}.
∞
exp−1 (V ) = (n − 12 , n + 12 ) and each (n − 12 , n + 12 ) is homeomorphic to V imply that V
`
n=−∞
is also evenly covered by exp. Hence, exp is a covering map and R is a covering space of S 1 .
Example 4.1.2 differs from Example 4.1.1(ii) in the sense that the space X (and hence X)
e
1
of Example 4.1.1(ii) is not path connected while in Example 4.1.2, S (and also R) is path
connected. In this course, we are mainly concerned with path connected spaces and hence
in what follows, we discard the covering spaces which are not path connected.
Next example shows that a (path connected) topological space may have more than one path
connected covering spaces.
Example 4.1.3. Let p1 : S 1 → S 1 be given by p1 (z) = z 2 . Then p1 is a covering map and
hence, S 1 is a covering space of itself.
The above example can further be generalized as follows:
Example 4.1.4. Let p : S 1 → S 1 be given by p(z) = z n , for any nonzero integer n. Then p
is a covering map and so, S 1 is a covering space of itself via the map p.
Remark 4.1.1. We observe that for a covering map p : X e → X and each b ∈ X, the subspace
p−1 (b) of X
e is a discrete space. We explain it as follows: If U is an open neighbourhood
of b evenly covered by p then p−1 (U ) =
`
Vα and each Vα is homeomorphic to U by the
α
y ∈ p−1 (b). We intend to show that {y} is open in p−1 (b).
restriction of p on Vα . Choose any `
−1 −1
Since b ∈ U , p (b) ⊆ p (U ) = Vα and therefore, y ∈ Vα for some Vα . We claim that
α
there is no z ̸= y such that z ∈ Vα ∩ p−1 (b). For if such z exists, then p(y) = p(z) = b which
contradicts the fact that p|Vα : Vα → U is a homeomorphism. Hence Vα ∩ p−1 (b) = {y}.
Since Vα is open in X,e it follows that {y} is open in p−1 (b).
A. Deb Ray, C.U. 34
e → X is an open map.
Theorem 4.1.1. A covering map p : X
Proof. Let A be an open subset of X. e Take any x ∈ p(A). Then there exists y ∈ A such
that p(y) =`x. Since p is a covering map there exists an open neighourhood U of x such that
p−1 (U ) = Vα . Let y ∈ Vβ for some β ∈ Λ. Therefore, y ∈ A ∩ Vβ and A ∩ Vβ is open in
α∈Λ
e So, A ∩ Vβ is open in Vβ . p|V : Vβ → U being a homeomorphism, p(A ∩ Vβ ) is open in
X. β
U and hence in X. So, there exists an open set p(A ∩ Vβ ), such that x ∈ p(A ∩ Vβ ) ⊆ p(A).
Arbitrariness of x proves that p(A) is a neighbourhood of each of its points and hence it is
open in X.
Proof. Follows from the fact that a continuous open surjection is a quotient map.
e → X and q : Ye → Y be covering maps. Then p × q : X
Theorem 4.1.2. Let p : X e × Ye →
X × Y given by
(p × q)(x, y) = (p(x), q(y))
is a covering map.
Example 4.1.6. Consider exp : R → S 1 given by exp(t) = (cos 2πt, sin 2πt) and take the
restriction exp |R+ : R+ → S 1 . Then exp |R+ : R+ → S 1 is a continuous surjection but not
a covering map because, (1, 0) has no evenly covered open neighbourhood by the restriction
map.
Though it is in general false, the next result shows one situation when restriction of a covering
map becomes a covering map.
The following couple of results are required to establish the aforementioned properties.
A. Deb Ray, C.U. 36
@X
e
∃ unique α
e
p
I
α / X
So, ωe lifts Cx0 and begins from x e0 . By uniqueness of the lift we have, ω e = Cxe0 . Similarly,
e : I → X given by γ
γ e e(t) = H(1, t) is a lift of Cx1 , beginning at x1 and so, by uniqueness of
e
the lift, γ
e = Cxe1 , where x
e1 = σe(1).
Define δ : I → X by δ(t) = H(t, 1). Then
e e e e
(p ◦ δ)(t)
e = p(H(t,
e 1)) = H(t, 1) = τ (t).
Also, δ(0)
e = H(0,
e 1) = w(1) e = Cxe0 (1) = x
e0 . Hence, δe is a lift of τ beginning at x e0 . By
uniqueness of the lift, δe = τe. Therefore, combining all, H e : I×I → X e is a continuous
function such that H(s, 0) = σ
e e(s), H(s, 1) = τe(s), H(0, t) = x
e e e0 and H(1, t) = x
e e1 . i.e., σ
e is
path homotopic to τe by H. e
Moreover, σe(1) = H(1,
e 0) = H(1, e 1) = τe(1).
A. Deb Ray, C.U. 38
We conclude this section by proving a very important theorem, called Borsuk-Ulam Theorem
(for n = 2).
Definition 4.2.1. A point −x ∈ S n is said to be an antipodal point (or an antipode) of
x ∈ S n . A map h : S n → S m is said to be an antipode preserving map if h(−x) = −h(x)
for all x ∈ S n .
Example 4.2.1. Let Rϕ : S 1 → S 1 be a rotation by an angle ϕ (0 ≤ ϕ ≤ π). i.e.,
Rϕ (cos θ, sin θ) = (cos (θ + ϕ), sin (θ + ϕ)). Then Rϕ is antipode preserving. Because, for
any point z = (cos θ, sin θ), −z = (cos (π + θ), sin (π + θ)) and so,
Rϕ (cos (π + θ), sin (π + θ)) = (cos (π + θ + ϕ), sin (π + θ + ϕ))
= (− cos (θ + ϕ), − sin (θ + ϕ))
= −Rϕ (cos θ, sin θ)
The following are very useful observations about antipode preserving maps:
Composition of two antipode preserving maps is antipode preserving.
If antipodal maps g, h : S n → S n are such that h is null homotopic then g ◦ h is an
antipodal map which is also null homotopic.
Theorem 4.2.4. If h : S 1 → S 1 is a continuous and antipode preserving function then h is
not nullhomotopic.
Proof. Suppose b0 = (1, 0) ∈ S 1 and h(b0 ) = a0 ∈ S 1 . If b0 = a0 then we proceed with the
function h. If not, then choose a rotation Rϕ : S 1 → S 1 such that Rϕ (h(b0 )) = b0 . Then
consider the map k = Rϕ ◦h. In view of the previous observations, it follows that k : S 1 → S 1
is a continuous and antipode preserving map such that k(b0 ) = b0 . For proving that h is not
null homotopic, it is enough to show that k is not nullhomotopic.
Consider a map q : S 1 → S 1 given by q(cos θ, sin θ) = (cos 2θ, sin 2θ). Then q is a closed,
continuous surjection and hence a quotient map. The inverse image of any point w on S 1
under the map q consists of the antipodal points z and −z of S 1 . i.e., w = q(z) = q(−z).
Therefore,
q(k(−z)) = q(−k(z)) = q(k(z)).
Therefore, q ◦ k is constant on each fiber f −1 (w), w ∈ S 1 . So, by the property of quotient
maps, q ◦ k induces a continuous map f : S 1 → S 1 such that f ◦ q = q ◦ k.
S1 / S1
k
q q
S1 / S1
f
A. Deb Ray, C.U. 39
Z∼
= π(S 1 , b0 ) / π(S 1 , b0 ) ∼
=Z
k#
q# q#
Z∼
= π(S 1 , b0 ) / π(S 1 , b0 ) ∼
=Z
f#
Proof. Suppose for all x ∈ S 2 , f (x) ̸= f (−x). Define g : S 2 → S 1 by g(x) = ||ff (x)−f
(x)−f (−x)
(−x)||
.
2
Then g is a continuous function such that g(−x) = −g(x), for all x ∈ S . By Theorem 4.2.5,
it is not possible. Hence, there exists some x ∈ S 2 such that f (x) = f (−x).