Allen Hatcher
Copyright c 2000 by Allen Hatcher
Paper or electronic copies for noncommercial use may be made freely without explicit permission from the author.
All other rights reserved.
Table of Contents
Chapter 0. Some Underlying Geometric Notions . . . . . 1
Homotopy and Homotopy Type 1. Cell Complexes 5.
Operations on Spaces 8. Two Criteria for Homotopy Equivalence 11.
The Homotopy Extension Property 14.
Chapter 1. The Fundamental Group . . . . . . . . . . . . . 21
1. Basic Constructions . . . . . . . . . . . . . . . . . . . . . . . 25
Paths and Homotopy 25. The Fundamental Group of the Circle 28.
Induced Homomorphisms 34.
2. Van Kampen’s Theorem . . . . . . . . . . . . . . . . . . . . 39
Free Products of Groups 39. The van Kampen Theorem 41.
Applications to Cell Complexes 49.
3. Covering Spaces . . . . . . . . . . . . . . . . . . . . . . . . . 55
Lifting Properties 59. The Classiﬁcation of Covering Spaces 62.
Deck Transformations and Group Actions 69.
Additional Topics
A. Graphs and Free Groups 81.
B. K(G,1) Spaces and Graphs of Groups 86.
Chapter 2. Homology . . . . . . . . . . . . . . . . . . . . . . . 97
1. Simplicial and Singular Homology . . . . . . . . . . . . . . 102
∆ Complexes 102. Simplicial Homology 104. Singular Homology 108.
Homotopy Invariance 110. Exact Sequences and Excision 113.
The Equivalence of Simplicial and Singular Homology 128.
2. Computations and Applications . . . . . . . . . . . . . . . 134
Degree 134. Cellular Homology 137. MayerVietoris Sequences 149.
Homology with Coefﬁcients 153.
3. The Formal Viewpoint . . . . . . . . . . . . . . . . . . . . . 160
Axioms for Homology 160. Categories and Functors 162.
Additional Topics
A. Homology and Fundamental Group 166.
B. Classical Applications 168.
C. Simplicial Approximation 175.
Chapter 3. Cohomology . . . . . . . . . . . . . . . . . . . . . 183
1. Cohomology Groups . . . . . . . . . . . . . . . . . . . . . . 188
The Universal Coefﬁcient Theorem 188. Cohomology of Spaces 195.
2. Cup Product . . . . . . . . . . . . . . . . . . . . . . . . . . . 204
The Cohomology Ring 209. A K¨ unneth Formula 215.
Spaces with Polynomial Cohomology 221.
3. Poincar´e Duality . . . . . . . . . . . . . . . . . . . . . . . . . 228
Orientations and Homology 231. The Duality Theorem 237.
Connection with Cup Product 247. Other Forms of Duality 250.
Additional Topics
A. The Universal Coefﬁcient Theorem for Homology 259.
B. The General K¨ unneth Formula 266.
C. H–Spaces and Hopf Algebras 279.
D. The Cohomology of SO(n) 291.
E. Bockstein Homomorphisms 301.
F. Limits 309.
G. More About Ext 316.
H. Transfer Homomorphisms 320.
I. Local Coefﬁcients 327.
Chapter 4. Homotopy Theory . . . . . . . . . . . . . . . . . 337
1. Homotopy Groups . . . . . . . . . . . . . . . . . . . . . . . 339
Deﬁnitions and Basic Constructions 340. Whitehead’s Theorem 346.
Cellular Approximation 348. CW Approximation 351.
2. Elementary Methods of Calculation . . . . . . . . . . . . . 359
Excision for Homotopy Groups 359. The Hurewicz Theorem 366.
Fiber Bundles 374. Stable Homotopy Groups 383.
3. Connections with Cohomology . . . . . . . . . . . . . . . . 392
The Homotopy Construction of Cohomology 393. Fibrations 404.
Postnikov Towers 409. Obstruction Theory 415.
Additional Topics
A. Basepoints and Homotopy 421.
B. The Hopf Invariant 427.
C. Minimal Cell Structures 429.
D. Cohomology of Fiber Bundles 432.
E. The Brown Representability Theorem 448.
F. Spectra and Homology Theories 453.
G. Gluing Constructions 456.
H. EckmannHilton Duality 461.
I. Stable Splittings of Spaces 468.
J. The Loopspace of a Suspension 471.
K. Symmetric Products and the DoldThom Theorem 477.
L. Steenrod Squares and Powers 489.
Appendix . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 521
Topology of Cell Complexes 521. The CompactOpen Topology 531.
Bibliography . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 535
Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 540
Preface
This book was written to be a readable introduction to Algebraic Topology with
rather broad coverage of the subject. Our viewpoint is quite classical in spirit, and
stays largely within the conﬁnes of pure Algebraic Topology. In a sense, the book
could have been written thirty years ago since virtually all its content is at least that
old. However, the passage of the intervening years has helped clarify what the most
important results and techniques are. For example, CW complexes have proved over
time to be the most natural class of spaces for Algebraic Topology, so they are em
phasized here much more than in the books of an earlier generation. This emphasis
also illustrates the book’s general slant towards geometric, rather than algebraic, as
pects of the subject. The geometry of Algebraic Topology is so pretty, it would seem
a pity to slight it and to miss all the intuition that it provides. At deeper levels, alge
bra becomes increasingly important, so for the sake of balance it seems only fair to
emphasize geometry at the beginning.
Let us say something about the organization of the book. At the elementary level,
Algebraic Topology divides naturally into two channels, with the broad topic of Ho
motopy on the one side and Homology on the other. We have divided this material
into four chapters, roughly according to increasing sophistication, with Homotopy
split between Chapters 1 and 4, and Homology and its mirror variant Cohomology
in Chapters 2 and 3. These four chapters do not have to be read in this order, how
ever. One could begin with Homology and perhaps continue on with Cohomology
before turning to Homotopy. In the other direction, one could postpone Homology
and Cohomology until after parts of Chapter 4. However, we have not pushed this
latter approach to its natural limit, in which Homology and Cohomology arise just as
branches of Homotopy Theory. Appealing as this approach is from a strictly logical
point of view, it places more demands on the reader, and since readability is one of
our ﬁrst priorities, we have delayed introducing this unifying viewpoint until later in
the book.
There is also a preliminary Chapter 0 introducing some of the basic geometric
concepts and constructions that play a central role in both the homological and ho
motopical sides of the subject.
Each of the four main chapters concludes with a selection of Additional Topics
that the reader can sample at will, independent of the basic core of the book contained
in the earlier parts of the chapters. Many of these extra topics are in fact rather
important in the overall scheme of Algebraic Topology, though they might not ﬁt into
the time constraints of a ﬁrst course. Altogether, these Additional Topics amount
to nearly half the book, and we have included them both to make the book more
comprehensive and to give the reader who takes the time to delve into them a more
substantial sample of the true richness and beauty of the subject.
Not included in this book is the important but somewhat more sophisticated
topic of spectral sequences. It was very tempting to include something about this
marvelous tool here, but spectral sequences are such a big topic that it seemed best
to start with themafresh in a newvolume. This is tentatively titled ‘Spectral Sequences
in Algebraic Topology’ and referred to herein as [SSAT]. There is also a third book in
progress, on vector bundles, characteristic classes, and K–theory, which will be largely
independent of [SSAT] and also of much of the present book. This is referred to as
[VBKT], its provisional title being ‘Vector Bundles and K–Theory.’
In terms of prerequisites, the present book assumes the reader has some famil
iarity with the content of the standard undergraduate courses in algebra and pointset
topology. One topic that is not always a part of a ﬁrst pointset topology course but
which is quite important for Algebraic Topology is quotient spaces, or identiﬁcation
spaces as they are sometimes called. Good sources for this are the textbooks by Arm
strong and J¨anich listed in the Bibliography.
A book such as this one, whose aim is to present classical material from a fairly
classical viewpoint, is not the place to indulge in wild innovation. Nevertheless there is
one new feature of the exposition that may be worth commenting upon, even though
in the book as a whole it plays a relatively minor role. This is a modest extension
of the classical notion of simplicial complexes, which we call ∆ complexes. These
have made brief appearances in the literature previously, without a standard name
emerging. The idea is to weaken the condition that each simplex be embedded, to
require only that the interiors of simplices are embedded. (In addition, an ordering
of the vertices of each simplex is also part of the structure of a ∆ complex.) For
example, if one takes the standard picture of the torus as a square with opposite
edges identiﬁed and divides the square into two triangles by cutting along a diagonal,
then the result is a ∆ complex structure on the torus having 2 triangles, 3 edges, and
1 vertex. By contrast, it is known that a simplicial complex structure on the torus
must have at least 14 triangles, 21 edges, and 7 vertices. So ∆ complexes provide
a signiﬁcant improvement in efﬁciency, which is nice from a pedagogical viewpoint
since it cuts down on tedious calculations in examples. A more fundamental reason
for considering ∆ complexes is that they just seem to be very natural objects from
the viewpoint of Algebraic Topology. They are the natural domain of deﬁnition for
simplicial homology, and a number of standard constructions produce ∆ complexes
rather than simplicial complexes, for instance the singular complex of a space, or the
classifying space of a discrete group or category.
It is the author’s intention to keep this book available online permanently, as well
as publish it in the traditional manner for those who want the convenience of a bound
copy. With the electronic version it will be possible to continue making revisions and
additions, so comments and suggestions from readers will always be welcome. The
web address is:
http://www.math.cornell.edu/˜hatcher
One can also ﬁnd here the parts of the other two books that are currently available.
Standard Notations
R
n
: n dimensional Euclidean space, with real coordinates
C
n
: complex n space
I = [0, 1]: the unit interval
S
n
: the unit sphere in R
n+1
, all vectors of length 1
D
n
: the unit disk or ball in R
n
, all vectors of length ≤ 1
∂D
n
= S
n−1
: the boundary of the n disk
11: the identity function from a set to itself
I: disjoint union
≈: isomorphism
Z
n
: the integers modn
A ⊂ B or B ⊃ A: settheoretic containment, not necessarily proper
The aim of this short preliminary chapter is to introduce a few of the most com
mon geometric concepts and constructions in algebraic topology. The exposition is
somewhat informal, with no theorems or proofs until the last couple pages, and it
should be read in this informal spirit, skipping bits here and there. In fact, this whole
chapter could be skipped now, to be referred back to later for basic deﬁnitions.
To avoid overusing the word ‘continuous’ we adopt the convention that maps be
tween spaces are always assumed to be continuous unless otherwise stated.
Homotopy and Homotopy Type
One of the main ideas of algebraic topology is to consider two spaces to be equiv
alent if they have ‘the same shape’ in a sense that is much broader than homeo
morphism. To take an everyday example, the letters of the alphabet can be written
either as unions of ﬁnitely many straight and curved line segments, or in thickened
forms that are compact subsurfaces of the plane bounded by simple closed curves.
In each case the thin letter is a subspace of the thick letter, and we can continuously
shrink the thick letter to the thin one. A nice way to do this is to decompose a thick
letter, call it X, into line segments connecting each point on the outer boundary of X
to a unique point of the thin subletter X, as indicated in the ﬁgure. Then we can shrink
2 Chapter 0. Some Underlying Geometric Notions
X to X by sliding each point of X − X into X along the line segment that contains it.
Points that are already in X do not move.
We can think of this shrinking process as taking place during a time interval
0 ≤ t ≤ 1, and then it deﬁnes a family of functions f
t
: X→X parametrized by t ∈ I =
[0, 1], where f
t
(x) is the point to which a given point x ∈ X has moved at time t .
Naturally we would like f
t
(x) to depend continuously on both t and x, and this will
be true if we have each x ∈ X − X move along its line segment at constant speed so
as to reach its image point in X at time t = 1, while points x ∈ X are stationary, as
remarked earlier.
These examples lead to the following general deﬁnition. A deformation retrac
tion of a space X onto a subspace A is a family of maps f
t
: X→X, t ∈ I , such
that f
0
= 11 (the identity map), f
1
(X) = A, and f
t
¦
¦A = 11 for all t . The family f
t
should be continuous in the sense that the associated map X×I→X, (x, t)
f
t
(x),
is continuous.
It is easy to produce many more examples similar to the letter examples, with the
deformation retraction f
t
obtained by sliding along line segments. The ﬁrst ﬁgure
below shows such a deformation retraction of a M¨obius band onto its core circle. The
other three ﬁgures show deformation retractions in which a disk with two smaller
open subdisks removed shrinks to three different subspaces.
In all these examples the structure that gives rise to the deformation retraction
can be described by means of the following deﬁnition. For a map f : X→Y , the map
ping cylinder M
f
is the quotient space of the disjoint union (X×I) IY obtained by
identifying each (x, 1) ∈ X×I with f(x) ∈ Y .
X × I
X
Y
Y
M
f
f X ( )
In the letter examples, the space X is the outer boundary of the thick letter, Y is the
thin letter, and the map f : X→Y sends the outer endpoint of each line segment to
its inner endpoint. A similar description applies to the other examples. Then it is a
general fact that a mapping cylinder M
f
deformation retracts to the subspace Y by
sliding each point (x, t) along the segment ¦x¦×I ⊂ M
f
to the endpoint f(x) ∈ Y .
Not all deformation retractions arise in this way from mapping cylinders, how
ever. For example, the thick X deformation retracts to the thin X, which in turn
Homotopy and Homotopy Type 3
deformation retracts to the point of intersection of its two crossbars. The net result
is a deformation retraction of X onto a point, during which certain pairs of points
follow paths that merge before reaching their ﬁnal destination. Later in this section
we will describe a considerably more complicated example, the socalled ‘house with
two rooms,’ where a deformation retraction to a point can be constructed abstractly,
but seeing the deformation with the naked eye is a real challenge.
A deformation retraction f
t
: X→X is a special case of the general notion of a
homotopy, which is simply any family of maps f
t
: X→Y , t ∈ I , such that the asso
ciated map F : X×I→Y given by F(x, t) = f
t
(x) is continuous. One says that two
maps f
0
, f
1
: X→Y are homotopic if there exists a homotopy f
t
connecting them,
and one writes f
0
= f
1
.
In these terms, a deformation retraction of X onto a subspace A is a homotopy
from the identity map of X to a retraction of X onto A, a map r : X→X such that
r(X) = A and r ¦
¦A = 11. One could equally well regard a retraction as a map X→A
restricting to the identity on the subspace A ⊂ X. From a more formal viewpoint a
retraction is a map r : X→X with r
2
= r , since this equation says exactly that r is the
identity on its image. Retractions are the topological analogs of projection operators
in other parts of mathematics.
Not all retractions come from deformation retractions. For example, every space
X retracts onto any point x
0
∈ X via the map sending all of X to x
0
. But a space that
deformation retracts onto a point must certainly be pathconnected, since a deforma
tion retraction of X to a point x
0
gives a path joining each x ∈ X to x
0
. It is less
trivial to show that there are pathconnected spaces that do not deformation retract
onto a point. One would expect this to be the case for the letters ‘with holes,’ A, B,
D, O, P, Q, R. In Chapter 1 we will develop techniques to prove this.
A homotopy f
t
: X→X that gives a deformation retraction of X onto a subspace
A has the property that f
t
¦
¦A = 11 for all t . In general, a homotopy f
t
: X→Y whose
restriction to a subspace A ⊂ X is independent of t is called a homotopy relative
to A, or more concisely, a homotopy rel A. Thus, a deformation retraction of X onto
A is a homotopy rel A from the identity map of X to a retraction of X onto A.
If a space X deformation retracts onto a subspace A via f
t
: X→X, then if
r : X→A denotes the resulting retraction and i : A→X the inclusion, we have ri = 11
and ir = 11, the latter homotopy being given by f
t
. Generalizing this situation, a
map f : X→Y is called a homotopy equivalence if there is a map g : Y→X such that
fg = 11 and gf = 11. The spaces X and Y are said to be homotopy equivalent or to
have the same homotopy type. The notation is X = Y . It is an easy exercise to check
that this is an equivalence relation, in contrast with the nonsymmetric notion of de
formation retraction. For example, the three graphs are all homotopy
equivalent since they are deformation retracts of the same space, as we saw earlier,
but none of the three is a deformation retract of any other.
4 Chapter 0. Some Underlying Geometric Notions
It is true in general that two spaces X and Y are homotopy equivalent if and only
if there exists a third space Z containing both X and Y as deformation retracts. For
the less trivial implication one can in fact take Z to be the mapping cylinder M
f
of
any homotopy equivalence f : X→Y . We observed previously that M
f
deformation
retracts to Y , so what needs to be proved is that M
f
also deformation retracts to its
other end X if f is a homotopy equivalence. This is shown in Corollary 0.21 near the
end of this chapter.
A space having the homotopy type of a point is called contractible. This amounts
to requiring that the identity map of the space be nullhomotopic, that is, homotopic
to a constant map. In general, this is slightly weaker than saying the space deforma
tion retracts to a point; see the exercises at the end of the chapter for an example
distinguishing these two notions.
Let us describe now an example of a 2 dimensional subspace of R
3
, known as
the house with two rooms, which is contractible but not in any obvious way.
R
To build this space, start with a box divided into two chambers by a horizontal rect
angle R, where by a ‘rectangle’ we mean not just the four edges of a rectangle but
also its interior. Access to the two chambers from outside the box is provided by two
vertical tunnels. The upper tunnel is made by punching out a square from the top
of the box and another square directly below it from R, then inserting four vertical
rectangles, the walls of the tunnel. This tunnel allows entry to the lower chamber
from outside the box. The lower tunnel is formed in similar fashion, providing entry
to the upper chamber. Finally, two vertical rectangles are inserted to form ‘support
walls’ for the two tunnels. The resulting space X thus consists of three horizontal
pieces homeomorphic to annuli S
1
×I , plus all the vertical rectangles that form the
walls of the two chambers: the exterior walls, the walls of the tunnels, and the two
support walls.
To see that X is contractible, consider a closed ε neighborhood N(X) of X.
This clearly deformation retracts onto X if ε is sufﬁciently small. In fact, N(X)
is the mapping cylinder of a map from the boundary surface of N(X) to X. Less
obvious is the fact that N(X) is homeomorphic to D
3
, the unit ball in R
3
. To see
this, imagine forming N(X) from a ball of clay by pushing a ﬁnger into the ball to
Cell Complexes 5
create the upper tunnel, then gradually hollowing out the lower chamber, and similarly
pushing a ﬁnger in to create the lower tunnel and hollowing out the upper chamber.
Mathematically, this process gives a family of embeddings h
t
: D
3
→R
3
starting with
the usual inclusion D
3
R
3
and ending with a homeomorphism onto N(X).
Thus we have X = N(X) = D
3
= point , so X is contractible since homotopy
equivalence is an equivalence relation.
In fact, X deformation retracts to a point. For if f
t
is a deformation retraction
of the ball N(X) to a point x
0
∈ X and if r : N(X)→X is a retraction, for example
the end result of a deformation retraction of N(X) to X, then the restriction of the
composition rf
t
to X is a deformation retraction of X to x
0
. However, it is not
easy to see exactly what this deformation retraction looks like! A slightly easier test
of geometric visualization is to ﬁnd a nullhomotopy in X of the loop formed by a
horizontal cross section of one of the tunnels. We leave this as a puzzle for the
reader.
Cell Complexes
A familiar way of constructing the torus S
1
×S
1
is by identifying opposite sides
of a square. More generally, an orientable surface M
g
of genus g can be constructed
from a 4g sided polygon by identifying pairs of edges, as shown in the ﬁgure for the
cases g = 1, 2, 3.
a
b
a
a
b b
b
b
b
b
c
a
a
a
d
a
c
c
c
c
b
d
d
d d
e
e
f
f
a
e
f
d c
b
a
The 4g edges of the polygon become a union of 2g circles in the surface, all inter
secting in a single point. One can think of the interior of the polygon as an open
disk, or 2 cell, attached to the union of these circles. One can also regard the union
of the circles as being obtained from a point, their common point of intersection, by
6 Chapter 0. Some Underlying Geometric Notions
attaching 2g open arcs, or 1 cells. Thus the surface can be built up in stages: Start
with a point, attach 1 cells to this point, then attach a 2 cell.
Anatural generalization of this is to construct a space by the following procedure:
(1) Start with a discrete set X
0
, whose points are regarded as 0 cells.
(2) Inductively, form the n skeleton X
n
from X
n−1
by attaching n cells e
n
α
via
maps ϕ
α
: S
n−1
→X
n−1
. That is, X
n
is the quotient space of the disjoint union
X
n−1
¸
α
D
n
α
of X
n−1
with a collection of n disks D
n
α
under the identiﬁcations
x ∼ ϕ
α
(x) for x ∈ ∂D
n
α
. Thus as a set, X
n
= X
n−1
¸
α
e
n
α
where each e
n
α
is an
open n disk.
(3) One can either stop this inductive process at a ﬁnite stage, setting X = X
n
for
some n < ∞, or one can continue indeﬁnitely, setting X =
n
X
n
. In the latter
case X is given the weak topology: A set A ⊂ X is open (or closed) iff A∩X
n
is
open (or closed) in X
n
for each n.
A space X constructed in this way is called a cell complex, or more classically, a
CW complex. The explanation of the letters ‘CW’ is given in the Appendix, where a
number of basic topological properties of cell complexes are proved. The reader who
wonders about various pointset topological questions that lurk in the background of
the following discussion should consult the Appendix for details.
Example 0.1. A 1 dimensional cell complex X = X
1
is what is called a graph in
algebraic topology. It consists of vertices (the 0 cells) to which edges (the 1 cells) are
attached. The two ends of an edge can be attached to the same vertex.
Example 0.2. The house with two rooms, pictured earlier, has a visually obvious
2 dimensional cell complex structure. The 0 cells are the vertices where three or more
of the depicted edges meet, and the 1 cells are the interiors of the edges connecting
these vertices. This gives the 1 skeleton X
1
, and the 2 cells are the components of
the remainder of the space, X −X
1
. If one counts up, one ﬁnds there are 29 0 cells,
51 1 cells, and 23 2 cells, with the alternating sum 29 −51 +23 equal to 1. This is
the Euler characteristic, which for a cell complex with ﬁnitely many cells is deﬁned
to be the number of evendimensional cells minus the number of odddimensional
cells. As we shall show in Theorem 2.44, the Euler characteristic of a cell complex
depends only on its homotopy type, so the fact that the house with two rooms has the
homotopy type of a point implies that its Euler characteristic must be 1, no matter
how it is represented as a cell complex.
Example 0.3. The sphere S
n
has the structure of a cell complex with just two cells, e
0
and e
n
, the n cell being attached by the constant map S
n−1
→e
0
. This is equivalent
to regarding S
n
as the quotient space D
n
/∂D
n
.
Example 0.4. Real projective n space RP
n
is deﬁned to be the space of all lines
through the origin in R
n+1
. Each such line is determined by a nonzero vector in R
n+1
,
Cell Complexes 7
unique up to scalar multiplication, and RP
n
is topologized as the quotient space of
R
n+1
−¦0¦ under the equivalence relation v ∼ λv for scalars λ ≠ 0. We can restrict
to vectors of length 1, so RP
n
is also the quotient space S
n
/(v ∼ −v), the sphere
with antipodal points identiﬁed. This is equivalent to saying that RP
n
is the quotient
space of a hemisphere D
n
with antipodal points of ∂D
n
identiﬁed. Since ∂D
n
with
antipodal points identiﬁed is just RP
n−1
, we see that RP
n
is obtained from RP
n−1
by
attaching an n cell, with the quotient projection S
n−1
→RP
n−1
as the attaching map.
It follows by induction on n that RP
n
has a cell complex structure e
0
∪e
1
∪··· ∪e
n
with one cell e
i
in each dimension i ≤ n.
Example 0.5. Since RP
n
is obtained from RP
n−1
by attaching an n cell, the inﬁnite
union RP
∞
=
n
RP
n
becomes a cell complex with one cell in each dimension. We
can view RP
∞
as the space of lines through the origin in R
∞
=
n
R
n
.
Example 0.6. Complex projective n space CP
n
is the space of complex lines through
the origin in C
n+1
, that is, 1 dimensional vector subspaces of C
n+1
. As in the case
of RP
n
, each line is determined by a nonzero vector in C
n+1
, unique up to scalar
multiplication, and CP
n
is topologized as the quotient space of C
n+1
−¦0¦ under the
equivalence relation v ∼ λv for λ ≠ 0. Equivalently, this is the quotient of the unit
sphere S
2n+1
⊂ C
n+1
with v ∼ λv for ¦λ¦ = 1. It is also possible to obtain CP
n
as a
quotient space of the disk D
2n
under the identiﬁcations v ∼ λv for v ∈ ∂D
2n
, in the
following way. The vectors in S
2n+1
⊂ C
n+1
with last coordinate real and nonnegative
are precisely the vectors of the form (w,
1 −¦w¦
2
) ∈ C
n
×C with ¦w¦ ≤ 1. Such
vectors form the graph of the function w
1 −¦w¦
2
. This is a disk D
2n
+
bounded
by the sphere S
2n−1
⊂ S
2n+1
consisting of vectors (w, 0) ∈ C
n
×C with ¦w¦ = 1. Each
vector in S
2n+1
is equivalent under the identiﬁcations v ∼ λv to a vector in D
2n
+
, and
the latter vector is unique if its last coordinate is nonzero. If the last coordinate is
zero, we have just the identiﬁcations v ∼ λv for v ∈ S
2n−1
.
From this description of CP
n
as the quotient of D
2n
+
under the identiﬁcations
v ∼ λv for v ∈ S
2n−1
it follows that CP
n
is obtained from CP
n−1
by attaching a
cell e
2n
via the quotient map S
2n−1
→CP
n−1
. So by induction on n we obtain a cell
structure CP
n
= e
0
∪e
2
∪··· ∪e
2n
with cells only in even dimensions. Similarly, CP
∞
has a cell structure with one cell in each even dimension.
Each cell e
n
α
in a cell complex X has a characteristic map Φ
α
: D
n
α
→X that
extends the attaching map ϕ
α
and is a homeomorphism from the interior of D
n
α
onto e
n
α
. Namely, we can take Φ
α
to be the composition D
n
α
X
n−1
¸
α
D
n
α
→X
n
X
where the middle map is the quotient map deﬁning X
n
. For example, in the canonical
cell structure on S
n
described in Example 0.3, a characteristic map for the n cell is
the quotient map D
n
→S
n
collapsing ∂D
n
to a point. For RP
n
a characteristic map
for the cell e
i
is the quotient map D
i
→RP
i
⊂ RP
n
identifying antipodal points of
∂D
i
, and similarly for CP
n
.
8 Chapter 0. Some Underlying Geometric Notions
A subcomplex of a cell complex X is a closed subspace A ⊂ X that is a union
of cells of X. Since A is closed, the characteristic map of each cell in A has image
contained in A, and in particular the image of the attaching map of each cell in A is
contained in A, so A is a cell complex in its own right. A pair (X, A) consisting of a
cell complex X and a subcomplex A we call a CW pair.
For example, each skeleton X
n
of a cell complex X is a subcomplex. Particular
cases of this are the subcomplexes RP
k
⊂ RP
n
and CP
k
⊂ CP
n
for k ≤ n. These are
in fact the only subcomplexes of RP
n
and CP
n
.
There are natural inclusions S
0
⊂ S
1
⊂ ··· ⊂ S
n
, but these subspheres are not
subcomplexes of S
n
in its usual cell structure with just two cells. However, we can give
S
n
a different cell structure in which each of the subspheres S
k
is a subcomplex, by
regarding each S
k
as being obtained inductively fromthe equatorial S
k−1
by attaching
two k cells, the components of S
k
−S
k−1
. The inﬁnitedimensional sphere S
∞
=
n
S
n
then becomes a cell complex as well. Note that the twotoone quotient map S
∞
→RP
∞
that identiﬁes antipodal points of S
∞
identiﬁes the two n cells of S
∞
to the single
n cell of RP
∞
.
In the examples of cell complexes given so far, the closure of each cell is a sub
complex, and more generally the closure of any collection of cells is a subcomplex.
Most naturally arising cell structures have this property, but it need not hold in gen
eral. For example, if we start with S
1
with its minimal cell structure and attach to this
a 2 cell by a map S
1
→S
1
whose image is a nontrivial subarc of S
1
, then the closure
of the 2 cell is not a subcomplex since it contains only a part of the 1 cell.
Operations on Spaces
Cell complexes have a very nice mixture of rigidity and ﬂexibility, with enough
rigidity to allow many arguments to proceed in a combinatorial cellbycell fashion,
and enough ﬂexibility to allow many natural constructions to be performed on them.
Here are some of those constructions.
Products. If X and Y are cell complexes, then X×Y has the structure of a cell complex
with cells the products e
m
α
×e
n
β
where e
m
α
ranges over the cells of X and e
n
β
ranges
over the cells of Y . For example, the cell structure on the torus S
1
×S
1
described at
the beginning of this section is obtained in this way from the standard cell structure
on S
1
. In the general case there is one small complication, however: The topology on
X×Y as a cell complex is sometimes slightly weaker than the product topology, with
more open sets than the product topology has, though the two topologies coincide if
either X or Y has only ﬁnitely many cells, or if both X and Y have countably many
cells. This is explained in the Appendix. In practice this subtle point of pointset
topology rarely causes problems.
Operations on Spaces 9
Quotients. If (X, A) is a CW pair consisting of a cell complex X and a subcomplex A,
then the quotient space X/A inherits a natural cell complex structure from X. The
cells of X/A are the cells of X−A plus one new 0 cell, the image of A in X/A. For a cell
e
n
α
of X −A attached by ϕ
α
: S
n−1
→X
n−1
, the attaching map for the corresponding
cell in X/A is the composition S
n−1
→X
n−1
→X
n−1
/A
n−1
.
For example, if we give S
n−1
any cell structure and build D
n
from S
n−1
by attach
ing an n cell, then the quotient D
n
/S
n−1
is S
n
with its usual cell structure. As another
example, take X to be a closed orientable surface with the cell structure described at
the beginning of this section, with a single 2 cell, and let A be the complement of this
2 cell, the 1 skeleton of X. Then X/A has a cell structure consisting of a 0 cell with
a 2 cell attached, and there is only one way to attach a cell to a 0 cell, by the constant
map, so X/A is S
2
.
Suspension. For a space X, the suspension SX is the quotient of X×I obtained
by collapsing X×¦0¦ to one point and X×¦1¦ to another point. The motivating
example is X = S
n
, when SX = S
n+1
with the two ‘suspension points’ at
the north and south poles of S
n+1
, the points (0, ··· , 0, :1). One can
regard SX as a double cone on X, the union of two copies of the cone
CX = (X×I)/(X×¦0¦). If X is a CW complex, so are SX and CX
as quotients of X×I with its product cell structure, I being given the
standard cell structure of two 0 cells joined by a 1 cell.
Suspension becomes increasingly important the farther one goes into algebraic
topology, though why this should be so is certainly not evident in advance. One
especially useful property of suspension is that not only spaces but also maps can be
suspended. Namely, a map f : X→Y suspends to Sf : SX→SY , the quotient map of
f ×11: X×I→Y ×I .
Join. The cone CX is the union of all line segments joining points of X to an external
vertex, and similarly the suspension SX is the union of all line segments joining points
of X to two external vertices. More generally, given X and a second space Y , one can
deﬁne the space of all lines segments joining points in X to points in Y . This is
the join X ∗ Y , the quotient space of X×Y ×I under the identiﬁcations (x, y
1
, 0) ∼
(x, y
2
, 0) and (x
1
, y, 1) ∼ (x
2
, y, 1). Thus we are collapsing the subspace X×Y ×¦0¦
to X and X×Y ×¦1¦ to Y . For example,
if X and Y are both closed intervals, then
we are collapsing two opposite faces of a
cube onto line segments so that it becomes
a tetrahedron. In the general case, X ∗Y
X
I
Y
contains copies of X and Y at its two ‘ends,’ and every other point (x, y, t) in X∗Y is
on a unique line segment joining the point x ∈ X ⊂ X∗Y to the point y ∈ Y ⊂ X∗Y ,
the segment obtained by ﬁxing x and y and letting the coordinate t in (x, y, t) vary.
10 Chapter 0. Some Underlying Geometric Notions
Anice way to write points of X∗Y is as formal linear combinations t
1
x+t
2
y with
0 ≤ t
i
≤ 1 and t
1
+t
2
= 1, subject to the rules 0x +1y = y and 1x +0y = x which
correspond exactly to the identiﬁcations that deﬁne X∗Y . In much the same way, an
iterated join X
1
∗···∗X
n
can be regarded as the space of formal linear combinations
t
1
x
1
+ ··· + t
n
x
n
with 0 ≤ t
i
≤ 1 and t
1
+ ··· + t
n
= 1, with the convention that
terms 0t
i
can be omitted. This viewpoint makes it easy to see that the join operation
is associative. A very special case that plays a central role in algebraic topology is
when each X
i
is just a point. For example, the join of two points is a line segment, the
join of three points is a triangle, and the join of four points is a tetrahedron. The join
of n points is a convex polyhedron of dimension n−1 called a simplex. Concretely,
if the n points are the n standard basis vectors for R
n
, then their join is the space
∆
n−1
= ¦ (t
1
, ··· , t
n
) ∈ R
n
¦
¦ t
1
+··· +t
n
= 1 and t
i
≥ 0¦.
Another interesting example is when each X
i
is S
0
, two points. If we take the two
points of X
i
to be the two unit vectors along the i
th
coordinate axis in R
n
, then the
join X
1
∗···∗X
n
is the union of 2
n
copies of the simplex ∆
n−1
, and radial projection
from the origin gives a homeomorphism between X
1
∗··· ∗X
n
and S
n−1
.
If X and Y are CW complexes, then there is a natural CW structure on X ∗ Y
having the subspaces X and Y as subcomplexes, with the remaining cells being the
product cells of X×Y ×(0, 1). As usual with products, the CW topology on X∗Y may
be weaker than the quotient of the product topology on X×Y ×I .
Wedge Sum. This is a rather trivial but still quite useful operation. Given spaces X and
Y with chosen points x
0
∈ X and y
0
∈ Y , then the wedge sum X ∨Y is the quotient
of the disjoint union X IY obtained by identifying x
0
and y
0
to a single point. For
example, S
1
∨ S
1
is homeomorphic to the ﬁgure ‘8,’ two circles touching at a point.
More generally one could form the wedge sum
α
X
α
of an arbitrary collection of
spaces X
α
by starting with the disjoint union
¸
α
X
α
and identifying points x
α
∈ X
α
to a single point. In case the spaces X
α
are cell complexes and the points x
α
are
0 cells, then
α
X
α
is a cell complex since it is obtained from the cell complex
¸
α
X
α
by collapsing a subcomplex to a point.
For any cell complex X, the quotient X
n
/X
n−1
is a wedge sumof n spheres
α
S
n
α
,
with one sphere for each n cell of X.
Smash Product. Like suspension, this is another construction whose importance be
comes evident only later. Inside a product space X×Y there are copies of X and Y ,
namely X×¦y
0
¦ and ¦x
0
¦×Y for points x
0
∈ X and y
0
∈ Y . These two copies of X
and Y in X×Y intersect only at the point (x
0
, y
0
), so their union can be identiﬁed
with the wedge sum X ∨Y . The smash product X ∧Y is then deﬁned to be the quo
tient X×Y/X ∨ Y . One can think of X ∧ Y as a reduced version of X×Y obtained
by collapsing away the parts that are not genuinely a product, the separate factors X
and Y .
Two Criteria for Homotopy Equivalence 11
The smash product X∧Y is a cell complex if X and Y are cell complexes with x
0
and y
0
0 cells, assuming that we give X×Y the cellcomplex topology rather than the
product topology in cases when these two topologies differ. For example, S
m
∧S
n
has
a cell structure with just two cells, of dimensions 0 and m+n, hence S
m
∧S
n
= S
m+n
.
In particular, when m= n = 1 we see that collapsing longitude and meridian circles
of a torus to a point produces a 2 sphere.
Two Criteria for Homotopy Equivalence
Earlier in this chapter the main tool we used for constructing homotopy equiva
lences was the fact that a mapping cylinder deformation retracts onto its ‘target’ end.
By repeated application of this fact one can often produce homotopy equivalences
between rather differentlooking spaces. However, this process can be a bit cumber
some in practice, so it is useful to have other techniques available as well. Here is one
that can be quite helpful:
(1)
If (X, A) is a CW pair consisting of a CW complex X and a contractible subcom
plex A, then the quotient map X→X/A is a homotopy equivalence.
A proof of this will be given later in Proposition 0.17, but let us look at some examples
now.
Example 0.7: Graphs. The three graphs are homotopy equivalent
since each is a deformation retract of a disk with two holes, but we can also deduce
this from statement (1) above since collapsing the middle edge of the ﬁrst and third
graphs produces the second graph.
More generally, suppose X is any graph with ﬁnitely many vertices and edges. If
the two endpoints of any edge of X are distinct, we can collapse this edge to a point,
producing a homotopy equivalent graph with one fewer edge. This simpliﬁcation can
be repeated until all edges of X are loops, hence each component of X is either an
isolated vertex or a wedge sum of circles.
This raises the question of whether two such graphs, having only one vertex in
each component, can be homotopy equivalent if they are not in fact just isomorphic
graphs. Exercise 12 at the end of the chapter reduces the question to the case of
connected graphs. Then the task is to prove that a wedge sum
m
S
1
of m circles is not
homotopy equivalent to
n
S
1
if m≠ n. This sort of thing is hard to do directly. What
one would like is some sort of algebraic object associated to spaces, depending only
on their homotopy type, and taking different values for
m
S
1
and
n
S
1
if m≠ n. In
fact the Euler characteristic does this since
m
S
1
has Euler characteristic 1−m. But it
is a rather nontrivial theorem that the Euler characteristic of a space depends only on
its homotopy type. A different algebraic invariant that works equally well for graphs,
and whose rigorous development requires less effort than the Euler characteristic, is
the fundamental group of a space, the subject of Chapter 1.
12 Chapter 0. Some Underlying Geometric Notions
Example 0.8. Consider the space X obtained from S
2
by attaching the two ends of
an arc A to two distinct points on the sphere, say the north and south poles. Let B
be an arc in S
2
joining the two points where A attaches. Then X can be given a CW
complex structure with the two endpoints of A and B as 0 cells, the interiors of A
and B as 1 cells, and the rest of S
2
as a 2 cell. Since A and B are contractible, X/A
and X/B are homotopy equivalent to X. The space X/A is the quotient S
2
/S
0
, the
sphere with two points identiﬁed, and X/B is S
1
∨S
2
. Hence S
2
/S
0
and S
1
∨S
2
are
homotopy equivalent, which might not have been entirely obvious a priori.
A
B
X
X/
X/
B
A
Example 0.9. Let X be the union of a torus with n meridional disks. To obtain a CW
structure on X, choose a longitudinal circle in X, intersecting each of the meridional
disks in one point. These intersection points are then the 0 cells, the 1 cells are the
rest of the longitudinal circle and the boundary circles of the meridional disks, and
the 2 cells are the remaining regions of the torus and the interiors of the meridional
disks.
X
Y Z
W
Collapsing each meridional disk to a point yields a homotopy equivalent space Y
consisting of n 2 spheres, each tangent to its two neighbors, a ‘necklace with n
beads.’ The third space Z in the ﬁgure, a strand of n beads with a string joining
its two ends, collapses to Y by collapsing the string to a point, so this collapse is a
homotopy equivalence. Finally, by collapsing the arc in Z formed by the front halves
of the equators of the n beads, we obtain the fourth space W, a wedge sum of S
1
with n 2 spheres. (One can see why a wedge sum is sometimes called a ‘bouquet’ in
the older literature.)
Example 0.10: Reduced Suspension. Let X be a CW complex and x
0
∈ X a 0 cell.
Inside the suspension SX we have the line segment ¦x
0
¦×I , and collapsing this to a
point yields a space ΣX homotopy equivalent to SX, called the reduced suspension
of X. For example, if we take X to be S
1
∨ S
1
with x
0
the intersection point of the
two circles, then the ordinary suspension SX is the union of two spheres intersecting
along the arc ¦x
0
¦×I , so the reduced suspension ΣX is S
2
∨ S
2
, a slightly simpler
Two Criteria for Homotopy Equivalence 13
space. More generally we have Σ(X ∨ Y) = ΣX ∨ ΣY for arbitrary CW complexes X
and Y . Another way in which the reduced suspension ΣX is slightly simpler than SX
is in its CW structure. In SX there are two 0 cells (the two suspension points) and an
(n+1) cell e
n
×(0, 1) for each n cell e
n
of X, whereas in ΣX there is a single 0 cell
and an (n+1) cell for each n cell of X other than the 0 cell x
0
.
The reduced suspension ΣX is actually the same as the smash product X ∧ S
1
since both spaces are the quotient of X×I with X×∂I ∪¦x
0
¦×I collapsed to a point.
Another common way to change a space without changing its homotopy type in
volves the idea of continuously varying how its parts are attached together. A general
deﬁnition of ‘attaching one space to another’ that includes the case of attaching cells
is the following. We start with a space X
0
and another space X
1
that we wish to
attach to X
0
by identifying the points in a subspace A ⊂ X
1
with points of X
0
. The
data needed to do this is a map f : A→X
0
, for then we can form a quotient space
of X
0
I X
1
by identifying each point a ∈ A with its image f(a) ∈ X
0
. Let us de
note this quotient space by X
0
L
f
X
1
, the space X
0
with X
1
attached along A via f .
When (X
1
, A) = (D
n
, S
n−1
) we have the case of attaching an n cell to X
0
via a map
f : S
n−1
→X
0
.
Mapping cylinders are examples of this construction, since the mapping cylinder
M
f
of a map f : X→Y is the space obtained from Y by attaching X×I along X×¦1¦
via f . Closely related to the mapping cylinder M
f
is the mapping cone C
f
= Y L
f
CX
where CX is the cone (X×I)/(X×¦0¦) and we attach this to Y along
X×¦1¦ via the identiﬁcations (x, 1) ∼ f(x). For example, when X
is a sphere S
n−1
the mapping cone C
f
is the space obtained from
Y by attaching an n cell via f : S
n−1
→Y . A mapping cone C
f
can
also be viewed as the quotient M
f
/X of the mapping cylinder M
f
with the subspace
X = X×¦0¦ collapsed to a point.
CX
Y
Here is our second criterion for homotopy equivalence:
(2)
If (X
1
, A) is a CW pair and we have two attaching maps f, g : A→X
0
that are
homotopic, then X
0
L
f
X
1
= X
0
L
g
X
1
.
Again let us defer the proof and look at some examples.
Example 0.11. Let us rederive the result in Example 0.8 that a sphere with two points
A
S
1
S
2
identiﬁed is homotopy equivalent to S
1
∨S
2
. The sphere with
two points identiﬁed can be obtained by attaching S
2
to S
1
by a map that wraps a closed arc A in S
2
around S
1
, as
shown in the ﬁgure. Since A is contractible, this attaching
map is homotopic to a constant map, and attaching S
2
to S
1
via a constant map of A yields S
1
∨S
2
. The result then follows from (2) since (S
2
, A)
is a CW pair, S
2
being obtained from A by attaching a 2 cell.
14 Chapter 0. Some Underlying Geometric Notions
Example 0.12. In similar fashion we can see that the necklace in Example 0.9 is
homotopy equivalent to the wedge sum of a circle with n 2 spheres. The necklace
can be obtained from a circle by attaching n 2 spheres along arcs, so the necklace
is homotopy equivalent to the space obtained by attaching n 2 spheres to a circle
at points. Then we can slide these attaching points around the circle until they all
coincide, producing the wedge sum.
Example 0.13. Here is an application of the earlier fact that collapsing a contractible
subcomplex is a homotopy equivalence: If (X, A) is a CW pair, consisting of a cell
complex X and a subcomplex A, then X/A = X ∪ CA, the mapping cone of the
inclusion A
X. For we have X/A = (X∪CA)/CA = X∪CA since CA is a contractible
subcomplex of X ∪CA.
Example 0.14. If (X, A) is a CW pair and A is contractible in X, i.e., the inclusion
A
X is homotopic to a constant map, then X/A = X∨SA. Namely, by the previous
example we have X/A = X ∪CA, and then since A is contractible in X, the mapping
cone X ∪CA of the inclusion A
X is homotopy equivalent to the mapping cone of
a constant map, which is X ∨ SA. For example, S
n
/S
i
= S
n
∨ S
i+1
for i < n, since
S
i
is contractible in S
n
if i < n. In particular this gives S
2
/S
0
= S
2
∨ S
1
, which is
Example 0.8 again.
The Homotopy Extension Property
In this ﬁnal section of the chapter we shall actually prove a fewthings, in particular
the two criteria for homotopy equivalence described above and the fact that any two
homotopy equivalent spaces can be embedded as deformation retracts of the same
space.
The proofs depend upon a technical property that arises in many other contexts
as well. Consider the following problem. Suppose one is given a map f
0
: X→Y , and
on a subspace A ⊂ X one is also given a homotopy f
t
: A→Y of f
0
¦
¦A that one would
like to extend to a homotopy f
t
: X→Y of the given f
0
. If the pair (X, A) is such that
this extension problem can always be solved, one says that (X, A) has the homotopy
extension property. Thus (X, A) has the homotopy extension property if every map
X×¦0¦ ∪A×I→Y can be extended to a map X×I→Y .
In particular, the homotopy extension property for (X, A) implies that the iden
tity map X×¦0¦ ∪A×I→X×¦0¦ ∪A×I extends to a map X×I→X×¦0¦ ∪A×I , so
X×¦0¦ ∪ A×I is a retract of X×I . The converse is also true: If there is a retraction
X×I→X×¦0¦ ∪ A×I , then by composing with this retraction we can extend every
map X×¦0¦ ∪A×I→Y to a map X×I→Y . Thus the homotopy extension property
for (X, A) is equivalent to X×¦0¦ ∪A×I being a retract of X×I . This implies for ex
ample that if (X, A) has the homotopy extension property, then so does (X×Z, A×Z)
for any space Z, a fact that would not be so easy to prove directly from the deﬁnition.
The Homotopy Extension Property 15
If (X, A) has the homotopy extension property, then A must be a closed subspace
of X, at least when X is Hausdorff. For if r : X×I→X×I is a retraction onto the
subspace X×¦0¦ ∪ A×I , then the image of r is the set of points z ∈ X×I with
r(z) = z, a closed set if X is Hausdorff, so X×¦0¦∪A×I is closed in X×I and hence
A is closed in X.
A simple example of a pair (X, A) with A closed for which the homotopy exten
sion property fails is the pair (I, A) where A = ¦0, 1,
1
/
2
,
1
/
3
,
1
/
4
, ···¦. It is not hard to
show that there is no continuous retraction I ×I→I ×¦0¦ ∪A×I . The breakdown of
homotopy extension here can be attributed to the bad structure of (X, A) near 0.
With nicer local structure the homotopy extension property does hold, as the next
example shows.
Example 0.15. A pair (X, A) has the homotopy extension property if A has a map
ping cylinder neighborhood, in the following sense: There is a map f : Z→A and a
homeomorphism h from M
f
onto a closed neighborhood N of A in X, with h¦
¦A = 11
and with h(M
f
− Z) an open neighborhood of A. Mapping cylinder neighborhoods
like this occur more frequently than one might think. For example, the thick let
ters discussed at the beginning of the chapter provide such neighborhoods of the
thin letters, regarded as subspaces of the plane. To verify the homotopy extension
property, notice ﬁrst that I ×I retracts onto I ×¦0¦ ∪ ∂I ×I , hence Z×I ×I retracts
onto Z×I ×¦0¦ ∪ Z×∂I ×I , and this retraction induces a retraction of M
f
×I onto
M
f
×¦0¦∪(ZIA)×I . Thus (M
f
, ZIA) has the homotopy extension property, which
implies that (X, A) does also since given a map X→Y and a homotopy of its restric
tion to A, we can take the constant homotopy on the closure of X−N and then apply
the homotopy extension property for (M
f
, Z IA) to extend the homotopy over N.
Most applications of the homotopy extension property in this book will stemfrom
the following general result:
Proposition 0.16. If (X, A) is a CWpair, then X×¦0¦∪A×I is a deformation retract
of X×I , hence (X, A) has the homotopy extension property.
Proof: There is a retraction r : D
n
×I→D
n
×¦0¦ ∪∂D
n
×I , for example
the radial projection from the point (0, 2) ∈ D
n
×R. Then setting
r
t
= tr + (1 − t)11 gives a deformation retraction of D
n
×I onto
D
n
×¦0¦ ∪ ∂D
n
×I . This deformation retraction gives rise to a
deformation retraction of X
n
×I onto X
n
×¦0¦ ∪ (X
n−1
∪ A
n
)×I
since X
n
×I is obtained from X
n
×¦0¦ ∪(X
n−1
∪A
n
)×I by attach
ing copies of D
n
×I along D
n
×¦0¦ ∪∂D
n
×I . If we perform the deformation retrac
tion of X
n
×I onto X
n
×¦0¦ ∪(X
n−1
∪A
n
)×I during the t interval [1/2
n+1
, 1/2
n
],
this inﬁnite concatenation of homotopies is a deformation retraction of X×I onto
X×¦0¦ ∪ A×I . (There is no problem with continuity of this deformation retraction
at t = 0 since it is continuous on X
n
×I , being stationary there during the t interval
16 Chapter 0. Some Underlying Geometric Notions
[0, 1/2
n+1
], and CW complexes have the weak topology with respect to their skeleta
so a map is continuous iff its restriction to each skeleton is continuous.) L¦
Now we can prove the following generalization of the earlier criterion (1) for ho
motopy equivalence:
Proposition 0.17. If the pair (X, A) satisﬁes the homotopy extension property and
A is contractible, then the quotient map q : X→X/A is a homotopy equivalence.
Proof: Let f
t
: X→X be a homotopy extending a contraction of A, with f
0
= 11. Since
f
t
(A) ⊂ A for all t , the composition qf
t
sends A to a point and hence factors as a
composition X
q
→X/A
f
t
→X/A. Thus we have qf
t
= f
t
q in the ﬁrst of the following
two diagrams:
X
X/
X
A X/A
q q
f
t
f
t
X
X/
X
A X/A
q
g
q
f
1
f
1
−−−−−−−−−−−−→
−−−−−−−−→
−
−
−
−
−
−
→
−
−
−
−
−
−
→
−−−−−−−−−−−−→
−
−
−
−
−
−
−
−
−
−
−
−
→
−−−−−−−−→
−
−
−
−
−
−
→
−
−
−
−
−
−
→
− −
When t = 1 we have f
1
(A) equal to a point, the point to which A contracts, so f
1
induces a map g : X/A→X with gq = f
1
. It follows that qg = f
1
since qg(x) =
qgq(x) = qf
1
(x) = f
1
q(x) = f
1
(x). The maps g and q are inverse homotopy
equivalences since gq = f
1
= f
0
= 11 via f
t
and qg = f
1
= f
0
= 11 via f
t
. L¦
Another application of the homotopy extension property, giving a slightly more
reﬁned version of the criterion (2) for homotopy equivalence, is the following:
Proposition 0.18. If (X
1
, A) is a CW pair and we have attaching maps f, g : A→X
0
that are homotopic, then X
0
L
f
X
1
= X
0
L
g
X
1
rel X
0
.
Here the deﬁnition of W = Z rel Y for pairs (W, Y) and (Z, Y) is that there are
maps ϕ: W→Z and ψ: Z→W restricting to the identity on Y , such that ψϕ = 11
and ϕψ = 11 via homotopies that restrict to the identity on Y at all times.
Proof: If F : A×I→X
0
is a homotopy from f to g, consider the space X
0
L
F
(X
1
×I).
This contains both X
0
L
f
X
1
and X
0
L
g
X
1
as subspaces. A deformation retraction
of X
1
×I onto X
1
×¦0¦∪A×I as in Proposition 0.16 induces a deformation retraction
of X
0
L
F
(X
1
×I) onto X
0
L
f
X
1
. Similarly X
0
L
F
(X
1
×I) deformation retracts onto
X
0
L
g
X
1
. Both these deformation retractions restrict to the identity on X
0
, so together
they give a homotopy equivalence X
0
L
f
X
1
= X
0
L
g
X
1
rel X
0
. L¦
We ﬁnish this chapter with a technical result whose proof will involve several
applications of the homotopy extension property:
The Homotopy Extension Property 17
Proposition 0.19. Suppose (X, A) and (Y, A) satisfy the homotopy extension prop
erty, and f : X→Y is a homotopy equivalence with f ¦
¦A = 11. Then f is a homotopy
equivalence rel A.
Corollary 0.20. If (X, A) satisﬁes the homotopy extension property and the inclusion
A
X is a homotopy equivalence, then A is a deformation retract of X.
Proof: Apply the proposition to the inclusion A
X. L¦
Corollary 0.21. A map f : X→Y is a homotopy equivalence iff X is a deformation
retract of the mapping cylinder M
f
. Hence, two spaces X and Y are homotopy
equivalent iff there is a third space containing both X and Y as deformation retracts.
Proof: The inclusion i : X
M
f
is homotopic to the composition jf where j is the
inclusion Y
M
f
, a homotopy equivalence. It then follows from Exercise 3 at the
end of the chapter that i is a homotopy equivalence iff f is a homotopy equivalence.
This gives the ‘if’ half of the ﬁrst statement of the corollary. For the converse, the pair
(M
f
, X) satisﬁes the homotopy extension property by Example 0.15, so the ‘only if’
implication follows from the preceding corollary. L¦
Proof of 0.19: Let g : Y→X be a homotopy inverse for f , and let h
t
: X→X be a
homotopy from gf = h
0
to 11 = h
1
. We will use h
t
to deform g to a map g
1
with
g
1
¦
¦A = 11. Since f ¦
¦A = 11, we can view h
t
¦
¦A as a homotopy from g¦
¦A to 11. Then
since we assume (X, A) has the homotopy extension property, we can extend this
homotopy to a homotopy g
t
: Y→X from g = g
0
to a map g
1
with g
1
¦
¦A = 11.
Our next task is to construct a homotopy g
1
f = 11 rel A. Since g = g
1
via g
t
we have gf = g
1
f via g
t
f . We also have gf = 11 via h
t
, so since homotopy is an
equivalence relation by Exercise 3 at the end of the Chapter, we have g
1
f = 11. An
explicit homotopy that shows this is
k
t
=
g
1−2t
f, 0 ≤ t ≤
1
/
2
h
2t−1
,
1
/
2
≤ t ≤ 1
Note that the two deﬁnitions agree when t =
1
/
2
since f ¦
¦A = 11 and g
t
= h
t
on A.
The homotopy k
t
¦
¦A starts and ends with the identity, and its second half simply
retraces its ﬁrst half, that is, k
t
= k
1−t
on A. In this situation we deﬁne a ‘homotopy
of homotopies’ k
tu
: A→A by means of the ﬁgure to the right showing the parameter
domain I ×I for the pairs (t, u), with the t axis horizontal and the
u axis vertical. On the bottomedge of the square we deﬁne k
t0
= k
t
¦
¦A.
Belowthe ‘V’ we deﬁne k
tu
to be independent of u, and above the ‘V’ we
deﬁne k
tu
to be independent of t . This is unambiguous since k
t
= k
1−t
on A. Since k
0
= 11, we have k
tu
= 11 for (t, u) in the left, right, and top edges of the
square. Since (X, A) has the homotopy extension property, so does (X×I, A×I) by
the initial remarks on the homotopy extension property. Viewing k
tu
as a homotopy
18 Chapter 0. Some Underlying Geometric Notions
of k
t
, we can therefore extend k
tu
: A→A to k
tu
: X→X with k
t0
= k
t
: X→X. Now
if we restrict this k
tu
to the left, top, and right edges of the (t, u) square we get a
homotopy g
1
f = 11 rel A.
Since g
1
= g, we have fg
1
= fg = 11, so the preceding argument can be repeated
with the pair f, g replaced by g
1
, f . The result is a map f
1
: X→X with f
1
¦
¦A = 11
and f
1
g
1
= 11 rel A. Hence f
1
= f
1
(g
1
f) = (f
1
g
1
)f = f rel A and so fg
1
= f
1
g
1
=
11 rel A. Thus g
1
is a homotopy inverse to f rel A. L¦
Exercises
1. Construct an explicit deformation retraction of the torus with one point deleted
onto a graph consisting of two circles intersecting in a point, namely, longitude and
meridian circles of the torus.
2. Construct an explicit deformation retraction of R
n
−¦0¦ onto S
n−1
.
3. (a) Show that the composition of homotopy equivalences X→Y and Y→Z is a
homotopy equivalence X→Z. Deduce that homotopy equivalence is an equivalence
relation.
(b) Show that the relation of homotopy among maps X→Y is an equivalence relation.
(c) Show that a map homotopic to a homotopy equivalence is a homotopy equivalence.
4. A deformation retraction in the weak sense of a space X to a subspace A is a
homotopy f
t
: X→X such that f
0
= 11, f
1
(X) ⊂ A, and f
t
(A) ⊂ A for all t . Show
that if X deformation retracts to A in this weak sense, then the inclusion A
X is
a homotopy equivalence.
5. Show that if a space X deformation retracts to a point x ∈ X, then for each
neighborhood U of x in X there exists a neighborhood V ⊂ U of x such that the
inclusion V
U is nullhomotopic.
6. (a) Let X be the subspace of R
2
consisting of the horizontal seg
ment [0, 1]×¦0¦ together with all the vertical segments ¦r¦×[0, 1−r]
for r a rational number in [0, 1]. Show that X deformation retracts
to any point in the segment [0, 1]×¦0¦, but not to any other point.
[See the preceding problem.]
(b) Let Y be the subspace of R
2
that is the union of an inﬁnite number of copies of X
arranged as in the ﬁgure below. Show that Y is contractible but does not deformation
retract onto any point.
Chapter 0. Some Underlying Geometric Notions 19
(c) Let Z be the zigzag subspace of Y homeomorphic to R indicated by the heavier
line. Show there is a deformation retraction in the weak sense (see Exercise 4) of Y
onto Z, but no true deformation retraction.
7. Fill in the details in the following construction from [Edwards] of a compact space
Y ⊂ R
3
with the same properties as the space Y in Exercise 6, that is, Y is contractible
but does not deformation retract to any point. To begin, let X be the union of an in
ﬁnite sequence of cones on the Cantor set arranged endtoend, as in the ﬁgure. Next,
form the onepoint compactiﬁcation of X×R. This
embeds i0.8 n R
3
as a closed disk with curved ‘ﬁns’
attached along circular arcs, and with the onepoint
compactiﬁcation of X as a crosssectional slice. Fi
nally, Y is obtained from this by wrapping one more
cone on the Cantor set around the boundary of the
disk.
X
Y
8. For n > 2, construct an n room analog of the house with two rooms.
9. Show that a retract of a contractible space is contractible.
10. Show that a space X is contractible iff every map f : X→Y , for arbitrary Y , is
nullhomotopic. Similarly, show X is contractible iff every map f : Y→X is nullho
motopic.
11. Show that f : X→Y is a homotopy equivalence if there exist maps g, h: Y→X
such that fg = 11 and hf = 11. More generally, show that f is a homotopy equiva
lence if fg and hf are homotopy equivalences.
12. Show that a homotopy equivalence f : X→Y induces a bijection between the set
of pathcomponents of X and the set of pathcomponents of Y , and that f restricts
to a homotopy equivalence from each pathcomponent of X to the corresponding
pathcomponent of Y .
13. Show that any two deformation retractions r
0
t
and r
1
t
of a space X onto a
subspace A can be joined by a continuous family of deformation retractions r
s
t
,
0 ≤ s ≤ 1, of X onto A, where continuity means that the map X×I ×I→X, (x, s, t)
r
s
t
(x), is continuous.
14. Given positive integers v, e, and f satisfying v − e + f = 2, construct a cell
structure on S
2
having v 0 cells, e 1 cells, and f 2 cells.
15. Enumerate all the subcomplexes of S
∞
, with the cell structure described in this
section, having two cells in each dimension.
16. Show that S
∞
is contractible.
17. Construct a 2 dimensional cell complex that contains both an annulus S
1
×I and
a M¨obius band as deformation retracts.
18. Show that S
1
∗S
1
= S
3
, and more generally S
m
∗S
n
= S
m+n+1
.
20 Chapter 0. Some Underlying Geometric Notions
19. Show that the space obtained from S
2
by attaching n 2 cells along any collection
of n circles in S
2
is homotopy equivalent to the wedge sum of n+1 2 spheres.
20. Show that the subspace X ⊂ R
3
formed by a Klein bottle in
tersecting itself in a circle, as shown in the ﬁgure, is homotopy
equivalent to S
1
∨S
1
∨S
2
.
21. If X is a connected space that is a union of a ﬁnite number of 2 spheres, any
two of which intersect in at most one point, show that X is homotopy equivalent to a
wedge sum of S
1
’s and S
2
’s.
22. Let X be a ﬁnite graph lying in a halfplane P ⊂ R
3
and intersecting the edge
of P in a subset of the vertices of X. Describe the homotopy type of the ‘surface of
revolution’ obtained by rotating X about the edge line of P .
23. Show that a CW complex is contractible if it is the union of two contractible
subcomplexes whose intersection is also contractible.
24. Let X and Y be CW complexes with 0 cells x
0
and y
0
. Show that the quotient
spaces X∗Y/(X∗¦y
0
¦∪¦x
0
¦∗Y) and S(X∧Y)/S(¦x
0
¦∧¦y
0
¦) are homeomorphic,
and deduce that X ∗Y = S(X ∧Y).
25. Show that for a CW complex X with components X
α
, the suspension SX is
homotopy equivalent to Y
α
SX
α
where Y is a graph. In the case that X is a ﬁnite
graph, showthat SX is homotopy equivalent to a wedge sumof circles and 2 spheres.
26. Use Corollary 0.20 to show that if (X, A) has the homotopy extension property,
then X×I deformation retracts to X×¦0¦ ∪ A×I . Deduce from this that Proposi
tion 0.18 holds more generally when (X, A) satisﬁes the homotopy extension prop
erty.
27. Given a pair (X, A) and a map f : A→B, deﬁne X/f to be the quotient space
of X obtained by identifying points in A having the same image in B. Show that the
quotient map X→X/f is a homotopy equivalence if f is a surjective homotopy equiv
alence and (X, A) has the homotopy extension property. [Hint: Consider X ∪M
f
and
use the preceding problem.] When B is a point this gives another proof of Proposi
tion 0.17. Another interesting special case is when f is the projection A×I→A.
28. Showthat if (X
1
, A) satisﬁes the homotopy extension property, then so does every
pair (X
0
L
f
X
1
, X
0
) obtained by attaching X
1
to a space X
0
via a map f : A→X
0
.
29. In case the CW complex X is obtained from a subcomplex A by attaching a single
cell e
n
, describe exactly what the extension of a homotopy f
t
: A→Y to X given by
the proof of Proposition 0.16 looks like. That is, for a point x ∈ e
n
describe the path
f
t
(x) for the extended f
t
.
One of the main techniques of algebraic topology is to study topological spaces
by forming algebraic images of them. Most often these algebraic images are groups,
but more elaborate structures such as rings, modules, and algebras also arise. The
mechanisms which create these images — the ‘lanterns’ of algebraic topology, one
might say — are known formally as functors and have the characteristic feature that
they form images not only of spaces but also of maps. Thus, continuous maps be
tween spaces are projected onto homomorphisms between their algebraic images, so
topologically related spaces have algebraically related images.
With suitably constructed lanterns one might hope to be able to form images with
enough detail to reconstruct accurately the shapes of all spaces, or at least of large
and interesting classes of spaces. This is one of the main goals of algebraic topology,
and to a surprising extent this goal is achieved. Of course, the lanterns necessary to
do this are somewhat complicated pieces of machinery. But this machinery also has
a certain intrinsic beauty.
This ﬁrst chapter introduces one of the simplest and most important of the func
tors of algebraic topology, the fundamental group, which creates an algebraic image
of a space from the loops in the space, that is, paths starting and ending at the same
point.
The Idea of the Fundamental Group
To get a feeling for what the fundamental group is about, let us look at a few
preliminary examples before giving the formal deﬁnitions.
22 Chapter 1. The Fundamental Group
A
B
Consider two linked circles A and B in R
3
, as shown in
the ﬁgure. The fact that the circles are linked means, intu
itively, that B cannot be separated from A by any continuous
motion of B, such as pushing, pulling, twisting, etc. We could
even take B to be made of rubber or stretchable string and allow completely general
continuous deformations of B, staying in the complement of A at all times, and it
would still be impossible to pull B off A. At least that is what intuition suggests,
and the fundamental group will give a way of making this intuition mathematically
rigorous.
A
A
B
−3
B
2
Instead of having B link with A just once, we could make
it link A two or more times. As a further variation, by as
signing an orientation to B we can speak of B linking A a
positive or a negative number of times, say positive when B
comes forward through A and negative for the reverse direc
tion. Thus for each nonzero integer n we have an oriented
circle B
n
linking A n times, where by ‘circle’ we mean a curve
homeomorphic to a circle. To complete the scheme, we could
let B
0
be a circle which doesn’t link A at all.
Now, integers not only measure quantity, but they form a group under addition.
Can the group operation be mimicked geometrically with some sort of addition op
eration on the oriented circles B linking A? An oriented circle B can be thought of
as a path traversed in time, starting and ending at the same point x
0
, which we can
choose to be any point on the circle. Such a path starting and ending at the same point
is called a loop. Two different loops B and B
¹
both starting and ending at the same
point x
0
can be ‘added’ to form a new loop B +B
¹
which travels ﬁrst around B, then
around B
¹
. For example, if B
1
and B
¹
1
are loops each linking A once in the positive
direction, then their sum B
1
+B
¹
1
is deformable to B
2
, linking A twice:
A
B
1
B
1
x
0
A
B
2
x
0
´
In a similar way B
1
+B
−1
can be deformed to the loop B
0
, unlinked from A:
A
B
1
x
0
A
B
0
x
0
B
−1
More generally, B
m
+ B
n
is deformable to B
m+n
for arbitrary integers m and n, as
one can easily convince oneself of by drawing a few pictures like those above.
The Idea of the Fundamental Group 23
Note that in forming sums of loops we produce loops which pass through the
basepoint more than once. This is one reason why loops are deﬁned merely as contin
uous paths, which are allowed to pass through the same point many times. So if one is
thinking of a loop as something made of stretchable string, one has to give the string
the magical power of being able to pass through itself unharmed. However, we must
be sure not to allow our loops to intersect the ﬁxed circle A at any time, otherwise we
could always unlink them from A.
Next we consider a slightly more complicated sort of linking, involving three cir
cles forming a conﬁguration known as the Borromean rings, shown in the ﬁgure on
the left below. The interesting feature here is that if any one of the three circles is
removed, the other two are not linked.
A
A
B
B
C
C
In the same spirit as before, let us regard the third circle C as forming a loop in the
complement of the other two, A and B, and we ask whether C can be continuously
deformed to unlink it completely from A and B, always staying in the complement
of A and B during the deformation. We can redraw the picture by pulling A and B
apart, dragging C along, and then we see C winding back and forth between A and
B as shown in the second ﬁgure above. In this new position, if we start at the point of
C indicated by the dot and proceed in the direction given by the arrow, then we pass
in sequence: (1) forward through A, (2) forward through B, (3) backward through A,
and (4) backward through B. If we measure the linking of C with A and B by two
integers, then the ‘forwards’ and ‘backwards’ cancel and both integers are zero. This
reﬂects the fact that C is not linked with A or B individually.
To get a more accurate measure of how C links with A and B together, we regard
the four parts (1)(4) of C as an ordered sequence. Taking into account the directions
in which these segments of C pass through A and B, we may deform C to the sum
a +b −a −b of four loops as in the next ﬁgure. We write the third and fourth loops
as the negatives of the ﬁrst two since they can be deformed to the ﬁrst two, but with
the opposite orientations, and as we saw in the preceding example, the sum of two
oppositelyoriented loops is deformable to a trivial loop, not linked with anything.
A B
a
b
−b
−a
A
B
a
b
−b
−a
24 Chapter 1. The Fundamental Group
We would like to view the expression a+b −a−b as lying in a nonabelian group, so
that it is not automatically zero. Changing to the more usual multiplicative notation
for nonabelian groups, it would be written aba
−1
b
−1
, the commutator of a and b.
To shed further light on this example, suppose we modify it slightly so that the
circles A and B are now linked, as in the next ﬁgure.
A B
C
A
B
C
The circle C can then be deformed into the position shown at the right, where it again
represents the composite loop aba
−1
b
−1
, where a and b are loops linking A and
B. But it is apparent from the picture on the left that C can actually be unlinked
completely from A and B. So in this case the product aba
−1
b
−1
should be trivial,
i.e., a and b should commute.
The fundamental group of a space X will be deﬁned so that its elements are
loops in X starting and ending at a ﬁxed basepoint x
0
∈ X, but two such loops are
regarded as determining the same element of the fundamental group if one loop can
be continuously deformed to the other within the space X. (All loops which occur
during deformations must also start and end at x
0
.) In the ﬁrst example above, X is
the complement of the circle A, while in the other two examples X is the complement
of the two circles A and B. In the second section in this chapter we will show:
— The fundamental group of the complement of the circle A in the ﬁrst example
is Z, with the loop B as a generator of this group. This amounts to saying that
every loop in the complement of A can be deformed to one of the loops B
n
, and
that B
n
cannot be deformed to B
m
if n ≠ m.
— The fundamental group of the complement of the two unlinked circles A and B in
the second example is the nonabelian free group on two generators, represented
by the loops a and b linking A and B. In particular, the commutator aba
−1
b
−1
is a nontrivial element of this group.
— The fundamental group of the complement of the two linked circles A and B in
the third example is the free abelian group Z×Z on two generators, represented
by the loops a and b linking A and B.
As a result of these calculations, we have two ways to tell when a pair of circles A
and B is linked. The direct approach is given by the ﬁrst example, where one circle
is regarded as an element of the fundamental group of the complement of the other
circle. An alternative and somewhat more subtle method is given by the second and
third examples, where one distinguishes a pair of linked circles froma pair of unlinked
Section 1.1. Basic Constructions 25
circles by the fundamental group of their complement, which is abelian in one case and
nonabelian in the other. This method is much more general: One can often show that
two spaces are not homeomorphic by showing that their fundamental groups are not
isomorphic, since it will be an easy consequence of the deﬁnition of the fundamental
group that homeomorphic spaces have isomorphic fundamental groups.
This ﬁrst section begins with the basic deﬁnitions and constructions, and then
proceeds quickly to an important calculation, the fundamental group of the circle,
using notions developed more fully in §1.3. More systematic methods of calculation
are given in §1.2, sufﬁcient to show for example that every group is realized as the
fundamental group of some space. This idea is exploited in the Additional Topics
at the end of the chapter, which give some illustrations of how algebraic facts about
groups can be derived topologically.
Paths and Homotopy
There are two basic ingredients in the deﬁnition of the fundamental group: the
idea of continuous deformation of paths, and an operation for composing paths to
form new paths. We begin with the ﬁrst of these.
Let X be a space and let I denote the unit interval [0, 1] in R. By a path in X
we mean a continuous map f : I→X. The idea of continuously deforming a path,
keeping its endpoints ﬁxed, is made precise by the following deﬁnition. A homotopy
of paths in X is a family f
t
: I→X, 0 ≤ t ≤ 1, such that
(1) The endpoints f
t
(0) = x
0
and f
t
(1) = x
1
are independent of t .
(2) The associated map F : I ×I→X deﬁned by F(s, t) = f
t
(s) is continuous.
When two paths f
0
and f
1
are connected in this way by a homotopy f
t
, we will say
they are homotopic and write f
0
= f
1
.
x
1
1
x
0
0
f
f
Example 1.1: Linear homotopies. Any two paths
f
0
and f
1
in R
n
having the same two endpoints x
0
and x
1
are homotopic via the homotopy f
t
(s) =
(1 −t)f
0
(s) +tf
1
(s). During this homotopy each
point f
0
(s) travels along the line segment to f
1
(s) at constant speed. This is because
the line through f
0
(s) and f
1
(s) is linearly parametrized as f
0
(s)+t[f
1
(s)−f
0
(s)] =
(1−t)f
0
(s)+tf
1
(s), so as t goes from 0 to 1, f
t
(s) traces out the segment from f
0
(s)
26 Chapter 1. The Fundamental Group
to f
1
(s). If f
1
(s) = f
0
(s) then this segment degenerates to a point, so f
t
(s) = f
0
(s)
for all t . This happens in particular for s = 0 and s = 1, so f
t
is a path from x
0
to x
1
for all t . Continuity of the homotopy f
t
as a map I ×I→R
n
follows from continuity
of f
0
and f
1
since the algebraic operations in the deﬁnition of f
t
are continuous.
This construction shows more generally that for a convex subspace X ⊂ R
n
, all
paths in X with given endpoints x
0
and x
1
are homotopic.
Before proceeding further we need to verify a technical property:
Proposition 1.2. The relation of homotopy on paths with ﬁxed endpoints in any space
is an equivalence relation.
Proof: The constant homotopy f
t
= f shows that f = f . If f
0
= f
1
via f
t
, then
f
1
= f
0
via the homotopy f
1−t
. For transitivity, if f
0
= f
1
via f
t
and f
1
= g
0
= g
1
via g
t
, then f
0
= g
1
via the homotopy h
t
which equals f
2t
for 0 ≤ t ≤
1
/
2
and
g
2t−1
for
1
/
2
≤ t ≤ 1. Continuity of the associated map H(s, t) = h
t
(s) comes from
the elementary fact, which will be used frequently without explicit mention, that a
function deﬁned on the union of two closed sets is continuous if its restriction to
each of the closed sets is continuous. In the case at hand, H is clearly continuous on
each of I ×[0,
1
/
2
] and I ×[
1
/
2
, 1], and on I ×¦
1
/
2
¦ the two deﬁnitions of H agree since
f
1
= g
0
, so H is continuous on I ×I . L¦
The equivalence class of a path f under the equivalence relation of homotopy is
denoted by [f] and called the homotopy class of f .
Given two paths f, g : I→X such that f(1) = g(0), we can deﬁne a ‘composition’
or ‘product’ path f g which traverses ﬁrst f then g, by the formula
f g(s) =
f(2s), 0 ≤ s ≤
1
/
2
g(2s −1),
1
/
2
≤ s ≤ 1
Thus the speed of traversal of f and g is doubled in order for f g to be traversed
in unit time. This product operation respects homotopy classes since if f
0
= f
1
and
g
0
= g
1
via homotopies f
t
and g
t
, and if f
0
(1) = g
0
(0) so that f
0
g
0
is deﬁned,
then f
t
g
t
is deﬁned and provides a homotopy f
0
g
0
= f
1
g
1
.
In particular, suppose we restrict attention to paths f : I→X with the same start
ing and ending point f(0) = f(1) = x
0
∈ X. Such paths are called loops, and the
common starting and ending point x
0
is referred to as the basepoint. The set of
homotopy classes of loops in X at the basepoint x
0
is denoted π
1
(X, x
0
).
Proposition 1.3. π
1
(X, x
0
) is a group with respect to the product [f][g] = [f g].
This group π
1
(X, x
0
) is called the fundamental group of X at the basepoint x
0
.
Proof: By restricting attention to loops with a ﬁxed basepoint x
0
∈ X we guarantee
that the product f g of any two such loops is deﬁned. We have already observed
Section 1.1. Basic Constructions 27
that the homotopy class of f g depends only on the homotopy classes of f and g,
so the product [f][g] = [f g] is welldeﬁned. It remains to verify the three axioms
for a group.
As a preliminary step, deﬁne a reparametrization of a path f to be a composi
tion fϕ where ϕ: I→I is any continuous map such that ϕ(0) = 0 and ϕ(1) = 1.
Reparametrizing a path preserves its homotopy class since fϕ = f via the homotopy
fϕ
t
where ϕ
t
(s) = (1 − t)ϕ(s) + ts so that ϕ
0
= ϕ and ϕ
1
(s) = s . Note that
(1 −t)ϕ(s) +ts lies between ϕ(s) and s , hence is in I so fϕ
t
is deﬁned.
Given paths f, g, h with f(1) = g(0) and g(1) = h(0), then the composed paths
(f g) h and f (g h) are reparametrizations of each other, differing only in the speeds
at which f and h are traversed. Hence (f g) h = f (g h). Restricting attention to
loops at the basepoint x
0
, this says the product in π
1
(X, x
0
) is associative.
Given a path f : I→X, let c be the constant path at f(1), deﬁned by c(s) = f(1)
for all s ∈ I . Then f c is a reparametrization of f via the function ϕ(s) which
equals 2s on [0,
1
/
2
] and 1 on [
1
/
2
, 1], so f c = f . Similarly, c f = f where c is now
the constant path at f(0). Taking f to be a loop, we deduce that the homotopy class
of the constant path at x
0
is a twosided identity in π
1
(X, x
0
).
For a path f from x
0
to x
1
, the inverse path f from x
1
back to x
0
is deﬁned
by f(s) = f(1 − s). Consider the homotopy h
t
= f
t
g
t
where f
t
is the path which
equals f on the interval [0, t] and which is stationary at f(t) on the interval [t, 1],
and g
t
is the inverse path of f
t
. Since f
0
is the constant path c at x
0
and f
1
= f ,
we see that h
t
is a homotopy from c c = c to f f . Now specialize to the case that
f is a loop at the basepoint x
0
. We have shown that f f = c, and replacing f by f
gives f f = c. So [f ] is a twosided inverse for [f] in π
1
(X, x
0
). L¦
In Chapter 4 we will see that π
1
(X, x
0
) is just the ﬁrst in a sequence of groups
π
n
(X, x
0
), called homotopy groups, which are deﬁned in an entirely analogous fash
ion using the n dimensional cube I
n
in place of I .
Example 1.4. A convex set X in R
n
has π
1
(X, x
0
) = 0, the trivial group, for every
basepoint x
0
∈ X, since any two loops f
0
and f
1
based at x
0
are homotopic via the
linear homotopy f
t
(s) = (1 −t)f
0
(s) +tf
1
(s).
It is not so easy to showthat a space has a nontrivial fundamental group since one
must somehow demonstrate the nonexistence of homotopies between certain loops.
We will tackle the simplest example shortly, showing that this is the case for the circle.
But ﬁrst let us address a theoretical issue which the reader may be wondering about.
How does π
1
(X, x
0
) depend on the choice of the basepoint x
0
? Since π
1
(X, x
0
)
involves only the path component of X containing x
0
, it is clear that we can hope to
ﬁnd a relation between π
1
(X, x
0
) and π
1
(X, x
1
) for two basepoints x
0
, x
1
∈ X only
if x
0
and x
1
lie in the same path component of X. So let h: I→X be a path from
x
0
to x
1
, with the inverse path h(s) = h(1 − s) from x
1
back to x
0
. We can then
28 Chapter 1. The Fundamental Group
associate to each loop f based at x
1
the loop h f h based at x
0
. Strictly speaking,
we should choose an order of forming the product h f h, either (h f) h or h (f h),
but the two choices are homotopic and we are only interested in homotopy classes
here. Alternatively, to avoid any ambiguity we could deﬁne a general n fold product
f
1
··· f
n
so that the path f
i
is traversed in the time interval
¸
i−1
n
,
i
n
¸
.
Proposition 1.5. The map β
h
: π
1
(X, x
1
)→π
1
(X, x
0
) deﬁned by β
h
[f] = [h f h]
is an isomorphism.
Proof: If f
t
is a homotopy of loops based at x
1
then h f
t
h is a homotopy of
loops based at x
0
, so β
h
is welldeﬁned. Further, β
h
is a homomorphism since
β
h
[f g] = [h f g h] = [h f h h g h] = β
h
[f]β
h
[g]. Finally, β
h
is an isomorphism
with inverse β
h
since β
h
β
h
[f] = β
h
[h f h] = [h h f h h] = [f], and similarly
β
h
β
h
[f] = [f]. L¦
Thus if X is pathconnected, the group π
1
(X, x
0
) is, up to isomorphism, inde
pendent of the choice of basepoint x
0
. In this case the notation π
1
(X, x
0
) is often
abbreviated to π
1
(X), or one could go further and write just π
1
X.
In general, a space is called simplyconnected if it is pathconnected and has
trivial fundamental group. The following result is probably the reason for this term.
Proposition 1.6. A space X is simplyconnected iff there is a unique homotopy class
of paths connecting any two points in X.
Proof: Pathconnectedness is the existence of paths connecting every pair of points,
so we need be concerned only with the uniqueness of connecting paths. Suppose
π
1
(X) = 0. If γ and η are two paths from x
0
to x
1
, then γ = γ η η = η, the
latter homotopy since the loop γ η is nullhomotopic if π
1
(X, x
0
) = 0. Conversely,
if there is only one homotopy class of paths connecting a basepoint x
0
to itself, then
π
1
(X, x
0
) = 0. L¦
The Fundamental Group of the Circle
Our ﬁrst real theorem will be the calculation π
1
(S
1
) ≈ Z. Besides its intrinsic
interest, this basic result will have several immediate applications of some substance,
and it will be the starting point for many more calculations in the next section. In view
of the importance of this result, we can expect the proof to involve some genuine work,
which it does. To maximize the payoff for this work, the proof is written so that its
main technical steps apply in a more general setting. This setting, covering spaces, is
the topic of §1.3.
Here is the theorem:
Section 1.1. Basic Constructions 29
Theorem 1.7. The map ψ: Z→π
1
(S
1
) sending an integer n to the homotopy class
of the loop ω
n
(s) = (cos 2πns, sin2πns) based at (1, 0) is an isomorphism.
Proof: The idea is to compare paths in S
1
with paths in R via the map p: R→S
1
given by p(s) = (cos 2πs, sin2πs). This map can be visualized geo
metrically by embedding R in R
3
as the helix parametrized by s
(cos 2πs, sin2πs, s), and then p is the restriction to the helix of the
projection of R
3
onto R
2
, (x, y, z)
(x, y), as in the ﬁgure. Ob
serve that the loop ω
n
is the composition p ω
n
where ω
n
: I→R is
the path ω
n
(s) = ns , starting at 0 and ending at n, winding around
the helix ¦n¦ times, upward if n > 0 and downward if n < 0. The
relation ω
n
= p ω
n
is expressed by saying that ω
n
is a lift of ω
n
.
p
The deﬁnition of ψ can be restated by setting ψ(n) equal to the homotopy class
of the loop p
`
f where
`
f is any path in R from 0 to n. Such an
`
f is homotopic to
ω
n
via the linear homotopy (1 − t)
`
f + tω
n
, hence p
`
f is homotopic to p ω
n
= ω
n
and the new deﬁnition of ψ(n) agrees with the old one.
To verify that ψ is a homomorphism, let τ
m
: R→R be the translation τ
m
(x) =
x + m. Then ω
m
(τ
m
ω
n
) is a path in R from 0 to m+ n, so ψ(m+ n) is the
homotopy class of the loop in S
1
which is the image of this path under p. This image
is just ω
m
ω
n
, so ψ(m+n) = ψ(m) ψ(n).
To show that ψ is an isomorphism we shall use two facts:
(a) For each path f : I→S
1
starting at a point x
0
∈ S
1
and each ` x
0
∈ p
−1
(x
0
) there
is a unique lift
`
f : I→R starting at ` x
0
.
(b) For each homotopy f
t
: I→S
1
of paths starting at x
0
and each ` x
0
∈ p
−1
(x
0
)
there is a unique lifted homotopy
`
f
t
: I→R of paths starting at ` x
0
.
Before proving these facts, let us see how they imply the theorem. To show that ψ is
surjective, let f : I→S
1
be a loop at the basepoint (1, 0), representing a given element
of π
1
(S
1
). By (a) there is a lift
`
f starting at 0. This path
`
f ends at some integer n
since p
`
f(1) = f(1) = (1, 0) and p
−1
(1, 0) = Z ⊂ R. By the extended deﬁnition of ψ
we then have ψ(n) = [p
`
f] = [f]. Hence ψ is surjective.
To show that ψ is injective, suppose ψ(m) = ψ(n), i.e., ω
m
= ω
n
. Let f
t
be a
homotopy from ω
m
= f
0
to ω
n
= f
1
. By (b) this homotopy lifts to a homotopy
`
f
t
of
paths starting at 0. The uniqueness part of (a) implies that
`
f
0
= ω
m
and
`
f
1
= ω
n
.
Since
`
f
t
is a homotopy of paths, the endpoint
`
f
t
(1) is independent of t . For t = 0
this endpoint is m and for t = 1 it is n, so m= n.
It remains to prove (a) and (b). These can both be deduced froma third statement:
(c) Given a map F : Y ×I→S
1
and a map
`
F : Y ×¦0¦→R lifting F¦Y ×¦0¦, then there
is a unique map
`
F : Y ×I→R lifting F and restricting to the given
`
F on Y ×¦0¦.
Statement (a) is the special case that Y is a point, and (b) is obtained by applying (c)
with Y = I in the following way. The homotopy f
t
in (b) gives F : I ×I→S
1
by setting
30 Chapter 1. The Fundamental Group
F(s, t) = f
t
(s) as usual. A unique lift
`
F : I ×¦0¦→R is obtained by an application
of (a). Then (c) gives a unique
`
F : I ×I→R. The restrictions
`
F¦¦0¦×I and
`
F¦¦1¦×I
are paths lifting the constant path at x
0
, hence they must also be constant by the
uniqueness part of (a). So
`
f
t
(s) =
`
F(s, t) is a homotopy of paths lifting f
t
.
We shall prove (c) using just one special property of the projection p: R→S
1
,
namely:
(∗)
There is an open cover ¦U
α
¦ of S
1
such that for each α, p
−1
(U
α
) can be
decomposed as a disjoint union of open sets each of which is mapped homeo
morphically onto U
α
by p.
For example, we could take the cover ¦U
α
¦ to consist of any two open arcs in S
1
whose union is S
1
.
To prove (c) we will ﬁrst construct
`
F : N×I→R where N is some neighborhood
in Y of a given point y
0
∈ Y . Since F is continuous, every point (y
0
, t) has a product
neighborhood N
t
×(a
t
, b
t
) such that F
¸
N
t
×(a
t
, b
t
)
⊂ U
α
for some α. By compact
ness of ¦y
0
¦×I , ﬁnitely many such products N
t
×(a
t
, b
t
) cover ¦y
0
¦×I , so we can
choose a single neighborhood N of y
0
and a partition 0 = t
0
< t
1
< ··· < t
m
= 1 of
I so that for each i, F(N×[t
i
, t
i+1
]) is contained in some U
α
i
. Assume inductively
that
`
F has been constructed on N×[0, t
i
]. We have F(N×[t
i
, t
i+1
]) ⊂ U
α
i
, so by
(∗) there is an open set
`
U
α
i
⊂ R projecting homeomorphically onto U
α
i
by p and
containing the point
`
F(y
0
, t
i
). After replacing N by a smaller neighborhood of y
0
we
may assume that
`
F(N×¦t
i
¦) ⊂
`
U
α
i
, namely, replace N×¦t
i
¦ by its intersection with
(
`
F ¦
¦N×¦t
i
¦)
−1
(
`
U
α
i
). Now we can deﬁne
`
F on N×[t
i
, t
i+1
] to be the composition of
F with the homeomorphism p
−1
: U
α
i
→
`
U
α
i
. After ﬁnitely many repetitions of this
induction step we eventually get a lift
`
F : N×I→R, for some neighborhood N of y
0
.
Next we showthe uniqueness part of (c) in the special case that Y is a point. In this
case we can omit Y from the notation. So suppose
`
F and
`
F
¹
are two lifts of F : I→S
1
such that
`
F(0) =
`
F
¹
(0). As before, choose a partition 0 = t
0
< t
1
< ··· < t
m
= 1 of
I so that for each i, F([t
i
, t
i+1
]) is contained in some U
α
i
. Assume inductively that
`
F =
`
F
¹
on [0, t
i
]. Since [t
i
, t
i+1
] is connected, so is
`
F([t
i
, t
i+1
]), which must therefore
lie in a single one of the disjoint open sets
`
U
α
i
lying over U
α
i
, whose existence is given
by (∗). By the same token,
`
F
¹
([t
i
, t
i+1
]) lies in a single
`
U
α
i
, in fact in the same one
that contains
`
F([t
i
, t
i+1
]) since
`
F
¹
(t
i
) =
`
F(t
i
). Because p is injective on each
`
U
α
i
and
p
`
F =
`
F
¹
, it follows that
`
F =
`
F
¹
on [t
i
, t
i+1
], and the induction step is ﬁnished.
The last step in the proof of (c) is to observe that since the
`
F ’s constructed above
on sets of the form N×I are unique when restricted to each segment ¦y¦×I , they
must agree whenever two such sets N×I overlap. So we obtain a welldeﬁned lift
`
F
on all of Y ×I . This
`
F is continuous since it is continuous on each N×I , and it is
unique since it is unique on each segment ¦y¦×I . L¦
Now we turn to some applications of this theorem. Although algebraic topology
Section 1.1. Basic Constructions 31
is usually ‘algebra serving topology,’ the roles are reversed in the following proof of
the Fundamental Theorem of Algebra.
Theorem 1.8. Every nonconstant polynomial with coefﬁcients in C has a root in C.
Proof: We may assume the polynomial is of the form p(z) = z
n
+a
1
z
n−1
+··· +a
n
.
If p(z) has no roots in C, then for each real number r ≥ 0, the formula
f
r
(s) =
p(re
2πis
)/p(r)
¦p(re
2πis
)/p(r)¦
deﬁnes a loop in the unit circle S
1
⊂ C based at 1. As r varies, f
r
is a homotopy of
loops based at 1. Since f
0
is the trivial loop, we deduce that the class [f
r
] ∈ π
1
(S
1
)
is zero for all r . Now ﬁx a large value of r , bigger than 1 + ¦a
1
¦ + ··· + ¦a
n
¦. Then
for ¦z¦ = r we have
¦z
n
¦ = r
n
= r · r
n−1
> (¦a
1
¦ +··· +¦a
n
¦)¦z
n−1
¦ ≥ ¦a
1
z
n−1
+··· +a
n
¦
so for 0 ≤ t ≤ 1 the polynomial p
t
(z) = z
n
+ t(a
1
z
n−1
+ ··· + a
n
) has no roots on
the circle ¦z¦ = r . Replacing p by p
t
in the formula for f
r
above and letting t go
from 1 to 0, we obtain a homotopy from the loop f
r
to the loop ω
n
(s) = e
2πins
. By
Theorem 1.7, ω
n
represents n times a generator of the inﬁnite cyclic group π
1
(S
1
).
Since we have shown that [ω
n
] = [f
r
] = 0, we conclude that n = 0. Thus the only
polynomials without roots in C are constants. L¦
For the next result we use the standard notation D
n
for the closed unit disk in
R
n
, all vectors x of length ¦x¦ ≤ 1. Thus the boundary of D
n
is the unit sphere S
n−1
.
Theorem 1.9. Every continuous map h: D
2
→D
2
has a ﬁxed point, i.e., a point x
with h(x) = x.
x
r(x)
h(x)
Proof: Suppose on the contrary h(x) ≠ x for all x ∈ D
2
.
Then we can deﬁne a map r : D
2
→S
1
by letting r(x) be the
point of S
1
where the ray in R
2
starting at h(x) and passing
through x leaves D
2
. Continuity of r is clear since small per
turbations of x produce small perturbations of h(x), hence
small perturbations of the ray through these two points. The
crucial property of r , besides continuity, is that r(x) = x if x ∈ S
1
. Thus r is a
retraction of D
2
onto S
1
. We will show that no such retraction can exist.
Let f
0
be any loop in S
1
. In D
2
there is a homotopy of f
0
to a constant loop, for
example the linear homotopy f
t
(s) = (1 − t)f
0
(s) + tx
0
where x
0
is the basepoint
of f
0
. Since the retraction r is the identity on S
1
, the composition rf
t
is then a
homotopy in S
1
from rf
0
= f
0
to the constant loop at x
0
. But this contradicts the
fact that π
1
(S
1
) is nonzero. L¦
32 Chapter 1. The Fundamental Group
This theoremwas ﬁrst proved by Brouwer around 1910, one of the early triumphs
of algebraic topology. Brouwer in fact proved the corresponding result for D
n
, and
we shall obtain this generalization in Corollary 2.11 using homology groups in place
of π
1
. One could also use the higher homotopy group π
n
. Brouwer’s original proof
used neither homology nor homotopy groups, which had not been invented at the
time. Instead it used the notion of degree for maps S
n
→S
n
, which we shall deﬁne in
§2.2 using homology but which Brouwer deﬁned directly in more geometric terms.
All these versions of the proof of the ﬁxed point theorem are arguments by con
tradiction, and so they show just the existence of a ﬁxed point without giving any clue
as to how to ﬁnd it in explicit cases. Our proof of the fundamental theorem of algebra
was similar in this regard. There exist other proofs of the Brouwer ﬁxed point theorem
which are somewhat more constructive, for example the elegant and quite elementary
proof by Sperner in 1928, which is explained very nicely in [AignerZiegler].
The techniques used to calculate π
1
(S
1
) can be applied to prove the BorsukUlam
theorem in dimension two:
Theorem1.10. For every continuous map f : S
2
→R
2
there exists a pair of antipodal
points x and −x in S
2
with f(x) = f(−x).
It may be that there is only one such pair of antipodal points x, −x, for example
if f is simply orthogonal projection of the standard sphere S
2
⊂ R
3
onto a plane.
The BorsukUlam theorem holds also for maps S
n
→R
n
, as we show in Proposi
tion 2B.5. The proof for n = 1 is easy since the difference f(x) − f(−x) changes
sign as x goes halfway around the circle, hence must be zero for some x. For n ≥ 2
the theorem is certainly less obvious. Is it apparent, for example, that at every instant
there must be a pair of antipodal points on the surface of the earth having the same
temperature and the same barometric pressure?
The theorem says in particular that there is no onetoone continuous map from
S
2
to R
2
, so S
2
is not homeomorphic to a subspace of R
2
, an intuitively obvious fact
which is not easy to prove directly.
Proof: If the conclusion is false for f : S
2
→R
2
, we can deﬁne g : S
2
→S
1
by
g(x) =
f(x) −f(−x)
¦f(x) −f(−x)¦
Then g(−x) = −g(x). Deﬁne a loop η: I→S
2
⊂ R
3
by η(s) = (cos 2πs, sin2πs, 0),
and let h: I→S
1
be the composed loop gη. Since g(−x) = −g(x), we have the
relation h(s +
1
/
2
) = −h(s) for all s in the interval [0,
1
/
2
]. As we showed in the
calculation of π
1
(S
1
), the loop h can be lifted to a path
`
h: I→R. The equation
h(s +
1
/
2
) = −h(s) implies that
`
h(s +
1
/
2
) =
`
h(s) +
q
/
2
for some odd integer q. The
integer q is independent of s ∈ [0,
1
/
2
] since by solving the equation
`
h(s +
1
/
2
) =
`
h(s) +
q
/
2
for q we see that q depends continuously on s , so must be constant, being
constrained to integer values. In particular, we have
`
h(1) =
`
h(
1
/
2
) +
q
/
2
=
`
h(0) + q.
Section 1.1. Basic Constructions 33
This means that h represents q times a generator of π
1
(S
1
). Since q is odd, we
conclude that h is not nullhomotopic. But h was the composition gη: I→S
2
→S
1
,
and η is obviously nullhomotopic in S
2
, so gη is nullhomotopic in S
1
by composing
a nullhomotopy of η with g. Thus we have arrived at a contradiction. L¦
Corollary 1.11. Whenever S
2
is expressed as the union of three closed sets A
1
, A
2
,
and A
3
, then one of these sets must contain a pair of antipodal points x and −x.
Proof: Let d
i
: S
2
→R measure distance to A
i
, that is, d
i
(x) = inf
y∈A
i
¦x−y¦. This is a
continuous function, so we may apply the BorsukUlam theorem to the map S
2
→R
2
,
x
¸
d
1
(x), d
2
(x)
, obtaining a pair of antipodal points x and −x with d
1
(x) =
d
1
(−x) and d
2
(x) = d
2
(−x). If either of these two distances is zero, then x and −x
both lie in the same set A
1
or A
2
since these are closed sets. On the other hand, if
the distances from x and −x to A
1
and A
2
are both strictly positive, then x and −x
lie in neither A
1
nor A
2
so they must lie in A
3
. L¦
The number ‘three’ in this result is best possible. For consider a sphere inscribed
in a tetrahedron. Projecting the four faces of the tetrahedron radially onto the sphere,
we obtain a cover of S
2
by four closed sets, none of which contains a pair of antipodal
points.
Assuming the higherdimensional version of the BorsukUlam theorem, the same
arguments show that S
n
cannot be covered by n + 1 closed sets without antipodal
pairs of points, though it can be covered by n +2 such sets. Even the case n = 1 is
somewhat interesting: If the circle is covered by two closed sets, one of them must
contain a pair of antipodal points.
The following simple fact will allow us to compute the fundamental groups of a
few more spaces.
Proposition 1.12. π
1
(X×Y) is isomorphic to π
1
(X)×π
1
(Y) if X and Y are path
connected.
Proof: A basic property of the product topology is that a map f : Z→X×Y is con
tinuous iff the maps g : Z→X and h: Z→Y deﬁned by f(z) = (g(z), h(z)) are both
continuous. Hence a loop in X×Y based at (x
0
, y
0
) is equivalent to a pair of loops in
X and Y based at x
0
and y
0
respectively. Similarly, a homotopy of a loop in X×Y is
equivalent to a pair of homotopies of the corresponding loops in X and Y . Thus we
obtain a bijection π
1
¸
X×Y, (x
0
, y
0
)
≈ π
1
(X, x
0
)×π
1
(Y, y
0
), and this is obviously a
group isomorphism. L¦
Example 1.13: The Torus. By the proposition we have an isomorphism π
1
(S
1
×S
1
) ≈
Z×Z. Under this isomorphisma pair (p, q) ∈ Z×Z corresponds to a loop which winds
p times around one S
1
factor of the torus and q times around the other S
1
factor,
34 Chapter 1. The Fundamental Group
for example the loop ω
pq
(s) = (ω
p
(s), ω
q
(s)). More generally, the n dimensional
torus, which is the product of n circles, has fundamental group the product of n
copies of Z. This follows by induction on n.
Induced Homomorphisms
Suppose ϕ: X→Y is a map taking the basepoint x
0
∈ X to the basepoint y
0
∈ Y .
For brevity we write ϕ: (X, x
0
)→(Y, y
0
) in this situation. Then ϕ induces a homo
morphism ϕ
∗
: π
1
(X, x
0
)→π
1
(Y, y
0
), deﬁned by composing loops f : I→X based at
x
0
with ϕ, that is, ϕ
∗
[f] = [ϕf]. This induced map ϕ
∗
is welldeﬁned since a
homotopy f
t
of loops based at x
0
yields a composed homotopy ϕf
t
of loops based
at y
0
, so ϕ
∗
[f
0
] = [ϕf
0
] = [ϕf
1
] = ϕ
∗
[f
1
]. Furthermore, ϕ
∗
is a homomorphism
since ϕ(f g) = (ϕf) (ϕg).
Two basic properties of induced homomorphisms are:
(i) (ϕψ)
∗
= ϕ
∗
ψ
∗
for a composition (X, x
0
)
ψ
→(Y, y
0
)
ϕ
→(Z, z
0
).
(ii) 11
∗
= 11, in other words, the identity map 11: X→X induces the identity map
11: π
1
(X, x
0
)→π
1
(X, x
0
).
The ﬁrst of these follows since composition of maps is associative, (ϕψ)f = ϕ(ψf),
and the second is obvious. Properties (i) and (ii) of induced homomorphisms are
what makes the fundamental group into a functor. The formal deﬁnition of func
tors requires the introduction of certain other preliminary concepts, however, so we
postpone this until it is needed in §2.3.
From (i) and (ii) it follows formally that if ϕ is a homeomorphism with inverse
ψ, then ϕ
∗
is an isomorphism with inverse ψ
∗
since ϕ
∗
ψ
∗
= (ϕψ)
∗
= 11
∗
= 11
and similarly ψ
∗
ϕ
∗
= 11. We will use this fact to compute the fundamental groups
of higherdimensional spheres:
Proposition 1.14. π
1
(S
n
) = 0 if n ≥ 2.
Proof: Let f be a loop in S
n
at a chosen basepoint x
0
. If the image of f is disjoint
from some point x ∈ S
n
then f is nullhomotopic since S
n
− ¦x¦ is homeomorphic
to R
n
which is simplyconnected. So it will sufﬁce to homotope f to make it nonsur
jective. To do this we will look closely at a small open ball B about any point x ≠ x
0
in S
n
and see that f crosses B in such a way as to meet x only ﬁnitely many times,
and each time this happens the relevant portion of f can simply be pushed off x.
The set f
−1
(B) is open in (0, 1), hence is a disjoint union of at most countably
many open intervals (a
i
, b
i
). The compact set f
−1
(x) is contained in the union of
these intervals and can meet only ﬁnitely many of them, otherwise it would contain
points arbitrarily close to the set f
−1
(S
n
− B) which is compact and disjoint from
f
−1
(x), hence of strictly positive distance from f
−1
(x). Consider one of the intervals
(a
i
, b
i
) meeting f
−1
(x). The path f
i
obtained by restricting f to [a
i
, b
i
] lies in the
Section 1.1. Basic Constructions 35
closure of B, and its endpoints f(a
i
) and f(b
i
) lie in the boundary of B. If n ≥ 2
we can choose a path g
i
from f(a
i
) to f(b
i
) in the closure of B but disjoint from
x. For example, we could choose g
i
to lie in the boundary of B, which is a sphere of
dimension n − 1, hence pathconnected if n ≥ 2. Since the closure of B is simply
connected, being homeomorphic to a convex set in R
n
, the path f
i
is homotopic to
g
i
by Proposition 1.6, so we may homotope f by deforming f
i
to g
i
. Repeating this
process for each of the intervals (a
i
, b
i
) which meet f
−1
(x), we obtain eventually a
new loop homotopic to the given f and having image disjoint from x. L¦
Example 1.15. For x ∈ R
n
we have R
n
− ¦x¦ homeomorphic to S
n−1
×R, so by
Proposition 1.12, π
1
(R
n
− ¦x¦) is isomorphic to π
1
(S
n−1
)×π
1
(R), hence is Z for
n = 2 and trivial for n > 2.
Corollary 1.16. R
2
is not homeomorphic to R
n
for n ≠ 2.
Proof: Suppose f : R
2
→R
n
is a homeomorphism. The case n = 1 is easily disposed
of since R
2
−¦0¦ is pathconnected but the homeomorphic space R
n
−¦f(0)¦ is not
pathconnected when n = 1. When n > 2 we cannot distinguish R
2
− ¦0¦ from
R
n
−¦f(0)¦ by the number of pathcomponents, but by Example 1.15 we can distin
guish them by their fundamental groups instead. L¦
The more general statement that R
m
is not homeomorphic to R
n
if m ≠ n can
be proved in the same way using either higher homotopy groups or homology groups.
In fact, nonempty open sets in R
m
and R
n
can be homeomorphic only if m= n, as
will be shown in Theorem 2.19 using homology.
Induced homomorphisms allow certain relations between spaces to be trans
formed into relations between their fundamental groups. For example:
Proposition 1.17. If a space X retracts onto a subspace A, then the homomorphism
i
∗
: π
1
(A, x
0
)→π
1
(X, x
0
) induced by the inclusion i : A
X is injective. If A is a
deformation retract of X, then i
∗
is an isomorphism.
Proof: If r : X→A is a retraction, then ri = 11, hence r
∗
i
∗
= 11, which implies that i
∗
is injective. If r
t
: X→X is a deformation retraction of X onto A, so r
0
= 11, r
t
¦A = 11,
and r
1
(X) ⊂ A, then for any loop f : I→X based at x
0
∈ A the composition r
t
f gives
a homotopy of f to a loop in A, so i
∗
is also surjective. L¦
In particular, this gives another way of seeing that S
1
is not a retract of D
2
, a
fact we showed earlier in the proof of the Brouwer ﬁxed point theorem, since the
inclusioninduced map π
1
(S
1
)→π
1
(D
2
) is a homomorphism Z→0, which cannot be
injective.
The exact grouptheoretic analog of a retraction is a homomorphism ρ of a group
G onto a subgroup H such that ρ restricts to the identity on H. In the notation
36 Chapter 1. The Fundamental Group
above, if we identify π
1
(A) with its image under i
∗
, then r
∗
is such a homomorphism
from π
1
(X) onto the subgroup π
1
(A). The existence of a retracting homomorphism
ρ : G→H is quite a strong condition on H. If H is a normal subgroup, it implies that
G is the direct product of H and the kernel of ρ. If H is not normal, then G is what
is called in group theory the semidirect product of H and the kernel of ρ.
Recall from Chapter 0 the general deﬁnition of a homotopy: a family ϕ
t
: X→Y ,
t ∈ I , such that the associated map Φ: X×I→Y, Φ(x, t) = ϕ
t
(x), is continuous. If ϕ
t
takes a subspace A ⊂ X to a subspace B ⊂ Y for all t , then we speak of a homotopy of
maps of pairs, ϕ
t
: (X, A)→(Y, B). In particular, a basepointpreserving homotopy
ϕ
t
: (X, x
0
)→(Y, y
0
) is the case that ϕ
t
(x
0
) = y
0
for all t . A third basic property of
induced homomorphisms is their invariance under such homotopies:
(iii) If ϕ
t
: (X, x
0
)→(Y, y
0
) is a basepointpreserving homotopy, then ϕ
0∗
= ϕ
1∗
.
This holds since ϕ
0∗
[f] = [ϕ
0
f] = [ϕ
1
f] = ϕ
1∗
[f], the middle equality coming
from the homotopy ϕ
t
f .
There is a notion of homotopy equivalence for spaces with basepoints: (X, x
0
) =
(Y, y
0
) if there are maps ϕ: (X, x
0
)→(Y, y
0
) and ψ: (Y, y
0
)→(X, x
0
) with homo
topies ϕψ = 11 and ψϕ = 11 through maps ﬁxing the basepoints. In this case the
induced maps on π
1
satisfy ϕ
∗
ψ
∗
= (ϕψ)
∗
= 11
∗
= 11 and likewise ψ
∗
ϕ
∗
= 11, so
ϕ
∗
and ψ
∗
are inverse isomorphisms π
1
(X, x
0
) ≈ π
1
(Y, y
0
). This somewhat formal
argument gives another proof that a deformation retraction induces an isomorphism
on fundamental groups, since if X deformation retracts onto A then (X, x
0
) = (A, x
0
)
for any choice of basepoint x
0
∈ A.
Having to pay so much attention to basepoints when dealing with the fundamental
group is something of a nuisance. For homotopy equivalences one does not have to
be quite so careful, as the conditions on basepoints can actually be dropped:
Proposition 1.18. If ϕ: X→Y is a homotopy equivalence, then the induced homo
morphism ϕ
∗
: π
1
(X, x
0
)→π
1
¸
Y, ϕ(x
0
)
is an isomorphism for all x
0
∈ X.
The proof will use a simple fact about homotopies which do not preserve base
point:
Lemma 1.19. If ϕ
t
: X→Y is a homotopy and h is the path ϕ
t
(x
0
) traced out by a
basepoint x
0
∈ X, then ϕ
0∗
= β
h
ϕ
1∗
.
Proof: Let h
t
be the restriction of h to
X, π
1 0
( ) x
Y, π
1 0 1
( ( ) ) x ϕ
1
ϕ
Y, π
1
0 0
( ( ) ) x ϕ 0
ϕ
β
h
∗
∗
−
−
−
−
−
→
−
−
−
−
−
−
−
−
→
−
−
−
−
−
−
−
−
→
the interval [0, t], with a reparametriza
tion so that the domain of h
t
is still [0, 1]. Explicitly, we can take h
t
(s) = h(ts).
Then if f is a loop in X at the basepoint x
0
, the formula h
t
(ϕ
t
f) h
t
deﬁnes a
homotopy of loops at ϕ
0
(x
0
). Restricting this homotopy to t = 0 and t = 1, we see
that ϕ
0∗
([f]) = β
h
¸
ϕ
1∗
([f])
. L¦
Section 1.1. Basic Constructions 37
Proof of 1.18: Let ψ: Y→X be a homotopyinverse for ϕ, so that ϕψ = 11 and
ψϕ = 11. Consider the maps
π
1
(X, x
0
)
ϕ
∗
→π
1
¸
Y, ϕ(x
0
)
ψ
∗
→π
1
¸
X, ψϕ(x
0
)
ϕ
∗
→π
1
¸
Y, ϕψϕ(x
0
)
The composition of the ﬁrst two maps is an isomorphism since ψϕ = 11 implies that
ψ
∗
ϕ
∗
= β
h
for some h, by the lemma. In particular, since ψ
∗
ϕ
∗
is an isomorphism,
ϕ
∗
is injective. The same reasoning with the second and third maps shows that ψ
∗
is injective. Thus the ﬁrst two of the three maps are injections and their composition
is an isomorphism, so the ﬁrst map ϕ
∗
must be surjective as well as injective. L¦
Exercises
1. Show that composition of paths satisﬁes the following cancellation property: If
f
0
g
0
= f
1
g
1
and g
0
= g
1
then f
0
= f
1
.
2. For the changeofbasepoint homomorphisms β
h
, show that h = h
¹
implies β
h
=
β
h
¹ .
3. For a pathconnected space X, show that π
1
(X) is abelian iff all basepointchange
homomorphisms β
h
depend only on the endpoints of the path h.
4. A subspace X ⊂ R
n
is said to be starshaped if there is a point x
0
∈ X such that for
all x ∈ X, the line segment from x
0
to x lies in X. Show that if a subspace X ⊂ R
n
is
locally starshaped, i.e., every point of X has a starshaped neighborhood in X, then
every path in X is homotopic in X to a piecewise linear path, that is, a path consisting
of a ﬁnite number of straight line segments traversed at constant speed. Show this
applies in particular when X is open or when X is a union of ﬁnitely many closed
convex sets.
5. Show that every homomorphism π
1
(S
1
)→π
1
(S
1
) can be realized as the induced
homomorphism ϕ
∗
of a map ϕ: S
1
→S
1
.
6. Given a space X and a pathconnected subspace A containing the basepoint x
0
,
showthat the map π
1
(A, x
0
)→π
1
(X, x
0
) induced by the inclusion A
X is surjective
iff every path in X with endpoints in A is homotopic to a path in A.
7. Show that for a space X, the following three conditions are equivalent:
(i) Every map S
1
→X is homotopic to a constant map, with image a point.
(ii) Every map S
1
→X extends to a map D
2
→X.
(iii) π
1
(X, x
0
) = 0 for all x
0
∈ X.
Deduce that a space X is simplyconnected iff all maps S
1
→X are homotopic. [In
this problem, ‘homotopic’ means ‘homotopic without regard to basepoints.’]
8. We can regard π
1
(X, x
0
) as the set of basepointpreserving homotopy classes of
maps (S
1
, s
0
)→(X, x
0
). Let [S
1
, X] be the set of homotopy classes of maps S
1
→X,
with no conditions on basepoints. Thus there is a natural map Φ: π
1
(X, x
0
)→[S
1
, X]
38 Chapter 1. The Fundamental Group
obtained by ignoring basepoints. Show that Φ is onto if X is pathconnected, and that
Φ([f]) = Φ([g]) iff [f] and [g] are conjugate in π
1
(X, x
0
). Hence Φ induces a one
toone correspondence between [S
1
, X] and the set of conjugacy classes in π
1
(X),
when X is pathconnected.
9. Deﬁne f : S
1
×I→S
1
×I by f(θ, s) = (θ + 2πs, s), so f restricts to the identity
on the two boundary circles of S
1
×I . Show that f is homotopic to the identity by
a homotopy f
t
which is stationary on one of the boundary circles, but not by any
homotopy f
t
which is stationary on both boundary circles. [Consider what f does to
the path s
(θ
0
, s) for ﬁxed θ
0
∈ S
1
.]
10. Does the BorsukUlam theorem hold for the torus? In other words, for every map
f : S
1
×S
1
→R
2
must there exist (x, y) ∈ S
1
×S
1
such that f(x, y) = f(−x, −y)?
11. Let A
1
, A
2
, A
3
be compact sets in R
3
. Use the BorsukUlam theorem to show
that there is one plane P ⊂ R
3
which simultaneously divides each A
i
into two pieces
of equal measure.
X, π
1 1
( ) x X, π
1 0
( ) x
f
Y, π
1 0
( ( ) ) x f Y, π
1 1
( ( ) ) x f
β
h
β
fh
∗
f
∗
−
−
−
−
−
→
−
−
−
−
−
→
−−−−−−−−−−−→
−−−−−−−−−−−→
12. Given a map f : X→Y and a path h: I→X
from x
0
to x
1
, show that f
∗
β
h
= β
fh
f
∗
in the
diagram to the right.
13. Show, using fundamental groups and induced homomorphisms, that there is no
retraction of the M¨obius band onto its boundary circle.
14. Construct inﬁnitely many nonhomotopic retractions S
1
∨S
1
→S
1
.
15. If X
0
is the pathcomponent of a space X containing the basepoint x
0
, show that
the inclusion X
0
X induces an isomorphism π
1
(X
0
, x
0
)→π
1
(X, x
0
).
16. Using the technique in the proof of Proposition 1.14, show that if a space X is
obtained from a pathconnected subspace A by attaching a cell e
n
with n ≥ 2, then
the inclusion A
X induces a surjection on π
1
.
17. Suppose f
t
: X→X is a homotopy such that f
0
and f
1
are each the identity map.
For a basepoint x
0
∈ X, show that the loop f
t
(x
0
) represents an element of the
center of π
1
(X, x
0
). [See Lemma 1.19. One can interpret the result as saying that a
loop represents an element of the center of π
1
(X) if it extends to a ‘loop of maps
X→X.’]
Section 1.2. Van Kampen’s Theorem 39
The van Kampen theorem gives a method for computing the fundamental groups
of spaces which can be decomposed into simpler spaces whose fundamental groups
are already known. By systematic use of this theorem one can compute the funda
mental groups of a very large number of spaces. We shall see for example that for
every group G there is a space X
G
whose fundamental group is isomorphic to G.
To give some idea of how one might hope to compute fundamental groups by
decomposing spaces into simpler pieces, let us look at an example. Consider the space
X formed by two circles A and B intersecting in a single point, which we choose as
the basepoint x
0
. By our preceding calculations we know that π
1
(A) is inﬁnite cyclic,
generated by a loop a which goes once around A. Similarly, π
1
(B) is a copy of Z
generated by a loop b going once around B. Each product of powers of a and b then
gives an element of π
1
(X). For example, the product a
5
b
2
a
−3
ba
2
is the loop which
goes ﬁve times around A, then twice around B, then three times around A in the
opposite direction, then once around B, then twice around A. The set of all words like
a
5
b
2
a
−3
ba
2
, consisting of powers of a alternating with powers of b, forms a group
usually denoted Z∗Z. Multiplication in this group is deﬁned just as one would expect,
e.g., (b
4
a
5
b
2
a
−3
)(a
4
b
−1
ab
3
) = b
4
a
5
b
2
ab
−1
ab
3
. The identity element is the empty
word, and inverses are what they have to be, e.g., (a
2
b
−3
aba
−2
)
−1
= a
2
b
−1
a
−1
b
3
a
−2
.
It would be very nice if such words in a and b corresponded exactly to elements of
π
1
(X), so that π
1
(X) was isomorphic to the group Z ∗Z. The van Kampen theorem
will imply that this is indeed the case. Similarly, if X is the union of three circles
touching at a single point, the van Kampen theorem will imply that π
1
(X) is Z∗Z∗Z,
the group consisting of words in powers of three letters a, b, c. The generalization
to a union of any number of circles touching at one point will also follow as a special
case of the van Kampen theorem.
The group Z ∗ Z is an example of a general construction called the free product
of groups. The statement of van Kampen’s theorem will be in terms of free products,
so before stating the theorem we should describe exactly what free products are, in
case the reader has not seen this algebraic construction previously.
Free Products of Groups
Suppose one is given a collection of groups G
α
and one wishes to construct a
single group containing all these groups as subgroups. One way to do this would be
to take the product group
¸
α
G
α
, whose elements can be regarded as the functions
α
g
α
∈ G
α
. Or one could restrict to functions taking on nonidentity values at
most ﬁnitely often, forming the direct sum
¸
α
G
α
. Both these constructions produce
groups containing all the G
α
’s as subgroups, but with the property that elements of
40 Chapter 1. The Fundamental Group
different subgroups G
α
commute with each other. In the realm of nonabelian groups
this commutativity is unnatural, and so one would like a ‘nonabelian’ version of
¸
α
G
α
or
¸
α
G
α
. Since the sum
¸
α
G
α
is smaller and presumably simpler than
¸
α
G
α
, it
should be easier to construct a nonabelian version of
¸
α
G
α
, and this is what the free
product ∗
α
G
α
achieves.
Here is the precise deﬁnition. As a set, the free product ∗
α
G
α
consists of all
words g
1
g
2
··· g
m
of arbitrary ﬁnite length m ≥ 0, where each letter g
i
belongs to
a group G
α
i
and is not the identity element of G
α
i
, and adjacent letters g
i
and g
i+1
belong to different groups G
α
, that is, α
i
≠ α
i+1
. Words satisfying these conditions
are called reduced, the idea being that nonreduced words can always be simpliﬁed
until they are reduced by writing adjacent letters which lie in the same G
α
i
as a
single letter and by cancelling trivial letters. The empty word is allowed, and will
be the identity element of ∗
α
G
α
. The group operation in ∗
α
G
α
is juxtaposition,
(g
1
··· g
m
)(h
1
··· h
n
) = g
1
··· g
m
h
1
··· h
n
. This product may not be reduced, how
ever: If g
m
and h
1
belong to the same G
α
they should be combined into a single letter
(g
m
h
1
) according to the multiplication in G
α
, and if this new letter g
m
h
1
happens to
be the identity of G
α
, it should be cancelled from the product. This may allow g
m−1
and h
2
to be combined, and possibly cancelled too, etc. For example, in the product
(g
1
··· g
m
)(g
−1
m
··· g
−1
1
) everything cancels and we get the identity element of ∗
α
G
α
,
the empty word.
Verifying directly that this multiplication is associative would be rather tedious,
but there is an indirect approach which avoids most of the work. Let W be the set
of reduced words g
1
··· g
m
as above, including the empty word. To each g ∈ G
α
we
associate the function L
g
: W→W given by multiplication on the left, L
g
(g
1
··· g
m
) =
gg
1
··· g
m
where we combine g with g
1
if g
1
∈ G
α
to make gg
1
··· g
m
a reduced
word. A key property of the association g
L
g
is the formula L
gg
¹ = L
g
L
g
¹ for
g, g
¹
∈ G
α
, i.e., g(g
¹
(g
1
··· g
m
)) = (gg
¹
)(g
1
··· g
m
). This special case of associativ
ity follows rather trivially from associativity in G
α
. The formula L
gg
¹ = L
g
L
g
¹ implies
that L
g
is invertible with inverse L
g
−1 . Therefore the association g
L
g
deﬁnes a
homomorphism from G
α
to the group P(W) of all permutations of W. More gener
ally, we can deﬁne L: W→P(W) by L(g
1
··· g
m
) = L
g
1
··· L
g
m
for each reduced word
g
1
··· g
m
. This function L is injective since the permutation L(g
1
··· g
m
) sends the
empty word to g
1
··· g
m
. The product operation in W corresponds under L to com
position in P(W); this follows from the relation L
gg
¹ = L
g
L
g
¹ . Since composition in
P(W) is associative, we conclude that the product in W is associative.
In particular, we have the free product Z ∗ Z as described earlier. This is an
example of a free group, which is the free product of any number of copies of Z,
ﬁnite or inﬁnite. The elements of a free group are uniquely representable as reduced
words in powers of generators for the various copies of Z, with one generator for each
Z, just as in the case of Z ∗Z. These generators are called a basis for the free group,
Section 1.2. Van Kampen’s Theorem 41
and the number of basis elements is the rank of the free group. The abelianization
of a free group is a free abelian group with basis the same set of generators, so since
the rank of a free abelian group is welldeﬁned, independent of the choice of basis,
the same is true for the rank of a free group.
An interesting example of a free product which is not a free group is Z
2
∗Z
2
. This
is like Z∗Z but simpler since a
2
= e = b
2
, so one doesn’t need powers of a and b, and
Z
2
∗Z
2
consists of just the alternating words in a and b: a, b, ab, ba, aba, bab,
abab, baba, ababa, ···, together with the empty word. The structure of Z
2
∗ Z
2
can be elucidated by looking at the homomorphism ϕ: Z
2
∗ Z
2
→Z
2
associating to
each word its length mod 2. Obviously ϕ is surjective, and its kernel consists of the
words of even length. These form an inﬁnite cyclic subgroup generated by ab since
ba = (ab)
−1
in Z
2
∗Z
2
. In fact, Z
2
∗Z
2
is the semidirect product of the subgroups
Z and Z
2
generated by ab and a, with the conjugation relation a(ab)a
−1
= (ab)
−1
.
This group is sometimes called the inﬁnite dihedral group.
For a general free product ∗
α
G
α
, each group G
α
is naturally identiﬁed with a
subgroup of ∗
α
G
α
, the subgroup consisting of the empty word and the nonidentity
oneletter words g ∈ G
α
. From this viewpoint, the empty word is the common iden
tity element of all the subgroups G
α
, which are otherwise disjoint. A consequence
of associativity is that any product g
1
··· g
m
of elements g
i
in the groups G
α
has
a unique reduced form, the element of ∗
α
G
α
obtained by performing the multipli
cations in any order. In fact, any sequence of reduction operations on an unreduced
product g
1
··· g
m
, combining adjacent letters g
i
and g
i+1
which lie in the same G
α
or cancelling a g
i
which is the identity, can be viewed as a way of inserting paren
theses into g
1
··· g
m
and performing the resulting sequence of multiplications. Thus
associativity implies the nonobvious fact that any two sequences of reduction opera
tions performed on the same unreduced word always yield the same reduced word in
the end.
A basic property of the free product ∗
α
G
α
is that any collection of homomor
phisms ϕ
α
: G
α
→H extends uniquely to a homomorphism ϕ: ∗
α
G
α
→H. Namely,
the value of ϕ on a word g
1
··· g
n
with g
i
∈ G
α
i
must be ϕ
α
1
(g
1
) ··· ϕ
α
n
(g
n
), and
using this formula to deﬁne ϕ gives a welldeﬁned homomorphism since the process
of reducing an unreduced product in ∗
α
G
α
does not affect its image under ϕ. For
example, for a free product G∗H the inclusions G
G×H and H
G×H induce
a surjective homomorphism G ∗H→G×H.
The van Kampen Theorem
Suppose a space X is decomposed as the union of a collection of pathconnected
open subsets A
α
, each containing the basepoint x
0
∈ X. By the remarks made in the
preceding paragraph, the homomorphisms j
α
: π
1
(A
α
)→π
1
(X) induced by the inclu
sions A
α
X extend to a homomorphism Φ: ∗
α
π
1
(A
α
)→π
1
(X). The van Kampen
42 Chapter 1. The Fundamental Group
theoremwill say that Φ is very often surjective, but we can expect Φ to have a nontriv
ial kernel in general. For if i
αβ
: π
1
(A
α
∩A
β
)→π
1
(A
α
) is the homomorphism induced
by the inclusion A
α
∩ A
β
A
α
then j
α
i
αβ
= j
β
i
βα
, both these compositions being
induced by the inclusion A
α
∩A
β
X, so the kernel of Φ contains all the elements
of the form i
αβ
(ω)i
βα
(ω)
−1
for ω ∈ π
1
(A
α
∩ A
β
). Van Kampen’s theorem asserts
that under fairly broad hypotheses this gives a full description of Φ:
Theorem 1.20. If X is the union of pathconnected open sets A
α
each containing
the basepoint x
0
∈ X and if each intersection A
α
∩ A
β
is pathconnected, then
Φ: ∗
α
π
1
(A
α
)→π
1
(X) is surjective. If in addition each intersection A
α
∩ A
β
∩ A
γ
is pathconnected, then the kernel of Φ is the normal subgroup N generated by all
elements of the form i
αβ
(ω)i
βα
(ω)
−1
, and so Φ induces an isomorphism π
1
(X) ≈
∗
α
π
1
(A
α
)/N.
Example 1.21: Wedge sums. In Chapter 0 we deﬁned the wedge sum
α
X
α
of a col
lection of spaces X
α
with basepoints x
α
∈ X
α
to be the quotient space of the disjoint
union
¸
α
X
α
in which all the basepoints x
α
are identiﬁed to a single point. If each x
α
is a deformation retract of an open neighborhood U
α
in X
α
, then X
α
is a deformation
retract of its open neighborhood X
α
β≠α
U
β
. Letting A
α
be this neighborhood, then
the intersection of two or more distinct A
α
’s is
α
U
α
which deformation retracts to
a point. Hence van Kampen’s theorem implies that Φ: ∗
α
π
1
(X
α
)→π
1
(
α
X
α
) is an
isomorphism.
In particular, for a wedge sum
α
S
1
α
of circles, π
1
(
α
S
1
α
) is a free group, the free
product of copies of Z, one for each circle S
1
α
. For instance, π
1
(S
1
∨S
1
) ≈ Z ∗Z, as
in the example at the beginning of this section.
It is true more generally that the fundamental group of any connected graph is
free, as we show in §1A. Here is an example illustrating the general technique.
Example 1.22. Let X be the graph shown in the ﬁgure, consist
ing of the twelve edges of a cube. The seven heavily shaded edges
form a maximal tree T ⊂ X, a contractible subgraph containing all
the vertices of X. We claim that π
1
(X) is the free product of ﬁve
copies of Z, one for each edge not in T . To deduce this from van
Kampen’s theorem, choose for each edge e
α
of X − T an open neighborhood A
α
of
T ∪e
α
in X which deformation retracts onto T ∪e
α
. The intersection of two or more
A
α
’s deformation retracts onto T , hence is contractible. The A
α
’s form a cover of
X satisfying the hypotheses of van Kampen’s theorem, and since the intersection of
any two of them is simplyconnected we obtain an isomorphism π
1
(X) ≈ ∗
α
π
1
(A
α
).
Each A
α
deformation retracts onto a circle, so π
1
(X) is free on ﬁve generators, as
claimed. As explicit generators we can choose for each edge e
α
of X − T a loop f
α
which starts at a basepoint in T , travels in T to one end of e
α
, then across e
α
, then
back to the basepoint along a path in T .
Section 1.2. Van Kampen’s Theorem 43
Notice in this example that the graph is embedded in the plane with ﬁve bounded
complementary regions. The ﬁve boundary loops of these regions, when connected
to a common basepoint by paths, also form free generators for π
1
(X). This can be
shown by an inductive argument using van Kampen’s theorem.
Van Kampen’s theorem is often applied when there are just two sets A
α
and A
β
in the cover of X, so the condition on triple intersections A
α
∩A
β
∩A
γ
is vacuous and
one obtains the isomorphism π
1
(X) ≈ π
1
(A
α
) ∗ π
1
(A
β
)/N, under the assumption
that A
α
∩ A
β
is pathconnected. The proof in this special case is virtually identical
with the proof in the general case, however.
One can see that the intersections A
α
∩ A
β
need to be pathconnected by con
sidering the example of S
1
decomposed as the union of two open arcs. In this case
Φ is not surjective. For an example showing that triple intersections A
α
∩ A
β
∩ A
γ
need to be pathconnected, let X be the suspension of three points
a, b, c, and let A
α
, A
β
, and A
γ
be the complements of these three
a b c
points. The theorem does apply to the covering ¦A
α
, A
β
¦, so π
1
(X) ≈
π
1
(A
α
) ∗π
1
(A
β
) ≈ Z∗Z since A
α
∩A
β
is contractible. If we tried to use the covering
¦A
α
, A
β
, A
γ
¦ which has each of the twofold intersections pathconnected but not the
triple intersection, then we would get π
1
(X) ≈ Z ∗ Z ∗ Z, but this is not isomorphic
to Z ∗Z since it has a different abelianization.
Proof of van Kampen’s theorem: First we show Φ is surjective. Given a loop f : I→X
at the basepoint x
0
, we claim there is a partition 0 = s
0
< s
1
< ··· < s
m
= 1 of I
such that each subinterval [s
i−1
, s
i
] is mapped by f to a single A
α
. Namely, since f
is continuous, each s ∈ I has an open neighborhood V
s
in I mapped by f to some
A
α
. We may in fact take V
s
to be an interval whose closure is mapped to a single
A
α
. Compactness of I implies that a ﬁnite number of these intervals cover I . The
endpoints of this ﬁnite set of intervals then deﬁne the desired partition of I .
Denote the A
α
containing f([s
i−1
, s
i
]) by A
i
, and let f
i
be the path obtained
by restricting f to [s
i−1
, s
i
]. Then f is the composition f
1
··· f
m
with f
i
a path
in A
i
. Since A
i
∩ A
i+1
is pathconnected, we may
choose a path g
i
in A
i
∩A
i+1
from x
0
to the point
f(s
i
) ∈ A
i
∩A
i+1
. Consider the loop
g
1
g
2
2
f
1
f
3
f
A
α
A
β
x
0
(f
1
g
1
) (g
1
f
2
g
2
) (g
2
f
3
g
3
) ··· (g
m−1
f
m
)
which is homotopic to f . This loop is a composition
of loops each lying in a single A
i
, the loops indicated
by the parentheses. Hence [f] is in the image of Φ, and Φ is surjective.
The harder part of the proof is to show that the kernel of Φ is N. It may clarify
matters to introduce some terminology. By a factorization of an element [f] ∈ π
1
(X)
we shall mean a formal product [f
1
] ··· [f
k
] where:
44 Chapter 1. The Fundamental Group
— Each f
i
is a loop in some A
α
i
at the basepoint x
0
, and [f
i
] ∈ π
1
(A
α
i
) is the
homotopy class of f
i
.
— The loop f is homotopic to f
1
··· f
k
in X.
Thus a factorization can be regarded as a word in ∗
α
π
1
(A
α
), possibly unreduced,
which is mapped by Φ onto the given [f] ∈ π
1
(X). The proof of surjectivity of Φ
showed that every [f] ∈ π
1
(X) has a factorization.
We will be concerned now with the uniqueness of factorizations. Call two factor
izations of [f] equivalent if they are related by a sequence of the following two sorts
of moves or their inverses:
— Combine adjacent terms [f
i
][f
i+1
] into a single term [f
i
f
i+1
] if [f
i
] and [f
i+1
]
lie in the same group π
1
(A
α
), or in other words, if α
i
= α
i+1
.
— Regard the term [f
i
] as lying in the group π
1
(A
α
¹
i
) rather than π
1
(A
α
i
) if f
i
is
a loop in A
α
i
∩A
α
¹
i
.
The ﬁrst move does not change the element of ∗
α
π
1
(A
α
) deﬁned by the factorization.
The second move does not change the image of this element in the quotient group
Q = ∗
α
π
1
(A
α
)/N, by the deﬁnition of N. So equivalent factorizations give the same
element of Q.
If we can show that any two factorizations of [f] are equivalent, this will say that
the map Q→π
1
(X) induced by Φ is injective, hence the kernel of Φ is exactly N and
the proof will be complete.
Let [f
1
] ··· [f
k
] and [f
¹
1
] ··· [f
¹
] be two factorizations of [f]. The composed
paths f
1
··· f
k
and f
¹
1
··· f
¹
are then homotopic, so let F : I ×I→X be a homo
topy from f
1
··· f
k
to f
¹
1
··· f
¹
. There exist partitions 0 = s
0
< s
1
< ··· < s
m
= 1
and 0 = t
0
< t
1
< ··· < t
n
= 1 such that each rectangle R
ij
= [s
i−1
, s
i
]×[t
j−1
, t
j
] is
mapped by F into a single A
α
, which we label A
ij
. These partitions may be obtained
by covering I ×I by ﬁnitely many rectangles [a, b]×[c, d] each mapping to a single
A
α
, using a compactness argument, then partitioning I ×I by the union of all the
horizontal and vertical lines containing edges of these rectangles. We may assume
the s
i
partition subdivides the partitions giving the prod
ucts f
1
··· f
k
and f
¹
1
··· f
¹
. Since F maps a neigh
1 2 3 4
5 6 7 8
9 10 11 12
borhood of R
ij
to A
ij
, we may perturb the vertical sides of
the rectangles R
ij
so that each point of I ×I lies in at most
three R
ij
’s. We may assume there are at least three rows of
rectangles, so we can do this perturbation just on the rect
angles in the intermediate rows, leaving the top and bottom rows unchanged. Let us
relabel the new rectangles R
1
, R
2
, ··· , R
mn
as in the ﬁgure.
If γ is a path in I ×I from the left edge to the right edge, then the restriction F ¦
¦γ
is a loop at the basepoint x
0
since F maps both the left and right edges of I ×I to x
0
.
Let γ
r
be the path separating the ﬁrst r rectangles R
1
, ··· , R
r
from the remaining
Section 1.2. Van Kampen’s Theorem 45
rectangles. Thus γ
0
is the bottom edge of I ×I and γ
mn
is the top edge. We pass
from γ
r
to γ
r+1
by pushing across the rectangle R
r+1
.
Let us call the corners of the R
r
’s vertices. For each vertex v with F(v) ≠ x
0
, let
g
v
be a path from x
0
to F(v). We can choose g
v
to lie in the intersection of the two or
three A
ij
’s corresponding to the R
r
’s containing v since we assume the intersection
of any two or three A
ij
’s is pathconnected. If we insert into F ¦
¦γ
r
the appropriate
paths g
v
g
v
at successive vertices, as in the proof of surjectivity of Φ, then we obtain a
factorization of [F ¦
¦γ
r
] by regarding the loop corresponding to a horizontal or vertical
segment between adjacent vertices as lying in the A
ij
for either of the R
s
’s containing
the segment. Different choices of these containing R
s
’s change the factorization of
[F ¦
¦γ
r
] to an equivalent factorization. Furthermore, the factorizations associated to
successive paths γ
r
and γ
r+1
are equivalent since pushing γ
r
across R
r+1
to γ
r+1
changes F ¦
¦γ
r
to F ¦
¦γ
r+1
by a homotopy within the A
ij
corresponding to R
r+1
, and
we can choose this A
ij
for all the segments of γ
r
and γ
r+1
in R
r+1
.
We can arrange that the factorization associated to γ
0
is equivalent to the factor
ization [f
1
] ··· [f
k
] by choosing the path g
v
for each vertex v along the lower edge
of I ×I to lie not just in the two A
ij
’s corresponding to the R
s
’s containing v, but also
to lie in the A
α
for the f
i
containing v in its domain. In case v is the common end
point of the domains of two consecutive f
i
’s we have F(v) = x
0
, so there is no need
to choose a g
v
. In similar fashion we may assume that the factorization associated
to the ﬁnal γ
mn
is equivalent to [f
¹
1
] ··· [f
¹
]. Since the factorizations associated
to all the γ
r
’s are equivalent, we conclude that the factorizations [f
1
] ··· [f
k
] and
[f
¹
1
] ··· [f
¹
] are equivalent. L¦
Example 1.23: Linking of Circles. We can apply van Kampen’s theorem to calculate
the fundamental groups of three spaces discussed in the introduction to this chapter,
the complements in R
3
of a single circle, two unlinked circles, and two linked circles.
The complement R
3
− A of a single circle A
deformation retracts onto a wedge sum S
1
∨S
2
embedded in R
3
−A as shown in the ﬁrst of
the two ﬁgures. It may be easier to see that
A A
R
3
−A deformation retracts onto the the union
of S
2
with a diameter, as in the second ﬁgure,
where points outside S
2
deformation retract onto S
2
, and then points inside S
2
and
not in A can be pushed away from A toward S
2
or the diameter. Having this deforma
tion retraction in mind, one can then see how it must be modiﬁed if the two endpoints
of the diameter are gradually moved towards each other along the equator until they
coincide, forming the S
1
summand of S
1
∨ S
2
. Another way of seeing the deforma
tion retraction of R
3
−A onto S
1
∨S
2
is to note ﬁrst that an open ε neighborhood of
S
1
∨S
2
obviously deformation retracts onto S
1
∨S
2
if ε is sufﬁciently small. Then one
46 Chapter 1. The Fundamental Group
observes that this neighborhood is homeomorphic to R
3
− A by a homeomorphism
which is the identity on S
1
∨S
2
. In fact, the neighborhood can be gradually enlarged
by homeomorphisms until it becomes all of R
3
−A.
In any event, once we see that R
3
− A deformation retracts to S
1
∨ S
2
, then we
immediately obtain isomorphisms π
1
(R
3
−A) ≈ π
1
(S
1
∨S
2
) ≈ Z since π
1
(S
2
) = 0.
In similar fashion, the complement R
3
− (A ∪ B)
of two unlinked circles A and B deformation retracts
onto S
1
∨S
1
∨S
2
∨S
2
, as in the ﬁgure to the right. From
A B
this we get π
1
¸
R
3
−(A ∪B)
≈ Z ∗Z.
On the other hand, if A and B are
linked, then R
3
− (A ∪ B) deformation retracts onto the wedge
sum of S
2
and a torus S
1
×S
1
separating A and B, as shown in
the ﬁgure to the left, and from this we get π
1
¸
R
3
− (A ∪ B)
≈
π
1
(S
1
×S
1
) ≈ Z×Z.
Example 1.24: Torus Knots. For relatively prime positive integers m and n consider
the torus knot K = K
m,n
⊂ R
3
which is the image of the embedding f : S
1
→S
1
×S
1
⊂
R
3
, f(z) = (z
m
, z
n
), where the torus S
1
×S
1
is embedded in R
3
in the standard way.
The knot K then winds around the torus a total of m
times in the longitudinal direction and n times in
the meridional direction, as shown in the ﬁgure for
the cases (m, n) = (2, 3) and (3, 4). One needs to
assume that m and n are relatively prime in order
for the map f to be injective. Without this assumption f would be d to 1 where
d is the greatest common divisor of m and n, and the image of f would be the
knot K
m/d,n/d
. One could also allow negative values for m or n, but this would only
change K to a mirrorimage knot.
Let us compute π
1
(R
3
− K). It is slightly easier to do the calculation with R
3
replaced by its onepoint compactiﬁcation S
3
. An application of van Kampen’s theo
rem shows that this does not affect π
1
. Namely, write S
3
−K as the union of R
3
−K
and an open ball B formed by the compactiﬁcation point together with the comple
ment of a large closed ball in R
3
containing K. Then B and B ∩ (R
3
− K) are both
simplyconnected, the latter space being homeomorphic to S
2
×R. Hence van Kam
pen’s theorem implies that the inclusion R
3
− K
S
3
− K induces an isomorphism
on π
1
.
We compute π
1
(S
3
−K) by showing that it deformation retracts onto a 2 dimen
sional complex X = X
m,n
homeomorphic to the quotient space of a cylinder S
1
×I
under the identiﬁcations (z, 0) ∼ (e
2πi/m
z, 0) and (z, 1) ∼ (e
2πi/n
z, 1). If we let X
m
and X
n
be the two halves of X formed by the quotients of S
1
×[0,
1
/
2
] and S
1
×[
1
/
2
, 1],
then X
m
and X
n
are the mapping cylinders of z
z
m
and z
z
n
. The intersection
Section 1.2. Van Kampen’s Theorem 47
X
m
∩X
n
is the circle S
1
×¦
1
/
2
¦, the domain end of each mapping cylinder.
To obtain an embedding of X in S
3
− K as a deformation retract we will use
the standard decomposition of S
3
into two solid tori S
1
×D
2
and D
2
×S
1
, the result
of writing S
3
= ∂D
4
= ∂(D
2
×D
2
) = ∂D
2
×D
2
∪ D
2
×∂D
2
. Geometrically, the ﬁrst
solid torus S
1
×D
2
can be identiﬁed with the compact region in R
3
bounded by the
standard torus S
1
×S
1
containing K, and the second solid torus D
2
×S
1
is then the
closure of the complement of the ﬁrst solid torus, together with the compactiﬁcation
point at inﬁnity. Notice that meridional circles in S
1
×S
1
bound disks in the ﬁrst solid
torus, while it is longitudinal circles that bound disks in the second solid torus.
In the ﬁrst solid torus, K intersects each of the meridian circles
¦x¦×∂D
2
in m equallyspaced points, as indicated in the ﬁgure,
which shows a meridian disk ¦x¦×D
2
. These m points can be
K
K
K
separated by a union of m radial line segments. Letting x vary,
these radial segments then trace out a copy of the mapping
cylinder X
m
in the ﬁrst solid torus. Symmetrically, there is a
copy of the other mapping cylinder X
n
in the second solid torus. The complement
of K in the ﬁrst solid torus deformation retracts onto X
m
by ﬂowing within each
meridian disk as shown. In similar fashion the complement of K in the second solid
torus deformation retracts onto X
n
. These two deformation retractions do not agree
on their common domain of deﬁnition S
1
×S
1
− K, but this is easy to correct by
distorting the ﬂows in the two solid tori so that in S
1
×S
1
−K both ﬂows are orthogonal
to K. After this modiﬁcation we now have a welldeﬁned deformation retraction of
S
3
−K onto X. Another way of describing the situation would be to say that a small
ε neighborhood N of K has frontier a torus T , and S
3
−N is the mapping cylinder
of a map T→X.
To compute π
1
(X) we apply van Kampen’s theorem to the decomposition of X
as the union of X
m
and X
n
, or more properly, open neighborhoods of these two
sets which deformation retract onto them. Both X
m
and X
n
are mapping cylinders
which deformation retract onto circles, and X
m
∩X
n
is a circle, so all three of these
spaces have fundamental group Z. A loop in X
m
˚∩ X
n
representing a generator of
π
1
(X
m
∩ X
n
) is homotopic in X
m
to a loop representing m times a generator, and
in X
n
to a loop representing n times a generator. Van Kampen’s theorem then says
that π
1
(X) is the quotient of the free group on generators a and b obtained by
factoring out the normal subgroup generated by the element a
m
b
−n
. Let us denote
this quotient group by G
m,n
.
A basic question in knot theory is whether two given knots are equivalent in the
sense that one can be continuously deformed, without intersecting itself at any time,
until it coincides with the other. It is not hard to see for example that all the knots K
1,n
and K
m,1
are equivalent to the trivial knot K
1,1
, and also that K
m,n
is equivalent to
K
n,m
. There are some subtleties in deﬁning precisely which continuous deformations
48 Chapter 1. The Fundamental Group
of knots are allowed, but after these have been sorted out one ﬁnds that if K and K
¹
are equivalent knots, then S
3
−K and S
3
−K
¹
are homeomorphic. Thus if one can show
that the two fundamental groups π
1
(S
3
− K) and π
1
(S
3
− K
¹
) are not isomorphic,
then K and K
¹
are not equivalent.
Deciding whether two given groups are isomorphic is a very difﬁcult problem
in general, and it is hard even for the fundamental groups π
1
(S
3
− K). However,
in the special case of torus knots there is a rather simple answer: The group G
m,n
uniquely determines m and n if m, n > 1. In other words, if there is an isomorphism
G
m,n
≈ G
r,s
with m, n, r, s > 1, then ¦m, n¦ = ¦r, s¦. To show this the ﬁrst step is to
compute the center of G
m,n
, the subgroup consisting of elements which commute with
all elements of G
m,n
. The element a
m
= b
n
commutes with a and b, so the cyclic
subgroup C generated by this element lies in the center. In particular, C is a normal
subgroup, so we can pass to the quotient group G
m,n
/C, which is the free product
Z
m
∗Z
n
. According to Exercise 1 at the end of this section, a free product of nontrivial
groups has trivial center, and from this it follows that C is exactly the center of G
m,n
.
As we will see in Example 1.44, the elements a and b have inﬁnite order in G
m,n
, so
C is inﬁnite cyclic, but we do not need this fact for the present argument. Since the
center of a group is intrinsically deﬁned, it remains to show that the integers m and
n are uniquely determined by the group Z
m
∗ Z
n
. The abelianization of this group
is Z
m
×Z
n
, of order mn, so the product mn is uniquely determined by Z
m
∗ Z
n
.
To determine m and n individually, we use another assertion from Exercise 1 at the
end of the section, which says that all torsion elements of Z
m
∗ Z
n
are conjugate to
elements of the subgroups Z
m
and Z
n
, hence have order dividing m or n. Thus the
maximum order of torsion elements of Z
m
∗Z
n
is the larger of m and n. The larger
of these two numbers is therefore uniquely determined by the group Z
m
∗Z
n
, hence
also the smaller since the product is uniquely determined.
Note that G
m,n
is nonabelian if m, n > 1, while G
1,n
= G
m,1
= Z. Thus no torus
knot K
m,n
with m, n > 1 is equivalent to the trivial knot K
1,1
.
This method for distinguishing the groups π
1
(S
3
− K) for different knots K by
factoring out the center only works for torus knots since it is known that for all other
knots the center of π
1
(S
3
− K) is trivial. An obvious thing to consider in trying to
distinguish these groups would be the abelianization of π
1
(S
3
−K), but this is always
Z as we show in §2B. What does provide much useful information, however, is the
abelianization of the commutator subgroup of π
1
(S
3
−K); see [Rolfsen] for more on
this.
The preceding analysis of π
1
(X
m,n
) does not use the hypothesis that m and n
are relatively prime, which was used only to relate X
m,n
to torus knots. An interesting
fact is that X
m,n
can be embedded in R
3
only when m and n are relatively prime. This
follows from Corollary 3.44 since the abelianization of π
1
(X
m,n
) is easily computed
to be Z×Z
d
where d is the greatest common divisor of m and n, so if d > 1 this
Section 1.2. Van Kampen’s Theorem 49
abelianization contains torsion, and this prevents X
m,n
frombeing embeddable in R
3
.
For example, X
2,2
is the Klein bottle since it is the union of two copies of the M¨obius
band X
2
with their boundary circles identiﬁed, so this nonembeddability statement
generalizes the fact that the Klein bottle cannot be embedded in R
3
.
Example 1.25: The Shrinking Wedge of Circles. Consider the sub
space X ⊂ R
2
which is the union of the circles C
n
of radius
1
/
n
and
center (
1
/
n
, 0) for n = 1, 2, ···. With the subspace topology from
R
2
, an open neighborhood of the origin in X must contain all but
ﬁnitely many of the circles C
n
, so the subspace topology on X has
fewer open sets than the usual wedge sum
∞
S
1
of an inﬁnite sequence of circles,
which is a quotient space of
¸
∞
S
1
.
This difference in topologies has a big effect on π
1
(X), making it much larger
than π
1
(
∞
S
1
). To see this, consider the retractions r
n
: X→C
n
collapsing all C
i
’s
except C
n
to the origin. Each r
n
induces a surjection ρ
n
: π
1
(X)→π
1
(C
n
) ≈ Z, where
we take the origin as the basepoint. The product of the ρ
n
’s is a homomorphism
ρ : π
1
(X)→
¸
∞
Z to the direct product (not the direct sum) of inﬁnitely many copies
of Z, and ρ is surjective since for every sequence of integers k
n
we can construct a
loop f : I→X which wraps k
n
times around C
n
in the time interval [1−
1
/
n
, 1−
1
/
n+1
].
This inﬁnite composition of loops is continuous since X has the subspace topology
from R
2
. Since
¸
∞
Z is uncountable, so is π
1
(X). On the other hand, π
1
(
∞
S
1
) is
free on countably many generators, hence is countable. Loops in
∞
S
1
can go around
only ﬁnitely many of the circles since these circles are not shrinking to a point as they
are in X.
The group π
1
(X) is actually far more complicated than
¸
∞
Z. For one thing, it
is nonabelian, since the retraction X→C
1
∪ ··· ∪ C
n
which collapses all the circles
smaller than C
n
to the basepoint induces a surjection from π
1
(X) to a free group on
n generators. For a complete description of π
1
(X) see [CannonConner].
A theorem in [Shelah] asserts that for a compact metric space which is path
connected and locally pathconnected, the fundamental group is either ﬁnitely gener
ated or uncountable.
Applications to Cell Complexes
For the remainder of this section we shall be interested in 2 dimensional cell
complexes, analyzing how the fundamental group is affected by attaching 2 cells.
According to an exercise at the end of this section, attaching cells of higher dimension
has no effect on π
1
, so all the interest lies in how the 2 cells are attached.
Suppose we attach a collection of 2 cells e
2
α
to a pathconnected space X via maps
ϕ
α
: S
1
→X, producing a space Y . If s
0
is a basepoint of S
1
then ϕ
α
determines a
loop at ϕ
α
(s
0
) which we shall call ϕ
α
, even though technically loops are maps I→X
rather than S
1
→X. For different α’s the basepoints ϕ
α
(s
0
) of these loops ϕ
α
may
50 Chapter 1. The Fundamental Group
not all coincide. To remedy this, choose a basepoint x
0
∈ X and a path γ
α
in X
from x
0
to ϕ
α
(s
0
) for each α. Then γ
α
ϕ
α
γ
α
is a loop at x
0
. This loop may not
be nullhomotopic in X, but it will certainly be nullhomotopic in Y after the cell e
2
α
is attached. Thus the normal subgroup N ⊂ π
1
(X, x
0
) generated by all the loops
γ
α
ϕ
α
γ
α
for varying α lies in the kernel of the map π
1
(X, x
0
)→π
1
(Y, x
0
) induced
by the inclusion X
Y .
Proposition 1.26. The inclusion X
Y induces a surjection π
1
(X, x
0
)→π
1
(Y, x
0
)
whose kernel is N. Thus π
1
(Y) ≈ π
1
(X)/N.
It follows that N is independent of the choice of the paths γ
α
, but this can also be
seen directly: If we replace γ
α
by another path η
α
having the same endpoints, then
γ
α
ϕ
α
γ
α
changes to η
α
ϕ
α
η
α
= (η
α
γ
α
)γ
α
ϕ
α
γ
α
(γ
α
η
α
), so γ
α
ϕ
α
γ
α
and η
α
ϕ
α
η
α
deﬁne conjugate elements of π
1
(X, x
0
).
Proof: Let us expand Y to a slightly larger space Z which deformation retracts onto Y
and is more convenient for applying van Kampen’s theorem. The space Z is obtained
from Y by attaching rectangular strips S
α
= I ×I , with the lower edge I ×¦0¦ attached
along γ
α
, the right edge ¦1¦×I attached along an arc in e
2
α
, and all the left edges
¦0¦×I of the different strips identiﬁed together. The top edges of the strips are not
attached to anything, and this allows us to deformation retract Z onto Y .
S
X
e
x
y
2
0
α
α
α
α
γ
In each cell e
2
α
choose a point y
α
not in the arc along which S
α
is attached. Let
A = Z −
α
¦y
α
¦ and let B = Z − X. Then A deformation retracts onto X, and B is
contractible. Since π
1
(B) = 0, van Kampen’s theoremapplied to the cover ¦A, B¦ says
that π
1
(Z) is isomorphic to the quotient of π
1
(A) by the normal subgroup generated
by the image of the map π
1
(A∩B)→π
1
(A). So it remains only to see that π
1
(A∩B)
is generated by the loops γ
α
ϕ
α
γ
α
, or rather by loops in A ∩ B homotopic to these
loops. This can be shown by another application of van Kampen’s theorem, this time
to the cover of A∩B by the open sets A
α
= A∩B −
β≠α
e
2
β
. Since A
α
deformation
retracts onto a circle in e
2
α
−¦y
α
¦, we have π
1
(A
α
) ≈ Z generated by a loop homotopic
to γ
α
ϕ
α
γ
α
, and the result follows. L¦
As a ﬁrst application we compute the fundamental group of the orientable surface
M
g
of genus g. This has a cell structure with one 0 cell, 2g 1 cells, and one 2 cell, as
we saw in Chapter 0. The 1 skeleton is a wedge sum of 2g circles, with fundamental
Section 1.2. Van Kampen’s Theorem 51
group free on 2g generators, and the 2 cell is attached along the loop given by the
product of the commutators of these generators, say [a
1
, b
1
] ··· [a
g
, b
g
]. Therefore
π
1
(M
g
) ≈ ¹ a
1
, b
1
, ··· , a
g
, b
g
¦ [a
1
, b
1
] ··· [a
g
, b
g
] )
where ¹ g
α
¦ r
β
) denotes the group with generators g
α
and relators r
β
, in other words
the free group on the generators g
α
modulo the normal subgroup generated by the
words r
β
in these generators.
Corollary 1.27. The surface M
g
is not homeomorphic, or even homotopy equivalent,
to M
h
if g ≠ h.
Proof: The abelianization of π
1
(M
g
) is the direct sum of 2g copies of Z. So if
M
g
= M
h
then π
1
(M
g
) ≈ π
1
(M
h
), hence the abelianizations of these groups are iso
morphic, which implies g = h. L¦
Nonorientable surfaces can be treated in the same way. If we attach a 2 cell to the
wedge sum of g circles by the word a
2
1
··· a
2
g
we obtain a nonorientable surface N
g
.
For example, N
1
is the projective plane RP
2
, the quotient of D
2
with antipodal points
of ∂D
2
identiﬁed. And N
2
is the Klein bottle, though the more usual representation
a
a
1
2
N
2
N
a
b
a
b
c
a a
c c
b
RP :
−−−−−−−
:
−−−−
of the Klein bottle is as a square with opposite sides identiﬁed via the word aba
−1
b.
If one cuts the square along a diagonal and reassembles the resulting two triangles
as shown in the ﬁgure, one obtains the other representation as a square with sides
identiﬁed via the word a
2
c
2
. By the proposition, π
1
(N
g
) ≈ ¹ a
1
, ··· , a
g
¦ a
2
1
··· a
2
g
).
This abelianizes to the direct sum of Z
2
with g −1 copies of Z since in the abelian
ization we can rechoose the generators to be a
1
, ··· , a
g−1
and a
1
+ ··· + a
g
, with
2(a
1
+ ··· + a
g
) = 0. Hence N
g
is not homotopy equivalent to N
h
if g ≠ h, nor is
N
g
homotopy equivalent to any orientable surface M
h
.
Another consequence of the preceding proposition is:
Corollary 1.28. For every group G there is a 2 dimensional cell complex X
G
with
π
1
(X
G
) ≈ G.
Proof: Choose a presentation G = ¹ g
α
¦ r
β
). This exists since every group is a
quotient of a free group, so the g
α
’s can be taken to be the generators of this free
group with the r
β
’s generators of the kernel of the map from the free group to G.
Now construct X
G
from
α
S
1
α
by attaching 2 cells e
2
β
by the loops speciﬁed by the
words r
β
. L¦
52 Chapter 1. The Fundamental Group
Example 1.29. If G = ¹ a ¦ a
n
) = Z
n
then X
G
is S
1
with a cell e
2
attached by the map
z
z
n
, thinking of S
1
as the unit circle in C. When n = 2 we get X
G
= RP
2
, but
for n > 2 the space X
G
is not a surface since there
are n ‘sheets’ of e
2
attached at each point of the
circle S
1
⊂ X
G
. For example, when n = 3 one can
construct a neighborhood N of S
1
in X
G
by taking
the product of the letter ‘ Y ’ with the interval I , then
identifying the two ends of this product via a onethird twist as shown in the ﬁgure.
The boundary of N consists of a single circle, formed by the three endpoints of each
‘ Y ’ cross section of N. To complete the construction of X
G
from N one attaches
a disk along the boundary circle of N. This cannot be done in R
3
, though it can in
R
4
. For n = 4 one would use the letter ‘ X’ instead of ‘ Y ,’ with a onequarter twist
instead of a onethird twist. For larger n one would use an n pointed ‘asterisk’ and
a
1
/
n
twist.
Exercises
1. Show that the free product G∗H of nontrivial groups G and H has trivial center,
and that the only elements of G∗H of ﬁnite order are the conjugates of ﬁniteorder
elements of G and H.
2. Let X ⊂ R
m
be the union of convex open sets X
1
, ··· , X
n
such that X
i
∩X
j
∩X
k
≠ ∅
for all i, j, k. Show that X is simplyconnected.
3. Show that the complement of a ﬁnite set of points in R
n
is simplyconnected if
n ≥ 3.
4. Let X ⊂ R
3
be the union of n lines through the origin. Compute π
1
(R
3
−X).
5. Let X ⊂ R
2
be a ﬁnite graph which is the union of the edges of a convex polygon
and a ﬁnite number of line segments having endpoints on these edges.
(a) Showthat π
1
(X) is free with a basis consisting of loops formed by the boundaries
of the bounded complementary regions of X, joined to a basepoint by paths in X.
(b) Show this is true for all choices of paths to the basepoint.
6. Suppose a space Y is obtained from a pathconnected subspace X by attaching
n cells for a ﬁxed n ≥ 3. Show that the inclusion X
Y induces an isomorphism
on π
1
. [See the proof of Proposition 1.26.] Apply this to show that the complement
of a discrete subspace of R
n
is simplyconnected if n ≥ 3.
7. Let X be the quotient space of S
2
obtained by identifying the north and south
poles to a single point. Put a cell complex structure on X and use this to compute
π
1
(X).
Section 1.2. Van Kampen’s Theorem 53
8. Compute the fundamental group of the space obtained from two tori S
1
×S
1
by
identifying a circle S
1
×¦x
0
¦ in one torus with the corresponding circle S
1
×¦x
0
¦ in
the other torus.
9. Let C be a circle in the surface M
g
of genus g which separates M
g
into
two compact subsurfaces M
¹
h
and M
¹
k
obtained from the closed surfaces M
h
¹
M
C
C
h
¹
¹
M
k
and M
k
by deleting an open disk from each. Show that M
¹
h
does not retract onto
its boundary circle C, and hence M
g
does not retract onto C. [Hint: abelianize π
1
.]
But show that M
g
does retract onto the nonseparating circle C
¹
in the ﬁgure.
α β
γ
10. Consider two arcs α and β embedded in D
2
×I as
shown in the ﬁgure. The loop γ is obviously nullhomo
topic in D
2
×I , but show that there is no nullhomotopy of
γ in the complement of α∪β.
11. The mapping torus T
f
of a map f : X→X is the quotient of X×I obtained
by identifying each point (x, 0) with (f(x), 1). In the case X = S
1
∨ S
1
with f
basepointpreserving, compute a presentation for π
1
(T
f
) in terms of the induced
map f
∗
: π
1
(X)→π
1
(X). Do the same when X = S
1
×S
1
. [One way to do this is to
regard T
f
as built from X ∨S
1
by attaching cells.]
12. The Klein bottle is usually pictured as a subspace of R
3
like the subspace X ⊂ R
3
shown in the ﬁrst ﬁgure below. If one wanted a model which could actually function
as a bottle, one would delete the open disk bounded by the circle of selfintersection
of X, producing a subspace Y ⊂ X. Show that π
1
(X) ≈ Z ∗ Z and that π
1
(Y) has
the presentation ¹ a, b, c ¦ aba
−1
b
−1
cb
ε
c
−1
) for ε = :1. (Changing the sign of ε
gives an isomorphic group, as it happens.) Show also that π
1
(Y) is isomorphic to
π
1
(R
3
−Z) for Z the graph shown in the second ﬁgure. [The group π
1
(Y) is not free;
see the discussion in Example 1B.13.]
13. The space Y in the preceding exercise can be obtained from a disk with two holes
by identifying its three boundary circles. There are only two essentially different ways
of identifying the three boundary circles. Show that the other way yields a space Z
with π
1
(Z) not isomorphic to π
1
(Y). [Abelianize the fundamental groups to show
they are not isomorphic.]
14. Consider the quotient space of a cube I
3
obtained by identifying each square
face with the opposite square face via the righthanded screw motion consisting of
54 Chapter 1. The Fundamental Group
a translation by one unit in the direction perpendicular to the face combined with a
onequarter twist of the face about its center point. Show this quotient space X is a
cell complex with two 0 cells, four 1 cells, three 2 cells, and one 3 cell. Using this
structure, show that π
1
(X) is the quaternion group ¦:1, :i, :j, :k¦, of order eight.
15. Given a space X with basepoint x
0
∈ X, we may construct a CW complex L(X)
having a single 0 cell, a 1 cell for each loop in X based at x
0
, and a 2 cell for each
map of a standard triangle T into X taking the three vertices to the basepoint. Such
a 2 cell is attached to the three 1 cells which are the loops obtained by restricting the
map to the three edges of T . Show that π
1
¸
L(X)
is isomorphic to π
1
(X, x
0
) via an
isomorphism induced by a natural map L(X)→X.
16. Show that the fundamental group of the surface of inﬁnite genus shown below is
free on an inﬁnite number of generators.
17. Show that π
1
(R
2
−Q
2
) is uncountable.
18. If X is the subspace of R
2
consisting of the four sides of the square [0, 1]×[0, 1]
together with the portions of the vertical lines x =
1
/
2
,
1
/
3
,
1
/
4
, ··· inside the square,
show that π
1
(X) is free on a countable set of generators.
19. Show that the subspace of R
3
which is the union of the spheres of radius
1
/
n
and
center (
1
/
n
, 0, 0) for n = 1, 2, ··· is simplyconnected.
20. Let X be the subspace of R
2
which is the union of the circles C
n
of radius n and
center (n, 0) for n = 1, 2, ···. Showthat π
1
(X) is the free group ∗
n
π
1
(C
n
), the same
as for the inﬁnite wedge sum
∞
S
1
. Show that X and
∞
S
1
are in fact homotopy
equivalent, but not homeomorphic.
21. Show that the join X ∗Y of two nonempty spaces X and Y is simplyconnected
if X is pathconnected.
Section 1.3. Covering Spaces 55
We come now to the second main topic of this chapter, covering spaces. We have
in fact already encountered one example of a covering space in our calculation of
π
1
(S
1
). This was the map R→S
1
which we pictured as the projection of a helix onto
a circle. One thinks of the helix as lying above, or ‘covering,’ the circle. A number
of things we proved for this helix example hold true for all covering spaces, and this
allows covering spaces to serve as a useful tool for calculating fundamental groups in
general. But there is much more to the story than this, and the connection between
fundamental group and covering spaces is so close that in many ways they can be
regarded as two viewpoints toward the same thing. This means that algebraic features
of the fundamental group can often be translated into the geometric language of
covering spaces. This is exempliﬁed in one of the main results in this section, giving
an exact correspondence between the various connected covering spaces of a given
space X and subgroups of π
1
(X). This is strikingly reminiscent of Galois theory, with
its correspondence between ﬁeld extensions and subgroups of the Galois group.
Let us begin with the deﬁnition. A covering space of a space X is a space
`
X
together with a map p:
`
X→X satisfying the following condition: There exists an
open cover ¦U
α
¦ of X such that for each α, p
−1
(U
α
) is a disjoint union of open sets
in
`
X, each of which is mapped by p homeomorphically onto U
α
. We do not require
that p
−1
(U
α
) be nonempty, so p need not be surjective.
In the helix example one has p: R→S
1
given by p(t) = (cos 2πt, sin2πt), and
the cover ¦U
α
¦ can be taken to consist of any two open arcs whose union is S
1
.
A related example is the helicoid surface S ⊂ R
3
consisting of points of the form
(s cos 2πt, s sin2πt, t) for (s, t) ∈ (0, ∞)×R. This projects onto R
2
− ¦0¦ via the
map (x, y, z)
(x, y), and this projection deﬁnes a covering space p: S→R
2
−¦0¦
since for each open disk U in R
2
−¦0¦, p
−1
(U) consists of countably many disjoint
open disks in S each mapped homeomorphically onto U by p.
p
Another example is the map p: S
1
→S
1
, p(z) = z
n
where we
view z as a complex number with ¦z¦ = 1 and n is any positive
integer. The closest one can come to realizing this covering space
as a linear projection in 3 space analogous to the projection of the
helix is to draw a circle wrapping around a cylinder n times and
intersecting itself in n−1 points which one has to imagine are not
really intersections. For an alternative picture without this ﬂaw,
embed S
1
in the boundary torus of a solid torus S
1
×D
2
so that it winds n times
monotonically around the S
1
factor without selfintersections, then restrict the pro
jection S
1
×D
2
→S
1
×¦0¦ to this embedded circle. The ﬁgure for Example 1.29 in the
56 Chapter 1. The Fundamental Group
preceding section illustrates the case n = 3.
As our general theory will show, these examples for n ≥ 1 together with the
helix example exhaust all the connected coverings spaces of S
1
. There are many
other disconnected covering spaces of S
1
, such as n disjoint circles each mapped
homeomorphically onto S
1
, but these disconnected covering spaces are just disjoint
unions of connected ones. We will usually restrict our attention to connected covering
spaces as these contain most of the interesting features of covering spaces.
The covering spaces of S
1
∨S
1
form a remarkably rich family illustrating most of
the general theory very concretely, so let us look at a small sample of these covering
spaces to get an idea of what is going on.
To abbreviate notation, set X = S
1
∨S
1
. We view this as a
graph with one vertex and two edges. We label the edges a
b
a
and b and we choose orientations for a and b. Now let
`
X be
any other graph with four edges meeting at each vertex, and suppose the edges of
`
X
have been assigned labels a and b and orientations in such a way that the local picture
near each vertex is the same as in X, so there is an a edge oriented toward the vertex,
an a edge oriented away from the vertex, a b edge oriented toward the vertex, and a
b edge oriented away from the vertex. To give a name to this structure, let us call
`
X
a 2 oriented graph. The table on the next page shows a number of examples. (What
the pictures in (12)(14) mean will become clear a couple paragraphs below when we
describe a similar example in more detail.)
Given a 2 oriented graph
`
X we can construct a map p:
`
X→X sending all vertices
of
`
X to the vertex of X and sending each edge of
`
X to the edge of X with the same
label by a map which is a homeomorphism on the interior of the edge and preserves
orientation. It is clear that the covering space condition is satisﬁed for p. The con
verse is also true: Every covering space of X is a graph which inherits a 2 orientation
from X.
As the reader will discover by experimentation, it seems that every graph having
four edges incident at each vertex can be 2 oriented. This can be proved for ﬁnite
graphs as follows. A very classical and easily shown fact is that every ﬁnite connected
graph with an even number of edges incident at each vertex has an Eulerian circuit,
a loop traversing each edge exactly once. If there are four edges at each vertex, then
labelling the edges of an Eulerian circuit alternately a and b produces a labelling with
two a and two b edges at each vertex. The union of the a edges is then a collection of
disjoint circles, as is the union of the b edges, and choosing orientations for all these
circles gives a 2 orientation. It is a theorem in graph theory that inﬁnite graphs with
four edges incident at each vertex can also be 2 oriented; see Chapter 13 of [Koenig]
for a proof. There is also a generalization to n oriented graphs, which are covering
spaces of the wedge sum of n circles.
Section 1.3. Covering Spaces 57
a
b
b
a
) bab ¹a, b ,
2 1
a
a
a
b
b
b
¹ab)
a
a
a
b
b
b
a
a
b
b
a
a
a
b
b
b
a
a
a
b
b
b
a
a
a
a
a
a
a
a a
a
a
a
b
b
b
b
b
b
b
b
b b b
b
b
a
a
a
a
a a
a a
a
a
b
b
b
b
b
b b b
b
b
b
b
b
b
a
a a
1 2
4 3
( ) ( )
( ) ( )
5 ( ) 6 ( )
7 ( ) 8 ( )
9 ( ) 10 ( )
11 ( ) 12 ( )
13 ( )
14 ( )
¹a)
bab ¹a
1
)
1 1
¹a , , , aba bab b )
2 2
¹a , , , , ab a ab b )
2 2 2
1 1 1
¹a, , , ba b baba b b )
2 2
1 1
¹a , , , ab a b b )
3 3
¹a , , , ab ba b )
3 3
¹a , , ab b )
2 2
¹a , , , , ab a b ba b )
4 4 2 2
¹a , , , ,
,
, ab bab b ba b )
2 2 4
( ) ba
2 2
( )
1 2
+1 2n 2n 1
ab b ¹
n n
 ) Z ∈ n
ab b ¹
2n
ab b
2n
 ) Z ∈ n
58 Chapter 1. The Fundamental Group
The ﬁgure to the right shows a rather special 2 oriented graph
which can be constructed concretely as a subspace of R
2
by the
following procedure. Start with the open intervals (−1, 1) in
the x and y axes. Next, for a ﬁxed number λ, 0 < λ <
1
/
2
,
for example λ =
1
/
3
, adjoin four open segments of length
2λ, at distance λ from the ends of the previous segments
and perpendicular to them, the new shorter segments being bi
sected by the older ones. For the third stage, add perpendicular
open segments of length 2λ
2
at distance λ
2
from the endpoints of all the previous
segments and bisected by them. The process is now repeated indeﬁnitely, at the n
th
stage adding open segments of length 2λ
n−1
at distance λ
n−1
from all the previous
endpoints. The union of all these open segments is a graph, with vertices the intersec
tion points of horizontal and vertical segments, and edges the subsegments between
adjacent vertices. We label all the horizontal edges a, oriented to the right, and all
the vertical edges b, oriented upward.
The special feature of this covering space is that it is simplyconnected. It is called
the universal cover of X because, as our general theory will show, it is a covering space
of every other connected covering space of X.
The covering spaces (1)(14) in the table are all nonsimplyconnected. Their fun
damental groups are free, namely, free products of Z’s with generators the loops
given by the listed words in a and b, starting at the basepoint ` x
0
indicated by the
heavily shaded vertex. This can be proved in each case by applying van Kampen’s the
orem. One can also interpret the list of words as generators of the image subgroup
p
∗
¸
π
1
(
`
X, ` x
0
)
in π
1
(X, x
0
) = ¹a, b). A general fact we shall prove about covering
spaces is that the induced map p
∗
: π
1
(
`
X, ` x
0
)→π
1
(X, x
0
) is always injective. Thus
we have the atﬁrstglanceparadoxical fact that the free group on two generators can
contain as a subgroup a free group on any ﬁnite number of generators, or even on a
countably inﬁnite set of generators as in examples (10) and (11).
Changing the basepoint vertex changes the subgroup p
∗
¸
π
1
(
`
X, ` x
0
)
to a conju
gate subgroup in π
1
(X, x
0
), in fact conjugate by the element of π
1
(X, x
0
) deﬁned by
a path joining one basepoint to the other. For example, the covering spaces (3) and
(4) differ only in the choice of basepoints, and the corresponding subgroups of Z ∗Z
differ by conjugation by b.
The main classiﬁcation theorem for covering spaces says that by associating the
subgroup p
∗
¸
π
1
(
`
X, ` x
0
)
to the covering space p:
`
X→X, we obtain a onetoone cor
respondence between all the different connected covering spaces of X and the conju
gacy classes of subgroups of π
1
(X). If one keeps track of the basepoint vertex ` x
0
∈
`
X,
then this is a onetoone correspondence between covering spaces p: (
`
X, ` x
0
)→(X, x
0
)
and actual subgroups of π
1
(X, x
0
), not just conjugacy classes. Of course, for these
statements to make sense one has to have a precise notion of when two covering
Section 1.3. Covering Spaces 59
spaces are the same, or ‘isomorphic.’ In the case at hand, two covering spaces of
X are isomorphic iff there is a homeomorphism between them which preserves the
labeling and orientations of edges. Thus the covering spaces in (3) and (4) are isomor
phic, but not by an isomorphism preserving basepoints, so the two corresponding
subgroups of Z ∗ Z are distinct but conjugate. On the other hand, the two covering
spaces in (5) and (6) are not isomorphic, though the graphs are homeomorphic, so the
two corresponding subgroups of index 3 are isomorphic but not conjugate.
Another feature which might be observed is that some of the covering spaces
are more symmetric than others, where by a ‘symmetry’ we mean a homeomorphism
from the graph to itself which preserves the labelings and orientations. Speciﬁcally,
one can ask in each case whether there are symmetries taking any one vertex onto any
other. The examples (1), (2), (5)(8), and (11) are the ones with this symmetry property.
We shall see that having this symmetry property is equivalent to the corresponding
subgroup of Z ∗ Z being a normal subgroup. And if the covering space does have
this symmetry property, then its symmetries form a group isomorphic to the quotient
group of Z∗Z by the normal subgroup. Since every group generated by two elements is
a quotient group of Z∗Z, this implies that every twogenerator group is the symmetry
group of some covering space of X.
Lifting Properties
Covering spaces are deﬁned in fairly geometric terms, as maps p:
`
X→X which
are local homeomorphisms in a rather strong sense. But from the viewpoint of alge
braic topology, the distinctive feature of covering spaces is their behavior with respect
to lifting of maps. Recall the terminology from the proof of Theorem 1.7: a lift of a
map f : Y→X is a map
`
f : Y→
`
X such that p
`
f = f . We will describe three special
lifting properties of covering spaces, and derive a few applications of these.
First we have the homotopy lifting property, or covering homotopy property
as it is sometimes called:
Proposition 1.30. Given a covering space p:
`
X→X, a homotopy f
t
: Y→X, and a
map
`
f
0
: Y→
`
X lifting f
0
, then there exists a unique homotopy
`
f
t
: Y→
`
X of
`
f
0
which
lifts f
t
.
Proof: For the covering space p: R→S
1
this is property (c) in the proof of Theo
rem 1.7, and the proof there applies to any covering space. L¦
Taking Y to be a point gives the following path lifting property for a covering
space p:
`
X→X: For each path f : I→X starting at a point x
0
∈ X and each ` x
0
∈
p
−1
(x
0
) there is a unique path
`
f : I→
`
X lifting f starting at ` x
0
. In particular, the
uniqueness of lifts implies that every lift of a constant path is constant, but this could
be deduced more simply from the fact that p
−1
(x
0
) has the discrete topology, by the
deﬁnition of a covering space.
60 Chapter 1. The Fundamental Group
Taking Y to be I , we see that every homotopy f
t
of a path f
0
in X lifts to a
homotopy
`
f
t
of each lift
`
f
0
of f
0
. The lifted homotopy
`
f
t
is a homotopy of paths,
ﬁxing the endpoints, since as t varies, each endpoint of
`
f
t
traces out a path lifting a
constant path, which must therefore be constant.
Here is a simple application:
Proposition 1.31. The map p
∗
: π
1
(
`
X, ` x
0
)→π
1
(X, x
0
) induced by a covering space
p: (
`
X, ` x
0
)→(X, x
0
) is injective. The image subgroup p
∗
¸
π
1
(
`
X, ` x
0
)
in π
1
(X, x
0
)
consists of the homotopy classes of loops in X based at x
0
whose lifts to
`
X starting
at ` x
0
are loops.
Proof: An element of the kernel of p
∗
is represented by a loop
`
f
0
: I→
`
X with a
homotopy f
t
: I→X of f
0
= p
`
f
0
to the trivial loop f
1
. By the remarks preceding the
proposition, there is a lifted homotopy of loops
`
f
t
starting with
`
f
0
and ending with
a constant loop. Hence [
`
f
0
] = 0 in π
1
(
`
X, ` x
0
) and p
∗
is injective.
For the other statement of the proposition, certainly loops at x
0
lifting to loops
at ` x
0
represent elements of the image of p
∗
: π
1
(
`
X, ` x
0
)→π
1
(X, x
0
). Conversely, a
loop representing an element of the image of p
∗
is homotopic to a loop having such
a lift, hence, by homotopy lifting, the loop itself must have such a lift. L¦
If p:
`
X→X is a covering space, then the cardinality of the set p
−1
(x) is locally
constant over X, hence if X is connected, this cardinality is constant as x ranges
over all of X. It is called the number of sheets of the covering.
Proposition 1.32. The number of sheets of a covering space p: (
`
X, ` x
0
)→(X, x
0
)
with X and
`
X pathconnected equals the index of p
∗
¸
π
1
(
`
X, ` x
0
)
in π
1
(X, x
0
).
Proof: For a loop g in X based at x
0
, let ` g be its lift to
`
X starting at ` x
0
. A product
h g with [h] ∈ H = p
∗
¸
π
1
(
`
X, ` x
0
)
has the lift
`
h ` g ending at the same point as ` g
since
`
h is a loop. Thus we may deﬁne a function Φ from cosets H[g] to p
−1
(x
0
)
by sending H[g] to ` g(1). The pathconnectedness of
`
X implies that Φ is surjective
since ` x
0
can be joined to any point in p
−1
(x
0
) by a path ` g projecting to a loop g at
x
0
. To see that Φ is injective, observe that Φ(H[g
1
]) = Φ(H[g
2
]) implies that g
1
g
2
lifts to a loop in
`
X based at ` x
0
, so [g
1
][g
2
]
−1
∈ H and hence H[g
1
] = H[g
2
]. L¦
It is useful to know about the existence and uniqueness of lifts not just of homo
topies, but of general maps. For the question of when lifts exist an answer is provided
by the following lifting criterion:
Proposition 1.33. Suppose given a covering space p: (
`
X, ` x
0
)→(X, x
0
) and a map
f : (Y, y
0
)→(X, x
0
) with Y pathconnected and locally pathconnected. Then a lift
`
f : (Y, y
0
)→(
`
X, ` x
0
) of f exists iff f
∗
¸
π
1
(Y, y
0
)
⊂ p
∗
¸
π
1
(
`
X, ` x
0
)
.
Section 1.3. Covering Spaces 61
When we say a space has a certain property locally, such as being locally path
connected, we shall mean that each point has arbitrarily small open neighborhoods
with this property. Thus for Y to be locally pathconnected means that for each point
y ∈ Y and each neighborhood U of y, there is an open neighborhood V ⊂ U of
y which is pathconnected. Some authors weaken the requirement that V be path
connected to the condition that any two points in V be joinable by a path in U.
This broader deﬁnition would work just as well for our purposes, necessitating only
small adjustments in the proofs, but for simplicity we shall use the more restrictive
deﬁnition.
Proof: The ‘only if’ statement is obvious since f
∗
= p
∗
`
f
∗
. For the converse, let
y ∈ Y and let γ be a path in Y from y
0
to y. The path fγ in X starting at x
0
has a unique lift
¯
fγ starting at ` x
0
. Deﬁne
`
f(y) =
¯
fγ(1). To show this is well
deﬁned, independent of the choice of γ, let γ
¹
be another path from y
0
to y. Then
(fγ
¹
) (fγ) is a loop h
0
at x
0
with [h
0
] ∈ f
∗
¸
π
1
(Y, y
0
)
⊂ p
∗
¸
π
1
(
`
X, ` x
0
)
. This
means there is a homotopy h
t
of h
0
to a loop h
1
which
lifts to a loop
`
h
1
in
`
X based at ` x
0
. Apply the cover
ing homotopy property to h
t
to get a lifting
`
h
t
.
Since
`
h
1
is a loop at ` x
0
, so is
`
h
0
. By the
uniqueness of lifted paths, the ﬁrst half
of
`
h
0
is
¯
fγ
¹
and the second half
is
¯
fγ traversed backwards,
with the common midpoint
¯
fγ(1) =
¯
fγ
¹
(1). This shows
`
f is welldeﬁned.
γ
γ
y
y
y f
f
p
f
γ f
x
0
0
( )
¹ γ
¹
γ
y f
f
f
γ f
x
0
( )
¹
To see that
`
f is continuous, let U ⊂ X be an open neighborhood of f(y) having
a lift
`
U ⊂
`
X containing
`
f(y) such that p:
`
U→U is a homeomorphism. Choose a
pathconnected open neighborhood V of y with f(V) ⊂ U. For paths from y
0
to
points y
¹
∈ V we can take a ﬁxed path γ from y
0
to y followed by paths η in
V from y to the points y
¹
. Then the paths (fγ) (fη) in X have lifts (
¯
fγ) (
¯
fη)
where
¯
fη = p
−1
fη and p
−1
: U→
`
U is the inverse of p:
`
U→U. Thus
`
f(V) ⊂
`
U and
`
f¦V = p
−1
f , hence
`
f is continuous at y. L¦
An example showing the necessity of the local pathconnectedness assumption
on Y is described in Exercise 7 at the end of the section.
Next we have the unique lifting property:
Proposition 1.34. Given a covering space p:
`
X→X and a map f : Y→X with two
lifts
`
f
1
,
`
f
2
: Y→
`
X which agree at one point of Y , then if Y is connected, these two
lifts must agree on all of Y .
Proof: For a point y ∈ Y , let U
1
and U
2
be neighborhoods of
`
f
1
(y) and
`
f
2
(y),
respectively, mapping homeomorphically to a neighborhood U of Y by p, as in the
62 Chapter 1. The Fundamental Group
deﬁnition of a covering space. By continuity there is a neighborhood N of y mapped
into U
1
by
`
f
1
and into U
2
by
`
f
2
. If
`
f
1
(y) ≠
`
f
2
(y) then U
1
≠ U
2
, hence U
1
and
U
2
are disjoint and
`
f
1
≠
`
f
2
throughout the neighborhood N. On the other hand, if
`
f
1
(y) =
`
f
2
(y) then U
1
= U
2
so
`
f
1
=
`
f
2
on N since p
`
f
1
= p
`
f
2
and p is injective on
U
1
= U
2
. Thus the set of points where
`
f
1
and
`
f
2
agree is both open and closed in Y .
So if Y is connected this set is either empty or all of Y . L¦
The Classiﬁcation of Covering Spaces
We consider next the problem of classifying all the different covering spaces of
a ﬁxed space X. Since the whole chapter is about paths, it should not be surprising
that we will restrict attention to spaces X which are at least locally pathconnected.
Pathcomponents of X are then the same as components, and for the purpose of
classifying the covering spaces of X there is no loss in assuming X is connected,
or equivalently pathconnected. Local pathconnectedness is inherited by covering
spaces, so these too are connected iff they are pathconnected. The main thrust of the
classiﬁcation will be the Galois correspondence between connected covering spaces of
X and subgroups of π
1
(X), but when this is ﬁnished we will also describe a different
method of classiﬁcation which includes disconnected covering spaces as well.
The Galois correspondence will arise fromthe function which assigns to each cov
ering space p: (
`
X, ` x
0
)→(X, x
0
) the subgroup p
∗
¸
π
1
(
`
X, ` x
0
)
of π
1
(X, x
0
). First we
consider whether this function is surjective. That is, we ask whether every subgroup of
π
1
(X, x
0
) is realized as p
∗
¸
π
1
(
`
X, ` x
0
)
for some covering space p: (
`
X, ` x
0
)→(X, x
0
).
In particular we can ask whether the trivial subgroup is realized. Since p
∗
is always
injective, this amounts to asking whether X has a simplyconnnected covering space.
Answering this will take some work.
A necessary condition for X to have a simplyconnected covering space is the
following: Each point x ∈ X has a neighborhood U such that the inclusioninduced
map π
1
(U, x)→π
1
(X, x) is trivial; one says X is semilocally simplyconnected if
this holds. To see the necessity of this condition, suppose p:
`
X→X is a covering
space with
`
X simplyconnected. Every point x ∈ X has a neighborhood U having a
lift
`
U ⊂
`
X projecting homeomorphically to U by p. Each loop in U lifts to a loop
in
`
U, and the lifted loop is nullhomotopic in
`
X since π
1
(
`
X) = 0. So, composing this
nullhomotopy with p, the original loop in U is nullhomotopic in X.
A locally simplyconnected space is certainly semilocally simplyconnected. For
example, CWcomplexes have the much stronger property of being locally contractible,
as we show in the Appendix. An example of a space which is not semilocally simply
connected is the shrinking wedge of circles, the subspace X ⊂ R
2
consisting of the
circles of radius
1
/
n
centered at the point (
1
/
n
, 0) for n = 1, 2, ···, introduced in Exam
ple 1.25. On the other hand, the cone CX = (X×I)/(X×¦0¦) is semilocally simply
connected since it is contractibe, but it is not locally simplyconnected.
Section 1.3. Covering Spaces 63
We shall now show how to construct a simplyconnected covering space of X if
X is pathconnected, locally pathconnected, and semilocally simplyconnected. To
motivate the construction, suppose p: (
`
X, ` x
0
)→(X, x
0
) is a simplyconnected cover
ing space. Each point ` x ∈
`
X can then be joined to ` x
0
by a unique homotopy class of
paths, by Proposition 1.6, so we can view points of
`
X as homotopy classes of paths
starting at ` x
0
. The advantage of this is that, by the homotopy lifting property, homo
topy classes of paths in
`
X starting at ` x
0
are the same as homotopy classes of paths
in X starting at x
0
. This gives a way of describing
`
X purely in terms of X.
Given a pathconnected, locally pathconnected, semilocally simplyconnected
space X with a basepoint x
0
∈ X, we are therefore led to deﬁne
`
X = ¦ [γ] ¦ γ is a path in X starting at x
0
¦
where, as usual, [γ] denotes the homotopy class of γ with respect to homotopies
which ﬁx the endpoints γ(0) and γ(1). The function p:
`
X→X sending [γ] to γ(1)
is then welldeﬁned. Since X is pathconnected, the endpoint γ(1) can be any point
of X, so p is surjective.
Before we deﬁne a topology on
`
X we make a few preliminary observations. Let
1 be the collection of pathconnected open sets U ⊂ X such that π
1
(U)→π
1
(X) is
trivial. Note that if the map π
1
(U)→π
1
(X) is trivial for one choice of basepoint in U,
it is trivial for all choices of basepoint since U is pathconnected. A pathconnected
open subset V ⊂ U ∈ 1 is also in 1 since the composition π
1
(V)→π
1
(U)→π
1
(X)
will also be trivial. It follows that 1 is a basis for the topology on X if X is locally
pathconnected and semilocally simplyconnected.
Given a set U ∈ 1 and a path γ in X from x
0
to a point in U, let
U
[γ]
= ¦ [γ η] ¦ η is a path in U with η(0) = γ(1) ¦.
As the notation indicates, U
[γ]
depends only on the homotopy class [γ]. Observe
that p: U
[γ]
→U is surjective since U is pathconnected and injective since differ
ent choices of η joining γ(1) to a ﬁxed x ∈ U are all homotopic in X, the map
π
1
(U)→π
1
(X) being trivial. Another property is:
(∗)
U
[γ]
= U
[γ
¹
]
if [γ
¹
] ∈ U
[γ]
. For if γ
¹
= γ η then elements of U
[γ
¹
]
have the
form [γ η µ] and hence lie in U
[γ]
, while elements of U
[γ]
have the form
[γ µ] = [γ η η µ] = [γ
¹
η µ] and hence lie in U
[γ
¹
]
.
This can be used to show that the sets U
[γ]
form a basis for a topology on
`
X. For if
we are given two such sets U
[γ]
, V
[γ
¹
]
and an element [γ
¹¹
] ∈ U
[γ]
∩ V
[γ
¹
]
, we have
U
[γ]
= U
[γ
¹¹
]
and V
[γ
¹
]
= V
[γ
¹¹
]
by (∗). So if W ∈ 1 is contained in U∩V and contains
γ
¹¹
(1) then W
[γ
¹¹
]
⊂ U
[γ
¹¹
]
∩V
[γ
¹¹
]
and [γ
¹¹
] ∈ W
[γ
¹¹
]
.
The bijection p: U
[γ]
→U is a homeomorphism since it gives a bijection between
the subsets V
[γ
¹
]
⊂ U
[γ]
and the V ∈ 1 contained in U. Namely, in one direction
we have p(V
[γ
¹
]
) = V , and in the other we have p
−1
(V) ∩U
[γ]
= V
[γ
¹
]
for any [γ
¹
] ∈
64 Chapter 1. The Fundamental Group
U
[γ]
with endpoint in V , since V
[γ
¹
]
⊂ U
[γ
¹
]
= U
[γ]
and V
[γ
¹
]
maps onto V by the
bijection p.
The preceding paragraph implies that p:
`
X→X is continuous. We can also de
duce that this is a covering space since for ﬁxed U ∈ 1, the sets U
[γ]
for varying [γ]
partition p
−1
(U) because if [γ
¹¹
] ∈ U
[γ]
∩U
[γ
¹
]
then U
[γ]
= U
[γ
¹¹
]
= U
[γ
¹
]
by (∗).
A natural basepoint for
`
X is [x
0
], the homotopy class of the constant path at x
0
.
Any [γ] ∈
`
X can be joined to [x
0
] by a path in
`
X by restricting γ to progressively
shorter segments [0, t] ⊂ [0, 1], so
`
X is pathconnected. To see that π
1
(
`
X) = 0, let
f : I→
`
X be a loop based at [x
0
]. The composition pf is then a loop γ in X based
at x
0
. Let γ
t
be the path in X obtained by restricting the loop γ to [0, t]. Then [γ
t
]
for t varying from 0 to 1 forms a path in
`
X lifting the loop γ. This lift [γ
t
] starts
at [γ
0
] = [x
0
] = f(0), so by the unique lifting property of the cover space
`
X→X we
must have [γ
t
] = f(t) for all t . In particular, [γ
1
] = f(1) = [x
0
]. Since γ
1
= γ, this
says the loop γ = pf is nullhomotopic. Thus p
∗
([f]) = 0 in π
1
(X). Since p
∗
is
injective, [f] = 0 and hence π
1
(
`
X) = 0. This completes the construction.
In concrete cases one usually constructs a simplyconnected covering space by
more direct methods. For example, suppose X is the union of subspaces A and B for
which simplyconnected covering spaces
`
A→A and
`
B→B are already known. Then
one can attempt to build a simplyconnected covering space
`
X→X by assembling
copies of
`
A and
`
B. For example, for X = S
1
∨ S
1
, if we take A and B to be the two
circles, then
`
A and
`
B are each R, and we can build the simplyconnected cover
`
X
described earlier in this section by glueing together inﬁnitely many copies of
`
A and
`
B, namely the horizontal and vertical lines in
`
X. Here is another illustration of this
method:
Example 1.35. For integers m, n ≥ 2, let X
m,n
be the quotient space of a cylinder
S
1
×I under the identiﬁcations (z, 0) ∼ (e
2πi/m
z, 0) and (z, 1) ∼ (e
2πi/n
z, 1). Let
A ⊂ X and B ⊂ X be the quotients of S
1
×[0,
1
/
2
] and S
1
×[
1
/
2
, 1], so A and B are
the mapping cylinders of z
z
m
and z
z
n
, with A ∩B = S
1
. The simplest case
is m = n = 2, when A and B are M¨obius bands so X
2,2
is the Klein bottle. We
encountered the complexes X
m,n
previously in analyzing torus knot complements in
Example 1.24.
The ﬁgure for Example 1.29 at the end of the preceding section
shows what A looks like in the typical case m= 3. We have π
1
(A) ≈ Z,
and the universal cover
`
A is homeomorphic to a product C
m
×R where
C
m
is the graph which is a cone on m points, as shown in the ﬁgure
to the right. The situation for B is similar, and
`
B is homeomorphic to
C
n
×R. Now we attempt to build the universal cover
`
X
m,n
from copies
of
`
A and
`
B. Start with a copy of
`
A. Its boundary, the outer edges of its
ﬁns, consists of m copies of R. Along each of these m boundary lines we attach a
Section 1.3. Covering Spaces 65
copy of
`
B. Each of these copies of
`
B has one of its boundary lines attached to the
initial copy of
`
A, leaving n − 1 boundary lines free, and we attach a new copy of
`
A
to each of these free boundary lines. Thus we now have m(n − 1) + 1 copies of
`
A.
Each of the newly attached copies of
`
A has m− 1 free boundary lines, and to each
of these lines we attach a new copy of
`
B. The process is now repeated ad inﬁnitim in
the evident way. Let
`
X
m,n
be the resulting space.
The product structures
`
A = C
m
×R and
`
B = C
n
×R give
`
X
m,n
the structure of a product T
m,n
×R where T
m,n
is an
inﬁnite graph constructed by an inductive scheme just
like the construction of
`
X
m,n
. Thus T
m,n
is the union of
a sequence of ﬁnite subgraphs, each obtained from the
preceding by attaching newcopies of C
m
or C
n
. Each of
these ﬁnite subgraphs deformation retracts onto the pre
ceding one. The inﬁnite concatenation of these deformation
retractions, with the k
th
graph deformation retracting to the previous one during the
time interval [1/2
k
, 1/2
k−1
], gives a deformation retraction of T
m,n
onto the initial
stage C
m
. Since C
m
is contractible, this means T
m,n
is contractible, hence also
`
X
m,n
which is the product T
m,n
×R. In particular,
`
X
m,n
is simplyconnected.
The map which projects each copy of
`
A in
`
X
m,n
to A and
each copy of
`
B to B is a covering space. To deﬁne this map
precisely, choose a point x
0
∈ S
1
, and then the image of the
line segment ¦x
0
¦×I in X
m,n
meets A in a line segment whose
preimage in
`
A consists of an inﬁnite number of line segments,
appearing in the earlier ﬁgure as the horizontal segments spi
ralling around the central vertical axis. The picture in
`
B is
similar, and when we glue together all the copies of
`
A and
`
B
to form
`
X
m,n
, we do so in such a way that these horizontal segments always line up
exactly. This decomposes
`
X
m,n
into inﬁnitely many rectangles, each formed from a
rectangle in an
`
A and a rectangle in a
`
B. The covering projection
`
X
m,n
→X
m,n
is the
quotient map which identiﬁes all these rectangles.
Now we return to the general theory. The hypotheses for constructing a simply
connected covering space of X in fact sufﬁce for constructing covering spaces realiz
ing arbitrary subgroups of π
1
(X):
Proposition 1.36. Suppose X is pathconnected, locally pathconnected, and semilo
cally simplyconnected. Then for every subgroup H ⊂ π
1
(X, x
0
) there is a covering
space p: X
H
→X such that p
∗
¸
π
1
(X
H
, ` x
0
)
= H for a suitably chosen basepoint
` x
0
∈ X
H
.
Proof: For points [γ], [γ
¹
] in the simplyconnected covering space
`
X constructed
above, deﬁne [γ] ∼ [γ
¹
] to mean γ(1) = γ
¹
(1) and [γγ
¹
] ∈ H. It is easy to see
66 Chapter 1. The Fundamental Group
that this is an equivalence relation since H is a subgroup; namely, it is reﬂexive since
H contains the identity element, symmetric since H is closed under inverses, and
transitive since H is closed under multiplication. Let X
H
be the quotient space of
`
X
obtained by identifying [γ] with [γ
¹
] if [γ] ∼ [γ
¹
]. Note that if γ(1) = γ
¹
(1), then
[γ] ∼ [γ
¹
] iff [γη] ∼ [γ
¹
η]. This means that if any two points in basic neighborhoods
U
[γ]
and U
[γ
¹
]
are identiﬁed in X
H
then the whole neighborhoods are identiﬁed. Hence
the natural projection X
H
→X induced by [γ]
γ(1) is a covering space.
If we choose for the basepoint ` x
0
∈ X
H
the equivalence class of the constant path
c at x
0
, then the image of p
∗
: π
1
(X
H
, ` x
0
)→π
1
(X, x
0
) is exactly H. This is because
for a loop γ in X based at x
0
, its lift to
`
X starting at [c] ends at [γ], so the image
of this lifted path in X
H
is a loop iff [γ] ∼ [c], i.e., [γ] ∈ H. L¦
Having taken care of the existence of covering spaces of X corresponding to all
subgroups of π
1
(X), we turn now to uniqueness up to isomorphism, where an iso
morphismbetween covering spaces p
1
:
`
X
1
→X and p
2
:
`
X
2
→X is a homeomorphism
f :
`
X
1
→
`
X
2
such that p
1
= p
2
f . This condition means exactly that f preserves the
covering space structures, taking p
−1
1
(x) to p
−1
2
(x) for each x ∈ X. The inverse
f
−1
is then also an isomorphism, and the composition of two isomorphisms is an
isomorphism, so we have an equivalence relation.
Proposition 1.37. If X is pathconnected and locally pathconnected, then two path
connected covering spaces p
1
:
`
X
1
→X and p
2
:
`
X
2
→X are isomorphic via an isomor
phism f :
`
X
1
→
`
X
2
taking a basepoint ` x
1
∈ p
−1
1
(x
0
) to a basepoint ` x
2
∈ p
−1
2
(x
0
) iff
p
1∗
¸
π
1
(
`
X
1
, ` x
1
)
= p
2∗
¸
π
1
(
`
X
2
, ` x
2
)
.
Proof: If there is an isomorphism f : (
`
X
1
, ` x
1
)→(
`
X
2
, ` x
2
), then the relations p
1
=
p
2
f and p
2
= p
1
f
−1
imply that p
1∗
¸
π
1
(
`
X
1
, ` x
1
)
= p
2∗
¸
π
1
(
`
X
2
, ` x
2
)
. Conversely,
suppose that p
1∗
¸
π
1
(
`
X
1
, ` x
1
)
= p
2∗
¸
π
1
(
`
X
2
, ` x
2
)
. By the lifting criterion, we may
lift p
1
to a map ` p
1
: (
`
X
1
, ` x
1
)→(
`
X
2
, ` x
2
) with p
2
` p
1
= p
1
. Symmetrically, we obtain
` p
2
: (
`
X
2
, ` x
2
)→(
`
X
1
, ` x
1
) with p
1
` p
2
= p
2
. Then by the unique lifting property, ` p
1
` p
2
= 11
and ` p
2
` p
1
= 11 since these composed lifts ﬁx the basepoints. Thus ` p
1
and ` p
2
are
inverse isomorphisms. L¦
We have proved the ﬁrst half of the following classiﬁcation theorem:
Theorem 1.38. Let X be pathconnected, locally pathconnected, and semilocally
simplyconnected. Then there is a bijection between the set of isomorphism classes
of pathconnected covering spaces p: (
`
X, ` x
0
)→(X, x
0
) and the set of subgroups of
π
1
(X, x
0
), obtained by associating the subgroup p
∗
¸
π
1
(
`
X, ` x
0
)
to the covering space
(
`
X, ` x
0
). If basepoints are ignored, this correspondence gives a bijection between iso
morphismclasses of pathconnected covering spaces p:
`
X→X and conjugacy classes
of subgroups of π
1
(X, x
0
).
Section 1.3. Covering Spaces 67
Proof: It remains only to prove the last statement. We show that for a covering space
p: (
`
X, ` x
0
)→(X, x
0
), changing the basepoint ` x
0
within p
−1
(x
0
) corresponds exactly
to changing p
∗
¸
π
1
(
`
X, ` x
0
)
to a conjugate subgroup of π
1
(X, x
0
). Suppose that ` x
1
is another basepoint in p
−1
(x
0
), and let ` γ be a path from ` x
0
to ` x
1
. Then ` γ projects
to a loop γ in X representing some element g ∈ π
1
(X, x
0
). Set H
i
= p
∗
¸
π
1
(
`
X, ` x
i
)
for i = 0, 1. We have an inclusion g
−1
H
0
g ⊂ H
1
since for
`
f a loop at ` x
0
, ` γ
`
f ` γ is a
loop at ` x
1
. Similarly we have gH
1
g
−1
⊂ H
0
. Conjugating the latter relation by g
−1
gives H
1
⊂ g
−1
H
0
g, so g
−1
H
0
g = H
1
. Thus changing the basepoint from ` x
0
to ` x
1
changes H
0
to the conjugate subgroup H
1
= g
−1
H
0
g. Conversely, to change H
0
to
a conjugate subgroup H
1
= g
−1
H
0
g, choose a loop γ representing g, lift this to a
path ` γ starting at ` x
0
, and let ` x
1
= ` γ(1). The preceding argument then shows that
we have the desired relation H
1
= g
−1
H
0
g. L¦
A consequence of the lifting criterion is that a simplyconnected covering space
of a pathconnected, locally pathconnected space X is a covering space of every other
pathconnected covering space of X. Asimplyconnected covering space of X is there
fore called a universal cover. Such a covering space is unique up to isomorphism, so
one is justiﬁed in saying the universal cover.
More generally, there is a partial ordering on the collection of covering spaces
of X, according to which ones cover which others. This corresponds to the partial
ordering by inclusion of the various subgroups of π
1
(X), or conjugacy classes of
subgroups if basepoints are ignored.
Representing Covering Spaces by Permutations
We wish to describe now another way of classifying the different covering spaces
of a connected, locally pathconnected space X, without restricting just to connected
covering spaces. To give the idea, consider the 3 sheeted covering spaces of S
1
. There
are three of these,
`
X
1
,
`
X
2
, and
`
X
3
, with the subscript in
dicating the number of components. For each of these
covering spaces p:
`
X
i
→S
1
the three different lifts of a
loop in S
1
generating π
1
(S
1
, x
0
) determine a permutation of p
−1
(x
0
) sending the
starting point of the lift to the ending point of the lift. For
`
X
1
this is a cyclic per
mutation, for
`
X
2
it is a transposition of two points ﬁxing the third point, and for
`
X
3
it is the identity permutation. These permutations obviously determine the covering
spaces uniquely, up to isomorphism. The same would be true of n sheeted coverings
for arbitrary n, even for n inﬁnite.
There is a way to generalize this to covering spaces p:
`
X→X of an arbitrary
connected, locally pathconnected space X. Let γ be a path in X. Then γ can be
viewed as a homotopy of the composition p
−1
(γ(0))
`
X→X. The homotopy lift
ing property yields a homotopy from the inclusion p
−1
(γ(0))
`
X to a bijection
L
γ
: p
−1
(γ(0))→p
−1
(γ(1)). The inverse of this bijection is evidently L
γ
. For a com
68 Chapter 1. The Fundamental Group
position of paths γη we have L
γη
= L
η
L
γ
, rather than L
γ
L
η
, since composition of
paths is written from left to right while composition of functions is written from right
to left. To correct for this discrepancy let us modify the deﬁnition by replacing L
γ
with
its inverse. Thus the new L
γ
is a bijection p
−1
(γ(1))→p
−1
(γ(0)), and L
γη
= L
γ
L
η
.
Since L
γ
depends only on the homotopy class of γ, this means that if we restrict
attention to loops at a basepoint x
0
∈ X, then the association γ
L
γ
gives a homo
morphism from π
1
(X, x
0
) to the group of permutations of p
−1
(x
0
). This is called
the action of π
1
(X, x
0
) on the ﬁber p
−1
(x
0
). We shall give a general deﬁnition of an
action of a group on a space in the next subsection.
Let us see how the covering space p:
`
X→X can be reconstructed from the asso
ciated action of π
1
(X, x
0
) on the ﬁber F = p
−1
(x
0
), assuming that X is semilocally
simplyconnected, so it has a universal cover
`
X
0
→X. We can take the points of the
universal cover
`
X
0
to be homotopy classes of paths in X starting at x
0
, as in the
earlier construction of a universal cover. Deﬁne a map h:
`
X
0
×F→
`
X sending a pair
([γ], ` x
0
) to ` γ(1) where ` γ is the lift of γ to
`
X starting at ` x
0
. Then h is continu
ous, and in fact a local homeomorphism, since a neighborhood of ([γ], ` x
0
) in
`
X
0
×F
consists of the pairs ([γη], ` x
0
) with η a path in a neighborhood of γ(1) as in the con
struction of
`
X
0
. It is obvious that h is surjective since X is pathconnected. If h were
injective as well, it would be a homeomorphism, which is unlikely since
`
X
0
×F is prob
ably not homeomorphic to
`
X. But in any case, h will induce a homeomorphism from
some quotient space of
`
X
0
×F onto
`
X. To see what this quotient space is explicitly,
suppose h([γ], ` x
0
) = h([γ
¹
], ` x
¹
0
). Then γ and γ
¹
are both
paths from x
0
to the same endpoint, and from the ﬁgure
we see that ` x
¹
0
= L
γ
¹
γ
( ` x
0
). Letting λ be the loop γ
¹
γ, this
γ
γ
γ γ
x
0
γ
x
0
x
0
L ( ) −
¹
¹
γ
¹
means that h([γ], ` x
0
) = h([λγ], L
λ
( ` x
0
)). Conversely, for
any loop λ we have h([γ], ` x
0
) = h([λγ], L
λ
( ` x
0
)). Thus h
induces a welldeﬁned map to
`
X from the quotient space of
`
X
0
×F obtained by identifying ([γ], ` x
0
) with ([λγ], L
λ
( ` x
0
))
for each [λ] ∈ π
1
(X, x
0
). Let this quotient space be denoted
`
X
ρ
where ρ is the ho
momorphism from π
1
(X, x
0
) to the permutation group of F speciﬁed by the action.
Notice that the deﬁnition of
`
X
ρ
makes sense whenever we are given an action
ρ of π
1
(X, x
0
) on a set F . There is a natural projection
`
X
ρ
→X sending ([γ], ` x
0
)
to γ(1), and this is a covering space since if U ⊂ X is an open set over which the
universal cover
`
X
0
is a product U×π
1
(X, x
0
), then the identiﬁcations deﬁning
`
X
ρ
simply collapse U×π
1
(X, x
0
)×F to U×F .
Returning to our given covering space
`
X→X with associated action ρ, the map
`
X
ρ
→
`
X induced by h is a bijection and in fact a homeomorphism since h was a local
homeomorphism. Since this homeomorphism
`
X
ρ
→
`
X takes each ﬁber of
`
X
ρ
to the
corresponding ﬁber of
`
X, it is an isomorphism of covering spaces.
If two covering spaces p
1
:
`
X
1
→X and p
2
:
`
X
2
→X are isomorphic, how are the
Section 1.3. Covering Spaces 69
corresponding actions of π
1
(X, x
0
) on the ﬁbers F
1
and F
2
over x
0
related? An
isomorphism h:
`
X
1
→
`
X
2
restricts to a bijection F
1
→F
2
, and evidently L
γ
(h( ` x
0
)) =
h(L
γ
( ` x
0
)). Using the less cumbersome notation ` x
0
γ ` x
0
for ` x
0
L
γ
( ` x
0
), this
relation can be written more concisely as γh( ` x
0
) = h(γ ` x
0
). A bijection F
1
→F
2
with
this property is what one would naturally call an isomorphism of sets with π
1
(X, x
0
)
action. Thus isomorphic covering spaces have isomorphic actions on ﬁbers. The
converse is also true, and easy to prove. One just observes that for isomorphic actions
ρ
1
and ρ
2
, an isomorphism h: F
1
→F
2
induces a map
`
X
ρ
1
→
`
X
ρ
2
, and h
−1
induces a
similar map in the opposite direction, such that the compositions of these two maps,
in either order, are the identity.
Thus n sheeted covering spaces of X are classiﬁed by equivalence classes of
homomorphisms π
1
(X, x
0
)→Σ
n
, where Σ
n
is the symmetric group on n symbols
and the equivalence relation identiﬁes a homomorphism ρ with each of its conjugates
h
−1
ρh by elements h ∈ Σ
n
.
Deck Transformations and Group Actions
For a covering space p:
`
X→X the isomorphisms
`
X→
`
X are called deck transfor
mations or covering transformations. These form a group G(
`
X) under composition.
For example, for the covering space p: R→S
1
projecting a vertical helix onto a circle,
the deck transformations are the vertical translations taking the helix onto itself, so
G(
`
X) ≈ Z in this case. For the n sheeted covering space S
1
→S
1
, z
z
n
, the deck
transformations are the rotations of S
1
through an angle which is a multiple of 2π/n,
so G(
`
X) = Z
n
.
By the unique lifting property, a deck transformation is completely determined
by where it sends a single point, assuming
`
X is pathconnected. In particular only the
identity deck transformation can ﬁx a point of
`
X.
A normal covering space p:
`
X→X is one for which G(
`
X) acts transitively on
p
−1
(x) for all x ∈ X, i.e., for any two lifts ` x, ` x
¹
of x there is a deck transformation
taking ` x to ` x
¹
. For example, the covering spaces R→S
1
and S
1
→S
1
whose deck
transformations we just described are normal. Intuitively, a normal covering space
is one with ‘maximal symmetry.’ This can be seen in the coverings of S
1
∨S
1
shown
in the table earlier in this section, where the normal coverings are numbers (1), (2),
(5)(8), and (11). Note that in (7) the group of deck transformations is Z
4
while in (8)
it is Z
2
×Z
2
.
Sometimes normal covering spaces are called regular covering spaces. The term
‘normal’ is motivated by the following result.
70 Chapter 1. The Fundamental Group
Proposition 1.39. Let p: (
`
X, ` x
0
)→(X, x
0
) be a pathconnected covering space of
the pathconnected, locally pathconnected space X, and let H = p
∗
¸
π
1
(
`
X, ` x
0
)
⊂
π
1
(X, x
0
). Then:
(a) This covering space is normal iff H is a normal subgroup of π
1
(X, x
0
).
(b) G(
`
X) is isomorphic to the quotient N(H)/H where N(H) is the normalizer of
H in π
1
(X, x
0
).
In particular, G(
`
X) is isomorphic to π
1
(X, x
0
)/H if
`
X is a normal covering. Hence
for the universal cover
`
X→X we have G(
`
X) ≈ π
1
(X).
Proof: We observed earlier in the proof of the classiﬁcation theorem that changing
the basepoint ` x
0
∈ p
−1
(x
0
) to ` x
1
∈ p
−1
(x
0
) corresponds precisely to conjugating
H by an element [γ] ∈ π
1
(X, x
0
) where γ lifts to a path ` γ from ` x
0
to ` x
1
. Thus [γ]
is in the normalizer N(H) iff p
∗
¸
π
1
(
`
X, ` x
0
)
= p
∗
¸
π
1
(
`
X, ` x
1
)
, which by the lifting
criterion is equivalent to the existence of a deck transformation taking ` x
0
to ` x
1
.
Hence the covering space is normal iff N(H) = π
1
(X, x
0
), i.e., H is a normal subgroup
of π
1
(X, x
0
).
Deﬁne ϕ: N(H)→G(
`
X) sending [γ] to the deck transformation τ taking ` x
0
to
` x
1
, in the notation above. Then ϕ is a homomorphism, for if γ
¹
is another loop corre
sponding to the deck transformation τ
¹
taking ` x
0
to ` x
¹
1
then γ γ
¹
lifts to ` γ (τ(` γ
¹
)),
a path from ` x
0
to τ( ` x
¹
1
) = ττ
¹
( ` x
0
), so ττ
¹
is the deck transformation corresponding
to [γ][γ
¹
]. By the preceding paragraph ϕ is surjective. Its kernel consists of classes
[γ] lifting to loops in
`
X. These are exactly the elements of p
∗
¸
π
1
(
`
X, ` x
0
)
= H. L¦
The group of deck transformations is a special case of the general notion of
‘groups acting on spaces.’ Given a group G and a space Y , then an action of G on
Y is a homomorphism ρ from G to the group Homeo(Y) of homeomorphisms of Y .
Thus to each g ∈ G is associated a homeomorphism ρ(g) : Y→Y , which for nota
tional simplicity we write simply as g : Y→Y . For ρ to be a homomorphism amounts
to requiring that g
1
(g
2
(y)) = (g
1
g
2
)(y) for all g
1
, g
2
∈ G and y ∈ Y . If ρ is in
jective then it identiﬁes G with a subgroup of Homeo(Y), and in practice not much
is lost in assuming ρ is an inclusion G
Homeo(Y) since in any case the subgroup
ρ(G) ⊂ Homeo(Y) contains all the topological information about the action.
We shall be interested in actions satisfying the following condition:
(∗)
Each point y ∈ Y has a neighborhood U such that all the images g(U) for
varying g ∈ G are disjoint, i.e., g
1
(U) ∩g
2
(U) ≠ ∅ implies g
1
= g
2
.
For deck transformations, one can see the action of G(
`
X) on
`
X satisﬁes (∗) as fol
lows. Suppose
`
U ⊂
`
X projects homeomorphically to U ⊂ X. If g
1
(
`
U) ∩ g
2
(
`
U) ≠ ∅
for g
1
, g
2
∈ G(
`
X), then we have g
1
( ` x
1
) = g
2
( ` x
2
) for points ` x
1
, ` x
2
∈
`
U. Since ` x
1
and
` x
2
must lie in the same set p
−1
(x), which intersects
`
U in only one point, we must
have ` x
1
= ` x
2
, and g
−1
1
g
2
ﬁxes this point so g
−1
1
g
2
= 11 and g
1
= g
2
.
Section 1.3. Covering Spaces 71
Note that in (∗) it sufﬁces to take g
1
to be the identity since g
1
(U) ∩g
2
(U) ≠ ∅
is equivalent to U ∩ g
−1
1
g
2
(U) ≠ ∅. Thus we have the equivalent condition that
U ∩g(U) ≠ ∅ only for g the identity.
Given an action of a group G on a space Y , we can forma space Y/G, the quotient
space of Y in which each point y is identiﬁed with all its images g(y) as g ranges
over G. The points of Y/G are thus the orbits Gy = ¦ g(y) ¦ g ∈ G¦ ⊂ Y , and
Y/G is called the orbit space of the action. For example, for a normal covering space
`
X→X, the orbit space
`
X/G(
`
X) is just X.
Proposition 1.40. Suppose we are given an action of a group G on a space Y satis
fying the condition (∗). Then:
(a) The quotient map p: Y→Y/G, p(y) = Gy, is a normal covering space.
(b) G is the group of deck transformations of this covering space Y→Y/G if Y is
pathconnected.
(c) G is isomorphic to π
1
(Y/G)/p
∗
¸
π
1
(Y)
if Y is pathconnected and locally path
connected.
Proof: Given an open set U ⊂ Y as in condition (∗), the quotient map p simply
identiﬁes all the disjoint homeomorphic sets ¦ g(U) ¦ g ∈ G¦ to a single open set
p(U) in Y/G. By the deﬁnition of the quotient topology on Y/G, p restricts to a
homeomorphism g(U) ≈ p(U) for each g ∈ G so we have a covering space. Each
element of G acts as a deck transformation, and the action is transitive by the deﬁ
inition of Y/G, so the covering space is normal. The group of deck transformations
contains G as a subgroup, and equals this subgroup if Y is pathconnected, since if
f is any deck transformation, then for any point y ∈ Y , p(y) = pf(y) so y and
f(y) are in the same orbit and there is a g ∈ G with g(y) = f(y), hence f = g since
deck transformations of a pathconnected covering space are uniquely determined by
where they send a point. The ﬁnal statement of the proposition is immediate from
part (b) of Proposition 1.39. L¦
In view of the preceding proposition, we shall call an action satisfying (∗) a
covering space action. This is not standard terminology, but there does not seem to
be a universally accepted name for actions satisfying (∗). Sometimes these are called
‘properly discontinuous’ actions, but more often this rather unattractive term means
something weaker: Every point x ∈ X has a neighborhood U such that U ∩ g(U)
is nonempty for only ﬁnitely many g ∈ G. Many symmetry groups have this proper
discontinuity property without satisfying (∗), for example the group of symmetries
of the familiar tiling of R
2
by regular hexagons. The reason why the action of this
group on R
2
fails to satisfy (∗) is that there are ﬁxed points: points y for which
there is a nontrivial element g ∈ G with g(y) = y. For example, the vertices of the
hexagons are ﬁxed by the 120 degree rotations about these points, and the midpoints
of edges are ﬁxed by 180 degree rotations. An action without ﬁxed points is called
72 Chapter 1. The Fundamental Group
a free action. Thus for a free action of G on Y , only the identity element of G ﬁxes
any point of Y . This is equivalent to requiring that all the images g(y) of each
y ∈ Y are distinct, i.e., g
1
(y) = g
2
(y) implies g
1
= g
2
, since g
1
(y) = g
2
(y) is
equivalent to g
−1
1
g
2
(y) = y. Though condition (∗) implies freeness, the converse is
not always true. An example is the action of Z on S
1
in which a generator of Z acts by
rotation through an angle α which is an irrational multiple of 2π. In this case each
orbit Zy is dense in S
1
, so condition (∗) cannot hold since it implies that orbits are
discrete subspaces. An exercise at the end of the section is to show that for actions
on Hausdorff spaces, freeness plus proper discontinuity implies condition (∗). Note
that proper discontinuity is automatic for actions by a ﬁnite group.
Example 1.41. Let Y be the closed orientable surface of genus 11, an ‘ 11 hole torus’
as shown in the ﬁgure. This has a 5 fold rotational symmetry,
generated by a rotation of angle 2π/5. Thus we have the
cyclic group Z
5
acting on Y , and the condition (∗) is ob
viously satisﬁed. The quotient space Y/Z
5
is a surface
C
2
C
1
C
3
C
4
C
5
C
p
of genus 3, obtained from one of the ﬁve subsurfaces
of Y cut off by the circles C
1
, ··· , C
5
by identifying its
two boundary circles C
i
and C
i+1
to form the circle C as
shown. Thus we have a covering space M
11
→M
3
where
M
g
denotes the closed orientable surface of genus g. In
particular, we see that π
1
(M
3
) contains the ‘larger’ group
π
1
(M
11
) as a normal subgroup of index 5, with quotient
Z
5
. This example obviously generalizes by replacing the two
holes in each ‘arm’ of M
11
by m holes and the 5 fold symmetry by n fold symmetry.
This gives a covering space M
mn+1
→M
m+1
. An exercise in §2.2 is to showby an Euler
characteristic argument that if there is a covering space M
g
→M
h
then g = mn + 1
and h = m+1 for some m and n.
As a special case of the ﬁnal statement of the preceding proposition we see that
for a covering space action of a group G on a simplyconnected locally pathconnected
space Y , the orbit space Y/G has fundamental group isomorphic to G. Under this
isomorphism an element g ∈ G corresponds to a loop in Y/G which is the projec
tion of a path in Y from a chosen basepoint y
0
to g(y
0
). Any two such paths are
homotopic since Y is simplyconnected, so we get a welldeﬁned element of π
1
(Y/G)
associated to g.
This method for computing fundamental groups via group actions on simply
connected spaces is essentially how we computed π
1
(S
1
) in §1.1, via the covering
space R→S
1
arising fromthe action of Z on R by translations. This is a useful general
technique for computing fundamental groups, in fact. Here are some examples.
Section 1.3. Covering Spaces 73
Example 1.42. Two covering space actions on R
2
are given by the groups of symmetries of the pat
terns shown in the ﬁgure, square grids decorated
with arrows that rule out rotational and reﬂectional
symmetries. The only difference between the two
cases is that in the second case the horizontal arrows in adjacent lines point in op
position directions. For the ﬁrst grid the symmetry group G is isomorphic to Z×Z
since it consists of all translations (x, y)
(x +m, y +n) for m, n ∈ Z, assuming
the vertices of the grid are the points (x, y) ∈ Z
2
. For the second grid, G contains
a subgroup of translations of the form (x, y)
(x +m, y +2n) for m, n ∈ Z, but
there are also ‘glidereﬂection’ symmetries, consisting of vertical translation by an
odd integer distance followed by reﬂection across a vertical line, either a vertical line
of the grid or a vertical line halfway between two adjacent grid lines. For both grid
patterns there are elements of G taking any square to any other, but only the identity
element of G takes a square to itself. The minimum distance any point is moved by a
nontrivial element of G is 1, which easily implies the covering space condition (∗).
The orbit space R
2
/G is the quotient space of a square in the grid with opposite edges
identiﬁed according to the arrows. Thus we see that the fundamental groups of the
torus and the Klein bottle are the symmetry groups G in the two cases. In the second
case the subgroup of G formed by the translations has index two, and the orbit space
for this subgroup is a torus forming a twosheeted covering space of the Klein bottle.
Example 1.43: RP
n
. The antipodal map of S
n
, x
−x, generates an action of Z
2
on S
n
with orbit space RP
n
, real projective n space, as deﬁned in Example 0.4. The
action is a covering space action since each open hemisphere in S
n
is disjoint from
its antipodal image. As we saw in Proposition 1.14, S
n
is simplyconnected if n ≥ 2,
so from the covering space S
n
→RP
n
we deduce that π
1
(RP
n
) ≈ Z
2
for n ≥ 2. A
generator for π
1
(RP
n
) is any loop obtained by projecting a path in S
n
connecting two
antipodal points. One can see explicitly that such a loop γ has order two in π
1
(RP
n
)
if n ≥ 2 since the composition γ γ lifts to a loop in S
n
, and this can be homotoped to
the trivial loop since π
1
(S
n
) = 0, so the projection of this homotopy into RP
n
gives
a nullhomotopy of γ γ.
Which other ﬁnite groups act freely on S
n
, deﬁning covering spaces S
n
→S
n
/G?
We will show in Proposition 2.29 that Z
2
is the only possibility when n is even, but
for odd n the question is much more difﬁcult. It is easy to construct a free action
of any cyclic group Z
m
on S
2k−1
, generated by the rotation v
e
2πi/m
v of the unit
sphere S
2k−1
in C
k
= R
2k
. The action is free since an equation v = e
2πi/m
v with
0 < < m implies v = 0, but 0 is not a point of S
2k−1
. The orbit space S
2k−1
/Z
m
is
one of a family of lens spaces deﬁned in Example 2.43.
There are also noncyclic ﬁnite groups which act freely as rotations of S
n
for
74 Chapter 1. The Fundamental Group
odd n > 1. These actions are classiﬁed quite explicitly in [Wolf]. Examples in the
simplest case n = 3 can be produced as follows. View R
4
as the quaternion algebra
H. Multiplication of quaternions satisﬁes ¦ab¦ = ¦a¦¦b¦ where ¦a¦ denotes the usual
Euclidean length of a vector a ∈ R
4
. Thus if a and b are unit vectors, so is ab,
so quaternion multiplication deﬁnes a map S
3
×S
3
→S
3
. This in fact makes S
3
into
a group, though associativity is all we need now since associativity implies that any
subgroup G of S
3
acts on S
3
by leftmultiplication, g(x) = gx. This action is free
since an equation x = gx in the division algebra H implies g = 1 or x = 0. As a
concrete example, G could be the familiar quaternion group Q
8
= ¦:1, :i, :j, :k¦
from group theory. More generally, for a positive integer m, let Q
4m
be the subgroup
of S
3
generated by the two quaternions a = e
πi/m
∈ C ⊂ H and b = j . Thus a
has order 2m and b has order 4. The easilyveriﬁed relations a
m
= b
2
= −1 and
bab
−1
= a
−1
imply that the subgroup Z
2m
generated by a is normal and of index
2 in Q
4m
. Hence Q
4m
is a group of order 4m, called the generalized quaternion
group. Another common name for this group is the binary dihedral group D
∗
4m
since
its quotient by the subgroup ¦:1¦ is the ordinary dihedral group D
2m
of order 2m.
Besides the groups Q
4m
= D
∗
4m
there are just three other noncyclic ﬁnite sub
groups of S
3
: the binary tetrahedral, octahedral, and icosahedral groups T
∗
24
, O
∗
48
,
and I
∗
120
, of orders indicated by the subscripts. These project twotoone onto the
groups of rotational symmetries of a regular tetrahedron, octahedron (or cube), and
icosahedron (or dodecahedron). In fact, it is not hard to see that the homomorphism
S
3
→SO(3) sending u ∈ S
3
⊂ H to the isometry v→u
−1
vu of R
3
, viewing R
3
as the
‘pure imaginary’ quaternions v = ai +bj +ck, is surjective with kernel ¦:1¦. Then
the groups D
∗
4m
, T
∗
24
, O
∗
48
, I
∗
120
are the preimages in S
3
of the groups of rotational
symmetries of a regular polygon or polyhedron in R
3
.
There are two conditions which a ﬁnite group G acting freely on S
n
must satisfy:
(a) Every abelian subgroup of G is cyclic. Equivalently, G contains no subgroup
Z
p
×Z
p
with p prime.
(b) G contains at most one element of order 2.
Statement (a) is an exercise for §4.1, and for a proof of (b) the original source [Milnor57]
is recommended reading. The groups satisfying (a) have been completely classiﬁed,
as explained for example in [K.Brown, section VI.9]. An example of a group satisfying
(a) but not (b) is the dihedral group D
2m
for odd m > 1.
There is also a much more difﬁcult converse: A ﬁnite group satisfying (a) and (b)
acts freely on S
n
for some n. See [MadsenThomasWall] or [DavisMilgram]. There
is also almost complete information about which n’s are possible for a given group.
Example 1.44. In Example 1.35 we constructed a contractible 2 complex
`
X
m,n
=
T
m,n
×R as the universal cover of a ﬁnite 2 complex X
m,n
. The group of deck transfor
mations of this covering space is therefore the fundamental group π
1
(X
m,n
). Apply
Section 1.3. Covering Spaces 75
ing van Kampen’s theoremto the decomposition of X
m,n
into the mapping cylinders of
the maps S
1
→S
1
, z
z
m
and z
z
n
, we obtain the presentation ¹ a, b ¦ a
m
b
−n
)
for this group G
m,n
. It is interesting to look at the action of G
m,n
on
`
X
m,n
more
closely. We described a decomposition of
`
X
m,n
into rectangles, with X
m,n
the quo
tient of one rectangle. These rectangles in fact deﬁne a cell structure on
`
X
m,n
lifting
a cell structure on X
m,n
with two vertices, three edges, and one 2 cell. The group
G
m,n
is thus a group of symmetries of this cell structure on
`
X
m,n
. If we orient the
three edges of X
m,n
and lift these orientations to the edges of
`
X
m,n
, then G
m,n
is
the group of all symmetries of
`
X
m,n
preserving the orientations of edges. For exam
ple, the element a acts as a ‘screw motion,’ restricting to translation of a vertical line
¦v
a
¦×R with v
a
a vertex of T
m,n
, and b acts similarly for a vertex v
b
.
Since the action of G
m,n
on
`
X
m,n
preserves the cell structure, it also preserves
the product structure T
m,n
×R. This means that there are actions of G
m,n
on T
m,n
and R such that the action on the product X
m,n
= T
m,n
×R is the diagonal action
g(x, y) =
¸
g(x), g(y)
for g ∈ G
m,n
. If we make the rectangles of unit height in
the R coordinate, then the element a
m
= b
n
acts on R as unit translation, while a
acts by
1
/
m
translation, and b by
1
/
n
translation. The translation actions of a and b
on R generate an inﬁnite cylic group of translations generated by translation by the
reciprocal of the least common multiple of m and n.
The action of G
m,n
on T
m,n
has kernel consisting of the powers of the element
a
m
= b
n
. This inﬁnite cyclic subgroup is precisely the center of G
m,n
as we saw in
Example 1.24. There is an induced action of the quotient group Z
m
∗ Z
n
on T
m,n
,
but this is not a free action since the elements a and b and all their conjugates ﬁx
vertices of T
m,n
. On the other hand, if we restrict the action of G
m,n
on T
m,n
to
the kernel K of the map G
m,n
→Z given by the action of G
m,n
on the R factor of
X
m,n
, then we do obtain a free action of K on T
m,n
. Since this action takes vertices
to vertices and edges to edges, it is a covering space action, so K is a free group, the
fundamental group of the graph T
m,n
/K. An exercise at the end of the section is to
determine T
m,n
/K explicitly and compute the number of generators of K.
Cayley Complexes.
There is a very classical method for viewing groups geometrically as graphs, which
ﬁts very nicely into covering space theory. Recall from Corollary 1.28 how we asso
ciated to each group presentation G = ¹ g
α
¦ r
β
) a 2 dimensional cell complex X
G
with π
1
(X
G
) ≈ G by taking a wedgesum of circles, one for each generator g
α
, and
then attaching a 2 cell for each relator r
β
. We can construct a cell complex
`
X
G
with a
covering space action of G such that
`
X
G
/G = X
G
in the following way. Let the vertices
of
`
X
G
be the elements of G themselves. Then, at each vertex g ∈ G, insert an edge
joining g to gg
α
for each of the chosen generators g
α
. The resulting graph is known
as the Cayley graph of G with respect to the generators g
α
. This graph is connected
since every element of G is a product of g
α
’s, so there is a path in the graph joining
76 Chapter 1. The Fundamental Group
each vertex to the identity vertex e. Each relation r
β
determines a loop in the graph,
starting at any vertex g, and we attach a 2 cell for each such loop. The resulting cell
complex
`
X
G
is the Cayley complex of G. The group G acts on
`
X
G
by multiplication
on the left. Thus, an element g ∈ G sends a vertex g
¹
∈ G to the vertex gg
¹
, and the
edge from g
¹
to g
¹
g
α
is sent to the edge from gg
¹
to gg
¹
g
α
. The action extends to
2 cells in the obvious way. This is clearly a covering space action, and the orbit space
is just X
G
.
In fact
`
X
G
is the universal cover of X
G
since it is simplyconnected. This can be
seen by considering the homomorphism ϕ: π
1
(X
G
)→G deﬁned in the proof of Propo
sition 1.39. For an edge e
α
in X
G
corresponding to a generator g
α
of G, it is clear
from the deﬁnition of ϕ that ϕ([e
α
]) = g
α
, so ϕ is an isomorphism. In particular
the kernel of ϕ, p
∗
¸
π
1
(
`
X
G
)
, is zero, hence also π
1
(
`
X
G
) since p
∗
is injective.
Here are some examples.
Example 1.45. When G is the free group on
two generators a and b, X
G
is S
1
∨ S
1
and
`
X
G
is the Cayley graph of Z∗Z pictured at the
right. The action of a on this graph is a right
ward shift along the central horizontal axis,
while b acts by an upward shift along the cen
tral vertical axis. The composition ab of these
two shifts then takes the vertex e to the ver
tex ab. Similarly, the action of any w ∈ Z ∗Z
takes e to the vertex w.
e
a
ab
ab
ba
ba
b
a
b
b
b
1
a
1
a
1
a
2
1
a
1
1
b
2
1
b
1
b
1
a b
1
a
2
2
Example 1.46. The group G = Z×Z with presentation ¹ x, y ¦ xyx
−1
y
−1
) has
X
G
= S
1
×S
1
, and
`
X
G
is R
2
with vertices the integer lattice Z
2
⊂ R
2
and edges the
horizontal and vertical segments between these lattice points. The action of G is by
translations (x, y)
(x +m, y +n).
Example 1.47. For G = Z
2
= ¹ x ¦ x
2
), X
G
is RP
2
and
`
X
G
= S
2
. More generally, for
Z
n
= ¹ x ¦ x
n
), X
G
is S
1
with a disk attached by the map z
z
n
and
`
X
G
consists of
n disks D
1
, ··· , D
n
with their boundary circles identiﬁed. A generator of Z
n
acts on
this union of disks by sending D
i
to D
i+1
via a 2π/n rotation, the subscript i being
taken mod n. The common boundary circle of the disks is rotated by 2π/n.
Example 1.48. If G = Z
2
∗Z
2
= ¹ a, b ¦ a
2
, b
2
) then the Cayley graph is a union of an
inﬁnite sequence of circles each tangent to its two neighbors.
e a
a
a a
a
a
a
ab aba b
b
b b
b
b
b
ba bab
Section 1.3. Covering Spaces 77
We obtain
`
X
G
from this graph by making each circle the equator of a 2 sphere, yield
ing an inﬁnite sequence of tangent 2 spheres. Elements of the indextwo normal
subgroup Z ⊂ Z
2
∗Z
2
generated by ab act on
`
X
G
as translations by an even number
of units, while each of the remaining elements of Z
2
∗Z
2
acts as the antipodal map on
one of the spheres and ﬂips the whole chain of spheres endforend about this sphere.
The orbit space X
G
is RP
2
∨RP
2
.
It is not hard to see the generalization of this example to Z
m
∗Z
n
with the pre
sentation ¹ a, b ¦ a
m
, b
n
), so that
`
X
G
consists of an inﬁnite union of copies of the
Cayley complexes for Z
m
and Z
n
constructed in Example 1.47, arranged in a treelike
pattern. The case of Z
2
∗Z
3
is pictured below.
a
a
a
a
a
a
a
a
a
a
a
ab
ab
b
b
b
b
b
b
b
ba
b
e
2
2
Exercises
1. For a covering space p:
`
X→X and a subspace A ⊂ X, let
`
A = p
−1
(A). Show that
the restriction p:
`
A→A is a covering space.
2. Show that if p
1
:
`
X
1
→X
1
and p
2
:
`
X
2
→X
2
are covering spaces, so is their product
p
1
×p
2
:
`
X
1
×
`
X
2
→X
1
×X
2
.
3. Let p:
`
X→X be a covering space with p
−1
(x) ﬁnite for all x ∈ X. Show that
`
X is
compact Hausdorff iff X is compact Hausdorff.
4. Construct a simplyconnected covering space of the space X ⊂ R
3
which is the
union of a sphere and a diameter. Do the same when X is the union of a sphere and
a circle intersecting it in two points.
5. Let X be the subspace of R
2
consisting of the four sides of the square [0, 1]×[0, 1]
together with the segments of the vertical lines x =
1
/
2
,
1
/
3
,
1
/
4
, ··· inside the square.
Showthat for every covering space
`
X→X there is some neighborhood of the left edge
78 Chapter 1. The Fundamental Group
of X which lifts homeomorphically to
`
X. Deduce that X has no simplyconnected
covering space.
6. Let X be the shrinking wedge of circles in Example 1.25, and let
`
X be its cover
ing space shown in the ﬁgure below. Construct a twosheeted covering space Y→
`
X
such that the composition Y→
`
X→X of the two covering spaces is not a cover
ing space. Note that a compo
sition of two covering spaces
does have the unique path lift
ing property, however.
7. Let Y be the ‘quasicircle’ shown in the ﬁgure, a closed subspace of R
2
consisting
of a portion of the graph of y = sin(1/x), the segment [−1, 1] in the y axis, and an
arc connecting these two pieces. Collapsing the segment of Y in
the y axis to a point gives a quotient map f : Y→S
1
. Show that f
does not lift to the covering space R→S
1
, even though π
1
(Y) = 0.
Thus local pathconnectedness of Y is a necessary hypothesis in
the lifting criterion.
8. Let
`
X and
`
Y be simplyconnected covering spaces of the pathconnected, locally
pathconnected spaces X and Y . Show that if X = Y then
`
X =
`
Y . [Hint: See exercise
10 in Chapter 0.]
9. Show that if a pathconnected, locally pathconnected space X has π
1
(X) ﬁnite,
then every map X→S
1
is nullhomotopic. [Use the covering space R→S
1
.]
10. Find all the connected 2 sheeted and 3 sheeted covering spaces of S
1
∨S
1
, up to
isomorphism of covering spaces without basepoints.
11. Construct ﬁnite graphs X
1
and X
2
having a common ﬁnitesheeted covering space
`
X
1
=
`
X
2
, but such that there is no space having both X
1
and X
2
as covering spaces.
12. Let a and b be the generators of π
1
(S
1
∨ S
1
) corresponding to the two S
1
summands. Draw a picture of the covering space of S
1
∨ S
1
corresponding to the
normal subgroup generated by a
2
, b
2
, and (ab)
4
, and prove that this covering space
is indeed the correct one.
13. Determine the covering space of S
1
∨ S
1
corresponding to the subgroup of
π
1
(S
1
∨S
1
) generated by the cubes of all elements. [The covering space is 27 sheeted
and can be drawn on a torus so that the complementary regions are 9 triangles with
edges labelled aaa, 9 triangles with edges labelled bbb, and 9 hexagons with edges
labelled ababab. If the problem were modiﬁed by replacing ‘cubes’ with ‘sixth pow
ers,’ the resulting covering space would have 2
28
3
25
sheets! And for k
th
powers with
k sufﬁciently large, the covering space would have inﬁnitely many sheets. The under
lying group theory question here, whether the quotient of Z∗Z obtained by factoring
out all k
th
powers is ﬁnite, is known as Burnside’s problem. It can also be asked for
a free group on n generators.]
Section 1.3. Covering Spaces 79
14. Find all the connected covering spaces of RP
2
∨RP
2
.
15. Let p:
`
X→X be a simplyconnected covering space of X and let A ⊂ X be a
pathconnected, locally pathconnected subspace, with
`
A ⊂
`
X a pathcomponent of
p
−1
(A). Show that p:
`
A→A is the covering space corresponding to the kernel of the
map π
1
(A)→π
1
(X).
16. Given maps X→Y→Z such that both Y→Z and the composition X→Z are
covering spaces, show that X→Y is a covering space if Z is locally pathconnected,
and show that this covering space is normal if X→Z is a normal covering space.
17. Given a group G and a normal subgroup N, show that there exists a normal
covering space
`
X→X with π
1
(X) ≈ G, π
1
(
`
X) ≈ N, and deck transformation group
G(
`
X) ≈ G/N.
18. For a pathconnected, locally pathconnected, and semilocally simplyconnected
space X, call a pathconnected covering space
`
X→X abelian if it is normal and has
abelian deck transformation group. Show that X has an abelian covering space which
is a covering space of every other abelian covering space of X, and that such a ‘uni
versal’ abelian covering space is unique up to isomorphism. Describe this covering
space explicitly for X = S
1
∨S
1
and X = S
1
∨S
1
∨S
1
.
19. Use the preceding problem to show that a closed orientable surface M
g
of genus
g has a connected normal covering space with group of deck transformations Z
n
(the
product of n copies of Z) iff n ≤ 2g. For g ≥ 3 and n = 3 describe such a covering
space explicitly as a subspace of R
3
with translations of R
3
as deck transformations.
Show that such a covering space in R
3
exists iff there is an embedding of M
g
in the
3 torus T
3
= S
1
×S
1
×S
1
such that the induced map π
1
(M
g
)→π
1
(T
3
) is surjective.
20. Construct nonnormal covering spaces of the Klein bottle by a Klein bottle and by
a torus.
21. Let X be the space obtained from a torus S
1
×S
1
by attaching a M¨obius band via a
homeomorphism from the boundary circle of the M¨obius band to the circle S
1
×¦x
0
¦
in the torus. Compute π
1
(X), describe the universal cover of X, and describe the
action of π
1
(X) on the universal cover. Do the same for the space Y obtained by
attaching a M¨obius band to RP
2
via a homeomorphismof its boundary circle to RP
1
⊂
RP
2
.
22. Given covering space actions of groups G
1
on X
1
and G
2
on X
2
, show that the ac
tion of G
1
×G
2
on X
1
×X
2
deﬁned by (g
1
, g
2
)(x
1
, x
2
) = (g
1
(x
1
), g
2
(x
2
)) is a covering
space action, and that (X
1
×X
2
)/(G
1
×G
2
) is homeomorphic to X
1
/G
1
×X
2
/G
2
.
23. Show that if a group G acts freely and properly discontinuously on a Hausdorff
space X, then the action is a covering space action. (Here ‘properly discontinuously’
means each x ∈ X has a neighborhood U such that ¦ g ∈ G ¦ U ∩ g(U) ≠ ∅¦ is
ﬁnite.) In particular, a free action of a ﬁnite group on a Hausdorff space is a covering
space action.
80 Chapter 1. The Fundamental Group
24. Given a covering space action of a group G on a pathconnected, locally path
connected space X, then each subgroup H ⊂ G determines a composition of covering
spaces X→X/H→X/G. Show:
(a) Every pathconnected covering space between X and X/G is isomorphic to X/H
for some subgroup H ⊂ G.
(b) Two such covering spaces X/H
1
and X/H
2
of X/G are isomorphic iff H
1
and
H
2
are conjugate subgroups of G.
(c) The covering space X/H→X/G is normal iff H is a normal subgroup of G, in
which case the group of deck transformations of this cover is G/H.
25. Let ϕ: R
2
→R
2
be the linear transformation ϕ(x, y) = (2x, y/2). This generates
an action of Z on X = R
2
− ¦0¦. Show this action is a covering space action and
compute π
1
(X/Z). Show the orbit space X/Z is nonHausdorff, and describe how it
is a union of subspaces homeomorphic to S
1
×R, coming from the complementary
components of the x and y axes.
26. For a covering space p:
`
X→X with X connected, locally pathconnected, and
semilocally simplyconnected, show:
(a) The components of
`
X are in onetoone correspondence with the orbits of the
action of π
1
(X, x
0
) on the ﬁber p
−1
(x
0
).
(b) Under the Galois correspondence between connected covering spaces of X and
subgroups of π
1
(X, x
0
), the subgroup corresponding to the component of
`
X
containing a given lift ` x
0
of x
0
is the stabilizer of ` x
0
, the subgroup consisting
of elements whose action on the ﬁber leaves ` x
0
ﬁxed.
27. For a universal cover p:
`
X→X we have two actions of π
1
(X, x
0
) on the ﬁber
p
−1
(x
0
), namely the action given by lifting loops at x
0
and the action given by re
stricting deck transformations to the ﬁber. Are these two actions the same when
X = S
1
∨S
1
or X = S
1
×S
1
? Do the actions always agree when π
1
(X, x
0
) is abelian?
28. Generalize the proof of Theorem 1.7 to show that for a covering space action of a
group G on a simplyconnected space Y , π
1
(Y/G) is isomorphic to G. [If Y is locally
pathconnected, this is a special case of part (b) of Proposition 1.40.]
29. Let Y be pathconnected, locally pathconnected, and simplyconnected, and let
G
1
and G
2
be subgroups of Homeo(Y) deﬁning covering space actions on Y . Show
that the orbit spaces Y/G
1
and Y/G
2
are homeomorphic iff G
1
and G
2
are conjugate
subgroups of Homeo(Y).
30. Draw the Cayley graph of the group Z ∗Z
2
= ¹ a, b ¦ b
2
).
31. Show that the normal covering spaces of S
1
∨S
1
are precisely the graphs which
are Cayley graphs of groups with two generators. More generally, the normal cov
ering spaces of the wedge sum of n circles are the Cayley graphs of groups with n
generators.
Section 1.A. Graphs and Free Groups 81
32. Consider covering spaces p:
`
X→X with
`
X and X connected CW complexes,
the cells of
`
X projecting homeomorphically onto cells of X. Restricting p to the
1 skeleton then gives a covering space
`
X
1
→X
1
over the 1 skeleton of X. Show:
(a) Two such covering spaces
`
X
1
→X and
`
X
2
→X are isomorphic iff the restrictions
`
X
1
1
→X
1
and
`
X
1
2
→X
1
are isomorphic.
(b)
`
X→X is a normal covering space iff
`
X
1
→X
1
is normal.
(c) The groups of deck transformations of the coverings
`
X→X and
`
X
1
→X
1
are
isomorphic, via the restriction map.
33. In Example 1.44 let d be the greatest common divisor of m and n, and write m=
dm
¹
and n = dn
¹
. Show that the graph T
m,n
/K consists of m
¹
vertices labelled a,
n
¹
vertices labelled b, together with d edges joining each a vertex to each b vertex.
Deduce that the subgroup K ⊂ G
m,n
is free on m
¹
n
¹
−m
¹
−n
¹
+1 generators.
Since all groups can be realized as fundamental groups of spaces, this opens the
way for using topology to study algebraic properties of groups. The topics in this
section and the next give some illustrations of this principle, mainly using covering
space theory.
We remind the reader that the ‘Additional Topics’ which form the remainder of
this chapter are not an essential part of the basic core of the book. Readers who are
eager to move on to new topics in later chapters should feel free to skip ahead.
By deﬁnition, a graph is a 1 dimensional CW complex, in other words, a space X
obtained from a discrete set X
0
by attaching a collection of 1 cells e
α
. Thus X is a
quotient space of the disjoint union X
0
¸
α
I
α
, where I
α
is a copy of the interval I ,
obtained by identifying the two endpoints of each I
α
with points of X
0
. The points
of X
0
are the vertices and the 1 cells the edges of X. Note that with this deﬁnition
an edge is an open subset of X, not containing its endpoints. The two endpoints of
an edge can be the same vertex, so the closure e
α
of an edge e
α
is homeomorphic
either to I or to S
1
.
Since X has the quotient topology from X
0
¸
α
I
α
, a subset of X is open (or closed)
iff it intersects the closure e
α
of each edge e
α
in an open (or closed) set in e
α
. One
says X has the weak topology with respect to the subspaces e
α
. In this topology
82 Chapter 1. The Fundamental Group
a sequence of points in the interiors of distinct edges forms a closed subset, hence
never converges. This is true in particular if the edges containing the sequence all
have a common vertex and one tries to choose the sequence so that it gets ‘closer and
closer’ to the vertex. Thus if there is a vertex which is the endpoint of inﬁnitely many
edges, then the weak topology cannot be a metric topology. An exercise at the end
of this section is to show the converse, that the weak topology is a metric topology if
each vertex is an endpoint of only ﬁnitely many edges.
A basis for the topology of X consists of the open intervals in the edges together
with the pathconnected neighborhoods of the vertices. A neighborhood of the latter
sort about a vertex v is the union of connected open neighborhoods U
α
of v in e
α
for all e
α
containing v. In particular, we see that X is locally pathconnected. Hence
a graph is connected iff it is pathconnected.
If X has only ﬁnitely many vertices and edges, then X is compact, being the
continuous image of the compact space X
0
¸
α
I
α
. The converse is also true, and more
generally, a compact subset C of a graph X can meet only ﬁnitely many vertices and
edges of X. To see this, let the subspace D ⊂ C consist of the vertices in C together
with one point in each edge which C meets. Then D is a closed subset of X since it
meets each e
α
in a closed set. For the same reason, any subset of D is closed, so D
has the discrete topology. But D is compact, being a closed subset of the compact
space C, so D must be ﬁnite. By the deﬁnitio of D this means that C can meet only
ﬁnitely many vertices and edges.
A subgraph of a graph X is a subspace Y ⊂ X which is a union of vertices and
edges of X, such that e
α
⊂ Y implies e
α
⊂ Y . The latter condition just says that Y
is a closed subspace of X. A tree is a contractible graph. By a tree in a graph X we
mean a subgraph which is a tree. We call a tree in X maximal if it contains all the
vertices of X. This is equivalent to the more obvious meaning of maximality, as we
will see below.
Proposition 1A.1. Every connected graph contains a maximal tree, and in fact any
tree in the graph is contained in a maximal tree.
Proof: Let X be a connected graph. We will describe a contruction which embeds
an arbitrary subgraph X
0
⊂ X as a deformation retract of a subgraph Y ⊂ X which
contains all the vertices of X. By choosing X
0
to be any subtree of X, for example a
single vertex, this will prove the proposition.
As a preliminary step, we construct a sequence of subgraphs X
0
⊂ X
1
⊂ X
2
⊂ ···,
letting X
i+1
be obtained from X
i
by adjoining the closures e
α
of all edges e
α
⊂ X−X
i
having at least one endpoint in X
i
. The union
i
X
i
is open in X since a neighborhood
of a point in X
i
is contained in X
i+1
. Also
i
X
i
is closed since it is a union of closed
edges and X has the weak topology. So X =
i
X
i
since X is connected.
Section 1.A. Graphs and Free Groups 83
Now to construct Y we begin by setting Y
0
= X
0
. Then inductively, assuming
that Y
i
⊂ X
i
has been constructed so as to contain all the vertices of X
i
, let Y
i+1
be
obtained from Y
i
by adjoining one edge connecting each vertex of X
i+1
−X
i
to Y
i
, and
let Y =
i
Y
i
. It is evident that Y
i+1
deformation retracts to Y
i
, and we may obtain
a deformation retraction of Y to Y
0
= X
0
by performing the deformation retraction
of Y
i+1
to Y
i
during the time interval [1/2
i+1
, 1/2
i
]. Thus a point x ∈ Y
i+1
− Y
i
is
stationary until this interval, when it moves into Y
i
and thereafter continues mov
ing until it reaches Y
0
. The resulting homotopy h
t
: Y→Y is continuous since it is
continuous on the closure of each edge and Y has the weak topology. L¦
Given a maximal tree T ⊂ X and a base vertex x
0
∈ T , then each edge e
α
of
X −T determines a loop f
α
in X which goes ﬁrst from x
0
to one endpoint of e
α
by
a path in T , then across e
α
, then back to x
0
by a path in T . Strictly speaking, we
should ﬁrst orient the edge e
α
in order to specify which direction to cross it. Note
that the homotopy class of f
α
is independent of the choice of the paths in T since T
is simplyconnected.
Proposition 1A.2. For a connected graph X with maximal tree T , π
1
(X) is a free
group with basis the classes [f
α
] corresponding to the edges e
α
of X −T .
In particular this implies that a maximal tree is maximal in the sense of not being
contained in any larger tree, since adjoining any edge to a maximal tree produces a
graph with nontrivial fundamental group. Another consequence is that a graph is a
tree iff it is simplyconnected.
Proof: The quotient map X→X/T is a homotopy equivalence by Proposition 0.17.
The quotient X/T is a graph with only one vertex, hence is a wedge sum of circles,
whose fundamental group we showed in Example 1.21 to be free with basis the loops
given by the edges of X/T , which are the images of the loops f
α
in X. L¦
Here is a very useful fact about graphs:
Lemma 1A.3. Every covering space of a graph is also a graph, with vertices and
edges the lifts of the vertices and edges in the base graph.
Proof: Let p:
`
X→X be the covering space. For the vertices of
`
X we take the discrete
set
`
X
0
= p
−1
(X
0
). Writing X as a quotient space of X
0
¸
α
I
α
as in the deﬁnition
of a graph and applying the path lifting property to the resulting maps I
α
→X, we
get a unique lift I
α
→
`
X passing through each point in p
−1
(x), for x ∈ e
α
. These
lifts deﬁne the edges of a graph structure on
`
X. The resulting topology on
`
X is the
same as its original topology since both topologies have the same basic open sets, the
covering projection
`
X→X being a local homeomorphism. L¦
We can now apply what we have proved about graphs and their fundamental
groups to prove a basic fact of group theory:
84 Chapter 1. The Fundamental Group
Theorem 1A.4. Every subgroup of a free group is free.
Proof: Given a free group F , choose a graph X with π
1
(X) ≈ F , for example a wedge
of circles corresponding to a basis for F . For each subgroup G of F there is by
Proposition 1.36 a covering space p:
`
X→X with p
∗
¸
π
1
(
`
X)
= G, hence π
1
(
`
X) ≈ G
since p
∗
is injective by Proposition 1.31. Since
`
X is a graph by the preceding lemma,
the group G ≈ π
1
(
`
X) is free by Proposition 1A.2. L¦
The structure of trees can be elucidated by looking more closely at the construc
tions in the proof of Proposition 1A.1. If X is a tree and v
0
is any vertex of X, then
the construction of a maximal tree Y ⊂ X starting with Y
0
= ¦v
0
¦ yields an increas
ing sequence of subtrees Y
n
⊂ X whose union is all of X since
a tree has only one maximal subtree, namely itself. We can think
of the vertices in Y
n
− Y
n−1
as being at ‘height’ n, with the edges
of Y
n
−Y
n−1
connecting these vertices to vertices of height n−1.
In this way we get a ‘height function’ h: X→R assigning to each
vertex its height, and monotone on edges.
For each vertex v of X there is exactly one edge leading downward from v, so
by following these downward edges we obtain a path from v to the base vertex v
0
.
This is an example of an edgepath, which is a composition of ﬁnitely many paths each
consisting of a single edge traversed monotonically. For any edgepath joining v to v
0
other than the downward edgepath, the height function would not be monotone and
hence would have local maxima, occurring when the edgepath backtracked, retracing
some edge it had just crossed. Thus in a tree there is a unique nonbacktracking
edgepath joining any two points. All the vertices and edges along this edgepath are
distinct.
A tree can contain no subgraph homeomorphic to a circle, since two vertices
in such a subgraph could be joined by more than one nonbacktracking edgepath.
Conversely, if a connected graph X contains no circle subgraph then it must be a tree.
For if T is a maximal tree in X which is not equal to X, then the union of an edge of
X −T with the nonbacktracking edgepath in T joining the endpoints of this edge is a
circle subgraph of X. So if there are no circle subgraphs of X we must have X = T ,
a tree.
For an arbitrary connected graph X and a pair of vertices v
0
and v
1
in X there is
a unique nonbacktracking edgepath in each homotopy class of paths from v
0
to v
1
.
This can be seen by lifting to the universal cover
`
X, which is a tree since it is simply
connected. Choosing a lift ` v
0
of v
0
, a homotopy class of paths from v
0
to v
1
lifts to
a homotopy class of paths starting at ` v
0
and ending at some lift ` v
1
of v
1
. Since
`
X is
simplyconnected, the homotopy class of paths from ` v
0
to ` v
1
is uniquely determined
by its endpoints. Nonbacktracking edgepaths in X lift to nonbacktracking edgepaths
Section 1.A. Graphs and Free Groups 85
in
`
X, and there is only one such edgepath from ` v
0
to ` v
1
as we have seen, so we obtain
the result claimed.
Exercises
1. Let X be a graph in which each vertex is an endpoint of only ﬁnitely many edges.
Show the weak topology on X is a metric topology.
2. Show that a connected graph retracts onto any connected subgraph.
3. For a ﬁnite graph X deﬁne the Euler characteristic χ(X) to be the number of
vertices minus the number of edges. Show that χ(X) = 1 if X is a tree, and that the
number of free generators of π
1
(X) is 1 − χ(X) if X is connected.
4. If X is a ﬁnite graph and Y is a subgraph homeomorphic to S
1
and containing the
basepoint x
0
, show that π
1
(X, x
0
) has a basis in which one element is represented
by the loop Y .
5. Construct a connected graph X and maps f, g : X→X such that fg = 11 but f
and g do not induce isomorphisms on π
1
. [Note that f
∗
g
∗
= 11 implies that f
∗
is
surjective and g
∗
is injective.]
6. Let F be the free group on 2 generators, F
¹
its commutator subgroup. Find a
set of free generators for F
¹
by considering the covering space of the graph S
1
∨ S
1
corresponding to F
¹
.
7. If F is a ﬁnitely generated free group and N is a nontrivial normal subgroup of
inﬁnite index, show, using covering spaces, that N is not ﬁnitely generated.
8. Show that a ﬁnitely generated group has only a ﬁnite number of subgroups of a
given ﬁnite index. [First do the case of free groups, using covering spaces of graphs.
The general case then follows since every group is a quotient group of a free group.]
9. Using covering spaces, show that an index n subgroup H of a group G has at most
n conjugate subgroups gHg
−1
in G. Apply this to show that there exists a normal
subgroup K ⊂ G of ﬁnite index with K ⊂ H. [For the latter statement, consider
the intersection of all the conjugate subgroups gHg
−1
. This is the maximal normal
subgroup of G contained in H.]
10. Let X be the wedge sum of n circles, with its natural graph structure, and let
`
X→X be a covering space with Y ⊂
`
X a ﬁnite connected subgraph. Show there is
a ﬁnite graph Z ⊃ Y having the same vertices as Y , such that the projection Y→X
extends to a covering space Z→X.
11. Apply the two preceding problems to show that if F is a ﬁnitely generated free
group and x ∈ F is not the identity element, then there is a normal subgroup H ⊂ F
of ﬁnite index such that x ∉ H. Hence x has nontrivial image in a ﬁnite quotient
group of F . In this situation one says F is residually ﬁnite.
86 Chapter 1. The Fundamental Group
12. Let F be a ﬁnitely generated free group, H ⊂ F a ﬁnitely generated subgroup, and
x ∈ F − H. Show there is a subgroup K of ﬁnite index in F such that K ⊃ H and
x ∉ K. [Apply exercise 10.]
13. Let x be a nontrivial element of a ﬁnitely generated free group F . Show there is
a ﬁniteindex subgroup H ⊂ F in which x is one element of a basis. [Exercises 4 and
10 may be helpful.]
14. Show that the existence of maximal trees is equivalent to the Axiom of Choice.
In this section we introduce a class of spaces whose homotopy type depends only
on their fundamental group. These spaces arise many places in topology, especially
where topology and group theory intermingle.
A pathconnected space whose fundamental group is isomorphic to a given group
G and which has a contractible universal covering space is called a K(G,1) space. The
‘1’ here refers to π
1
. More general K(G, n) spaces are studied in §4.1. All these spaces
are called EilenbergMacLane spaces, though in the case n = 1 they were studied by
Hurewicz before Eilenberg and MacLane took up the general case. Here are some
examples:
Example 1B.1. S
1
is a K(Z, 1). More generally, a connected graph is a K(G, 1) with G
a free group, since by the results of §1Aits universal cover is a tree, hence contractible.
Example 1B.2. Closed surfaces with inﬁnite π
1
, i.e., closed surfaces other than S
2
and
RP
2
, are K(G, 1)’s. This will be shown in Example 1B.14 below. It also follows fromthe
theorem in surface theory that the only simplyconnected surfaces without boundary
are S
2
and R
2
, so the universal cover of a closed surface with inﬁnite fundamental
group must be noncompact, hence R
2
. Nonclosed surfaces deformation retract onto
graphs, so are K(G, 1)’s with G free.
Example 1B.3. The inﬁnitedimensional projective space RP
∞
is a K(Z
2
, 1) since its
universal cover is S
∞
which is contractible. To show the latter fact, a homotopy from
the identity map of S
∞
to a constant map can be constructed in two stages as follows.
First, deﬁne f
t
: R
∞
→R
∞
by f
t
(x
1
, x
2
, ···) = (1 − t)(x
1
, x
2
, ···) + t(0, x
1
, x
2
, ···).
This takes nonzero vectors to nonzero vectors for all t ∈ [0, 1], so f
t
/¦f
t
¦ gives a ho
motopy fromthe identity map of S
∞
to the map (x
1
, x
2
, ···)
(0, x
1
, x
2
, ···). Then a
homotopy fromthis map to a constant map is given by g
t
/¦g
t
¦ where g
t
(x
1
, x
2
, ···) =
(1 −t)(0, x
1
, x
2
, ···) +t(1, 0, 0, ···).
Section 1.B. K(G,1) Spaces and Graphs of Groups 87
Example 1B.4. Generalizing the preceding example, we can construct a K(Z
m
, 1) as
an inﬁnite dimensional lens space S
∞
/Z
m
, where Z
m
acts on S
∞
, regarded as the
unit sphere in C
∞
, by scalar multiplication by m
th
roots of unity, a generator of this
action being the map (z
1
, z
2
, ···)
e
2πi/m
(z
1
, z
2
, ···). It is not hard to check that
this is a covering space action.
Example 1B.5. A product K(G, 1)×K(H, 1) is a K(G×H, 1) since its universal cover
is the product of the universal covers of K(G, 1) and K(H, 1). By taking products of
circles and inﬁnite dimensional lens spaces we therefore get K(G, 1)’s for arbitrary
ﬁnitely generated abelian groups G. For example the n dimensional torus T
n
, the
product of n circles, is a K(Z
n
, 1).
Example 1B.6. For a nonempty closed connected subspace K of S
3
, the complement
S
3
− K is a K(G, 1). This is a theorem in 3 manifold theory, but in the special case
that K is a torus knot the result follows from our study of torus knot complements
in Examples 1.24 and 1.35. Namely, we showed that for K the torus knot K
m,n
there
is a deformation retraction of S
3
− K onto a certain 2 dimensional complex X
m,n
having contractible universal cover. The homotopy lifting property then implies that
the universal cover of S
3
−K is homotopy equivalent to the universal cover of X
m,n
,
hence is also contractible.
Example 1B.7. It is not hard to construct a K(G, 1) for an arbitrary group G, us
ing the notion of a ∆ complex deﬁned in §2.1. Let EG be the ∆ complex whose
n simplices are the ordered (n + 1) tuples [g
0
, ··· , g
n
] of elements of G. Such an
n simplex attaches to the (n−1) simplices [g
0
, ··· , g
i
, ··· , g
n
] in the obvious way,
just as a standard simplex attaches to its faces. (The notation g
i
means that this ver
tex is deleted.) The complex EG is contractible by the homotopy h
t
which deforms
each point in the simplex [g
0
, ··· , g
n
] linearly in the simplex [e, g
0
, ··· , g
n
] to the
vertex [e], where e is the identity element of G. This is well deﬁned in EG since
when we restrict to a face [g
0
, ··· , g
i
, ··· , g
n
] we have the linear homotopy to [e] in
[e, g
0
, ··· , g
i
, ··· , g
n
]. Note that h
t
carries [e] around the loop [e, e], so h
t
is not
actually a deformation retraction of EG onto [e].
The group G acts on EG by left multiplication, an element g ∈ G taking the
simplex [g
0
, ··· , g
n
] linearly onto the simplex [gg
0
, ··· , gg
n
]. Only the identity e
takes any simplex to itself, so by an exercise at the end of this section, the action
of G on EG is a covering space action. Hence the quotient map EG→EG/G is the
universal cover of the orbit space BG = EG/G, and BG is a K(G, 1).
Since G acts on EG by freely permuting simplices, BG inherits a ∆ complex
structure from EG. The action of G on EG identiﬁes all the vertices of EG, so BG
has just one vertex. To describe the ∆ complex structure on BG explicitly, note ﬁrst
that every n simplex of EG can be written uniquely in the form
[g
0
, g
0
g
1
, g
0
g
1
g
2
, ··· , g
0
g
1
··· g
n
] = g
0
[e, g
1
, g
1
g
2
, ··· , g
1
··· g
n
].
88 Chapter 1. The Fundamental Group
The image of this simplex in BG may be denoted unambiguously by the symbol
[g
1
¦g
2
¦ ··· ¦g
n
]. In this ‘bar’ notation the g
i
’s and their ordered products can be
used to label edges, viewing an
edge label as the ratio between
the two labels on the ver
tices at the endpoints of
the edge, as indicated in
the ﬁgure. With this no
g
g
g
0 g
0
g
3
g
3
g
0
1
g
1
g
1
g
0
g
1
g
0
g
1 2
g g
0
g
1 2
g g
0
g
1 2
g
3
g
2
g
3
g g
1 2
g g
1 2
g
2
g
2
g g
1 2
tation, the boundary of a
simplex [g
1
¦ ··· ¦g
n
] of BG consists of the simplices [g
2
¦ ··· ¦g
n
], [g
1
¦ ··· ¦g
n−1
],
and [g
1
¦ ··· ¦g
i
g
i+1
¦ ··· ¦g
n
] for i = 1, ··· , n−1.
This construction of a K(G, 1) produces a rather large space, since BG is al
ways inﬁnitedimensional, and if G is inﬁnite, BG has an inﬁnite number of cells in
each positive dimension. For example, BZ is much bigger than S
1
, the most efﬁcient
K(Z, 1). On the other hand, BG has the virtue of being functorial: A homomorphism
f : G→H induces a map Bf : BG→BH sending a simplex [g
1
¦ ··· ¦g
n
] to the simplex
[f(g
1
)¦ ··· ¦f(g
n
)]. A different construction of a K(G, 1) is given in §4.1. Here one
starts with any 2 dimensional complex having fundamental group G, for example the
complex X
G
associated to a presentation of G, and then one attaches cells of dimen
sion 3 and higher to make the universal cover contractible without affecting π
1
. In
general, it is hard to get any control on the number of higherdimensional cells needed
in this construction, so it too can be rather inefﬁcient. Indeed, it is often a difﬁcult
problem to construct an efﬁcient K(G, 1) for a given group G. A curious and almost
paradoxical fact which is relevant to this efﬁciency question is that if G contains any
elements of ﬁnite order, then every K(G, 1) CWcomplex must be inﬁnitedimensional.
This is shown in Proposition 2.45. In particular the inﬁnitedimensional lens space
K(Z
m
, 1)’s in Example 1B.4 cannot be replaced by any ﬁnitedimensional complex.
In spite of the great latitude possible in the construction of K(G, 1)’s, there is a
very nice uniqueness statement which accounts for much of the interest in K(G, 1)’s:
Theorem1B.8. The homotopy type of a CW complex K(G, 1) is uniquely determined
by G.
Having a unique homotopy type of K(G, 1)’s associated to each group G means
that algebraic invariants of spaces which depend only on homotopy type, such as ho
mology and cohomology groups, become invariants of groups. This has proved to be a
quite fruitful idea, and has been much studied both fromthe algebraic and topological
viewpoints. The discussion following Proposition 2.45 gives a few references.
The preceding theorem will follow easily from:
Section 1.B. K(G,1) Spaces and Graphs of Groups 89
Proposition 1B.9. Let X be a connected CW complex and let Y be a K(G, 1). Then
any homomorphism π
1
(X, x
0
)→π
1
(Y, y
0
) is induced by a map (X, x
0
)→(Y, y
0
)
which is unique up to homotopy ﬁxing x
0
.
To deduce the theorem from this, let X and Y be CW complex K(G, 1)’s with iso
morphic fundamental groups. The proposition gives maps f : (X, x
0
)→(Y, y
0
) and
g : (Y, y
0
)→(X, x
0
) inducing inverse isomorphisms π
1
(X, x
0
) ≈ π
1
(Y, y
0
). Then fg
and gf induce the identity on π
1
hence are homotopic to the identity maps.
Proof of 1B.9: Let us ﬁrst consider the case that X has a single 0 cell, the base
point x
0
. Given a homomorphism ϕ: π
1
(X, x
0
)→π
1
(Y, y
0
), we begin the construc
tion of a map f : (X, x
0
)→(Y, y
0
) with f
∗
= ϕ by setting f(x
0
) = y
0
. Each 1 cell
e
1
α
of X has closure a circle determining an element
[e
1
α
] ∈ π
1
(X, x
0
), and we let f on the closure of e
1
α
X π
1
1
0
( ) x
ϕ
∗
,
X π
1 0
( ) x ,
Y π
1 0
( ) y ,
f
∗
i
−−−−→
−
−
−
−
−
−
−
−
−
→
−−−−−−−−−→
be a map representing ϕ([e
1
α
]). If i : X
1
X denotes
the inclusion, then ϕi
∗
= f
∗
since π
1
(X
1
, x
0
) is generated
by the elements [e
1
α
].
To extend f over a cell e
2
β
with attaching map ψ
β
: S
1
→X
1
, all we need is for the
composition fψ
β
to be nullhomotopic. Choosing a basepoint s
0
∈ S
1
and a path in X
1
from ψ
β
(s
0
) to x
0
, ψ
β
determines an element [ψ
β
] ∈ π
1
(X
1
, x
0
), and the existence
of a nullhomotopy of fψ
β
is equivalent to f
∗
([ψ
β
]) being zero in π
1
(Y, y
0
). We
have i
∗
([ψ
β
]) = 0 since the cell e
2
β
provides a nullhomotopy of ψ
β
in X. Hence
f
∗
([ψ
β
]) = ϕi
∗
([ψ
β
]) = 0, and so f can be extended over e
2
β
.
Extending f inductively over cells e
n
γ
with n > 2 is possible since the attaching
maps ψ
γ
: S
n−1
→X
n−1
have nullhomotopic compositions fψ
γ
: S
n−1
→Y . This is
because fψ
γ
lifts to the universal cover of Y if n > 2, and this cover is contractible
by hypothesis, so the lift of fψ
γ
is nullhomotopic, hence also fψ
γ
itself.
Turning to the uniqueness statement, if two maps f
0
, f
1
: (X, x
0
)→(Y, y
0
) in
duce the same homomorphism on π
1
, then we see immediately that their restrictions
to X
1
are homotopic, ﬁxing x
0
. To extend the resulting map X
1
×I ∪ X×∂I→Y
over the remaining cells e
n
×(0, 1) of X×I we can proceed just as in the previous
paragraph since these cells have dimension n + 1 > 2. Thus we obtain a homotopy
f
t
: (X, x
0
)→(Y, y
0
), ﬁnishing the proof in the case that X has a single 0 cell.
The case that X has more than one 0 cell can be treated by a small elaboration on
this argument. Choose a maximal tree T ⊂ X. To construct a map f realizing a given
ϕ, begin by setting f(T) = y
0
. Then each edge e
1
α
in X −T determines an element
[e
1
α
] ∈ π
1
(X, x
0
), and we let f on the closure of e
1
α
be a map representing ϕ([e
1
α
]).
Extending f over higherdimensional cells then proceeds just as before. Constructing
a homotopy f
t
joining two given maps f
0
and f
1
with f
0∗
= f
1∗
also has an extra
step. Let h
t
: X
1
→X
1
be a homotopy, starting with h
0
= 11, which restricts to a
deformation retraction of T to x
0
. (It is easy to extend such a deformation retraction
90 Chapter 1. The Fundamental Group
to a homotopy deﬁned on all of X
1
.) To construct a homotopy f
0
¦X
1
= f
1
¦X
1
, one
ﬁrst deforms f
0
¦X
1
and f
1
¦X
1
to take T to y
0
by composing with h
t
. Then the
earlier argument can be used to give a homotopy f
0
¦X
1
= f
1
¦X
1
and to extend this
homotopy over all of X. L¦
The ﬁrst part of the preceding proof also works for the 2 dimensional complexes
X
G
associated to presentations of groups. Thus every homomorphism G→H is re
alized as the induced homomorphism of some map X
G
→X
H
. However, there is no
uniqueness statement for this map, and it can easily happen that different presenta
tions of a group G give X
G
’s which are not homotopy equivalent.
Graphs of Groups
As an illustration of how K(G, 1) spaces can be useful in group theory, we shall
describe a procedure for assembling a collection of K(G, 1)’s together into a K(G, 1)
for a larger group G. Grouptheoretically, this gives a method for assembling smaller
groups together to form a larger group, generalizing the notion of free products.
Let Γ be a graph which is connected and oriented, that is, its edges are viewed as
arrows, each edge having a speciﬁed direction. Suppose that at each vertex v of Γ we
place a group G
v
and along each edge e of Γ we put a homomorphism ϕ
e
from the
group at the tail of the edge to the group at the head of the edge. We call this data a
graph of groups. Now build a space BΓ by putting the space BG
v
from Example 1B.7
at each vertex v of Γ and then ﬁlling in a mapping cylinder of the map Bϕ
e
along
each edge e of Γ , identifying the two ends of the mapping cylinder with the two BG
v
’s
at the ends of e. The resulting space BΓ is then a CW complex since the maps Bϕ
e
take n cells homeomorphically onto n cells. In fact, the cell structure on BΓ can be
canonically subdivided into a ∆ complex structure using the prism construction from
the proof of Theorem 2.10, but we will not need to do this here.
More generally, instead of BG
v
one could take any CW complex K(G
v
, 1) at the
vertex v, and then along edges put mapping cylinders of maps realizing the homo
morphisms ϕ
e
. We leave it for the reader to check that the resulting space KΓ is
homotopy equivalent to the BΓ constructed above.
Example 1B.10. Suppose Γ consists of one central vertex with a number of edges
radiating out from it, and the group G
v
at this central vertex is trivial, hence also all
the edge homomorphisms. Then van Kampen’s theorem implies that π
1
(KΓ ) is the
free product of the groups at all the outer vertices.
In view of this example, we shall call π
1
(KΓ ) for a general graph of groups Γ the
graph product of the vertex groups G
v
with respect to the edge homomorphisms ϕ
e
.
The name for π
1
(KΓ ) that is generally used in the literature is the rather awkward
phrase, ‘the fundamental group of the graph of groups.’
Section 1.B. K(G,1) Spaces and Graphs of Groups 91
Here is the main result we shall prove about graphs of groups:
Theorem 1B.11. If all the edge homomorphisms ϕ
e
are injective, then KΓ is a
K(G, 1) and the inclusions K(G
v
, 1)
KΓ induce injective maps on π
1
.
Before giving the proof, let us look at some interesting special cases:
Example 1B.12: Free Products with Amalgamation. Suppose the graph of groups is
A←C→B, with the two maps monomorphisms. One can regard this data as speci
fying embeddings of C as subgroups of A and B. Applying van Kampen’s theorem
to the decomposition of KΓ into its two mapping cylinders, we see that π
1
(KΓ ) is
the quotient of A∗B obtained by identifying the subgroup C ⊂ A with the subgroup
C ⊂ B. The standard notation for this group is A ∗
C
B, the free product of A and
B amalgamated along the subgroup C. According to the theorem, A ∗
C
B contains
both A and B as subgroups.
For example, a free product with amalgamation Z∗
Z
Z can be realized by mapping
cylinders of the maps S
1
←S
1
→S
1
which are m sheeted and n sheeted covering
spaces, respectively. We studied this case in Examples 1.24 and 1.35 where we showed
that the complex KΓ is a deformation retract of the complement of a torus knot in
S
3
if m and n are relatively prime. It is a basic result in 3 manifold theory that the
complement of every smooth knot in S
3
can be built up by iterated graph of groups
constructions with injective edge homomorphisms, starting with free groups, so the
theorem implies that these knot complements are K(G, 1)’s. Their universal covers
are all R
3
, in fact.
Example 1B.13: HNN Extensions. This is the case that the graph of groups consists
of two monomorphisms ϕ, ψ: C→A. This is analogous to the previous case A∗
C
B,
but with the two groups A and B coalesced to a single group. Accordingly, π
1
(KΓ )
is denoted A∗
C
. To see what this group looks like, regard KΓ as obtained from
K(A, 1) by attaching K(C, 1)×I along the two ends K(C, 1)×∂I via maps realizing
the monomorphisms ϕ and ψ. Using a K(C, 1) with a single 0 cell, we see that KΓ
can be obtained from K(A, 1) ∨ S
1
by attaching cells of dimension two and greater,
so π
1
(KΓ ) is a quotient of A ∗ Z, and it is not hard to ﬁgure out that the relations
deﬁning this quotient are of the form tϕ(c)t
−1
= ψ(c) where t is a generator of the
Z factor and c ranges over C, or a set of generators for C. We leave the veriﬁcation
of this for the Exercises.
As a very special case, taking ϕ = ψ = 11 gives A∗
A
= A×Z since we can take
KΓ = K(A, 1)×S
1
in this case. More generally, taking ϕ = 11 with ψ an arbitrary
automorphism of A, we realize any semidirect product of A and Z as A∗
A
. For
example, the Klein bottle occurs this way, with ϕ realized by the identity map of S
1
and ψ by a reﬂection. In these cases when ϕ = 11 we could realize the same group
π
1
(KΓ ) using a slightly simpler graph of groups, with a single vertex labelled A and
a single edge labelled ψ.
92 Chapter 1. The Fundamental Group
Here is another special case. Suppose we take a torus, delete a small open disk,
then identify the resulting boundary circle with a longitudinal circle of the torus.
This produces a space X which happens to be homeomorphic to a subspace of the
standard picture of a Klein bottle in R
3
; see Exercise 12 of §1.2. The fundamental
group π
1
(X) has the form (Z∗Z)∗
Z
Z with the deﬁning relation tb
:1
t
−1
= aba
−1
b
−1
where a is a meridional loop and b is a longitudinal loop on the torus. (The sign
of the exponent in the term b
:1
is immaterial since the two ways of glueing the
boundary circle to the longitude produce homeomorphic spaces.) The abelianization
of π
1
(X) = ¹ a, b, t ¦ tbt
−1
aba
−1
b
−1
) is Z×Z, but it seems to be nontrivial to show
that π
1
(X) is not isomorphic to Z ∗Z. There is a surjection π
1
(X)→Z ∗Z obtained
by setting b = 1. This has nontrivial kernel since b is nontrivial in π
1
(X) by the
preceding theorem. If π
1
(X) were isomorphic to Z∗Z we would then have a surjective
homomorphism Z∗Z→Z∗Z which was not an isomorphism. However, it is a theorem
in group theory that a free group F is hopﬁan — every surjective homomorphism
F→F must be injective. Hence π
1
(X) is not free.
Example 1B.14: Closed Surfaces. A closed orientable surface M of genus two or
greater can be cut along a circle into two compact surfaces M
1
and M
2
such that the
closed surfaces obtained from M
1
and M
2
by ﬁlling in their boundary circle with a
disk have smaller genus than M. Each of M
1
and M
2
is the mapping cylinder of a
map from S
1
to a ﬁnite graph. Namely, view M
i
as obtained from a closed surface
by deleting an open disk in the interior of the 2 cell in the standard CW structure
described in Chapter 0, so that M
i
becomes the mapping cylinder of the attaching
map of the 2 cell. This attaching map is not nullhomotopic, and therefore induces an
injection on π
1
since free groups are torsionfree. Thus we have realized the original
surface M as KΓ for Γ a graph of groups of the form F
1
← Z →F
2
with F
1
and F
2
free and the two maps injective. The theorem then says that M is a K(G, 1).
A similar argument works for closed nonorientable surfaces other than RP
2
. For
example, the Klein bottle is obtained from two M¨obius bands by identifying their
boundary circles, and a M¨obius band is the mapping cylinder of the twosheeted cov
ering space S
1
→S
1
.
Proof of 1B.11: We shall construct a covering space
`
K→KΓ by gluing together copies
of the universal covering spaces of the various mapping cylinders in KΓ in such a way
that
`
K will be contractible. Hence
`
K will be the universal cover of KΓ , which will
therefore be a K(G, 1).
First a preliminary observation: Given a universal covering space p:
`
X→X and
a connected, locally pathconnected subspace A ⊂ X such that the inclusion A
X
induces an injection on π
1
, then each component
`
A of p
−1
(A) is a universal cover
of A. For the restriction p:
`
A→A is certainly a covering space, so the induced map
π
1
(
`
A)→π
1
(A) is injective, and this map factors through π
1
(
`
X) = 0, hence π
1
(
`
A) =
Section 1.B. K(G,1) Spaces and Graphs of Groups 93
0. For example if X is the torus S
1
×S
1
and A is the circle S
1
×¦x
0
¦, then p
−1
(A)
consists of inﬁnitely many parallel lines in R
2
, each of which is a universal cover of A.
In particular, consider the universal cover p:
M
f
→M
f
of the mapping cylinder
of a map f : A→B between connected CW complexes. Then
M
f
is itself the mapping
cylinder of a map
`
f : p
−1
(A)→p
−1
(B) since the line segments in the mapping cylin
der structure on M
f
lift to line segments in
M
f
deﬁning a mapping cylinder structure.
Since
M
f
is a mapping cylinder, it deformation retracts onto p
−1
(B), so p
−1
(B) is also
simplyconnected, hence is the universal cover of B. If f induces an injection on π
1
,
then the remarks in the preceding paragraph apply, and the components of p
−1
(A)
are universal covers of A. If we assume further that A and B are K(G, 1)’s, then
M
f
and the components of p
−1
(A) are contractible, and we claim that
M
f
deformation
retracts onto each component
`
A of A. Namely, the inclusion
`
A
M
f
is a homo
topy equivalence since both spaces are contractible, and then Corollary 0.20 implies
that
M
f
deformation retracts onto
`
A since the pair (
M
f
,
`
A) satisﬁes the homotopy
extension property, as shown in Example 0.15.
Now we can describe the construction of the covering space
`
K of KΓ . It will be
the union of an increasing sequence of spaces
`
K
1
⊂
`
K
2
⊂ ···. For the ﬁrst stage,
let
`
K
1
be the universal cover of one of the mapping cylinders M
f
of KΓ . By the
preceding remarks, this contains various disjoint copies of universal covers of the
two K(G
v
, 1)’s at the ends of M
f
. We build
`
K
2
from
`
K
1
by attaching to each of
these universal covers of K(G
v
, 1)’s a copy of the universal cover of each mapping
cylinder M
g
of KΓ meeting M
f
at the end of M
f
in question. Now repeat the process
to construct
`
K
3
by attaching universal covers of mapping cylinders at all the universal
covers of K(G
v
, 1)’s created in the previous step. In the same way, we construct
`
K
n+1
from
`
K
n
for all n, and then we set
`
K =
n
`
K
n
.
Note that
`
K
n+1
deformation retracts onto
`
K
n
since it is formed by attaching
pieces to
`
K
n
which deformation retract onto the subspaces along which they attach,
by our earlier remarks. It follows that
`
K is contractible since we can deformation
retract
`
K
n+1
onto
`
K
n
during the time interval [1/2
n+1
, 1/2
n
], and then ﬁnish with a
contraction of
`
K
1
to a point during the time interval [1/2, 1].
The natural projection
`
K→KΓ is clearly a covering space, so this ﬁnishes the
proof that KΓ is a K(G, 1).
The remaining statement that each inclusion K(G
v
, 1)
KΓ induces an injection
on π
1
can easily be deduced from the preceding constructions. For suppose a loop
γ : S
1
→K(G
v
, 1) is nullhomotopic in KΓ . By the lifting criterion for covering spaces,
there is a lift ` γ : S
1
→
`
K. This has image contained in one of the copies of the universal
cover of K(G
v
, 1), so ` γ is nullhomotopic in this universal cover, and hence γ is
nullhomotopic in K(G
v
, 1). L¦
94 Chapter 1. The Fundamental Group
The various mapping cylinders which make up the universal cover of KΓ are
arranged in a treelike pattern. The tree in question, call it TΓ , has one vertex for each
copy of a universal cover of a K(G
v
, 1) in
`
K, and two vertices are joined by an edge
whenever the two universal covers of K(G
v
, 1)’s corresponding to these vertices are
connected by a line segment lifting a line segment in the mapping cylinder structure of
a mapping cylinder of KΓ . The inductive construction of
`
K is reﬂected in an inductive
construction of TΓ as a union of an increasing sequence of subtrees T
1
⊂ T
2
⊂ ···.
Corresponding to
`
K
1
is a subtree T
1
⊂ TΓ consisting of a central vertex with a number
of edges radiating out from it, an ‘asterisk’ with possibly an inﬁnite number of edges.
When we enlarge
`
K
1
to
`
K
2
, T
1
is correspondingly enlarged to a tree T
2
by attaching
a similar asterisk at the end of each outer vertex of T
1
. And so on at each stage. The
action of π
1
(KΓ ) on
`
K as deck transformations induces an action on TΓ , permuting
its vertices and edges, and the orbit space of TΓ under this action is just the original
graph Γ . The action on TΓ will not be a free action in general since the elements of
a subgroup G
v
⊂ π
1
(KΓ ) ﬁx a vertex corresponding to one of the universal covers of
K(G
v
, 1). (Basepoints need to be chosen to make this precise.)
There is in fact an exact correspondence between graphs of groups and groups
acting on trees. See [ScottWall] for an exposition of this rather nice theory. From
the viewpoint of groups acting on trees, the deﬁnition of a graph of groups is usually
taken to be slightly more restrictive than the one we have given here, namely, one
considers only oriented graphs obtained from an unoriented graph by subdividing
each edge by adding a vertex at its midpoint, then orienting the two resulting edges
outward, away from the new vertex.
Exercises
1. Suppose a group G acts simplicially on a ∆ complex X, i.e., each element of G
takes each n simplex of X onto another n simplex by a linear homeomorphism. If
the action is free, show it is a covering space action.
2. Let X be a connected CW complex and G a group such that every homomorphism
π
1
(X)→G is trivial. Show that every map X→K(G, 1) is nullhomotopic.
3. Show that every graph product of trivial groups is free.
4. Use van Kampen’s theorem to compute A∗
C
as a quotient of A ∗ Z, as stated in
the text.
5. Consider the graph of groups Γ having one vertex, Z, and one edge, the map Z→Z
which is multiplication by 2, realized by the 2 sheeted covering space S
1
→S
1
. Show
that π
1
(KΓ ) has presentation ¹ a, b ¦ bab
−1
a
−2
) and describe the universal cover
of KΓ explicitly as a product T ×R with T a tree. [The group π
1
(KΓ ) is the ﬁrst in
a family of groups called BaumslagSolitar groups, having presentations of the form
¹ a, b ¦ ba
m
b
−1
a
−n
). These are HNN extensions Z∗
Z
.]
Section 1.B. K(G,1) Spaces and Graphs of Groups 95
6. Show that for a graph of groups all of whose edge homomorphisms are injective
maps Z→Z we can choose KΓ to have universal cover a product T ×R with T a
tree. Work out in detail the case that the graph of groups is the inﬁnite sequence
Z
2
→Z
3
→Z
4
→Z →··· where the map Z
n
→Z is multiplication by n. Show
that π
1
(KΓ ) is isomorphic to Q in this case. How would one modify this example
to get π
1
(KΓ ) isomorphic to the subgroup of Q consisting of rational numbers with
denominator a power of 2?
7. Show that every graph product of groups can be realized by a graph whose vertices
are partitioned into two subsets, with every oriented edge going from a vertex in the
ﬁrst subset to a vertex in the second subset.
8. Show that a ﬁnite graph product of ﬁnitely generated groups is ﬁnitely generated,
and similarly for ﬁnitely presented groups.
9. Show that a ﬁnite graph product of ﬁnite groups has a free subgroup of ﬁnite
index, by constructing a ﬁnitesheeted covering space of KΓ from universal covers of
the mapping cylinders of KΓ .) [The converse is also true for ﬁnitely generated groups;
see [ScottWall].]
After the fundamental group π
1
(X) it would be natural to continue with the
higher homotopy groups π
n
(X), but unfortunately these are much harder to com
pute than π
1
(X). For this reason we shall change directions and begin to study the
homology groups H
n
(X) instead. These measure higherdimensional properties of
X as the higher homotopy groups do, but they have the advantage of being much
more computable, so they allow many lowdimensional results obtainable via the fun
damental group to be extended to arbitrary dimensions.
There is however a certain price to be paid for the generality and computability
of homology groups: Their deﬁnition is decidedly less transparent than the deﬁnition
of the fundamental group, and once one gets beyond the deﬁnition there is a cer
tain amount of technical machinery which must be set up before any real calculations
and applications can be given. In the exposition below we approach the deﬁnition of
H
n
(X) by two preliminary stages, ﬁrst giving a few motivating examples nonrigor
ously, then constructing a restricted model of homology theory called simplicial ho
mology, before plunging into the general theory, known as singular homology. After
the deﬁnition of singular homology has been assimilated, the real work of establish
ing its basic properties begins. This takes close to 20 pages, and there is no getting
around the fact that it is a substantial effort. This takes up most of the ﬁrst section
of the chapter, with small digressions only for two applications to classical theorems
of Brouwer: the ﬁxed point theorem and ‘invariance of dimension.’
The second section of the chapter gives more applications, including the ho
mology deﬁnition of Euler characteristic and Brouwer’s notion of degree for maps
S
n
→S
n
. However, the main thrust of this section is toward developing techniques
for calculating homology groups efﬁciently. The maximally efﬁcient method is ‘cellu
lar homology’ whose power comes perhaps from the fact that it is ‘homology squared’
— homology deﬁned in terms of homology. Another quite useful tool we develop is
MayerVietoris sequences, the analog for homology of van Kampen’s theorem for the
fundamental group.
98 Chapter 2. Homology
An interesting feature of homology which begins to emerge after one has worked
with it for a while is that it is the basic properties of homology which are used most
often, and not the actual deﬁnition itself. This suggests that an axiomatic approach
to homology might be possible. This is indeed the case, and in the third section of
the chapter we list axioms which completely characterize homology groups for CW
complexes. One could take the viewpoint that these rather algebraic axioms are all that
really matters about homology groups, that the geometry involved in the deﬁnition of
homology is secondary, needed only to show that the axiomatic theory is not vacuous.
The extent to which one adopts this viewpoint is a matter of taste, and the route taken
here of postponing the axioms until the theory is wellestablished is just one of several
possible approaches.
The chapter then concludes with three optional sections of ‘Additional Topics.’
The ﬁrst is rather brief, relating the homology group H
1
(X) to the fundamental group
π
1
(X), while the other two contain a selection of classical applications of homology.
These include Brouwer’s generalization of the Jordan curve theorem, the ‘invariance
of domain’ theorem also due to Brouwer, and the Lefschetz ﬁxed point theorem.
The Idea of Homology
The difﬁculty with the higher homotopy groups π
n
is that they are not directly
computable from a cell structure as π
1
is. For example, the 2sphere has no cells in
dimensions greater than 2, yet its n dimensional homotopy group π
n
(S
2
) is nonzero
for inﬁnitely many values of n. Homology groups, by contrast, are quite directly
related to cell structures, and may indeed be regarded as simply an algebraization of
the ﬁrst layer of geometry in cell structures: how cells of dimension n attach to cells
of dimension n−1.
Let us look at some examples to see what this is about. Con
sider the graph X
1
shown in the ﬁgure, consisting of two ver
tices joined by four edges. When studying the fundamen
d
a
x
y
c b
tal group of X
1
we consider loops formed by sequences of
edges, starting and ending at a ﬁxed basepoint. For example,
at the basepoint x, the loop ab
−1
travels forward along the
edge a then backward along b, as indicated by the exponent −1.
A more complicated loop would be ac
−1
bd
−1
ca
−1
. A salient feature of the funda
mental group is that it is generally nonabelian, which both enriches and complicates
the theory. Suppose we simplify matters by abelianizing. Thus for example the two
loops ab
−1
and b
−1
a are to be regarded as equal if we make a commute with b
−1
.
These two loops ab
−1
and b
−1
a are really the same circle, just with a different choice
of starting and ending point: x for ab
−1
and y for b
−1
a. The same thing happens
for all loops: Rechoosing the basepoint in a loop just permutes its letters cyclically,
so a byproduct of abelianizing is that we no longer have to pin all our loops down to
The Idea of Homology 99
a ﬁxed basepoint. Thus loops become cycles, without a chosen basepoint.
Having abelianized, let us switch to additive notation, so cycles become linear
combinations of edges with integer coefﬁcients, e.g., a −b +c −d. Let us call these
linear combinations chains of edges. Some chains can be decomposed into cycles in
several different ways, for example (a − c) + (b − d) = (a − d) + (b − c), and if
we adopt an algebraic viewpoint then we do not want to distinguish between these
different decompositions. Thus we broaden the meaning of the term ‘cycle’ to be
simply any linear combination of edges for which at least one decomposition into
cycles in the previous more geometric sense exists.
What is the condition for a chain to be a cycle in this more algebraic sense? A
geometric cycle, thought of as a path traversed in time, is distinguished by the prop
erty that it enters each vertex the same number of times that it leaves the vertex. For
an arbitrary chain ka + b + mc + nd, the net number of times this chain enters y
is k + + m+ n since each of a, b, c, and d enters y once. Similarly, each of the
four edges leaves x once, so the net number of times the chain ka + b + mc + nd
enters x is −k − −m−n. Thus the condition for ka+b +mc +nd to be a cycle
is simply k + +m+n = 0.
To describe this result in a way which would generalize to all graphs, let C
1
be the
free abelian group with basis the edges a, b, c, d and let C
0
be the free abelian group
with basis the vertices x, y. Elements of C
1
are chains of edges, or 1 dimensional
chains, and elements of C
0
are linear combinations of vertices, or 0 dimensional
chains. Deﬁne a homomorphism ∂ : C
1
→C
0
by sending each basis element a, b, c, d
to y −x, the vertex at the head of the edge minus the vertex at the tail. Thus we have
∂(ka + b + mc + nd) = (k + + m+ n)y − (k + + m+ n)x, and the cycles are
precisely the kernel of ∂. It is a simple calculation to verify that a−b, b−c, and c−d
form a basis for this kernel. Thus every cycle in X
1
is a unique linear combination of
these three most obvious cycles. By means of these three basic cycles we convey the
geometric information that the graph X
1
has three visible ‘holes,’ the empty spaces
between the four edges.
Let us now enlarge the preceding graph X
1
by attaching a
2 cell A along the cycle a−b, producing a 2 dimensional cell
complex X
2
. If we think of the 2 cell A as being oriented
x
y
d c a
b
A clockwise, then we can regard its boundary as the cycle a−b.
This cycle is now homotopically trivial since we can contract
it to a point by sliding over A. In other words, it no longer
encloses a hole in X
2
. This suggests that we form a quotient of the
group of cycles in the preceding example by factoring out the subgroup generated by
a − b. In this quotient the cycles a − c and b − c, for example, become equivalent,
consistent with the fact that they are homotopic in X
2
.
100 Chapter 2. Homology
Algebraically, we can deﬁne now a pair of homomorphisms
C
2
∂
2
→C
1
∂
1
→C
0
where C
2
is the inﬁnite cyclic group generated by A and ∂
2
(A) = a − b. The map
∂
1
is the boundary homomorphism in the previous example. The quotient group we
are interested in is Ker ∂
1
/ Im∂
2
, i.e., the 1 dimensional cycles modulo those which
are boundaries, the multiples of a − b. This quotient group is the homology group
H
1
(X
2
). The previous example can be ﬁt into this scheme too by taking C
2
to be zero
since there are no 2 cells in X
1
, so in this case H
1
(X
1
) = Ker ∂
1
/ Im∂
2
= Ker ∂
1
, which
as we saw was free abelian on three generators. In the present example, H
1
(X
2
) is
free abelian on two generators, b−c and c −d, expressing the geometric fact that by
ﬁlling in the 2 cell A we have reduced the number of ‘holes’ in our space from three
to two.
Next, suppose we build a space X
3
by enlarging X
2
further
by attaching a second 2 cell B along the same cycle a − b.
This gives a 2 dimensional chain group C
2
consisting of lin
x
y
d a c b
ear combinations of A and B, and the boundary homomor
phism ∂
2
: C
2
→C
1
sends both A and B to a−b. The homol
ogy group H
1
(X
3
) = Ker ∂
1
/ Im∂
2
is the same as for X
2
, but
now ∂
2
has a nontrivial kernel, the inﬁnite cyclic group generated
by A − B. We view A − B as a 2 dimensional cycle, generating the homology group
H
2
(X
3
) = Ker ∂
2
≈ Z. Topologically, the cycle A−B is the sphere formed by the cells
A and B together with their common boundary circle. This spherical cycle detects
the presence of a ‘hole’ in X
3
, the missing interior of the sphere. However, since this
hole is enclosed by a sphere rather than a circle, it is of a different sort from the holes
detected by H
1
(X
3
) ≈ Z×Z, which are detected by the cycles b −c and c −d.
Let us continue one more step and construct a complex X
4
from X
3
by attaching
a 3 cell C along the 2 sphere formed by A and B. This creates a chain group C
3
generated by this 3 cell C, and we deﬁne a boundary homomorphism ∂
3
: C
3
→C
2
sending C to A−B since the cycle A−B should be viewed as the boundary of C in
the same way that the 1 dimensional cycle a−b is the boundary of A. Now we have
a sequence of three boundary homomorphisms
C
3
∂
3
→C
2
∂
2
→C
1
∂
1
→C
0
and the quotient H
2
(X
4
) = Ker ∂
2
/ Im∂
3
has become trivial. Also H
3
(X
4
) = Ker ∂
3
= 0.
The group H
1
(X
4
) is the same as H
1
(X
3
), namely Z×Z, so this is the only nontrivial
homology group of X
4
.
It is clear what the general pattern of the examples is. For a cell complex X one
has chain groups C
n
(X) which are free abelian groups with basis the n cells of X,
and there are boundary homomorphisms ∂
n
: C
n
(X)→C
n−1
(X), in terms of which
The Idea of Homology 101
one deﬁnes the homology group H
n
(X) = Ker ∂
n
/ Im∂
n+1
. The major difﬁculty is
how to deﬁne ∂
n
in general. For n = 1 this is easy: the boundary of an oriented
edge is the vertex at its head minus the vertex at its tail. The next case n = 2 is also
not hard, at least for cells attached along cycles which are simply loops of edges, for
then the boundary of the cell is this cycle of edges, with the appropriate signs taking
orientations into account. But for larger n, matters become more complicated. Even
if one restricts attention to cell complexes formed from polyhedral cells with nice
attaching maps, there is still the matter of orientations to sort out.
The best solution to this problem seems to be to adopt an indirect approach.
Arbitrary polyhedra can always be subdivided into special polyhedra called simplices
(the triangle and the tetrahedron are the 2 dimensional and 3 dimensional instances)
so there is no loss of generality, though initially there is some loss of efﬁciency, in re
stricting attention entirely to simplices. For simplices there is no difﬁculty in deﬁning
boundary maps or in handling orientations. So one obtains a homology theory, called
simplicial homology, for cell complexes built from simplices. Still, this is a rather
restricted class of spaces, and the theory itself has a certain rigidity which makes it
awkward to work with.
The way around these obstacles is to step back from the geometry of spaces
decomposed into simplices, and just to consider all possible continuous maps of sim
plices into a given space X. This produces tremendously large chain groups C
n
(X),
but the quotients H
n
(X) = Ker ∂
n
/ Im∂
n+1
, called singular homology groups, turn out
to be much smaller, at least for reasonably nice spaces X. In particular, for spaces
like those in the four examples above, the singular homology groups coincide with
the homology groups we computed from the cellular chains. And as we shall see later
in this chapter, singular homology allows one to deﬁne these nice cellular homology
groups for all cell complexes, and in particular to solve the problem of deﬁning the
boundary maps for cellular chains.
102 Chapter 2. Homology
The most important homology theory in algebraic topology, and the one we shall
be studying almost exclusively, is called singular homology. But before starting this
we will ﬁrst introduce a more primitive version, called simplicial homology, to give
some idea of howthe technical apparatus works in a smallerscale setting. The natural
domain of deﬁnition for simplicial homology is a class of spaces we call ∆ complexes,
which are a modest generalization of the more classical notion of a simplicial complex.
∆Complexes
We begin with three examples: the torus, the projective plane, and the Klein bottle.
Each of these surfaces can be obtained from a square by identifying opposite edges,
in the way indicated by the arrows in the ﬁgure below.
b
b
a a
c
v
v v
v
U
L
b
b
a a c
w
v w
v
U
L
b
b
a a c
v
v v
v
U
L
RP
2
T : :
−−
K:
−− −−−
If we cut the square along a diagonal, we get two triangles, so each of these surfaces
can also be constructed from two triangles by identifying certain pairs of edges.
In similar fashion, a polygon with any number of sides can
be cut along diagonals into triangles, so in fact all closed
surfaces can be constructed from triangles by identifying
edges. Thus we have a single building block, the triangle,
b
b
a
a
c
c
d
d
from which all surfaces can be constructed. Using only tri
angles we could also construct a large class of 2 dimensional
spaces which are not surfaces by identifying more than two edges
together at a time.
∆ complexes are a generalization of this idea, using the n dimensional ana
log of the triangle, the n simplex. This is the smallest convex set in R
m
contain
v v
0
v
0
v
0 1
v
2
v
1
v
0
v
1
v
2
v
3
ing n + 1 points v
0
, ··· , v
n
which do not lie in
a hyperplane of dimension less than n, where
by a ‘hyperplane’ we mean the set of solu
tions of a system
of linear equations.
An equivalent condition would be that the vectors v
1
− v
0
, ··· , v
n
− v
0
are linearly
independent. The points v
i
are the vertices of the simplex, and the simplex itself
Section 2.1. Simplicial and Singular Homology 103
will be denoted [v
0
, ··· , v
n
]. For example, there is the standard n simplex
∆
n
=
¸
(t
0
, ··· , t
n
) ∈ R
n+1
¸
¸
¸
i
t
i
= 1 and t
i
≥ 0 for all i
¸
whose vertices are the unit vectors along the coordinate axes.
For purposes of homology it will be important to keep track of the order of the
vertices of a simplex, so ‘ n simplex’ will really mean ‘ n simplex with an ordering
of its vertices.’ A byproduct of ordering the vertices of a simplex [v
0
, ··· , v
n
] is
that this determines orientations of the edges [v
i
, v
j
] according to increasing sub
scripts, as shown in the previous ﬁgure. Specifying the ordering of the vertices
also determines a canonical linear homeomorphism from the standard n simplex
∆
n
onto any other n simplex [v
0
, ··· , v
n
], preserving the order of vertices, namely,
(t
0
, ··· , t
n
)
¸
i
t
i
v
i
. The coefﬁcients t
i
are the barycentric coordinates of the point
¸
i
t
i
v
i
in [v
0
, ··· , v
n
].
A face of a simplex [v
0
, ··· , v
n
] is the subsimplex with vertices any nonempty
subset of the v
i
’s. The subset need not be a proper subset, so [v
0
, ··· , v
n
] is regarded
as a face of itself. We adopt the convention that the vertices of a face will always be
ordered according to their order in the larger simplex.
The quick deﬁnition of a ∆ complex is that it is a quotient space of a collection of
disjoint simplices obtained by identifying certain of their faces via the canonical linear
homeomorphisms which preserve the ordering of vertices. Somewhat more formally,
the data one starts with is a collection of disjoint simplices ∆
n
α
of various dimensions,
together with certain sets ²
i
of faces of the ∆
n
α
’s, all the faces in each ²
i
having the
same dimension. Then one forms a quotient space of
¸
α
∆
n
α
by identifying all the
faces in each ²
i
to a single simplex via the canonical linear homeomorphisms between
them. Notice that the data which determines a ∆ complex is purely combinatorial,
with no topology involved. One can think of constructing a ∆ complex as a Legolike
game in which one starts with a set of interchangeable pieces and snaps themtogether
according to certain speciﬁed rules.
The previouslydescribed representations of the torus, projective plane, and Klein
bottle as pairs of triangles with edges identiﬁed are in fact ∆ complex structures,
because the indicated orientations of the three edges of each triangle are compatible
with a unique ordering of the vertices of the triangle, and the identiﬁcations of edges
preserve orientations, hence preserve orderings of vertices.
In general, the edges in any ∆ complex X inherit welldeﬁned orientations from
the orderings of the vertices of the simplices fromwhich X is built. These orientations
are not completely arbitrary, since the orientations of the various edges in the bound
ary of each n simplex of X must be related just as they are in a simplex [v
0
, ··· , v
n
],
consistent with the ordering of the vertices. It is not hard to check that this com
patibility condition on orientations amounts to requiring that no 2 simplex of X has
its three edges oriented cyclically, i.e., according to a clockwise or counterclockwise
104 Chapter 2. Homology
traversal of the three edges. Note that when the edges of a simplex are compatibly
oriented, these orientations uniquely determine the ordering of the vertices.
In the case of onedimensional ∆ complexes the compatibility condition on ori
entations of edges is vacuous, so a onedimensional ∆ complex is exactly the same
thing as an oriented graph, that is, a graph with orientations speciﬁed for all its edges.
In the torus and Klein bottle examples, all three vertices of each triangle end up
being identiﬁed to a single point, and in the projective plane example, two of the
three vertices of each triangle are identiﬁed. Thus, certain identiﬁcations of points
in the boundary of a single simplex are allowed in ∆ complexes. As a more extreme
example, we could construct a ∆ complex from a 2 simplex by identifying all three
of its edges together, preserving the orientations of these edges. It is an interesting
exercise to see that these identiﬁcations can actually be performed in R
3
, with quite
a bit of stretching and bending of the 2 simplex. The resulting space is sometimes
called the ‘dunce cap.’ Like the house with two rooms in Chapter 0, it is contractible
but not in any obvious way.
Since the identiﬁcations of faces of simplices which produce a ∆ complex X al
ways preserve the orderings of vertices, these identiﬁcations never result in two dis
tinct points in the interior of a face being identiﬁed in X. This means that X, as a
set, is the disjoint union of a collection of open simplices — simplices with all their
proper faces deleted. Each such open simplex e
n
α
of dimension n comes equipped
with a canonical map σ
α
: ∆
n
→X restricting to a homeomorphism from the interior
of ∆
n
onto e
n
α
. Namely, the closure of e
n
α
is the quotient of one of the simplices
from which X was constructed, or of a face of one of these simplices, and σ
α
is the
quotient map from this simplex or face to X. In the Appendix we show that the open
simplices e
n
α
are the cells of a CW structure with the σ
α
’s as characteristic maps.
Though we won’t need this fact in what follows, we will use the terminology that σ
α
is the characteristic map for the open simplex e
n
α
.
A key property of each characteristic map σ
α
: ∆
n
→X is that its restriction to
each (n − 1) dimensional face of ∆
n
is the characteristic map σ
β
for some open
(n − 1) simplex e
n−1
β
of X. (Implicit here is the canonical identiﬁcation of each
(n − 1) dimensional face of ∆
n
with the standard (n − 1) simplex ∆
n−1
, preserv
ing the order of vertices.) This property can be used to give an equivalent deﬁnition
of a ∆ complex as a CW complex X in which each n cell e
n
α
has a distinguished char
acteristic map σ
α
: ∆
n
→X such that the restriction of σ
α
to each (n−1) dimensional
face of ∆
n
is the distinguished characteristic map for an (n−1) cell of X.
Simplicial Homology
Our goal now is to deﬁne the simplicial homology groups of a ∆ complex X. Let
∆
n
(X) be the free abelian group with basis the open n simplices e
n
α
of X. Elements
of ∆
n
(X), called n chains, can be written as ﬁnite formal sums
¸
α
n
α
e
n
α
with co
Section 2.1. Simplicial and Singular Homology 105
efﬁcients n
α
∈ Z. Equivalently, we could write
¸
α
n
α
σ
α
where σ
α
: ∆
n
→X is the
characteristic map of e
n
α
, with image the closure of e
n
α
as described above. Such a
sum
¸
α
n
α
σ
α
can be thought of as a ﬁnite collection, or ‘chain,’ of n simplices in X
with integer multiplicities, the coefﬁcients n
α
.
As one can see in the next ﬁgure, the boundary of the n simplex [v
0
, ··· , v
n
] con
sists of the various (n−1) dimensional simplices [v
0
, ··· , v
i
, ··· , v
n
], where the ‘hat’
symbol over v
i
indicates that this vertex is deleted from the sequence v
0
, ··· , v
n
.
In terms of chains, we might then wish to say that the boundary of [v
0
, ··· , v
n
] is the
(n−1) chain formed by the sum of the faces [v
0
, ··· , v
i
, ··· , v
n
]. However, it turns
out to be better to insert certain signs and instead let the boundary of [v
0
, ··· , v
n
] be
¸
i
(−1)
i
[v
0
, ··· , v
i
, ··· , v
n
]. Heuristically, the signs are inserted to take orientations
into account, so that all the faces of a simplex are coherently oriented, as indicated in
the ﬁgure.
v
0
v
1
v
2
v
3
v v
0 1
v
2
v
0
v
1
+
∂[v
0
, v
1
] = [v
1
] −[v
0
]
∂[v
0
, v
1
, v
2
] = [v
1
, v
2
] −[v
0
, v
2
] +[v
0
, v
1
]
∂[v
0
, v
1
, v
2
, v
3
] = [v
1
, v
2
, v
3
] −[v
0
, v
2
, v
3
]
+ [v
0
, v
1
, v
3
] −[v
0
, v
1
, v
2
]
In the last case, the orientations of the two hidden faces are also counterclockwise
when viewed from outside the 3 simplex.
With this geometry in mind we deﬁne for a general ∆ complex X a boundary
homomorphism ∂
n
: ∆
n
(X)→∆
n−1
(X) by specifying its values on basis elements:
∂
n
(σ
α
) =
¸
i
(−1)
i
σ
α
¦
¦[v
0
, ··· , v
i
, ··· , v
n
]
Note that the right side of this equation does indeed lie in ∆
n−1
(X) since each restric
tion σ
α
¦
¦[v
0
, ··· , v
i
, ··· , v
n
] is the characteristic map of an (n−1) simplex of X.
Lemma 2.1. The composition ∆
n
(X)
∂
n
→∆
n−1
(X)
∂
n−1
→∆
n−2
(X) is zero.
Proof: ∂
n
(σ) =
¸
i
(−1)
i
σ ¦
¦[v
0
, ··· , v
i
, ··· , v
n
], hence
∂
n−1
∂
n
(σ) =
¸
j<i
(−1)
i
(−1)
j
σ¦
¦[v
0
, ··· , v
j
, ··· , v
i
, ··· , v
n
]
+
¸
j>i
(−1)
i
(−1)
j−1
σ¦
¦[v
0
, ··· , v
i
, ··· , v
j
, ··· , v
n
].
106 Chapter 2. Homology
The latter two summations cancel since after switching i and j in the second sum, it
becomes the negative of the ﬁrst. L¦
The algebraic situation we have now is a sequence of homomorphisms of abelian
groups
··· →C
n+1
∂n+1
→C
n
∂n
→C
n−1
→··· →C
1
∂1
→C
0
∂
0
→0
with ∂
n
∂
n+1
= 0 for all n. Such a sequence is called a chain complex. Note that we
have extended the sequence by a 0 at the right end, with ∂
0
= 0. From ∂
n
∂
n+1
= 0
it follows that Im∂
n+1
⊂ Ker ∂
n
, where Im and Ker denote image and kernel. So we
can deﬁne the n
th
homology group of the chain complex to be the quotient group
H
n
= Ker ∂
n
/ Im∂
n+1
. Elements of Ker ∂
n
are called cycles and elements of Im∂
n+1
are boundaries. Elements of H
n
are cosets of Im∂
n+1
, called homology classes. Two
cycles representing the same homology class are said to be homologous. This means
their difference is a boundary.
Returning to the case that C
n
= ∆
n
(X), the homology group Ker ∂
n
/ Im∂
n+1
will
be denoted H
∆
n
(X) and called the n
th
simplicial homology group of X.
Example 2.2. X = S
1
, with one vertex v and one edge e. Then ∆
0
(S
1
) and ∆
1
(S
1
)
are both Z and the boundary map ∂
1
is zero since ∂e = v − v. The groups ∆
n
(S
1
)
are 0 for n ≥ 2 since there are no simplices in these dimensions. Hence
H
∆
n
(S
1
) ≈
Z for n = 0, 1
0 for n ≥ 2.
This is an illustration of the general fact that if the boundary maps in a chain complex
are all zero, then the homology groups of the complex are isomorphic to the chain
groups themselves.
Example 2.3. X = T , the torus with the ∆ complex structure pictured earlier, having
one vertex, three edges a, b, and c, and two 2 simplices U and L. As in the previous
example, ∂
1
= 0 so H
∆
0
(T) ≈ Z. Since ∂
2
U = a +b −c = ∂
2
L and ¦a, b, a +b −c¦ is
a basis for ∆
1
(T), it follows that H
∆
1
(T) ≈ Z⊕Z with basis the homology classes [a]
and [b]. Since there are no 3 simplices, H
∆
2
(T) is equal to Ker ∂
2
, which is inﬁnite
cyclic generated by U −L since ∂(pU +qL) = (p +q)(a+b −c) = 0 only if p = −q.
Thus
H
∆
n
(T) ≈
¸
¸
Z ⊕ Z for n = 1
Z for n = 0, 2
0 for n ≥ 3.
Example 2.4. X = RP
2
, as pictured earlier, with two vertices v and w, three edges
a, b, and c, and two 2 simplices U and L. Then Im∂
1
is generated by w − v, so
H
∆
0
(X) ≈ Z with either vertex as a generator. Since ∂
2
U = −a+b+c and ∂
2
L = a−b+c,
we see that ∂
2
is injective, so H
∆
2
(X) = 0. Further, Ker ∂
1
≈ Z⊕Z with basis a−b and
c, and Im∂
2
is an indextwo subgroup of Ker ∂
1
since we can choose c and a−b +c
as a basis for Ker ∂
1
and a−b +c and 2c = (a−b +c) +(−a+b +c) as a basis for
Im∂
2
. Thus H
∆
1
(X) ≈ Z
2
.
Section 2.1. Simplicial and Singular Homology 107
Example 2.5. We can obtain a ∆ complex structure on S
n
by taking two copies of ∆
n
and identifying their boundaries via the identity map. Labeling these two n simplices
U and L, then it is obvious that Ker ∂
n
is inﬁnite cyclic generated by U − L. Thus
H
∆
n
(S
n
) ≈ Z for this ∆ complex structure on S
n
. Computing the other homology
groups would be more difﬁcult.
Many similar examples could be worked out without much trouble, such as the
other closed orientable and nonorientable surfaces. However, the calculations do tend
to increase in complexity before long, particularly for higher dimensional complexes.
Some obvious general questions arise: Are the groups H
∆
n
(X) independent of
the choice of ∆ complex structure on X? In other words, if two ∆ complexes are
homeomorphic, do they have isomorphic homology groups? More generally, do they
have isomorphic homology groups if they are merely homotopy equivalent? To answer
such questions and to develop a general theory it is best to leave the rather rigid
simplicial realm and introduce the singular homology groups. These have the added
advantage that they are deﬁned for all spaces, not just ∆ complexes. At the end of
this section, after some theory has been developed, we will show that simplicial and
singular homology groups coincide for ∆ complexes.
Traditionally, simplicial homology is deﬁned for simplicial complexes, which are
the ∆ complexes whose simplices are uniquely determined by their vertices. This
amounts to saying that each n simplex has n+1 distinct vertices, and that no other
n simplex has this same set of vertices. Thus a simplicial complex can be described
combinatorially as a set X
0
of vertices together with sets X
n
of n simplices, which
are (n+1) element subsets of X
0
. The only requirement is that each (k+1) element
subset of the vertices of an n simplex in X
n
is a k simplex, in X
k
. From this combi
natorial data a ∆ complex X can be constructed, once we choose a partial ordering
of the vertices X
0
which restricts to a linear ordering on the vertices of each simplex
in X
n
. For example, we could just choose a linear ordering of all the vertices. This
might perhaps involve invoking the Axiom of Choice for large vertex sets.
An exercise at the end of this section is to show that every ∆ complex can be
subdivided to be a simplicial complex. In particular, every ∆ complex is then homeo
morphic to a simplicial complex.
Compared with simplicial complexes, ∆ complexes have the advantage of simpler
computations since fewer simplices are required. For example, to put a simplicial
complex structure on the torus one needs at least 14 triangles, 21 edges, and 7 vertices,
and for RP
2
one needs at least 10 triangles, 15 edges, and 6 vertices. This would slow
down calculations considerably!
Singular Homology
A singular n simplex in a space X is by deﬁnition just a map σ : ∆
n
→X. The
word ‘singular’ is used here to express the idea that σ need not be a nice embedding
108 Chapter 2. Homology
but can have ‘singularities’ where its image does not look at all like a simplex. All that
is required is that σ be continuous. Let C
n
(X) be the free abelian group with basis
the set of singular n simplices in X. Elements of C
n
(X), called n chains, or more
precisely singularn chains, are ﬁnite formal sums
¸
i
n
i
σ
i
for n
i
∈ Z and σ
i
: ∆
n
→X.
A boundary map ∂
n
: C
n
(X)→C
n−1
(X) is deﬁned by the same formula as before:
∂
n
(σ) =
¸
i
(−1)
i
σ ¦
¦[v
0
, ··· , v
i
, ··· , v
n
]
Implicit in this formula is the canonical identiﬁcation of [v
0
, ··· , v
i
, ··· , v
n
] with
∆
n−1
, preserving the ordering of vertices, so that σ ¦
¦[v
0
, ··· , v
i
, ··· , v
n
] is regarded
as a map ∆
n−1
→X, that is, a singular (n−1) simplex.
Often we write the boundary map ∂
n
from C
n
(X) to C
n−1
(X) simply as ∂ when
this doesn’t lead to serious ambiguities. The proof of Lemma 2.1 shows that ∂
n
∂
n+1
=
0, or more concisely ∂
2
= 0, so we can deﬁne the singular homology group H
n
(X) =
Ker ∂
n
/ Im∂
n+1
.
It is evident from the deﬁnition that homeomorphic spaces have isomorphic sin
gular homology groups H
n
, in contrast with the situation for H
∆
n
. On the other hand,
since the groups C
n
(X) are so large, the number of singular n simplices in X usually
being uncountable, it is not at all clear that for a ∆ complex X with ﬁnitely many sim
plices, H
n
(X) should be ﬁnitely generated for all n, or that H
n
(X) should be zero
for n larger than the dimension of X — two properties which are trivial for H
∆
n
(X).
Though singular homology looks so much more general than simplicial homology,
it can actually be regarded as a special case of simplicial homology by means of the
following construction. For an arbitrary space X, deﬁne the singular complex S(X)
to be the ∆ complex with one n simplex ∆
n
σ
for each singular n simplex σ : ∆
n
→X,
with ∆
n
σ
attached in the obvious way to the (n − 1) simplices of S(X) which are
the restrictions of σ to the various (n − 1) simplices in ∂∆
n
. It is clear from the
deﬁnitions that H
∆
n
¸
S(X)
is identical with H
n
(X) for all n, and in this sense the
singular homology group H
n
(X) is a special case of a simplicial homology group. One
can regard S(X) as a ∆ complex model for X, although it is usually an extremely large
object compared to X, often with uncountably many simplices in each dimension.
Cycles in singular homology are deﬁned algebraically, but they can be given a
somewhat more geometric interpretation in terms of maps from ﬁnite ∆ complexes.
To see this, note ﬁrst that a singular n chain ξ can always be written in the form
¸
i
ε
i
σ
i
with ε
i
= :1, allowing repetitions of the singular n simplices σ
i
, so we shall
assume this has been done. Given such an n chain ξ =
¸
i
ε
i
σ
i
, when we compute
∂ξ as a sum of singular (n − 1) simplices with signs :1, there may be some can
celling pairs consisting of two identical singular (n−1) simplices with opposite signs.
Choosing a maximal collection of such cancelling pairs, construct an n dimensional
∆ complex K
ξ
from a disjoint union of n simplices ∆
n
i
, one for each σ
i
, by identi
fying the pairs of (n − 1) dimensional faces corresponding to the chosen cancelling
Section 2.1. Simplicial and Singular Homology 109
pairs. The σ
i
’s then induce a map K
ξ
→X. If ξ is a cycle, all the (n−1) simplices of
K
ξ
come fromcancelling pairs, hence are faces of exactly two n simplices of K
ξ
. Thus
K
ξ
is a manifold, locally homeomorphic to R
n
, except at a subcomplex of dimension
at most n−2. All the n simplices of K
ξ
can be coherently oriented by taking the signs
of the σ
i
’s into account, so K
ξ
is actually an oriented manifold away from its non
manifold points — though to make this statement rigorous would take a considerable
effort, using heavy machinery from §3.3. (Parenthetical remark: A closer inspection
shows that K
ξ
is also a manifold near points in the interiors of (n−2) simplices, so
the nonmanifold points of K
ξ
in fact have dimension at most n − 3. However, near
the interiors of (n−3) simplices it can very well happen that K
ξ
is not a manifold.)
In particular, elements of H
1
(X) are represented by collections of oriented loops
in X, and elements of H
2
(X) are represented by maps of closed oriented surfaces
into X. With a bit more work it can be shown that an oriented 1 cycle
¸
α
S
1
α
→X is
zero in H
1
(X) iff it extends to a map of an oriented surface into X, and there is an
analogous statement for 2 cycles. In the early days of homology theory it may have
been believed, or at least hoped, that this close connection with manifolds continued
in all higher dimensions, but this has turned out not to be the case. There is a sort
of homology theory built from manifolds, called bordism, but it is quite a bit more
complicated than the homology theory we are studying here.
After these preliminary remarks let us begin to see what can be proved about
singular homology.
Proposition 2.6. If the pathcomponents of X are denoted X
α
, then H
n
(X) splits as
the direct sum
¸
α
H
n
(X
α
).
Proof: Since a singular simplex always has pathconnected image, C
n
(X) splits as the
direct sum of its subgroups C
n
(X
α
). The boundary maps ∂
n
preserve this direct sum
decomposition, taking C
n
(X
α
) to C
n−1
(X
α
), so Ker ∂
n
and Im∂
n+1
split similarly as
direct sums, hence the homology groups also split, H
n
(X) ≈
¸
α
H
n
(X
α
). L¦
Proposition 2.7. If X is nonempty and pathconnected then H
0
(X) ≈ Z. Hence for
any space X, H
0
(X) is a direct sum of Z’s, one for each pathcomponent of X.
Proof: By deﬁnition, H
0
(X) = C
0
(X)/ Im∂
1
since ∂
0
= 0. Deﬁne a homomorphism
ε : C
0
(X)→Z by ε
¸¸
i
n
i
σ
i
=
¸
i
n
i
. This is obviously surjective if X is nonempty.
The claim is that Ker ε = Im∂
1
if X is pathconnected, and hence ε induces an iso
morphism H
0
(X) ≈ Z.
To verify the claim, observe ﬁrst that Im∂
1
⊂ Ker ε since for a singular 1 simplex
σ : ∆
1
→X we have ε∂
1
(σ) = ε(σ ¦
¦[v
1
] − σ ¦
¦[v
0
]) = 1 − 1 = 0. For the reverse
inclusion Ker ε ⊂ Im∂
1
, suppose ε
¸¸
i
n
i
σ
i
= 0, i.e.,
¸
i
n
i
= 0. Here the σ
i
’s are
singular 0 simplices, i.e., points of X. Choose a path τ
i
froma basepoint x
0
to σ
i
(v
0
)
and let σ
0
be the singular 0 simplex with image x
0
. Regarding the τ
i
’s as singular
110 Chapter 2. Homology
1 simplices, we have ∂
¸¸
i
n
i
τ
i
=
¸
i
n
i
σ
i
−
¸
i
n
i
σ
0
=
¸
i
n
i
σ
i
since
¸
i
n
i
= 0. Thus
¸
i
n
i
σ
i
is a boundary, which shows that Ker ε ⊂ Im∂
1
. L¦
Proposition 2.8. If X is a point, then H
n
(X) = 0 for n > 0 and H
0
(X) ≈ Z.
Proof: In this case there is a unique singular n simplex σ
n
for each n, and ∂(σ
n
) =
¸
i
(−1)
i
σ
n−1
, a sum of n+1 terms, which is therefore 0 for n odd and σ
n−1
for n
even, n ≠ 0. Thus we have the chain complex
··· →Z
≈
→Z
0
→Z
≈
→Z
0
→Z →0
with boundary maps alternately isomorphisms and trivial maps, except at the last Z.
The homology groups of this complex are trivial except for H
0
≈ Z. L¦
It is often very convenient to have a slightly modiﬁed version of homology for
which a point has trivial homology groups in all dimensions, including zero. This is
done by deﬁning the reduced homology groups
`
H
n
(X) to be the homology groups
of the augmented chain complex
··· →C
2
(X)
∂
2
→C
1
(X)
∂
1
→C
0
(X)
ε
→Z →0
where ε
¸¸
i
n
i
σ
i
=
¸
i
n
i
as in the proof of Proposition 2.7. Here we had better
require X to be nonempty, to avoid having a nontrivial homology group in dimension
−1. Since ε∂
1
= 0, ε vanishes on Im∂
1
and hence induces a map H
0
(X)→Z with
kernel
`
H
0
(X), so H
0
(X) ≈
`
H
0
(X)⊕Z. Obviously H
n
(X) ≈
`
H
n
(X) for n > 0.
Formally, one can think of the extra Z in the augmented chain complex as gener
ated by the unique map [∅]→X where [∅] is the empty simplex, with no vertices.
The augmentation map ε is then the usual boundary map since ∂[v
0
] = [ v
0
] = [∅].
Readers who know about the fundamental group π
1
(X) may wish to digress here
to look at §2.A where it is shown that H
1
(X) is the abelianization of π
1
(X) for all
pathconnected spaces X. This result will not be needed elsewhere in the chapter,
however.
Homotopy Invariance
The ﬁrst substantial result we will prove about singular homology is that ho
motopy equivalent spaces have isomorphic homology groups. This will be done by
showing that a map f : X→Y induces a homomorphism f
∗
: H
n
(X)→H
n
(Y) for each
n, and that f
∗
is an isomorphism if f is a homotopy equivalence.
For a map f : X→Y , an induced homomorphism f
: C
n
(X)→C
n
(Y) is deﬁned
by composing each singular n simplex σ : ∆
n
→X with f to get a singular n simplex
f
(σ) = fσ : ∆
n
→Y , then extending f
linearly via f
¸¸
i
n
i
σ
i
=
¸
i
n
i
f
(σ
i
) =
¸
i
n
i
fσ
i
. The maps f
: C
n
(X)→C
n
(Y) satisfy f
∂ = ∂f
since
f
∂(σ) = f
¸¸
i
(−1)
i
σ¦
¦[v
0
, ··· , v
i
, ··· , v
n
]
=
¸
i
(−1)
i
fσ¦
¦[v
0
, ··· , v
i
, ··· , v
n
] = ∂f
(σ).
Section 2.1. Simplicial and Singular Homology 111
Thus we have a diagram
−
−
−
−
−
→
−
−
−
−
−
→
−−−−−−−→ −−−−−−−→ −−−−−−−→ −−−−−−−→
f
f
f
X C
n 1
( )
+
−
−
−
−
−
→
X C
n 1
( ) X C
n
( )
∂ ∂
. . . . . .
−−−−−−−→ −−−−−−−→ −−−−−−−→ −−−−−−−→
Y C
n 1
( )
+
Y C
n 1
( ) Y C
n
( )
∂ ∂
. . . . . .
such that in each square the composition f
∂ equals the composition ∂f
. A diagram
of maps with the property that any two compositions of maps starting at one point in
the diagram and ending at another are equal is called a commutative diagram. In the
present case commutativity of the diagramis equivalent to the commutativity relation
f
∂ = ∂f
, but commutative diagrams can contain commutative triangles, pentagons,
etc., as well as commutative squares.
The fact that the maps f
: C
n
(X)→C
n
(Y) satisfy f
∂ = ∂f
is also expressed
by saying that the f
’s deﬁne a chain map from the singular chain complex of X
to that of Y . The relation f
∂ = ∂f
implies that f
takes cycles to cycles since
∂α = 0 implies ∂(f
α) = f
(∂α) = 0. Also, f
takes boundaries to boundaries
since f
(∂β) = ∂(f
β). Hence f
induces a homomorphism f
∗
: H
n
(X)→H
n
(Y). An
algebraic statement of what we have just proved is:
Proposition 2.9. A chain map between chain complexes induces homomorphisms
between the homology groups of the two complexes. L¦
Two basic properties of induced homomorphisms which are important in spite
of being rather trivial are:
(i) (fg)
∗
= f
∗
g
∗
for a composed mapping X
g
→Y
f
→Z. This follows from
associativity of compositions ∆
n
σ
→X
g
→Y
f
→Z.
(ii) 11
∗
= 11 where 11 denotes the identity map of a space or a group.
Less trivially, we have:
Theorem 2.10. If two maps f, g : X→Y are homotopic, then they induce the same
homomorphism f
∗
= g
∗
: H
n
(X)→H
n
(Y).
In view of the formal properties (fg)
∗
= f
∗
g
∗
and 11
∗
= 11, this immediately
implies:
Corollary 2.11. The maps f
∗
: H
n
(X)→H
n
(Y) induced by a homotopy equivalence
f : X→Y are isomorphisms for all n. L¦
For example, if X is contractible then
`
H
n
(X) = 0 for all n.
Proof of 2.10: The essential ingredient is a procedure for subdividing the product
∆
n
×I into (n+1) simplices, as illustrated below in the cases n = 1, 2.
112 Chapter 2. Homology
v
w w
v
0
v
0 1
v
1
v
2
1 w
1
w
2
0
w
0
In ∆
n
×I , let ∆
n
×¦0¦ = [v
0
, ··· , v
n
] and ∆
n
×¦1¦ = [w
0
, ··· , w
n
], where v
i
and
w
i
have the same image under the projection ∆
n
×I→∆
n
. Then the n simplex
[v
0
, ··· , v
i
, w
i+1
, ··· , w
n
] is the graph of the linear function ϕ
i
: ∆
n
→I deﬁned in
barycentric coordinates by ϕ
i
(t
0
, ··· , t
n
) = t
i+1
+ ··· + t
n
since the vertices of this
simplex [v
0
, ··· , v
i
, w
i+1
, ··· , w
n
] are on the graph of ϕ
i
and the simplex projects
homeomorphically onto ∆
n
under the projection ∆
n
×I→∆
n
. The graph of ϕ
i
lies
below the graph of ϕ
i−1
since ϕ
i
≤ ϕ
i−1
, and the region between these two graphs
is [v
0
, ··· , v
i
, w
i
, ··· , w
n
], which is a genuine (n + 1) simplex since w
i
is not on
the graph of ϕ
i
, hence is not in the n simplex [v
0
, ··· , v
i
, w
i+1
, ··· , w
n
]. From the
string of inequalities 0 = ϕ
n
≤ ϕ
n−1
≤ ··· ≤ ϕ
0
≤ ϕ
−1
= 1 we deduce that ∆
n
×I
is the union of the (n + 1) simplices [v
0
, ··· , v
i
, w
i
, ··· , w
n
], each intersecting the
next in an n simplex face.
Given a homotopy F : X×I→Y from f to g, we can deﬁne prism operators
P : C
n
(X)→C
n+1
(Y) by
P(σ) =
¸
i
(−1)
i
F ◦ (σ×11)¦
¦[v
0
, ··· , v
i
, w
i
, ··· , w
n
]
for σ : ∆
n
→X, where F ◦ (σ×11) is the composition ∆
n
×I→X×I→Y . We will show
that these prism operators satisfy the basic relation
∂P = g
−f
−P∂
Geometrically, the left side of this equation represents the boundary of the prism, and
the three terms on the right side represent the top ∆
n
×¦1¦, the bottom ∆
n
×¦0¦, and
the sides ∂∆
n
×I of the prism. To prove the relation we calculate
∂P(σ) =
¸
j≤i
(−1)
i
(−1)
j
F◦(σ×11)¦
¦[v
0
, ··· , v
j
, ··· , v
i
, w
i
, ··· , w
n
]
+
¸
j≥i
(−1)
i
(−1)
j+1
F◦(σ×11)¦
¦[v
0
, ··· , v
i
, w
i
, ··· , w
j
, ··· , w
n
]
The terms with i = j in the two sums cancel except for F ◦ (σ×11)¦
¦[ v
0
, w
0
, ··· , w
n
]
which is g◦ σ = g
(σ), and −F ◦ (σ×11)¦
¦[v
0
, ··· , v
n
, w
n
] which is −f ◦ σ = −f
(σ).
The terms with i ≠ j are exactly −P∂(σ) since
P∂(σ) =
¸
i<j
(−1)
i
(−1)
j
F◦(σ×11)¦
¦[v
0
, ··· , v
i
, w
i
, ··· , w
j
, ··· , w
n
]
+
¸
i>j
(−1)
i−1
(−1)
j
F◦(σ×11)¦
¦[v
0
, ··· , v
j
, ··· , v
i
, w
i
, ··· , w
n
]
Section 2.1. Simplicial and Singular Homology 113
Now we can ﬁnish the proof of the theorem. If α ∈ C
n
(X) is a cycle, then g
(α)−
f
(α) = ∂P(α) +P∂(α) = ∂P(α) since ∂α = 0. Thus g
(α) −f
(α) is a boundary, so
g
(α) and f
(α) determine the same homology class, which means that g
∗
equals
f
∗
on the homology class of α. L¦
The relationship ∂P +P∂ = g
−f
is expressed by saying P is a chain homotopy
between the chain maps f
and g
. We have just shown:
Proposition 2.12. Chainhomotopic chain maps induce the same homomorphismon
homology. L¦
There are also induced homomorphisms f
∗
:
`
H
n
(X)→
`
H
n
(Y) for reduced homol
ogy groups since f
ε = εf
. The properties of induced homomorphisms we proved
above hold equally well in the setting of reduced homology, with the same proofs.
Exact Sequences, Relative Homology, and Excision
It would certainly be nice if there were a simple relationship between the homol
ogy groups of a space and the homology groups of a subspace, for then one could
hope to understand the homology groups of spaces which can be built up from succe
sively more complicated subspaces. Perhaps the nicest possible relationship between
the homology groups of a space X and a subspace A would be that H
n
(X) con
tains H
n
(A) as a subgroup, with the quotient group H
n
(X)/H
n
(A) isomorphic to
H
n
(X/A). While this does hold in some cases, it is much too simplistic a model to
hold in general. For example, every space X can be embedded as a subspace of a
space with trivial homology groups, namely the cone CX = (X×I)/(X×¦0¦), which
is contractible, so if this model were valid, all spaces would have trivial homology.
The surprising thing is that one doesn’t have to retreat too far from this simple model
to get a statement which holds in fair generality. Naturally a more complicated rela
tionship between H
n
(X) and H
n
(A) is involved, and one aspect of this complication
is that different values of n are intertwined, but this is also an advantage in that it
sometimes allows higherdimensional homology groups to be computed in terms of
lowerdimensional groups, which may be simpler.
In order to formulate the relationship we are looking for, we need an algebraic
deﬁnition which is central to algebraic topology. A sequence of homomorphisms
··· →A
n+1
αn+1
→A
n
αn
→A
n−1
→···
is said to be exact if Ker α
n
= Imα
n+1
for each n. The inclusions Imα
n+1
⊂ Ker α
n
are equivalent to α
n
α
n+1
= 0, so the sequence is a chain complex, and the opposite
inclusions Ker α
n
⊂ Imα
n+1
say that the homology groups of this chain complex are
trivial.
A number of basic algebraic concepts can be expressed in terms of exact se
quences, for example:
114 Chapter 2. Homology
(i) 0 →A
α
→B is exact iff Ker α = 0 i.e., α is injective.
(ii) A
α
→B →0 is exact iff Imα = B i.e., α is surjective.
(iii) 0 →A
α
→B →0 is exact iff α is an isomorphism, by (i) and (ii).
(iv) 0 →A
α
→B
β
→C →0 is exact iff α is injective, β is surjective, and Ker β =
Imα, so β induces an isomorphism C ≈ B/ Imα. This can be written C ≈ B/A if
we think of α as an inclusion of A as a subgroup of B.
An exact sequence 0→A→B→C→0 as in (iv) is called a short exact sequence.
Exact sequences provide the right tool to relate the homology groups of a space,
a subspace, and the associated quotient space:
Theorem 2.13. If X is a space and A is a nonempty closed subspace which is a
deformation retract of some neighborhood in X, then there is an exact sequence
··· →
`
H
n
(A)
i
∗
→
`
H
n
(X)
j
∗
→
`
H
n
(X/A)
∂
→
`
H
n−1
(A)
i
∗
→
`
H
n−1
(X) →···
··· →
`
H
0
(X/A) →0
where i is the inclusion A
X and j is the quotient map X→X/A.
The map ∂ will be constructed in the course of the proof. The idea is that an
element x ∈
`
H
n
(X/A) can be represented by a chain α in X with ∂α a cycle in A
whose homology class is ∂x ∈
`
H
n−1
(A).
Pairs of spaces (X, A) satisfying the hypothesis of the theorem we will call good
pairs. For example, if X is a CW complex and A is a nonempty subcomplex, then
(X, A) is a good pair by Proposition A.5 in the Appendix.
Corollary 2.14.
`
H
n
(S
n
) ≈ Z and
`
H
i
(S
n
) = 0 for i ≠ n.
Proof: Take (X, A) = (D
n
, S
n−1
) so X/A = S
n
. The long exact sequence of homology
groups for the pair (X, A) has every third term
`
H
i
(D
n
) zero since D
n
is contractible.
Exactness of the sequence then implies that the maps
`
H
i
(S
n
)
∂
→
`
H
i−1
(S
n−1
) are
isomorphims for all i and n. The result now follows by induction on n, starting with
the case of S
0
, where the result holds by Propositions 2.6 and 2.8. L¦
As a corollary of this calculation we have the following classical theorem of
Brouwer, the 2 dimensional case of which was proved in §1.1.
Corollary 2.15. ∂D
n
is not a retract of D
n
. Hence every map f : D
n
→D
n
has a
ﬁxed point.
Proof: If r : D
n
→∂D
n
were a retraction, we would have ri = 11 for i : ∂D
n
→D
n
the
inclusion map, hence the composition
`
H
n−1
(∂D
n
)
i
∗
→
`
H
n−1
(D
n
)
r
∗
→
`
H
n−1
(∂D
n
)
would be the identity map on
`
H
n−1
(∂D
n
) ≈ Z. But r
∗
and i
∗
are both 0 since
`
H
n−1
(D
n
) = 0, and we have a contradiction. The ﬁxedpoint result follows as in
Theorem 1.9. L¦
Section 2.1. Simplicial and Singular Homology 115
The derivation of the exact sequence in the preceding theoremwill be rather a long
story. We will in fact derive a more general exact sequence which holds for arbitrary
pairs (X, A), but with the homology groups of the quotient space X/A replaced by
relative homology groups, denoted H
n
(X, A). These turn out to be quite useful for
many other purposes as well.
Relative Homology Groups
It sometimes happens that by ignoring a certain amount of structure one obtains a
simpler, more ﬂexible theory which, almost paradoxically, can give results not readily
obtainable in the original setting. A familiar instance of this is arithmetic mod n,
where one ignores multiples of n. Relative homology is another example. In this case
what one ignores is all singular chains in a subspace of the given space.
Here are the deﬁnitions. Given a space X and a subspace A ⊂ X, deﬁne C
n
(X, A)
to be the quotient group C
n
(X)/C
n
(A). Thus chains in A are regarded as trivial.
Since the boundary map ∂ : C
n
(X)→C
n−1
(X) takes C
n
(A) to C
n−1
(A), it induces a
quotient boundary map ∂ : C
n
(X, A)→C
n−1
(X, A). The relation ∂
2
= 0 holds for this
quotient map since it holds for the usual boundary map on C
n
(X). So we have a chain
complex
··· →C
n
(X, A)
∂
→C
n−1
(X, A) →···
whose homology groups Ker ∂/ Im∂ are by deﬁnition the relative homology groups
H
n
(X, A).
By considering the deﬁnition of the relative boundary map we see:
— Elements of H
n
(X, A) are represented by relative cycles: n chains α ∈ C
n
(X)
such that ∂α ∈ C
n−1
(A).
— A relative cycle α is trivial in H
n
(X, A) iff it is a relative boundary: α = ∂β +γ
for some β ∈ C
n+1
(X) and γ ∈ C
n
(A).
These properties make precise the intuitive idea that H
n
(X, A) is ‘homology of X
modulo A.’
The quotient C
n
(X)/C
n
(A) could also be viewed as the free abelian subgroup of
C
n
(X) with basis the singular n simplices σ : ∆
n
→X whose image is not contained
in A. However, the boundary map does not take this subgroup of C
n
(X) to the
corresponding subgroup of C
n−1
(X), so it is usually better to regard C
n
(X, A) as a
quotient rather than a subgroup of C
n
(X).
Our goal now is to show that the relative homology groups H
n
(X, A) for any pair
(X, A) ﬁt into a long exact sequence
··· →H
n
(A) →H
n
(X) →H
n
(X, A) →H
n−1
(A) →H
n−1
(X) →···
··· →H
0
(X, A) →0
This will be entirely a matter of algebra. To start the process, consider the diagram
116 Chapter 2. Homology
−
−
−
−
−
→
−
−
−
−
−
→
−−−−−−−→ −−−−−−−→ −−−−−−−→ −−−−−−−→
i j
i j
A A C 0 ( )
−
−
−
−
−
→
X C 0
n n n
( ) X C ( )
∂ ∂ ∂
,
−−−−−−−→ −−−−−−−→ −−−−−−−→ −−−−−−−→
A A C 0 ( ) X C 0
n 1 n 1 n 1
( ) X C ( ) ,
where i is inclusion and j is the quotient map. The diagramis commutative by the def
inition of the boundary maps. Letting n vary, and drawing these short exact sequences
vertically rather than horizontally, we have a large commutative diagram of the form
shown at the right, where the columns are ex
act and the rows are chain complexes
which we denote A, B, and C. Such
−−−−−→
−−−−−→
−−−−−−−→ −−−−−−−→ −−−−−−−→ −−−−−−−→
j j j
B
n 1 +
−−−−−→
B
n 1
B
n
∂ ∂
. . . . . .
−−−−−→
−−−−−→
−−−−−−−→ −−−−−−−→ −−−−−−−→ −−−−−−−→
C
n 1 +
−−−−−→
−−−−−→
−−−−−→
−−−−−→
C
n 1
C
n
∂ ∂
. . . . . .
−−−−−→
−−−−−→
−−−−−−−→ −−−−−−−→ −−−−−−−→ −−−−−−−→
i i i
A
n 1 +
−−−−−→
A
n 1
A
0 0 0
0 0 0
n
∂ ∂
. . . . . .
a diagram is called a short exact se
quence of chain complexes. We will
showthat when we pass to homology
groups, this short exact sequence of
chain complexes stretches out into a
long exact sequence of homology groups
··· →H
n
(A)
i
∗
→H
n
(B)
j
∗
→H
n
(C)
∂
→H
n−1
(A)
i
∗
→H
n−1
(B) →···
where H
n
(A) denotes the homology group Ker ∂/ Im∂ at A
n
in the chain complex A,
and H
n
(B) and H
n
(C) are deﬁned similarly.
The commutativity of the squares in the short exact sequence of chain complexes
means that i and j are chain maps. These therefore induce maps i
∗
and j
∗
on
homology. To deﬁne the boundary map ∂ : H
n
(C)→H
n−1
(A), let c ∈ C
n
be a cycle.
Since j is onto, c = j(b) for some b ∈ B
n
. The element ∂b ∈ B
n−1
is in Ker j since j(∂b) = ∂j(b) = ∂c = 0. So ∂b = i(a) for some
a ∈ A
n−1
since Ker j = Imi. Note that ∂a = 0 since i(∂a) =
∂i(a) = ∂∂b = 0 and i is injective. We deﬁne ∂ : H
n
(C)→H
n−1
(A)
by sending the homology class of c to the homology class of a,
∂[c] = [a]. This is welldeﬁned since:
C
n
B B
n
A
n 1
n 1
−−→
−
−
−
→
−
−
−
→
−
−
−
→
a
b b
c
∂
∂
−−−→
−
−
−
→
i
j
— The element a is uniquely determined by ∂b since i is injective.
— A different choice b
¹
for b would have j(b
¹
) = j(b), so b
¹
−b is in Ker j = Imi,
b
¹
− b = i(a
¹
) for some a
¹
, and b
¹
= b + i(a
¹
). The effect of replacing b by
b +i(a
¹
) is to change a to the homologous element a +∂a
¹
since i(a +∂a
¹
) =
i(a) +i(∂a
¹
) = ∂b +∂i(a
¹
) = ∂(b +i(a
¹
)).
— A different choice of c within its homology class would have the form c + ∂c
¹
.
Since c
¹
= j(b
¹
) for some b
¹
, we then have c + ∂c
¹
= c + ∂j(b
¹
) = c + j(∂b
¹
) =
j(b + ∂b
¹
), so b is replaced by b + ∂b
¹
, which leaves ∂b and therefore also a
unchanged.
The map ∂ : H
n
(C)→H
n−1
(A) is a homomorphism since if ∂[c
1
] = [a
1
] and ∂[c
2
] =
Section 2.1. Simplicial and Singular Homology 117
[a
2
] via elements b
1
and b
2
as above, then j(b
1
+b
2
) = j(b
1
) +j(b
2
) = c
1
+c
2
and
i(a
1
+a
2
) = i(a
1
) +i(a
2
) = ∂b
1
+∂b
2
= ∂(b
1
+b
2
) so ∂([c
1
] +[c
2
]) = [a
1
] +[a
2
].
Theorem 2.16. The sequence of homology groups
··· →H
n
(A)
i
∗
→H
n
(B)
j
∗
→H
n
(C)
∂
→H
n−1
(A)
i
∗
→H
n−1
(B) →···
is exact.
Proof: There are six things to verify:
Imi
∗
⊂ Ker j
∗
. This is immediate since ji = 0 implies j
∗
i
∗
= 0.
Imj
∗
⊂ Ker ∂. We have ∂j
∗
= 0 since in this case ∂b = 0 in the deﬁnition of ∂.
Im∂ ⊂ Ker i
∗
. Here i
∗
∂ = 0 since i
∗
∂ takes [c] to [∂b] = 0.
Ker j
∗
⊂ Imi
∗
. A homology class in Ker j
∗
is represented by a cycle b ∈ B
n
with
j(b) a boundary, so j(b) = ∂c
¹
for some c
¹
∈ C
n+1
. Since j is surjective, c
¹
= j(b
¹
)
for some b
¹
∈ B
n+1
. We have j(b − ∂b
¹
) = j(b) − j(∂b
¹
) = j(b) − ∂j(b
¹
) = 0 since
∂j(b
¹
) = ∂c
¹
= j(b). So b − ∂b
¹
= i(a) for some a ∈ A
n
. This a is a cycle since
i(∂a) = ∂i(a) = ∂(b−∂b
¹
) = ∂b = 0 and i is injective. Thus i
∗
[a] = [b−∂b
¹
] = [b],
showing that i
∗
maps onto Ker j
∗
.
Ker ∂ ⊂ Imj
∗
. In the notation used in the deﬁnition of ∂, if c represents a homology
class in Ker ∂, then a = ∂a
¹
for some a
¹
∈ A
n
. The element b − i(a
¹
) is a cycle
since ∂(b − i(a
¹
)) = ∂b − ∂i(a
¹
) = ∂b − i(∂a
¹
) = ∂b − i(a) = 0. And j(b − i(a
¹
)) =
j(b) −ji(a
¹
) = j(b) = c, so j
∗
maps [b −i(a
¹
)] to [c].
Ker i
∗
⊂ Im∂. Given a cycle a ∈ A
n−1
such that i(a) = ∂b for some b ∈ B
n
, then
j(b) is a cycle since ∂j(b) = j(∂b) = ji(a) = 0, and ∂ takes [j(b)] to [a]. L¦
This theorem represents the beginnings of the subject of homological algebra.
The method of proof is sometimes called diagram chasing.
Returning to topology, the preceding algebraic theorem yields a long exact se
quence of homology groups:
··· →H
n
(A)
i
∗
→H
n
(X)
j
∗
→H
n
(X, A)
∂
→H
n−1
(A)
i
∗
→H
n−1
(X) →···
··· →H
0
(X, A) →0
The boundary map ∂ : H
n
(X, A)→H
n−1
(A) has a very simple description: If a class
[α] ∈ H
n
(X, A) is represented by a relative cycle α, then ∂[α] is the class of the
cycle ∂α in H
n−1
(A). This is immediate from the algebraic deﬁnition of the boundary
homomorphism in the long exact sequence of homology groups associated to a short
exact sequence of chain complexes.
This long exact sequence makes precise the idea that the groups H
n
(X, A) mea
sure the difference between the groups H
n
(X) and H
n
(A). In particular, exactness
118 Chapter 2. Homology
implies that if H
n
(X, A) = 0 for all n, then the inclusion A
X induces isomorphisms
H
n
(A) ≈ H
n
(X) for all n, by the remark (iii) following the deﬁnition of exactness. The
converse is also true according to an exercise at the end of this section.
There is a completely analogous long exact sequence of reduced homology groups
for a pair (X, A) with A ≠ ∅. This comes from applying the preceding algebraic ma
chinery to the short exact sequence of chain complexes formed by the short exact se
quences 0→C
n
(A)→C
n
(X)→C
n
(X, A)→0 in nonnegative dimensions, augmented
by the short exact sequence 0 →Z
11
→Z →0 →0 in dimension −1. In particular
this means that
`
H
n
(X, A) is the same as H
n
(X, A) for all n, when A ≠ ∅.
Example 2.17. When (X, A) = (D
n
, ∂D
n
) the long exact sequence of reduced homol
ogy groups implies that H
k
(D
n
, ∂D
n
) ≈
`
H
k−1
(S
n−1
) for all k since
`
H
k
(D
n
) = 0 for
all k. Thus
H
k
(D
n
, ∂D
n
) ≈
Z for k = n
0 otherwise.
Example 2.18. Applying the long exact sequence of reduced homology groups to a
pair (X, x
0
) with x
0
∈ X yields isomorphisms H
n
(X, x
0
) ≈
`
H
n
(X) for all n since
`
H
n
(x
0
) = 0 for all n.
There are induced homomorphisms for relative homology just as there are in the
nonrelative, or ‘absolute,’ case. A map f : X→Y with f(A) ⊂ B, or more concisely
f : (X, A)→(Y, B), induces homomorphisms f
: C
n
(X, A)→C
n
(Y, B) since the chain
map f
: C
n
(X)→C
n
(Y) takes C
n
(A) to C
n
(B), so we get a welldeﬁned map on quo
tients, f
: C
n
(X, A)→C
n
(Y, B). The relation f
∂ = ∂f
holds for relative chains since
it holds for absolute chains. By Proposition 2.9 we then have induced homomorphisms
f
∗
: H
n
(X, A)→H
n
(Y, B).
Proposition 2.19. If two maps f, g : (X, A)→(Y, B) are homotopic through maps of
pairs (X, A)→(Y, B), then f
∗
= g
∗
: H
n
(X, A)→H
n
(Y, B).
Proof: The prismoperator P fromthe proof of Theorem2.10 takes C
n
(A) to C
n+1
(B),
hence induces a relative prism operator P : C
n
(X, A)→C
n+1
(Y, B). Since we are just
passing to quotient groups, the formula ∂P + P∂ = g
− f
remains valid. Thus the
maps f
and g
on relative chain groups are chain homotopic, and hence they induce
the same homomorphism on relative homology groups. L¦
An easy generalization of the long exact sequence of a pair (X, A) is the long
exact sequence of a triple (X, A, B), where B ⊂ A ⊂ X:
··· →H
n
(A, B) →H
n
(X, B) →H
n
(X, A) →H
n−1
(A, B) →···
This is the long exact sequence of homology groups associated to the short exact
sequence of chain complexes which in dimension n is the short exact sequence
0 →C
n
(A, B) →C
n
(X, B) →C
n
(X, A) →0
Section 2.1. Simplicial and Singular Homology 119
For example, taking B to be a point, the long exact sequence of the triple (X, A, B)
becomes the long exact sequence of reduced homology for the pair (X, A).
Excision
A fundamental property of relative homology groups is given by the following
Excision Theorem, describing when the relative groups H
n
(X, A) are unaffected by
deleting, or excising, a subset Z ⊂ A.
Theorem 2.20. Given subspaces Z ⊂ A ⊂ X such that the closure of Z is contained
in the interior of A, then the inclusion (X − Z, A − Z)
(X, A) induces isomor
phisms H
n
(X−Z, A−Z)→H
n
(X, A) for all n. Equivalently, for subspaces A, B ⊂ X
whose interiors cover X, the inclusion (B, A ∩ B)
(X, A) induces isomorphisms
H
n
(B, A∩B)→H
n
(X, A) for all n.
A
Z
X
The translation between the two versions is obtained by tak
ing Z and B to be complementary subspaces of X, so Z = X−B
and B = X −Z, hence A∩B = A−Z. The condition cl Z ⊂ int A
is equivalent to X = int A∪int B since X −int B = cl Z.
The proof of the excision theorem will involve a rather lengthy technical detour
involving a construction known as barycentric subdivision, which allows homology
groups to be computed using small singular simplices. In a metric space ‘smallness’
can be deﬁned in terms of diameters, but for general spaces it will be deﬁned in terms
of covers.
For a space X, let 1 = ¦U
j
¦ be a collection of subspaces of X whose interiors
form an open cover of X, and let C
1
n
(X) be the subgroup of C
n
(X) consisting of
chains
¸
i
n
i
σ
i
such that each σ
i
has image contained in some set in the cover 1. The
boundary map ∂ : C
n
(X)→C
n−1
(X) takes C
1
n
(X) to C
1
n−1
(X), so the groups C
1
n
(X)
form a chain complex. We denote the homology groups of this chain complex by
H
1
n
(X).
Proposition 2.21. The inclusion ι : C
1
n
(X)
C
n
(X) is a chain homotopy equivalence,
i.e., there is a chain map ρ : C
n
(X)→C
1
n
(X) such that ιρ and ρι are chain homotopic
to the identity. Hence ι induces isomorphisms H
1
n
(X) ≈ H
n
(X) for all n.
Proof: The barycentric subdivision process will be performed at four levels, beginning
with the most geometric and becoming increasingly algebraic.
1. Barycentric Subdivision of Simplices. The points of a simplex [v
0
, ··· , v
n
] are the
linear combinations
¸
i
t
i
v
i
with
¸
i
t
i
= 1 and t
i
≥ 0 for each i. The barycenter or
‘center of gravity’ of the simplex [v
0
, ··· , v
n
] is the point b =
¸
i
t
i
v
i
whose barycen
tric coordinates t
i
are all equal, namely t
i
= 1/(n + 1) for each i. The barycentric
subdivision of [v
0
, ··· , v
n
] is the decomposition of [v
0
, ··· , v
n
] into the n simplices
[b, w
0
, ··· , w
n−1
] where, inductively, [w
0
, ··· , w
n−1
] is an (n − 1) simplex in the
120 Chapter 2. Homology
barycentric subdivision of a face [v
0
, ··· , v
i
, ··· , v
n
]. The induction starts with n = 0
when the barycentric subdivision of [v
0
] is deﬁned to be just
[v
0
] itself. The ﬁgure shows the
next two cases n = 1, 2 and
v v
0
v
b
b
b
0
1
v
2
v
1
v
0
v
1
v
2
v
3
part of the case n = 3.
It follows from the inductive deﬁnition that the vertices of simplices in the barycen
tric subdivision of [v
0
, ··· , v
n
] are the barycenters of all the k dimensional faces
[v
i
0
, ··· , v
i
k
] of [v
0
, ··· , v
n
] for 0 ≤ k ≤ n. When k = 0 this gives the original ver
tices v
i
since the barycenter of a 0 simplex is itself. The barycenter of [v
i
0
, ··· , v
i
k
]
has barycentric coordinates t
i
= 1/(k +1) for i = i
0
, ··· , i
k
and t
i
= 0 otherwise.
The n simplices of the barycentric subdivision of ∆
n
, together with all their faces,
do in fact form a ∆ complex structure on ∆
n
, indeed a simplicial complex structure,
though we shall not need to know this in what follows.
A fact we will need is that the diameter of each simplex of the barycentric subdivi
sion of [v
0
, ··· , v
n
] is at most n/(n+1) times the diameter of [v
0
, ··· , v
n
]. Here the
diameter of a simplex is by deﬁnition the maximum distance between any two of its
points, and we are using the metric from the ambient Euclidean space R
m
containing
[v
0
, ··· , v
n
]. The diameter of a simplex equals the maximum distance between any
of its vertices because the distance between two points v and
¸
i
t
i
v
i
of [v
0
, ··· , v
n
]
satisﬁes the inequality
(∗)
¸
¸
v −
¸
i
t
i
v
i
¸
¸
=
¸
¸
¸
i
t
i
(v −v
i
)
¸
¸
≤
¸
i
t
i
¦v −v
i
¦ ≤
¸
i
t
i
max ¦v −v
i
¦ = max ¦v −v
i
¦
To obtain the bound n/(n+1) on the ratio of diameters, we therefore need to verify
that the distance between any two vertices w
j
and w
k
of a simplex [w
0
, ··· , w
n
] of
the barycentric subdivision of [v
0
, ··· , v
n
] is at most n/(n + 1) times the diameter
of [v
0
, ··· , v
n
]. If neither w
i
nor w
j
is the barycenter b of [v
0
, ··· , v
n
], then these
two points lie in a proper face of [v
0
, ··· , v
n
] and we are done by induction on n. So
we may suppose w
j
, say, is the barycenter b, and then by (∗) we may take w
k
to
be a vertex v
i
. Let b
i
be the barycenter of [v
0
, ··· , v
i
, ··· , v
n
], with all barycentric
coordinates equal to 1/n except for t
i
= 0. Then we have
b =
1
n+1
v
i
+
n
n+1
b
i
. The sum of the two coefﬁcients is b b
v
i
i
1, so b lies on the line segment [v
i
, b
i
] from v
i
to b
i
,
and the distance from b to v
i
is n/(n + 1) times the length of [v
i
, b
i
]. Hence the
distance from b to v
i
is bounded by n/(n+1) times the diameter of [v
0
, ··· , v
n
].
The signiﬁcance of the factor n/(n+1) is that by repeated barycentric subdivision
we can produce simplices of arbitrarily small diameter since
¸
n/(n+1)
r
approaches
0 as r goes to inﬁnity. It is important that the bound n/(n+1) does not depend on
Section 2.1. Simplicial and Singular Homology 121
the shape of the simplex since repeated barycentric subdivision produces simplices
of many different shapes.
2. Barycentric Subdivision of Linear Chains. The main part of the proof will be to
construct a subdivision operator S : C
n
(X)→C
n
(X) and show this is chain homotopic
to the identity map. First we will construct S and the chain homotopy in a more
restricted linear setting.
For a convex set Y in some Euclidean space, the linear maps ∆
n
→Y generate
a subgroup LC
n
(Y) of C
n
(Y) consisting of the ‘linear chains.’ The boundary map
∂ : C
n
(Y)→C
n−1
(Y) restricts to a boundary map LC
n
(Y)→LC
n−1
(Y), so we have a
subcomplex of the singular chain complex of Y . We can uniquely designate a linear
map λ: ∆
n
→Y by [w
0
, ··· , w
n
] where w
i
is the image under λ of the i
th
vertex of
∆
n
.
To avoid having to make exceptions for 0 simplices it will be convenient to aug
ment the complex LC(Y) by setting LC
−1
(Y) = Z generated by the empty simplex
[∅], with ∂[w
0
] = [∅] for all 0 simplices [w
0
].
For a point b ∈ Y , deﬁne a homomorphism b: LC
n
(Y)→LC
n+1
(Y) by setting
b([w
0
, ··· , w
n
]) = [b, w
0
, ··· , w
n
]. Applying the usual formula for ∂, we obtain the
relation ∂b([w
0
, ··· , w
n
]) = [w
0
, ··· , w
n
]−b(∂[w
0
, ··· , w
n
]). So ∂b(α) = α−b(∂α)
for all α ∈ LC
n
(Y). Thus ∂b + b∂ = 11, so b can be viewed as a chain homotopy
between the identity map and the zero map on the augmented chain complex LC(Y).
This implies that this complex has trivial homology, which is perhaps not surprising
since Y is convex. In what follows we will only need the formula ∂b+b∂ = 11, however.
Now we deﬁne a subdivision homomorphism S : LC
n
(Y)→LC
n
(Y) by induction
on n. Let λ: ∆
n
→Y be a generator of LC
n
(Y). We also write λ as [w
0
, ··· , w
n
], as
described above. Let b
λ
be the image of the barycenter of ∆
n
under λ. Then the induc
tive formula for S is S(λ) = b
λ
(S∂λ) where b
λ
: LC
n−1
(Y)→LC
n
(Y) is the homomor
phism deﬁned in the preceding paragraph. The induction starts with S([∅]) = [∅],
so S is the identity on LC
−1
(Y). It is also the identity on LC
0
(Y) since when n = 0
the formula for S becomes S([w
0
]) = w
0
(∂[w
0
]) = w
0
([∅]) = [w
0
]. Note also that
when λ is an embedding, with image a genuine n simplex [w
0
, ··· , w
n
], then S(λ)
is a linear combination of the various n simplices in the barycentric subdivision of
[w
0
, ··· , w
n
]. This is apparent by comparing the inductive deﬁnition of S with the
inductive deﬁnition of barycentric subdivision of a simplex.
Let us check that the maps S satisfy ∂S = S∂, and hence give a chain map from
the chain complex LC(Y) to itself. Since S = 11 on LC
0
(Y) and LC
−1
(Y) we certainly
have ∂S = S∂ on LC
0
(Y). The result for larger n is given by the following calculation,
122 Chapter 2. Homology
in which we omit some parentheses to unclutter the formulas:
∂Sλ = ∂
¸
b
λ
(S∂λ)
= S∂λ −b
λ
(∂S∂λ) since ∂b
λ
+b
λ
∂ = 11
= S∂λ −b
λ
(S∂∂λ) by induction on n
= S∂λ since ∂∂ = 0
We next build a chain homotopy T : LC
n
(Y)→LC
n+1
(Y) between S and the iden
tity, ﬁtting into a diagram
−
−
−
−
−
→
−
−
−
−
−
→
−−−−−−−→ −−−−−−−→−
−
−
−
−
−
−
→
−−−−−−−→ −−−−−−−→ −−−−−−−→
S
T
−
−
−
−
−
−
−
→
T
−
−
−
−
−
−
−
→
T
0
S S
Y LC
2
( ) Y LC
1
( ) Y LC
0
( ) Y LC 0
1
( )
−
−
−
−
−
→
S
−
−
−
−
−
→
. . .
−−−−−−−→ −−−−−−−→ −−−−−−−→ −−−−−−−→ −−−−−−−→
Y LC
2
( ) Y LC
1
( ) Y LC
0
( ) Y LC 0
1
( )
. . .
1 1 1 1
We deﬁne T on LC
n
(Y) inductively by setting T = 0 for n = −1 and letting Tλ =
b
λ
(λ − T∂λ) for n ≥ 0. The geometric motivation for this formula is an inductively
deﬁned subdivision of ∆
n
×I obtained by joining all simplices in ∆
n
×¦0¦ ∪ ∂∆
n
×I
to the barycenter of ∆
n
×¦1¦, as indicated in the
ﬁgure in the case n = 2. What T actually does
is take the image of this subdivision under
the projection ∆
n
×I→∆
n
.
The chain homotopy formula ∂T +T∂ = 11−S is trivial on LC
−1
(Y) where T = 0
and S = 11. Verifying the formula on LC
n
(Y) with n ≥ 0 is done by the calculation
∂Tλ = ∂
¸
b
λ
(λ −T∂λ)
= λ −T∂λ −b
λ
¸
∂(λ −T∂λ)
since ∂b
λ
= 11 −b
λ
∂
= λ −T∂λ −b
λ
(S∂λ +T∂∂λ) by induction on n
= λ −T∂λ −Sλ since ∂∂ = 0 and Sλ = b
λ
(S∂λ)
Nowwe are done with inductive arguments, and we can discard the group LC
−1
(Y)
which was used only as a convenience. The relation ∂T +T∂ = 11−S still holds without
LC
−1
(Y) since T was zero on LC
−1
(Y).
3. Barycentric Subdivision of General Chains. Deﬁne S : C
n
(X)→C
n
(X) by Sσ =
σ
S∆
n
for a singular n simplex σ : ∆
n
→X. Since S∆
n
is the sum of the n simplices
in the barycentric subdivision of ∆
n
, with certain signs, Sσ is the corresponding
signed sum of the restrictions of σ to the n simplices of the barycentric subdivision
of ∆
n
. The operator S is a chain map since
∂Sσ = ∂σ
S∆
n
= σ
∂S∆
n
= σ
S∂∆
n
= σ
S
¸¸
i
(−1)
i
∆
n
i
where ∆
n
i
is the i
th
face of ∆
n
=
¸
i
(−1)
i
σ
S∆
n
i
=
¸
i
(−1)
i
S(σ¦
¦∆
n
i
)
= S
¸¸
i
(−1)
i
σ¦
¦∆
n
i
= S(∂σ)
Section 2.1. Simplicial and Singular Homology 123
In similar fashion we deﬁne T : C
n
(X)→C
n+1
(X) by Tσ = σ
T∆
n
, and this gives a
chain homotopy between S and the identity, since the formula ∂T +T∂ = 11−S holds
by the calculation
∂Tσ = ∂σ
T∆
n
= σ
∂T∆
n
= σ
(∆
n
−S∆
n
−T∂∆
n
) = σ −Sσ −σ
T∂∆
n
= σ −Sσ −T(∂σ)
where the last equality follows just as in the previous displayed calculation, with S
replaced by T .
4. Iterated Barycentric Subdivision. A chain homotopy between 11 and the iterate S
m
is given by the operator D
m
=
¸
0≤i<m
TS
i
since
∂D
m
+D
m
∂ =
¸
0≤i<m
¸
∂TS
i
+TS
i
∂
=
¸
0≤i<m
¸
∂TS
i
+T∂S
i
=
¸
0≤i<m
¸
∂T +T∂
S
i
=
¸
0≤i<m
¸
11 −S
S
i
=
¸
0≤i<m
¸
S
i
−S
i+1
= 11 −S
m
For each singular n simplex σ : ∆
n
→X there exists an m such that S
m
(σ) lies in
C
1
n
(X) since the diameter of the simplices of S
m
(∆
n
) will be less than a Lebesgue
number of the cover of ∆
n
by the open sets σ
−1
(int U
j
) if m is large enough. (A
Lebesgue number for an open cover of a compact metric space is a number ε such
that every set of diameter less than ε lies in some set of the cover. The existence of
such a number is shown by an elementary compactness argument.) We cannot expect
the same number m to work for all σ ’s, so let us deﬁne m(σ) to be the smallest m
such that S
m
σ is in C
1
n
(X).
Suppose we deﬁne D: C
n
(X)→C
n+1
(X) by Dσ = D
m(σ)
σ . To see whether D is
a chain homotopy, we manipulate the chain homotopy equation
∂D
m(σ)
σ +D
m(σ)
∂σ = σ −S
m(σ)
σ
into an equation whose left side is ∂Dσ +D∂σ by moving the second term on the left
side to the other side of the equation and adding D∂σ to both sides:
∂Dσ +D∂σ = σ −
¸
S
m(σ)
σ +D
m(σ)
(∂σ) −D(∂σ)
¸
If we deﬁne ρ(σ) to be the expression in brackets in this last equation, then this
equation has the form
(∗) ∂Dσ +D∂σ = σ −ρ(σ)
We claimthat ρ(σ) ∈ C
1
n
(X). This is obvious for the term S
m(σ)
σ . For the remaining
part D
m(σ)
(∂σ) −D(∂σ), note ﬁrst that if σ
j
denotes the restriction of σ to the j
th
face of ∆
n
, then m(σ
j
) ≤ m(σ), so every term TS
i
(σ
j
) in D(∂σ) will be a term in
D
m(σ)
(∂σ). Thus D
m(σ)
(∂σ) − D(∂σ) is a sum of terms TS
i
(σ
j
) with i ≥ m(σ
j
),
and these terms lie in C
1
n
(X) since T takes C
1
n−1
(X) to C
1
n
(X)
We can thus regard the equation (∗) as deﬁning ρ : C
n
(X)→C
1
n
(X). For varying
n these ρ’s form a chain map since (∗) implies ∂ρ(σ) = ∂σ − ∂D∂(σ) = ρ(∂σ).
124 Chapter 2. Homology
The equation (∗) says that ∂D + D∂ = 11 − ιρ for ι : C
1
n
(X)
C
n
(X) the inclusion.
Furthermore, ρι = 11 since D is identically zero on C
1
n
(X), as m(σ) = 0 for σ ∈
C
1
n
(X), hence the summation deﬁning Dσ is empty. Thus we have shown that ρ is
a chain homotopy inverse for ι. L¦
Proof of the Excision Theorem: We prove the second version. For the cover 1 =
¦A, B¦ we introduce the suggestive notation C
n
(A + B) for C
1
n
(X), the sums of
chains in A and chains in B. At the end of the preceding proof we had formu
las ∂D + D∂ = 11 − ιρ and ρι = 11. All the maps appearing in these formulas
take chains in A to chains in A, hence induce quotient maps when we factor out
chains in A. These quotient maps automatically satisfy the same two formulas, so
the inclusion C
n
(A+B)/C
n
(A)
C
n
(X)/C
n
(A) induces an isomorphism on homol
ogy. The map C
n
(B)/C
n
(A ∩ B)→C
n
(A + B)/C
n
(A) induced by inclusion is obvi
ously an isomorphism since both quotient groups are free with basis the singular
n simplices in B which do not lie in A. Hence we obtain the desired isomorphism
H
n
(B, A∩B) ≈ H
n
(X, A), induced by inclusion. L¦
All that remains in the proof of Theorem 2.13 is to replace relative homology
groups with absolute homology groups. This is achieved by the following result.
Proposition 2.22. For good pairs (X, A), the quotient map q : (X, A)→(X/A, A/A)
induces isomorphisms q
∗
: H
n
(X, A)→H
n
(X/A, A/A) ≈
`
H
n
(X/A) for all n.
Proof: Let V be a neighborhood of A in X which deformation retracts onto A. We
have a commutative diagram
A
−
−
−
−
−
→
X H
n
( ) , −−−−−−−→ − − − − − − − →
q
∗
V
−
−
−
−
−
→
X H
n
( ) ,
q
∗
V
−
−
−
−
−
→
X A H
n
( ) ,
q
∗
A
A X/ A A/ H
n
( ) , A X/ A X/ A A/ A A/ A V/ A V/ H
n
( ) , − − − − − → −−−−−→ H
n
( ) ,
The upper left horizontal map is an isomorphism since in the long exact sequence of
the triple (X, V, A) the groups H
n
(V, A) are zero for all n, because a deformation
retraction of V onto A gives a homotopy equivalence of pairs (V, A) = (A, A) and
H
n
(A, A) = 0. The deformation retraction of V onto A induces a deformation retrac
tion of V/A onto A/A, so the same argument shows the lower left horizontal map is
an isomorphism as well. The other two horizontal maps are isomorphisms directly
from excision. The righthand vertical map q
∗
is an isomorphism since q restricts to
a homeomorphism on the complement of A. From the commutativity of the diagram
it follows that the lefthand q
∗
is an isomorphism. L¦
This proposition shows that relative homology can be expressed as reduced abso
lute homology in the case of good pairs (X, A), but in fact there is a way of doing this
for arbitrary pairs. Consider the space X∪CA where CA is the cone (A×I)/(A×¦0¦)
Section 2.1. Simplicial and Singular Homology 125
whose base A×¦1¦ we identify with A ⊂ X. Using terminology intro
p
CA
X
A
duced in Chapter 0, X ∪ CA can also be described as the mapping
cone of the inclusion A
X. The assertion is that H
n
(X, A) is
isomorphic to
`
H
n
(X ∪CA) for all n via the sequence of isomor
phisms
`
H
n
(X ∪CA) ≈ H
n
(X ∪CA, CA) ≈ H
n
(X ∪CA−¦p¦, CA−¦p¦) ≈ H
n
(X, A)
where p ∈ CA is the tip of the cone. The ﬁrst isomorphism comes from the exact
sequence of the pair, using the fact that CA is contractible. The second isomorphism
is excision, and the third isomorphism comes from the deformation retraction of
CA−¦p¦ onto A.
Here is an application of the preceding proposition:
Example 2.23. Let us ﬁnd explicit cycles representing generators of the inﬁnite cyclic
groups H
n
(D
n
, ∂D
n
) and H
n
(S
n
). Instead of (D
n
, ∂D
n
) we can just as well consider
(∆
n
, ∂∆
n
), and we will show by induction on n that the identity map i
n
: ∆
n
→∆
n
,
viewed as a singular nsimplex, is a cycle generating H
n
(∆
n
, ∂∆
n
). That it is a cycle is
clear since we are considering relative homology. When n = 0 it certainly represents
a generator. For the induction step, let Λ ⊂ ∆
n
be the union of all but one of the
(n−1) dimensional faces of ∆
n
. Then we claim there are isomorphisms
H
n
(∆
n
, ∂∆
n
)
≈
→H
n−1
(∂∆
n
, Λ)
≈
← H
n−1
(∆
n−1
, ∂∆
n−1
)
The ﬁrst isomorphism is a boundary map in the long exact sequence of the triple
(∆
n
, ∂∆
n
, Λ), whose third terms H
i
(∆
n
, Λ) are zero since ∆
n
deformation retracts
onto Λ, hence (∆
n
, Λ) = (Λ, Λ). The second isomorphism comes from the preceding
proposition since we are dealing with good pairs and the inclusion ∆
n−1
∂∆
n
as
the face not contained in Λ induces a homeomorphism of quotients ∆
n−1
/∂∆
n−1
≈
∂∆
n
/Λ. The induction step then follows since the cycle i
n
is sent under the ﬁrst
isomorphism to the cycle ∂i
n
which equals :i
n−1
in C
n−1
(∂∆
n
, Λ).
To ﬁnd a cycle generating H
n
(S
n
) let us regard S
n
as two n simplices ∆
n
1
and
∆
n
2
with their boundaries identiﬁed in the obvious way, preserving the ordering of
vertices. The difference ∆
n
1
−∆
n
2
, viewed as a singular n chain, is then a cycle, and we
claim it represents a generator of H
n
(S
n
), assuming n > 0 so that the latter group is
inﬁnite cyclic. To see this, consider the isomorphisms
`
H
n
(S
n
)
≈
→H
n
(S
n
, ∆
n
2
)
≈
← H
n
(∆
n
1
, ∂∆
n
1
)
where the ﬁrst isomorphism comes from the long exact sequence of the pair (S
n
, ∆
n
2
)
and the second isomorphism is justiﬁed by passing to quotients as before. Under
these isomorphisms the cycle ∆
n
1
−∆
n
2
in the ﬁrst group corresponds to the cycle ∆
n
1
in the third group, which represents a generator of this group as we have seen, so
∆
n
1
−∆
n
2
represents a generator of H
n
(S
n
).
126 Chapter 2. Homology
The preceding proposition implies that the excision property holds also for sub
complexes of CW complexes:
Corollary 2.24. If the CW complex X is the union of subcomplexes A and B, then
the inclusion (B, A∩B)
(X, A) induces isomorphisms H
n
(B, A∩B)→H
n
(X, A) for
all n.
Proof: Since CW pairs are good, the proposition allows us to pass to the quotient
spaces B/(A ∩ B) and X/A which are homeomorphic, assuming we are not in the
trivial case A∩B = ∅. L¦
Another application of the preceding proposition is:
Corollary 2.25. For a wedge sum
α
X
α
, the inclusions i
α
: X
α
α
X
α
induce an iso
morphism
¸
α
i
α∗
:
¸
α
`
H
n
(X
α
)→
`
H
n
(
α
X
α
), provided that the wedge sum is formed
at basepoints x
α
∈ X
α
such that the pairs (X
α
, x
α
) are good.
Proof: Since reduced homology is the same as homology relative to a basepoint, this
follows from the proposition by taking (X, A) = (
¸
α
X
α
,
¸
α
¦x
α
¦). L¦
Here is an application of the machinery we have developed, a classical result of
Brouwer from around 1910 known as ‘invariance of dimension,’ which says in partic
ular that R
m
is not homeomorphic to R
n
if m≠ n.
Theorem 2.26. If nonempty open sets U ⊂ R
m
and V ⊂ R
n
are homeomorphic,
then m= n.
Proof: For x ∈ U we have H
k
(U, U − ¦x¦) ≈ H
k
(R
m
, R
m
− ¦x¦) by excision. From
the long exact sequence for the pair (R
m
, R
m
− ¦x¦) we get H
k
(R
m
, R
m
− ¦x¦) ≈
`
H
k−1
(R
m
−¦x¦). Since R
m
−¦x¦ deformation retracts onto a sphere S
m−1
, we con
clude that H
k
(U, U − ¦x¦) is Z for k = m and 0 otherwise. By the same reasoning
H
k
(V, V − ¦y¦) is Z for k = n and 0 otherwise. Since a homeomorphism h: U→V
induces isomorphisms H
k
(U, U −¦x¦)→H
k
(V, V −¦h(x)¦) for all k, we must have
m= n. L¦
Generalizing the idea of this proof, the local homology groups of a space X at
a point x ∈ X are deﬁned to be the groups H
n
(X, X − ¦x¦). For any open neigh
borhood U of x, excision gives isomorphisms H
n
(X, X − ¦x¦) ≈ H
n
(U, U − ¦x¦),
so these groups depend only on the local topology of X near x. A homeomorphism
f : X→Y must induce isomorphisms H
n
(X, X −¦x¦) ≈ H
n
(Y, Y −¦f(x)¦) for all x
and n, so these local homology groups can be used to tell when spaces are not locally
homeomorphic at certain points, as in the preceding proof. The exercises give some
further examples of this.
Section 2.1. Simplicial and Singular Homology 127
Naturality
The exact sequences we have been constructing have an extra property which will
later become important at key points in many arguments, though at ﬁrst glance this
property may seem just an idle technicality, not very interesting. We shall discuss this
property now rather than interrupting later arguments to check it when it is needed,
but the reader may well want to postpone a careful reading of what follows.
The property is called naturality. For example, to say that the long exact sequence
of a pair is natural means that whenever one has a map f : (X, A)→(Y, B), then the
diagram
f
n 1
n 1
∂
∂
. . .
. . .
. . .
. . .
−
−
−
−
−
→
−
−
−
−
−
→
−−−−−−−→ −−−−−−−→ −−−−−−−→ −−−−−−−→
i j
A A H ( )
−
−
−
−
−
→
−
−
−
−
−
→
X H
n n n
( ) X H ( ) ,
−−−−−−−→ −−−−−−−→ −−−−−−−→ −−−−−−−→
−−−−−−−→
−−−−−−−→
i j
B B H ( ) Y H
n n n
A H ( )
B H ( ) ( ) Y H ( ) ,
∗
∗ ∗
∗ ∗
f
∗
f
∗
f
∗
is commutative. Commutativity of the squares involving i
∗
and j
∗
follows from the
obvious commutativity of
−
−
−
−
−
→
−
−
−
−
−
→
−−−−−−−→ −−−−−−−→ −−−−−−−→ −−−−−−−→
i j
A A C 0 ( )
−
−
−
−
−
→
X C 0
n n n
( ) X C ( )
∂ ∂ ∂
,
−−−−−−−→ −−−−−−−→ −−−−−−−→ −−−−−−−→
i j
B B C 0 ( ) Y C 0
n n n
( ) Y C ( ) ,
Commutativity of the square containing ∂ : H
n
(X, A)→H
n−1
(A) can be deduced from
the relation f
∂ = ∂f
on chains, which we noted when we deﬁned induced homo
morphisms. Namely, for a class [α] ∈ H
n
(X, A) represented by a relative cycle α, we
have f
∗
∂[α] = f
∗
[∂α] = [f
∂α] = [∂f
α] = ∂[f
α] = ∂f
∗
[α].
Alternatively, we could appeal to the general algebraic fact that the long exact
sequence of homology groups associated to a short exact sequence of chain complexes
is natural: Given two short exact sequences of chain complexes and a map between
them, producing commutative diagrams
0 A
α β γ
−
−
−
−
−
→
−
−
−
−
−
→
−
−
−
−
−
→
−−−−−−−→ B −−−−−−−→ C −−−−−−−→ 0 −−−−−−−→
0 A −−−−−−−→ B −−−−−−−→ C −−−−−−−→ 0 −−−−−−−→
i
i
j
j
n
n
n
n
n
n
¹
¹ ¹
¹ ¹
for all n, then the diagram
n 1
n 1
∂
∂
. . .
. . .
. . .
. . .
−
−
−
−
−
→
−
−
−
−
−
→
−−−−−−−→ −−−−−−−→ −−−−−−−→ −−−−−−−→
i j
A H ( )
−
−
−
−
−
→
−
−
−
−
−
→
C H
n n n
( ) B H ( )
−−−−−−−→ −−−−−−−→ −−−−−−−→ −−−−−−−→
−−−−−−−→
−−−−−−−→
i j
A H ( ) C H
n n n
A H ( )
A H ( ) ( ) B H ( )
∗
∗ ∗
∗ ∗
∗ ∗
¹
¹ ¹ ¹ ¹
¹
α
∗
α
β
γ
is commutative. Commutativity of the ﬁrst two squares is obvious since βi = i
¹
α
implies β
∗
i
∗
= i
¹
∗
α
∗
and γj = j
¹
β implies γ
∗
j
∗
= j
¹
∗
β
∗
. For the third square, recall
that the map ∂ : H
n
(C)→H
n−1
(A) was deﬁned by ∂[c] = [a] where c = j(b) and
128 Chapter 2. Homology
i(a) = ∂b. Then ∂[γ(c)] = [α(a)] since γ(c) = γj(b) = j
¹
(β(b)) and i
¹
(α(a)) =
βi(a) = β∂(b) = ∂β(b). Hence ∂γ
∗
[c] = α
∗
[a] = α
∗
∂[c].
This algebraic fact also implies naturality of the long exact sequence of a triple
and the long exact sequence of reduced homology of a pair.
Finally, there is the naturality of the long exact sequence in Theorem 2.13, i.e.,
commutativity of the diagram
Y/
X/
f
n 1
n 1
∂
∂
. . .
. . .
. . .
. . .
−
−
−
−
−
→
−
−
−
−
−
→
−−−−−−−→ −−−−−−−→ −−−−−−−→ −−−−−−−→
i q
A A H ( )
−
−
−
−
−
→
−
−
−
−
−
→
H
n n n
( ) X H ( )
−−−−−−−→ −−−−−−−→ −−−−−−−→ −−−−−−−→
−−−−−−−→
−−−−−−−→
i q
B B H ( ) H
n n n
A H ( )
B H ( ) ( ) Y H ( )
∗
∗ ∗
∗ ∗
f
∗
f
∗
f
∗
∼ ∼ ∼ ∼
∼ ∼ ∼ ∼
−
where i and q denote inclusions and quotient maps, and f : X/A→Y/B is induced
by f . The ﬁrst two squares commute since fi = if and fq = qf . The third square
expands into
n 1
n 1
∂
∂
−
−
−
−
−
→
−−−−−−−→ − − − − − − − →
j q
−
−
−
−
−
→
−
−
−
−
−
→
−−−−−−−→ − − − − − − − →
−−−−−−−→
−−−−−−−→
j q
A H ( )
B H ( )
∗ ∗
∗ ∗
f
∗
f
∗
f
∗
∼
∼
Y/
X/A
−
−
−
−
−
→
H
n
( )
B H
n
( )
f
∗
∼
∼
− −
A X H
n
( ) ,
B Y H
n
( ) ,
A X/ A A/ H
n
( ) ,
B Y/ B B/ H
n
( ) ,
≈
≈
≈
≈
We have already shown commutativity of the ﬁrst and third squares, and the second
square commutes since fq = qf .
The Equivalence of Simplicial and Singular Homology
We can use the preceding results to show that the simplicial and singular homol
ogy groups of ∆ complexes are always isomorphic. For the proof it will be convenient
to consider the relative case as well, so let X be a ∆ complex with A ⊂ X a subcom
plex, i.e., a union of simplices of X, where ‘simplex’ means ‘closed simplex.’ Thus A
is a ∆ complex itself. Relative groups H
∆
n
(X, A) can be deﬁned in the same way as
for singular homology, via relative chains ∆
n
(X, A) = ∆
n
(X)/∆
n
(A), and this yields
a long exact sequence of simplicial homology groups for the pair (X, A) by the same
algebraic argument as for singular homology. There is a canonical homomorphism
H
∆
n
(X, A)→H
n
(X, A) induced by the chain map ∆
n
(X, A)→C
n
(X, A) sending each
n simplex of X to its characteristic map σ : ∆
n
→X. The possibility A = ∅ is not
excluded, in which case the relative groups reduce to absolute groups.
Theorem 2.27. The homomorphisms H
∆
n
(X, A)→H
n
(X, A) are isomorphisms for
all n and all ∆ complex pairs (X, A).
Proof: First we do the case that X is ﬁnitedimensional and A is empty. For X
k
the kskeleton of X, consisting of all simplices of dimension k or less, we have a
commutative diagram of exact sequences:
Section 2.1. Simplicial and Singular Homology 129
H ( )
n
−−−−→ −−−−→ −−−−→ −−−−→
X H ( )
n
k
X X H ( ) ,
n
k 1 k
X
k 1
H ( )
X
k 1
H ( )
n 1 +
X X ,
k 1 k
n 1
H ( )
n
−−−−→ −−−−→ −−−−→ −−−−→
X H ( )
n
k
X X H ( ) ,
n
k 1 k
X
k 1
H ( )
X
k 1
H ( )
n 1 +
X X ,
k 1 k
n 1
−
−
−
→
−
−
−
→
−
−
−
→
−
−
−
→
−
−
−
→
∆ ∆ ∆ ∆ ∆
Let us ﬁrst show that the ﬁrst and fourth vertical maps are isomorphisms for all n.
The simplicial chain group ∆
n
(X
k
, X
k−1
) is zero for n ≠ k, and is free abelian with
basis the k simplices of X when n = k. Hence H
∆
n
(X
k
, X
k−1
) has exactly the same
description. The corresponding singular homology groups H
n
(X
k
, X
k−1
) can be com
puted by considering the map Φ:
¸
α
(∆
k
α
, ∂∆
k
α
)→(X
k
, X
k−1
) formed by the character
istic maps ∆
k
→X for all the k simplices of X. Since Φ induces a homeomorphism
of quotient spaces
¸
α
∆
k
α
/
¸
α
∂∆
k
α
≈ X
k
/X
k−1
, it induces isomorphisms on all singu
lar homology groups. Thus H
n
(X
k
, X
k−1
) is zero for n ≠ k, while for n = k this
group is free abelian with basis represented by the relative cycles given by the char
acteristic maps of all the k simplices of X, in view of the fact that H
k
(∆
k
, ∂∆
k
) is
generated by the identity map ∆
k
→∆
k
, as we showed in Example 2.23. Therefore the
map H
∆
k
(X
k
, X
k−1
)→H
k
(X
k
, X
k−1
) is an isomorphism.
By induction on k we may assume the second and ﬁfth vertical maps in the pre
ceding diagramare isomorphisms as well. The following frequentlyquoted basic alge
braic lemma will then imply that the middle vertical map is an isomorphism, ﬁnishing
the proof when X is ﬁnitedimensional and A = ∅.
The FiveLemma. Suppose one has a commutative diagram of abelian groups
A
α β γ
−
−
−
−
−
→
−
−
−
−
−
→
−
−
−
−
−
→
−
−
−
−
−
→
B −−−−−−−→ C −−−−−−−→ −−−−−−−→
A B −−−−−−−→ C −−−−−−−→ −−−−−−−→
i
i
j
j
¹
¹ ¹
¹ ¹
δ ε
−
−
−
−
−
→
D E −−−−−−−→
D E −−−−−−−→
¹
k
k
¹
¹ ¹
in which the two rows are exact and α, β, δ, and ε are isomorphisms. Then γ is an
isomorphism also.
Proof: It sufﬁces to show:
(a) γ is surjective if β and δ are surjective and ε is injective.
(b) γ is injective if β and δ are injective and α is surjective.
These are proved by straightforward diagram chasing. There is really no choice
about how the argument can proceed, and it would be a good exercise for the reader
to close the book now and reconstruct the proof without looking.
To prove (a), suppose c
¹
∈ C
¹
. Then k
¹
(c) = δ(d) for some d ∈ D since δ is
surjective. Since ε is injective and ε(d) =
¹
δ(d) =
¹
k
¹
(c) = 0 we deduce that
(d) = 0, hence d = k(c) for some c ∈ C by exactness of the upper row. The
difference c
¹
− γ(c) maps to 0 under k
¹
since k
¹
(c
¹
) − k
¹
γ(c) = k
¹
(c) − δk(c) =
k
¹
(c
¹
) −δ(d) = 0. Therefore c
¹
−γ(c) = j
¹
(b
¹
) for some b
¹
∈ B
¹
by exactness. Since
β is surjective, b
¹
= β(b) for some b ∈ B, and then γ(c + j(b)) = γ(c) + γj(b) =
γ(c) +j
¹
β(b) = γ(c) +j
¹
(b
¹
) = c
¹
, showing that γ is surjective.
130 Chapter 2. Homology
To prove (b), suppose γ(c) = 0. Since δ is injective, δk(c) = k
¹
γ(c) = 0 implies
k(c) = 0, so c = j(b) for some b ∈ B. The element β(b) satisﬁes j
¹
β(b) = γj(b) =
γ(c) = 0, so β(b) = i
¹
(a
¹
) for some a
¹
∈ A
¹
. Since α is surjective, a
¹
= α(a)
for some a ∈ A. Since β is injective, β(i(a) − b) = βi(a) − β(b) = i
¹
α(a) − β(b) =
i
¹
(a
¹
)−β(b) = 0 implies i(a)−b = 0. Thus b = i(a), and hence c = j(b) = ji(a) = 0
since ji = 0. This shows γ has trivial kernel. L¦
Returning to the proof of the theorem, we next consider the case that X is inﬁnite
dimensional, where we will use the following fact: A compact set in X can meet only
ﬁnitely many open simplices of X, i.e., simplices with their proper faces deleted. This
is a general fact about CWcomplexes proved in the Appendix, but here is a direct proof
for ∆ complexes. If a compact set C intersected inﬁnitely many open simplices, it
would contain an inﬁnite sequence of points x
i
each lying in a different open simplex.
Then the sets U
i
= X −
j≠i
¦x
j
¦, which are open since their preimages under the
characteristic maps of all the simplices are clearly open, forman open cover of C with
no ﬁnite subcover.
This can be applied to show the map H
∆
n
(X)→H
n
(X) is surjective. Represent a
given element of H
n
(X) by a singular n cycle z. This is a linear combination of ﬁnitely
many singular simplices with compact images, meeting only ﬁnitely many open sim
plices of X, hence contained in X
k
for some k. We have shown that H
∆
n
(X
k
)→H
n
(X
k
)
is an isomorphism, in particular surjective, so z is homologous in X
k
(hence in X) to
a simplicial cycle. This gives surjectivity. Injectivity is similar: If a simplicial n cycle
z is the boundary of a singular chain in X, this chain has compact image and hence
must lie in some X
k
, so z represents an element of the kernel of H
∆
n
(X
k
)→H
n
(X
k
).
But we know this map is injective, so z is a simplicial boundary in X
k
, and therefore
in X.
It remains to do the case of arbitrary X with A ≠ ∅, but this follows from the
absolute case by applying the ﬁvelemma to the canonical map from the long exact
sequence of simplicial homology groups for the pair (X, A) to the corresponding long
exact sequence of singular homology groups. L¦
We can deduce from this theorem that H
n
(X) is ﬁnitely generated whenever X
is a ∆ complex with ﬁnitely many n simplices, since in this case the simplicial chain
group ∆
n
(X) is ﬁnitely generated, hence also its subgroup of cycles and therefore
also the latter group’s quotient H
∆
n
(X). If we write H
n
(X) as the direct sum of cyclic
groups, then the number of Z summands is known traditionally as the n
th
Betti
number of X, and integers specifying the orders of the ﬁnite cyclic summands are
called torsion coefﬁcients.
It is a curious historical fact that homology was not thought of originally as a
sequence of groups, but rather as Betti numbers and torsion coefﬁcients. One can after
all compute Betti numbers and torsion coefﬁcients fromthe simplicial boundary maps
Section 2.1. Simplicial and Singular Homology 131
without actually mentioning the homology groups. This computational viewpoint,
with homology being numbers rather than groups, prevailed from when Poincar´e ﬁrst
started serious work on homology around 1900, up until the 1920’s when the more
abstract viewpoint of groups entered the picture. During this period ‘homology’ meant
primarily ‘simplicial homology,’ and it was another 20 years before the shift to singular
homology was complete, with the ﬁnal deﬁnition of singular homology emerging only
in a 1944 paper of Eilenberg, after contributions from quite a few others, particularly
Alexander and Lefschetz. Within the next few years the rest of the basic structure
of homology theory as we have presented it fell into place, and the ﬁrst deﬁnitive
treatment appeared in the classic book [EilenbergSteenrod] of 1952.
Exercises
1. What familiar space is the quotient ∆ complex of a 2 simplex [v
0
, v
1
, v
2
] obtained
by identifying the edges [v
0
, v
1
] and [v
1
, v
2
], preserving the ordering of vertices?
2. Show that the ∆ complex obtained from ∆
3
by performing the edge identiﬁcations
[v
0
, v
1
] ∼ [v
1
, v
3
] and [v
0
, v
2
] ∼ [v
2
, v
3
] deformation retracts onto a Klein bottle.
Find other pairs of identiﬁcations of edges which produce ∆ complexes deformation
retracting onto a torus, a 2 sphere, and RP
2
.
3. Construct a ∆ complex structure on RP
n
as a quotient of a ∆ complex structure
on S
n
having vertices the two vectors of length 1 along each coordinate axis in R
n+1
.
4. Compute the simplicial homology groups of the triangular parachute obtained from
∆
2
by identifying its three vertices to a single point.
5. Compute the simplicial homology groups of the Klein bottle using the ∆ complex
structure described at the beginning of this section.
6. Compute the simplicial homology groups of the ∆ complex obtained from n + 1
2 simplices ∆
2
0
, ··· , ∆
2
n
by identifying all three edges of ∆
2
0
to a single edge, and for
i > 0 identifying the edges [v
0
, v
1
] and [v
1
, v
2
] of ∆
2
i
to a single edge and the edge
[v
0
, v
2
] to the edge [v
0
, v
1
] of ∆
2
i−1
.
7. Find a way of identifying pairs of faces of ∆
3
to produce a ∆ complex structure
on S
3
having a single 3 simplex, and compute the simplicial homology groups of this
∆ complex.
8. Construct a 3 dimensional ∆ complex X from n tetrahe
dra T
1
, ··· , T
n
by the following two steps. First arrange the
tetrahedra in a cyclic pattern as in the ﬁgure, so that each T
i
shares a common vertical face with its two neighbors T
i−1
and
T
i+1
, subscripts being taken mod n. Then identify the bottom face of T
i
with the top
face of T
i+1
for each i. Show the simplicial homology groups of X in dimensions 0,
1, 2, 3 are Z, Z
n
, 0, Z respectively. [The space X is an example of a lens space; see
Example 2.43 for the general case.]
132 Chapter 2. Homology
9. Compute the homology groups of the ∆ complex X obtained from ∆
n
by identify
ing all pairs of faces having the same dimension. Thus X has a single k simplex for
each k ≤ n.
10. Show that the quotient space of a ﬁnite collection of disjoint 2 simplices ob
tained by identifying pairs of edges is always a surface, i.e., locally homeomorphic to
R
2
. [Optional reﬁnement: show the edges can always be oriented so as to deﬁne a
∆ complex structure on the surface.]
11. Show that if A is a retract of X then the map H
n
(A)→H
n
(X) induced by the
inclusion A ⊂ X is injective.
12. Show that chain homotopy of chain maps is an equivalence relation.
13. Verify that f = g implies f
∗
= g
∗
for induced homomorphisms of reduced
homology groups.
14. Determine whether there exists a short exact sequence 0→Z
4
→Z
8
⊕Z
2
→Z
4
→0.
More generally, determine which abelian groups A ﬁt into a short exact sequence
0→Z
p
m→A→Z
p
n→0 with p prime. What about the case of short exact sequences
0→Z→A→Z
n
→0?
15. For an exact sequence A→B→C→D→E show that C = 0 iff the map A→B
is surjective and D→E is injective. Thus a map A→X induces isomorphisms on all
homology groups iff H
n
(X, A) = 0 for all n.
16. Show: (a) H
0
(X, A) = 0 iff A contains at least one point in each pathcomponent
of X. (b) H
1
(X, A) = 0 iff H
1
(A)→H
1
(X) is surjective and each pathcomponent of
X contains at most one pathcomponent of A.
17. (a) Compute the homology groups H
n
(X, A) when X is S
2
or S
1
×S
1
and A is a
ﬁnite set of points in X.
(b) Compute the homology groups H
n
(X, A) and
H
n
(X, B) where X is a closed orientable surface
of genus two and A and B are the circles shown in
A
B
the ﬁgure.
18. Show that for the subspace Q ⊂ R, the relative homology group H
1
(R, Q) is free
abelian and ﬁnd a basis.
19. Compute the homology groups of the subspace of I ×I consisting of the four
boundary edges plus all points in the interior whose ﬁrst coordinate is rational.
20. Show that
`
H
n
(X) ≈
`
H
n+1
(SX) for all n, where SX is the suspension of X.
21. Making the preceding problem more concrete, construct explicit chain maps
s : C
n
(X)→C
n+1
(SX) which induce isomorphisms
`
H
n
(X)→
`
H
n+1
(SX).
22. Prove by induction on dimension the following facts about the homology of a
ﬁnitedimensional CW complex X, using the observation that X
n
/X
n−1
is a wedge
sum of nspheres:
Section 2.2. Computations and Applications 133
(a) If X has dimension n then H
i
(X) = 0 for i > n and H
n
(X) is free.
(b) H
n
(X) is free with basis in bijective correspondence with the ncells if there are
no cells of dimension n−1 or n+1.
(c) If X has k n cells, then H
n
(X) is generated by at most k elements.
23. Show that the second barycentric subdivision of a ∆ complex is a simplicial
complex. Namely, show that the ﬁrst barycentric subdivision produces a ∆ complex
with the property that each simplex has all its vertices distinct, then show that for a
∆ complex with this property, barycentric subdivision produces a simplicial complex.
24. Show that each n simplex in the barycentric subdivision of ∆
n
is deﬁned by n
inequalities t
i
0
≤ t
i
1
≤ ··· ≤ t
i
n
in its barycentric coordinates, where (i
0
, ··· , i
n
) is a
permutation of (0, ··· , n).
25. Find an explicit, noninductive formula for the barycentric subdivision operator
S : C
n
(X)→C
n
(X).
26. Show that H
1
(X, A) is not isomorphic to
`
H
1
(X/A) if X = [0, 1] and A is the
sequence 1,
1
/
2
,
1
/
3
, ··· together with its limit 0. [See Example 1.25.]
27. Let f : (X, A)→(Y, B) be a map such that both f : X→Y and the restriction
f : A→B are homotopy equivalences.
(a) Show that f
∗
: H
n
(X, A)→H
n
(Y, B) is an isomorphism for all n.
(b) For the case of the inclusion f : (D
n
, S
n−1
)
(D
n
, D
n
−¦0¦), show that f is not
a homotopy equivalence of pairs, i.e., there is no g : (D
n
, D
n
−¦0¦)→(D
n
, S
n−1
)
such that fg and gf are homotopic to the identity through maps of pairs.
28. Let X be the cone on the 1 skeleton of ∆
3
, i.e., the union of all line segments
joining points in the six edges of ∆
3
to the barycenter of ∆
3
. Compute the local
homology groups H
n
(X, X − ¦x¦) for all x ∈ X. Deﬁne ∂X to be the subspace of
points x such that H
n
(X, X − ¦x¦) = 0 for all n, and compute the local homology
groups H
n
(∂X, ∂X −¦x¦). Use these calculations to determine which subsets A ⊂ X
have the property that f(A) ⊂ A for all homeomorphisms f : X→X.
29. Show that S
1
×S
1
and S
1
∨ S
1
∨ S
2
have isomorphic homology groups in all
dimensions, but their universal covering spaces do not.
30. In each of the following commutative diagrams assume that all maps but one are
isomorphisms. Show that the remaining map must be an isomorphism as well.
A B
−−−−−→
C D
−−−−−→
−−−−−→
−−−−−→
A B
−−−−−→
C
−
−
−
−
−
→
−
−
−
−
−
→
A B
−−−−−→
C D
−−−−−→
−−−−−→
−−−−−→
31. Using the notation of the ﬁvelemma, give an example where the maps α, β, δ,
and ε are zero but γ is nonzero. This can be done with short exact sequences in
which all the groups are either Z or 0.
134 Chapter 2. Homology
Now that the basic properties of homology have been established, we can begin
to move a little more freely. Our ﬁrst topic, exploiting the calculation of H
n
(S
n
), is
Brouwer’s notion of degree for maps S
n
→S
n
. Historically, Brouwer’s introduction
of this concept about 1910 preceded the rigorous development of homology, so his
deﬁnition was rather different, using the technique of simplicial approximation which
we explain in §2.C. The later deﬁnition in terms of homology is certainly more elegant,
though perhaps with some loss of geometric intuition. More in the spirit of Brouwer’s
deﬁnition is a third approach using differential topology, presented very lucidly in
[Milnor 65].
Degree
For a map f : S
n
→S
n
, the induced f
∗
:
`
H
n
(S
n
)→
`
H
n
(S
n
) is a homomorphism
from an inﬁnite cyclic group to itself and so must be of the form f
∗
(α) = dα for
some integer d depending only on f . This integer is called the degree of f , deg f .
Here are some basic properties of degree.
(a) deg 11 = 1, since 11
∗
= 11.
(b) deg f = 0 if f is not surjective. For if we choose a point x
0
∈ S
n
−f(S
n
) then f
can be factored as a composition S
n
→S
n
− ¦x
0
¦
S
n
and H
n
(S
n
− ¦x
0
¦) = 0
since S
n
−¦x
0
¦ is contractible. Hence f
∗
= 0.
(c) If f = g then deg f = deg g since f
∗
= g
∗
. The converse statement, that f = g
if deg f = deg g, is a fundamental theorem of Hopf from around 1925 which we
will prove in §4.2.
(d) deg fg = deg f deg g, since (fg)
∗
= f
∗
g
∗
. Aconsequence of this is that deg f =
:1 if f is a homotopy equivalence since fg = 11 implies deg f deg g = deg 11 = 1.
(e) deg f = −1 if f is a reﬂection of S
n
, ﬁxing the points in a subsphere S
n−1
and interchanging the two complementary hemispheres. For we can give S
n
a
∆ complex structure with these two hemispheres as its two n simplices ∆
n
1
and
∆
n
2
, and the n chain ∆
n
1
− ∆
n
2
represents a generator of H
n
(S
n
) as we saw in
Example 2.23, so the reﬂection interchanging ∆
n
1
and ∆
n
2
sends this generator to
its negative.
(f) The antipodal map −11: S
n
→S
n
, x
−x, has degree (−1)
n+1
since it is the
composition of n + 1 reﬂections, each changing the sign of one coordinate in
R
n+1
.
(g) If f : S
n
→S
n
has no ﬁxed points then deg f = (−1)
n+1
. For if f(x) ≠ x then the
line segment from f(x) to −x, deﬁned by t
(1 −t)f(x) −tx for 0 ≤ t ≤ 1,
does not pass through the origin. Hence if f has no ﬁxed points, the formula
f
t
(x) = [(1 − t)f(x) − tx]/¦(1 − t)f(x) − tx¦ deﬁnes a homotopy from f to
Section 2.2. Computations and Applications 135
the antipodal map. Note that the antipodal map has no ﬁxed points, so the fact
that maps without ﬁxed points are homotopic to the antipodal map is a sort of
converse statement.
Here is an interesting application of degree:
Theorem 2.28. S
n
has a continuous ﬁeld of nonzero tangent vectors iff n is odd.
Proof: Suppose x
v(x) is a tangent vector ﬁeld on S
n
, assigning to a vector x ∈ S
n
the vector v(x) tangent to S
n
at x. Regarding v(x) as a vector at the origin instead
of at x, tangency just means that x and v(x) are orthogonal in R
n+1
. If v(x) ≠ 0 for
all x we may normalize v(x) so that ¦v(x)¦ = 1 by replacing v(x) by v(x)/¦v(x)¦.
Assuming this has been done, consider the great circle (cos t)x + (sint)v(x) in the
plane spanned by x and v(x). Letting t go from 0 to π deﬁnes a homotopy f
t
(x) =
(cos t)x + (sint)v(x) from the identity map of S
n
to the antipodal map −11. This
implies that deg(−11) = deg 11, hence (−1)
n+1
= 1 and n must be odd.
Conversely, if n is odd, say n = 2k−1, we can deﬁne v(x
1
, x
2
, ··· , x
2k−1
, x
2k
) =
(−x
2
, x
1
, ··· , −x
2k
, x
2k−1
). Then v(x) is orthogonal to x, so v is a tangent vector
ﬁeld on S
n
which is nonzero at all points. L¦
For the much more difﬁcult problem of ﬁnding the maximum number of tan
gent vector ﬁelds on S
n
which are linearly independent at each point, see [VBKT] or
[Husemoller].
Here is another nice application of degree, giving a partial answer to a question
raised in Example 1.43:
Proposition 2.29. Z
2
is the only nontrivial group which can act freely on S
n
if n is
even.
Recall that an action of a group G on a space X is a homomorphism from G
to the group Homeo(X) of homeomorphisms X→X, and the action is free if the
homeomorphism corresponding to each nontrivial element of G has no ﬁxed points.
In the case of S
n
, the antipodal map x
−x generates a free action of Z
2
.
Proof: Since the degree of a homeomorphism must be :1, an action of a group G
on S
n
determines a degree function d: G→¦:1¦. This is a homomorphism since
deg fg = deg f deg g. If the action is free, then d sends every nontrivial element of
G to (−1)
n+1
by property (g) above. Thus when n is even, d has trivial kernel, so
G ⊂ Z
2
. L¦
We shall next describe a technique for computing degrees which can be applied
to most maps that arise in practice. Suppose f : S
n
→S
n
has the property that for
some point y ∈ S
n
, the preimage f
−1
(y) consists of only ﬁnitely many points, say
136 Chapter 2. Homology
x
1
, ··· , x
m
. Let U
1
, ··· , U
m
be disjoint neighborhoods of these points, mapped by f
into a neighborhood V of y. Then f(U
i
− x
i
) ⊂ V − y for each i, and we have a
commutative diagram
−
−
−
−
−
→
−
−
−
−
−
→
−
−
−
−
−
→
−
−
−
−
−
→
−−−−−−→ − − − − − − → n
S H ( )
f
j
k
∗
f
∗
−−−−−−→
f
∗
n
S y
n
≈
≈
−−−−−−−−→
−
−
−
−
−
−
−
−
→
−
−
−
−
−
−
−
−
→
H ( )
n
S H ( ) S
n n
n
≈
≈
,
n
S H ( )
n
S x
n
,
n
V H ( ) V y ,
n i
i
p
i
i
i
i
U H ( ) U x ,
n
S H ( ( ))
n
S y f
n
,
1
where all the maps are the obvious ones, in particular k
i
and p
i
are induced by inclu
sions. The two isomorphisms in the upper half of the diagram come from excision,
while the lower two isomorphisms come fromexact sequences of pairs. Via these four
isomorphisms, the top two groups in the diagram can be identiﬁed with H
n
(S
n
) ≈ Z,
and the top homomorphism f
∗
becomes multiplication by an integer called the local
degree of f at x
i
, written deg f ¦
¦x
i
.
For example, if f is a homeomorphism, then y can be any point and there is
only one corresponding x
i
, so all the maps in the diagram are isomorphisms and
deg f ¦
¦x
i
= deg f = :1. More generally, if f maps each U
i
homeomorphically onto
V , then deg f ¦
¦x
i
= :1 for each i. This situation occurs quite often in applications,
and it is usually not hard to determine the correct signs.
Here is the formula which reduces degree calculations to computing local degrees:
Proposition 2.30. deg f =
¸
i
deg f ¦
¦x
i
.
Proof: By excision, the central term H
n
(S
n
, S
n
− f
−1
(y)) in the preceding diagram
is the direct sum of the groups H
n
(U
i
, U
i
− x
i
) ≈ Z, with k
i
the inclusion of the
i
th
summand. Since the upper triangle commutes, the projections of this direct sum
onto its summands are given by the maps p
i
. Identifying the outer groups in the
diagram with Z as before, commutativity of the lower triangle says that p
i
j(1) = 1,
hence j(1) = (1, ··· , 1) =
¸
i
k
i
(1). Commutativity of the upper square says that the
middle f
∗
takes k
i
(1) to deg f ¦
¦x
i
, hence
¸
i
k
i
(1) = j(1) is taken to
¸
i
deg f ¦
¦x
i
.
Commutativity of the lower square then gives the formula deg f =
¸
i
deg f ¦
¦x
i
. L¦
Example 2.31. We can use this result to construct a map S
n
→S
n
of any given degree,
for each n ≥ 1. Let q : S
n
→
k
S
n
be the quotient map obtained by collapsing the
complement of k disjoint open balls B
i
in S
n
to a point, and let p:
k
S
n
→S
n
identify
all the summands to a single sphere. Consider the composition f = pq. For almost all
y ∈ S
n
we have f
−1
(y) consisting of one point x
i
in each B
i
. The local degree of f at
x
i
is :1 since f is a homeomorphism near x
i
. By precomposing p with reﬂections
of the summands of
k
S
n
if necessary, we can make each local degree either +1 or
−1, whichever we wish. Thus we can produce a map S
n
→S
n
of degree :k.
Section 2.2. Computations and Applications 137
Example 2.32. In the case of S
1
, the map f(z) = z
k
, where we view S
1
as the unit
circle in C, has degree k. This is evident in the case k = 0 since f is then constant.
The case k < 0 reduces to the case k > 0 by composing with z
z
−1
, which is a
reﬂection, of degree −1. To compute the degree when k > 0, observe ﬁrst that for
any y ∈ S
1
, f
−1
(y) consists of k points x
1
, ··· , x
k
near each of which f is a local
homeomorphism. Near each x
i
the map f can be homotoped, stretching by a factor
of k without changing local degree, to become the restriction of a rotation of S
1
. A
rotation has degree +1 since it is homotopic to the identity, and since a rotation is a
homeomorphism, its degree equals its local degree at any point. Hence deg f ¦
¦x
i
= 1
and deg f = k.
Another way of obtaining a map S
n
→S
n
of degree k is to take a repeated sus
pension of the map z
z
k
in Example 2.32, since suspension preserves degree:
Proposition 2.33. deg Sf = deg f , where Sf : S
n+1
→S
n+1
is the suspension of the
map f : S
n
→S
n
.
Proof: Let CS
n
denote the cone (S
n
×I)/(S
n
×1) with base S
n
= S
n
×0 ⊂ CS
n
,
so CS
n
/S
n
is the suspension of S
n
. The map f induces Cf : (CS
n
, S
n
)→(CS
n
, S
n
)
with quotient Sf . The naturality of the boundary maps
Sf
−
−
−
−
−
→
−
−
−
−
−
→
−−−−−→ H ( )
n
S H ( )
∗
f
∗
∼ ∼
S
n 1 n +
n 1 +
∂
≈
−−−−−→ H ( )
n
S H ( )
∼ ∼
S
n 1 n +
n 1 +
∂
≈
in the long exact sequence of the pair (CS
n
, S
n
) then
gives commutativity of the diagram at the right. Hence
if f
∗
is multiplication by d, so is Sf
∗
. L¦
Note that for f : S
n
→S
n
, the suspension Sf maps only one point to each of the
two ‘poles’ of S
n+1
. This implies that the local degree of Sf at each pole must equal
the global degree of Sf . Thus the local degree of a map S
n
→S
n
can be any integer
if n ≥ 2, just as the degree itself can be any integer when n ≥ 1.
Cellular Homology
Cellular homology is a very efﬁcient tool for computing the homology groups of
CW complexes, based on degree calculations. Before giving the deﬁnition of cellular
homology, we ﬁrst establish a few preliminary facts:
Lemma 2.34. If X is a CW complex, then:
(a) H
k
(X
n
, X
n−1
) is zero for k ≠ n, and is free abelian for k = n, with a basis in
onetoone correspondence with the n cells of X.
(b) H
k
(X
n
) = 0 for k > n. In particular, if X is ﬁnitedimensional then H
k
(X) = 0
for k > dimX.
(c) The inclusion i : X
n
X induces an isomorphism i
∗
: H
k
(X
n
)→H
k
(X) if k < n.
Proof: Statement (a) follows immediately from the observation that (X
n
, X
n−1
) is a
good pair and X
n
/X
n−1
is a wedge sum of n spheres, one for each n cell of X. (We
are using Proposition 2.22 and Corollary 2.25 here.)
138 Chapter 2. Homology
The long exact sequence of the pair (X
n
, X
n−1
) contains segments
H
k+1
(X
n
, X
n−1
) →H
k
(X
n−1
) →H
k
(X
n
) →H
k
(X
n
, X
n−1
)
If k is not equal to n or n − 1 then the outer two groups are zero by part (a), so
we have isomorphisms H
k
(X
n−1
) ≈ H
k
(X
n
) for k ≠ n, n − 1. Thus if k > n we
have H
k
(X
n
) ≈ H
k
(X
n−1
) ≈ H
k
(X
n−2
) ≈ ··· ≈ H
k
(X
0
) = 0, proving (b). Further, if
k < n then H
k
(X
n
) ≈ H
k
(X
n+1
) ≈ ··· ≈ H
k
(X
n+m
) for all m≥ 0, proving (c) if X is
ﬁnitedimensional.
The proof of (c) when X is inﬁnite dimensional requires more work, and this can
be done in two different ways. The more direct approach is to descend to the chain
level and use the fact that a singular chain in X has compact image, hence meets only
ﬁnitely many cells of X by Proposition A.1 in the Appendix. Thus each chain lies
in a ﬁnite skeleton X
m
. So a k cycle in X is a cycle in some X
m
, and then by the
ﬁnitedimensional case of (c), the cycle is homologous to a cycle in X
n
if n > k, so
i
∗
: H
k
(X
n
)→H
k
(X) is surjective. Similarly for injectivity, if a k cycle in X
n
bounds
a chain in X, this chain lies in some X
m
with m ≥ n, so by the ﬁnitedimensional
case the cycle bounds a chain in X
n
if n > k.
The other approach is more general. From the long exact sequence of the pair
(X, X
n
) it sufﬁces to show H
k
(X, X
n
) = 0 for k ≤ n. Since H
k
(X, X
n
) ≈
`
H
k
(X/X
n
),
this reduces us to showing:
(∗)
`
H
k
(X) = 0 for k ≤ n if the n skeleton of X is a point.
When X is ﬁnitedimensional, (∗) is immediate from the ﬁnitedimensional case
of (c) which we have already shown. It will sufﬁce therefore to reduce the inﬁnite
dimensional case to the ﬁnitedimensional case. This reduction will be achieved by
stretching X out to a complex which is at least locally ﬁnitedimensional, using a
special case of the ‘mapping telescope’ construction described in greater generality
in §3.F.
R
Consider X×[0, ∞) with its product cell structure,
where we give [0, ∞) the cell structure with the integer
points as vertices. Let T =
i
X
i
×[i, ∞), a subcomplex
of X×[0, ∞). The ﬁgure shows a schematic picture of T with [0, ∞) in the hor
izontal direction and the subcomplexes X
i
×[i, i + 1] as rectangles whose size in
creases with i since X
i
⊂ X
i+1
. The line labeled R can be ignored for now. We claim
that T = X, hence H
k
(X) ≈ H
k
(T) for all k. Since X is a deformation retract of
X×[0, ∞) it sufﬁces to show that X×[0, ∞) deformation retracts also onto T . Let
Y
i
= T ∪
¸
X×[i, ∞)
. Then Y
i
deformation retracts onto Y
i+1
since X×[i, i+1] defor
mation retracts onto X
i
×[i, i +1] ∪X×¦i +1¦ by Proposition 0.16. If we perform the
deformation retraction of Y
i
onto Y
i+1
during the t interval [1 −1/2
i
, 1 −1/2
i+1
],
then this gives a deformation retraction f
t
of X×[0, ∞) onto T , with points in
X
i
×[0, ∞) stationary under f
t
for t ≥ 1 − 1/2
i+1
. Continuity follows from the fact
Section 2.2. Computations and Applications 139
that CW complexes have the weak topology with respect to their skeleta, so a map is
continuous if its restriction to each skeleton is continuous.
Recalling that X
0
is a point, let R ⊂ T be the ray X
0
×[0, ∞), and let Z ⊂ T be the
union of this ray with all the subcomplexes X
i
×¦i¦. Then Z/R is homeomorphic to
i
X
i
, a wedge sum of ﬁnitedimensional complexes with n skeleton a point, so the
ﬁnitedimensional case of (∗) together with Corollary 2.25 describing the homology
of wedge sums implies that
`
H
k
(Z/R) = 0 for k ≤ n. The same is therefore true for
Z, from the long exact sequence of the pair (Z, R), since R is contractible. Similarly,
T/Z is a wedge sum of ﬁnitedimensional complexes with (n + 1) skeleton a point,
since if we ﬁrst collapse each subcomplex X
i
×¦i¦ of T to a point we obtain the inﬁnite
sequence of suspensions SX
i
‘skewered’ along the ray R, and then if we collapse R to
a point we obtain
i
ΣX
i
where ΣX
i
is the reduced suspension of X
i
, obtained from
SX
i
by collapsing the line segment X
0
×[i, i+1] to a point, so ΣX
i
has (n+1) skeleton
a point. Thus
`
H
k
(T/Z) = 0 for k ≤ n + 1, and then the long exact sequence of the
pair (T, Z) implies that
`
H
k
(T) = 0 for k ≤ n, and we have proved (∗). L¦
Let X be a CW complex. Using Lemma 2.34, portions of the long exact sequences
for the pairs (X
n+1
, X
n
), (X
n
, X
n−1
), and (X
n−1
, X
n−2
) ﬁt into a diagram
X X H ( ) ,
n 1 +
n 1 n +
n 1 +
n 1 +
n 1 +
−−−−−→
X X H ( ) ,
n
n
n
n n 1 n 1 n 2 n
X H ( )
n
n
X H ( )
n
X H ( )
n
−−−−−→
−
−
−
−
−
→
−
−
−
−
−
→
−
−
−
−
−
→
−
−
−
−
−
→
−
−
−
−
−
→
−
−
−
−
−
→
−
−
−
−
−
→
−
−
−
−
−
→
X X H ( ) ,
n 1
n 1
n 1
X H ( )
n 1
−−−−−→
. . .
−−−−−→
. . .
≈
0
0
0
∂
∂
j
j
d d
where d
n+1
and d
n
are deﬁned as the compositions j
n
∂
n+1
and j
n−1
∂
n
, i.e., the
‘relativized’ boundary maps ∂
n+1
and ∂
n
. The composition d
n
d
n+1
includes two
successive maps in one of the exact sequences, hence is zero. Thus the horizontal
row in the diagram is a chain complex, called the cellular chain complex of X since
H
n
(X
n
, X
n−1
) is free with basis in onetoone correspondence with the n cells of X,
so one can think of elements of H
n
(X
n
, X
n−1
) as linear combinations of n cells of X.
The homology groups of this cellular chain complex are called the cellular homology
groups of X. Temporarily we denote them H
CW
n
(X).
Theorem 2.35. H
CW
n
(X) ≈ H
n
(X).
Proof: From the diagram above, H
n
(X) can be identiﬁed with H
n
(X
n
)/ Im∂
n+1
.
Since j
n
is injective, it maps Im∂
n+1
isomorphically onto Im(j
n
∂
n+1
) = Imd
n+1
140 Chapter 2. Homology
and H
n
(X
n
) isomorphically onto Imj
n
= Ker ∂
n
. Since j
n−1
is injective, Ker ∂
n
=
Ker d
n
. Thus j
n
induces an isomorphism of the quotient H
n
(X
n
)/ Im∂
n+1
onto
Ker d
n
/ Imd
n+1
. L¦
Here are a few immediate applications:
(i) H
n
(X) = 0 if X is a CW complex with no n cells.
(ii) More generally, if X is a CW complex with k ncells, then H
n
(X) is generated
by at most k elements. For H
n
(X
n
, X
n−1
) is free abelian on k generators, so
the subgroup Ker d
n
must be generated by at most k elements, hence also the
quotient Ker d
n
/ Imd
n+1
.
(iii) If X is a CW complex having no two of its cells in adjacent dimensions, then
H
n
(X) is free abelian with basis in onetoone correspondence with the n cells
of X. This is because the cellular boundary maps d
n
are automatically zero in
this case.
This last observation applies for example to CP
n
which has a CW structure with one
cell of each even dimension 2k ≤ 2n as we saw in Example 0.6. Thus
H
i
(CP
n
) ≈
Z for i = 0, 2, 4, ··· , 2n
0 otherwise
Another simple example is S
n
×S
n
with n > 1, using the product CW structure con
sisting of a 0 cell, two n cells and a 2n cell.
It is possible to prove the statements (i)(iii) for ﬁnitedimensional CW complexes
by induction on the dimension, without using cellular homology but only the basic
results fromthe previous section. However, the viewpoint of cellular homology makes
(i)(iii) quite transparent.
Next we describe how the cellular boundary maps d
n
can be computed in terms
of degrees of maps of spheres. Assuming for the moment that n > 1, consider the
commutative diagram
n
n
n 1 n 2
X X H ( ) ,
n
n 1 n
−−−−−→
−
−
−
−
−
→
X X H ( )
,
n 1
n 1
n 1
X H ( )
n 1
−−−−−−→
−−−−−−−−→
−−−→
≈
≈
≈
∂
j
q
d
∼ ∼
/ /
/ /
n 1 n 2
X X H ( )
n 1
,
n 1 n 2
X X / /
n 2 n 2
X X H ( )
n 1
−
−
−
−
−
→
−
−
−
−
−
→
n 1
D D H ( ) ,
n
n n
−−−−−→
S H ( )
n 1
H ( )
n 1
∂
∂
∼ ∼
−
−
−
−
−
→
−
−
−
−
−
→
α α
D
n
∂
α
α
α
β
β
β∗
∗
q
∗
∗
∆
ϕ
−
−
−
−
−
→
α∗
Φ
where:
— Φ
α
is the characteristic map of the cell e
n
α
, and ϕ
α
is its attaching map.
— q : X
n−1
→X
n−1
/X
n−2
is the quotient map.
— q
β
: X
n−1
/X
n−2
→S
n−1
β
collapses the complement of the cell e
n−1
β
to a point, the
resulting quotient sphere being identiﬁed with S
n−1
β
= D
n−1
β
/∂D
n−1
β
via the char
acteristic map Φ
β
.
Section 2.2. Computations and Applications 141
— ∆
αβ
: ∂D
n
α
→S
n−1
β
is the composition q
β
qϕ
α
, in other words, the attaching map
of e
n
α
followed by the quotient map X
n−1
→S
n−1
β
collapsing the complement of
e
n−1
β
in X
n−1
to a point.
The map Φ
α∗
takes a chosen generator [D
n
α
] ∈ H
n
(D
n
α
, ∂D
n
α
) to a generator x
α
of the
Z summand of H
n
(X
n
, X
n−1
) corresponding to e
n
α
. Commutativity of the left half
of the diagram then gives d
n
(x
α
) = j
n−1
ϕ
α∗
∂[D
n
α
]. In terms of the basis ¦y
β
¦ for
H
n−1
(X
n−1
, X
n−2
) corresponding to the cells e
n−1
β
, the map q
β∗
is the projection of
H
n−1
(X
n−1
/X
n−2
) onto its Z summand corresponding to y
β
. Commutativity of the
diagram then yields the formula we are looking for:
d
n
(x
α
) =
¸
β
d
αβ
y
β
where d
αβ
is the degree of the map ∆
αβ
.
Note that
¸
β
d
αβ
y
β
has only ﬁnitely many nonzero terms since
`
H
n−1
(X
n−1
/X
n−2
) is
the direct sum of the groups
`
H
n−1
(S
n−1
β
).
When n = 1 we have X
n−2
= ∅, and the preceding analysis applies if we deﬁne
Y/∅ to be the disjoint union of Y with a point. There is some logic to this deﬁnition
if one considers that Y/∅ should be a larger space than Y/y
0
= Y for y
0
∈ Y .
For actual calculations it is not necessary to resort to this trick since the cellular
boundary map d
1
: H
1
(X
1
, X
0
)→H
0
(X
0
) is the same as the simplicial boundary map
∆
1
(X)→∆
0
(X), which is easy to compute. In many cases of interest X is connected
and has only one 0 cell, and then d
1
must be 0, otherwise H
0
(X) would not be Z.
Example 2.36. Let M
g
be the closed orientable surface of genus g with its usual CW
structure consisting of one 0 cell, 2g 1 cells, and one 2 cell attached by the product
of commutators [a
1
, b
1
] ··· [a
g
, b
g
], the associated cellular chain complex is:
0 →Z
d
2
→Z
2g
d
1
→Z →0
As observed above, d
1
must be 0 since there is only one 0 cell. Also d
2
is 0 in
this case because each a
i
or b
i
appears along with its inverse in [a
1
, b
1
] ··· [a
g
, b
g
],
so the maps ∆
αβ
are homotopic to constant maps. Since d
1
and d
2
are both zero,
the homology groups of M
g
are the same as the cellular chain groups, namely, Z in
dimensions 0 and 2, and Z
2g
in dimension 1.
Example 2.37. The closed nonorientable surface N
g
of genus g has a cell structure
with one 0 cell, g 1 cells, and one 2 cell attached by the word a
2
1
a
2
2
··· a
2
g
. Again
d
1
= 0, and d
2
: Z→Z
g
is speciﬁed by the equation d
2
(1) = (2, ··· , 2) since each a
i
appears in the attaching word of the 2 cell with total exponent 2, which means that
each ∆
αβ
is homotopic to the map z
z
2
, of degree 2. Since d
2
(1) = (2, ··· , 2), we
have d
2
injective and hence H
2
(N
g
) = 0. If we change the basis for Z
g
by replacing
the last standard basis element (0, ··· , 0, 1) by (1, ··· , 1), we see that H
1
(N
g
) ≈
Z
g−1
⊕Z
2
.
142 Chapter 2. Homology
Example 2.38. Let X be obtained from S
1
∨S
1
by attaching two 2 cells by the words
a
5
b
−3
and b
3
(ab)
−2
. Then d
2
: Z
2
→Z
2
has matrix
5 −2
−3 1
. The two columns come
from abelianizing a
5
b
−3
and b
3
(ab)
−2
to 5a−3b and −2a+b, in additive notation.
The matrix has determinant −1, hence is an isomorphism. Therefore
`
H
i
(X) = 0 for
all i. Such a space X is called acyclic.
It is interesting to note that this acyclic complex X is not contractible, since
its fundamental group is nontrivial. Namely, π
1
(X) has the presentation ¹ a, b ¦
a
5
b
−3
, b
3
(ab)
−2
), and there is a nontrivial homomorphism from this group to the
group G of rotational symmetries of a regular dodecahedron, sending a to the rota
tion ρ
a
through angle 2π/5 about the axis through the center of a pentagonal face,
and b to the rotation ρ
b
through angle 2π/3 about the axis through a vertex of this
face. The composition ρ
a
ρ
b
is a rotation through angle π about the axis through the
midpoint of an edge abutting this vertex. Thus the relations a
5
= b
3
= (ab)
2
deﬁn
ing π
1
(X) become ρ
5
a
= ρ
3
b
= (ρ
a
ρ
b
)
2
= 1 in G, which means there is a welldeﬁned
homomorphism ρ : π
1
(X)→G sending a to ρ
a
and b to ρ
b
. It is not hard to see that
G is generated by ρ
a
and ρ
b
, so ρ is surjective. With more work one can compute
that the kernel of ρ is Z
2
, generated by the element a
5
= b
3
= (ab)
2
, and this Z
2
is
in fact the center of π
1
(X). In particular, π
1
(X) has order 120 since G has order 60.
After these 2 dimensional examples, let us now move up to three dimensions,
where we have the additional task of computing the cellular boundary map d
3
.
c
c
c
c
b
b
b
b
a
a
a
a
c
c
c
c
b
b
b
b
a
a
a
a
Example 2.39. A 3 dimensional torus
T
3
= S
1
×S
1
×S
1
can be constructed
from a cube by identifying each pair
of opposite square faces as in the ﬁrst
of the two ﬁgures. The second ﬁgure
shows a slightly different pattern of
identiﬁcations of opposite faces, with the front and back faces now identiﬁed via a
rotation of the cube around a horizontal leftright axis. The space produced by these
identiﬁcations is the product K×S
1
of a Klein bottle and a circle. For both T
3
and
K×S
1
we have a CW structure with one 3 cell, three 2 cells, three 1 cells, and one
0 cell. The cellular chain complexes thus have the form
0 →Z
d
3
→Z
3
d
2
→Z
3
0
→Z →0
In the case of the 3 torus T
3
the cellular boundary map d
2
is zero by the same
calculation as for the 2 dimensional torus. We claim that d
3
is zero as well. This
amounts to saying that the three maps ∆
αβ
: S
2
→S
2
corresponding to the three 2 cells
have degree zero. Each ∆
αβ
maps the interiors of two opposite faces of the cube
homeomorphically onto the complement of a point in the target S
2
and sends the
remaining four faces to this point. Computing local degrees at the center points of
the two opposite faces, we see that the local degree is +1 at one of these points and
Section 2.2. Computations and Applications 143
−1 at the other, since the restrictions of ∆
αβ
to these two faces differ by a reﬂection
of the boundary of the cube across the plane midway between them, and a reﬂection
has degree −1. Since the cellular boundary maps are all zero, we deduce that H
i
(T
3
)
is Z for i = 0, 3, Z
3
for i = 1, 2, and 0 for i > 3.
For K×S
1
, when we compute local degrees for the front and back faces we ﬁnd
that the degrees now have the same rather than opposite signs since the map ∆
αβ
on
these two faces differs not by a reﬂection but by a rotation of the boundary of the cube.
The local degrees for the other faces are the same as before. Using the letters A, B, C
to denote the 2 cells given by the faces orthogonal to the edges a, b, c, respectively,
we have the boundary formulas d
3
e
3
= 2C, d
2
A = 2b, d
2
B = 0 = d
2
C. It
follows that H
3
(K×S
1
) = 0, H
2
(K×S
1
) = Z⊕Z
2
, and H
1
(K×S
1
) = Z⊕Z⊕Z
2
.
Many more examples of a similar nature, quotients of a cube or other polyhedron
with faces identiﬁed in some pattern, could be worked out in similar fashion. But let
us instead turn to some higherdimensional examples.
Example 2.40: Moore Spaces. Given an abelian group G and an integer n ≥ 1, we
shall construct a CW complex X such that H
n
(X) ≈ G and
`
H
i
(X) = 0 for i ≠ n.
Such a space is called a Moore space, commonly written M(G, n) to indicate the
dependence on G and n. It is probably best for the deﬁnition of a Moore space
to include the condition that M(G, n) be simplyconnected if n > 1. The ones we
construct will have this property.
As an easy special case, when G = Z
m
we can take X to be S
n
with a cell e
n+1
attached by a map S
n
→S
n
of degree m. More generally, any ﬁnitely generated G can
be realized by taking wedge sums of examples of this type for ﬁnite cyclic summands
of G, together with copies of S
n
for inﬁnite cyclic summands of G.
In the general nonﬁnitely generated case let F→G be a homomorphism of a free
abelian group F onto G, sending a basis for F onto some set of generators of G. The
kernel K of this homomorphism is a subgroup of a free abelian group, hence is itself
free abelian. Choose bases ¦x
α
¦ for F and ¦y
β
¦ for K, and write y
β
=
¸
α
d
βα
x
α
.
Let X
n
=
α
S
n
α
, so H
n
(X
n
) ≈ F via Corollary 2.25. We shall obtain X from X
n
by
attaching cells e
n+1
β
via maps f
β
: S
n
→X
n
such that the composition of f
β
with the
projection onto the summand S
n
α
has degree d
βα
. Then the cellular boundary map
d
n+1
will be the inclusion K
F , hence X will have the desired homology groups.
The construction of f
β
generalizes the earlier construction of a map S
n
→S
n
of
given degree. Let f
β
map the complement of
¸
α
¦d
βα
¦ disjoint balls in S
n
to the
0 cell of X
n
, while mapping ¦d
βα
¦ of the balls onto the summand S
n
α
by maps of
degree +1 if d
βα
> 0, or degree −1 in the opposite case.
Example 2.41. By taking a wedge sum of the Moore spaces constructed in the preced
ing example for varying n we obtain a connected CW complex with any prescribed
sequence of homology groups in dimensions 1, 2, 3, ···.
144 Chapter 2. Homology
Example 2.42: Real Projective Space RP
n
. As we saw in Example 0.4, RP
n
has a
CW structure with one cell e
k
in each dimension k ≤ n, and the attaching map for
e
k
is the 2 sheeted covering projection ϕ: S
k−1
→RP
k−1
. Computing the boundary
map d
k
is the same as computing the degree of the composition S
k−1
ϕ
→RP
k−1
q
→
RP
k−1
/RP
k−2
= S
k−1
, with q the quotient map. The map qϕ is a homeomorphism
when restricted to each component of S
k−1
−S
k−2
, and these two homeomorphisms
are obtained fromeach other by precomposing with the antipodal map of S
k−1
, which
has degree (−1)
k
. Hence deg qϕ = deg 11+deg(−11) = 1+(−1)
k
, and so d
k
is either
0 or multiplication by 2 according to whether k is odd or even. Thus the cellular
chain complex for RP
n
is
0 →Z
2
→Z
0
→···
2
→Z
0
→Z
2
→Z
0
→Z →0 if n is even
0 →Z
0
→Z
2
→···
2
→Z
0
→Z
2
→Z
0
→Z →0 if n is odd
From this it follows that
H
k
(RP
n
) =
¸
¸
Z for k = 0 and for k = n odd
Z
2
for k odd, 0 < k < n
0 otherwise.
Example 2.43: Lens Spaces. This example is somewhat more complicated. Given an
integer m > 1 and integers
1
, ··· ,
n
relatively prime to m, deﬁne the lens space L =
L
m
(
1
, ··· ,
n
) to be the orbit space S
2n−1
/Z
m
of the unit sphere S
2n−1
⊂ C
n
with the
action of Z
m
generated by the rotation ρ(z
1
, ··· , z
n
) = (e
2πi
1
/m
z
1
, ··· , e
2πi
n
/m
z
n
),
rotating the j
th
C factor of C
n
by the angle 2π
j
/m. In particular, when m= 2, ρ
is the antipodal map, so L = RP
2n−1
in this case. In the general case, the projection
S
2n−1
→L is a covering space since the action of Z
m
on S
2n−1
is free: Only the identity
element ﬁxes any point of S
2n−1
since each point of S
2n−1
has some coordinate z
j
nonzero and then e
2πik
j
/m
z
j
≠ z
j
for 0 < k < m, as a result of the assumption that
j
is relatively prime to m.
We shall construct a CW structure on L with one cell e
k
in each dimension k ≤
2n−1 and show that the resulting cellular chain complex is
0 →Z
0
→Z
m
→Z
0
→···
0
→Z
m
→Z
0
→Z →0
with boundary maps alternately 0 and multiplication by m. Hence
H
k
¸
L
m
(
1
, ··· ,
n
)
=
¸
¸
Z for k = 0, 2n−1
Z
m
for k odd, 0 < k < 2n−1
0 otherwise.
To obtain the CW structure, ﬁrst subdivide the unit circle C in the n
th
C factor
of C
n
by taking the points e
2πij/m
∈ C as vertices, j = 1, ··· , m. Joining the j
th
vertex of C to the unit sphere S
2n−3
⊂ C
n−1
by arcs of great circles in S
2n−1
yields
a (2n−2) dimensional ball B
2n−2
j
bounded by S
2n−3
. Speciﬁcally, B
2n−2
j
consists of
the points cos θ (0, ··· , 0, e
2πij/m
)+sinθ (z
1
, ··· , z
n−1
, 0) for 0 ≤ θ ≤ π/2. Similarly,
Section 2.2. Computations and Applications 145
joining the j
th
edge of C to S
2n−3
gives a ball B
2n−1
j
bounded by B
2n−2
j
and B
2n−2
j+1
,
subscripts being taken mod m. The rotation ρ carries S
2n−3
to itself and rotates C
by the angle 2π
n
/m, hence ρ permutes the B
2n−2
j
’s and the B
2n−1
j
’s. A suitable
power of ρ, namely ρ
r
where r
n
≡ 1 mod m, takes each B
2n−2
j
and B
2n−1
j
to the
next one. Since ρ
r
has order m, it is also a generator of the rotation group Z
m
, and
hence we may obtain L as the quotient of one B
2n−1
j
by identifying its two faces B
2n−2
j
and B
2n−2
j+1
together via ρ
r
.
In particular, when n = 2, B
2n−1
j
is a lensshaped 3 ball and
L is obtained from this ball by identifying its two curved
disk faces via ρ
r
, which may be described as the com
position of the reﬂection across the plane containing
the rim of the lens, taking one face of the lens to the
other, followed by a rotation of this face through the angle
2π/m where = r
1
. The ﬁgure illustrates the case (m, ) =
(7, 2), with the two dots indicating a typical pair of identiﬁed points in the upper and
lower faces of the lens. Since the lens space L is determined by the rotation angle
2π/m, it is conveniently written L
/m
. Clearly only the mod m value of matters.
It is a classical theorem of Reidemeister from the 1930’s that L
/m
is homeomorphic
to L
¹
/m
¹ iff m
¹
= m and
¹
≡ :
:1
mod m. For example, when m= 7 there are only
two distinct lens spaces L
1/7
and L
2/7
. The ‘if’ part of this theorem is easy: Reﬂecting
the lens through a mirror shows that L
/m
≈ L
−/m
, and by interchanging the roles
of the two C factors of C
2
one obtains L
/m
≈ L
−1
/m
. In the converse direction,
L
/m
≈ L
¹
/m
¹ clearly implies m= m
¹
since π
1
(L
/m
) ≈ Z
m
. The rest of the theorem
takes considerably more work, however, involving either special 3 dimensional tech
niques or more algebraic methods which generalize to classify the higherdimensional
lens spaces as well. The latter approach is explained in [Cohen].
Returning to the construction of a CW structure on L
m
(
1
, ··· ,
n
), observe that
the (2n − 3) dimensional lens space L
m
(
1
, ··· ,
n−1
) sits in L
m
(
1
, ··· ,
n
) as the
quotient of S
2n−3
, and L
m
(
1
, ··· ,
n
) is obtained from this subspace by attaching
two cells, of dimensions 2n−2 and 2n−1, coming from the interiors of B
2n−1
j
and
its two identiﬁed faces B
2n−2
j
and B
2n−2
j+1
. Inductively this gives a CW structure on
L
m
(
1
, ··· ,
n
) with one cell e
k
in each dimension k ≤ 2n−1.
The boundary maps in the associated cellular chain complex are computed as
follows. The ﬁrst one, d
2n−1
, is zero since the identiﬁcation of the two faces of
B
2n−1
j
is via a reﬂection (degree −1) across B
2n−1
j
ﬁxing S
2n−3
, followed by a rota
tion (degree +1), so d
2n−1
(e
2n−1
) = e
2n−2
− e
2n−2
= 0. The next boundary map
d
2n−2
takes e
2n−2
to me
2n−3
since the attaching map for e
2n−2
is the quotient map
S
2n−3
→L
m
(
1
, ··· ,
n−1
) and the balls B
2n−3
j
in S
2n−3
which project down onto e
2n−3
are permuted cyclically by the rotation ρ of degree +1. Inductively, the subsequent
boundary maps d
k
then alternate between 0 and multiplication by m.
146 Chapter 2. Homology
Also of interest are the inﬁnitedimensional lens spaces L
m
(
1
,
2
, ···) = S
∞
/Z
m
deﬁned in the same way as in the ﬁnitedimensional case, starting from a sequence of
integers
1
,
2
, ··· relatively prime to m. The space L
m
(
1
,
2
, ···) is the union of the
increasing sequence of ﬁnitedimensional lens spaces L
m
(
1
, ··· ,
n
) for n = 1, 2, ... ,
each of which is a subcomplex of the next in the cell structure we have just con
structed, so L
m
(
1
,
2
, ···) is also a CW complex. Its cellular chain complex consists
of a Z in each dimension with boundary maps alternately 0 and m, so its reduced
homology consists of a Z
m
in each odd dimension.
In the terminology of §1.B, the inﬁnitedimensional lens space L
m
(
1
,
2
, ···) is
an EilenbergMacLane space K(Z
m
, 1) since its universal cover S
∞
is contractible, as
we showed there. By Theorem 1B.8 the homotopy type of L
m
(
1
,
2
, ···) depends
only on m, and not on the
i
’s. This is not true in the ﬁnitedimensional case, when
two lens spaces L
m
(
1
, ··· ,
n
) and L
m
(
¹
1
, ··· ,
¹
n
) have the same homotopy type
iff
1
···
n
≡ :k
n
¹
1
···
¹
n
mod m for some integer k. A proof of this is outlined
in exercise 2 in §3.E and exercise 45 in §4.1. For example, the threedimensional
lens spaces L
1/5
and L
2/5
are not homotopy equivalent, though they have the same
fundamental group and the same homology groups. On the other hand, L
1/7
and L
2/7
are homotopy equivalent but not homeomorphic.
Euler Characteristic
For a ﬁnite CW complex X, the Euler characteristic χ(X) is deﬁned to be the
alternating sum
¸
n
(−1)
n
c
n
where c
n
is the number of n cells of X, generalizing
the familiar formula vertices − edges + faces for 2 dimensional simplicial complexes.
The following result shows that χ(X) can be deﬁned purely in terms of homology, and
hence depends only on the homotopy type of X. In particular, χ(X) is independent
of the choice of CW structure on X.
Theorem 2.44. χ(X) =
¸
n
(−1)
n
rank H
n
(X).
Here the rank of a ﬁnitely generated abelian group is the number of Z summands
when the group is expressed as a direct sum of cyclic groups. We shall need the
following fact, whose proof we leave as an exercise: If 0→A→B→C→0 is a short
exact sequence of ﬁnitely generated abelian groups, then rank B = rank A+rank C.
Proof of 2.44: This is purely algebraic. Let
0 →C
k
d
k
→C
k−1
→··· →C
1
d
1
→C
0
→0
be a chain complex of ﬁnitely generated abelian groups, with cycles Z
n
= Ker d
n
,
boundaries B
n
= Imd
n+1
, and homology H
n
= Z
n
/B
n
. Thus we have short exact
sequences 0→Z
n
→C
n
→B
n−1
→0 and 0→B
n
→Z
n
→H
n
→0, hence
rank C
n
= rank Z
n
+rank B
n−1
rank Z
n
= rank B
n
+rank H
n
Section 2.2. Computations and Applications 147
Now substitute the second equation into the ﬁrst, multiply the resulting equation by
(−1)
n
, and sum over n to get
¸
n
(−1)
n
rank C
n
=
¸
n
(−1)
n
rank H
n
. Applying this
with C
n
= H
n
(X
n
, X
n−1
) then gives the theorem. L¦
For example, the surfaces M
g
and N
g
have Euler characteristics χ(M
g
) = 2−2g
and χ(N
g
) = 2 −g. Thus all the orientable surfaces M
g
are distinguished from each
other by their Euler characteristics, as are the nonorientable surfaces N
g
, and there
are only the relations χ(M
g
) = χ(N
2g
).
Split Exact Sequences
Suppose one has a retraction r : X→A, so ri = 11 where i : A→X is the inclusion.
The induced map i
∗
: H
n
(A)→H
n
(X) is then injective since r
∗
i
∗
= 11. From this it
follows that the boundary maps in the long exact sequence for (X, A) are zero, so the
long exact sequence breaks up into short exact sequences
0 →H
n
(A)
i
∗
→H
n
(X)
j
∗
→H
n
(X, A) →0
The relation r
∗
i
∗
= 11 actually gives more information than this, by the following
piece of elementary algebra:
Splitting Lemma. For a short exact sequence 0 →A
i
→B
j
→C →0 of abelian
groups the following statements are equivalent:
(a) There is a homomorphism p: B→A such that pi = 11: A→A.
(b) There is a homomorphism s : C→B such that js = 11: C→C.
(c) There is an isomorphism B ≈ A⊕C making a commutative diagram
0
−
−
−
−
−
→
A −−−−−−−→
B
−−−−−−−→
−
−
−
−
−
−
−
→
A C
−
−
−
−
−
−
→
−
−
−
−
−
−
→
i
C 0 −−−−−−−→
j
⊕
≈
where the maps in the lower roware the obvious ones, a
(a, 0), and (a, c)
c.
If these conditions are satisﬁed the exact sequence is said to split. Note that (c)
is symmetric: There is no essential difference between the roles of A and C.
Sketch of Proof: For (a) ⇒ (c) one checks that the map B→A⊕C, b
¸
p(b), j(b)
,
is an isomorphism with the desired properties. For (b) ⇒ (c) one uses instead the
map A⊕C→B, (a, c)
i(a) + s(c). The opposite implications (c) ⇒ (a) and (c) ⇒
(b) are fairly obvious. If one wants to show (b) ⇒ (a) directly, one can deﬁne p(b) =
i
−1
¸
b −sj(b)
. Further details are left to the reader. L¦
Except for the implications (b) ⇒ (a) and (b) ⇒ (c), the proof works equally well
for nonabelian groups. In the nonabelian case, (b) is deﬁnitely weaker than (a) and (c),
and short exact sequences satisfying (b) only determine B as a semidirect product
148 Chapter 2. Homology
of A and C. The difﬁculty is that s(C) might not be a normal subgroup of B. In the
nonabelian case one deﬁnes ‘splitting’ to mean that (b) is satisﬁed.
In both the abelian and nonabelian contexts, if C is free then every exact sequence
0→A
i
→B
j
→C→0 splits, since one can deﬁne s : C→B by choosing a basis ¦c
α
¦
for C and letting s(c
α
) be any element b
α
∈ B such that j(b
α
) = c
α
. The converse
is also true: If every short exact sequence ending in C splits, then C is free. This is
because for every C there is a short exact sequence 0→A→B→C→0 with B free
— choose generators for C and let B have a basis in onetoone correspondence with
these generators, then let B→C send each basis element to the corresponding gen
erator — so if this sequence 0→A→B→C→0 splits, C is isomorphic to a subgroup
of a free group, hence is free.
From the Splitting Lemma and the remarks preceding it we deduce that a retrac
tion r : X→A gives a splitting H
n
(X) ≈ H
n
(A)⊕H
n
(X, A). This can be used to show
the nonexistence of such a retraction in some cases, for example in the situation of
the Brouwer ﬁxed point theorem, where a retraction D
n
→S
n−1
would give an im
possible splitting H
n−1
(D
n
) ≈ H
n−1
(S
n−1
)⊕H
n−1
(D
n
, S
n−1
). For a somewhat more
subtle example, consider the mapping cylinder M
f
of a degree m map f : S
n
→S
n
.
For the inclusion i : S
n
M
f
of the domain S
n
, the homology long exact sequence
reduces to a short exact sequence
−−−−−−−→Z −−−−−−−−→
m
Z −−−−−−−−→Z −−−−−−→0 0
−−−−→ −−−−→ −−−−→ −−−−→0 0 H ( ) S
n
n
H ( ) M
f
M
f n
H ( ) S
n
n
m
,
=
=
=
=
=
=
If m > 1 this sequence does not split since Z is not isomorphic to Z⊕Z
m
, so S
n
is
not a retract of M
f
. In the simplest case of the degree 2 map S
1
→S
1
, z
z
2
, this
says the M¨obius band does not retract onto its boundary circle.
Homology of Groups
In §1.B we constructed for each group G a CW complex K(G, 1) having a con
tractible universal cover, and we showed that the homotopy type of such a space
K(G, 1) is uniquely determined by G. The homology groups H
n
(K(G, 1)) therefore
depend only on G, and are usually denoted simply by H
n
(G). The calculations for
lens spaces in Example 2.43 showthat H
n
(Z
m
) is Z
m
for odd n and 0 for even n > 0.
Since S
1
is a K(Z, 1) and the torus is a K(Z×Z, 1), we also knowthe homology of these
two groups. More generally the homology of ﬁnitelygenerated abelian groups can be
computed from these examples using the K¨ unneth formula in §3.B and the fact that
a product K(G, 1)×K(H, 1) is a K(G×H, 1).
Here is an application of the calculation of H
n
(Z
m
):
Proposition 2.45. If a ﬁnitedimensional CW complex X is a K(G, 1), then the group
G = π
1
(X) must be torsionfree.
Section 2.2. Computations and Applications 149
This applies to quite a few manifolds, for example closed surfaces other than
S
2
and RP
2
, and also many 3 dimensional manifolds such as complements of knots
in S
3
.
Proof: If G had torsion, it would have a ﬁnite cyclic subgroup Z
m
for some m > 1,
and the covering space of X corresponding to this subgroup of G = π
1
(X) would be
a K(Z
m
, 1). Since X is a ﬁnitedimensional CW complex, the same would be true of its
covering space K(Z
m
, 1), hence the homology of the K(Z
m
, 1) would be nonzero in
only ﬁnitely many dimensions. But this contradicts the fact that H
n
(Z
m
) is nonzero
for inﬁnitely many values of n. L¦
Reﬂecting the richness of group theory, the subject of Homology of Groups is
quite extensive. A good starting place for those wishing to learn more is the textbook
[K.Brown], and at a more advanced level the books [AdemMilgram] and [Benson 1992]
treat the subject from a mostly topological viewpoint.
MayerVietoris Sequences
In addition to the long exact sequence of homology groups for a pair (X, A), there
is another sort of long exact sequence, known as a MayerVietoris sequence, which
is equally powerful but is sometimes more convenient to use. For a pair of subspaces
A, B ⊂ X such that X is the union of the interiors of A and B, this exact sequence
has the form
··· →H
n
(A∩B)
Φ
→H
n
(A) ⊕H
n
(B)
Ψ
→H
n
(X)
∂
→H
n−1
(A∩B) →···
··· →H
0
(X) →0
In addition to its usefulness for calculations, the MayerVietoris sequence is also ap
plied frequently in induction arguments, where one might know that a certain state
ment is true for A, B, and A∩B by induction, and then deduce that it is true for A∪B
by the exact sequence.
The MayerVietoris sequence is easy to derive from the machinery of §2.1. Let
C
n
(A+B) be the subgroup of C
n
(X) consisting of chains which are sums of chains in
A and chains in B. The usual boundary map ∂ : C
n
(X)→C
n−1
(X) takes C
n
(A+B) to
C
n−1
(A+B), so the C
n
(A+B)’s form a chain complex. According to Proposition 2.21,
the inclusions C
n
(A + B)
C
n
(X) induce isomorphisms on homology groups. The
MayerVietoris sequence is then the long exact sequence of homology groups asso
ciated to the short exact sequence of chain complexes formed by the short exact
sequences
0 →C
n
(A∩B)
ϕ
→C
n
(A) ⊕C
n
(B)
ψ
→C
n
(A+B) →0
where ϕ(x) = (x, −x) and ψ(x, y) = x + y. The exactness of this short exact
sequence can be checked as follows. First, Ker ϕ = 0 since a chain in A ∩ B which
150 Chapter 2. Homology
is zero as a chain in A (or in B) must be the zero chain. Next, Imϕ ⊂ Ker ψ since
ψϕ = 0, and Ker ψ ⊂ Imϕ since for a pair (x, y) ∈ C
n
(A)⊕C
n
(B) the condition
x + y = 0 implies x = −y, so x is a chain in both A and B, i.e., x ∈ C
n
(A ∩ B)
and (x, y) = (x, −x) ∈ Imϕ. Finally, exactness at C
n
(A+B) is immediate from the
deﬁnition of C
n
(A+B).
The boundary map ∂ : H
n
(X)→H
n−1
(A∩B) can easily be described by recalling
how the boundary map in the long exact sequence of homology groups associated
to a short exact sequence of chain complexes is deﬁned. An element α ∈ H
n
(X) is
represented by a cycle z, and by barycentric subdivision or some other method we
can choose z to be a sum x + y of chains in A and B, respectively. It need not be
true that x and y are cycles individually, but ∂x = −∂y since ∂(x +y) = 0, and the
element ∂α ∈ H
n−1
(A∩B) is represented by the cycle ∂x = −∂y.
There is also a formally identical MayerVietoris sequence for reduced homology
groups, obtained by augmenting the previous short exact sequence of chain complexes
in the obvious way:
−−−−−→
−−−−−→
−−−−−→ −−−−−→ −−−−−→ −−−−−→ A B C 0
0 0
( )
−−−−−→
0 A C ( )
0
B C ( ) ∩ ⊕
⊕
⊕
0
A C ( B ) +
ψ
ψ
ϕ
ϕ
ε ε ε ε
−−−−−−−→Z −−−−−−−−→Z Z −−−−−−−−→Z −−−−−−→0 0
MayerVietoris sequences can be thought of as the homology version of the van
Kampen theoremsince if A∩B is pathconnected, the H
1
terms of the reduced Mayer
Vietoris sequence yield an isomorphism H
1
(X) ≈ H
1
(A)⊕H
1
(B)/ ImΦ. This is exactly
the abelianized statement of the van Kampen theorem, and H
1
is the abelianization
of π
1
for pathconnected spaces, as we show in §2.A.
There are MayerVietoris sequences also for decompositions X = A∪B such that
A and B are deformation retracts of neighborhoods U and V with U∩V deformation
retracting onto A∩B. Under these assumptions the ﬁvelemma implies that the maps
C
n
(A + B)→C
n
(U + V) induce isomorphisms on homology, hence also the maps
C
n
(A+B)→C
n
(X), which was all that we needed to obtain a MayerVietoris sequence.
For example if X is a CW complex and A and B are subcomplexes, then we can
choose for U and V neighborhoods of the form N
ε
(A) and N
ε
(B) constructed in the
Appendix, which have the property that N
ε
(A) ∩N
ε
(B) = N
ε
(A∩B).
Example 2.46. Take X = S
n
with A and B the northern and southern hemispheres,
so that A ∩ B = S
n−1
. Then in the reduced MayerVietoris sequence the terms
`
H
i
(A)⊕
`
H
i
(B) are zero, so we obtain isomorphisms
`
H
i
(S
n
) ≈
`
H
i−1
(S
n−1
). This gives
another way of calculating the homology groups of S
n
by induction.
Example 2.47. We can decompose the Klein bottle K as the union of two M¨obius
bands A and B glued together by a homeomorphism between their boundary circles.
Then A, B, and A ∩ B are homotopy equivalent to circles, so the interesting part of
Section 2.2. Computations and Applications 151
the reduced MayerVietoris sequence for the decomposition K = A∪B is the segment
0 →H
2
(K) →H
1
(A∩B)
Φ
→H
1
(A)⊕H
1
(B) →H
1
(K) →0
The map Φ is Z→Z⊕Z, 1
(2, −2), since the boundary circle of a M¨obius band wraps
twice around the core circle. Since Φ is injective we obtain H
2
(K) = 0. Furthermore
we have H
1
(K) ≈ Z⊕Z
2
since we can choose (1, 0) and (1, −1) as a basis for Z⊕Z. All
the higher homology groups of K are zero from the earlier part of the MayerVietoris
sequence.
Example 2.48. Let us describe an exact sequence which is somewhat similar to the
MayerVietoris sequence and which in some cases generalizes it. If we are given two
maps f, g : X→Y then we can form a quotient space Z of the disjoint union of X×I
and Y via the identiﬁcations (x, 0) ∼ f(x) and (x, 1) ∼ g(x), thus attaching one
end of X×I to Y by f and the other end by g. For example, if f and g are each the
identity map X→X then Z = X×S
1
. If only one of f and g, say f , is the identity
map, then Z is homeomorphic to what is called the mapping torus of g, the quotient
space of X×I under the identiﬁcations (x, 0) ∼ (g(x), 1). The Klein bottle is an
example, with g a reﬂection S
1
→S
1
.
The exact sequence we want has the form
(∗) ··· →H
n
(X)
f
∗
−g
∗
→H
n
(Y)
i
∗
→H
n
(Z) →H
n−1
(X)
f
∗
−g
∗
→H
n−1
(Y) →···
where i is the evident inclusion Y
Z. To derive this exact sequence, consider
the map q : (X×I, X×∂I)→(Z, Y) that is the restriction to X×I of the quotient map
X×I IY→Z. The map q induces a map of long exact sequences:
−
−
−
−
−
→
−−−→ −−−→
X I H ( ) ,
−−−−−−−−−−−→ −−−−−→
Y Z H ( ) , Y H
n
( )
−−−−−−−−→ −−−−−→
Z H
n
( )
n 1 +
n 1 +
× X H (
n
i
×
−−−→ −−−→
) X H (
n
× X I ×
∂
∂
∂ I ) I ∂
∗
i
∗
q
∗
−
−
−
−
−
→
q
∗
−
−
−
−
−
→
q
∗
. . .
. . .
. . .
. . .
0 0
In the upper row the middle term is the direct sum of two copies of H
n
(X), and the
map i
∗
is surjective since X×I deformation retracts onto X×¦0¦ and X×¦1¦. Sur
jectivity of the maps i
∗
in the upper row implies that the next maps are 0, which
in turn implies that the maps ∂ are injective. Thus the map ∂ in the upper row
gives an isomorphism of H
n+1
(X×I, X×∂I) onto the kernel of i
∗
, which consists of
the pairs (α, −α) for α ∈ H
n
(X). This kernel is a copy of H
n
(X), and the middle
vertical map q
∗
takes (α, −α) to f
∗
(α) − g
∗
(α). The lefthand q
∗
is an isomor
phismsince these are good pairs and q induces a homeomorphismof quotient spaces
(X×I)/(X×∂I)→Z/Y . Hence if we replace H
n+1
(Z, Y) in the lower exact sequence
by the isomorphic group H
n
(X) ≈ Ker i
∗
we obtain the long exact sequence we want.
In the case of the mapping torus of a reﬂection g : S
1
→S
1
, with Z a Klein bottle,
the interesting portion of the exact sequence (∗) is
152 Chapter 2. Homology
Z −−−−−−−−→Z
−−−→ −−−→ −−−−→ −−−→ 0 0
= =
H ( ) S
1
1
H ( ) Z
2
H ( ) S
1
1
−−−→ −−−→
H ( ) S
0
1
H ( ) Z
1
H ( ) S
0
1
2
Z −−−−−−−−→Z
= =
0
11
∗
g
−−−−→
11
∗
g
Thus H
2
(Z) = 0 and we have a short exact sequence 0→Z
2
→H
1
(Z)→Z→0. This
splits since Z is free, so H
1
(Z) = Z
2
⊕Z. Other examples are given in the exercises.
If Y is the disjoint union of spaces Y
1
and Y
2
, with f : X→Y
1
and g : X→Y
2
, then
Z is the union of the mapping cylinders of these two maps. For example, suppose we
have a CW complex decomposed as the union of two subcomplexes A and B and we
take f and g to be the inclusions A∩B
A and A∩B
B. Then the double mapping
cylinder Z is homotopy equivalent to A∪B since we can view Z as (A∩B)×I with
A and B attached at the two ends, and then slide the attaching of A down to the B
end to produce A∪B with (A∩B)×I attached at one of its ends. By Proposition 0.18
the sliding operation preserves homotopy type, so we obtain a homotopy equivalence
Z = A∪B. The exact sequence (∗) in this case is the MayerVietoris sequence.
A relative form of the MayerVietoris sequence is sometimes useful. If one has a
pair of spaces (X, Y) = (A ∪ B, C ∪ D) with C ⊂ A and D ⊂ B, such that X is the
union of the interiors of A and B, and Y is the union of the interiors of C and D,
then there is a relative MayerVietoris sequence
··· →H
n
(A∩B, C ∩D)
Φ
→H
n
(A, C) ⊕H
n
(B, D)
Ψ
→H
n
(X, Y)
∂
→···
To derive this, consider the commutative diagram
−−→ −−→
−−−−−→ −−−−−→ −−−−−→ −−−−−→ C D C 0 ( )
−−→
0 C C ( ) D C ( ) ∩ ⊕ C C ( D) +
ψ ϕ
−−→ −−→
−−−−−→ −−−−−→ −−−−−→ −−−−−→ A B C 0 ( )
−−→
0 A C ( ) B C ( ) ∩ ⊕ A C ( B ) +
ψ ϕ
−−→ −−→
−−−→ −−−−→ −−−−→ −−→ A B C 0
0 0 0
0 0 0
( )
−−→
−−→ −−→ −−→
0 A C ( ) B C ( ) ∩ C D ∩ ⊕ A C ( B ) + C D +
ψ ϕ
n n n n
n n n n
n n n n
, C , D , ,
where C
n
(A + B, C + D) is the quotient of the subgroup C
n
(A + B) ⊂ C
n
(X) by its
subgroup C
n
(C + D) ⊂ C
n
(Y). Thus the three columns of the diagram are exact.
We have seen that the ﬁrst two rows are exact, and we claim that the third row is
exact also, with the maps ϕ and ψ induced from the ϕ and ψ in the second row.
Since ψϕ = 0 in the second row, this holds also in the third row, so the third row
is at least a chain complex. Viewing the three rows as chain complexes, the diagram
then represents a short exact sequence of chain complexes. The associated long exact
sequence of homology groups has two out of every three terms zero since the ﬁrst
two rows of the diagram are exact. Hence the remaining homology groups are zero
too, and the third row is exact.
Section 2.2. Computations and Applications 153
The third column maps to 0→C
n
(Y)→C
n
(X)→C
n
(X, Y)→0, inducing maps
of homology groups which are isomorphisms for the X and Y terms as we have
seen above. So by the ﬁvelemma the maps C
n
(A+B, C +D)→C
n
(X, Y) also induce
isomorphisms on homology. The relative MayerVietoris sequence is then the long
exact sequence of homology groups associated to the short exact sequence of chain
complexes given by the third row of the diagram.
Homology with Coefﬁcients
There is an easy generalization of the homology theory we have considered so
far which behaves in a very similar fashion and sometimes offers technical advan
tages. The generalization is deﬁned using chains of the form
¸
i
n
i
σ
i
where each
σ
i
is a singular n simplex in X as before, but now the coefﬁcients n
i
are taken
to lie in a ﬁxed abelian group G rather than Z. Such n chains form an abelian
group C
n
(X; G), and in the relative case one deﬁnes C
n
(X, A; G) = C
n
(X; G)/C
n
(A; G).
The old formula for the boundary maps ∂ can still be used for arbitrary G, namely
∂
¸¸
i
n
i
σ
i
=
¸
i,j
(−1)
j
n
i
σ
i
¦
¦[v
0
, ··· , v
j
, ··· , v
n
], and ∂
2
= 0 by the same calcula
tion. So the groups C
n
(X; G) and C
n
(X, A; G) form chain complexes, whose ho
mology groups H
n
(X; G) and H
n
(X, A; G) are called homology groups with coef
ﬁcients in G. Reduced groups
`
H
n
(X; G) are deﬁned via the augmented chain complex
··· →C
0
(X; G)
ε
→G →0 with ε again deﬁned by summing coefﬁcients.
The case G = Z
2
is particularly simple since one is just considering sums of sin
gular simplices with coefﬁcients 0 or 1, so by discarding terms with coefﬁcient 0
one can think of chains as just ﬁnite ‘unions’ of singular simplices. The boundary
formulas also simplify since one no longer has to worry about signs. Since signs are
an algebraic representation of orientation considerations, one can also ignore orienta
tions, so homology with Z
2
coefﬁcients is often the most natural tool in the absence
of orientability.
All the theory we developed in §2.1 for Z coefﬁcients carries over directly to gen
eral coefﬁcient groups G, with no change in the proofs. The equivalence of simplicial
and singular homology with G coefﬁcients also carries over without complication.
The same is true for MayerVietoris sequences.
Differences between H
n
(X; G) and H
n
(X) begin to appear only when one starts
making calculations. In the simplest case that X is a point, the method used for G = Z
shows that H
n
(X; G) is G for n = 0 and 0 for n > 0. From this it follows just as for
G = Z that
`
H
n
(S
k
; G) is G for n = k and 0 otherwise.
Cellular homology also generalizes to homology with coefﬁcients, with the cellu
lar chain group H
n
(X
n
, X
n−1
) replaced by H
n
(X
n
, X
n−1
; G) which is a direct sum of
G’s, one for each n cell. The proof that the cellular homology groups H
CW
n
(X) agree
with singular homology H
n
(X) extends immediately to give H
CW
n
(X; G) ≈ H
n
(X; G).
The cellular boundary maps are given by the same formula as for Z coefﬁcients,
154 Chapter 2. Homology
d
n
(
¸
α
n
α
e
n
α
) =
¸
α,β
d
αβ
n
α
e
n−1
β
where d
αβ
is the degree of a map ∆
αβ
: S
n−1
→S
n−1
.
This follows from:
Lemma 2.49. If f : S
k
→S
k
has degree m, then f
∗
: H
k
(S
k
; G)→H
k
(S
k
; G) is multi
plication by m.
Proof: As a preliminary observation, note that a homomorphism ϕ: G
1
→G
2
induces
maps ϕ
: C
n
(X, A; G
1
)→C
n
(X, A; G
2
) commuting with boundary maps, so there are
induced homomorphisms ϕ
∗
: H
n
(X, A; G
1
)→H
n
(X, A; G
2
). These have various nat
urality properties. For example, they give a commutative diagram mapping the long
exact sequence of homology for the pair (X, A) with G
1
coefﬁcients to the correspond
ing sequence with G
2
coefﬁcients. Also, the maps ϕ
∗
commute with homomorphisms
f
∗
induced by maps f : (X, A)→(Y, B).
Now let f : S
k
→S
k
have degree m and let ϕ: Z→G take 1 to a given element
g ∈ G. Then we have a commutative
diagram as at the right, where commu
−
−
−
−
−
→
−
−
−
−
−
→
−−−−−−→ k
S H ( )
f
∗
∗
f
∗
∼
k
≈
−−−−−−→ k
S G G H ( )
∼
k
≈
≈
≈
ϕ ϕ
∗
ϕ
;
;
Z
−
−
−
−
−
→
k
S H ( )
∼
k
k
S G H ( )
∼
k
;
;
Z Z
−
−
−
−
−
→
G
ϕ
Z
tativity of the outer two squares comes
from the inductive calculation of these
homology groups, reducing to the case k = 0 when the commutativity is obvious.
Since the diagram commutes, the assumption that the map across the top takes
1 to m implies that the map across the bottom takes g to mg. L¦
Example 2.50. It is instructive to see what happens for RP
n
when the coefﬁcient
group G is chosen to be a ﬁeld F . The cellular chain complex is
···
0
→F
2
→F
0
→F
2
→F
0
→F →0
Hence if F has characteristic 2, for example if F = Z
2
, then H
k
(RP
n
; F) ≈ F for
0 ≤ k ≤ n, a more uniformanswer than with Z coefﬁcients. On the other hand if F has
characteristic different from 2, then the boundary maps F
2
→F are isomorphisms,
hence H
k
(RP
n
; F) is F for k = 0 and for k = n odd, and is zero otherwise.
In §3.A we will see that there is a general algebraic formula expressing homology
with arbitrary coefﬁcients in terms of homology with Z coefﬁcients. Some easy special
cases which give much of the ﬂavor of the general result are included in the exercises.
In spite of the fact that homology with Z coefﬁcients determines homology with
other coefﬁcient groups, there are many situations where homology with a suitably
chosen coefﬁcient group can provide more information than homology with Z coef
ﬁcients. A good example of this is the proof of the BorsukUlam theorem using Z
2
coefﬁcients in §2.B.
As another illustration, we will now give an example of a map f : X→Y which
induces trivial maps f
∗
on homology with Z coefﬁcients but not on homology with
Z
m
coefﬁcients for suitably chosen m. Thus homology with Z
m
coefﬁcients tells us
Section 2.2. Computations and Applications 155
that f is not homotopic to a constant map, which we would not know using only Z
coefﬁcients.
Example 2.51. Let X be a Moore space M(Z
m
, n), obtained from S
n
by attaching
a cell e
n+1
by a map of degree m. The quotient map f : X→X/S
n
= S
n+1
induces
trivial homomorphisms on reduced homology with Z coefﬁcients since the nonzero
reduced homology groups of X and S
n+1
occur in different dimensions. But with Z
m
coefﬁcients the story is different, as we can see by considering the long exact sequence
of the pair (X, S
n
), which contains the segment
0 =
`
H
n+1
(S
n
; Z
m
) →
`
H
n+1
(X; Z
m
)
f
∗
→
`
H
n+1
(X/S
n
; Z
m
)
Exactness says that f
∗
is injective, hence nonzero since
`
H
n+1
(X; Z
m
) is Z
m
, the cel
lular boundary map H
n+1
(X
n+1
, X
n
; Z
m
)→H
n
(X
n
, X
n−1
; Z
m
) being Z
m
m
→Z
m
.
Exercises
1. Prove the Brouwer ﬁxed point theorem for maps f : D
n
→D
n
by applying degree
theory to the map S
n
→S
n
which sends both the northern and southern hemispheres
of S
n
to the southern hemisphere via f . [This was Brouwer’s original proof.]
2. Given a map f : S
2n
→S
2n
, show that there is some point x ∈ S
2n
with either
f(x) = x or f(x) = −x. Deduce that every map RP
2n
→RP
2n
has a ﬁxed point. Con
struct maps RP
2n−1
→RP
2n−1
without ﬁxed points, e.g., from linear transformations
R
2n
→R
2n
without eigenvectors.
3. Let f : S
n
→S
n
be a map of degree zero. Show that there exist points x, y ∈ S
n
with f(x) = x and f(y) = −y. Use this to show that if F is a continuous vector
ﬁeld deﬁned on the unit ball D
n
in R
n
such that F(x) ≠ 0 for all x, then there exists
a point on ∂D
n
where F points radially outward and another point on ∂D
n
where F
points radially inward.
4. Construct a surjective map S
n
→S
n
of degree zero, for each n ≥ 1.
5. Show that any two reﬂections of S
n
across different hyperplanes are homotopic,
in fact homotopic through reﬂections. [The linear algebra formula for a reﬂection, in
terms of inner products, may be helpful.]
6. Show that every map S
n
→S
n
can be homotoped to have a ﬁxed point if n > 0.
7. For an invertible linear transformation f : R
n
→R
n
show that the induced map
on H
n
(R
n
, R
n
− ¦0¦) ≈
`
H
n−1
(R
n
− ¦0¦) ≈ Z is 11 or −11 according to whether the
determinant of f is positive or negative. [Use Gaussian elimination to show that the
matrix of f can be joined by a path of invertible matrices to a diagonal matrix with
:1’s on the diagonal.]
8. A polynomial f(z) with complex coefﬁcients, viewed as a map C→C, can always
be extended to a continuous map of onepoint compactiﬁcations
f : S
2
→S
2
. Show
156 Chapter 2. Homology
that the degree of
f equals the degree of f as a polynomial. Show also that the local
degree of
f at a root of f is the multiplicity of the root.
9. Compute the homology groups of the following 2 complexes: (a) The quotient of
S
2
obtained by identifying north and south poles to a point. (b) S
1
×(S
1
∨S
1
). (c) The
space obtained from a disk D
2
with the interiors of two disjoint subdisks deleted by
identifying all three resulting boundary circles together via homeomorphisms preserv
ing clockwise orientations of these circles. (d) The quotient space of S
1
×S
1
obtained
by identifying points in the circle S
1
×¦x
0
¦ which differ by 2π/m rotation and also
identifying points in the circle ¦x
0
¦×S
1
which differ by 2π/n rotation.
10. Let X be the quotient space of S
2
under the identiﬁcations x ∼ −x for x in the
equator S
1
. Compute the homology groups H
i
(X). Do the same for S
3
with antipodal
points of the equatorial S
2
⊂ S
3
identiﬁed.
11. In an exercise for §1.2 we described a 3 dimensional CW complex obtained from
the cube I
3
by identifying opposite faces via a onequarter twist. Compute the ho
mology groups of this complex.
12. Show that the quotient map S
1
×S
1
→S
2
collapsing the subspace S
1
∨ S
1
to a
point is not nullhomotopic by showing that it induces an isomorphism on H
2
. On the
other hand, show via covering spaces that any map S
2
→S
1
×S
1
is nullhomotopic.
13. Let X be the 2 complex obtained from S
1
with its usual cell structure by attaching
two 2 cells by maps of degrees 2 and 3, respectively.
(a) Compute the homology groups of all the subcomplexes A ⊂ X and the corre
sponding quotient complexes X/A.
(b) Show that X = S
2
, and that the only subcomplex A ⊂ X with X/A = S
2
is the
trivial subcomplex consisting of the 0cell alone.
14. Show that a map f : S
n
→S
n
which satisﬁes f(x) = f(−x) for all x (such an f
is called an even function) must have even degree. Show that the degree must in fact
be zero when n is even. When n is odd, show there are even maps of any given even
degree. [Hints: Since f is even, it factors as a composition S
n
→RP
n
→S
n
. Using the
calculation of H
n
(RP
n
) in the text, show that the induced map H
n
(S
n
)→H
n
(RP
n
)
sends a generator to twice a generator when n is odd. It may be helpful to show that
the quotient map RP
n
→RP
n
/RP
n−1
induces an isomorphism on H
n
when n is odd.]
15. Show that if X is a CW complex then H
n
(X
n
) is free by identifying it with the
kernel of the cellular boundary map H
n
(X
n
, X
n−1
)→H
n−1
(X
n−1
, X
n−2
).
16. Consider ∆
n
= [v
0
, ··· , v
n
] with its natural ∆ complex structure with k simplices
[v
i
0
, ··· , v
i
k
] for i
0
< ··· < i
k
. Compute the ranks of the simplicial (or cellular) chain
groups ∆
i
(∆
n
) and the subgroups of cycles and boundaries. [Hint: Pascal’s triangle.]
Apply this, using also the previous problem, to show that the k skeleton of ∆
n
has
homology groups
`
H
i
¸
(∆
n
)
k
equal to 0 for i < k, and free of rank
n
k+1
for i = k.
Section 2.2. Computations and Applications 157
17. Show the isomorphism between cellular and singular homology is natural in the
following sense: A cellular map f : X→Y , i.e., one satisfying f(X
n
) ⊂ Y
n
for all n,
induces chain maps f
∗
between the cellular chain complexes of X and Y , hence also
f
∗
: H
CW
n
(X)→H
CW
n
(Y), and the latter map corresponds to f
∗
: H
n
(X)→H
n
(Y) under
the isomorphism H
CW
n
≈ H
n
.
18. For a CW pair (X, A) show there is a relative cellular chain complex formed by
the groups H
i
(X
i
, X
i−1
∪A
i
), having homology groups isomorphic to H
n
(X, A).
19. Compute H
i
(RP
n
/RP
m
) for m < n by cellular homology, using the standard CW
structure on RP
n
with RP
m
as its m skeleton.
20. For ﬁnite CW complexes X and Y , show that χ(X×Y) = χ(X)χ(Y).
21. If a ﬁnite CW complex X is the union of subcomplexes A and B, show that
χ(X) = χ(A) + χ(B) − χ(A∩B).
22. For X a ﬁnite CW complex and p:
`
X→X an n sheeted covering space, show that
χ(
`
X) = nχ(X).
23. Show that if M
g
, the closed orientable surface of genus g, is a covering space
of M
h
then g = n(h − 1) + 1 for some n, namely, n is the number of sheets in
the covering. [Conversely, if g = n(h − 1) + 1 then there is an n sheeted covering
M
g
→M
h
, as we saw in Example 1.41.]
24. Suppose we build S
2
from a ﬁnite collection of polygons by identifying edges
in pairs. Show that in the resulting CW structure on
S
2
the 1 skeleton cannot be either of the two graphs
shown, with ﬁve and six vertices. [This is one step in a
proof that neither of these graphs embeds in R
2
.]
25. Show that for each n ∈ Z there is a unique function ϕ assigning an integer to
each ﬁnite CW complex, such that (a) ϕ(X) = ϕ(Y) if X and Y are homeomorphic,
(b) ϕ(X) = ϕ(A) +ϕ(X/A) if A is a subcomplex of X, and (c) ϕ(S
0
) = n. For such
a function ϕ show that ϕ(X) = ϕ(Y) if X = Y .
26. For a pair (X, A), consider the space X∪CA obtained from X by attaching a cone
on A.
(a) Show that X is a retract of X ∪ CA iff A is contractible in X, i.e., there is a
homotopy f
t
: A→X with f
0
the inclusion A
X and f
1
a constant map.
(b) Show that if A is contractible in X then H
n
(X, A) ≈
`
H
n
(X)⊕
`
H
n−1
(A). [Hint:
(X ∪CA)/X = SA, the suspension of A.]
27. The short exact sequences 0→C
n
(A)→C
n
(X)→C
n
(X, A)→0 always split, but
why does this not always yield splittings H
n
(X) ≈ H
n
(A)⊕H
n
(X, A)?
28. Use the MayerVietoris sequence to compute the homology groups of:
(a) The space obtained from a torus S
1
×S
1
by attaching a M¨obius band via a homeo
morphism from the boundary circle of the M¨obius band to the circle S
1
×¦x
0
¦ in
the torus.
158 Chapter 2. Homology
(b) The space obtained by attaching a M¨obius band to RP
2
via a homeomorphism of
its boundary circle to the standard RP
1
⊂ RP
2
.
29. The surface M
g
of genus g, embedded in R
3
in the standard way, bounds a
compact region R. Two copies of R, glued together by the identity map between their
boundary surfaces M
g
, form a closed 3manifold X. Compute the homology groups
of X via the MayerVietoris sequence for this decomposition of X into two copies of
R. Also compute the relative groups H
i
(R, M
g
).
30. For the mapping torus T
f
of a map f : X→X, we constructed in Example 2.48 a
long exact sequence ··· →H
n
(X)
1−f
∗
→H
n
(X) →H
n
(T
f
) →H
n−1
(X) →···. Use
this to compute the homology of the mapping tori of the following maps:
(a) A reﬂection S
2
→S
2
.
(b) A map S
2
→S
2
of degree 2.
(c) The map S
1
×S
1
→S
1
×S
1
which is the identity on one factor and a reﬂection on
the other.
(d) The map S
1
×S
1
→S
1
×S
1
which is a reﬂection on each factor.
(e) The map S
1
×S
1
→S
1
×S
1
which interchanges the two factors and then reﬂects
one of the factors.
31. Use the MayerVietoris sequence to show there are isomorphisms
`
H
n
(X ∨ Y) ≈
`
H
n
(X)⊕
`
H
n
(Y) if the basepoints of X and Y which are identiﬁed in X ∨Y are defor
mation retracts of neighborhoods U ⊂ X and V ⊂ Y .
32. For SX the suspension of X, show by a MayerVietoris sequence that there are
isomorphisms
`
H
n
(SX) ≈
`
H
n−1
(X) for all n.
33. Suppose the space X is the union of open sets A
1
, ··· , A
n
such that each inter
section A
i
1
∩ ··· ∩A
i
k
is either empty or has trivial reduced homology groups. Show
that
`
H
i
(X) = 0 for i ≥ n − 1, and give an example showing this inequality is best
possible, for each n.
34. Derive the long exact sequence of a pair (X, A) from the MayerVietoris sequence
applied to X ∪ CA, where CA is the cone on A. [We showed after the proof of
Proposition 2.22 that H
n
(X, A) ≈
`
H
n
(X ∪CA) for all n.]
35. Use the MayerVietoris sequence to show that a nonorientable closed surface,
or more generally a ﬁnite simplicial complex X for which H
1
(X) contains torsion,
cannot be embedded as a subspace of R
3
in such a way as to have a neighborhood
homeomorphic to the mapping cylinder of some map froma closed orientable surface
to X. [This assumption on a neighborhood is in fact not needed if one deduces the
result from Alexander duality in §3.3.]
36. Show that H
i
(X×S
n
) ≈ H
i
(X)⊕H
i−n
(X) for all i and n, where H
i
= 0 for
i < 0 by deﬁnition. Namely, show H
i
(X×S
n
) ≈ H
i
(X) ⊕ H
i
(X×S
n
, X×¦x
0
¦) and
H
i
(X×S
n
, X×¦x
0
¦) ≈ H
i−1
(X×S
n−1
, X×¦x
0
¦). [For the latter isomorphism the rela
tive MayerVietoris sequence yields an easy proof.]
Section 2.2. Computations and Applications 159
37. Give an elementary derivation for the MayerVietoris sequence in simplicial ho
mology for a ∆ complex X decomposed as the union of subcomplexes A and B.
38. Show that a commutative diagram
A A
B
−
−
−
−
→
C −−−−→
D
−−−−→
−
−
−
−
→
−−−−→
E −−−−→
n
n
n
B −−−→
D −−−→
n
n
−−−−→ −−−−→ −−−−→ −−−−→
−−−−→
C −−−→
−
−
−
−
→
−−−−→
−
−
−
−
→
E −−−→
n 1 +
n 1 +
n 1
n 1
n 1
. . .
. . .
. . .
. . .
with the two sequences across the top and bottom exact, gives rise to an exact se
quence ··· → E
n+1
→ B
n
→ C
n
⊕D
n
→ E
n
→ B
n−1
→ ··· where the maps
are obtained from those in the previous diagram in the obvious way, except that
B
n
→C
n
⊕D
n
has a minus sign in one coordinate.
39. Use the preceding exercise to derive relative MayerVietoris sequences for CW
pairs (X, Y) = (A∪B, C ∪D) with A = B or C = D.
40. From the long exact sequence of homology groups associated to the short ex
act sequence of chain complexes 0 →C
i
(X)
n
→C
i
(X) →C
i
(X; Z
n
) →0 deduce
immediately that there are short exact sequences
0 →H
i
(X)/nH
i
(X) →H
i
(X; Z
n
) →nTorsion(H
i−1
(X)) →0
where nTorsion(G) is the kernel of the map G
n
→G, g
ng. Use this to show that
`
H
i
(X; Z
p
) = 0 for all i and all primes p iff
`
H
i
(X) is a vector space over Q for all i.
41. For X a ﬁnite CW complex and F a ﬁeld, show that the Euler characteristic χ(X)
can also be computed by the formula χ(X) =
¸
n
(−1)
n
dimH
n
(X; F), the alternating
sum of the dimensions of the vector spaces H
n
(X; F).
42. Let X be a ﬁnite connected graph having no vertex which is the endpoint of just
one edge, and suppose that H
1
(X; Z) is free abelian of rank n > 1, so the group of
automorphisms of H
1
(X; Z) is GL
n
(Z), the group of invertible n×n matrices with
integer entries whose inverse matrix also has integer entries. Show that if G is a ﬁnite
group of homeomorphisms of X, then the homomorphism G→GL
n
(Z) assigning to
g : X→X the induced homomorphism g
∗
: H
1
(X; Z)→H
1
(X; Z) is injective. Show the
same result holds if the coefﬁcient group Z is replaced by Z
m
with m > 2. What goes
wrong when m= 2?
43. Show that a chain complex of ﬁnitely generated free abelian groups splits as the
direct sum of subcomplexes with only one or two nonzero terms, of the form
··· →0 →Z →0 →··· or ··· →0 →Z
m
→Z →0 →···
Use this result to deduce that if X is a CW complex with ﬁnitely many cells in each
dimension, then H
i
(X; G) is the direct sum of the following groups:
(a) a copy of G for each Z summand of H
i
(X)
(b) a copy of G/mG for each Z
m
summand of H
i
(X)
(c) a copy of the kernel of G
m
→G for each Z
m
summand of H
i−1
(X).
160 Chapter 2. Homology
Sometimes it is good to step back from the forest of details and look for gen
eral patterns. In this rather brief section we will ﬁrst describe the general pattern of
homology by axioms, then we will look at some common formal features shared by
many of the constructions we have made.
Axioms for Homology
For simplicity let us restrict attention to CW complexes and focus on reduced
homology to avoid mentioning relative homology. Then a (reduced) homology the
ory assigns to each nonempty CW complex X a sequence of abelian groups
`
h
n
(X)
and to each map f : X→Y between CW complexes a sequence of homomorphisms
f
∗
:
`
h
n
(X)→
`
h
n
(Y) such that (fg)
∗
= f
∗
g
∗
and 11
∗
= 11, and so that the following
three axioms are satisﬁed.
(1) If f = g : X→Y , then f
∗
= g
∗
:
`
h
n
(X)→
`
h
n
(Y).
(2) There are boundary homomorphisms ∂ :
`
h
n
(X/A)→
`
h
n−1
(A) deﬁned for each CW
pair (X, A), ﬁtting into an exact sequence
···
∂
→
`
h
n
(A)
i
∗
→
`
h
n
(X)
q
∗
→
`
h
n
(X/A)
∂
→
`
h
n−1
(A)
i
∗
→···
where i is the inclusion and q is the quotient map. Furthermore the boundary
maps are natural: For f : (X, A)→(Y, B) inducing a quotient map f : X/A→Y/B,
there are commutative diagrams
Y/
X/
n 1
n 1
∂
∂
A
−
−
−
−
−
→
−
−
−
−
−
→
h
n
( )
−−−−−−−→
−−−−−−−→ B h
n
A h ( )
B h ( ) ( )
f
∗
f
∗
∼ ∼
∼ ∼
−
(3) For a wedge sum X =
α
X
α
with inclusions i
α
: X
α
X, the direct sum map
¸
α
i
α∗
:
¸
α
`
h
n
(X
α
)→
`
h
n
(X) is an isomorphism for each n.
Negative values for the subscripts n are permitted. Ordinary singular homology is
zero in negative dimensions by deﬁnition, but interesting homology theories with
nontrivial groups in negative dimensions do exist.
The third axiommay seemless substantial than the ﬁrst two, and indeed for ﬁnite
wedge sums it can be deduced from the ﬁrst two axioms, though not in general for
inﬁnite wedge sums, as an example in the exercises shows.
It is also possible, and not much more difﬁcult, to give axioms for unreduced ho
mology theories. One supposes one has relative groups h
n
(X, A) deﬁned, specializing
to absolute groups by setting h
n
(X) = h
n
(X, ∅). Axiom (1) is replaced by its obvi
ous relative form, and the axiom (2) is broken into two parts, the ﬁrst hypothesizing
Section 2.3. The Formal Viewpoint 161
a long exact sequence involving these relative groups, with natural boundary maps,
the second stating some version of excision, for example h
n
(X, A) ≈ h
n
(X/A, A/A)
if one is dealing with CW pairs. In axiom (3) the wedge sum is replaced by disjoint
union.
These axioms for unreduced homology are essentially the same as those origi
nally laid out in the highly inﬂuential book [EilenbergSteenrod], except that axiom
(3) was omitted since the focus there was on ﬁnite complexes, and there was another
axiom specifying that the groups h
n
(point) are zero for n ≠ 0, as is true for singular
homology. This axiom was called the ‘dimension axiom,’ presumably because it spec
iﬁes that a point has nontrivial homology only in dimension zero. It can be regarded
as a normalization axiom, since one can trivially deﬁne a homology theory where it
fails by setting h
n
(X, A) = H
n+k
(X, A) for a ﬁxed nonzero integer k. At the time
there were no interesting homology theories known for which the dimension axiom
did not hold, though only a short time afterwards a homology theory called ‘bordism’
was deﬁned having the property that the bordism groups of a point are nonzero in
inﬁnitely many dimensions. Axiom (3) seems to have appeared ﬁrst in [Milnor 62].
Reduced and unreduced homology theories are essentially equivalent. From an
unreduced theory h one gets a reduced theory
`
h by setting
`
h
n
(X) equal to the
kernel of the canonical map h
n
(X)→h
n
(point). In the other direction, one sets
h
n
(X) =
`
h
n
(X
+
) where X
+
is the disjoint union of X with a point. We leave it
as an exercise to show that these two transformations between reduced and unre
duced homology are inverses of each other. Just as with ordinary homology, one has
h
n
(X) ≈
`
h
n
(X)⊕h
n
(x
0
) for any point x
0
∈ X, since the long exact sequence of the
pair (X, x
0
) splits via a retraction X→x
0
. Note that
`
h
n
(x
0
) = 0 for all n, as can be
seen by looking at the long exact sequence of reduced homology groups of the pair
(x
0
, x
0
).
The groups h
n
(x
0
) ≈
`
h
n
(S
0
) are called the coefﬁcients of the homology theo
ries h and
`
h, in analogy with the case of singular homology with coefﬁcients. One
can trivially realize any sequence of abelian groups G
i
as the coefﬁcient groups of a
homology theory by setting h
n
(X, A) =
¸
i
H
n−i
(X, A; G
i
).
In general, homology theories are not uniquely determined by their coefﬁcient
groups, but this is true for singular homology: If h is a homology theory deﬁned
for CW pairs, whose coefﬁcient groups h
n
(x
0
) are zero for n ≠ 0, then there are
natural isomorphisms h
n
(X, A) ≈ H
n
(X, A; G) for all CW pairs (X, A) and all n,
where G = h
0
(x
0
). This will be proved in Theorem 4.58.
We have seen how MayerVietoris sequences are quite useful for singular homol
ogy, and in fact every homology theory has MayerVietoris sequences, at least for CW
complexes. These sequences can be obtained directly from the axioms in the fol
lowing way. For a CW complex X = A ∪ B with A and B subcomplexes, consider
162 Chapter 2. Homology
the commutative diagram consisting of the exact sequences of the pairs (X, A) and
(B, A∩B)
n
n
. . .
. . .
. . .
. . .
−
−
−
−
−
→
−
−
−
−
−
→
−−−−→ −−−−→ −−−−→ −−−−→ B A B h ( )
−
−
−
−
−
→
−
−
−
−
−
→
B h
n n
( ) h ( ) ,
−−−−−−→ −−−−−−−→ −−−−−−→ −−−−−−−→
−−−−−→
−−−−−−−→ h ( ) X h
n n
h ( )
h ( ) ( ) A h ( )
≈ ≈
∩ B A B ,
∩ A B ∩
n 1 +
n 1 +
A X, A X,
The vertical maps are induced by inclusions, and the vertical maps between relative
groups are isomorphisms since B/(A ∩ B) = X/A. Then it is a purely algebraic fact,
whose proof is exercise 38 at the end of the previous section, that a diagram such as
this with every third vertical map an isomorphism gives rise to an exact sequence
··· →h
n
(A∩B)
ϕ
→h
n
(A) ⊕h
n
(B)
ψ
→h
n
(X)
∂
→h
n−1
(A∩B) →···
Categories and Functors
Formally, singular homology can be regarded as a sequence of functions H
n
which
assign to each space X an abelian group H
n
(X) and to each map f : X→Y a homo
morphism H
n
(f) = f
∗
: H
n
(X)→H
n
(Y), and similarly for relative homology groups.
This sort of situation arises quite often, and not just in algebraic topology, so it is
useful to introduce some general terminology for it. Roughly speaking, ‘functions’
like H
n
are called ‘functors,’ and the domains and ranges of these functors are called
‘categories.’ Thus for H
n
, the domain category consists of topological spaces and con
tinuous maps, or in the relative case, pairs of spaces and continuous maps of pairs,
and the range category consists of abelian groups and homomorphisms. A key point
is that one is interested not only in the objects in the category, e.g., spaces or groups,
but also in the maps, or ‘morphisms,’ between these objects.
Now for the precise deﬁnitions. A category C consists of:
(1) a collection Ob(C) of objects.
(2) sets Mor(X, Y) of morphisms for each pair X, Y ∈ Ob(C), including a distin
guished ‘identity’ morphism 11 = 11
X
∈ Mor(X, X) for each X.
(3) a ‘composition of morphisms’ function ◦ : Mor(X, Y)×Mor(Y, Z)→Mor(X, Z) for
each triple X, Y, Z ∈ Ob(C), satisfying f ◦ 11 = f , 11◦ f = f, and (f ◦ g)◦ h =
f ◦ (g◦ h).
There are plenty of obvious examples, such as:
— The category of topological spaces, with continuous maps as the morphisms. Or
we could restrict to special classes of spaces such as CW complexes, keeping
continuous maps as the morphisms. We could also restrict the morphisms, e.g.,
the category of topological spaces with homeomorphisms as the morphisms.
— The category of groups, with homomorphisms as morphisms. Or the subcategory
of abelian groups, again with homomorphisms as the morphisms. Generalizing
Section 2.3. The Formal Viewpoint 163
this is the category of modules over a ﬁxed ring, with morphisms the module
homomorphisms.
— The category of sets, with arbitrary functions as the morphisms. Or the mor
phisms could be restricted, e.g., to injections, or to surjections.
There are also many examples of categories where the morphisms are not simply
functions, for example:
— Any group G can be viewed as a category with only one object and with G as the
morphisms of this object, so that condition (3) reduces to two of the three axioms
for a group. If we require only these two axioms, associativity and a left and right
identity, we have a ‘group without inverses,’ usually called a monoid since it is
the same thing as a category with one object.
— A partially ordered set (X, ≤) can be considered a category where the objects are
the elements of X and there is a unique morphismfrom x to y whenever x ≤ y.
The relation x ≤ x gives the morphism 11 and transitivity gives the composition
Mor(x, y)×Mor(y, z)→Mor(x, z). The condition that x ≤ y and y ≤ x ⇒ x =
y then says that Mor(x, y)∪Mor(y, x) contains at most one element for all pairs
x, y ∈ X, i.e., there is at most one morphism between any two objects.
— There is a ‘homotopy category’ whose objects are topological spaces and whose
morphisms are homotopy classes of maps, rather than actual maps. This uses
the fact that composition is welldeﬁned on homotopy classes: f
0
g
0
= f
1
g
1
if
f
0
= f
1
and g
0
= g
1
.
— Chain complexes are the objects of a category, with chain maps as morphisms.
This category has various interesting subcategories, obtained by restricting the
objects. For example, we could take chain complexes whose groups are zero in
negative dimensions, or zero outside some ﬁnite range. Or we could restrict to
exact sequences, or short exact sequences. In each case we take morphisms to be
chain maps, i.e., commutative diagrams. Going a step further, there is a category
whose objects are short exact sequences of chain complexes and whose mor
phisms are commutative diagrams of maps between such short exact sequences.
A functor F from a category C to a category 1 assigns to each object X in C
an object F(X) in 1 and to each morphism f ∈ Mor(X, Y) a morphism F(f) ∈
Mor
¸
F(X), F(Y)
, such that F(11) = 11 and F(f ◦ g) = F(f)◦ F(g). In the case of
the functor H
n
the latter two conditions are the familiar properties 11
∗
= 11 and
(fg)
∗
= f
∗
g
∗
of induced maps. Strictly speaking, what we have just deﬁned is a
covariant functor. A contravariant functor would differ from this by assigning to
f ∈ Mor(X, Y) a ‘backwards’ morphism F(f) ∈ Mor
¸
F(Y), F(X)
with F(11) = 11 and
F(f ◦ g) = F(g)◦ F(f). A classical example of this is the dual vector space functor,
which assigns to a vector space V over a ﬁxed scalar ﬁeld K the dual vector space
F(V) = V
∗
of linear maps V→K, and to each linear transformation f : V→W the
164 Chapter 2. Homology
dual map F(f) = f
∗
: W
∗
→V
∗
, in the reverse direction. In the next chapter we will
study the contravariant version of homology, called cohomology.
A number of the constructions we have studied in this chapter are functors:
— The singular chain complex functor assigns to a space X the chain complex of
singular chains in X and to a map f : X→Y the induced chain map. This is
a functor from the category of spaces and continuous maps to the category of
chain complexes and chain maps.
— The algebraic homology functor assigns to a chain complex its sequence of ho
mology groups and to a chain map the induced homomorphisms on homology
deﬁnes a functor from the category of chain complexes and chain maps to the
category whose objects are sequences of abelian groups and whose morphisms
are sequences of homomorphisms.
— The composition of the two preceding functors is the functor assigning to a space
its singular homology groups.
— The ﬁrst example above, the singular chain complex functor, can itself be re
garded as the composition of two functors. The ﬁrst functor assigns to a space
X its singular complex ∆(X), a ∆ complex, and the second functor assigns to
a ∆ complex its simplicial chain complex. This is what the two functors do on
objects, and what they do on morphisms can be described in the following way. A
map of spaces f : X→Y induces a map f
∗
: ∆(X)→∆(Y) by composing singular
simplices ∆
n
→X with f . The map f
∗
is a map between ∆ complexes taking the
distinguished characteristic maps in the domain ∆ complex to the distinguished
characteristic maps in the target ∆ complex. Call such maps ∆ maps and let
them be the morphisms in the category of ∆ complexes. Note that a ∆ map in
duces a chain map between simplicial chain complexes, taking basis elements to
basis elements, so we have a simplicial chain complex functor taking the category
of ∆ complexes and ∆ maps to the category of chain complexes and chain maps.
— There is a functor assigning to a pair of spaces (X, A) the associated long exact
sequence of homology groups. Morphisms in the domain category are maps of
pairs, and in the target category morphisms are maps between exact sequences
forming commutative diagrams. This functor is the composition of two functors,
the ﬁrst assigning to (X, A) a short exact sequence of chain complexes, the sec
ond assigning to such a short exact sequence the associated long exact sequence
of homology groups. Morphisms in the intermediate category are the evident
commutative diagrams.
Another sort of process we have encountered is the transformation of one functor
into another, for example:
— Boundary maps H
n
(X, A)→H
n−1
(A) in singular homology, or indeed in any ho
mology theory.
Section 2.3. The Formal Viewpoint 165
— Changeofcoefﬁcient homomorphisms H
n
(X; G
1
)→H
n
(X; G
2
) induced by a ho
momorphism G
1
→G
2
, as in the proof of Lemma 2.49.
Formally, if one has two functors F, G: C→1 then a natural transformation T from
F to G assigns a morphism T
X
: F(X)→G(X) to each object
X ∈ C, in such a way that for each morphism f : X→Y in
C the square at the right commutes. The case that F and G
−
−
−
−
−
→
−
−
−
−
−
→
−−−−−→
T
X
T
Y
X F( )
f F( )
f G( )
Y F( )
−−−−−→ X G( ) Y G( )
are contravariant rather than covariant is similar.
We have been describing the passage from topology to the abstract world of cat
egories and functors, but there is also a nice path in the opposite direction:
— To each category C there is associated a ∆ complex BC called the classifying
space of C, whose n simplices are the strings X
0
→X
1
→··· →X
n
of morphisms
in C. The n + 1 faces of this simpex are obtained by composing two adjacent
morphisms in the string (this yields n − 1 faces) or by deleting the ﬁrst or last
morphism, to get the remaining two faces. In case C has a single object, whose
morphisms form a group G, then BC is the same as the ∆ complex BG con
structed in Example 1B.7, a K(G, 1) space. In general, BC need not be a K(G, 1),
however. For example, if we start with a ∆ complex X and regard its set of sim
plices as a partially ordered set C(X) under the relation of inclusion of faces,
then BC(X) is the barycentric subdivision of X.
— A functor F : C→1 induces a map BC→B1. This is the ∆ map which sends an
n simplex X
0
→X
1
→··· →X
n
to the n simplex F(X
0
)→F(X
1
)→··· →F(X
n
).
— A natural transformation from a functor F to a functor G induces a homotopy
between the induced maps of classifying spaces. We leave this for the reader to
make explicit, using the subdivision of ∆
n
×I into (n + 1) simplices described
earlier in the chapter.
Exercises
1. If T
n
(X, A) denotes the torsion subgroup of H
n
(X, A; Z), show that the functors
(X, A)
T
n
(X, A), with the obvious induced homomorphisms T
n
(X, A)→T
n
(Y, B)
and boundary maps T
n
(X, A)→T
n−1
(A), do not deﬁne a homology theory. Do the
same for the ‘mod torsion’ functor MT
n
(X, A) = H
n
(X, A; Z)/T
n
(X, A).
2. Deﬁne a candidate for a reduced homology theory on CW complexes by
`
h
n
(X) =
¸
i
`
H
i
(X)
¸
i
`
H
i
(X). Thus
`
h
n
(X) is independent of n and is zero if X is ﬁnite
dimensional, but is not identically zero, e.g., for X =
i
S
i
. Show that the axioms for
a homology theory are satisﬁed except that the wedge axiom fails.
3. Show that if
`
h is a reduced homology theory, then
`
h
n
(point) = 0 for all n. Deduce
that there are suspension isomorphisms
`
h
n
(X) ≈
`
h
n+1
(SX) for all n.
4. Show that the wedge axiom for homology theories follows from the other axioms
in the case of ﬁnite wedge sums.
166 Chapter 2. Homology
There is a close connection between H
1
(X) and π
1
(X), arising from the fact that
a map f : I→X can be viewed as either a path or a singular 1 simplex. If f is a loop,
with f(0) = f(1), this singular 1 simplex is a cycle since ∂f = f(1) −f(0).
Theorem2A.1. By regarding loops as singular 1 cycles, we obtain a homomorphism
h: π
1
(X, x
0
)→H
1
(X). If X is pathconnected, then h is surjective and has kernel
the commutator subgroup of π
1
(X), so h induces an isomorphism from the abelian
ization of π
1
(X) onto H
1
(X).
Proof: Recall the notation f = g for the relation of homotopy, ﬁxing endpoints,
between paths f and g. Regarding f and g as chains, the notation f ∼ g will mean
that f is homologous to g, that is, f −g is the boundary of some 2 chain. Here are
some facts about this relation.
(i) If f is a constant path, then f ∼ 0. Namely, f is the boundary of the constant
singular 2 simplex σ having the same image point as f , since
∂σ = σ ¦
¦[v
1
, v
2
] −σ ¦
¦[v
0
, v
2
] +σ ¦
¦[v
0
, v
1
] = f −f +f = f
f
g
v
v
v
v
σ
1
0 1
3
2
σ
2
(ii) If f = g then f ∼ g. To see this, consider a homo
topy F : I ×I→X from f to g. This yields a pair of singular
2 simplices σ
1
and σ
2
in X by subdividing the square I ×I
into two triangles [v
0
, v
1
, v
3
] and [v
0
, v
2
, v
3
], as shown in
the ﬁgure. When one computes ∂(σ
1
− σ
2
), the two restric
tions of F to the diagonal of the square cancel, leaving f −g
together with two constant singular 1 simplices from the left and right edges of the
square. By (i) these are boundaries, so f −g is also a boundary.
f
f
g
g
v v
0 1
v
2
(iii) f g ∼ f +g, where f g denotes the product of the paths
f and g. In fact we have the formula ∂σ = g−f g+f where
σ : ∆
2
→X is the composition of the orthogonal projection of
∆
2
= [v
0
, v
1
, v
2
] onto the edge [v
0
, v
2
] followed by the map
f g : [v
0
, v
2
]→X.
(iv) f ∼ −f , where f is the inverse path of f . This follows from the preceding three
observations, which give f +f ∼ f f ∼ 0.
Applying (ii) and (iii) to loops, it follows that we have a welldeﬁned homomor
phism h: π
1
(X, x
0
)→H
1
(X) sending the homotopy class of a loop f to the homology
class of the 1 cycle f .
Section 2.A. Homology and Fundamental Group 167
To show h is surjective when X is pathconnected, let a 1 cycle
¸
i
n
i
σ
i
be given.
After relabeling the σ
i
’s we may assume each n
i
is :1. By (iv) we may assume
each n
i
= +1, so our 1 cycle is
¸
i
σ
i
. If some σ
i
is not a loop, then the fact that
∂
¸¸
i
σ
i
= 0 means there must be another σ
j
such that the composed path σ
i
σ
j
is
deﬁned. By (iii) we may then combine the terms σ
i
and σ
j
into a single term σ
i
σ
j
.
Iterating this, we reduce to the case that each σ
i
is a loop. Since X is pathconnected
we may choose a path γ
i
from x
0
to the basepoint of σ
i
. We have γ
i
σ
i
γ
i
∼ σ
i
by
(iii) and (iv), so we may assume all σ
i
’s are loops at x
0
. Then we can combine all the
σ
i
’s into a single σ by (iii). Thus h is surjective.
The commutator subgroup of π
1
(X) is contained in the kernel of h since H
1
(X)
is abelian. To obtain the reverse inclusion we will show that every class [f] in Ker h
is trivial in the abelianization π
1
(X)
ab
of π
1
(X).
If h([f]) = 0 then f , as a 1 cycle, is the boundary of a 2 chain
¸
i
n
i
σ
i
. Again
we may assume each n
i
is :1. As in the discussion preceding Proposition 2.6, we can
associate to this chain
¸
i
n
i
σ
i
a 2 dimensional ∆ complex K by taking a 2 simplex
∆
2
i
for each σ
i
and identifying certain pairs of edges of these 2 simplices. Namely,
if we apply the usual boundary formula to write ∂σ
i
= τ
i0
− τ
i1
+ τ
i2
for singular
1 simplices τ
ij
, then the formula
(∗) f = ∂
¸¸
i
n
i
σ
i
=
¸
i
n
i
∂σ
i
=
¸
i,j
n
i
(−1)
j
τ
ij
implies that we can group all but one of the τ
ij
’s into pairs for which the two coef
ﬁcients n
i
(−1)
j
in each pair are of opposite sign. The one remaining τ
ij
is equal to
f . We then identify edges of the ∆
2
j
’s corresponding to the paired τ
ij
’s, preserving
orientations of these edges so that we obtain a ∆ complex K.
The maps σ
i
ﬁt together to give a map σ : K→X. We can deform σ , staying
ﬁxed on the edge corresponding to f , so that each vertex maps to the basepoint x
0
,
in the following way. Paths from the images of these vertices to x
0
deﬁne such a
homotopy on the union of the 0 skeleton of K with the edge corresponding to f ,
and then we can appeal to the homotopy extension property in Proposition 0.16 to
extend this homotopy to all of K. (Or one can just construct such an extension by
hand.) Restricting the new σ to the simplices ∆
2
i
, we obtain a new chain
¸
i
n
i
σ
i
with
boundary equal to f , and with all τ
ij
’s loops at x
0
.
We now interpret the formula (∗) in π
1
(X)
ab
, using additive notation for the
group operation in this abelian group. The three summations in (∗) are obviously
equal in π
1
(X)
ab
, and the last summation equals [f] in π
1
(X)
ab
by the deﬁnition of
the pairing of the τ
ij
’s. Each term ∂σ
i
= τ
i0
−τ
i1
+τ
i2
is zero in
π
1
(X)
ab
since σ
i
itself gives a nullhomotopy of the composed
loop τ
i0
− τ
i1
+ τ
i2
. We conclude that the loop f is trivial in
π
1
(X)
ab
. L¦ v
0
v
1
v
2
σ
i
τ
τ
τ
i2
i1
i0
168 Chapter 2. Homology
One can see quite clearly what is happening at the end of this proof by look
ing more closely at the geometry. The complex K is in fact a compact surface with
boundary consisting of a single circle formed by the edge corresponding to f . This is
because any pattern of identiﬁcations of pairs of edges of a ﬁnite collection of disjoint
2 simplices produces a compact surface with boundary. From the algebraic formula
f = ∂
¸¸
i
n
i
σ
i
it is not hard to check that K is an orientable surface. Quoting a
basic theorem from the topology of surfaces, we see that the
component of K containing the boundary circle is a closed ori
entable surface of some genus g with an open disk removed.
Giving this surface the cell structure indicated in the ﬁgure, it
then becomes obvious that f is homotopic to a product of g
commutators in π
1
(X).
b
f
b
a
a
c
c
d
d
Exercises
1. Verify the statement made in the preceding paragraph that K is an orientable
surface.
2. Show that the map h: π
1
(X, x
0
)→H
1
(X) can also be deﬁned by h([f]) = f
∗
(α)
where f : S
1
→X represents a given element of π
1
(X, x
0
), f
∗
is the induced map on
H
1
, and α is a suitable generator of H
1
(S
1
) ≈ Z.
In this section we use homology theory to prove some interesting results in topol
ogy and algebra whose statements give no hint that algebraic topology might be in
volved.
To begin, we have the following calculations:
Proposition 2B.1.
(a) If D is a subspace of S
n
homeomorphic to D
k
for some k ≥ 0, then
`
H
i
(S
n
−D)
is 0 for all i.
(b) If S is a subspace of S
n
homeomorphic to S
k
for some k with 0 ≤ k < n, then
`
H
i
(S
n
−S) is Z for i = n−k −1 and 0 otherwise.
As a special case of (b) we have the Jordan curve theorem: A subspace of S
2
homeomorphic to S
1
separates S
2
into two complementary components, or equiv
alently, pathcomponents since open subsets of S
n
are locally pathconnected. One
could just as well use R
2
in place of S
2
here since deleting a point from an open set
in S
2
does not affect its connectedness. More generally, (b) says that a subspace of
Section 2.B. Classical Applications 169
S
n
homeomorphic to S
n−1
separates it into two components, and these components
have the same homology groups as a point. However, there are examples where these
complementary components are not simplyconnected, for example the wellknown
Alexander horned sphere in S
3
; see [Rolfsen]. These complications involving embed
ded S
n−1
’s in S
n
are all local in nature since any locally nicely embedded S
n−1
in S
n
is equivalent to the standard S
n−1
⊂ S
n
, in the sense that there is a homeomorphism
of S
n
taking the embedded S
n−1
onto the standard equatorial S
n−1
, so in particular
both complementary regions are homeomorphic to open balls; see [M.Brown] for a pre
cise statement and proof of this. When n = 2 it is a classical theorem of Schoenﬂies
that this holds for arbitrary embeddings S
1
S
2
.
By contrast, when we come to embeddings of S
n−2
in S
n
, even locally nice embed
dings need not be equivalent to the standard one. This is the subject of knot theory,
including the classical case of knotted embeddings of S
1
in S
3
or R
3
. For embeddings
of S
n−2
in S
n
the complement always has the same homology as S
1
, according to the
theorem, but the fundamental group can be quite different. In spite of the fact that
the homology of a knot complement does not detect knottedness, it is still possible to
use homology to distinguish different knots by looking at the homology of covering
spaces of their complements. For more on this see [Rolfsen].
Proof: We prove (a) by induction on k. When k = 0, S
n
−D is homeomorphic to R
n
,
so this case is trivial. For the induction step, let h: I
k
→D be a homeomorphism, and
consider the open sets A = S
n
−h(I
k−1
×[0,
1
/
2
]) and B = S
n
−h(I
k−1
×[
1
/
2
, 1]), with
A∩B = S
n
−D and A∪B = S
n
−h(I
k−1
×¦
1
/
2
¦). By induction
`
H
i
(A∪B) = 0 for all i, so
the MayerVietoris sequence gives isomorphisms Φ:
`
H
i
(S
n
− D)→
`
H
i
(A)⊕
`
H
i
(B) for
all i. Modulo signs, the two components of Φ are induced by the inclusions S
n
−D
A
and S
n
−D
B, so if there exists an i dimensional cycle α in S
n
−D which is not
a boundary in S
n
− D, then α is also not a boundary in at least one of A and B.
When i = 0 the word ‘cycle’ here is to be interpreted in the sense of augmented chain
complexes since we are dealing with reduced homology. Repeating this argument, we
can further subdivide the last I factor of I
k
into quarters, eighths, etc., producing a
nested sequence of closed subintervals I
1
⊃ I
2
⊃ ··· with intersection a point p ∈ I ,
such that α is not a boundary in S
n
− h(I
k−1
×I
m
) for any m. By induction on
k, α is the boundary of a chain β in S
n
− h(I
k−1
×¦p¦). This β is a ﬁnite linear
combination of singular simplices with compact image in S
n
− h(I
k−1
×¦p¦). The
union of these images is covered by the nested sequence of open sets S
n
−h(I
k−1
×I
m
),
so by compactness β must actually be a chain in S
n
−h(I
k−1
×I
m
) for some m. This
contradiction shows that α must be a boundary in S
n
− D, ﬁnishing the induction
step.
Part (b) is also proved by induction on k, starting with the trivial case k = 0
when S
n
−S is homeomorphic to S
n−1
×R. For the induction step, write S = D
1
∪D
2
with D
1
and D
2
homeomorphic to D
k
and D
1
∩ D
2
homeomorphic to S
k−1
. The
170 Chapter 2. Homology
MayerVietoris sequence for A = S
n
−D
1
and B = S
n
−D
2
, which have trivial reduced
homology by part (a), then gives isomorphisms
`
H
i
(S
n
− S) ≈
`
H
i+1
(S
n
− (D
1
∩ D
2
))
for all i. L¦
The next theorem says that for subspaces of R
n
, the property of being open is
a topological invariant. This accounts for the classical name ‘Invariance of Domain’
associated to this result, ‘domain’ being a synonym for ‘open set’ in R
n
.
Theorem 2B.2. If a subspace X of R
n
is homeomorphic to an open set in R
n
, then
X is itself open in R
n
.
Proof: Regarding S
n
as the onepoint compactiﬁcation of R
n
, an equivalent state
ment is that X is open in S
n
, and this is what we shall prove. Each x ∈ X has a
neighborhood D in X homeomorphic to D
n
, with x corresponding to the center of
D
n
under this homeomorphism. Let S ⊂ D correspond to S
n−1
= ∂D
n
under this
homeomorphism. Then S
n
−D is open, and is connected by the case k = n, i = 0 in
part (a) of the previous proposition, using the fact that connectedness is equivalent
to pathconnectedness for open sets in S
n
. Also, S
n
−S is open and has exactly two
components by the case k = n − 1, i = 0 of (b) of the proposition. Thus we have
S
n
− S decomposed as the disjoint union of the connected sets S
n
− D and D − S ,
so these must be the two components of S
n
−S . In particular, D −S is open, being
a component of the open set S
n
−S . So D −S is an open neighborhood of x in S
n
,
and since this neighborhood is contained in X we conclude that X is open. L¦
Here is an application involving the notion of an n manifold, which is a Hausdorff
space locally homeomorphic to R
n
:
Corollary 2B.3. If M is a compact n manifold and N is a connected n manifold,
then an embedding M
N must be surjective.
Proof: M is closed in N since it is compact and N is Hausdorff. Hence it sufﬁces
to show M is also open in N. For x ∈ M let V ⊂ N and U ⊂ M be neighborhoods
homeomorphic to R
n
. We may assume U ⊂ V , and then the theorem implies that U
is open in V , hence in N. L¦
For example, the corollary says that S
n
cannot be embedded as a subspace of R
n
,
since if it were we would have S
n
≈ R
n
but S
n
is compact while R
n
is not. A conse
quence of this is that R
n
contains no subspace homeomorphic to R
m
with m > n, for
if R
n
contained such a subspace it would also contain a subspace homeomorphic to
S
n
since S
n
⊂ R
m
if n < m. More generally, there cannot be a continuous injection
R
m
→R
n
when m > n since this would give a continuous injection S
n
→R
n
, which
would be a homeomorphism onto its image since S
n
is compact.
Section 2.B. Classical Applications 171
The Invariance of Domain and the n dimensional generalization of the Jordan
curve theorem were ﬁrst proved by Brouwer around 1910, at a very early stage in the
development of algebraic topology.
Division Algebras
Here is an algebraic application of homology theory due to H. Hopf:
Theorem 2B.4. R and C are the only ﬁnitedimensional division algebras over R
which are commutative and have an identity.
By deﬁnition, an algebra structure on R
n
is simply a bilinear multiplication map
R
n
×R
n
→R
n
, (a, b)
ab. Thus the product satisﬁes left and right distributivity,
a(b+c) = ab+ac and (a+b)c = ac+bc, and scalar associativity, α(ab) = (αa)b =
a(αb) for α ∈ R. Commutativity, full associativity, and an identity element are not
assumed. An algebra is a division algebra if the equations ax = b and xa = b are
always solvable whenever a ≠ 0. In other words, the linear transformations x
ax
and x
xa are surjective when a ≠ 0. These are linear maps R
n
→R
n
, so surjectivity
is equivalent to having trivial kernel, i.e., the absence of zerodivisors.
The four classical examples are R, C, the quaternions H, and the octonions O.
Frobenius proved in 1877 that R, C, and H are the only ﬁnitedimensional associative
division algebras over R, and in 1898 Hurwitz proved that these three together with
O are the only ﬁnitedimensional division algebras over R with a product satisfying
¦ab¦ = ¦a¦¦b¦. See [Ebbinghaus]. We will show in §3.2 that a ﬁnitedimensional divi
sion algebra must have dimension a power of 2. By reﬁnements of these topological
arguments, Adams showed that in fact the only possible dimensions are 1, 2, 4, and
8. A very nice proof using Ktheory is in [AdamsAtiyah], and an exposition of this
proof can be found also in [VBKT].
Proof: Suppose ﬁrst that R
n
has a commutative division algebra structure. Deﬁne
a map f : S
n−1
→S
n−1
by f(x) = x
2
/¦x
2
¦. This is welldeﬁned since x ≠ 0 implies
x
2
≠ 0 in a division algebra, hence ¦x
2
¦ > 0. The map f is continuous since the
multiplication map R
n
×R
n
→R
n
is bilinear, hence continuous. Since f(−x) = f(x),
f induces a quotient map f : RP
n−1
→S
n−1
. The following argument shows that f
is injective. An equality f(x) = f(y) implies x
2
= α
2
y
2
for α = (¦x
2
¦/¦y
2
¦)
1/2
>
0. Thus we have x
2
− α
2
y
2
= 0, which factors as (x + αy)(x − αy) = 0 using
commutativity and the fact that α is a real scalar. Since there are no divisors of zero
we deduce that x = :αy. Since x and y are unit vectors and α is a positive real
scalar, this yields x = :y, so x and y determine the same point of RP
n−1
, which
means that f is injective.
Since f is an injective map of compact Hausdorff spaces, it must be a homeo
morphism onto its image. By Corollary 2B.3, f must in fact be surjective if we are
not in the trivial case n = 1. Thus we have a homeomorphism RP
n−1
≈ S
n−1
. This
172 Chapter 2. Homology
implies n = 2 since RP
n−1
and S
n−1
have different fundamental groups and different
homology groups if n > 2.
It remains to show that a 2 dimensional commutative division algebra A with
identity is isomorphic to C. This is elementary algebra: If j ∈ A is not a real scalar
multiple of the identity element 1 ∈ A and we write j
2
= a + bj for a, b ∈ R, then
(j −b/2)
2
= a +b
2
/4 so by rechoosing j we may assume that j
2
= a ∈ R. If a ≥ 0,
say a = c
2
, then j
2
= c
2
implies (j + c)(j − c) = 0 so j = :c, contradicting the
choice of j . So j
2
= −c
2
and by rescaling j we may assume j
2
= −1, hence A is
isomorphic to C. L¦
Leaving out the last paragraph, the proof shows that a ﬁnitedimensional commu
tative division algebra, not necessarily with an identity, must have dimension at most
2. Oddly enough, there do exist 2 dimensional commutative division algebras with
out identity elements, for example C with the modiﬁed multiplication z · w = zw,
the bar denoting complex conjugation.
The BorsukUlam Theorem
The proof of the following theorem of Borsuk shows how useful homology with
coefﬁcients other than Z can be.
Proposition 2B.5. A map f : S
n
→S
n
which is odd, satisfying f(−x) = −f(x) for
all x, must have odd degree.
The corresponding result that even maps have even degree is easier, requiring
only homology with Z coefﬁcients, and was an exercise for §2.2.
The main ingredient in the proof will be a certain exact sequence associated to a
twosheeted covering space p:
`
X→X,
··· →H
n
(X; Z
2
)
τ
∗
→H
n
(
`
X; Z
2
)
p
∗
→H
n
(X; Z
2
) →H
n−1
(X; Z
2
) →···
This is the long exact sequence of homology groups associated to a short exact se
quence of chain complexes
0 →C
n
(X; Z
2
)
τ
→C
n
(
`
X; Z
2
)
p
→C
n
(X; Z
2
) →0
The map p
is surjective since singular simplices σ : ∆
n
→X always lift to
`
X, as
∆
n
is simplyconnected. Each σ has in fact precisely two lifts ` σ and α` σ for α
the nontrivial deck transformation of the covering space. Because we are using Z
2
coefﬁcients, the kernel of p
is generated by the sums ` σ + α` σ . So if we deﬁne τ
to send each σ : ∆
n
→X to the sum of its two lifts to
`
∆
n
, then the image of τ is the
kernel of p
. Obviously τ is injective, so we have the short exact sequence indicated.
Since τ and p
commute with boundary maps, we have a short exact sequence of
chain complexes, yielding the long exact sequence of homology groups.
The map τ
∗
is a special case of more general transfer homomorphisms considered
in §3.H. The long exact sequence involving the transfer maps τ
∗
we call the transfer
Section 2.B. Classical Applications 173
sequence. It can also be viewed as a special case of the Gysin sequences discussed
in §4.D. There is a generalization of the transfer sequence to homology with other
coefﬁcients, but this uses a more elaborate form of homology called ‘homology with
local coefﬁcients,’ as we show in §3.I.
Proof of 2B.5: If f is odd, it induces a quotient map f : RP
n
→RP
n
, and the proof
will consist of examining the map from the transfer sequence for the covering space
p: S
n
→RP
n
to itself induced by f and f . This transfer sequence has the following
form, where to simplify notation we abbreviate RP
n
to P
n
and we let the coefﬁcient
group Z
2
be implicit.
−−−→ −−−→ −−−→ H 0
0
P
n n
( ) S H ( )
p
−−−→ −−−→ P H 0 ( )
n
n n
∗ ∗
≈
−−−→ P H ( )
n
n
≈
n 1
−−−→ −−−→ −−−→ H 0 0 P
n
( )
−−−→ P H ( )
n
i
≈
i 1
τ
−−−→ −−−→ H 0
0
P
n n
( ) P H ( )
−−−→ −−−→ −−−→ P H 0 ( )
n
≈
−−−→ S H ( )
n
≈
p
1 0 0 0
∗
. . .
. . .
−−−→
. . .
. . .
The initial 0 is H
n+1
(P
n
; Z
2
), which vanishes since P
n
is an n dimensional CW com
plex. The other terms which are zero are H
i
(S
n
) for 0 < i < n. We assume n > 1,
leaving the minor modiﬁcations needed for the case n = 1 to the reader. All the terms
which are not zeroes are Z
2
, by cellular homology. (Alternatively, this exact sequence
can be used to compute the homology groups H
i
(RP
n
; Z
2
) if one does not already
know them.) Since all the nonzero groups in the sequence are Z
2
, exactness forces
the maps to be isomorphisms or zero as indicated.
The maps f and f induce a map from the transfer sequence to itself, and we
will need to know that the squares in the resulting diagram commute. This follows
fromthe naturality of the long exact sequence of homology associated to a short exact
sequence of chain complexes, once we verify commutativity of the diagram
−
−
−
−
−
→
−
−
−
−
−
→
−−−−−−−→ −−−−−−−→ −−−−−−−→ −−−−−−−→ P C 0 ( )
−
−
−
−
−
→
C 0
i i i
n
P
n n
( ) S C ( )
τ
p
−−−−−−−→ −−−−−−−→ −−−−−−−→ −−−−−−−→ P C 0 ( ) C 0
i i i
n
P
n n
( ) S C ( )
τ
p
f
f
f
− −
Here the righthand square commutes since pf = fp. The lefthand square com
mutes since for a singular i simplex σ : ∆
i
→P
n
with lifts ` σ
1
and ` σ
2
, the two lifts of
fσ are f ` σ
1
and f ` σ
2
since f takes antipodal points to antipodal points.
Now we can see that all the maps f
∗
and f
∗
in the commutative diagram of
transfer sequences are isomorphisms by induction on dimension, using the evident
fact that if three maps in a commutative square are isomorphisms, so is the fourth.
The induction starts with the trivial fact that f
∗
and f
∗
are isomorphisms in dimen
sion zero.
174 Chapter 2. Homology
In particular we deduce that the map f
∗
: H
n
(S
n
; Z
2
)→H
n
(S
n
; Z
2
) is an isomor
phism. By Lemma 2.49 this map is multiplication by the degree of f mod 2, so the
degree of f must be odd. L¦
The fact that odd maps have odd degree easily implies the BorsukUlam theorem:
Corollary 2B.6. For every map g : S
n
→R
n
there exists a point x ∈ S
n
with g(x) =
g(−x).
Proof: Let f(x) = g(x) − g(−x), so f is odd. We need to show f(x) = 0 for
some x. If this is not the case, we can replace f(x) by f(x)/¦f(x)¦ to get a new
map f : S
n
→S
n−1
which is still odd. The restriction of this f to the equator S
n−1
then has odd degree by the proposition. But this restriction is nullhomotopic via the
restriction of f to one of the hemispheres bounded by S
n−1
. L¦
Exercises
1. Compute H
i
(S
n
−X) when X is a subspace of S
n
homeomorphic to S
k
∨S
or to
S
k
IS
.
2. Show that
`
H
i
(S
n
−X) ≈
`
H
n−i−1
(X) when X is homeomorphic to a ﬁnite connected
graph. [First do the case that the graph is a tree.]
3. In the unit sphere S
p+q−1
⊂ R
p+q
let S
p−1
and S
q−1
be the subspheres consisting
of points whose last q and ﬁrst p coordinates are zero, respectively. Show that S
p−1
and S
q−1
are not the boundaries of any pair of disjointly embedded disks D
p
and D
q
in D
p+q
.
4. Showthat R
2n+1
is not a division algebra over R if n > 0 by showing that if it were,
then for nonzero a ∈ R
2n+1
the map S
2n
→S
2n
, x
ax/¦ax¦ would be homotopic
to x
−ax/¦ax¦, but these maps have different degrees.
5. Make the transfer sequence explicit in the case of a trivial covering
`
X→X, where
`
X = X×S
0
.
6. Use the transfer sequence for the covering S
∞
→RP
∞
to compute H
n
(RP
∞
; Z
2
).
7. Use the transfer sequence for the covering X×S
∞
→X×RP
∞
to produce isomor
phisms H
n
(X×RP
∞
; Z
2
) ≈
¸
i=0
n
H
i
(X; Z
2
) for all n.
Section 2.C. Simplicial Approximation 175
Many spaces of interest in algebraic topology can be given the structure of sim
plicial complexes, and early in the history of the subject this structure was exploited
as one of the main technical tools. Later, CW complexes largely superceded simplicial
complexes in this role, but there are still some occasions when the extra structure of
simplicial complexes can be quite handy. This will be illustrated nicely by the proof
of the classical Lefschetz ﬁxed point theorem in this section.
One of the good features of simplicial complexes is that arbitrary continuous
maps between them can always be deformed to maps which are linear on the sim
plices of some subdivision of the domain complex. This is the idea of ‘simplicial
approximation,’ which goes back all the way to Brouwer and Alexander before 1920.
To state this result in its most basic form we ﬁrst need a deﬁnition. If K and L are
simplicial complexes, then a map f : K→L is simplicial if it sends each simplex of K
to a simplex of L by a linear map taking vertices to vertices. Since a linear map from
a simplex to a simplex is uniquely determined by its values on vertices, this means
that a simplicial map is uniquely determined by its values on vertices. Also, it is easy
to see that a map from the vertices of K to the vertices of L extends to a simplicial
map iff it sends the vertices of each simplex of K to the vertices of some simplex of
L.
Here then is the Simplicial Approximation Theorem:
Theorem 2C.1. If K is a ﬁnite simplicial complex and L is an arbitrary simplicial
complex, then any map f : K→L is homotopic to a map which is simplicial with
respect to some iterated barycentric subdivision of K.
To see that subdivision of K is essential for the validity of this result, consider
the case of maps S
n
→S
n
. With ﬁxed simplicial structures on the domain and range
spheres there are only ﬁnitely many simplicial maps, hence only ﬁnitely many de
grees are realized by simplicial maps. The latter statement remains true even if the
simplicial structure on the range sphere is allowed to vary, since if the range sphere
has more vertices than the domain sphere then the map cannot be surjective hence
must have degree zero, while if the number of vertices in the range sphere is bounded
then the number of possible simplicial structures on this sphere is ﬁnite, and each
simplicial structure can realize only ﬁnitely many degrees.
Before proving the simplicial approximation theorem we need some terminology
and a lemma. The star St σ of a simplex σ in a simplicial complex X is deﬁned
to be the subcomplex consisting of all the simplices of X which contain σ . Closely
related to this is the open star st σ , which is the union of the interiors of all simplices
176 Chapter 2. Homology
containing σ , where the interior of a simplex τ is by deﬁnition τ −∂τ. Thus st σ is
an open set in X whose closure is St σ .
Lemma 2C.2. For vertices v
1
, ··· , v
n
of a simplicial complex X, the intersection
st v
1
∩ ··· ∩ st v
n
is empty unless v
1
, ··· , v
n
are the vertices of a simplex σ of X,
in which case st v
1
∩··· ∩st v
n
= st σ .
Proof: The intersection st v
1
∩ ··· ∩ st v
n
consists of the interiors of all simplices
τ whose vertex set contains ¦v
1
, ··· , v
n
¦. If st v
1
∩ ··· ∩ st v
n
is nonempty, such
a τ exists and contains the simplex σ = [v
1
, ··· , v
n
] ⊂ X. Since the simplices τ
containing ¦v
1
, ··· , v
n
¦ are just the simplices containing σ , we obtain the result that
st v
1
∩··· ∩st v
n
= st σ . L¦
Proof of 2C.1: Choose a metric on K which restricts to the standard Euclidean metric
on each simplex of K. For example, K can be viewed as a subcomplex of a sim
plex ∆
N
whose vertices are all the vertices of K, and we can restrict a standard met
ric on ∆
N
to give a metric on K. Let ε be a Lebesgue number for the open cover
¦ f
−1
¸
st w
¦ w is a vertex of L¦ of K. After iterated barycentric subdivision of K we
may assume that each simplex has diameter less than ε/2. The closed star of each
vertex v of K then has diameter less than ε, hence this closed star maps by f to
the open star of some vertex g(v) of L. The resulting map g : K
0
→L
0
thus satisﬁes
f(St v) ⊂ st g(v) for all vertices v of K.
To see that g extends to a simplicial map g : K→L, consider the problem of
extending g over a simplex [v
1
, ··· , v
n
] of K. An interior point x of this simplex
lies in st v
i
for each i, so f(x) lies in st g(v
i
) for each i, since f(st v
i
) ⊂ st g(v
i
) by
the deﬁnition of g(v
i
). Thus st g(v
1
)∩···∩st g(v
n
) ≠ ∅, so [g(v
1
), ··· , g(v
n
)] is a
simplex of L by the lemma, and we can extend g linearly over [v
1
, ··· , v
n
]. Both f(x)
and g(x) lie in a single simplex of L since g(x) lies in [g(v
1
), ··· , g(v
n
)] and f(x)
lies in the star of this simplex. So taking the linear path (1−t)f(x)+tg(x), 0 ≤ t ≤ 1,
in the simplex containing f(x) and g(x) deﬁnes a homotopy from f to g. To check
continuity of this homotopy it sufﬁces to restrict to the simplex [v
1
, ··· , v
n
], where
continuity is clear since f(x) varies continuously in the star of [g(v
1
), ··· , g(v
n
)]
and g(x) varies continuously in [g(v
1
), ··· , g(v
n
)]. L¦
Notice that if f already sends some vertices of K to vertices of L then we may
choose g to equal to f on these vertices, and hence the homotopy from f to g will
be stationary on these vertices. This is convenient if one is in a situation where one
wants maps and homotopies to preserve basepoints.
The proof makes it clear that the simplicial approximation g can be chosen not
just homotopic to f but also close to f if we allow subdivisions of L as well as K.
Section 2.C. Simplicial Approximation 177
The Lefschetz Fixed Point Theorem
This very classical application of homology is a considerable generalization of the
Brouwer ﬁxed point theorem, and it is also related to the Euler characteristic formula.
For a homomorphism ϕ: Z
n
→Z
n
with matrix [a
ij
], the trace tr ϕ is deﬁned
to be
¸
i
a
ii
, the sum of the diagonal elements of [a
ij
]. Since tr([a
ij
][b
ij
]) =
tr([b
ij
][a
ij
]), conjugate matrices have the same trace, and it follows that tr ϕ is in
dependent of the choice of basis for Z
n
. For a homomorphism ϕ: A→A of a ﬁnitely
generated abelian group A we can then deﬁne tr ϕ to be the trace of the induced
homomorphism ϕ: A/Torsion→A/Torsion.
For a map f : X→X of a ﬁnite CW complex X, or more generally any space whose
homology groups are ﬁnitely generated and vanish in high dimensions, the Lefschetz
number τ(f) is deﬁned to be
¸
n
(−1)
n
tr
¸
f
∗
: H
n
(X)→H
n
(X)
. In particular, if f
is the identity, or is homotopic to the identity, then τ(f) is the Euler characteristic
χ(X) since the trace of the n×n identity matrix is n.
Here is the Lefschetz Fixed Point Theorem:
Theorem 2C.3. If X is a ﬁnite simplicial complex, or more generally a retract of a
ﬁnite simplicial complex, and f : X→X is a map with τ(f) ≠ 0, then f has a ﬁxed
point.
As we show in Theorem A.7 in the Appendix, every compact, locally contractible
space which can be embedded in a Euclidean space of some dimension is a retract of a
ﬁnite simplicial complex. This includes compact manifolds and ﬁnite CW complexes,
for example. The compactness hypothesis is essential, since a translation of R has τ =
1 but no ﬁxed points. For an example showing that local properties are also signiﬁcant,
let X be the compact subspace of R
2
consisting of two concentric circles together with
a copy of R between them whose two ends spiral into the two
circles, wrapping around them inﬁnitely often, and let f : X→X
be a homeomorphism translating the R along itself and rotating
the circles, with no ﬁxed points. Since f is homotopic to the
identity, we have τ(f) = χ(X), which equals 1 since the three
path components of X are two circles and a line.
If X has the same homology groups as a point, at least modulo torsion, the the
orem says that every map has a ﬁxed point. This holds for example for RP
n
if n is
even. The case of projective spaces is interesting because of its connection with linear
algebra. An invertible linear transformation f : R
n
→R
n
takes lines through 0 to lines
through 0, hence induces a map f : RP
n−1
→RP
n−1
. Fixed points of f are equivalent
to eigenvectors of f . The characteristic polynomial of f has odd degree if n is odd,
hence has a real root, so an eigenvector exists in this case. This is in agreement with the
observation above that every map RP
2k
→RP
2k
has a ﬁxed point. On the other hand
178 Chapter 2. Homology
the rotation of R
2k
deﬁned by f(x
1
, ··· , x
2k
) = (x
2
, −x
1
, x
4
, −x
3
, ··· , x
2k
, −x
2k−1
),
has no eigenvectors and its projectivization f : RP
2k−1
→RP
2k−1
has no ﬁxed points.
Similarly, in the complex case an invertible linear transformation f : C
n
→C
n
in
duces f : CP
n−1
→CP
n−1
, and this always has a ﬁxed point since the characteristic
polynomial always has a complex root. Nevertheless, as in the real case there is a map
f : CP
2k−1
→CP
2k−1
without ﬁxed points. Namely, consider the map f : C
2k
→C
2k
de
ﬁned by f(z
1
, ··· , z
2k
) = (z
2
, −z
1
, z
4
, −z
3
, ··· , z
2k
, −z
2k−1
). This is only ‘conjugate
linear’ over C, but this is still good enough to imply that f induces a welldeﬁned map
f on CP
2k−1
. Then it is an easy algebra exercise to check that f has no ﬁxed points.
The similarity between the real and complex cases persists in the fact that every map
CP
2k
→CP
2k
has a ﬁxed point, though to deduce this one needs more structure than
just homology, so this will be left as an exercise for §3.2, using cup products.
One could go further and consider the quaternionic case. Oddly enough, every
map HP
n
→HP
n
has a ﬁxed point if n > 1, according to an exercise in §4.K. When
n = 1 the antipodal map of S
3
= HP
1
has no ﬁxed points.
Proof of 2C.3: The general case easily reduces to the case of ﬁnite simplicial com
plexes, for suppose r : K→X is a retraction of the ﬁnite simplicial complex K onto
X. For a map f : X→X, the composition fr : K→X ⊂ K then has exactly the same
ﬁxed points as f . Since r
∗
: H
n
(K)→H
n
(X) is projection onto a direct summand, we
clearly have tr f
∗
r
∗
= tr f
∗
, so τ(f
∗
r
∗
) = τ(f
∗
).
For X a ﬁnite simplicial complex, suppose f : X→X has no ﬁxed points. We
claim there is a subdivision L of X, a further subdivision K of L, and a simplicial
map g : K→L homotopic to f such that g(σ) ∩σ = ∅ for each simplex σ of K. To
see this, ﬁrst choose a metric d on X as in the proof of the preceding proposition.
Since f has no ﬁxed points, d
¸
x, f(x)
> 0 for all x ∈ X, so by the compactness of X
there is an ε > 0 such that d
¸
x, f(x)
> ε for all x. Choose a subdivision L of X so
that the stars of all simplices have diameter less than ε/2. By the proposition, there is
a subdivision K of L and a simplicial map g : K→L homotopic to f . By construction,
this g has the property that for each simplex σ of K, f(σ) is contained in the star of
the simplex g(σ). We may assume the subdivision K is chosen ﬁne enough so that
its simplices all have diameter less than ε/2. Then g(σ) ∩σ = ∅ for each simplex σ
of K since for x ∈ σ , σ lies within distance ε/2 of x and g(σ) lies within distance
ε/2 of f(x), while d
¸
x, f(x)
> ε.
For such a g : K→L, the Lefschetz numbers τ(f) and τ(g) are equal since f
and g are homotopic. Since g is simplicial, it takes the n skeleton K
n
of K to the
n skeleton L
n
of L, for each n. Since K is a subdivision of L, L
n
is contained in K
n
,
and hence g(K
n
) ⊂ K
n
for all n. Thus g induces a chain map of the cellular chain
complex ¦H
n
(K
n
, K
n−1
)¦ to itself.
Section 2.C. Simplicial Approximation 179
The next thing to observe is that
τ(g) =
¸
n
(−1)
n
tr
¸
g
∗
: H
n
(K
n
, K
n−1
)→H
n
(K
n
, K
n−1
)
.
This is the analog of Theorem 2.44 for trace instead of rank, and is proved in pre
cisely the same way, based on the elementary algebraic fact that trace is additive for
endomorphisms of short exact sequences, i.e., given a commutative diagram
0 A
α β γ
−
−
−
−
→
−
−
−
−
→
−
−
−
−
→
−−−−−→ B −−−−−−→ C −−−−−−→ 0 −−−−−→
0 A −−−−−→ B −−−−−−→ C −−−−−−→ 0 −−−−−→
with exact rows, then tr β = tr α+tr γ. This algebraic fact can be proved by reducing to
the easy case that A, B, and C are free by ﬁrst factoring out the torsion in B, hence
also in A, then eliminating any remaining torsion in C by replacing A by a larger
subgroup A
¹
⊂ B, with A having ﬁnite index in A
¹
. The details of this argument are
left to the reader.
Finally, note that g
∗
: H
n
(K
n
, K
n−1
)→H
n
(K
n
, K
n−1
) has trace 0 since the matrix
for g
∗
has zeros down the diagonal, in view of the fact that g(σ) ∩σ = ∅ for each
n simplex σ . So τ(f) = τ(g) = 0. L¦
Fixed point theory is a welldeveloped side branch of algebraic topology which
will not be touched upon much in this book. For a nice introduction see [R.Brown].
Simplicial Approximations to CW Complexes
The simplicial approximation theorem concerns maps, and there is a somewhat
analogous statement about spaces:
Theorem2C.4. Every CWcomplex X is homotopy equivalent to a simplicial complex,
which can be chosen to be of the same dimension as X, ﬁnite if X is ﬁnite, and
countable if X is countable.
We will build a simplicial complex Y = X inductively as an increasing union of
subcomplexes Y
n
homotopy equivalent to the skeleta X
n
. For the inductive step,
assuming we have already constructed Y
n
= X
n
, let e
n+1
be an (n + 1) cell of X
attached by a map ϕ: S
n
→X
n
. The map S
n
→Y
n
corresponding to ϕ under the
homotopy equivalence Y
n
= X
n
is homotopic to a simplicial map f : S
n
→Y
n
by the
simplicial approximation theorem, and it is not hard to see that the spaces X
n
∪
ϕ
e
n+1
and Y
n
∪
f
e
n+1
are homotopy equivalent, where the subscripts denote attaching e
n+1
via ϕ and f , respectively; see Proposition 0.18 for a proof. We can view Y
n
∪
f
e
n+1
as the mapping cone C
f
, obtained from the mapping cylinder of f by collapsing the
domain end to a point. If we knew that the mapping cone of a simplicial map was a
simplicial complex, then by performing the same construction for all the (n+1) cells
of X we would have completed the induction step. Unfortunately, and somewhat
180 Chapter 2. Homology
surprisingly, mapping cones and mapping cylinders are rather awkward objects in the
simplicial category. To avoid this awkwardness we will instead construct simplicial
analogs of mapping cones and cylinders which have all the essential features of actual
mapping cones and cylinders.
Let us ﬁrst construct the simplicial analog of a mapping cylinder. For a simpli
cial map f : K→L this will be a simplicial complex M(f) containing both L and the
barycentric subdivision K
¹
of K as subcomplexes, and such that there is a deforma
tion retraction r
t
of M(f) onto L with r
1
¦
¦K
¹
= f . The ﬁgure shows the case that f
is a simplicial surjection ∆
2
→∆
1
. The construction proceeds
one simplex of K at a time, by induction on dimension.
To begin, the ordinary mapping cylinder of f ¦
¦K
0
sufﬁces
for M(f ¦
¦K
0
). Assume inductively that we have already con
structed M(f ¦
¦K
n−1
). Let σ be an n simplex of K and let
τ = f(σ), a simplex of L of dimension n or less. In particular,
we assume we have already constructed M(f : ∂σ→τ) with the desired properties,
and then we let M(f : σ→τ) be the cone on M(f : ∂σ→τ), as shown in the ﬁgure.
The space M(f : ∂σ→τ) is contractible since by induction it deformation retracts
onto τ which is contractible. The cone M(f : σ→τ) is of course contractible, so
the inclusion of M(f : ∂σ→τ) into M(f : σ→τ) is a homotopy equivalence. This
implies that M(f : σ→τ) deformation retracts onto M(f : ∂σ→τ) by Corollary 0.20
(or one can give a direct argument using the fact that M(f : ∂σ→τ) is contractible).
Performing these constructions for all n simplices σ , we obtain M(f ¦
¦K
n
) with a
deformation retraction onto M(f ¦
¦K
n−1
). Taking the union over all n yields M(f)
with a deformation retraction r
t
onto L, namely the inﬁnite concatenation of the
previous deformation retractions, with the deformation retraction of M(f ¦
¦K
n
) onto
M(f ¦
¦K
n−1
) performed in the t interval [1/2
n+1
, 1/2
n
]. The map r
1
¦
¦K produced
by this process may not equal f , but it is homotopic to f via the linear homotopy
tf +(1−t)r
1
, which is deﬁned since r
1
(σ) ⊂ f(σ) for all simplices σ of K. By apply
ing the homotopy extension property to the homotopy of r
1
which equals tf+(1−t)r
1
on K and the identity map on L, we can improve our deformation retraction of M(f)
onto L so that its restriction to K at time 1 is f .
From the simplicial analog M(f) of a mapping cylinder we construct the simpli
cial ‘mapping cone’ C(f) by attaching the ordinary cone on K
¹
to the subcomplex
K
¹
⊂ M(f).
Proof of 2C.4: We will construct for each n a CW complex Z
n
containing X
n
as a
deformation retract and also containing as a deformation retract a subcomplex Y
n
which is a simplicial complex. Beginning with Y
0
= Z
0
= X
0
, suppose inductively that
we have already constructed Y
n
and Z
n
. Let the cells e
n+1
α
of X be attached by maps
ϕ
α
: S
n
→X
n
. Using the simplicial approximation theorem, there is a homotopy from
ϕ
α
to a simplicial map f
α
: S
n
→Y
n
. The CW complex W
n
= Z
n
α
M(f
α
) contains a
Section 2.C. Simplicial Approximation 181
simplicial subcomplex S
n
α
homeomorphic to S
n
at one end of M(f
α
), and the homeo
morphism S
n
≈ S
n
α
is homotopic in W
n
to the map f
α
, hence also to ϕ
α
. Let Z
n+1
be
obtained from Z
n
by attaching D
n+1
α
×I ’s via these homotopies between the ϕ
α
’s and
the inclusions S
n
α
W
n
. Thus Z
n+1
contains X
n+1
at one end, and at the other end we
have a simplicial complex Y
n+1
= Y
n
α
C(f
α
), where C(f
α
) is obtained from M(f
α
)
by attaching a cone on the subcomplex S
n
α
. Since D
n+1
×I deformation retracts onto
∂D
n+1
×I ∪D
n+1
×¦0¦, we see that Z
n+1
deformation retracts onto Z
n
∪Y
n+1
, which
in turn deformation retracts onto Y
n
∪ Y
n+1
= Y
n+1
by induction. Likewise, Z
n+1
deformation retracts onto X
n+1
∪W
n
which deformation retracts onto X
n+1
∪Z
n
and
hence onto X
n+1
∪X
n
= X
n+1
by induction.
Let Y =
n
Y
n
and Z =
n
Z
n
. The deformation retractions of Z
n
onto X
n
give deformation retractions of X ∪Z
n
onto X, and the inﬁnite concatenation of the
latter deformation retractions is a deformation retraction of Z onto X. Similarly, Z
deformation retracts onto Y . L¦
Exercises
1. Use the Lefschetz Fixed Point Theorem to show that a map S
n
→S
n
has a ﬁxed
point unless its degree is equal to the degree of the antipodal map x
−x.
2. Verify that the formula f(z
1
, ··· , z
2k
) = (z
2
, −z
1
, z
4
, −z
3
, ··· , z
2k
, −z
2k−1
) deﬁnes
a map f : C
2k
→C
2k
inducing a quotient map CP
2k−1
→CP
2k−1
without ﬁxed points.
3. If X is a ﬁnite simplicial complex and f : X→X is a simplicial homeomorphism,
showthat the Lefschetz number τ(f) equals the Euler characteristic of the set of ﬁxed
points of f . In particular, τ(f) is the number of ﬁxed points if the ﬁxed points are
isolated. [Hint: Barycentrically subdivide X to make the ﬁxed point set a subcomplex.]
4. Let M be a closed orientable surface embedded in R
3
in such a way that reﬂection
across a plane P deﬁnes a homeomorphism r : M→M ﬁxing M ∩ P , a collection of
circles. Is it possible to homotope r to have no ﬁxed points?
5. Let X be homotopy equivalent to a ﬁnite simplicial complex and let Y be homotopy
equivalent to a ﬁnite or countably inﬁnite simplicial complex. Using the simplicial ap
proximation theorem, show that there are at most countably many homotopy classes
of maps X→Y .
6. Show that there are only countably many homotopy types of ﬁnite CW complexes.
Cohomology is an algebraic variant of homology, the result of a simple dualiza
tion in the deﬁnition. Not surprisingly, cohomology groups satisfy axioms much like
the axioms for homology, except that induced homomorphisms go in the opposite
direction as a result of the dualization. The basic difference between homology and
cohomology is thus that cohomology groups are contravariant functors while homol
ogy groups are covariant. In terms of intrinsic information, however, there is not a big
difference between homology groups and cohomology groups. The homology groups
of a space determine its cohomology groups, and the converse holds at least when
the homology groups are ﬁnitely generated.
What is a little surprising is that contravariance leads to extra structure in co
homology. This ﬁrst appears in a natural product, called cup product, which makes
the cohomology groups of a space into a ring. This is an extremely useful piece of
additional structure, and much of this chapter is devoted to studying cup products,
which are considerably more subtle than the additive structure of cohomology.
How does contravariance lead to a product in cohomology which is not present in
homology? There is indeed a natural product in homology, called ‘cross product,’ but
this has a somewhat different form, H
i
(X)×H
j
(Y) →H
i+j
(X×Y). If X and Y are
CW complexes, this product is induced from a map of cellular chains sending a pair
(e
i
, e
j
) consisting of a cell of X and a cell of Y to the product cell e
i
×e
j
in X×Y .
The details of this construction are given in §3B. Taking X = Y , we thus have the ﬁrst
half of a hypothetical product
H
i
(X)×H
j
(X) →H
i+j
(X×X) →H
i+j
(X)
The difﬁculty is in deﬁning the second map. The natural thing would be for this to be
induced by a map X×X→X. The multiplication map in a topological group or more
generally an H–space is such a map, and the resulting product, called Pontryagin prod
uct, can be quite useful; see §3C. But for general X, the only natural maps X×X→X
184 Chapter 3. Cohomology
are the projections onto one of the factors, and since these projections collapse the
other factor to a point, the resulting product in homology is rather trivial.
With cohomology, however, the situation is better. One still has a cross product
H
i
(X)×H
j
(Y) →H
i+j
(X×Y) which can be constructed in much the same way as in
homology, so one can again take X = Y and get the ﬁrst half of a product
H
i
(X)×H
j
(X) →H
i+j
(X×X) →H
i+j
(X)
But now by contravariance the second map would be induced by a map X→X×X,
and there is an obvious candidate for this map, the diagonal map ∆(x) = (x, x). This
turns out to work very nicely, giving a wellbehaved product in cohomology, the cup
product.
Another sort of extra structure in cohomology whose existence is traceable to
contravariance is provided by cohomology operations. These make the cohomology
groups of a space into a module over a certain rather complicated ring. Cohomology
operations lie at a depth somewhat greater than the cup product structure, so we
defer their study to §4L.
The extra layer of algebra in cohomology arising from the dualization in its deﬁ
nition may seemat ﬁrst to be separating it further fromtopology, but there are a quite
a few topological situations where cohomology arises quite naturally. One of these is
Poincar´e duality, the topic of the third section of this chapter. Another is obstruction
theory, in §4.3. Characteristic classes in vector bundle theory (see [MilnorStasheff]
or [VBKT]) provide yet another instance.
From the viewpoint of homotopy theory, cohomology is in some ways more basic
than homology. As we shall see in §4.3, cohomology has a description in terms of
homotopy classes of maps which is very similar to, and in a sense dual to, the deﬁnition
of homotopy groups. There is an analog of this for homology described in §4F, but
the construction is more complicated.
The Idea of Cohomology
Let us look at a few lowdimensional examples to get an idea of how one might be
led naturally to consider cohomology groups, and to see what properties of a space
they might be measuring. For the sake of simplicity we consider simplicial cohomology
of ∆ complexes, rather than singular cohomology of more general spaces.
Taking the simplest case ﬁrst, let X be a 1 dimensional ∆ complex, or in other
words an oriented graph. For a ﬁxed abelian group G, the set of all functions fromver
tices of X to G also forms an abelian group, which we denote by ∆
0
(X; G). Similarly
the set of all functions assigning an element of G to each edge of X forms an abelian
group ∆
1
(X; G). We will be interested in the homomorphism δ: ∆
0
(X; G)→∆
1
(X; G)
sending ϕ ∈ ∆
0
(X; G) to the function δϕ ∈ ∆
1
(X; G) whose value on an oriented
edge [v
0
, v
1
] is the difference ϕ(v
1
) − ϕ(v
0
). For example, X might be the graph
The Idea of Cohomology 185
formed by a system of trails on a mountain, with vertices at the junctions between
trails. The function ϕ could then assign to each junction its elevation above sea level,
in which case δϕ would measure the net change in elevation along the trail from one
junction to the next. Or X might represent a simple electrical circuit with ϕ mea
suring voltages at the connection points, the vertices, and δϕ measuring changes in
voltage across the components of the circuit, represented by edges.
Regarding the map δ: ∆
0
(X; G)→∆
1
(X; G) as a chain complex with 0’s before and
after these two terms, the homology groups of this chain complex are by deﬁnition the
simplicial cohomology groups of X. Speciﬁcally, these groups are H
0
(X; G) = Ker δ ⊂
∆
0
(X; G) and H
1
(X; G) = ∆
1
(X; G)/ Imδ. For simplicity we are using here the same
notation as will be used for singular cohomology later in the chapter, in anticipation
of the theorem that the two theories coincide for ∆ complexes, as we show in §3.1.
The group H
0
(X; G) is easy to describe explicitly. A function ϕ ∈ ∆
0
(X; G) has
δϕ = 0 iff ϕ takes the same value at both ends of each edge of X, and this is
equivalent to saying that ϕ is constant on each component of X. So H
0
(X; G) is the
group of all functions from the set of components of X to G. This is a direct product
of copies of G, one for each component of X.
The cohomology group H
1
(X; G) = ∆
1
(X; G)/ Imδ will be trivial iff the equation
δϕ = ψ has a solution ϕ ∈ ∆
0
(X; G) for each ψ ∈ ∆
1
(X; G). Solving this equation
means deciding whether specifying the change in ϕ across each edge of X determines
an actual function ϕ ∈ ∆
0
(X; G). This is rather like the calculus problem of ﬁnding a
function having a speciﬁed derivative, with the difference operator δ playing the role
of differentiation. As in calculus, if a solution of δϕ = ψ exists, it will be unique up
to adding an element of the kernel of δ, that is, a function which is constant on each
component of X.
The equation δϕ = ψ is always solvable if X is a tree since if we choose arbitrarily
a value for ϕ at a basepoint vertex v
0
, then if the change in ϕ across each edge of
X is speciﬁed, this uniquely determines the value of ϕ at every other vertex v by
induction along the unique path from v
0
to v in the tree. For a general X which is
not a tree, we may choose a maximal tree in each component of X, and then the values
of ψ on the edges of these maximal trees determine ϕ uniquely up to a constant on
each component of X. But in order for the equation δϕ = ψ to hold, the value of
ψ on each edge not in the maximal trees must equal the difference in the already
determined values of ϕ at the two ends of the edge. This condition need not be
satisﬁed since ψ can have arbitrary values on these edges. Thus we see that the
homology group H
1
(X; G) is a direct product of copies of the group G, one copy for
each edge of X not in one of the chosen maximal trees. This can be compared with
the homology group H
1
(X; G) which consists of a direct sum of copies of G, one
for each edge of X not in one of the maximal trees. Note that the relation between
H
1
(X; G) and H
1
(X; G) is the same as the relation between H
0
(X; G) and H
0
(X; G),
186 Chapter 3. Cohomology
with H
0
(X; G) being a direct product of copies of G and H
0
(X; G) a direct sum, with
one copy for each component of X in either case.
Now let us move up a dimension, taking X to be a 2 dimensional ∆ complex.
Deﬁne ∆
0
(X; G) and ∆
1
(X; G) as before, as functions from vertices and edges of X
to the abelian group G, and deﬁne ∆
2
(X; G) to be the functions from 2 simplices of
X to G. A homomorphism δ: ∆
1
(X; G)→∆
2
(X; G) is deﬁned by δψ([v
0
, v
1
, v
2
]) =
ψ([v
0
, v
1
]) +ψ([v
1
, v
2
]) −ψ([v
0
, v
2
]), a signed sum of the values of ψ on the three
edges in the boundary of [v
0
, v
1
, v
2
], just as δϕ for ϕ ∈ ∆
0
(X; G) was a signed
sum of the values of ϕ on the boundary of [v
0
, v
1
]. The two maps ∆
0
(X; G)
δ
→
∆
1
(X; G)
δ
→∆
2
(X; G) form a chain complex since for ϕ ∈ ∆
0
(X; G) we have δδϕ =
¸
ϕ(v
1
) − ϕ(v
0
)
+
¸
ϕ(v
2
) − ϕ(v
1
)
−
¸
ϕ(v
2
) − ϕ(v
0
)
= 0. Extending this chain
complex by 0’s on each end, the resulting homology groups are by deﬁnition the
cohomology groups H
i
(X; G).
The formula for the map δ: ∆
1
(X; G)→∆
2
(X; G) can be looked at from a couple
different viewpoints. First, we see that δψ = 0 iff ψ satisﬁes the ‘homomorphism’
property ψ([v
0
, v
2
]) = ψ([v
0
, v
1
])+ψ([v
1
, v
2
]), where we think of the edge [v
0
, v
2
]
as the ‘product’ of the edges [v
0
, v
1
] and [v
1
, v
2
]. Thus δψ measures the deviation
of ψ from being additive.
From another point of view, δψ can be regarded as an obstruction to ﬁnding
ϕ ∈ ∆
0
(X; G) with ψ = δϕ, in that if ψ = δϕ then δψ = 0, since δδϕ = 0 as
we saw above. We can think of δψ as a local obstruction to solving ψ = δϕ since
it depends only on the values of ψ within individual 2 simplices of X. If this local
obstruction vanishes, then ψ deﬁnes an element of H
1
(X; G) which is zero iff ψ = δϕ
has an actual solution. This class in H
1
(X; G) is thus the global obstruction to solving
ψ = δϕ. This situation is similar to the calculus problem of determining whether a
given vector ﬁeld is the gradient vector ﬁeld of some function. The local obstruction
here is the vanishing of the curl of the vector ﬁeld, and the global obstruction is the
vanishing of all line integrals around closed loops in the domain of the vector ﬁeld.
The ‘cocycle condition’ δψ = 0 has a third interpretation of a more geometric
nature when X is a surface and the group G is Z or Z
2
. Consider ﬁrst the simpler
case G = Z
2
. Then if δψ = 0 on a simplex [v
0
, v
1
, v
2
], either ψ is zero on all three
edges of the simplex, or ψ is zero on one edge and 1 on the other two edges. In the
latter case, suppose we connect these two edges by a curve in [v
0
, v
1
, v
2
].
v
1
1
0
0
v
2
v
1
v
0
1
1
0
v
2
v
1
v
1
0
1
0
v
2
v
1
Doing this for all 2 simplices of X, we obtain a collection C
ψ
of disjoint curves in X
crossing the 1skeleton transversely. Since C
ψ
determines ψ uniquely, we can view
The Idea of Cohomology 187
C
ψ
as a sort of geometric representation of ψ.
When G = Z we can reﬁne this construction by putting a number of curves in
each 2 simplex, each curve having a trans
verse orientation indicated by the arrow
in the ﬁgure, the orientation which
v
5
2 3
0
v
2
v
1
v
1
3
2
0
v
2
v
1
agrees or disagrees with the orien
tation of each edge according to
the sign of the value of ψ on the edge. The resulting collection C
ψ
of disjoint
curves in X can be thought of as something like level curves for a function ϕ with
δϕ = ψ, if such a function exists. The value of
ϕ changes by 1 each time a curve of C
ψ
is crossed. For example, if X is a
4
4
3
2
1
1
0
1 0
1
0
0
disk then H
1
(X; Z) = 0, as will be
shown in this chapter, so δψ = 0
implies ψ = δϕ for some ϕ, hence
every transverse curve system C
ψ
forms
the level curves of a function ϕ. On the
other hand, if X is an annulus then this need no longer
be true, as illustrated in the example shown in the ﬁg
ure to the right, where the equation ψ = δϕ obviously
1
1
1
1
?
?
1 1
0
0
0
0
has no solution even though δψ = 0. By identifying
the inner and outer boundary circles of this annulus we
obtain a similar example on the torus.
The key to relating cohomology groups to homology groups is the observation
that a function from i simplices of X to G is equivalent to a homomorphismfromthe
simplicial chain group ∆
i
(X) to G. This is because ∆
i
(X) is free abelian with basis the
i simplices of X, and a homomorphism with domain a free abelian group is uniquely
determined by its values on basis elements, which can be assigned arbitrarily. Thus we
have an identiﬁcation of ∆
i
(X; G) with the group Hom(∆
i
(X), G) of homomorphisms
∆
i
(X)→G, which is called the dual group of ∆
i
(X). There is also a simple relationship
of duality between the homomorphism δ: ∆
i
(X; G)→∆
i+1
(X; G) and the boundary
homomorphism ∂ : ∆
i+1
(X)→∆
i
(X). The general formula for δ is
δϕ([v
0
, ··· , v
i+1
]) =
¸
j
(−1)
j
ϕ([v
0
, ··· , v
j
, ··· , v
i+1
])
and the latter sumis just ϕ(∂[v
0
, ··· , v
i+1
]). Thus we have δϕ = ϕ∂. In other words,
δ sends each ϕ ∈ Hom(∆
i
(X), G) to the composition ∆
i+1
(X)
∂
→∆
i
(X)
ϕ
→G, which
in the language of linear algebra means that δ is the dual map of ∂.
Thus we have the algebraic problem of understanding the relationship between
the homology groups of a chain complex and the homology groups of the dual complex
obtained by applying the functor C
Hom(C, G). This is the ﬁrst topic of the chapter.
188 Chapter 3. Cohomology
Homology groups H
n
(X) are the result of a twostage process: First one forms a
chain complex ··· →C
n
∂
→C
n−1
→··· of singular, simplicial, or cellular chains,
then one takes the homology groups of this chain complex, Ker ∂/ Im∂. To obtain
the cohomology groups H
n
(X; G) we interpolate an intermediate step, replacing the
chain groups C
n
by the dual groups Hom(C
n
, G) and the boundary maps ∂ by their
dual maps δ, before forming the cohomology groups Ker δ/ Imδ. The plan for this
section is ﬁrst to sort out the algebra of this dualization process and show that the
cohomology groups are determined algebraically by the homology groups, though
in a somewhat subtle way. Then after this algebraic excursion we will deﬁne the
cohomology groups of spaces and show these satisfy basic properties very much like
those for homology. The payoff for all this formal work will begin to be apparent in
subsequent sections.
The Universal Coefﬁcient Theorem
Let us begin with a simple example. Consider the chain complex
−−−−−−−−→
0
Z Z −−−−−−−−→
2
Z −−−−−−−−→
0
Z −−−−−−→ −−−−−−→ 0 0
=
C
3
=
C
2
=
C
1
=
C
0
where Z
2
→Z is the map x
2x. If we dualize by taking Hom(−, G) with G = Z,
we obtain the cochain complex
0
Z Z
2
Z
0
Z
− − − − − − → − − − − − − → − − − − − − → − − − − − − → − − − − − − →
0 0
=
C
3
=
C
2
=
C
1
=
C
0
∗ ∗ ∗ ∗
In the original chain complex the homology groups are Z’s in dimensions 0 and 3,
together with a Z
2
in dimension 1. In the cohomology of the cochain complex we still
get Z’s in dimensions 0 and 3, but the Z
2
has shifted up a dimension, to dimension 2.
More generally, consider any chain complex of ﬁnitely generated free abelian
groups. It was an exercise in §2.2 to show that such a chain complex splits as
the direct sum of elementary complexes 0→Z→0 and 0→Z
m
→Z→0. Applying
Hom(−, Z), we obtain the direct sum of the corresponding dual complexes 0←Z←0
and 0←Z
m
← Z←0. Thus the cohomology groups are the same as the homology
groups except that torsion is shifted up one dimension. We will see later in this section
that the same relation between homology and cohomology holds whenever the homol
ogy groups are ﬁnitely generated, even when the chain groups are not ﬁnitely gener
ated. It would also be quite easy to see in this example what happens if Hom(−, Z) is
replaced by Hom(−, G), since the dual elementary cochain complexes would then be
0←G←0 and 0←G
m
← G←0.
Section 3.1. Cohomology Groups 189
Consider now a completely general chain complex C of free abelian groups, of
the form ··· →C
n
∂
→C
n−1
→···. To dualize this complex we replace each chain
group C
n
by its dual cochain group C
∗
n
= Hom(C
n
, G), the group of homomorphisms
C
n
→G, and we replace each boundary map ∂ : C
n
→C
n−1
by its dual coboundary map
δ = ∂
∗
: C
∗
n−1
→C
∗
n
. The reason why δ goes in the opposite direction from ∂, increas
ing rather than decreasing dimension, is that, for a homomorphism α: A→B, the
dual homomorphism α
∗
: Hom(B, G)→Hom(A, G) is deﬁned by α
∗
(ϕ) = ϕα, so α
∗
sends ϕ: B→G to the composition A
α
→B
ϕ
→G. Dual homomorphisms obviously
satisfy (αβ)
∗
= β
∗
α
∗
, 11
∗
= 11, and 0
∗
= 0. In particular, since ∂∂ = 0 it follows that
δδ = 0, so the cohomology group H
n
(C; G) can be deﬁned as the ‘homology group’
Ker δ/ Imδ at C
∗
n
in the cochain complex ··· →C
∗
n
δ
→C
∗
n+1
→···.
Our goal is to show that the cohomology groups H
n
(C; G) are determined solely
by G and the homology groups H
n
(C) = Ker ∂/ Im∂. A ﬁrst guess might be that
H
n
(C; G) is isomorphic to Hom(H
n
(C), G), but this is overly optimistic, as shown by
the example above where H
2
was zero while H
2
was nonzero. Nevertheless, there is
a natural map h: H
n
(C; G)→Hom(H
n
(C), G), deﬁned as follows. Denote the cycles
and boundaries by Z
n
= Ker ∂ ⊂ C
n
and B
n
= Im∂ ⊂ C
n
. A class in H
n
(C; G) is
represented by a homomorphism ϕ: C
n
→G such that δϕ = 0, i.e., ϕ∂ = 0, or in
other words, ϕ vanishes on B
n
. The restriction ϕ
0
= ϕ¦
¦Z
n
then induces a quotient
homomorphism ϕ
0
: Z
n
/B
n
→G, an element of Hom(H
n
(C), G). If ϕ is in Imδ, say
ϕ = δψ = ψ∂, then ϕ is zero on Z
n
, so ϕ
0
= 0 and hence also ϕ
0
= 0. Thus there is
a welldeﬁned quotient map h: H
n
(C; G)→Hom(H
n
(C), G) sending the cohomology
class of ϕ to ϕ
0
. Obviously h is a homomorphism.
It is not hard to see that h is surjective. The short exact sequence
0 →Z
n
→C
n
∂
→B
n−1
→0
splits since B
n−1
is free, being a subgroup of the free abelian group C
n−1
. Thus
there is a projection homomorphism p: C
n
→Z
n
which restricts to the identity on Z
n
.
Composing with p gives a way of extending homomorphisms ϕ
0
: Z
n
→G to homo
morphisms ϕ = ϕ
0
p: C
n
→G. In particular, this extends homomorphisms Z
n
→G
which vanish on B
n
, i.e., homomorphisms H
n
(C)→G, to homomorphisms C
n
→G
which still vanish on B
n
, i.e., elements of Ker δ. Thus we have a homomorphism
Hom(H
n
(C), G)→Ker δ. Composing this with the quotient map Ker δ→H
n
(C; G)
gives a homomorphism from Hom(H
n
(C), G) to H
n
(C; G). If we follow this map by
h we get the identity map on Hom(H
n
(C), G) since the effect of composing with h
is simply to undo the effect of extending homomorphisms via p. This shows that h
is surjective. In fact it shows that we have a split short exact sequence
0 →Ker h →H
n
(C; G)
h
→Hom(H
n
(C), G) →0
The remaining task is to analyze Ker h. A convenient way to start the process is
to consider not just the chain complex C, but also its subcomplexes consisting of the
190 Chapter 3. Cohomology
cycles and the boundaries. Thus we consider the commutative diagram of short exact
sequences
(i)
C
n 1 + −−−−−→ Z
n 1 + −−−−−→ −−−−−→ B 0 0
n −−−−−→
∂
∂
C
n −−−−−→ Z
n −−−−−→ −−−−−→ B 0 0
0 0
−−−−−→
∂
−
−
→
−
−
→
−
−
→
n 1
where the vertical boundary maps on Z
n+1
and B
n
are the restrictions of the boundary
map in the complex C, hence are zero. Dualizing (i) gives a commutative diagram
(ii)
C
n 1 + − − − − − → Z
n 1 + − − − − − → − − − − − → B 0 0
n − − − − − →
C
n − − − − − → Z
n − − − − − → − − − − − → B 0 0
0 0
− − − − − →
−
−
→
−
−
→
−
−
→
n 1
∗ ∗ ∗
∗ ∗ ∗
δ
The rows here are exact since, as we have already remarked, the rows of (i) split, and
the dual of a split short exact sequence is a split short exact sequence because of the
natural isomorphism Hom(A⊕B, G) ≈ Hom(A, G) ⊕Hom(B, G).
We may view (ii), like (i), as part of a short exact sequence of chain complexes,
with the coboundary maps in the Z
∗
n
and B
∗
n
complexes zero since they are the duals
of those in (i). The associated long exact sequence of homology groups then has the
form
(iii) ···← B
∗
n
← Z
∗
n
← H
n
(C; G)← B
∗
n−1
← Z
∗
n−1
← ···
The ‘boundary maps’ Z
∗
n
→B
∗
n
in this long exact sequence are in fact the dual maps
i
∗
n
of the inclusions i
n
: B
n
→Z
n
, as one sees by recalling how these boundary maps
are deﬁned: In (ii) one takes an element of Z
∗
n
, pulls this back to C
∗
n
, applies δ to
get an element of C
∗
n+1
, then pulls this back to B
∗
n
. The ﬁrst of these steps extends
a homomorphism ϕ
0
: Z
n
→G to ϕ: C
n
→G, the second step composes this ϕ with
∂, and the third step undoes this composition and restricts ϕ to B
n
. The net effect
is just to restrict ϕ
0
from Z
n
to B
n
.
A long exact sequence can always be broken up into short exact sequences, and
doing this for the sequence (iii) yields short exact sequences
(iv) 0← Ker i
∗
n
← H
n
(C; G)← Coker i
∗
n−1
← 0
The group Ker i
∗
n
can be identiﬁed naturally with Hom(H
n
(C), G) since elements of
Ker i
∗
n
are homomorphisms Z
n
→G which vanish on the subgroup B
n
, and such ho
momorphisms are the same as homomorphisms Z
n
/B
n
→G. Under this identiﬁcation
of Ker i
∗
n
with Hom(H
n
(C), G), the map H
n
(C; G)→Ker i
∗
n
in (iv) becomes the map
h considered earlier. Thus we can rewrite (iv) as a short exact sequence
(v) 0 →Coker i
∗
n−1
→H
n
(C; G)
h
→Hom(H
n
(C), G) →0
which splits.
Our objective now is to show that the more mysterious term Coker i
∗
n−1
de
pends only on H
n−1
(C) and G, in a natural, functorial way. First let us observe that
Section 3.1. Cohomology Groups 191
Coker i
∗
n−1
would be zero if it were always true that the dual of a short exact sequence
was exact, since the dual of the short exact sequence
(vi) 0 →B
n−1
i
n−1
→Z
n−1
→H
n−1
(C) →0
is the sequence
(vii) 0← B
∗
n−1
i
∗
n−1
← Z
∗
n−1
← H
n−1
(C)
∗
← 0
so if this were exact at B
∗
n−1
, i
∗
n−1
would be surjective, hence Coker i
∗
n−1
would be
zero. This argument does apply if H
n−1
(C) happens to be free, since (vi) splits in this
case, which implies that (vii) is also split exact. So in this case the map h in (v) is an
isomorphism. However, in the general case it is easy to produce examples of short
exact sequences whose duals are not exact, e.g., if we dualize 0 →Z
n
→Z →Z
n
→0
by applying Hom(−, Z) we get 0← Z
n
← Z← 0← 0 which fails to be exact at the
lefthand Z, precisely the place we are interested in for Coker i
∗
n−1
.
We might mention in passing that the loss of exactness at the left end of a short
exact sequence after dualization is in fact all that goes wrong, in view of the following:
Exercise. If A→B→C→0 is exact, then dualizing by applying Hom(−, G) yields an
exact sequence A
∗
←B
∗
←C
∗
←0.
However, we will not need this fact in what follows.
The exact sequence (vi) has the special feature that both B
n−1
and Z
n−1
are free,
so (vi) can be regarded as a free resolution of H
n−1
(C), where a free resolution of an
abelian group H is an exact sequence
··· →F
2
f2
→F
1
f1
→F
0
f0
→H →0
with each F
n
free. If we dualize this free resolution by applying Hom(−, G), we may
lose exactness, but at least we get a chain complex (or perhaps we should say ‘cochain
complex,’ but algebraically there is no difference):
···← F
∗
1
f
∗
1
← F
∗
0
f
∗
0
← H
∗
← 0
Let us use the temporary notation H
n
(F; G) for the homology group Ker f
∗
n+1
/ Imf
∗
n
of this dual complex. Note that the group Coker i
∗
n−1
which we are interested in
is H
1
(F; G) where F is the free resolution in (vi). Part (b) of the following lemma
therefore shows that Coker i
∗
n−1
depends only on H
n−1
(C) and G.
192 Chapter 3. Cohomology
Lemma 3.1.
(a) Given free resolutions F and F
¹
of abelian groups H and H
¹
, then every homo
morphism α: H→H
¹
can be extended to a chain map between these two free
resolutions:
−−−−−→
F
f
1
1
−−−−−→ −−−−−→
F
f
2
2
−−−−−→
F
−−−−−→
H 0
f
0
0
0
. . .
−−−−−→
F
f
1
1
−−−−−→ −−−−−→
F
f
2
2
−−−−−→
F
−−−−−→
H 0
f
0
0
. . .
¹
¹ ¹ ¹
¹ ¹ ¹
−
−
−
−
→
α
−
−
−
−
→
α
1
−
−
−
−
→
α
2
−
−
−
−
→
α
Furthermore, any two such chain maps extending α are chain homotopic.
(b) Given any two free resolutions F and F
¹
of H, there are canonical isomorphisms
H
n
(F; G) ≈ H
n
(F
¹
; G) for all n.
Proof: The α
i
’s will be constructed inductively. Since the F
i
’s are free, it sufﬁces to
deﬁne each α
i
on a basis for F
i
. To deﬁne α
0
, observe that surjectivity of f
¹
0
implies
that for each basis element x of F
0
there exists x
¹
∈ F
¹
0
such that f
¹
0
(x
¹
) = αf
0
(x),
so we deﬁne α
0
(x) = x
¹
. We would like to deﬁne α
1
in the same way, sending a basis
element x ∈ F
1
to an element x
¹
∈ F
¹
1
such that f
¹
1
(x
¹
) = α
0
f
1
(x). Such an x
¹
will
exist if α
0
f
1
(x) lies in Imf
¹
1
= Ker f
¹
0
, which it does since f
¹
0
α
0
f
1
= αf
0
f
1
= 0. The
same procedure deﬁnes all the subsequent α
i
’s.
If we have another chain map extending α given by maps α
¹
i
: F
i
→F
¹
i
, then the
differences β
i
= α
i
− α
¹
i
deﬁne a chain map extending the zero map β: H→H
¹
. It
will sufﬁce to construct maps λ
i
: F
i
→F
¹
i+1
deﬁning a chain homotopy from β
i
to 0,
i.e., with β
i
= f
¹
i+1
λ
i
+ λ
i−1
f
i
. The λ
i
’s are constructed inductively by a procedure
much like the construction of the α
i
’s. When i = 0 we let λ
−1
: H→F
¹
0
be zero,
and then the desired relation becomes β
0
= f
¹
1
λ
0
. We can achieve this by letting
λ
0
send a basis element x to an element x
¹
∈ F
¹
1
such that f
¹
1
(x
¹
) = β
0
(x). Such
an x
¹
exists since Imf
¹
1
= Ker f
¹
0
and f
¹
0
β
0
(x) = βf
0
(x) = 0. For the inductive
step we wish to deﬁne λ
i
to take a basis element x ∈ F
i
to an element x
¹
∈ F
¹
i+1
such that f
¹
i+1
(x
¹
) = β
i
(x) − λ
i−1
f
i
(x). This will be possible if β
i
(x) − λ
i−1
f
i
(x)
lies in Imf
¹
i+1
= Ker f
¹
i
, which will hold if f
¹
i
(β
i
− λ
i−1
f
i
) = 0. Using the relation
f
¹
i
β
i
= β
i−1
f
i
and the relation β
i−1
= f
¹
i
λ
i−1
+λ
i−2
f
i−1
which holds by induction, we
have
f
¹
i
(β
i
−λ
i−1
f
i
) = f
¹
i
β
i
−f
¹
i
λ
i−1
f
i
= β
i−1
f
i
−f
¹
i
λ
i−1
f
i
= (β
i−1
−f
¹
i
λ
i−1
)f
i
= λ
i−2
f
i−1
f
i
= 0
as desired. This ﬁnishes the proof of (a).
The maps α
n
constructed in (a) dualize to maps α
∗
n
: F
¹∗
n
→F
∗
n
forming a chain
map between the dual complexes F
¹∗
and F
∗
. Therefore we have induced homomor
phisms on cohomology α
∗
: H
n
(F
¹
; G)→H
n
(F; G). These do not depend on the choice
of α
n
’s since any other choices α
¹
n
are chain homotopic, say via chain homotopies
λ
n
, and then α
∗
n
and α
¹∗
n
are chain homotopic via the dual maps λ
∗
n
since the dual
of the relation α
i
−α
¹
i
= f
¹
i+1
λ
i
+λ
i−1
f
i
is α
∗
i
−α
¹∗
i
= λ
∗
i
f
¹∗
i+1
+f
∗
i
λ
∗
i−1
.
Section 3.1. Cohomology Groups 193
The induced homomorphisms α
∗
: H
n
(F
¹
; G)→H
n
(F; G) satisfy (βα)
∗
= α
∗
β
∗
for a composition H
α
→H
¹
β
→H
¹¹
with a free resolution F
¹¹
of H
¹¹
also given, since
one can choose the compositions β
n
α
n
of extensions α
n
of α and β
n
of β as an
extension of βα. In particular, if we take α to be an isomorphism and β to be its
inverse, with F
¹¹
= F , then α
∗
β
∗
= (βα)
∗
= 11, the latter equality coming from the
obvious extension of 11: H→H by the identity map of F . The same reasoning shows
β
∗
α
∗
= 11, so α
∗
is an isomorphism. Finally, if we specialize further, taking α to
be the identity but with two different free resolutions F and F
¹
, we get a canonical
isomorphism 11
∗
: H
n
(F
¹
; G)→H
n
(F; G). L¦
Every abelian group H has a free resolution of the form 0→F
1
→F
0
→H→0,
with F
i
= 0 for i > 1. Namely, choose a set of generators for H and let F
0
be a free
abelian group with basis in onetoone correspondence with these generators, and
then we have a surjective homomorphism f
0
: F
0
→H sending the basis elements to
the chosen generators. The kernel of f
0
is free, being a subgroup of a free abelian
group, so we can let F
1
be this kernel with f
1
: F
1
→F
0
the inclusion, and we can then
take F
i
= 0 for i > 1. For this free resolution we obviously have H
n
(F; G) = 0 for
n > 1, so this must also be true for all free resolutions. Thus the only interesting group
H
n
(F; G) is H
1
(F; G). As we have seen, this group depends only on H and G, and the
standard notation for it is Ext(H, G). This notation arises fromthe fact that Ext(H, G)
has an interpretation as the set of isomorphism classes of extensions of G by H, i.e.,
short exact sequences 0→G→J→H→0, with a natural deﬁnition of isomorphism
between such exact sequences. This is explained in books on homological algebra, for
example [K.Brown], [HiltonStammbach], or [MacLane 63]. However, this interpretation
of Ext(H, G) is rarely needed in algebraic topology.
Summarizing, we have established the following algebraic result:
Theorem 3.2. If a chain complex C of free abelian groups has homology groups
H
n
(C), then the cohomology groups H
n
(C; G) of the cochain complex Hom(C
n
, G)
are determined by split exact sequences
0 →Ext(H
n−1
(C), G) →H
n
(C; G)
h
→Hom(H
n
(C), G) →0
L¦
This is known as the universal coefﬁcient theorem for cohomology because
it is formally analogous to the universal coefﬁcient theorem for homology in §3.A
which expresses homology with arbitrary coefﬁcients in terms of homology with Z
coefﬁcients.
Computing Ext(H, G) for ﬁnitely generated H is not difﬁcult using the following
three properties:
Ext(H⊕H
¹
, G) ≈ Ext(H, G) ⊕ Ext(H
¹
, G)
Ext(H, G) = 0 if H is free.
Ext(Z
n
, G) ≈ G/nG
194 Chapter 3. Cohomology
The ﬁrst of these comes from using the direct sum of free resolutions of H and H
¹
as a free resolution for H⊕H
¹
. If H is free, the free resolution 0→H→H→0 yields
the second property, while the third comes from dualizing the free resolution
0 →Z
n
→Z →Z
n
→0
to produce an exact sequence
Z
− − − − − − → − − − − − − → − − − − − − →
− − − − − − − →
0 0
=
=
=
=
=
=
( )
n
n
n
n , Ext G Z
− − − − − − →
( ) , Hom G Z
− − − − − − →
( ) , Hom G Z ( ) , Hom G
G/nG G
− − − − − − − − →
G
In particular, these three properties imply that Ext(H, Z) is isomorphic to the torsion
subgroup of H if H is ﬁnitely generated. Since Hom(H, Z) is isomorphic to the free
part of H if H is ﬁnitely generated, we have:
Corollary 3.3. If the homology groups H
n
and H
n−1
of a chain complex C of free
abelian groups are ﬁnitely generated, with torsion subgroups T
n
⊂ H
n
and T
n−1
⊂
H
n−1
, then H
n
(C; Z) ≈ (H
n
/T
n
)⊕T
n−1
. L¦
It is useful in many situations to know that the short exact sequences in the
universal coefﬁcient theoremare natural, i.e., a chain map α between chain complexes
C and C
¹
of free abelian groups induces a commutative diagram
−−−−−−→ −−−−−−→ −−−−−−→
−
−
−
−
−
−
→
−
−
−
−
−
−
→
−
−
−
−
−
−
→
0 0 (
h
, Ext
C H
n 1
( ) G)
−−−−−−→
(
,
Hom C H
n
( ) G) ; C H
n
( G)
−−−−−−→ −−−−−−→ −−−−−−→ 0 0 (
h
, Ext
C H
n 1
( ) G) )
−−−−−−→
(
,
Hom C H
n
( ) G) ; C H
n
(
(
G
)
¹ ¹ ¹
∗
α
∗
∗
α ( )
∗
∗
α
This is apparent if one just thinks about the construction; one obviously obtains a map
between the short exact sequences (iv) containing Ker i
∗
n
and Coker i
∗
n−1
, the identi
ﬁcation Ker i
∗
n
= Hom(H
n
(C), G) is certainly natural, and the proof of Lemma 3.1
shows that Ext(H, G) depends naturally on H.
However, the splitting in the universal coefﬁcient theorem is not natural since
it depends on the choice of the projections p: C
n
→Z
n
. An exercise at the end of
the section gives a topological example showing that the splitting in fact cannot be
natural.
The naturality property together with the ﬁvelemma proves:
Corollary 3.4. If a chain map between chain complexes of free abelian groups in
duces an isomorphism on homology groups, then it induces an isomorphism on co
homology groups with any coefﬁcient group G. L¦
One could attempt to generalize the algebraic machinery of the universal coefﬁ
cient theorem by replacing abelian groups by modules over a chosen ring R and Hom
by Hom
R
, the R module homomorphisms. The key fact about abelian groups that
was needed was that subgroups of free abelian groups are free. Submodules of free
Section 3.1. Cohomology Groups 195
R modules are free if R is a principal ideal domain, so in this case the generalization
is automatic. One obtains natural split short exact sequences
0 →Ext
R
(H
n−1
(C), G) →H
n
(C; G)
h
→Hom
R
(H
n
(C), G) →0
where C is a chain complex of free R modules with boundary maps R module ho
momorphisms, and the coefﬁcient group G is also an R module. If R is a ﬁeld, for
example, then R modules are always free and so the Ext
R
term is always zero since
we may choose free resolutions of the form 0→F
0
→H→0.
It is interesting to note that the proof of Lemma 3.1 on the uniqueness of free res
olutions is valid for modules over an arbitrary ring R. It is easy to see moveover that
every R module H has a free resolution, constructed in the following way. Choose a
set of generators for H as an R module, and let F
0
be a free R modlue with basis in
onetoone correspondence with these generators. Thus we have a surjective homo
morphism f
0
: F
0
→H sending the basis elements to the chosen generators. Now re
peat the process with Ker f
0
in place of H, constructing a homomorphism f
1
: F
1
→F
0
sending a basis for a free R module F
1
onto generators for Ker f
0
. And similarly for
Ker f
1
, etc.
By Lemma 3.1 the groups H
n
(F; G) depend only on H and G, not the free res
olution F . The standard notation for H
n
(F; G) is Ext
n
R
(H, G). For sufﬁciently com
plicated rings R the groups Ext
n
R
(H, G) can be nonzero for n > 1. In certain more
advanced topics in algebraic topology these Ext
n
R
groups play an essential role.
(A parenthetical remark about the deﬁnition of Ext
n
R
(H, G): By the Exercise stated
earlier, exactness of F
1
→F
0
→H→0 implies exactness of F
∗
1
←F
∗
0
←H
∗
←0. This
means that H
0
(F; G) as deﬁned above is zero. Rather than having Ext
0
R
(H, G) be
automatically zero, it is better to deﬁne H
n
(F; G) as the n
th
homology group of
the complex ···←F
∗
1
←F
∗
0
←0 with the term H
∗
omitted. This can be viewed as
deﬁning the groups H
n
(F; G) to be unreduced cohomology groups. With this modiﬁed
deﬁnition we have Ext
0
R
(H, G) = H
0
(F; G) = H
∗
= Hom
R
(H, G) by the exactness
of F
∗
1
←F
∗
0
←H
∗
←0. The real reason why unreduced Ext groups are better than
reduced groups is perhaps to be found in certain exact sequences involving Ext and
Hom derived in §3.G, which would not work with the Hom terms replaced by zeros.)
Cohomology of Spaces
Now we return to topology. Given a space X and an abelian group G, we deﬁne
the group C
n
(X; G) of singular n cochains with coefﬁcients in Gto be the dual group
Hom(C
n
(X), G) of the singular chain group C
n
(X). Thus an ncochain ϕ ∈ C
n
(X; G)
assigns to each singular n simplex σ : ∆
n
→X a value ϕ(σ) ∈ G. Since the singular
n simplices form a basis for C
n
(X), these values can be chosen arbitrarily, hence
n cochains are exactly equivalent to functions from singular n simplices to G.
The coboundary map δ: C
n
(X; G)→C
n+1
(X; G) is the dual ∂
∗
, so for a cochain
ϕ ∈ C
n
(X; G), its coboundary δϕ is the composition C
n+1
(X)
∂
→C
n
(X)
ϕ
→G. This
196 Chapter 3. Cohomology
means that for a singular (n+1) simplex σ : ∆
n+1
→X we have
δϕ(σ) =
¸
i
(−1)
i
ϕ(σ ¦
¦[v
0
, ··· , v
i
, ··· , v
n+1
])
It is automatic that δ
2
= 0 since δ
2
is the dual of ∂
2
= 0. Therefore we can deﬁne the
cohomology group H
n
(X; G) with coefﬁcients in G to be the quotient Ker δ/ Imδ at
C
n
(X; G) in the cochain complex
···← C
n+1
(X; G)
δ
← C
n
(X; G)
δ
← C
n−1
(X; G)← ···← C
0
(X; G)← 0
Elements of Ker δ are cocycles, and elements of Imδ are coboundaries. For a cochain
ϕ to be a cocycle means that δϕ = ϕ∂ = 0, i.e., ϕ vanishes on boundaries.
Since the chain groups C
n
(X) are free, the algebraic universal coefﬁcient theorem
takes on the topological guise of split short exact sequences
0 →Ext(H
n−1
(X), G) →H
n
(X; G) →Hom(H
n
(X), G) →0
which describe how cohomology groups with arbitrary coefﬁcients are determined
purely algebraically by homology groups with Z coefﬁcients. For example, if the ho
mology groups of X are ﬁnitely generated then Corollary 3.3 tells how to compute
the cohomology groups H
n
(X; Z) from the homology groups.
When n = 0 there is no Ext term, and the universal coefﬁcient theorem reduces
to an isomorphism H
0
(X; G) ≈ Hom(H
1
(X), G). This can also be seen directly from
the deﬁnitions. Since singular 0 simplices are just points of X, a cochain in C
0
(X; G)
is an arbitrary function ϕ: X→G, not necessarily continuous. For this to be a cocycle
means that for each singular 1 simplex σ : [v
0
, v
1
]→X we have δϕ(σ) = ϕ(∂σ) =
σ(v
1
)−σ(v
0
) = 0 , i.e., ϕ is constant on pathcomponents of X. Thus H
0
(X; G) is all
the functions from pathcomponents of X to G. This is the same as Hom(H
0
(X), G).
In the case of H
1
(X; G) the universal coefﬁcient theorem also gives an isomor
phism H
1
(X; G) ≈ Hom(H
1
(X), G) since Ext(H
0
(X), G) = 0 because H
0
(X) is free.
If X is pathconnected, H
1
(X) is the abelianization of π
1
(X), and we can identify
Hom(H
1
(X), G) with Hom(π
1
(X), G) since G is abelian.
The universal coefﬁcient theorem has a simpler form if we take coefﬁcients in
a ﬁeld F for both homology and cohomology. In §2.2 we deﬁned the homology
groups H
n
(X; F) as the homology groups of the chain complex of free F modules
C
n
(X; F), where C
n
(X; F) has basis the singular n simplices in X. The dual com
plex Hom
F
(C
n
(X; F), F) of F module homomorphisms is the same as Hom(C
n
(X), F)
since both can be identiﬁed with the functions from singular n simplices to F . Hence
the homology groups of the dual complex Hom
F
(C
n
(X; F), F) are the cohomology
groups H
n
(X; F). In the generalization of the universal coefﬁcient theorem to the
case of modules over a principal ideal domain, the Ext
F
terms vanish since F is a
ﬁeld, so we obtain isomorphisms
H
n
(X; F) ≈ Hom
F
(H
n
(X; F), F)
Section 3.1. Cohomology Groups 197
Thus, with ﬁeld coefﬁcients, cohomology is the exact dual of homology. Note that
when F = Z
p
or Q we have Hom
F
(H, G) = Hom(H, G), the group homomorphisms,
for arbitrary F modules G and H.
For the remainder of this section we will go through the main features of singular
homology and check that they extend without much difﬁculty to cohomology.
(1) Reduced Groups. Reduced cohomology groups
`
H
n
(X; G) can be deﬁned by dual
izing the augmented chain complex ··· →C
0
(X)
ε
→Z→0, then taking Ker / Im. As
with homology, this gives
`
H
n
(X; G) = H
n
(X; G) for n > 0, and the universal coefﬁ
cient theorem identiﬁes
`
H
0
(X; G) with Hom(
`
H
0
(X), G). We can describe the differ
ence between
`
H
0
(X; G) and H
0
(X; G) more explicitly by using the interpretation of
H
0
(X; G) as functions X→G which are constant on pathcomponents. Recall that the
augmentation map ε : C
0
(X)→Z sends each singular 0 simplex σ to 1, so the dual
map ε
∗
sends a homomorphism ϕ: Z→G to the composition C
0
(X)
ε
→Z
ϕ
→G,
which is the function σ
ϕ(1). This is a constant function X→G, and since ϕ(1)
can be any element of G, the image of ε
∗
consists of precisely the constant func
tions. Thus
`
H
0
(X; G) is all functions X→G which are constant on pathcomponents,
modulo the functions which are constant on all of X.
(2) Relative Groups and the Long Exact Sequence of a Pair. To deﬁne relative groups
H
n
(X, A; G) for a pair (X, A) we ﬁrst dualize the short exact sequence
0 →C
n
(A)
i
→C
n
(X)
j
→C
n
(X, A) →0
by applying Hom(−, G) to get
0← C
n
(A; G)
i
∗
← C
n
(X; G)
j
∗
← C
n
(X, A; G)← 0
where by deﬁnition C
n
(X, A; G) = Hom(C
n
(X, A), G). This sequence is exact by the
following direct argument. The map i
∗
restricts a cochain on X to a cochain on A.
Thus for a function from singular n simplices in X to G, the image of this function
under i
∗
is obtained by restricting the domain of the function to singular n simplices
in A. Every function from singular n simplices in A to G can be extended to be
deﬁned on all singular n simplices in X, for example by assigning the value 0 to
all singular n simplices not in A, so i
∗
is surjective. The kernel of i
∗
consists of
cochains taking the value 0 on singular n simplices in A. Such cochains are the
same as homomorphisms C
n
(X, A) = C
n
(X)/C
n
(A)→G, so the kernel of i
∗
is exactly
C
n
(X, A; G) = Hom(C
n
(X, A), G), giving the desired exactness. Notice that we can
view C
n
(X, A; G) as the functions from singular n simplices in X to G which vanish
on simplices in A, since the basis for C
n
(X) consisting of singular nsimplices in X
is the disjoint union of the simplices with image contained in A and the simplices
with image not contained in A.
Relative coboundary maps δ: C
n
(X, A; G)→C
n+1
(X, A; G) are obtained as restric
tions of the absolute δ’s, so relative cohomology groups H
n
(X, A; G) are deﬁned. The
198 Chapter 3. Cohomology
fact that the relative cochain group is a subgroup of the absolute cochains, namely the
cochains which vanish on chains in A, means that relative cohomology is conceptually
a little simpler than relative homology.
The maps i
∗
and j
∗
commute with δ since i and j commute with ∂, so the
preceding displayed short exact sequence of cochain groups is part of a short exact
sequence of cochain complexes, giving rise to an associated long exact sequence of
cohomology groups
··· →H
n
(X, A; G)
j
∗
→H
n
(X; G)
i
∗
→H
n
(A; G)
δ
→H
n+1
(X, A; G) →···
By similar reasoning one obtains a long exact sequence of reduced cohomology groups
for a pair (X, A) with A nonempty, where
`
H
n
(X, A; G) = H
n
(X, A; G) for all n, as in
homology. Taking A to be a point x
0
, this exact sequence gives an identiﬁcation of
`
H
n
(X; G) with H
n
(X, x
0
; G).
More generally there is a long exact sequence for a triple (X, A, B) coming from
the short exact sequences
0← C
n
(A, B; G)
i
∗
← C
n
(X, B; G)
j
∗
← C
n
(X, A; G)← 0
The long exact sequence of reduced cohomology can be regarded as the special case
that B is a point.
The connecting homomorphism δ: H
n
(A; G)→H
n+1
(X, A; G) and its homology
analog ∂ : H
n+1
(X, A)→H
n
(A) are deﬁned via the following diagrams:
G) ;
X G C ( ) ;
n
A G C ( ) ;
n
X C (
n 1 +
G) ; X A C ( ,
n 1 +
− − − − →
− − − − →
−
−
−
−
−
→
G) ;
X G C ( ) ; A G C ( ) ; n n
−
−
−
−
−
−
−
→
−
−
−
−
−
−
−
→
X C (
n 1 + n 1 +
G) ; X A C ( , −−−−→
−−−−→
−
−
−
−
−
→
The connecting homomorphisms are represented by the dashed arrows, which are
welldeﬁned only when the chain and cochain groups are replaced by homology and
cohomology groups. Since the lefthand diagram is the dual of the righthand one,
apart from the dashed arrows, one would expect that the dashed arrows also have a
close dual relationship, via a commutative square
A G H ( ) ; G) ;
n
−−−−−−−−−→ X A H ( ,
n 1 +
Hom( Hom( A G H ( ) ), G) ),
n
−−−−−→
X A H ( ,
n 1 +
δ
∗
∂
−
−
−
−
−
→
h
−
−
−
−
−
→
h
To verify commutativity, represent an element α ∈ H
n
(A; G) by a cocycle ϕ ∈
C
n
(A; G). To apply the horizontal map δ in the square, we ﬁrst extend ϕ to a cochain
ϕ ∈ C
n
(X; G), say by letting it take the value 0 on singular simplices not in A. Then
we compose ϕ with ∂ : C
n+1
(X)→C
n
(X) to get a cochain ϕ∂ ∈ C
n+1
(X; G) which
actually lies in C
n+1
(X, A; G) since the original ϕ was a cocycle in A. This cochain
ϕ∂ ∈ C
n+1
(X, A; G) represents δα in H
n+1
(X, A; G). Nowwe apply the map h, which
Section 3.1. Cohomology Groups 199
simply restricts the domain of ϕ∂ to relative cycles in C
n+1
(X, A), i.e., (n+1) chains
in X whose boundary lies in A. On such chains we have ϕ∂ = ϕ∂ since the extension
of ϕ to ϕ is irrelevant. The net result of all this is that hδ(α) is represented by ϕ∂.
Let us compare this with ∂
∗
h(α). Applying h to ϕ restricts its domain to cycles in
A. Then applying ∂
∗
composes with the map which sends a relative (n+1) cycle in
X to its boundary in A. Thus ∂
∗
h(α) is represented by ϕ∂ just as hδ(α) was, and
so the square commutes.
(3) Induced Homomorphisms. Dual to the chain maps f
: C
n
(X)→C
n
(Y) induced
by f : X→Y are the cochain maps f
: C
n
(Y; G)→C
n
(X; G). The relation f
∂ = ∂f
dualizes to δf
= f
δ, so f
induces homomorphisms f
∗
: H
n
(Y; G)→H
n
(X; G).
In the relative case a map f : (X, A)→(Y, B) induces f
∗
: H
n
(Y, B; G)→H
n
(X, A; G)
by the same reasoning, and in fact f induces a map between short exact sequences of
cochain complexes, hence a map between long exact sequences of cohomology groups,
with commuting squares. The properties (fg)
= g
f
and 11
= 11 imply (fg)
∗
=
g
∗
f
∗
and 11
∗
= 11, so X
H
n
(X; G) and (X, A)
H
n
(X, A; G) are contravariant
functors, the ‘contra’ indicating that induced maps go in the reverse direction.
The algebraic universal coefﬁcient theorem applies also to relative cohomology
since the relative chain groups C
n
(X, A) are free, and there is a naturality statement:
A map f : (X, A)→(Y, B) induces a commutative diagram
−−−−−−→ −−−−−−→ −−−−−−→
−
−
−
−
−
−
→
−
−
−
−
−
−
→
−
−
−
−
−
−
→
0 0 (
h
f f
, , Ext
X A , X A , X A H
n 1
( ) G)
−−−−−−→
(
,
Hom H
n
( ) G) ; H
n
( G)
−−−−−−→ −−−−−−→ −−−−−−→ 0 0 (
h
, , Ext
Y B , Y B , Y B H
n 1
( ) G) )
−−−−−−→
(
,
Hom H
n
( )
G) ; H
n
(
(
G
)
∗
∗
∗
f ( )
∗
∗
This follows from the naturality of the algebraic universal coefﬁcient sequences since
the vertical maps are induced by the chain maps f
: C
n
(X, A)→C
n
(Y, B). When the
subspaces A and B are empty we obtain the absolute forms of these results.
(4) Homotopy Invariance. The statement is that if f = g : (X, A)→(Y, B), then
f
∗
= g
∗
: H
n
(Y, B)→H
n
(X, A). This is proved by direct dualization of the proof
for homology. From the proof of Theorem 2.10 we have a chain homotopy P satis
fying g
− f
= ∂P + P∂. This relation dualizes to g
− f
= P
∗
δ + δP
∗
, so P
∗
is a
chain homotopy between the maps f
, g
: C
n
(Y; G)→C
n
(X; G). This restricts also
to a chain homotopy between f
and g
on relative cochains, the cochains which
are zero on singular simplices in the subspaces B and A. Since f
and g
are chain
homotopic, they induce the same homomorphism f
∗
= g
∗
on cohomology.
(5) Excision. For cohomology this says that for subspaces Z ⊂ A ⊂ X with the closure
of Z contained in the interior of A, the inclusion i : (X −Z, A−Z)
(X, A) induces
isomorphisms i
∗
: H
n
(X, A; G)→H
n
(X − Z, A − Z; G) for all n. This follows from
the corresponding result for homology by the naturality of the universal coefﬁcient
theorem and the ﬁvelemma. Alternatively, if one wishes to avoid appealing to the
200 Chapter 3. Cohomology
universal coefﬁcient theorem, the proof of excision for homology dualizes easily to
cohomology by the following argument. In the proof for homology there were chain
maps ρ : C
n
(X)→C
n
(A + B) and ι : C
n
(A + B)→C
n
(X) such that ρι = 11 and 11 −
ιρ = ∂D + D∂ for a chain homotopy D. Dualizing by taking Hom(−, G), we have
maps ρ
∗
and ι
∗
between C
n
(A + B; G) and C
n
(X; G) which induce isomorphisms
on cohomology since ι
∗
ρ
∗
= 11 and 11 − ρ
∗
ι
∗
= D
∗
δ + δD
∗
. By the ﬁvelemma,
the maps C
n
(X, A; G)→C
n
(A + B, A; G) also induce isomorphisms on cohomology.
Since there is an obvious identiﬁcation of C
n
(A + B, A; G) with C
n
(B, A ∩ B; G), we
get isomorphisms H
n
(X, A) ≈ H
n
(B, A∩B; G) induced by the inclusion (B, A∩B)
(X, A).
(6) Axioms for Cohomology. These are exactly dual to the axioms for homology.
Restricting attention to CW complexes again, a (reduced) cohomology theory is a
sequence of contravariant functors
`
h
n
from CW complexes to abelian groups, to
gether with natural coboundary homomorphisms δ:
`
h
n
(A)→
`
h
n+1
(X/A) for CWpairs
(X, A), satisfying the following axioms:
(1) If f = g : X→Y , then f
∗
= g
∗
:
`
h
n
(Y)→
`
h
n
(X).
(2) For each CW pair (X, A) there is a long exact sequence
···
δ
→
`
h
n
(X/A)
q
∗
→
`
h
n
(X)
i
∗
→
`
h
n
(A)
δ
→
`
h
n+1
(X/A)
q
∗
→···
where i is the inclusion and q is the quotient map.
(3) For a wedge sum X =
α
X
α
with inclusions i
α
: X
α
X, the product map
¸
α
i
∗
α
:
`
h
n
(X)→
¸
α
`
h
n
(X
α
) is an isomorphism for each n.
We have already seen that the ﬁrst axiom holds for singular cohomology. The sec
ond axiom follows from excision in the same way as for homology, via isomorphisms
`
H
n
(X/A; G) ≈ H
n
(X, A; G). Note that the third axiom involves direct product, rather
than the direct sum which appeared in the homology version. This is because of
the natural isomorphism Hom(
¸
α
A
α
, G) ≈
¸
α
Hom(A
α
, G), which implies that the
cochain complex of a disjoint union
¸
α
X
α
is the direct product of the cochain com
plexes of the individual X
α
’s, and this direct product splitting passes through to co
homology groups. The same argument applies in the relative case, so we get isomor
phisms H
n
(
¸
α
X
α
,
¸
α
A
α
; G) ≈
¸
α
H
n
(X
α
, A
α
; G). The third axiomis obtained by tak
ing the A
α
’s to be basepoints x
α
and passing to the quotient
¸
α
X
α
/
¸
α
x
α
=
α
X
α
.
The relation between reduced and unreduced cohomology theories is the same as
for homology, as described in §2.3.
(7) Simplicial Cohomology. If X is a ∆ complex and A ⊂ X is a subcomplex, then the
simplicial chain groups ∆
n
(X, A) dualize to simplicial cochain groups ∆
n
(X, A; G) =
Hom(∆
n
(X, A), G), and the resulting cohomology groups are by deﬁnition the sim
plicial cohomology groups H
n
∆
(X, A; G). Since the inclusions ∆
n
(X, A) ⊂ C
n
(X, A)
induce isomorphisms H
∆
n
(X, A) ≈ H
n
(X, A), Corollary 3.4 implies that the dual maps
C
n
(X, A; G)→∆
n
(X, A; G) also induce isomorphisms H
n
(X, A; G) ≈ H
n
∆
(X, A; G).
Section 3.1. Cohomology Groups 201
(8) Cellular Cohomology. For a CW complex X this is deﬁned via the cellular cochain
complex formed by the horizontal sequence in the following diagram, where coefﬁ
cients in a given group G are understood, and the cellular coboundary maps d
n
are
the compositions δ
n
j
n
, making the triangles commute. Note that d
n
d
n−1
= 0 since
j
n
δ
n−1
= 0.
X X H ( ) ,
n 1 + n 1 n +
n 1 +
−−−−−→
X X H ( ) ,
n n
n n 1 n 1 n 1 n 1 n 2 n n
X H ( )
n n
X H ( )
n
X H ( )
n
−−−−−→
−
−
−
−
−
→
−
−
−
−
−
→
−
−
−
−
−
→
−
−
−
−
−
→
−
−
−
−
−
→
−
−
−
−
−
→
−
−
−
−
−
→
−
−
−
−
−
→
X X H ( ) ,
n 1
n 1
n 1 n 1
X H ( )
−−−−−→
. . .
−−−−−→
. . .
≈
0
0
0
j
j
d d
δ
δ
Theorem 3.5. H
n
(X; G) ≈ Ker d
n
/ Imd
n−1
. Furthermore, the cellular cochain com
plex ¦H
n
(X
n
, X
n−1
; G), d
n
¦ is isomorphic to the dual of the cellular chain complex,
obtained by applying Hom(−, G).
Proof: The universal coefﬁcient theorem implies that H
k
(X
n
, X
n−1
; G) = 0 for k ≠ n.
The long exact sequence of the pair (X
n
, X
n−1
) then gives isomorphisms H
k
(X
n
; G) ≈
H
k
(X
n−1
; G) for k ≠ n, n−1. Hence by induction on n we obtain H
k
(X
n
; G) = 0 if
k > n. Thus the diagonal sequences in the preceding diagramare exact. The universal
coefﬁcient theorem also gives H
k
(X, X
n+1
; G) = 0 for k ≤ n + 1, so H
n
(X; G) ≈
H
n
(X
n+1
; G). The diagram then yields isomorphisms
H
n
(X; G) ≈ H
n
(X
n+1
; G) ≈ Ker δ
n
≈ Ker d
n
/ Imδ
n−1
≈ Ker d
n
/ Imd
n−1
For the second statement in the theorem we have the diagram
X X G H ( ) ; ,
k 1 k k
−−−−−−−−−→
X G H ( ) ; G) ;
k k
−−−−−−−−−→ X X H ( ,
k 1 k + k 1 +
X X G H Hom ( ( Hom( Hom( ) ), ,
k 1
k
k
−−−−−→
X G H ( ) ), G) ),
k
k
−−−−−→
X X H ( ,
k 1 k +
k 1 +
δ
∗
∂
−−−−−→
h
−−−−−→
h
−−−−−→
h
The cellular coboundary map is the composition across the top, and we want to see this
is the same as the composition across the bottom. The ﬁrst and third vertical maps are
isomorphisms by the universal coefﬁcient theorem, so it sufﬁces to show the diagram
commutes. The ﬁrst square commutes by naturality of h, and commutativity of the
second square was shown in the discussion of the long exact sequence of cohomology
groups of a pair (X, A). L¦
(9) MayerVietoris Sequences. In the absolute case these take the form
··· →H
n
(X; G)
Ψ
→H
n
(A; G) ⊕ H
n
(B; G)
Φ
→H
n
(A∩B; G) →H
n+1
(X; G) →···
202 Chapter 3. Cohomology
where X is the union of the interiors of A and B. This is the long exact sequence
associated to the short exact sequence of cochain complexes
0 →C
n
(A+B, G)
ψ
→C
n
(A; G) ⊕ C
n
(B; G)
ϕ
→C
n
(A∩B; G) →0
Here C
n
(A + B; G) is the dual of the subgroup C
n
(A + B) ⊂ C
n
(X) consisting of
sums of singular n simplices lying in A or in B. The inclusion C
n
(A + B) ⊂ C
n
(X)
is a chain homotopy equivalence by Proposition 2.21, so the dual restriction map
C
n
(X; G)→C
n
(A + B; G) is also a chain homotopy equivalence, hence induces an
isomorphism on cohomology as shown in (5) above. The map ψ has coordinates the
two restrictions to A and B, and ϕ takes the difference of the restrictions to A∩B,
so it is obvious that ϕ is onto with kernel the image of ψ.
There is a relative MayerVietoris sequence
··· →H
n
(X, Y; G) →H
n
(A, C; G) ⊕ H
n
(B, D; G) →H
n
(A∩B, C ∩D; G) →···
for a pair (X, Y) = (A∪B, C ∪D) with C ⊂ A and D ⊂ B such that X is the union of
the interiors of A and B while Y is the union of the interiors of C and D. To derive
this, consider ﬁrst the map of short exact sequences of cochain complexes:
A B G C ( ) ;
n
+ C D + , A B G C ( ) ;
n
+
−−−−→
C D G 0 C ( ) ;
n
+
−−−−→ −−−−→ −−−−→
0
X G C ( ) ;
n
Y , X G C ( ) ;
n
−−−−−−−−−−→
Y G 0 C ( ) ;
n
−−−−→ −−−−→ −−−−→
0
−−−→
−−−→
−−−→
Here C
n
(A+B, C+D; G) is deﬁned as the kernel of the restriction map C
n
(A+B; G) →
C
n
(C +D; G), so the second sequence is exact. The vertical maps are restriction. The
second and third of these induce isomorphisms on cohomology, as we have seen, so
by the ﬁvelemma the ﬁrst vertical map also induces isomorphisms on cohomology.
The relative MayerVietoris sequence is then the long exact sequence associated to the
short exact sequence of cochain complexes
0 →C
n
(A+B, C +D; G)
ψ
→C
n
(A, C; G) ⊕ C
n
(B, D; G)
ϕ
→C
n
(A∩B, C ∩D; G) →0
This is exact since it is the dual of the short exact sequence
0 →C
n
(A∩B, C ∩D) →C
n
(A, C) ⊕ C
n
(B, D) →C
n
(A+B, C +D) →0
constructed in §2.2, which splits since C
n
(A+B, C +D) is free with basis the singular
n simplices in A or in B which do not lie in C or in D.
Exercises
1. Show that Ext(H, G) is a contravariant functor of H for ﬁxed G, and a covariant
functor of G for ﬁxed H.
2. Show that the maps G
n
→G and H
n
→H which multiply each element by the
integer n also induce multiplication by n in Ext(H, G).
Section 3.1. Cohomology Groups 203
3. Regarding Z
2
as a module over the ring Z
4
, construct a resolution of Z
2
by free
modules over Z
4
and use this to show that Ext
n
Z4
(Z
2
, Z
2
) is nonzero for all n.
4. What happens if one deﬁnes homology groups h
n
(X; G) as the homology groups
of the chain complex ··· →Hom(G, C
n
(X))→Hom(G, C
n−1
(X))→···? More specif
ically, what are the groups h
n
(X; G) when G = Z, Z
m
, and Q?
5. Regarding a cochain ϕ ∈ C
1
(X; G) as a function from paths in X to G, show that
if ϕ is a cocycle, then
(a) ϕ(f g) = ϕ(f) +ϕ(g).
(b) ϕ takes the value 0 on constant paths.
(c) ϕ(f) = ϕ(g) if f = g.
(d) ϕ is a coboundary iff ϕ(f) depends only on the endpoints of f , for all f .
[In particular, (a) and (c) give a map H
1
(X; G)→Hom(π
1
(X), G), which the universal
coefﬁcient theorem says is an isomorphism if X is pathconnected.]
6. (a) Directly from the deﬁnitions, compute the simplicial cohomology groups of
S
1
×S
1
with Z and Z
2
coefﬁcients, using the ∆ complex structure given in §2.1.
(b) Do the same for RP
2
and the Klein bottle.
7. Showthat the functors h
n
(X) = Hom(H
n
(X), Z) do not deﬁne a cohomology theory
on the category of CW complexes.
8. Many basic homology arguments work just as well for cohomology even though
maps go in the opposite direction. Verify this in the following cases:
(a) Compute H
i
(S
n
; G) by induction on n in two ways: using the long exact sequence
of a pair, and using the MayerVietoris sequence.
(b) Show that if A is a closed subspace of X which is a deformation retract of some
neighborhood, then the quotient map X→X/A induces isomorphisms H
n
(X, A; G) ≈
`
H
n
(X/A; G) for all n.
(c) Show that if A is a retract of X then H
n
(X; G) ≈ H
n
(A; G)⊕H
n
(X, A; G).
9. Show that if f : S
n
→S
n
has degree d then f
∗
: H
n
(S
n
; G)→H
n
(S
n
; G) is multipli
cation by d.
10. For the lens space L
m
(
1
, ··· ,
n
) deﬁned in Example 2.43, compute the cohomol
ogy groups using the cellular cochain complex and taking coefﬁcients in Z, Q, Z
m
,
and Z
p
for p prime. Verify that the answers agree with those given by the universal
coefﬁcient theorem.
11. Let X be a Moore space M(Z
m
, n) obtained from S
n
by attaching a cell e
n+1
by
a map of degree m.
(a) Show that the quotient map X→X/S
n
= S
n+1
induces the trivial map on
`
H
i
(−; Z)
for all i, but not on H
n+1
(−; Z). Deduce that the splitting in the universal coefﬁcient
theorem for cohomology cannot be natural.
(b) Show that the inclusion S
n
X induces the trivial map on
`
H
i
(−; Z) for all i, but
not on H
n
(−; Z).
204 Chapter 3. Cohomology
12. Show H
k
(X, X
n
; G) = 0 if X is a CWcomplex and k ≤ n, by using the cohomology
version of the second proof of the corresponding result for homology in Lemma 2.34.
13. Let ¹X, Y) denote the set of basepointpreserving homotopy classes of basepoint
preserving maps X→Y . Using Proposition 1B.9, show that if X is a connected CW
complex and G is an abelian group, then the map ¹X, K(G, 1))→H
1
(X; G) sending a
map f : X→K(G, 1) to the induced homomorphism f
∗
: H
1
(X)→H
1
(K(G, 1)) ≈ G is
a bijection, where we identify H
1
(X; G) with Hom(H
1
(X), G) via the universal coefﬁ
cient theorem.
In the introduction to this chapter we sketched a deﬁnition of cup product in
terms of another product called cross product. However, to deﬁne the cross product
from scratch takes a fair bit of effort, so we will proceed in the opposite order, ﬁrst
giving an elementary deﬁnition of cup product via an explicit formula with simplices,
then afterwards deﬁning cross product in terms of cup product. The other approach
of deﬁning cup product via cross product is explained at the end of §3.B.
To deﬁne the cup product we consider cohomology with coefﬁcients in a ring
R, the most common choices being Z, Z
n
, and Q. For cochains ϕ ∈ C
k
(X; R) and
ψ ∈ C
(X; R), the cup product ϕψ ∈ C
k+
(X; R) is the cochain whose value on a
singular simplex σ : ∆
k+
→X is given by the formula
(ϕψ)(σ) = ϕ
¸
σ ¦
¦[v
0
, ··· , v
k
]
ψ
¸
σ ¦
¦[v
k
, ··· , v
k+
]
where the righthand side is the product in R. To see that this cup product of cochains
induces a cup product of cohomology classes we need a formula relating it to the
coboundary map:
Lemma 3.6. δ(ϕψ) = δϕψ+(−1)
k
ϕδψ for ϕ ∈ C
k
(X; R) and ψ ∈ C
(X; R).
Proof: For σ : ∆
k++1
→X we have
(δϕψ)(σ) =
k+1
¸
i=0
(−1)
i
ϕ
¸
σ¦
¦[v
0
, ··· , v
i
, ··· , v
k+1
]
ψ
¸
σ¦
¦[v
k+1
, ··· , v
k++1
]
(−1)
k
(ϕδψ)(σ) =
k++1
¸
i=k
(−1)
i
ϕ
¸
σ¦
¦[v
0
, ··· , v
k
]
ψ
¸
σ¦
¦[v
k
, ··· , v
i
, ··· , v
k++1
]
Adding these two expressions, the last term of the ﬁrst sum cancels the ﬁrst term of
the second sum, and the remaining terms are exactly δ(ϕ ψ)(σ) = (ϕ ψ)(∂σ)
since ∂σ =
¸
k++1
i=0
(−1)
i
σ ¦
¦[v
0
, ··· , v
i
, ··· , v
k++1
]. L¦
Section 3.2. Cup Product 205
From the formula δ(ϕ ψ) = δϕ ψ : ϕ δψ it is apparent that the cup
product of two cocycles is again a cocycle. Also, the cup product of a cocycle and a
coboundary, in either order, is a coboundary since ϕδψ = :δ(ϕψ) if δϕ = 0,
and δϕψ = δ(ϕψ) if δψ = 0. It follows that there is an induced cup product
H
k
(X; R) × H
(X; R)
→H
k+
(X; R)
This is associative and distributive since cup product at the cochain level is. If R
has an identity element 1, then the 0 cocycle taking the value 1 on each singular
0 simplex deﬁnes an element 1 ∈ H
0
(X; R) which is an identity for cup product.
A cup product for simplicial cohomology can be deﬁned by the same formula as
for singular cohomology, so the canonical isomorphism between simplicial and singu
lar cohomology respects cup products. Here are three examples of direct calculations
of cup products using simplicial cohomology.
Example 3.7. Let M be the closed orientable surface of
genus g ≥ 1 with the ∆ complex structure shown in
the ﬁgure for the case g = 2. The cup product of
interest is H
1
(M)×H
1
(M)→H
2
(M). Taking Z coef
b
b
a
a
a
a
b
b
1
1
1
1
1
1
2
2
2
2
α
2
α
β
2
β
+
+
+
+
_
_
_
_
ﬁcients, a basis for H
1
(M) is formed by the edges a
i
and b
i
, as we showed in Example 2.36 when we com
puted the homology of M using cellular homology.
We have H
1
(M) ≈ Hom(H
1
(M), Z) by cellular cohomol
ogy or the universal coefﬁcient theorem. A basis for H
1
(M)
determines a dual basis for Hom(H
1
(M), Z), so dual to a
i
is the cohomology class α
i
assigning the value 1 to a
i
and 0 to the other basis elements, and similarly we have
cohomology classes β
i
dual to b
i
.
To represent α
i
by a simplicial cocycle ϕ
i
we need to choose values for ϕ
i
on
the edges radiating out from the central vertex in such a way that δϕ
i
= 0. This is the
‘cocycle condition’ discussed in the introduction to this chapter, where we saw that it
has a geometric interpretation in terms of curves transverse to the edges of M. With
this interpretation in mind, consider the arc labelled α
i
in the ﬁgure, which represents
a loop in M meeting a
i
in one point and disjoint from all the other basis elements a
j
and b
j
. We deﬁne ϕ
i
to have the value 1 on edges meeting the arc α
i
and the value
0 on all other edges. Thus ϕ
i
counts the number of intersections of each edge with
the arc α
i
. In similar fashion we obtain a cocycle ψ
i
counting intersections with the
arc β
i
, and ψ
i
represents the cohomology class β
i
dual to b
i
.
Now we can compute cup products by applying the deﬁnition. Keeping in mind
the fact that the ordering of the vertices of each 2 simplex is compatible with the
indicated orientations of its edges, we see for example that ϕ
1
ψ
1
takes the value
0 on all 2 simplices except the one with outer edge b
1
in the lower right part of the
ﬁgure, where it takes the value 1. Thus ϕ
1
ψ
1
takes the value 1 on the 2 chain c
206 Chapter 3. Cohomology
formed by the sum of all the 2 simplices with the signs indicated in the center of the
ﬁgure. It is an easy calculation that ∂c = 0. Since there are no 3 simplices, c is not a
boundary, so it represents a nonzero element of H
2
(M). The fact that (ϕ
1
ψ
1
)(c)
is a generator of Z implies both that c represents a generator of H
2
(M) ≈ Z and that
ϕ
1
ψ
1
represents the dual generator γ of H
2
(M) ≈ Hom(H
2
(M), Z) ≈ Z. Thus
α
1
β
1
= γ. In similar fashion one computes:
α
i
β
j
=
¸
¸
γ, i = j
0, i ≠ j
¸
¸
¸
= −(β
i
α
j
), α
i
α
j
= 0, β
i
β
j
= 0
These relations determine the cup product H
1
(M)×H
1
(M)→H
2
(M) completely since
cup product is distributive. Notice that cup product is not commutative in this exam
ple since α
i
β
i
= −(β
i
α
i
). We will show in Theorem 3.12 below that this is the
worst that can happen: Cup product is commutative up to a sign depending only on
dimension.
One can see in this example that nonzero cup products of distinct classes α
i
or
β
j
occur precisely when the corresponding loops α
i
or β
j
intersect. This is also true
for the cup product of α
i
or β
i
with itself if we allow ourselves to take two copies of
the corresponding loop and deform one of them to be disjoint from the other.
Example 3.8. The closed nonorientable surface N of genus
g can be treated in similar fashion if we use Z
2
coef
ﬁcients. Using the ∆ complex structure shown, the
edges a
i
give a basis for H
1
(N; Z
2
), and the dual basis
a
a
a
a
a
a
a
a
1
1
1
2
2
2
3
3
4
4
α
3
α
α
4
α elements α
i
∈ H
1
(N; Z
2
) can be represented by cocy
cles with values given by counting intersections with
the arcs labelled α
i
in the ﬁgure. Then one computes
that α
i
α
i
is the nonzero element of H
2
(N; Z
2
) ≈ Z
2
and α
i
α
j
= 0 for i ≠ j . In particular, when g = 1 we have
N = RP
2
, and the cup product of a generator of H
1
(RP
2
; Z
2
) with itself is a generator
of H
2
(RP
2
; Z
2
).
The remarks in the paragraph preceding this example apply here also, but with
the following difference: When one tries to deform a second copy of the loop α
i
in
the present example to be disjoint from the original copy, the best one can do is make
it intersect the original in one point. This reﬂects the fact that α
i
α
i
is now nonzero.
Example 3.9. Let X be the 2 dimensional CW complex obtained by attaching a 2 cell
to S
1
by the degree m map S
1
→S
1
, z
z
m
. Using cellular cohomology, or cellular
homology and the universal coefﬁcient theorem, we see that H
n
(X; Z) consists of a
Z for n = 0 and a Z
m
for n = 2, so the cup product structure with Z coefﬁcients is
uninteresting. However with Z
m
coefﬁcients we have H
i
(X; Z
m
) ≈ Z
m
for i = 0, 1, 2
so there is the possibility that the cup product of two 1 dimensional classes can be
nontrivial.
Section 3.2. Cup Product 207
T
T
T
T
0
1
2
3
e
1
e
2
e
3
e
e
e
e v
w
w w
w
e
0
To obtain a ∆ complex structure on X, take a reg
ular m gon subdivided into m triangles T
i
around a
central vertex v, as shown in the ﬁgure for the case
m = 4, then identify all the outer edges by rotations
of the m gon. This gives X a ∆ complex structure
with 2 vertices, m+ 1 edges, and m 2 simplices. A
generator α of H
1
(X; Z
m
) is represented by a cocycle
ϕ assigning the value 1 to the edge e, which gener
ates H
1
(X). The condition that ϕ be a cocycle means that ϕ(e
i
) + ϕ(e) = ϕ(e
i+1
)
for all i, subscripts being taken mod m. So we may take ϕ(e
i
) = i ∈ Z
m
. Hence
(ϕ ϕ)(T
i
) = ϕ(e
i
)ϕ(e) = i. The map h: H
2
(X; Z
m
)→Hom(H
2
(X; Z
m
), Z
m
) is an
isomorphism since
¸
i
T
i
is a generator of H
2
(X; Z
m
) and there are 2 cocycles taking
the value 1 on
¸
i
T
i
, for example the cocycle taking the value 1 on one T
i
and 0 on
all the others. The cocycle ϕϕ takes the value 0+1+···+(m−1) on
¸
i
T
i
, hence
represents 0 + 1 + ··· + (m− 1) times a generator β of H
2
(X; Z
m
). In Z
m
the sum
0 +1 +··· +(m−1) is 0 if m is odd and k if m= 2k since the terms 1 and m−1
cancel, 2 and m−2 cancel, etc. Thus, writing α
2
for αα, we have α
2
= 0 if m is
odd and α
2
= kβ if m= 2k.
In particular, if m = 2, X is RP
2
and α
2
= β in H
2
(RP
2
; Z
2
), as we showed
already in Example 3.8.
The cup product formula (ϕψ)(σ) = ϕ
¸
σ ¦
¦[v
0
, ··· , v
k
]
ψ
¸
σ ¦
¦[v
k
, ··· , v
k+
]
also gives relative cup products
H
k
(X; R) × H
(X, A; R)
→H
k+
(X, A; R)
H
k
(X, A; R) × H
(X; R)
→H
k+
(X, A; R)
H
k
(X, A; R) × H
(X, A; R)
→H
k+
(X, A; R)
since if ϕ or ψ vanishes on chains in A then so does ϕψ. There is a more general
relative cup product
H
k
(X, A; R) × H
(X, B; R)
→H
k+
(X, A∪B; R)
when A and B are open subsets of X, or when A and B are subcomplexes of the
CW complex X, obtained as follows. The absolute cup product restricts to a cup
product C
k
(X, A; R)×C
(X, B; R)→C
k+
(X, A + B; R) where C
n
(X, A + B; R) is the
subgroup of C
n
(X; R) consisting of cochains vanishing on chains in A and on chains
in B. If A and B are open in X, the inclusions C
n
(X, A ∪ B; R) ⊂ C
n
(X, A + B; R)
induce isomorphisms on cohomology, via the ﬁvelemma and the fact that the restric
tion maps C
n
(A ∪ B; R)→C
n
(A + B; R) induce isomorphisms on cohomology as we
saw in the discussion of excision in the previous section. Therefore the cup product
C
k
(X, A; R)×C
(X, B; R)→C
k+
(X, A+B; R) induces the desired relative cup product
208 Chapter 3. Cohomology
H
k
(X, A; R)×H
(X, B; R)→H
k+
(X, A∪B; R). This holds also when X is a CW com
plex with A and B subcomplexes since the maps C
n
(A∪B; R)→C
n
(A+B; R) induce
isomorphisms on cohomology in this case too, just as we saw for homology in §2.2.
Example 3.10. Write R
n
as R
k
×R
where n = k+. Let us compute the relative cup
product
H
k
(R
n
, R
n
−R
; Z) × H
(R
n
, R
n
−R
k
; Z) →H
n
(R
n
, R
n
−¦0¦; Z)
All three of these cohomology groups are isomorphic to Z, and we will show that if
α and β generate the ﬁrst two groups, then α β generates the third group. The
argument will work just as well for any coefﬁcient ring R in place of Z, with ‘generator’
interpreted to mean an invertible element of R.
It will sufﬁce to ﬁnd a linear embedding σ : ∆
n
→R
n
with the following three
properties:
v v
v
0
n
k
k
R
R (a) The origin of R
n
lies in the interior of σ(∆
n
).
(b) The origin of R
k
lies in the interior of the projection
of σ([v
0
, ··· , v
k
]) onto R
k
.
(c) The origin of R
lies in the interior of the projection
of σ([v
k
, ··· , v
n
]) onto R
.
For if we have these properties, then σ represents a generator of H
n
(R
n
, R
n
−¦0¦; Z),
while the restrictions σ
k
and σ
of σ to [v
0
, ··· , v
k
] and [v
k
, ··· , v
n
] represent
generators of H
k
(R
n
, R
n
− R
; Z) and H
(R
n
, R
n
− R
k
; Z). Since the map h in the
universal coefﬁcient theorem is an isomorphism for the relative cohomology groups
we are considering here, relative cocycles ϕ and ψ representing α and β take the
value :1 on σ
k
and σ
, so ϕψ takes the value :1 on σ . Thus α β generates
H
n
(R
n
, R
n
−¦0¦; Z).
To obtain an n simplex in R
n
with the properties (a)(c), ﬁrst consider the simplex
s
n
consisting of n tuples (x
1
, ··· , x
n
) satisfying 1 ≥ x
1
≥ ··· ≥ x
n
≥ 0. The
vertices of s
n
are the points v
i
with ﬁrst i coordinates 1 and remaining coordinates
0. The standard simplex ∆
n
consists of nonnegative (n+1) tuples (t
0
, ··· , t
n
) with
¸
i
t
i
= 1, and we obtain a linear homeomorphism σ : ∆
n
→s
n
preserving the order
of vertices by setting σ(t
0
, ··· , t
n
) = (x
1
, ··· , x
n
) where x
i
= t
i
+ ··· + t
n
, so the
t
i
’s are the differences between adjacent x
i
’s. Note that the projections of R
n
onto
R
k
and R
take s
n
onto the simplices s
k
and s
. An interior point of s
n
is any point
whose coordinates satisfy the strict inequalities 1 > x
1
> ··· > x
n
> 0, so under the
two projections to R
k
and R
this point projects to interior points of s
k
and s
. To
obtain a simplex satisfying the conditions (a)(c) it therefore sufﬁces to translate s
n
so that the origin of R
n
lies in its interior.
Section 3.2. Cup Product 209
The Cohomology Ring
Since cup product is associative and distributive, it is natural to try to make it
the multiplication in a ring structure on the cohomology groups of a space X. This is
easy to do if we simply deﬁne H
∗
(X; R) to be the direct sum of the groups H
n
(X; R).
Elements of H
∗
(X; R) are ﬁnite sums
¸
i
α
i
with α
i
∈ H
i
(X; R), and the product of
two such sums is deﬁned to be
¸¸
i
α
i
¸¸
j
β
j
=
¸
i,j
α
i
β
j
. It is routine to check
that this makes H
∗
(X; R) into a ring, with identity if R has an identity. Similarly,
H
∗
(X, A; R) is a ring via the relative cup product. Taking scalar multiplication by
elements of R into account, these rings can also be regarded as R algebras.
For example, the calculations in Example 3.8 or 3.9 above show that H
∗
(RP
2
; Z
2
)
consists of the polynomials a
0
+a
1
α+a
2
α
2
with coefﬁcients a
i
∈ Z
2
, so H
∗
(RP
2
; Z
2
)
is the quotient Z
2
[α]/(α
3
) of the polynomial ring Z
2
[α] by the ideal generated by
α
3
.
This example illustrates how H
∗
(X; R) often has a more compact description
than the sequence of individual groups H
n
(X; R), so there is a certain economy in
the change of scale which comes from regarding all the groups H
n
(X; R) as part of a
single object H
∗
(X; R).
Adding cohomology classes of different dimensions to form H
∗
(X; R) is a conve
nient formal device, but it has little topological signiﬁcance. One always regards the
cohomology ring as a graded ring: a ring with a decomposition as a sum
¸
k≥0
A
k
of
additive subgroups A
k
such that the multiplication takes A
k
×A
to A
k+
.
Among the simplest graded rings are polynomial rings R[α] and their truncated
versions R[α]/(α
n
), consisting of polynomials of degree less than n. The example
we have seen is H
∗
(RP
2
; Z
2
) ≈ Z
2
[α]/(α
3
). Generalizing this, we have:
Theorem 3.11. H
∗
(RP
n
; Z
2
) ≈ Z
2
[α]/(α
n+1
) and H
∗
(RP
∞
; Z
2
) ≈ Z
2
[α], where α
is a generator of H
1
(RP
n
; Z
2
) or H
1
(RP
∞
; Z
2
), respectively. For complex projective
spaces, H
∗
(CP
n
; Z) ≈ Z[α]/(α
n+1
) and H
∗
(CP
∞
; Z) ≈ Z[α] where α is a generator
of H
2
(CP
n
; Z) or H
2
(CP
∞
; Z).
This turns out to be a quite important result which can be proved in a number of
different ways. The proof we give here consists of a direct reduction to the relative
cup product calculation in Example 3.10 above. Another proof using Poincar´e duality
will be given in Example 3.39. A third proof is contained in §4.D as an application of
the Gysin sequence.
Proof: Let us do the case of RP
n
ﬁrst. To simplify notation we abbreviate RP
n
to P
n
and we let the coefﬁcient group Z
2
be implicit. Since the inclusion P
n−1
P
n
induces
an isomorphism on H
i
for i ≤ n −1, it sufﬁces by induction on n to show that the
cup product of a generator of H
n−1
(P
n
) with a generator of H
1
(P
n
) is a generator
of H
n
(P
n
). It will be no more work to show more generally that the cup product of
210 Chapter 3. Cohomology
a generator of H
i
(P
n
) with a generator of H
n−i
(P
n
) is a generator of H
n
(P
n
). As a
further notational aid, we let j = n−i, so i +j = n.
The proof uses some of the geometric structure of P
n
. Recall that P
n
consists of
nonzero vectors (x
0
, ··· , x
n
) ∈ R
n+1
modulo multiplication by nonzero scalars. In
side P
n
is a copy of P
i
represented by vectors whose last j coordinates x
i+1
, ··· , x
n
are zero. We also have a copy of P
j
represented by points whose ﬁrst i coordinates
x
0
, ··· , x
i−1
are zero. The intersection P
i
∩P
j
is a single point
p, represented by vectors whose only nonzero coordinate
P
j
P
i
P
n 1
P
i 1
P
i 1
p
is x
i
. Let U be the subspace of P
n
represented by vec
tors with nonzero coordinate x
i
. Each point in U may be
represented by a unique vector with x
i
= 1 and the other
n coordinates arbitrary, so U is homeomorphic to R
n
, with
p corresponding to 0 under this homeomorphism. We can write this R
n
as R
i
×R
j
,
with R
i
as the coordinates x
0
, ··· , x
i−1
and R
j
as the coordinates x
i+1
, ··· , x
n
. In
the ﬁgure P
n
is represented as a disk with antipodal points of its boundary sphere
identiﬁed to form a P
n−1
⊂ P
n
with U = P
n
−P
n−1
the interior of the disk.
Consider the diagram
P H ( )
i n
P H ( )
j n
P H ( )
n n
×
−−−−−−−−−−−−−→
P H ( )
i n
P
n
P
j
P H ( )
j n
P H ( ) { }
n n
×
−−−−−→ , P
n
P p
i
, P
n
,
R H ( )
i n
R
n
R
j
R H ( )
j n
R H ( ) { }
n n
×
−−−−−→ , R
n
R 0
i
, R
n
,
−
−
→
−
−
→
−
−
→
−
−
→
which commutes by naturality of cup product. The lower cup product map takes
generator cross generator to generator as we showed in Example 3.10 above. The
same will be true for the top row if the four vertical maps are isomorphisms, so this
is what remains to be proved.
It is easy to see that the two vertical maps in the right column are isomorphisms.
For the lower map excision gives the isomorphism. For the upper map, the fact that
P
n
− ¦p¦ deformation retracts to P
n−1
gives an isomorphism H
n
(P
n
, P
n
− ¦0¦) ≈
H
n
(P
n
, P
n−1
) via the ﬁvelemma applied to the long exact sequences for these pairs.
And H
n
(P
n
, P
n−1
) ≈ H
n
(P
n
) by cellular cohomology.
To see that the vertical maps in the left column are isomorphisms we use the
following commutative diagram
) { } p
P H ( )
i n
P H ( )
i n
P
n
P
j
, P H ( )
i n
P , R H ( )
i n
R
n
R
j
) { }
− − − → − − − → −−−−→ ,
0
−
−
→
−
−
→
−
−
→
−
−
→
i 1
P H ( )
i i
P H (
i i
P
i
, P H ( )
i i
P , R H (
i i
R
i
− − − → − − − → −−−→ ,
i 1
If we can show all these maps are isomorphisms, then the same argument will apply
with i and j interchanged, and the proof for RP
n
will be ﬁnished.
Section 3.2. Cup Product 211
The lefthand square consists of isomorphisms by cellular cohomology. The right
hand vertical map is obviously an isomorphism. The lower right horizontal map is
an isomorphism by excision, and the map to the left of this is an isomorphism since
P
i
−¦p¦ deformation retracts onto P
i−1
. The remaining maps will be isomorphisms
if the middle map in the upper row is an isomorphism. And this map is in fact
an isomorphism because P
n
− P
j
deformation retracts onto P
i−1
by the following
argument. The subspace P
n
− P
j
⊂ P
n
consists of points represented by vectors
v = (x
0
, ··· , x
n
) with at least one of the coordinates x
0
, ··· , x
i−1
nonzero. The
formula f
t
(v) = (x
0
, ··· , x
i−1
, tx
i
, ··· , tx
n
) for t decreasing from 1 to 0 gives a
welldeﬁned deformation retraction of P
n
−P
j
onto P
i−1
since f
t
(λv) = λf
t
(v) for
scalars λ ∈ R.
The case of RP
∞
follows from the ﬁnitedimensional case since the inclusion
RP
n
RP
∞
induces isomorphisms on H
i
(−; Z
2
) for i ≤ n by cellular cohomology.
Complex projective spaces are handled in precisely the same way, using Z coef
ﬁcients. The only notational changes needed are to replace each H
k
by H
2k
, and of
course R by C. L¦
There are also quaternionic projective spaces HP
n
and HP
∞
, deﬁned exactly as
in the complex case, with CW structures of the form e
0
∪ e
4
∪ e
8
∪ ···. Associa
tivity of quaternion multiplication is needed for the identiﬁcation v ∼ λv to be an
equivalence relation, so the deﬁnition does not extend to octonionic projective spaces,
though there is an octonionic projective plane OP
2
which will be deﬁned in §4.3. The
cup product structure in quaternionic projectives spaces is just like that in complex
projective spaces, except that the generator is 4 dimensional:
H
∗
(HP
∞
; Z) ≈ Z[α] and H
∗
(HP
n
; Z) ≈ Z[α]/(α
n+1
), with α ∈ H
4
The same proof as in the real and complex cases works here too.
The cup product structure for RP
∞
with Z coefﬁcients can easily be deduced
from the cup product structure with Z
2
coefﬁcients, as follows. In general, a ring
homomorphism R→S induces a ring homomorphism H
∗
(X, A; R)→H
∗
(X, A; S). In
the case of the projection Z→Z
2
we get for RP
∞
an induced chain map of cellular
cochain complexes with Z and Z
2
coefﬁcients:
−−−−−→
−−−−−→
−−−−−→
−−−−−→
−−−−−→
− − − − − →
Z
− − − − − →
0
0
2 2 0 0
0 0 0
. . .
2
Z
2
Z
− − − − − →
2
Z
− − − − − →
2
Z
− − − − − → − − − − − →
2
− − − − − →
Z
− − − − − →
0
. . .
Z Z
− − − − − →
Z
− − − − − →
Z
− − − − − → − − − − − →
The vertical maps are surjective, and from this it follows that the ring homomor
phism H
∗
(RP
∞
; Z)→H
∗
(RP
∞
; Z
2
) is injective in positive dimensions, with image the
evendimensional part of H
∗
(RP
∞
; Z
2
). (This can also be deduced from the uni
versal coefﬁcient theorem.) Hence H
∗
(RP
∞
; Z) ≈ Z[α]/(2α) for α a generator of
H
2
(RP
∞
; Z) ≈ Z
2
.
212 Chapter 3. Cohomology
The cup product structure in H
∗
(RP
n
; Z) can be computed in a similar fashion,
though the description is a little cumbersome:
H
∗
(RP
2k
; Z) ≈ Z[α]/(2α, α
k+1
)
H
∗
(RP
2k+1
; Z) ≈ Z[α, β]/(2α, α
k+1
, β
2
, αβ)
where β is a generator of H
2k+1
(RP
2k+1
; Z) ≈ Z. Thus the rings H
∗
(RP
2k+1
; Z) and
H
∗
(RP
2k
∨ S
2k+1
; Z) are isomorphic, though with Z
2
coefﬁcients this is no longer
true, since the generator α ∈ H
1
(RP
2k+1
; Z
2
) has α
2k+1
≠ 0, while α
2k+1
= 0 for the
generator α ∈ H
1
(RP
2k
∨S
2k+1
; Z
2
).
The natural question of whether the cohomology ring is commutative is answered
by the following:
Theorem 3.12. The identity αβ = (−1)
k
βα holds for all α ∈ H
k
(X, A; R) and
β ∈ H
(X, A; R), if the coefﬁcient ring R is commutative.
Taking α = β, this implies in particular that if α is an element of H
k
(X, A; R)
with k odd, then 2α
2
= 0 in H
2k
(X, A; R). Hence if H
2k
(X, A; R) has no elements of
order two, then α
2
= 0. For example, if X is the 2 complex obtained by attaching a
disk to S
1
by a map of degree m as in Example 3.9 above, then we can deduce that
the square of a generator of H
1
(X; Z
m
) is zero if m is odd, and is either zero or the
unique element of H
2
(X; Z
m
) ≈ Z
m
of order two if m is even. As we showed, the
square is in fact nonzero when m is even.
A graded ring satisfying the commutativity property of the theorem is usually
called simply commutative in the context of algebraic topology, in spite of the po
tential for misunderstanding. In the older literature one ﬁnds less ambiguous terms
such as gradedcommutative, anticommutative, or skewcommutative.
Proof: Consider ﬁrst the case A = ∅. Given cochains ϕ ∈ C
k
(X; R) and ψ ∈
C
(X, R), one can see from the deﬁnition that the cup products ϕ ψ and ψ ϕ
differ only by a permutation of the vertices of ∆
k+
. The idea of the proof is to study a
particularly nice permutation of vertices, namely totally reversing their order, replac
ing [v
0
, ··· , v
n
] by [v
n
, ··· , v
0
]. This has the convenient feature of also reversing
the ordering of vertices in any face.
For a singular n simplex σ : [v
0
, ··· , v
n
]→X, let σ be the singular n simplex
obtained by preceding σ by the linear homeomorphism of [v
0
, ··· , v
n
] reversing
the order of the vertices. Thus σ(v
i
) = σ(v
n−i
). This reversal of vertices is the
product of n + (n − 1) + ··· + 1 = n(n + 1)/2 transpositions of adjacent vertices,
each of which reverses orientation of the n simplex, being a reﬂection across an (n−
1) dimensional hyperplane. So to take orientations into account we would expect
that a sign ε
n
= (−1)
n(n+1)/2
ought to be inserted. Hence we deﬁne a homomorphism
ρ : C
n
(X)→C
n
(X) by ρ(σ) = ε
n
σ .
Section 3.2. Cup Product 213
We will show that ρ is a chain map chain homotopic to the identity, so ρ induces
the identity on cohomology. From this the theorem quickly follows. Namely, the
formulas
(ρ
∗
ϕρ
∗
ψ)(σ) = ϕ(ε
k
σ¦
¦[v
k
, ··· , v
0
])ψ(ε
σ¦
¦[v
k+
, ··· , v
k
])
ρ
∗
(ψϕ)(σ) = ε
k+
ψ(σ¦
¦[v
k+
, ··· , v
k
])ϕ(σ¦
¦[v
k
, ··· , v
0
])
show that ε
k
ε
(ρ
∗
ϕρ
∗
ψ) = ε
k+
ρ
∗
(ψϕ), since we assume R is commutative.
A trivial calculation gives ε
k+
= (−1)
k
ε
k
ε
, hence ρ
∗
ϕρ
∗
ψ = (−1)
k
ρ
∗
(ψϕ).
Since ρ is chain homotopic to the identity, the ρ
∗
’s disappear when we pass to coho
mology classes, and so we obtain the desired formula αβ = (−1)
k
β α.
The chain map property ∂ρ = ρ∂ can be veriﬁed by calculating, for a singular
n simplex σ ,
∂ρ(σ) = ε
n
¸
i
(−1)
i
σ¦
¦[v
n
, ··· , v
n−i
, ··· , v
0
]
ρ∂(σ) = ρ
¸
i
(−1)
i
σ¦
¦[v
0
, ··· , v
i
, ··· , v
n
]
= ε
n−1
¸
i
(−1)
n−i
σ¦
¦[v
n
, ··· , v
n−i
, ··· , v
0
]
which reduces us to the easilychecked identity ε
n
= (−1)
n
ε
n−1
.
To deﬁne a chain homotopy between ρ and the identity we are motivated by the
construction of the prism operator P in the proof that homotopic maps induce the
same homomorphism on homology, in Theorem 2.10. The main ingredient in the con
struction of P was a subdivision of ∆
n
×I into (n +1) simplices with vertices v
i
in
∆
n
×0 and w
i
in ∆
n
×1, the vertex w
i
lying directly above v
i
. Using the same subdivi
sion, and letting π : ∆
n
×I→∆
n
be the projection, we nowdeﬁne P : C
n
(X)→C
n+1
(X)
by
P(σ) =
¸
i
(−1)
i
ε
n−i
(σπ)¦
¦[v
0
, ··· , v
i
, w
n
, ··· , w
i
].
Thus the w vertices are written in reverse order, and there is a compensating sign
ε
n−i
. One can view this formula as arising from the ∆ complex structure on ∆
n
×I
in which the vertices are ordered v
0
, ··· , v
n
, w
n
, ··· , w
0
rather than the more natural
ordering v
0
, ··· , v
n
, w
0
, ··· , w
n
.
To show ∂P + P∂ = ρ − 11 we ﬁrst calculate ∂P , leaving out σ ’s and σπ’s for
notational simplicity:
∂P =
¸
j≤i
(−1)
i
(−1)
j
ε
n−i
[v
0
, ··· , v
j
, ··· , v
i
, w
n
, ··· , w
i
]
+
¸
j≥i
(−1)
i
(−1)
i+1+n−j
ε
n−i
[v
0
, ··· , v
i
, w
n
, ··· , w
j
, ··· , w
i
].
The j = i terms in these two sums give
ε
n
[w
n
, ··· , w
0
] +
¸
i>0
ε
n−i
[v
0
, ··· , v
i−1
, w
n
, ··· , w
i
]
+
¸
i<n
(−1)
n+i+1
ε
n−i
[v
0
, ··· , v
i
, w
n
, ··· , w
i+1
] − [v
0
, ··· , v
n
].
214 Chapter 3. Cohomology
In this expression the two summation terms cancel since replacing i by i − 1 in the
second sum produces a new sign (−1)
n+i
ε
n−i+1
= −ε
n−i
. The remaining two terms
ε
n
[w
n
, ··· , w
0
] and −[v
0
, ··· , v
n
] represent ρ(σ) − σ . So in order to show that
∂P +P∂ = ρ −11, it remains to check that in the formula for ∂P above, the terms with
j ≠ i give −P∂. Calculating P∂ from the deﬁnitions, we have
P∂ =
¸
i<j
(−1)
i
(−1)
j
ε
n−i−1
[v
0
, ··· , v
i
, w
n
, ··· , w
j
, ··· , w
i
]
+
¸
i>j
(−1)
i−1
(−1)
j
ε
n−i
[v
0
, ··· , v
j
, ··· , v
i
, w
n
, ··· , w
i
].
Since ε
n−i
= (−1)
n−i
ε
n−i−1
, this ﬁnishes the veriﬁcation that ∂P + P∂ = ρ − 11, and
so the theorem is proved when A = ∅. The proof also applies when A ≠ ∅ since the
maps ρ and P take chains in A to chains in A, so the dual homomorphisms ρ
∗
and
P
∗
act on relative cochains. L¦
Induced homomorphisms are ring homomorphisms:
Proposition 3.13. For a map f : X→Y , the induced maps f
∗
: H
n
(Y; R)→H
n
(X; R)
satisfy f
∗
(αβ) = f
∗
(α) f
∗
(β), and similarly in the relative case.
Proof: This comes from the cochain formula f
(ϕ) f
(ψ) = f
(ϕψ):
(f
ϕf
ψ)(σ) = f
ϕ(σ¦
¦[v
0
, ··· , v
k
])f
ψ(σ¦
¦[v
k
, ··· , v
k+
])
= ϕ(fσ¦
¦[v
0
, ··· , v
k
])ψ(fσ¦
¦[v
k
, ··· , v
k+
])
= (ϕψ)(fσ) = f
(ϕψ)(σ) L¦
Example 3.14. The isomorphism H
∗
(
¸
α
X
α
; R)
≈
→
¸
α
H
∗
(X
α
; R) whose coordinates
are induced by the inclusions i
α
: X
α
¸
α
X
α
is a ring isomorphism, with respect
to the usual coordinatewise multiplication in a product ring, because each coordinate
function i
∗
α
is a ring homomorphism. Similarly for a wedge sum the isomorphism
`
H
∗
(
α
X
α
; R) ≈
¸
α
`
H
∗
(X
α
; R) is a ring isomorphism. Here we take reduced cohomol
ogy to be cohomology relative to a basepoint, and we use relative cup products. We
should assume the basepoints x
α
∈ X
α
are deformation retracts of neighborhoods,
to be sure that the claimed isomorphism does indeed hold.
This product ring structure for wedge sums can sometimes be used to rule out
splittings of a space as a wedge sum up to homotopy equivalence. For example, con
sider CP
2
, which is S
2
with a cell e
4
attached by a certain map f : S
3
→S
2
. Using
homology or just the additive structure of cohomology it is impossible to conclude
that CP
2
is not homotopy equivalent to S
2
∨S
4
, and hence that f is not homotopic
to a constant map. However, with cup products we can distinguish these two spaces
since the square of each element of H
2
(S
2
∨ S
4
; Z) is zero in view of the ring iso
morphism
`
H
∗
(S
2
∨ S
4
; Z) ≈
`
H
∗
(S
2
; Z)⊕
`
H
∗
(S
4
; Z), but the square of a generator of
H
2
(CP
2
; Z) is nonzero by Theorem 3.11.
Section 3.2. Cup Product 215
More generally, cup products can be used to distinguish inﬁnitely many different
homotopy classes of maps S
4n−1
→S
2n
for all n ≥ 1. This is systematized in the
notion of the Hopf invariant, which is studied in §4.B.
A K¨ unneth Formula
One might guess that there should be some connection between cup product and
product spaces, and indeed this is the case, as we will show in this subsection.
To begin, we deﬁne the cross product, or external cup product as it is sometimes
called. This is the map
H
∗
(X; R)×H
∗
(Y; R)
×
→H
∗
(X×Y; R)
given by a×b = p
∗
1
(a)p
∗
2
(b) where p
1
and p
2
are the projections of X×Y onto X
and Y . Since cup product is distributive, the cross product is bilinear, that is, linear
in each variable separately.
To take a trivial example, if X and Y are each a point and R = Z, then the cross
product is simply the multiplication map Z×Z→Z, (x, y)
xy. This is certainly
bilinear, but it is not a homomorphism of groups Z×Z→Z. However, there is a stan
dard way to convert bilinear maps into homomorphisms, using the notion of tensor
product. Let us digress a moment to recall the deﬁnition and basic properties of
tensor product.
For abelian groups A and B the tensor product A⊗B is deﬁned to be the abelian
group with generators a⊗b for a ∈ A, b ∈ B, and relations (a+a
¹
) ⊗b = a⊗b+a
¹
⊗b
and a⊗(b +b
¹
) = a⊗b +a⊗b
¹
. So the zero element of A⊗B is 0⊗0 = 0⊗b = a⊗0,
and −(a⊗b) = −a⊗b = a⊗(−b). Some readily veriﬁed elementary properties are:
(1) A⊗B ≈ B⊗A
(2) (
¸
i
A
i
)⊗B ≈
¸
i
(A
i
⊗B)
(3) (A⊗B)⊗C ≈ A⊗(B⊗C)
(4) Z⊗A ≈ A
(5) Z
n
⊗A ≈ A/nA
(6) A pair of homomorphisms f : A→A
¹
and g : B→B
¹
induces a homomorphism
f ⊗g : A⊗B→A
¹
⊗B
¹
via (f ⊗g)(a⊗b) = f(a) ⊗g(b).
(7) A map ϕ: A×B→C which is a homomorphism in each variable separately in
duces a homomorphism A⊗B→C sending a⊗b to ϕ(a, b).
In (1)(5) the isomorphisms are the obvious ones, e.g., a⊗b
b⊗a in (1) and n⊗a
na in (4). Properties (1), (2), (4), and (5) allow the calculation of tensor products of
ﬁnitely generated abelian groups.
The generalization to tensor product of modules over a commutative ring R is
easy. One deﬁnes A⊗
R
B for R modules A and B to be the quotient of A⊗B obtained
by imposing the further relations ra⊗b = a⊗rb for r ∈ R, a ∈ A, and b ∈ B. This
relation guarantees that A⊗
R
B is again an R module. (In case R is not commutative
216 Chapter 3. Cohomology
one assumes A is a right R module and B is a left R module, and the relation is
written instead ar ⊗b = a⊗rb, but now A⊗
R
B is only an abelian group, not an
R module in general.) It is a small algebra exercise to see that A⊗
R
B = A⊗B when R =
Z
m
or Q. But in general A⊗
R
B is not the same as A⊗B. For example, if R = Q(
√
2),
a 2 dimensional vector space over Q, then R⊗
R
R = R but R⊗R is a 4 dimensional
vector space over Q. And R⊗R is quite huge compared with R⊗
R
R = R.
The statements (1)(3), (6), and (7) above hold equally well for tensor products
of R modules. The generalization of (4) is the canonical isomorphism R⊗
R
A ≈ A,
r ⊗a
ra.
Property (7) of tensor products guarantees that the cross product as deﬁned above
gives rise to a homomorphism
H
∗
(X; R) ⊗
R
H
∗
(Y; R)
×
→H
∗
(X×Y; R), a⊗b
a×b
which we shall also call cross product. This map becomes a ring homomorphism if
we deﬁne the multiplication in a tensor product of graded rings by (a ⊗b)(c ⊗d) =
(−1)
¦b¦¦c¦
ac ⊗ bd where ¦x¦ denotes the dimension of x. Namely the cross product
map sends (a ⊗b)(c ⊗d) = (−1)
¦b¦¦c¦
ac ⊗bd to
(−1)
¦b¦¦c¦
ac×bd = (−1)
¦b¦¦c¦
p
∗
1
(a c) p
∗
2
(b d)
= (−1)
¦b¦¦c¦
p
∗
1
(a) p
∗
1
(c) p
∗
2
(b) p
∗
2
(d)
= p
∗
1
(a) p
∗
2
(b) p
∗
1
(c) p
∗
2
(d)
= (a×b)(c×d)
which is the product of the images of a⊗b and c ⊗d.
Theorem 3.15. The cross product H
∗
(X; R)⊗
R
H
∗
(Y; R)→H
∗
(X×Y; R) is an iso
morphismof rings if X and Y are CWcomplexes and H
k
(Y; R) is a ﬁnitelygenerated
free R module for all k.
Results of this type, computing homology or cohomology of a product space, are
known as K¨ unneth formulas. The hypothesis that X and Y are CW complexes will be
shown to be unnecessary in §4.1 when we consider CW approximations to arbitrary
spaces. On the other hand, the freeness hypothesis cannot always be dispensed with,
as we shall see in §3.B when we obtain a completely general K¨ unneth formula for the
homology of a product space.
When the conclusion of the theorem holds, the ring structure in H
∗
(X×Y; R) is
determined by the ring structures in H
∗
(X; R) and H
∗
(Y; R). Example 3E.6 shows
that some hypotheses are necessary in order for this to be true.
Before proving the theorem, let us look at some examples.
Example 3.16. The theorem says that H
∗
(RP
∞
×RP
∞
; Z
2
) is isomorphic as a ring
to H
∗
(RP
∞
; Z
2
)⊗H
∗
(RP
∞
; Z
2
). By Theorem 3.11 this is Z
2
[α]⊗Z
2
[β], which is just
the polynomial ring Z
2
[α, β]. More generally we see by induction that for a product
Section 3.2. Cup Product 217
of n copies of RP
∞
the Z
2
cohomology is a polynomial ring in n variables. Similar
remarks apply to CP
∞
and HP
∞
with coefﬁcients in an arbitrary commutative ring.
Example 3.17: Exterior Algebras. The theorem implies that H
∗
(S
k
×S
; Z) is free
with additive basis ¦1, α, β, α β¦ where α ∈ H
k
(S
k
×S
; Z) and β ∈ H
(S
k
×S
; Z)
are pullbacks of generators of H
k
(S
k
; Z) and H
(S
; Z), hence satisfy α
2
= β
2
= 0.
The rest of the ring structure of H
∗
(S
k
×S
; Z) is determined by the commutativity
relation αβ = (−1)
k
βα. If both k and are odd, H
∗
(S
k
×S
; Z) is thus the exterior
algebra Λ
Z
[α, β]. In general, the exterior algebra Λ
R
[α
1
, α
2
, ···] over a commutative
ring R with identity is the free R module with basis the ﬁnite products α
i
1
··· α
i
k
,
i
1
< ··· < i
k
, with multiplication deﬁned by the rules α
i
α
j
= −α
j
α
i
and α
2
i
= 0, the
latter relation being a special case of the former if 2 ≠ 0 in R. The empty product
of α
i
’s is allowed, and provides an identity element 1 ∈ Λ
R
[α
1
, α
2
, ···]. We could
also describe Λ
R
[α
1
, α
2
, ···] as the graded tensor product over R of the onevariable
exterior algebras Λ
R
[α
i
] where the α
i
’s have odd dimension. The theorem then
gives an isomorphism H
∗
(S
k
1
× ··· ×S
k
n
; Z) ≈ Λ
Z
[α
1
, ··· , α
n
] if the dimensions k
i
are all odd. With some k
i
’s even, one would have the tensor product of an exterior
algebra for the odddimensional spheres and truncated polynomial rings Z[α]/(α
2
)
for the evendimensional spheres. Of course, Λ
Z
[α] and Z[α]/(α
2
) are isomorphic as
rings, but when one takes tensor products in the graded sense it becomes important
to distinguish them as graded rings, with α odddimensional in Λ
Z
[α] and even
dimensional in Z[α]/(α
2
). These remarks apply more generally with any coefﬁcient
ring R in place of Z, though when R = Z
2
there is no need to distinguish between the
odd and even dimensional cases since signs become irrelevant.
The idea of the proof of the theorem will be to consider, for a ﬁxed CW complex
Y , the functors
h
n
(X, A) =
¸
i
¸
H
i
(X, A; R)⊗
R
H
n−i
(Y; R)
k
n
(X, A) = H
n
(X×Y, A×Y; R).
The cross product, or a relative version of it, deﬁnes a map µ : h
n
(X, A)→k
n
(X, A)
which we want to show is an isomorphism when X is a CW complex and A = ∅. We
will show:
(1) h
∗
and k
∗
are cohomology theories on the category of CW pairs.
(2) µ is a natural transformation, i.e., it commutes with induced homomorphisms
and with coboundary homomorphisms in long exact sequences of pairs.
It is obvious that µ : h
n
(X)→k
n
(X) is an isomorphism when X is a point since it is
just the scalar multiplication map R⊗
R
H
n
(Y; R)→H
n
(Y; R). The following general
fact will then imply the theorem.
Proposition 3.18. A natural transformation between unreduced cohomology theo
ries on the category of CW pairs which is an isomorphism when the CW pair is a point
is an isomorphism for all CW pairs.
218 Chapter 3. Cohomology
Proof: Let µ : h
∗
(X, A)→k
∗
(X, A) be the natural transformation. By the ﬁvelemma
it will sufﬁce to show that µ is an isomorphism when A = ∅.
First we do the case of ﬁnitedimensional X by induction on dimension. The
induction starts with the case that X is 0 dimensional, where the result holds by
hypothesis and by the axiom for disjoint unions. For the induction step, µ gives
a map between the two long exact sequences for the pair (X
n
, X
n−1
), with squares
which commute since µ is a natural transformation. The ﬁvelemma reduces the
inductive step to showing that µ is an isomorphism for (X, A) = (X
n
, X
n−1
). Let
Φ:
¸
α
(D
n
α
, ∂D
n
α
)→(X
n
, X
n−1
) be a collection of characteristic maps for all the n cells
of X. By excision Φ
∗
is an isomorphism for h
∗
and k
∗
, so naturality reduces us to
showing that µ is an isomorphism for (X, A) =
¸
α
(D
n
α
, ∂D
n
α
). The axiom for disjoint
unions reduces us further to the case (D
n
, ∂D
n
). This case follows by applying the
ﬁvelemma to the long exact sequences of this pair, since D
n
is contractible, hence is
covered by the 0 dimensional case, and ∂D
n
is (n−1) dimensional.
The case that X is inﬁnitedimensional reduces to the ﬁnitedimensional case by a
telescope argument as in the proof of Lemma 2.34. We leave this for the reader since
the ﬁnitedimensional case sufﬁces for the special h
∗
and k
∗
we are considering,
as h
i
(X, X
n
) and k
i
(X, X
n
) are both zero when n > i, by cellular cohomology for
example. L¦
Proof of 3.15: It remains to check that h
∗
and k
∗
are cohomology theories, and
that µ is a natural transformation. Since we are dealing with unreduced cohomology
theories there are four axioms to verify.
(1) Homotopy invariance: f = g implies f
∗
= g
∗
. This is obvious for both h
∗
and
k
∗
.
(2) Excision: h
∗
(X, A) ≈ h
∗
(B, A∩B) for A and B subcomplexes of the CW complex
X = A ∪ B. This is obvious, and so is the corresponding statement for k
∗
since
(A×Y) ∪(B×Y) = (A∪B)×Y and (A×Y) ∩(B×Y) = (A∩B)×Y .
(3) The long exact sequence of a pair. This is a triviality for k
∗
, but a few words of
explanation are needed for h
∗
, where the desired exact sequence is obtained in
two steps. For the ﬁrst step, tensor the long exact sequence of ordinary coho
mology groups for a pair (X, A) with the free R module H
n
(Y; R), for a ﬁxed n.
This yields another exact sequence because H
n
(Y; R) is a direct sum of copies
of R, so the result of tensoring an exact sequence with this direct sum is simply
to produce a direct sum of copies of the exact sequence, which is again an exact
sequence. The second step is to let n vary, taking a direct sum of the previously
constructed exact sequences for each n, with the n
th
exact sequence shifted up
by n dimensions.
(4) Disjoint unions. Again this axiom obviously holds for k
∗
but some justiﬁcation
is required for h
∗
. What is needed is the algebraic fact that there is a canonical
Section 3.2. Cup Product 219
isomorphism
¸¸
α
M
α
⊗
R
N ≈
¸
α
¸
M
α
⊗
R
N
for R modules M
α
and a ﬁnitely
generated free R module N. Since N is a direct product of ﬁnitely many copies
R
β
of R, M
α
⊗
R
N is a direct product of corresponding copies M
αβ
= M
α
⊗
R
R
β
of
M
α
and the desired relation becomes
¸
β
¸
α
M
αβ
≈
¸
α
¸
β
M
αβ
, which is obviously
true.
It remains to check the naturality of µ. Naturality with respect to maps between
spaces is immediate from the naturality of cup products. Naturality with respect to
coboundary maps in long exact sequences is commutativity of the square
A R
R
H ( ) H (
−−−−−−→
H (
−−−−−−−−−−→
−
−
−
−
−
→
; Y R H ( )
i j i 1
;
A Y H ( × X Y × A Y × R)
i j 1
;
X A R)
R)
;
, ;
⊗
⊗
µ
R −
−
−
−
−
→
Y R H ( )
j
; , ⊗
µ
δ
δ + i j + +
+ 1 1
An element of the upper left module is a sum of classes represented by products
ϕ⊗ψ for cocycles ϕ ∈ C
i
(A; R) and ψ ∈ C
j
(Y; R). Each ϕ can be extended to a
cochain ϕ ∈ C
i
(X; R). Then ϕ⊗ψ maps rightward to δϕ⊗ψ and then downward
to p
1
(δϕ) p
2
(ψ). Going the other way around the square, ϕ⊗ψ maps downward
to p
1
(ϕ) p
2
(ψ) and then rightward to δ
¸
p
1
(ϕ) p
2
(ψ)
since p
1
(ϕ) p
2
(ψ)
extends p
1
(ϕ) p
2
(ψ) over X×Y . Finally, δ
¸
p
1
(ϕ) p
2
(ψ)
= p
1
(δϕ) p
2
(ψ)
since δψ = 0. L¦
The following theorem of Hopf is a nice algebraic application of the cup product
structure in H
∗
(RP
n
×RP
n
; Z
2
), which the K¨ unneth formula describes.
Theorem 3.19. If R
n
has the structure of a division algebra over the scalar ﬁeld R,
then n must be a power of 2.
Proof: Given a division algebra structure on R
n
, deﬁne a map g : S
n−1
×S
n−1
→S
n−1
by g(x, y) = xy/¦xy¦. This is welldeﬁned since there are no zerodivisors, and con
tinuous by the bilinearity of the multiplication. From the relations (−x)y = −(xy) =
x(−y) it follows that g(−x, y) = −g(x, y) = g(x, −y). This implies that g induces
a quotient map h: RP
n−1
×RP
n−1
→RP
n−1
.
We claim that h
∗
: H
1
(RP
n−1
; Z
2
)→H
1
(RP
n−1
×RP
n−1
; Z
2
) is the map h
∗
(γ) =
α + β where γ generates H
1
(RP
n−1
; Z
2
) and α and β are the pullbacks of γ under
the projections of RP
n−1
×RP
n−1
onto its two factors. This can be proved as follows.
We may assume n > 2, so π
1
(RP
n−1
) ≈ Z
2
. Let λ: I→S
n−1
be a path joining a point x
to the antipodal point −x. Then for ﬁxed y, the path s
g(λ(s), y) joins g(x, y)
to g(−x, y) = −g(x, y). Hence, identifying antipodal points, h takes a nontrivial
loop in the ﬁrst RP
n−1
factor of RP
n−1
×RP
n−1
to a nontrivial loop in RP
n−1
. The
same argument works for the second factor, so the restriction of h to the 1 skeleton
S
1
∨ S
1
is homotopic to the map which includes each S
1
summand of S
1
∨ S
1
into
RP
n−1
as the 1 skeleton. Since restriction to the 1 skeleton is an isomorphism on
H
1
(−; Z
2
) for both RP
n−1
and RP
n−1
×RP
n−1
, it follows that h
∗
(γ) = α+β.
220 Chapter 3. Cohomology
Since γ
n
= 0 we have 0 = h
∗
(γ
n
) = (α + β)
n
=
¸
k
n
k
α
k
β
n−k
. This is an
equation in the ring H
∗
(RP
n−1
×RP
n−1
; Z
2
) ≈ Z
2
[α, β]/(α
n
, β
n
), so the coefﬁcient
n
k
must be zero in Z
2
for all k in the range 0 < k < n. It is a rather easy number
theory fact that this happens only when n is a power of 2. Namely, an obviously
equivalent statement is that in the polynomial ring Z
2
[x], the equality (1 + x)
n
=
1 + x
n
holds only when n is a power of 2. To prove the latter statement, write
n as a sum of powers of 2, n = n
1
+ ··· + n
k
with n
1
< ··· < n
k
. Then (1 +
x)
n
= (1 +x)
n
1
··· (1 +x)
n
k
= (1 +x
n
1
) ··· (1 +x
n
k
) since squaring is an additive
homomorphism with Z
2
coefﬁcients. If one multiplies the product (1 +x
n
1
) ··· (1 +
x
n
k
) out, no terms combine or cancel since n
i
≥ 2n
i−1
for each i, and so the resulting
polynomial has 2
k
terms. Thus if this polynomial equals 1+x
n
we must have k = 1,
which means that n is a power of 2. L¦
It is sometimes important to have a relative version of the K¨ unneth Formula in
Theorem 3.15. The relative cross product is
H
∗
(X, A; R) ⊗
R
H
∗
(Y, B; R)
×
→H
∗
(X×Y, A×Y ∪X×B; R)
for CW pairs (X, A) and (Y, B), deﬁned just as in the absolute case by a×b =
p
∗
1
(a) p
∗
2
(b) where p
∗
1
(a) ∈ H
∗
(X×Y, A×Y; R) and p
∗
2
(b) ∈ H
∗
(X×Y, X×B; R).
Theorem 3.20. For CW pairs (X, A) and (Y, B) the cross product homomorphism
H
∗
(X, A; R)⊗
R
H
∗
(Y, B; R)→H
∗
(X×Y, A×Y ∪X×B; R) is an isomorphism of rings
if H
k
(Y, B; R) is a ﬁnitely generated free R module for each k.
Proof: First note that the case B = ∅ was covered in the course of the proof of the
absolute case. So it sufﬁces to deduce the case B ≠ ∅ from the case B = ∅.
The following commutative diagram shows that collapsing B to a point reduces
us to the case that B is a point.
B/B X A
R
H ( )
− − − − − − − →
− − − − − − →
−
−
−
−
−
→
, Y B H ( ) ,
A Y H ( × X Y × X B ×
× ×
) ,
⊗
−
−
−
−
−
→
∗ ∗
∗
X A
R
H ( ) ,
Y/B
Y/B H ( ) , ⊗
∗ ∗
∪ A H ( ( × X× X× ) ) Y/B ( ) B/B ( ) ,
∗
∪
≈
≈
The lower map is an isomorphism since the quotient spaces (X×Y)/(A×Y ∪ X×B)
and
¸
X×(Y/B)
/
¸
A×(Y/B) ∪X×(B/B)
are the same.
In the case that B is a point y
0
∈ Y , consider the commutative diagram
X A
R
H ( )
−−−−→
−
−
−
−
−
−
−
→
−−−−−−→ −−−−−−→
, Y y H ( ) ,
A Y H ( × X Y × X y ×
×
−
−
−
−
−
−
−
→
×
) ,
⊗
×
−−−−−→
−−−−−→
∗ ∗
∗
X A
R
H ( ) ,
Y
Y H ( ) ⊗
∗ ∗
−−−−→
−
−
−
−
−
−
−
−
→
X A
R
H ( ) , H ( ⊗
∗ ∗
∪ A H ( × X× ) Y ,
∗
0
0
A Y H ( × A Y × X y × ) ,
∗
∪
0
0
H ( A y × X y × ) ,
∗
0
y )
0
≈
Section 3.2. Cup Product 221
Since y
0
is a retract of Y , the upper rowof this diagramis a split short exact sequence.
The lower row is the long exact sequence of a triple, and it too is a split short exact
sequence since (X×y
0
, A×y
0
) is a retract of (X×Y, A×Y). The middle and right
cross product maps are isomorphisms by the case B = ∅ since H
k
(Y; R) is a ﬁnitely
generated free R module if H
k
(Y, y
0
; R) is. The ﬁvelemma then implies that the
lefthand cross product map is an isomorphism as well. L¦
The relative cross product for pairs (X, x
0
) and (Y, y
0
) gives a reduced cross
product
`
H
∗
(X; R) ⊗
R
`
H
∗
(Y; R)
×
→
`
H
∗
(X ∧Y; R)
where X∧Y is the smash product X×Y/(X×¦y
0
¦∪¦x
0
¦×Y). The preceding theorem
implies that this reduced cross product is an isomorphism if
`
H
∗
(X; R) or
`
H
∗
(Y; R)
is free and ﬁnitely generated in each dimension. For example, we have isomorphisms
`
H
n
(X; R) ≈
`
H
n+k
(X ∧S
k
; R) via cross product with a generator of H
k
(S
k
; R) ≈ R. The
space X∧S
k
is the k fold reduced suspension Σ
k
X of X, so we see that the suspension
isomorphisms
`
H
n
(X; R) ≈
`
H
n+k
(Σ
k
X; R) which exist by elementary exact sequence
arguments can also be obtained via cross product with a generator of
`
H
∗
(S
k
; R).
Spaces with Polynomial Cohomology
We saw in Theorem 3.11 that RP
∞
, CP
∞
, and HP
∞
have cohomology rings which
are polynomial algebras. We will describe now a construction for enlarging S
2n
to
a space J(S
2n
) whose cohomology ring H
∗
(J(S
2n
); Z) is almost the polynomial ring
Z[x] on a generator x of dimension 2n. And with Q coefﬁcients, H
∗
(J(S
2n
); Q) is
exactly the polynomial ring Q[x]. This construction, known as the James reduced
product, is also of interest because of its connections with loopspaces, described in
§4.I.
For a space X, let X
k
be the product of k copies of X. From the disjoint union
¸
k≥1
X
k
, let us form a quotient space J(X) by identifying (x
1
, ··· , x
i
, ··· , x
k
) with
(x
1
, ··· , x
i
, ··· , x
k
) if x
i
= e, a chosen basepoint of X. Points of J(X) can thus
be thought of as k tuples (x
1
, ··· , x
k
), k ≥ 0, with no x
i
= e. Inside J(X) is the
subspace J
m
(X) consisting of the points (x
1
, ··· , x
k
) with k ≤ m. This can be
viewed as a quotient space of X
m
under the identiﬁcations (x
1
, ··· , x
i
, e, ··· , x
m
) ∼
(x
1
, ··· , e, x
i
, ··· , x
m
). For example, J
1
(X) = X and J
2
(X) = X×X/(x, e) ∼ (e, x).
If X is a CW complex with e a 0 cell, the quotient map X
m
→J
m
(X) glues together
the m subcomplexes of the product complex X
m
where one coordinate is e. These
glueings are by homeomorphisms taking cells onto cells, so J
m
(X) inherits a CW
structure from X
m
. There are natural inclusions J
m
(X) ⊂ J
m+1
(X) as subcomplexes,
and J(X) is the union of these subcomplexes, hence is also a CW complex.
222 Chapter 3. Cohomology
Proposition 3.21. For n > 0, H
∗
¸
J(S
n
); Z
consists of a Z in each dimension a
multiple of n. If n is even, the i
th
power of a generator of H
n
¸
J(S
n
); Z
is i! times
a generator of H
in
¸
J(S
n
); Z
, for each i ≥ 1. If n is odd H
∗
¸
J(S
n
); Z
is isomorphic
as a graded ring to H
∗
(S
n
; Z)⊗H
∗
¸
J(S
2n
); Z
.
Thus for n even, H
∗
¸
J(S
n
); Z
can be identiﬁed with the subring of the polyno
mial ring Q[x] additively generated by the monomials x
i
/i! . This subring is called a
divided polynomial algebra, and is denoted by Γ
Z
[x].
Proof: Giving S
n
its usual CW structure, the resulting CW structure on J(S
n
) con
sists of exactly one cell in each dimension a multiple of n. Thus if n > 1 we deduce
immediately from cellular cohomology that H
∗
¸
J(S
n
); Z
consists exactly of Z’s in
dimensions a multiple of n. An alternative argument which works also when n = 1
is the following. Consider the quotient map q : (S
n
)
m
→J
m
(S
n
). This carries each
cell of (S
n
)
m
homeomorphically onto a cell of J
m
(S
n
). In particular q is a cellular
map, taking k skeleton to k skeleton for each k, so q induces a chain map of cellular
chain complexes. This chain map is surjective since each cell of J
m
(S
n
) is the homeo
morphic image of a cell of (S
n
)
m
. Hence all the cellular boundary maps for J
m
(S
n
)
will be trivial if the same is true for (S
n
)
m
, which it must be in order for H
∗
¸
(S
n
)
m
; Z
to have the structure given by Theorem 3.15.
Since q maps each of the m n cells of (S
n
)
m
homeomorphically onto the n cell
of J
m
(S
n
), we see fromcellular cohomology that a generator α ∈ H
n
¸
J
m
(S
n
); Z
pulls
back by q
∗
to the sum α
1
+···+α
m
of the generators of H
n
¸
(S
n
)
m
; Z
corresponding
to the n cells of (S
n
)
m
. If n is even, the cup product structure in H
∗
¸
J(S
n
); Z
is
strictly commutative and H
∗
¸
(S
n
)
m
; Z
≈ Z[α
1
, ··· , α
m
]/(α
2
1
, ··· , α
2
m
). The power
α
m
then pulls back to (α
1
+··· +α
m
)
m
= m!α
1
··· α
m
, where the product α
1
··· α
m
generates H
mn
¸
(S
n
)
m
; Z
≈ Z. The map q is a homeomorphism from the mn cell of
(S
n
)
m
to the mn cell of J
m
(S
n
), so q
∗
is an isomorphismon H
mn
. This implies that
α
m
is m! times a generator of H
mn
¸
J
m
(S
n
); Z
. Since the cells of J(S
n
)−J
m
(S
n
) have
dimension at least (m+ 1)n, the inclusion J
m
(S
n
) ⊂ J(S
n
) induces isomorphisms
on H
i
for i ≤ mn. Thus if we let x
i
denote a generator of H
in
¸
J(S
n
); Z
, we have
x
m
1
= :m!x
m
for all m, and the sign can be made + by rechoosing x
m
if necessary.
The case n odd is similar and will be left as an exercise for the reader. L¦
In Γ
Z
[x] ⊂ Q[x], if we write x
i
for x
i
/i! , then the multiplicative structure is
given by x
i
x
j
=
i+j
i
x
i+j
. More generally, for a commutative ring R we could deﬁne
Γ
R
[x] to be the free R module with basis x
0
= 1, x
1
, x
2
, ··· and multiplication deﬁned
by x
i
x
j
=
i+j
i
x
i+j
. The preceding proposition implies that H
∗
¸
J(S
2n
); R
≈ Γ
R
[x].
When R = Q it is clear that Γ
Q
[x] is just Q[x]. However, for R = Z
p
with p prime
something quite different happens: There is an isomorphism
Γ
Z
p
[x] ≈ Z
p
[x
1
, x
p
, x
p
2 , ···]/(x
p
1
, x
p
p
, x
p
p
2
, ···) =
i≥0
Z
p
[x
p
i ]/(x
p
p
i
)
Section 3.2. Cup Product 223
as we show in §3.C, where we will also see that divided polynomial algebras are in a
certain sense dual to polynomial algebras.
The examples of projective spaces lead naturally to the following question: Given
a coefﬁcient ring R and an integer d > 0, is there a space X having H
∗
(X; R) ≈ R[α]
with α ∈ H
d
(X; R)? Historically, it took major advances in the theory to answer
this simplelooking question. Here is a
table giving all the possible values of
d for some of the most obvious and
important choices of R, namely Z, Q,
Z
2
, and Z
p
with p an odd prime. As
R d
Z 2, 4
Q any even number
Z
2
1, 2, 4
Z
p
any even divisor of 2(p −1)
we have seen, projective spaces give the examples for Z and Z
2
. Examples for Q
are the spaces J(S
d
), and examples for Z
p
are constructed in §3.H. Showing that
no other d’s are possible takes considerably more work. The fact that d must be
even when R ≠ Z
2
is a consequence of the commutativity property of cup product.
In Theorem 4L.9 and Corollary 4L.10 we will settle the case R = Z and show that d
must be a power of 2 for R = Z
2
and a power of p times an even divisor of 2(p −1)
for R = Z
p
, p odd. Ruling out the remaining cases is best done using K–theory, as
in [VBKT] or the classical reference [AdamsAtiyah]. However there is one slightly
anomalous case, R = Z
2
, d = 8, which must be treated by special arguments; see
[Toda63].
It is an interesting fact that for each even d there exists a CW complex X
d
which
is simultaneously an example for all the admissible choices of coefﬁcients R in the
table. Moreover, X
d
can be chosen to have the simplest CW structure consistent with
its cohomology, namely a single cell in each dimension a multiple of d. For example,
we may take X
2
= CP
∞
and X
4
= HP
∞
. The next space X
6
would have H
∗
(X
6
; Z
p
) ≈
Z
p
[α] for p = 7, 13, 19, 31, ···, primes of the form 3s + 1, the condition 6¦2(p − 1)
being equivalent to p = 3s +1. (By a famous theorem of Dirichlet there are inﬁnitely
many primes in any such arithmetic progression.) Note that, in terms of Z coefﬁcients,
X
d
must have the property that for a generator α of H
d
(X
d
; Z), each power α
i
is an
integer a
i
times a generator of H
di
(X
d
; Z), with a
i
≠ 0 if H
∗
(X
d
; Q) ≈ Q[α] and a
i
relatively prime to p if H
∗
(X
d
; Z
p
) ≈ Z
p
[α]. A construction of X
d
is given in [SSAT],
or in the original source [HoffmanPorter].
One might also ask about realizing the truncated polynomial ring R[α]/(α
n+1
),
in view of the examples provided by RP
n
, CP
n
, and HP
n
, leaving aside the trivial case
n = 1 where spheres provide examples. The analysis for polynomial rings also settles
which truncated polynomial rings are realizable; there are just a few more than for
the full polynomial rings.
There is also the question of realizing polynomial rings R[α
1
, ··· , α
n
] with gen
erators α
i
in speciﬁed dimensions d
i
. Since R[α
1
, ··· , α
m
]⊗
R
R[β
1
, ··· , β
n
] is equal
to R[α
1
, ··· , α
m
, β
1
, ··· , β
n
], the product of two spaces with polynomial cohomology
224 Chapter 3. Cohomology
is again a space with polynomial cohomology, assuming the number of polynomial
generators is ﬁnite in each dimension. For example, the n fold product (CP
∞
)
n
has
H
∗
¸
(CP
∞
)
n
; Z
≈ Z[α
1
, ··· , α
n
] with each α
i
2 dimensional. Similarly, products of
the spaces J(S
d
i
) realize all choices of even d
i
’s with Q coefﬁcients.
However, with Z and Z
p
coefﬁcients, products of onevariable examples do not
exhaust all the possibilities. As we show in §4.D, there are three other basic examples
with Z coefﬁcients:
1. Generalizing the space CP
∞
of complex lines through the origin in C
∞
, there is
the Grassmann manifold G
n
(C
∞
) of n dimensional vector subspaces of C
∞
, and
this has H
∗
(G
n
(C
∞
); Z) ≈ Z[α
1
, ··· , α
n
] with α
i
of dimension 2i. This space is
also known as BU(n), the ‘classifying space’ of the unitary group U(n). It is
central to the study of vector bundles and K–theory.
2. Replacing C by H, there is the quaternionic Grassmann manifold G
n
(H
∞
), also
known as BSp(n), the classifying space for the symplectic group Sp(n), with
H
∗
(G
n
(H
∞
); Z) ≈ Z[α
1
, ··· , α
n
] with α
i
of dimension 4i.
3. There is a classifying space BSU(n) for the special unitary group SU(n), whose
cohomology is the same as for BU(n) but with the ﬁrst generator α
1
omitted, so
H
∗
(BSU(n); Z) ≈ Z[α
2
, ··· , α
n
] with α
i
2i dimensional.
These examples and their products account for all the realizable polynomial cup prod
uct rings with Z coefﬁcients, according to a theorem in [AdamsWilkerson]. The situ
ation for Z
p
coefﬁcients is more complicated and will be discussed in §3.H.
Here is the evident general question along these lines:
The Realization Problem. Which graded commutative R algebras occur as cup prod
uct algebras H
∗
(X; R) of spaces X?
This is a difﬁcult problem, with the degree of difﬁculty depending strongly on the
coefﬁcient ring R. The most accessible case is R = Q, where essentially every graded
commutative Q algebra is realizable, as shown in [Quillen]. Next in order of difﬁculty
is R = Z
p
with p prime. This is much harder than the case of Q, and only partial
results, obtained with much labor, are known, mainly about realizing polynomial rings.
Finally there is R = Z, about which very little is known beyond what is implied by the
Z
p
cases.
Polynomial algebras are examples of free graded commutative algebras, where
‘free’ means loosely ‘having no unnecessary relations.’ In general, a free graded com
mutative algebra is a tensor product of singlegenerator free graded commutative
algebras. The latter are either polynomial algebras R[α] on evendimension gener
ators α or quotients R[α]/(2α
2
) with α odddimensional. Note that if R is a ﬁeld
then R[α]/(2α
2
) is either the exterior algebra Λ
R
[α] if the characteristic of R is not
2, or the polynomial algebra R[α] otherwise. Every graded commutative algebra is a
quotient of a free one, clearly.
Section 3.2. Cup Product 225
Example 3.22: Subcomplexes of the n Torus. To give just a small hint of the end
less variety of nonfree cup product algebras which can be realized, consider subcom
plexes of the n torus T
n
, the product of n copies of S
1
. Here we give S
1
its stan
dard minimal cell structure and T
n
the resulting product cell structure. We know
that H
∗
(T
n
; Z) is the exterior algebra Λ
Z
[α
1
, ··· , α
n
], with the monomial α
i
1
··· α
i
k
corresponding via cellular cohomology to the k cell e
1
i
1
× ··· ×e
1
i
k
. So if we pass to
a subcomplex X ⊂ T
n
by omitting certain cells, then H
∗
(X; Z) is the quotient of
Λ
Z
[α
1
, ··· , α
n
] obtained by setting the monomials corresponding to the omitted cells
equal to zero. Since we are dealing with rings, we are factoring out by an ideal in
Λ
Z
[α
1
, ··· , α
n
], the ideal generated by the monomials corresponding to the ‘minimal’
omitted cells, those whose boundary is entirely contained in X. For example, if we
take X to be the subcomplex of T
3
obtained by deleting the cells e
1
1
×e
1
2
×e
1
3
and
e
1
2
×e
1
3
, then H
∗
(X; Z) ≈ Λ
Z
[α
1
, α
2
, α
3
]/(α
2
α
3
).
How many different subcomplexes of T
n
are there? To each subcomplex X ⊂ T
n
we can associate a ﬁnite simplicial complex C
X
by the following procedure. View T
n
as the quotient of the n cube I
n
obtained by identifying opposite faces. If we inter
sect the cube I
n
⊂ R
n
with the hyperplane x
1
+ ··· + x
n
= ε for small ε > 0, we
get a simplex ∆
n−1
, and if q : I
n
→T
n
is the quotient map, then ∆
n−1
∩ q
−1
(X) is a
subcomplex C
X
of ∆
n−1
. The k cells of X correspond exactly to the (k−1) simplices
of C
X
. Clearly X is uniquely determined by C
X
, and it is easy to see that every sub
complex of ∆
n−1
occurs as C
X
for some subcomplex X of T
n
. Since every simplicial
complex with n vertices is a subcomplex of ∆
n−1
, we see that T
n
has quite a large
number of subcomplexes, if n is not too small. Of course, it may be that some of
the resulting cohomology rings H
∗
(X; Z) are isomorphic for different subcomplexes
X ⊂ T
n
. For example, one could just permute the factors of T
n
to change X with
out affecting its cohomology ring. Whether there are less trivial examples is a harder
algebraic problem.
Somewhat more elaborate examples could be produced by looking at subcom
plexes of the product of n copies of CP
∞
. In this case the cohomology rings are
isomorphic to polynomial rings modulo ideals generated by monomials. One could
also take subcomplexes of a product of S
1
’s and CP
∞
’s. However, this is still a whole
lot less complicated than the general case, where one takes free algebras modulo ide
als generated by arbitrary polynomials having all their terms of the same dimension.
Let us conclude this section with an example of a cohomology ring which is not
too far removed from a polynomial ring.
Example 3.23: CohenMacauley Rings. Consider the quotient space X = CP
∞
/CP
n−1
.
The quotient map CP
∞
→X induces an injection H
∗
(X; Z)→H
∗
(CP
∞
; Z) embedding
H
∗
(X; Z) in Z[α] as the subring generated by 1, α
n
, α
n+1
, ···. If we view this sub
ring as a module over Z[α
n
], it is free with basis ¦1, α
n+1
, α
n+2
, ··· , α
2n−1
¦. Thus
226 Chapter 3. Cohomology
H
∗
(X; Z) is an example of a CohenMacauley ring: A ring which contains a polyno
mial subring over which it is a ﬁnitelygenerated free module. While polynomial cup
product rings are rather rare, CohenMacauley cup product rings occur much more
frequently.
Exercises
1. Assuming as known the cup product structure on the torus S
1
×S
1
, compute the
cup product structure in H
∗
(M
g
) for M
g
the closed orientable surface of genus g,
by using the quotient map from M
g
to a wedgesum of g tori, shown below.
2. Using the cup product H
k
(X, A; R)×H
(X, B; R)→H
k+
(X, A ∪ B; R), show that
if X is the union of contractible open subsets A and B, then all cup products of
positivedimensional classes in H
∗
(X; R) are zero. This applies in particular if X is
a suspension. Generalize to the situation that X is the union of n contractible open
subsets, to showthat all n fold cup products of positivedimensional classes are zero.
3. (a) Using the cup product structure, show there is no map RP
n
→RP
m
inducing
a nontrivial map H
1
(RP
m
; Z
2
)→H
1
(RP
n
; Z
2
) if n > m. What is the corresponding
result for maps CP
n
→CP
m
?
(b) Prove the BorsukUlam theorem by the following argument. Suppose on the con
trary that f : S
n
→R
n
satisﬁes f(x) ≠ f(−x) for all x. Then deﬁne g : S
n
→S
n−1
by
g(x) =
¸
f(x) − f(−x)
/¦f(x) − f(−x)¦, so g(−x) = −g(x) and g induces a map
RP
n
→RP
n−1
. Show that part (a) applies to this map.
4. Apply the Lefschetz ﬁxed point theorem to show that every map f : CP
n
→CP
n
has
a ﬁxed point if n is even, using the fact that f
∗
: H
∗
(CP
n
; Z)→H
∗
(CP
n
; Z) is a ring
homomorphism. When n is odd show there is a ﬁxed point unless f
∗
(α) = −α, for
α a generator of H
2
(CP
n
; Z). [See Exercise 2 in §2.C for an example of a map without
ﬁxed points in this exceptional case.]
5. Compute the ring structure in H
∗
(RP
∞
; Z
4
) and more generally H
∗
(RP
∞
; Z
m
).
6. Use cup products to compute the map H
∗
(CP
n
; Z)→H
∗
(CP
n
; Z) induced by the
map CP
n
→CP
n
which is a quotient of the map C
n+1
→C
n+1
raising each coordinate
to the d
th
power, (z
0
, ··· , z
n
)
(z
d
0
, ··· , z
d
n
), for a ﬁxed integer d > 0. [First do the
case n = 1.]
7. Use cup products to show that RP
3
is not homotopy equivalent to RP
2
∨S
3
.
8. Let X be CP
2
with a cell e
3
attached by a map S
2
→CP
1
⊂ CP
2
of degree p, and
let Y = M(Z
p
, 2) ∨S
4
. Thus X and Y have the same 3 skeleton but differ in the way
Section 3.2. Cup Product 227
their 4 cells are attached. Show that X and Y have isomorphic cohomology rings
with Z coefﬁcients but not with Z
p
coefﬁcients.
9. Show that if H
n
(X; Z) is ﬁnitely generated and free for each n, then H
∗
(X; Z
p
) ≈
H
∗
(X; Z)⊗Z
p
as rings, so in particular the ring structure with Z coefﬁcients deter
mines the ring structure with Z
p
coefﬁcients.
10. Show that the cross product map H
∗
(X; Z)⊗H
∗
(Y; Z)→H
∗
(X×Y; Z) is not an
isomorphism if X and Y are inﬁnite discrete sets. [This shows the necessity of the
ﬁnitegeneration hypothesis in Theorem 3.15.]
11. Using cup products, show that a map S
k+
→S
k
×S
must induce the trivial ho
momorphism H
k+
(S
k+
)→H
k+
(S
k
×S
).
12. Show that the spaces (S
1
×CP
∞
)/(S
1
×¦x
0
¦) and S
3
×CP
∞
have isomorphic coho
mology rings with Z or any other coefﬁcients. [An exercise for §4.L is to show these
two spaces are not homotopy equivalent.]
13. Describe H
∗
(CP
∞
/CP
1
; Z) as a ring with ﬁnitely many multiplicative generators.
How does this ring compare with H
∗
(S
6
×HP
∞
; Z)?
14. Let q : RP
∞
→CP
∞
be the natural quotient map obtained by regarding both spaces
as quotients of S
∞
, modulo multiplication by real scalars in one case and complex
scalars in the other. Show that the induced map q
∗
: H
∗
(CP
∞
; Z)→H
∗
(RP
∞
; Z) is sur
jective in even dimensions by showing ﬁrst by a geometric argument that the restric
tion q : RP
2
→CP
1
induces a surjection on H
2
and then appealing to cup product struc
tures. Next, forma quotient space X of RP
∞
ICP
n
by identifying each point x ∈ RP
2n
with q(x) ∈ CP
n
. Show there are ring isomorphisms H
∗
(X; Z) ≈ Z[α]/(2α
n+1
) and
H
∗
(X; Z
2
) ≈ Z
2
[α, β]/(β
2
− α
n+1
), where α has dimension 2 and β has dimension
2n+1. Make a similar construction and analysis for the quotient map q : CP
∞
→HP
∞
.
15. For a ﬁxed coefﬁcient ﬁeld F , deﬁne the Poincar´e series of a space X to be
the formal power series p(t) =
¸
i
a
i
t
i
where a
i
is the dimension of H
i
(X; F) as a
vector space over F , assuming this dimension is ﬁnite for all i. Show that p(X×Y) =
p(X)p(Y). Compute the Poincar´e series for S
n
, RP
n
, RP
∞
, CP
n
, CP
∞
, and the spaces
in the preceding three exercises.
16. Show that if X and Y are ﬁnite CW complexes such that H
∗
(X; Z) and H
∗
(Y; Z)
contain no elements of order a power of a given prime p, then the same is true for
X×Y . [Apply Theorem 3.15 with coefﬁcients in various ﬁelds.]
17. Show that H
∗
(J(S
n
); Z) for n odd is the tensor product of an exterior algebra on
an n dimensional generator with a divided polynomial algebra on a 2n dimensional
generator.
18. For the closed orientable surface M of genus g ≥ 1, show that for each nonzero
α ∈ H
1
(M; Z) there exists β ∈ H
1
(M; Z) with αβ ≠ 0. Deduce that M is not homotopy
equivalent to a wedge sum X∨Y of CW complexes with nontrivial reduced homology.
Do the same for closed nonorientable surfaces using cohomology with Z
2
coefﬁcients.
228 Chapter 3. Cohomology
Algebraic topology is most often concerned with properties of spaces which de
pend only on homotopy type, so local topological properties do not play much of
a role. Digressing somewhat from this viewpoint, in this section we study a class
of spaces whose most prominent feature is their local topology, namely manifolds,
which are locally homeomorphic to R
n
. It is somewhat miraculous that just this lo
cal homegeneity property, together with global compactness, is enough to impose a
strong symmetry on the homology and cohomology groups of such spaces, as well
as strong nontriviality of cup products. This is the Poincar´e duality theorem, one of
the earliest theorems in the subject. In fact, Poincar´e’s original work on the duality
property came before homology and cohomology had even been properly deﬁned,
and it took many years for the concepts of homology and cohomology to be reﬁned
sufﬁciently to put Poincar´e duality on a ﬁrm footing.
Let us proceed nowto deﬁnitions. A manifold of dimension n, or more concisely
an n manifold, is a Hausdorff space M in which each point has an open neighborhood
homeomorphic to R
n
. The dimension of M is intrinsically characterized by the fact
that for x ∈ M, the local homology group H
i
(M, M−¦x¦; Z) is nonzero only for i = n,
namely H
i
(M, M−¦x¦; Z) ≈ H
i
(R
n
, R
n
−¦0¦; Z) by excision, and H
i
(R
n
, R
n
−¦0¦; Z) ≈
`
H
i−1
(R
n
−¦0¦; Z) ≈
`
H
i−1
(S
n−1
; Z) since R
n
is contractible and R
n
−¦0¦ deformation
retracts onto S
n−1
.
A compact manifold is called closed, to distinguish it from the more general
notion of a compact manifold with boundary which will be considered later in this
section. For example S
n
is obviously a closed manifold, as are RP
n
and lens spaces
since they have S
n
as a covering space. Complex and quaternionic projective spaces
are also closed manifolds. For example, CP
n
is compact since it is a quotient space of
S
2n+1
, and the manifold property is satisﬁed since CP
n
has an open cover consisting
of the sets U
i
= ¦ [z
0
, ··· , z
n
] ∈ CP
n
¦ z
i
= 1¦ each of which is homeomorphic to
R
2n
. Further examples of closed manifolds can be generated from these using the
obvious fact that the product of closed manifolds of dimensions m and n is a closed
manifold of dimension m+n.
Poincar´e duality in its most primitive form asserts that for a closed orientable
manifold M of dimension n, there are isomorphisms H
k
(M; Z) ≈ H
n−k
(M; Z) for
all k. Implicit here is the convention that homology and cohomology groups of nega
tive dimension are zero, so all the nontrivial homology and cohomology of M lies in
the dimension range from 0 to n. The deﬁnition of ‘orientable’ will be given below.
Without the orientability hypothesis there is a weaker statement that H
k
(M; Z
2
) ≈
H
n−k
(M; Z
2
) for all k. As we show in Corollaries A.8 and A.9 in the Appendix, the
Section 3.3. Poincar´e Duality 229
homology groups of a closed manifold are all ﬁnitely generated. So via the univer
sal coefﬁcient theorem, Poincar´e duality for a closed orientable n manifold M can
be stated just in terms of homology: Modulo their torsion subgroups, H
k
(M; Z) and
H
n−k
(M; Z) are isomorphic, and the torsion subgroups of H
k
(M; Z) and H
n−k−1
(M; Z)
are isomorphic. However, the statement in terms of cohomology is really more natu
ral.
Poincar´e duality thus expresses a certain symmetry in the homology of closed
orientable manifolds. For example, consider the n dimensional torus T
n
, the product
of n circles. By induction on n it follows from the K¨ unneth formula, or from the
easy special case H
i
(X×S
1
; Z) ≈ H
i
(X; Z)⊕H
i−1
(X; Z) which was an exercise in §2.2,
that H
k
(T
n
; Z) is isomorphic to the sum of
n
k
copies of Z. So Poincar´e duality
is reﬂected in the relation
n
k
=
n
n−k
. The reader might also check that Poincar´e
duality is consistent with our calculations of the homology of projective spaces and
lens spaces, which are all orientable except for RP
n
with n even.
For many manifolds there is a very nice geometric proof of Poincar´e duality using
the notion of dual cell structures. The germ of this idea can be traced back to the ﬁve
regular Platonic solids: the tetrahedron, cube, octahedron, dodecahedron, and icosa
hedron. Each of these polyhedra has a dual polyhedron whose vertices are the center
points of the faces of the given polyhedron. Thus the dual of the cube is the octahe
dron, and vice versa. Similarly the dodecahedron and icosahedron are dual to each
other, and the tetrahedron is its own dual. One can regard each of these polyhedra
as deﬁning a cell structure C on S
2
with a dual cell structure C
∗
determined by the
dual polyhedron. Each vertex of C lies in a dual 2 cell of C
∗
, each edge of C crosses
a dual edge of C
∗
, and each 2 cell
of C contains a dual vertex of C
∗
.
The ﬁrst ﬁgure at the right shows
the case of the cube and octahe
dron. There is no need to restrict
to regular polyhedra here, and we
can generalize further by replacing S
2
by any surface. A portion of a moreorless
random pair of dual cell structures is shown in the second ﬁgure above. On the torus,
if we lift a dual pair of cell structures to the universal cover R
2
, we get a dual pair of
periodic tilings of the plane, as in the next three ﬁgures.
The standard CWstructure on the surface of genus g, obtained froma 4g gon by iden
230 Chapter 3. Cohomology
tifying edges via the product of commutators [a
1
, b
1
] ··· [a
g
, b
g
], is homeomorphic
to its own dual:
Given a pair of dual cell structures C and C
∗
on a closed surface M, the pair
ing of cells with dual cells gives identiﬁcations of cellular chain groups C
∗
0
= C
2
,
C
∗
1
= C
1
, and C
∗
2
= C
0
. If we use Z coefﬁcients these identiﬁcations are not quite
canonical since there is an ambiguity of sign for each cell, the choice of a generator
for the corresponding Z summand of the cellular chain complex. We can avoid this
ambiguity by considering the simpler situation of Z
2
coefﬁcients, where the identiﬁ
cations C
i
= C
∗
2−i
are completely canonical. The key observation now is that under
these identiﬁcations, the cellular boundary map ∂ : C
i
→C
i−1
becomes the cellular
coboundary map δ: C
∗
2−i
→C
∗
2−i+1
since ∂ assigns to a cell the sum of the cells which
are its faces while δ assigns to a cell the sum of the cells of which it is a face. Thus
H
i
(C; Z
2
) ≈ H
2−i
(C
∗
; Z
2
), and hence H
i
(M; Z
2
) ≈ H
2−i
(M; Z
2
) since C and C
∗
are
cell structures on the same surface M.
To reﬁne this argument to Z coefﬁcients the problemof signs must be addressed.
After analyzing the situation more closely, one sees that if M is orientable, it is pos
sible to make consistent choices of orientations of all the cells of C and C
∗
so that
the boundary maps in C agree with the coboundary maps in C
∗
, and therefore one
gets H
i
(C; Z) ≈ H
2−i
(C
∗
; Z), hence H
i
(M; Z) ≈ H
2−i
(M; Z).
For manifolds of higher dimension the situation is entirely analogous. One would
consider dual cell structures C and C
∗
on a closed n manifold M, each i cell of C
being dual to a unique (n−i) cell of C
∗
which it intersects in one point ‘transversely.’
For example on the 3 dimensional torus S
1
×S
1
×S
1
one could take the standard cell
structure which lifts to the decomposition of the universal cover R
3
into cubes with
vertices at the integer lattice points Z
3
, and then the dual cell structure is obtained
by translating this by the vector (
1
/
2
,
1
/
2
,
1
/
2
). Each edge then has a dual 2 cell which
it pierces orthogonally, and each vertex lies in a dual 3 cell.
All the manifolds one commonly meets, for example all differentiable manifolds,
have dually paired cell structures with the properties needed to carry out the proof
of Poincar´e duality we have just sketched. However, to construct these cell structures
requires a certain amount of manifold theory. To avoid this, and to get a theorem
which applies to all manifolds, we shall take a completely different approach, using
algebraic topology to replace the geometry of dual cell structures.
Section 3.3. Poincar´e Duality 231
Orientations and Homology
Let us consider the question of how one might deﬁne orientability for manifolds.
First there is the local question: What is an orientation of R
n
? Whatever an orientation
of R
n
is, it should have the property that it is preserved under rotations and reversed
by reﬂections. For example, in R
2
the notions of ‘clockwise’ and ‘counterclockwise’
certainly have this property, as do ‘righthanded’ and ‘lefthanded’ in R
3
. We shall
take the viewpoint that this property is what characterizes orientations, so anything
satisfying the property can be regarded as an orientation.
With this in mind, we propose the following as an algebraictopological deﬁnition:
An orientation of R
n
at a point x is a choice of generator of the inﬁnite cyclic group
H
n
(R
n
, R
n
−¦x¦), where the absence of a coefﬁcient group from the notation means
that we take coefﬁcients in Z. To verify that the characteristic property of orienta
tions is satisﬁed we use the isomorphisms H
n
(R
n
, R
n
− ¦x¦) ≈ H
n−1
(R
n
− ¦x¦) ≈
H
n−1
(S
n−1
) where S
n−1
is a sphere centered at x. Since these isomorphisms are nat
ural, and rotations of S
n−1
have degree 1 (they are homotopic to the identity) while
reﬂections have degree −1, we see that a rotation ρ of R
n
ﬁxing x takes a generator
α of H
n
(R
n
, R
n
−¦x¦) to itself, meaning that ρ
∗
(α) = α, while a reﬂection takes α
to −α.
Note that with this deﬁnition, an orientation of R
n
at a point x determines an
orientation at every other point y via the canonical isomorphisms H
n
(R
n
, R
n
−¦x¦) ≈
H
n
(R
n
, R
n
−B) ≈ H
n
(R
n
, R
n
−¦y¦) where B is any ball containing both x and y.
An advantage of this deﬁnition of local orientation is that it can be applied to any
n dimensional manifold M. Thus we deﬁne a local orientation of M at a point x to
be a choice of generator µ
x
of the inﬁnite cyclic group H
n
(M, M −¦x¦).
Notational Convention: In what follows we will very often be looking at homology
groups of the form H
n
(X, X − A). To simplify notation we will write H
n
(X, X − A)
as H
n
(X¦
¦A), or more generally H
n
(X¦
¦A; G) if a coefﬁcient group G needs to be
speciﬁed. By excision, H
n
(X¦
¦A) depends only on a neighborhood of A in X, so it
makes sense to view H
n
(X¦
¦A) as local homology of X at A.
Having settled what local orientations at points of a manifold are, a global orien
tation ought to be ‘a consistent choice of local orientations at all points.’ We make this
precise by the following deﬁnition. An orientation of an n dimensional manifold M
is a function x
µ
x
assigning to each x ∈ M a local orientation µ
x
∈ H
n
(M¦
¦x), sat
isfying the ‘local consistency’ condition that each x ∈ M has a neighborhood R
n
⊂ M
containing an open ball B of ﬁnite radius about x such that all the local orientations
µ
y
at points y ∈ B are the images of one generator µ
B
of H
n
(M¦
¦B) ≈ H
n
(R
n
¦
¦B)
under the natural maps H
n
(M¦
¦B)→H
n
(M¦
¦y). If an orientation exists for M, then
M is called orientable.
Every manifold M has a twosheeted covering space
M which is orientable. For
232 Chapter 3. Cohomology
example, RP
2
is covered by S
2
, and the Klein bottle has the torus as a twosheeted
covering space. The general construction goes as follows. As a set, let
M = ¦ µ
x
¦ x ∈ M and µ
x
is a local orientation of M at x ¦.
The map µ
x
x deﬁnes a twotoone surjection
M→M, and we wish to topologize
M to make this a covering space projection. Given an open ball B ⊂ R
n
⊂ M of ﬁnite
radius and a generator µ
B
∈ H
n
(M¦
¦B), let U(µ
B
) be the set of all µ
x
∈
M such that
x ∈ B and µ
x
is the image of µ
B
under the natural map H
n
(M¦
¦B)→H
n
(M¦
¦x). It is
easy to check that these sets U(µ
B
) form a basis for a topology on
M, and that the
projection
M→M is a covering space. The manifold
M is orientable since each point
µ
x
∈
M has a canonical local orientation given by the element ` µ
x
∈ H
n
(
M¦
¦µ
x
) cor
responding to µ
x
under the isomorphisms H
n
(
M¦
¦µ
x
) ≈ H
n
(U(µ
B
)¦
¦µ
x
) ≈ H
n
(B¦
¦x),
and by construction these local orientations satisfy the local consistency condition
necessary to deﬁne a global orientation.
Proposition 3.24. If M is connected, then M is orientable iff
M has two components.
In particular, M is orientable if it is simplyconnected, or more generally if π
1
(M)
has no subgroup of index two.
The ﬁrst statement is a formulation of the popular notion of nonorientability as
being able to go around some closed loop and come back with the opposite orientation,
since in terms of the covering space
M→M this corresponds to a loop in M which
lifts to a path in
M connecting two distinct points with the same image in M. The
existence of such paths is equivalent to
M being connected.
Proof: If M is connected,
M has either one or two components since it is a twosheeted
covering space of M. If it has two components, they are each mapped homeomorphi
cally to M by the covering projection, so M is orientable, being homeomorphic to
a component of the orientable manifold
M. Conversely, if M is orientable, it has
exactly two orientations since it is connected, and each of these orientations deﬁnes
a component of
M. The last statement of the proposition follows since connected
twosheeted covering spaces of M correspond to indextwo subgroups of π
1
(M), by
the classiﬁcation of covering spaces. L¦
The covering space
M→M can be embedded in a larger covering space M
Z
→M
where M
Z
consists of all elements α
x
∈ H
n
(M¦
¦x) as x ranges over M. As before
we topologize M
Z
via the basis of sets U(α
B
) consisting of α
x
’s with x ∈ B and α
x
the image of an element α
B
∈ H
n
(M¦
¦B) under the map H
n
(M¦
¦B)→H
n
(M¦
¦x). The
covering space M
Z
→M is inﬁnitesheeted since for ﬁxed x ∈ M the α
x
’s range over
the inﬁnite cyclic group H
n
(M¦
¦x). Restricting α
x
to be zero, we get a copy M
0
of M
in M
Z
. The rest of M
Z
consists of an inﬁnite sequence of copies M
k
of
M, k = 1, 2, ···,
where M
k
consists of the α
x
’s which are k times either generator of H
n
(M¦
¦x).
Section 3.3. Poincar´e Duality 233
A continuous map M→M
Z
of the form x
α
x
∈ H
n
(M¦
¦x) is called a section
of the covering space. An orientation of M is the same thing as a section x
µ
x
such that µ
x
is a generator of H
n
(M¦
¦x) for each x.
One can generalize the deﬁnition of orientation by replacing the coefﬁcient group
Z by any commutative ring R with identity. Then an R orientation of M assigns to
each x ∈ M a generator of H
n
(M¦
¦x; R) ≈ R, subject to the corresponding local
consistency condition, where a ‘generator’ of R is an element u such that Ru = R.
Since we assume R has an identity element, this is equivalent to u being a unit,
i.e., an invertible element of R. The deﬁnition of the covering space M
Z
generalizes
immediately to a covering space M
R
→M, and an R orientation is a section of this
covering space whose value at each x ∈ M is a generator of H
n
(M¦
¦x; R).
The structure of M
R
is easy to describe. In view of the canonical isomorphism
H
n
(M¦
¦x; R) ≈ H
n
(M¦
¦x)⊗R, each r ∈ R determines a subcovering space M
r
of M
R
consisting of the points :µ
x
⊗r ∈ H
n
(M¦
¦x; R) for µ
x
a generator of H
n
(M¦
¦x). If
r has order 2 in R then r = −r so M
r
is just a copy of M, and otherwise M
r
is
isomorphic to the twosheeted cover
M. The covering space M
R
is the union of these
M
r
’s, which are disjoint except for the equality M
r
= M
−r
.
In particular we see that an orientable manifold is R orientable for all R, while
a nonorientable manifold is R orientable iff R contains a unit of order 2, which is
equivalent to having 2 = 0 in R. Thus every manifold is Z
2
orientable. In practice
this means that the two most important cases are R = Z and R = Z
2
. In what follows
the reader should keep these two cases foremost in mind, but we will usually state
results for a general R.
The orientability of a closed manifold is reﬂected in the structure of its homology,
according to the following result.
Theorem 3.25. Let M be a closed connected n manifold. Then:
(a) If M is R orientable, the map H
n
(M; R)→H
n
(M¦
¦x; R) ≈ R is an isomorphism
for all x ∈ M.
(b) If M is not R orientable, the map H
n
(M; R)→H
n
(M¦
¦x; R) ≈ R is injective with
image ¦ r ∈ R ¦ 2r = 0¦ for all x ∈ M.
(c) H
i
(M; R) = 0 for i > n.
In particular, H
n
(M; Z) is Z or 0 depending on whether M is orientable or not,
and in either case H
n
(M; Z
2
) = Z
2
.
An element of H
n
(M; R) whose image in H
n
(M¦
¦x; R) is a generator for all x is
called a fundamental class for M with coefﬁcients in R. By the theorem, a funda
mental class exists if M is closed and R orientable. The converse is also true. For
let µ ∈ H
n
(M; R) be a fundamental class and let µ
x
denote its image in H
n
(M¦
¦x; R).
The function x
µ
x
is then an R orientation, since the map H
n
(M; R)→H
n
(M¦
¦x; R)
factors through H
n
(M¦
¦B; R) for B any open ball in M. Furthermore, M must be com
234 Chapter 3. Cohomology
pact since µ
x
can only be nonzero for x in the compact set in M which is the image
of a cycle representing µ. In view of these remarks a fundamental class could also be
called an orientation class for M.
The theorem will follow fairly easily from a more technical statement:
Lemma 3.26. Let M be a manifold of dimension n and let A ⊂ M be a compact
subset. Then:
(a) H
i
(M¦
¦A; R) = 0 for i > n, and a class in H
n
(M¦
¦A; R) is zero iff its image in
H
n
(M¦
¦x; R) is zero for all x ∈ A.
(b) If x
α
x
is a section of the covering space M
R
→M, then there is a unique class
α
A
∈ H
n
(M¦
¦A; R) whose image in H
n
(M¦
¦x; R) is α
x
for all x ∈ A.
To deduce the theorem from this, choose A = M, a compact set by assumption.
Then (c) of the theorem is immediate. To obtain (a) and (b) of the theorem, let Γ be
the set of sections of M
R
→M. The sum of two sections is a section, and a scalar
multiple of a section is a section, so Γ is an R module. There is a homomorphism
H
n
(M; R)→Γ sending a class α to the section x
α
x
, where α
x
is the image of α
under the map H
n
(M; R)→H
n
(M¦
¦x; R). The lemma asserts that this homomorphism
is an isomorphism. If M is connected, each section is uniquely determined by its value
at one point, so the remaining statements of the theoremare apparent fromthe earlier
discussion of the structure of M
R
. L¦
Proof of 3.26: The coefﬁcient ring R will play no special role in the argument so we
shall omit it from the notation. Note that the uniqueness part of (b) follows from (a).
We break the proof up into several steps.
(1) First we observe that if the lemma is true for compact sets A, B, and A∩B then
it is true for A∪B. To see this, consider the MayerVietoris sequence:
0 →H
n
(M¦
¦A∪B)
Φ
→H
n
(M¦
¦A) ⊕ H
n
(M¦
¦B)
Ψ
→H
n
(M¦
¦A∩B)
Here the zero on the left comes from the assumption that H
n+1
(M¦
¦A∩B) = 0. The
map Φ is Φ(α) = (α, −α) and Ψ is Ψ(α, β) = α + β, where we omit notation for
maps on homology induced by inclusion. The terms H
i
(M¦
¦A∪B) farther to the left
in this sequence are sandwiched between groups which are zero by assumption, so
H
i
(M¦
¦A∪B) = 0 for i > n. If a class α ∈ H
n
(M¦
¦A∪B) has image zero in H
n
(M¦
¦x)
for all x ∈ A ∪ B, its images in H
n
(M¦
¦A) and H
n
(M¦
¦B) have the same property,
hence are zero by hypothesis, so α itself must be zero since Φ is injective. This
gives (a). For (b), if x
α
x
is a section, the hypothesis gives classes α
A
∈ H
n
(M¦
¦A)
and α
B
∈ H
n
(M¦
¦B) having image α
x
for all x in A or B respectively. The images of
α
A
and α
B
in H
n
(M¦
¦A∩B) then satisfy the deﬁning property of α
A∩B
, hence must
equal α
A∩B
. Exactness of the sequence then implies that (α
A
, −α
B
) = Φ(α
A∪B
) for
Section 3.3. Poincar´e Duality 235
some α
A∪B
∈ H
n
(M¦
¦A∪B). This means that α
A∪B
maps to α
A
and α
B
, so α
A∪B
has
image α
x
for all x ∈ A∪B since α
A
and α
B
have this property.
(2) Next we reduce to the case M = R
n
. A compact set A ⊂ M can be written as the
union of ﬁnitely many compact sets A
1
, ··· , A
m
each contained in an open R
n
⊂ M.
We apply the result in (1) to A
1
∪··· ∪A
m−1
and A
m
. The intersection of these two
sets is (A
1
∩A
m
) ∪··· ∪(A
m−1
∩A
m
), a union of m−1 compact sets each contained
in an open R
n
⊂ M. By induction on m this reduces us to the case m= 1, where by
excision we may replace M by the neighborhood R
n
⊂ M.
(3) When M = R
n
and A is a ﬁnite simplicial complex K with simplices linearly
embedded in R
n
, the result follows by induction on the number of open simplices of
K, i.e., cells of K viewed as a CW complex, using (1) along with the easy case that K
is a single simplex.
(4) For an arbitrary compact set A ⊂ R
n
let α ∈ H
i
(R
n
¦
¦A) be represented by a relative
cycle z, and let C ⊂ R
n
− A be the union of the images of the singular simplices in
∂z. Since C is compact, it has a positive distance δ from A. Choose a large simplex
∆
n
⊂ R
n
containing A, and subdivide ∆
n
, say by repeated barycentric subdivision,
so that all the simplices of the subdivision have diameter less than δ. Let K be the
union of all the simplices of this subdivision which meet A, so K is a ﬁnite simplicial
complex containing A and disjoint from C. The relative cycle z deﬁnes an element
α
K
∈ H
i
(R
n
¦
¦K) mapping to the given α ∈ H
i
(R
n
¦
¦A). If i > n then by (3) we have
H
i
(R
n
¦
¦K) = 0, so α
K
= 0, which implies α = 0 and hence H
i
(R
n
¦
¦A) = 0. If i = n
and α
x
is zero in H
n
(R
n
¦
¦x) for all x ∈ A then in fact this holds for all x ∈ K, where
α
x
in this case means the image of α
K
. This is because K is a union of simplices
σ meeting A and H
n
(R
n
¦
¦σ)→H
n
(R
n
¦
¦x) is an isomorphism for all x ∈ σ . Since
α
x
= 0 for all x ∈ K, (3) then says that α
K
is zero, hence also α, so (a) is ﬁnished.
The existence statement in (b) for M = R
n
is obvious — just take a large ball B ⊃ A
and use the fact that H
n
(R
n
¦
¦B)→H
n
(R
n
¦
¦x) is an isomorphism for all x ∈ B. L¦
For a closed n manifold having the structure of a ∆ complex there is a more
explicit construction for a fundamental class. Consider the case of Z coefﬁcients
for example. In simplicial homology a fundamental class must be represented by
some linear combination
¸
i
k
i
σ
i
of the n simplices σ
i
of M. The condition that the
fundamental class maps to a generator of H
n
(M¦
¦x; Z) for points x in the interiors of
the σ
i
’s means that each coefﬁcient k
i
must be :1. The k
i
’s must also be such that
¸
i
k
i
σ
i
is a cycle. This implies that if σ
i
and σ
j
share a common (n−1) dimensional
face, then k
i
determines k
j
and vice versa. Analyzing the situation more closely, one
can show that a choice of signs for the k
i
’s making
¸
i
k
i
σ
i
a cycle is possible iff
M is orientable, and if such a choice is possible, then the cycle
¸
i
k
i
σ
i
deﬁnes a
fundamental class. With Z
2
coefﬁcients there is no issue of signs, and
¸
i
σ
i
always
deﬁnes a fundamental class.
236 Chapter 3. Cohomology
We can also squeeze some information about H
n−1
(M) from the preceding the
orem:
Corollary 3.27. If M is a closed connected n manifold then the torsion subgroup of
H
n−1
(M; Z) is trivial if M is orientable and Z
2
if M is nonorientable.
Proof: This is an application of the universal coefﬁcient theorem for homology. By
Corollaries A.8 and A.9 in the Appendix the homology groups of M are ﬁnitely gener
ated. In the orientable case, if H
n−1
(M; Z) contained torsion, then for some prime p,
H
n
(M; Z
p
) would be larger than the Z
p
coming from H
n
(M; Z). In the nonorientable
case, Theorem 3.25 says that H
n
(M; Z
m
) is either Z
2
or 0 depending on whether m
is even or odd. This forces the torsion subgroup of H
n−1
(M; Z) to be Z
2
. L¦
The reader who is familiar with Bockstein homomorphisms, which are discussed
in §3.E, will recognize that the Z
2
in H
n−1
(M; Z) in the nonorientable case is the im
age of the Bockstein homomorphism H
n
(M; Z
2
)→H
n−1
(M; Z) coming from the short
exact sequence of coefﬁcient groups 0→Z→Z→Z
2
→0.
The structure of H
n
(M; G) and H
n−1
(M; G) for a closed connected n manifold
M can be explained very nicely in terms of cellular homology when M has a CW
structure with a single n cell, which is the case for a large number of manifolds.
(There can be no cells of higher dimension since a cell of maximal dimension pro
duces nontrivial local homology in that dimension.) Consider the cellular boundary
map d: C
n
(M)→C
n−1
(M) with Z coefﬁcients. Since M has a single n cell we have
C
n
(M) = Z. If M is orientable then d must be zero since H
n
(M; Z) = Z. Then since
d is zero, H
n−1
(M; Z) must be free. On the other hand, if M is nonorientable then d
must take a generator of C
n
(M) to twice a generator α of a Z summand of C
n−1
(M),
in order for H
n
(M; Z
p
) to be zero for odd primes p and Z
2
for p = 2. The cellular
chain α must be a cycle since 2α is a boundary and hence a cycle. It follows that the
torsion subgroup of H
n−1
(M; Z) must be a Z
2
generated by α.
Concerning the homology of noncompact manifolds there is the following general
statement.
Proposition 3.28. If M is a connected noncompact n manifold then H
i
(M; R) = 0
for i ≥ n.
Proof: Represent an element of H
i
(M; R) by a cycle z. This has compact image in M,
so there is an open set U ⊂ M containing the image of z and having compact closure
U ⊂ M. Let V = M − U. Part of the long exact sequence of the triple (M, U ∪ V, V)
ﬁts into a commutative diagram
M V U R H ( )
−−−−−→ −−−−−→
M (
−−−−−−−→
−−−−−→
−−−−−→
; , , R H ( ) ;
U R H ( ) ; R) ;
i 1 i
i
H
i
+
∪ V V U∪ , R H ( ) ;
i
V M
≈
Section 3.3. Poincar´e Duality 237
When i > n, the two groups on either side of H
i
(U ∪V, V; R) are zero by Lemma 3.26
since U ∪V and V are the complements of compact sets in M. Hence H
i
(U; R) = 0,
so z is a boundary in U and therefore in M, and we conclude that H
i
(M; R) = 0.
When i = n note ﬁrst that since M is connected, the image [z]
x
of the class
[z] ∈ H
n
(M; R) in H
n
(M¦
¦x; R) ≈ R must either be zero for all x or nonzero for all
x. Since M is noncompact, [z]
x
must therefore be zero for all x since there are
points x not in the image of z, which is compact. By Lemma 3.26, z then represents
zero in H
n
(M, V; R), hence also in H
n
(U; R) since the ﬁrst term in the upper row of
the diagram is zero when i = n, by Lemma 3.26 again. So [z] = 0 in H
n
(M; R) and
hence H
n
(M; R) = 0. L¦
The Duality Theorem
Our next task is to deﬁne a map H
k
(M; R)→H
n−k
(M; R) which Poincar´e duality
asserts is an isomorphism, under the assumption that M is an R orientable closed
n manifold. The deﬁnition of this map will be in terms of a general construction
called cap product, which has obvious afﬁnities with cup product.
For an arbitrary space X and coefﬁcient ring R, deﬁne an R bilinear cap product
map : C
k
(X; R)×C
(X; R)→C
k−
(X; R) for k ≥ by
σ ϕ = ϕ
¸
σ ¦
¦[v
0
, ··· , v
]
σ ¦
¦[v
, ··· , v
k
] for σ : ∆
k
→X and ϕ ∈ C
(X; R).
One checks the formula
∂(σ ϕ) = (−1)
(∂σ ϕ − σ δϕ)
by computing:
∂σ ϕ =
¸
i =0
(−1)
i
ϕ
¸
σ¦
¦[v
0
, ··· , v
i
, ··· , v
+1
]
σ¦
¦[v
+1
, ··· , v
k
]
+
k
¸
i =+1
(−1)
i
ϕ
¸
σ¦
¦[v
0
, ··· , v
]
σ¦
¦[v
, ··· , v
i
, ··· , v
k
]
σ δϕ =
+1
¸
i =0
(−1)
i
ϕ
¸
σ¦
¦[v
0
, ··· , v
i
, ··· , v
+1
]
σ¦
¦[v
+1
, ··· , v
k
]
∂(σ ϕ) =
k
¸
i =
(−1)
i−
ϕ
¸
σ¦
¦[v
0
, ··· , v
]
σ¦
¦[v
, ··· , v
i
, ··· , v
k
]
From the relation ∂(σ ϕ) = :(∂σ ϕ − σ δϕ) we see that the cap product of a
cycle σ and a cocycle ϕ is a cycle. Further, if ∂σ = 0 then ∂(σ ϕ) = :(σ δϕ),
so the cap product of a cycle and a coboundary is a boundary. And if δϕ = 0 then
∂(σ ϕ) = :(∂σ ϕ), so the cap product of a boundary and a cocycle is a boundary.
These facts imply that there is an induced cap product
H
k
(X; R)×H
(X; R)
→H
k−
(X; R)
238 Chapter 3. Cohomology
This is clearly R linear in each variable.
Using the same formulas, one checks that cap product has the relative forms
H
k
(X, A; R)×H
(X; R)
→H
k−
(X, A; R)
H
k
(X, A; R)×H
(X, A; R)
→H
k−
(X; R)
For example, in the second case the cap product C
k
(X; R)×C
(X; R)→C
k−
(X; R)
restricts to zero on the submodule C
k
(A; R)×C
(X, A; R), so there is an induced cap
product C
k
(X, A; R)×C
(X, A; R)→C
k−
(X; R). The formula for ∂(σ ϕ) still holds,
so the chain and cochain groups can be replaced by homology and cohomology groups.
There is also a more general relative cap product
H
k
(X, A∪B; R)×H
(X, A; R)
→H
k−
(X, B; R),
deﬁned when A and B are open sets in X, using the fact that H
k
(X, A∪B; R) can be
computed using the chain groups C
n
(X, A+B; R) = C
n
(X; R)/C
n
(A+B; R), as in the
derivation of relative MayerVietoris sequences in §2.2.
Cap product satisﬁes a naturality property which is a little more awkward to state
than the corresponding result for cup product since both covariant and contravariant
functors are involved. Given a map f : X→Y , the relevant induced maps on homology
and cohomology ﬁt into a diagram
X H ( ) X H ( )
k
X H ( )
k
×
−−−−−→
Y H ( ) Y H ( )
k
Y H ( )
k
×
−−−−−→
−
−
−
−
−
→
∗
f
−
−
−
−
−
→
∗
f
−
−
−
−
−
→
∗
f
It does not quite make sense to say this diagram commutes, but the spirit of commu
tativity is contained in the formula
f
∗
(α) ϕ = f
∗
¸
αf
∗
(ϕ)
which is obtained by substituting fσ for σ in the deﬁnition of cap product: fσϕ =
ϕ
¸
fσ ¦
¦[v
0
, ··· , v
]
fσ ¦
¦[v
, ··· , v
k
]. There are evident relative versions as well.
Now we can state Poincar´e duality for closed manifolds:
Theorem 3.29 (Poincar´e Duality). If M is a closed R orientable n manifold with
fundamental class [M] ∈ H
n
(M; R), then the map D: H
k
(M; R) →H
n−k
(M; R) de
ﬁned by D(α) = [M] α is an isomorphism for all k.
Recall that a fundamental class for M is an element of H
n
(M; R) whose image in
H
n
(M¦
¦x; R) is a generator for all x ∈ M. The existence of such a class was shown in
Theorem 3.25.
Example 3.30: Surfaces. Let M be the closed orientable surface of genus g, ob
tained as usual from a 4g gon by identifying pairs of edges according to the word
a
1
b
1
a
−1
1
b
−1
1
··· a
g
b
g
a
−1
g
b
−1
g
. A ∆ complex structure on M is obtained by coning
Section 3.3. Poincar´e Duality 239
off the 4g gon to its center, as indicated in the ﬁgure for
the case g = 2. We can compute cap products using
b
b
a
a
a
a
b
b
1
1
1
1
1
1
2
2
2
2
α
2
α
β
2
β
+
+
+
+
_
_
_
_
simplicial homology and cohomology since cap prod
ucts are deﬁned for simplicial homology and coho
mology by exactly the same formula as for singular
homology and cohomology, so the isomorphism be
tween the simplicial and singular theories respects cap
products. A fundamental class [M] generating H
2
(M)
is represented by the 2 cycle which is the sum of all 4g
2 simplices with the signs indicated. The edges a
i
and b
i
form a basis for H
1
(M).
Under the isomorphism H
1
(M) ≈ Hom(H
1
(M), Z), the cohomology class α
i
corre
sponding to a
i
assigns the value 1 to a
i
and 0 to the other basis elements. This
class α
i
is represented by the cocycle ϕ
i
assigning the value 1 to the 1 simplices
meeting the arc labeled α
i
in the ﬁgure and 0 to the other 1 simplices. Similarly we
have a class β
i
corresponding to b
i
, represented by the cycle ψ
i
assigning the value
1 to the 1 simplices meeting the arc β
i
. Applying the deﬁnition of cap product, we
have [M]ϕ
i
= b
i
and [M]ψ
i
= −a
i
since in both cases there is just one 2 simplex
[v
0
, v
1
, v
2
] where ϕ
i
or ψ
i
is nonzero on the edge [v
0
, v
1
]. Thus b
i
is the Poincar´e
dual of α
i
and −a
i
is the Poincar´e dual of β
i
. If we interpret Poincar´e duality entirely
in terms of homology, identifying α
i
with its Homdual a
i
and β
i
with b
i
, then the
classes a
i
and b
i
are Poincar´e duals of each other, up to sign at least. Geometrically,
Poincar´e duality is reﬂected in the fact that the loops α
i
and b
i
are homotopic, as are
the loops β
i
and a
i
.
The closed nonorientable surface N of genus g can be
treated in the same way if we use Z
2
coefﬁcients. We
view N as obtained from a 2g gon by identifying con
secutive pairs of edges according to the word a
2
1
··· a
2
g
.
a
a
a
a
a
a
a
a
1
1
1
2
2
2
3
3
4
4
α
3
α
α
4
α
We have classes α
i
∈ H
1
(N; Z
2
) represented by cocy
cles ϕ
i
assigning the value 1 to the edges meeting the
arc α
i
. Then [N]ϕ
i
= a
i
, so a
i
is the Poincar´e dual
of α
i
, In terms of homology, a
i
is the Homdual of α
i
,
so a
i
is its own Poincar´e dual. Geometrically, the loops a
i
on N are homotopic to their Poincar´e dual loops α
i
.
Our proof of Poincar´e duality, like the construction of fundamental classes, will be
by an inductive argument using MayerVietoris sequences. The induction step requires
a version of Poincar´e duality for open subsets of M, which are noncompact and can
satisfy Poincar´e duality only when a different kind of cohomology called cohomology
with compact supports is used.
240 Chapter 3. Cohomology
Cohomology with Compact Supports
Before giving the general deﬁnition, let us look at the conceptually simpler notion
of simplicial cohomology with compact supports. Here one starts with a ∆ complex
X which is locally compact. This is equivalent to saying that every point has a neigh
borhood which meets only ﬁnitely many simplices. Consider the subgroup ∆
i
c
(X; G)
of the simplicial chain group ∆
i
(X; G) consisting of cochains which are compactly
supported in the sense that they take nonzero values on only ﬁnitely many sim
plices. The coboundary of such a cochain ϕ can have a nonzero value only on those
(i+1) simplices having a face on which ϕ is nonzero, and there are only ﬁnitely many
such simplices by the local compactness assumption, so δϕ lies in ∆
i+1
c
(X; G). Thus
we have a subcomplex of the simplicial cochain complex. The resulting cohomology
groups for this subcomplex we denote, somewhat awkwardly, by H∆
i
c
(X; G).
Example 3.31. Let us compute these cohomology groups when X = R with the
∆ complex structure having vertices at the integer points and 1 simplices the in
tervals [n, n + 1]. For a simplicial 0 cochain to be a cocycle it must take the same
value on all vertices, but then if the cochain lies in ∆
0
c
(X) it must be identically zero.
Thus H∆
0
c
(R; G) = 0. However, H∆
1
c
(R; G) is nonzero. Namely, consider the map
Σ: ∆
1
c
(R; G)→G sending each cochain to the sum of its values on all the 1 simplices.
Note that Σ is not deﬁned on all of ∆
1
(X), just on ∆
1
c
(X). The map Σ vanishes on
coboundaries, so it induces a map H∆
1
c
(R; G)→G. This is surjective since every ele
ment of ∆
1
c
(X) is a cocycle. It is an easy exercise to verify that it is also injective, so
H∆
1
c
(R; G) ≈ G.
In similar fashion one could deﬁne compactly supported cellular cohomology of
a locally compact CW complex, using cellular cochains which are nonzero on only
ﬁnitely many cells.
What we are really interested in however is singular cohomology with compact
supports for spaces without any simplicial or cellular structure. The quickest deﬁ
nition of this is the following. Let C
i
c
(X; G) be the subgroup of C
i
(X; G) consisting
of cochains ϕ: C
i
(X)→G for each of which there exists a compact set K = K
ϕ
⊂ X
such that ϕ is zero on all chains in X −K. Note that δϕ is then also zero on chains
in X −K, so δϕ lies in C
i+1
c
(X; G) and the C
i
c
(X; G)’s for varying i form a subcom
plex of the singular cochain complex of X. The cohomology groups H
i
c
(X; G) of this
subcomplex are the cohomology groups with compact supports.
Cochains in C
i
c
(X; G) have compact support in only a rather weak sense. A
stronger and perhaps more natural condition would have been to require cochains
to be nonzero only on singular simplices contained in some compact set, depend
ing on the cochain. However, such ‘compactly supported’ cochains do not in general
form a subcomplex of the singular cochain complex. For example, if X = R and ϕ is
Section 3.3. Poincar´e Duality 241
a 0 cochain assigning a nonzero value to one point of R and zero to all other points,
then δϕ assigns a nonzero value to arbitrarily large 1 simplices.
It will be quite useful to have an alternative deﬁnition of H
i
c
(X; G) in terms of alge
braic limits. The way that limits enter the picture is the following. The cochain group
C
i
c
(X; G) is the union of its subgroups C
i
(X, X−K; G) as K ranges over compact sub
sets of X. Each inclusion K
L induces inclusions C
i
(X, X−K; G)
C
i
(X, X −L; G)
for all i, so there are induced maps H
i
(X, X−K; G)→H
i
(X, X−L; G). These need not
be injective, but one might still hope that H
i
c
(X; G) is somehow describable in terms
of the system of groups H
i
(X, X −K; G) for varying K. This is indeed the case, and
it is algebraic limits which provide the description.
Suppose one has abelian groups G
α
indexed by some partially ordered index set
I having the property that for each pair α, β ∈ I there exists γ ∈ I with α ≤ γ and
β ≤ γ. Such an I is called a directed set. Suppose also that for each pair α ≤ β one
has a homomorphism f
αβ
: G
α
→G
β
, such that f
αα
= 11 for each α, and if α ≤ β ≤ γ
then f
αγ
is the composition of f
αβ
and f
βγ
. Given this data, there are two equivalent
ways of deﬁning the direct limit group lim
→
G
α
. The quicker deﬁnition is that lim
→
G
α
is the quotient of the direct sum
¸
α
G
α
by the subgroup generated by all elements
of the form a −f
αβ
(a) for a ∈ G
α
, where we are viewing each G
α
as a subgroup of
¸
α
G
α
. The other deﬁnition, which is often more convenient to work with, runs as
follows. Deﬁne an equivalence relation on the set
¸
α
G
α
by a ∼ b if f
αγ
(a) = f
βγ
(b)
for some γ, where a ∈ G
α
and b ∈ G
β
. This is clearly reﬂexive and symmetric,
and transitivity follows from the directed set property. It could also be described
as the equivalence relation generated by setting a ∼ f
αβ
(a). Any two equivalence
classes [a] and [b] have representatives a
¹
and b
¹
lying in the same G
γ
, so deﬁne
[a] + [b] = [a
¹
+ b
¹
]. One checks this is welldeﬁned and gives an abelian group
structure to the set of equivalence classes. It is easy to check further that the map
sending an equivalence class [a] to the coset of a in lim
→
G
α
is a homomorphism, with
an inverse induced by the map
¸
i
a
i
¸
i
[a
i
] for a
i
∈ G
α
i
. Thus we can identify
lim
→
G
α
with the group of equivalence classes [a].
A useful consequence of this is that if we have a subset J ⊂ I with the property
that for each α ∈ I there exists a β ∈ J with α ≤ β, then lim
→
G
α
is the same whether
we compute it with α varying over I or just over J . In particular, if I has a maximal
element γ, we can take J = ¦γ¦ and then lim
→
G
α
= G
γ
.
Suppose now that we have a space X expressed as the union of a collection of
subspaces X
α
which form a directed set with respect to the inclusion relation. Then
the groups H
i
(X
α
; G) for ﬁxed i and G form a directed system, and the natural maps
H
i
(X
α
; G)→H
i
(X; G) induce a homomorphism lim
→
H
i
(X
α
; G)→H
i
(X; G).
242 Chapter 3. Cohomology
Proposition 3.32. If a space X is the union of a directed set of subspaces X
α
with
the property that each compact set in X is contained in some X
α
, then the natural
map lim
→
H
i
(X
α
; G)→H
i
(X; G) is an isomorphism for all i and G.
Proof: For surjectivity, represent a cycle in X by a ﬁnite sum of singular simplices.
The union of the images of these singular simplices is compact in X, hence lies in
some X
α
, so the map lim
→
H
i
(X
α
; G)→H
i
(X; G) is surjective. Injectivity is similar: If
a cycle in some X
α
is a boundary in X, compactness implies it is a boundary in some
X
β
⊃ X
α
, hence represents zero in lim
→
H
i
(X
α
; G). L¦
Now we can give the alternative deﬁnition of cohomology with compact supports
in terms of direct limits. For a space X, the compact subsets K ⊂ X form a directed
set under inclusion since the union of two compact sets is compact. To each compact
K ⊂ X we associate the group H
i
(X, X−K; G), with a ﬁxed i and coefﬁcient group G,
and to each inclusion K ⊂ L of compact sets we associate the natural homomorphism
H
i
(X, X−K; G)→H
i
(X, X−L; G). The resulting limit group lim
→
H
i
(X, X−K; G) is then
equal to H
i
c
(X; G) since each element of this limit group is represented by a cocycle in
C
i
(X, X−K; G) for some compact K, and such a cocycle is zero in lim
→
H
i
(X, X−K; G)
iff it is the coboundary of a cochain in C
i−1
(X, X −L; G) for some compact L ⊃ K.
Note that if X is compact, then H
i
c
(X; G) = H
k
(X; G) since there is a unique
maximal compact set K ⊂ X, namely X itself. This is also immediate fromthe original
deﬁnition since C
i
c
(X; G) = C
i
(X; G) if X is compact.
Example 3.33: H
∗
c
(R
n
; G). To compute lim
→
H
i
(R
n
, R
n
− K; G) it sufﬁces to let K
range over balls B
k
of integer radius k centered at the origin since every compact set
is contained in such a ball. Since H
i
(R
n
, R
n
−B
k
; G) is nonzero only for i = n, when
it is G, and the maps H
n
(R
n
, R
n
−B
k
; G)→H
n
(R
n
, R
n
−B
k+1
; G) are isomorphisms,
we deduce that H
i
c
(R
n
; G) = 0 for i ≠ n and H
n
c
(R
n
; G) ≈ G.
This example shows that cohomology with compact supports is not an invariant
of homotopy type. The reason for this is that a map such as the constant map from
R
n
to a point does not induce a map on cohomology with compact supports. The
maps which induce maps on H
∗
c
are the proper maps, for which the inverse image
of each compact set is compact. In the proof of Poincar´e duality we will not need to
worry about induced maps in this generality however, since it will be sufﬁcient just to
consider the inclusion maps among open sets in a ﬁxed manifold, and these inclusion
maps are proper maps.
The group H
i
(X, X − K; G) for K compact depends only on a neighborhood of
K in X, by excision. As convenient shorthand notation we will write this group as
H
i
(X¦
¦K; G), in analogy with the similar notation we used earlier for local homology.
One can think of cohomology with compact supports as the limit of these ‘local coho
mology groups at compact subsets.’
Section 3.3. Poincar´e Duality 243
Duality for Noncompact Manifolds
For M an R orientable n manifold, possibly noncompact, we can deﬁne a dual
ity map D
M
: H
k
c
(M; R)→H
n−k
(M; R) by a limiting process in the following way. For
compact sets K ⊂ L ⊂ M we have a diagram
M K R H ( )
n
H (
n
×
k
−−−−−→
M H (
n k
−−−−−→
−
−
−
−
−
→
∗
i
−
−
−
−
−
→
∗
i
; 

M K R H ( )
k
; 

M L R H ( )
n
× ; 

M L R H ( )
k
; 

M R)
R)
;
;
=
=
=
Recall that the notation H
n
(M¦
¦K; R) is an abbreviation for H
n
(M, M − K; R), and
similarly for the other terms in the diagram. By Lemma 3.26 there are unique elements
µ
K
∈ H
n
(M¦
¦K; R) and µ
L
∈ H
n
(M¦
¦L; R) restricting to a given orientation of M at
each point of K and L, respectively. From the uniqueness we have i
∗
(µ
L
) = µ
K
. By
naturality of cap product, i
∗
(µ
L
)x = µ
L
i
∗
(x) for all x ∈ H
k
(M¦
¦K; R), so µ
K
x =
µ
L
i
∗
(x). Therefore, letting K vary over compact sets in M, the homomorphisms
H
k
(M¦
¦K; R)→H
n−k
(M; R), x
µ
K
x, induce in the limit a duality homomorphism
D
M
: H
k
c
(M; R)→H
n−k
(M; R).
Since H
∗
c
(M; R) = H
∗
(M; R) if M is compact, the following result generalizes
Poincar´e duality for closed manifolds.
Theorem 3.34. The duality map D
M
: H
k
c
(M; R)→H
n−k
(M; R) is an isomorphism
for all k whenever M is an R oriented n manifold.
To simplify notation we shall omit the coefﬁcient ring R throughout the proof.
The main technical step to be proved is:
Lemma 3.35. If M is the union of two open sets U and V , then there is a diagram
of MayerVietoris sequences, which is commutative up to sign:
V U H ( )
−−−−−→ −−−−−→ −−−−−→ −−−−−→ −−−−−→
c
k +
∩
∩
V U H ( )
c
k 1
∩ U H ( )
c
k
M H ( )
c
k
V H
D
U
D
V
( )
c
k
⊕
⊕
. . . . . .
V U H ( )
−−−−−→ −−−−−→ −−−−−→ −−−−−→ −−−−−→
n k
∩ V U H ( ) ∩ U H ( ) M H ( ) V H ( ) ⊕
. . . . . .
n k n k
n k n k 1
−
−
−
−
−
→
D
M
−
−
−
−
−
→
D
U V
−
−
−
−
−
→
∩
D
U V
−
−
−
−
−
→
Proof: Compact sets K ⊂ U and L ⊂ V give rise to the MayerVietoris sequence in
the upper row of the following diagram, whose lower row is also a MayerVietoris
sequence.
L K H ( ) )
−−−−−→ −−−−−→ −−−−−→ −−−−−→
k
∩
∩
M H ( )
k
⊕
⊕
. . . . . .
V U H ( )
−−−−−−−−−−−−−→ −−−−−−−−−→ −−−−−−−−−−−−−→ −−−−−→
n k
∩ U H ( ) M H ( ) V H ( ) ⊕
. . . . . .
n k n k
n k
−
−
−
−
−
→
−
−
−
−
−
→
−
−
−
−
−
−
−
−
−
−
−
−
−
−
−
→
K L
−
−
−
−
−
→
−
−
−
−
−
→

 K H (
k
M
 K M
 ) L L H (
k
M

L K H ( ) )
k
∩ V U∩ ⊕ 
 K H (
k
U
 ) L H (
k
V 

∪
∪
≈ ≈
µ
K
µ
L
µ
L K
µ
244 Chapter 3. Cohomology
The two maps labelled isomorphisms come from excision. Assuming this diagram
commutes, consider passing to the limit over compact sets K ⊂ U and L ⊂ V . Since
each compact set in U∩V is contained in an intersection K∩L of compact sets K ⊂ U
and L ⊂ V , and similarly for U ∪V , the diagram induces a limit diagram having the
form stated in the lemma. The ﬁrst row of this limit diagram is exact since a direct
limit of exact sequences is exact; this is an exercise at the end of the section, and
follows easily from the deﬁnition of direct limits.
It remains to consider the commutativity of the preceding diagram involving K
and L. In the two squares shown, not involving boundary or coboundary maps, it is a
triviality to check commutativity at the level of cycles and cocycles. Less trivial is the
third square, which we rewrite in the following way:
(∗)
−−−−−→
∩
H ( )
k
−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−→ M H ( ) V U H ( )
n k 1
∩
n k
−
−
−
−
−
−
→
−
−
−
−
−
−
→
K L
L K H ( )
−−−−−→
k 1
∩ M
 K M
 L L K ) ∩ V U∩ 
 ∪
∪
≈
µ
L K
µ
δ
+
H (
k 1 +
∂
Letting A = M−K and B = M−L, the map δ is the coboundary map in the Mayer
Vietoris sequence obtained from the short exact sequence of cochain complexes
0 →C
∗
(M, A+B) →C
∗
(M, A) ⊕ C
∗
(M, B) →C
∗
(M, A∩B) →0
where C
∗
(M, A+B) consists of cochains on M vanishing on chains in A and chains
in B. To evaluate the MayerVietoris coboundary map δ on a cocycle ϕ ∈ C
∗
(M, A∩B)
one ﬁrst writes ϕ = ϕ
A
−ϕ
B
for ϕ
A
∈ C
∗
(M, A) and ϕ
B
∈ C
∗
(M, B), and then δ[ϕ]
is represented by the cocycle δϕ
A
= δϕ
B
∈ C
∗
(M, A+B). (The equality δϕ
A
= δϕ
B
comes from the fact that ϕ is a cocycle, so δϕ = δϕ
A
− δϕ
B
= 0.) Similarly, the
boundary map ∂ in the homology MayerVietoris sequence is obtained by representing
an element of H
i
(M) by a cycle z which is a sum of chains z
U
∈ C
i
(U) and z
V
∈
C
i
(V), and then ∂[z] = [∂z
U
].
Via barycentric subdivision, the class µ
K∪L
can be represented by a chain α which
is a sum α
U−L
+ α
U∩V
+ α
V−K
of chains in U − L, U ∩ V , and V − K, respectively,
since these three open sets cover M. Then α
U∩V
represents µ
K∩L
since the other two
chains α
U−L
and α
V−K
lie in the complement of K∩L, hence vanish in H
n
(M¦
¦K∩L) ≈
H
n
(U ∩V ¦
¦K ∩L). Similarly, α
U−L
+α
U∩V
represents µ
K
.
K
L
U
V
α
α
α
U L
V K
U∩V
_
_
Section 3.3. Poincar´e Duality 245
In the square (∗) let ϕ be a cocycle representing an element of H
k
(M¦
¦K ∪ L).
Under δ this maps to the cohomology class of δϕ
A
. Continuing on to H
n−k−1
(U ∩V)
we obtain α
U∩V
δϕ
A
, which is in the same homology class as ∂α
U∩V
ϕ
A
since
∂(α
U∩V
ϕ
A
) = (−1)
k
(∂α
U∩V
ϕ
A
− α
U∩V
δϕ
A
)
and α
U∩V
ϕ
A
is a chain in U ∩V .
Going around the square (∗) the other way, ϕ maps ﬁrst to αϕ. To apply the
MayerVietoris boundary map ∂ to this, we write αϕ as a sum of a chain in U and
a chain in V ,
αϕ = (α
U−L
ϕ) +(α
U∩V
ϕ+α
V−K
ϕ)
then we take the boundary of the ﬁrst of these two chains, obtaining [∂(α
U−L
ϕ)] ∈
H
n−k−1
(U ∩V). It remains to compare this with [∂α
U∩V
ϕ
A
]. We have
∂(α
U−L
ϕ) = (−1)
k
∂α
U−L
ϕ since δϕ = 0
= (−1)
k
∂α
U−L
ϕ
A
since ∂α
U−L
ϕ
B
= 0, ϕ
B
being
zero on chains in B = M −L
= (−1)
k+1
∂α
U∩V
ϕ
A
where this last equality comes from the fact that ∂(α
U−L
+ α
U∩V
) ϕ
A
= 0 since
∂(α
U−L
+ α
U∩V
) is a chain in U − K by the earlier observation that α
U−L
+ α
U∩V
represents µ
K
, and ϕ
A
vanishes on chains in A = M −K.
Thus the square (∗) commutes up to a sign depending only on k. L¦
Proof of Poincar´e Duality: There are two inductive steps, ﬁnite and inﬁnite:
(A) If M is the union of open sets U and V and if D
U
, D
V
, and D
U∩V
are isomor
phisms, then so is D
M
. Via the ﬁvelemma, this is immediate from the preceding
lemma.
(B) If M is the union of a sequence of open sets U
1
⊂ U
2
⊂ ··· and each duality map
D
U
i
: H
k
c
(U
i
)→H
n−k
(U
i
) is an isomorphism, then so is D
M
. To show this we notice
ﬁrst that by excision, H
k
c
(U
i
) can be regarded as the limit of the groups H
k
(M¦
¦K) as K
ranges over compact subsets of U
i
. Then there are natural maps H
k
c
(U
i
)→H
k
c
(U
i+1
)
since the second of these groups is a limit over a larger collection of K’s. Thus we
can form lim
→
H
k
c
(U
i
) which is obviously isomorphic to H
k
c
(M) since the compact
sets in M are just the compact sets in all the U
i
’s. By Proposition 3.32, H
n−k
(M) ≈
lim
→
H
n−k
(U
i
). The map D
M
is thus the limit of the isomorphisms D
U
i
, hence is an
isomorphism.
Now after all these preliminaries we can prove the theorem in three easy steps:
(1) The case M = R
n
can be proved by regarding R
n
as the interior of ∆
n
, and
then the map D
M
can be identiﬁed with the map H
k
(∆
n
, ∂∆
n
)→H
n−k
(∆
n
) given by
cap product with a unit times the generator [∆
n
] ∈ H
n
(∆
n
, ∂∆
n
), where [∆
n
] is the
homology class of the identity map of ∆
n
. The only nontrivial value of k is k = n,
246 Chapter 3. Cohomology
when the cap product map is an isomorphism since a generator of H
n
(∆
n
, ∂∆
n
) ≈
Hom(H
n
(∆
n
, ∂∆
n
), R) is represented by the cocycle taking the value 1 on [∆
n
], which
means that [∆
n
] [ϕ] is a generator of H
0
(∆
n
).
(2) More generally, D
M
is an isomorphism for M an arbitrary open set in R
n
. To see
this, ﬁrst write M as a countable union of convex open sets U
i
, for example open
balls, and let V
i
=
j<i
U
j
. We apply (A) to U
i
and V
i
. Both V
i
and U
i
∩V
i
are unions
of i − 1 convex open sets, so by induction on the number of convex open sets in a
cover, D
V
i
and D
U
i
∩V
i
are isomorphisms. By (1), D
U
i
is an isomorphism since U
i
is
homeomorphic to R
n
. So D
U
i
∪V
i
is an isomorphism. Since M is the increasing union
of the V
i
’s and each D
V
i
is an isomorphism, so is D
M
by (B).
(3) If M is a ﬁnite or countably inﬁnite union of open sets U
i
homeomorphic to R
n
,
the theorem now follows by the argument in (2), with each appearance of the words
‘convex open set’ replaced by ‘open set in R
n
.’ Thus the proof is ﬁnished for closed
manifolds, as well as for all noncompact manifolds which one ever encounters in
actual practice.
To handle a completely general noncompact manifold M we use a Zorn’s Lemma
argument. Consider the collection of open sets U ⊂ M for which the duality maps
D
U
are isomorphisms. This collection is partially ordered by inclusion, and the union
of every totallyordered subcollection is again in the collection by the argument in (B),
which did not really use the hypothesis that the collection ¦U
i
¦ was indexed by the
positive integers. Zorn’s Lemma then implies that there exists a maximal open set
U for which the theorem holds. If U ≠ M, choose a point x ∈ M − U and an open
neighborhood V of x homeomorphic to R
n
. The theorem holds for V and U ∩V by
(1) and (2), and it holds for U by assumption, so by (A) it holds for U∪V , contradicting
the maximality of U. L¦
Corollary 3.36. A closed manifold of odd dimension has Euler characteristic zero.
Proof: Let M be a closed n manifold. If M is orientable, we have rank H
i
(M; Z) =
rank H
n−i
(M; Z), which equals rank H
n−i
(M; Z) by the universal coefﬁcient theorem.
Thus if n is odd, all the terms of
¸
i
(−1)
i
rank H
i
(M; Z) cancel in pairs.
If M is not orientable we apply the same argument using Z
2
coefﬁcients, with
rank H
i
(M; Z) replaced by dimH
i
(M; Z
2
), the dimension as a vector space over Z
2
,
to conclude that
¸
i
(−1)
i
dimH
i
(M; Z
2
) = 0. It remains to check that this alternating
sum equals the Euler characteristic
¸
i
(−1)
i
rank H
i
(M; Z). We can do this by using
the isomorphisms H
i
(M; Z
2
) ≈ H
i
(M; Z
2
) and applying the universal coefﬁcient theo
remfor cohomology. Each Z summand of H
i
(M; Z) gives a Z
2
summand of H
i
(M; Z
2
).
Each Z
m
summand of H
i
(M; Z) with m even gives Z
2
summands of H
i
(M; Z
2
) and
H
i−1
(M, Z
2
), whose contributions to
¸
i
(−1)
i
dimH
i
(M; Z
2
) cancel. And Z
m
sum
mands of H
i
(M; Z) with m odd contribute nothing to H
∗
(M; Z
2
). L¦
Section 3.3. Poincar´e Duality 247
Connection with Cup Product
There is a close relationship between cup and cap product, arising from the for
mula
(∗) ψ(αϕ) = (ϕψ)(α)
for α ∈ C
k+
(X; R), ϕ ∈ C
k
(X; R), and ψ ∈ C
(X; R). This holds since for a singular
(k +) simplex σ : ∆
k+
→X we have
ψ(σ ϕ) = ψ
¸
ϕ
¸
σ¦
¦[v
0
, ··· , v
k
]
σ¦
¦[v
k
, ··· , v
k+
]
= ϕ
¸
σ¦
¦[v
0
, ··· , v
k
]
ψ
¸
σ¦
¦[v
k
, ··· , v
k+
]
= (ϕψ)(σ).
The formula (∗) says that the map ϕ: C
(X; R)→C
k+
(X; R) is equal to the map
Hom
R
(C
(X; R)→Hom
R
(C
k+
(X; R) dual to ϕ. Passing to homology and cohomol
ogy, we obtain a commutative diagram
−−−−−−→
h
( Hom ; X R H (
R
)
; X R H (
( )
)
, R)
−−−−−−→
h
( Hom ; X R H (
R
)
k
; X R H ( )
, R)
−
−
−
−
−
→
−
−
−
−
−
→
ϕ ϕ
∗
+
k +
When the maps h are isomorphisms, for example when R is a ﬁeld or when R = Z
and the homology groups of X are free, then the map ϕ is the dual of ϕ. Thus in
these cases cup and cap product determine each other, at least if one assumes ﬁnite
generation so that cohomology determines homology as well as vice versa. However,
there are examples where cap and cup products are not equivalent when R = Z and
there is torsion in homology.
By means of the formula (∗), Poincar´e duality has nontrivial implications for
the cup product structure of manifolds. For a closed R orientable n manifold M,
consider the cup product pairing
H
k
(M; R)×H
n−k
(M; R) →R, (ϕ, ψ)
(ϕψ)[M]
Such a bilinear pairing A×B→R is said to be nonsingular if the maps A→Hom(B, R)
and B→Hom(A, R), obtained by viewing the pairing as a function of each variable
separately, are both isomorphisms.
Proposition 3.37. The cup product pairing is nonsingular for closed R orientable
manifolds when R is a ﬁeld, or when R = Z and torsion in H
∗
(M; Z) is factored out.
Proof: Consider the composition
H
n−k
(M; R)
h
→Hom
R
(H
n−k
(M; R), R)
D
∗
→Hom
R
(H
k
(M; R), R)
where h is the map appearing in the universal coefﬁcient theorem, induced by eval
uation of cochains on chains, and D
∗
is the Hom dual of the Poincar´e duality map
248 Chapter 3. Cohomology
D: H
k
→H
n−k
. The composition D
∗
h sends ψ ∈ H
n−k
(M; R) to the homomorphism
ϕ
ψ([M] ϕ) = (ϕψ)[M]. For ﬁeld coefﬁcients or for integer coefﬁcients with
torsion factored out, h is an isomorphism. Nonsingularity of the pairing in one of its
variables is then equivalent to D being an isomorphism. Nonsingularity in the other
variable follows by commutativity of cup product. L¦
Corollary 3.38. If M is a closed connected orientable n manifold, then for each
element α ∈ H
k
(M; Z) of inﬁnite order which is not a proper multiple of another
element there exists an element β ∈ H
n−k
(M; Z) such that α β is a generator of
H
n
(M; Z) ≈ Z. With coefﬁcients in a ﬁeld the same conclusion holds for any α ≠ 0.
Proof: The hypotheses on α mean that it generates a Z summand of H
k
(M; Z). There
is then a homomorphism ϕ: H
k
(M; Z)→Z with ϕ(α) = 1. By the nonsingularity
of the cup product pairing, ϕ is realized by taking cup product with an element
β ∈ H
n−k
(M; Z) and evaluating on [M], so α β generates H
n
(M; Z). The case of
ﬁeld coefﬁcients is similar. L¦
Example 3.39: Projective Spaces. The cup product structure of H
∗
(CP
n
; Z) as a
truncated polynomial ring Z[α]/(α
n+1
) with α ∈ H
2
(CP
n
; Z) can easily be deduced
from this as follows. The inclusion CP
n−1
⊂ CP
n
induces an isomorphism on H
i
for
i ≤ 2n − 2, so by induction on n, H
2i
(CP
n
; Z) is generated by α
i
for i < n. By the
corollary, there is an integer m such that the product αmα
n−1
= mα
n
generates
H
2n
(CP
n
; Z), which implies m = :1 and therefore H
∗
(CP
n
; Z) ≈ Z[α]/(α
n+1
). The
same argument shows H
∗
(HP
n
; Z) ≈ Z[α]/(α
n+1
)with α ∈ H
4
. For RP
n
one can use
the same argument with Z
2
coefﬁcients to deduce that H
∗
(RP
n
; Z
2
) ≈ Z
2
[α]/(α
n+1
)
with α now 1 dimensional. The cup product structure in inﬁnitedimensional pro
jective spaces follows from the ﬁnitedimensional case, as we saw in the proof of
Theorem 3.11.
Could there be a closed manifold whose cohomology is additively isomorphic to
that of CP
n
but with a different cup product structure? For n = 2 the answer is
no since duality implies that the square of a generator of H
2
must be a generator of
H
4
. For n = 3, duality says that the product of generators of H
2
and H
4
must be a
generator of H
6
, but nothing is said about the square of a generator of H
2
. Indeed, for
S
2
×S
4
, whose cohomology has the same additive structure as CP
3
, the square of the
generator of H
2
(S
2
×S
4
; Z) is zero since it is the pullback of a generator of H
2
(S
2
; Z)
under the projection S
2
×S
4
→S
2
and in H
∗
(S
2
; Z) the square of the generator of H
2
is zero. More generally, there are closed 6 manifolds having the same cohomology
groups as CP
3
but where the square of the generator of H
2
is an arbitrary multiple
of a generator of H
4
. (These manifolds are ﬁber bundles over S
4
with ﬁber S
2
; see
[VBKT].)
Example 3.40: Lens Spaces. Cup products in lens spaces can be computed in the
same way as in projective spaces. For a lens space L
2n+1
of dimension 2n + 1 with
Section 3.3. Poincar´e Duality 249
fundamental group Z
m
, we computed H
i
(L
2n+1
; Z) in Example 2.43 to be Z for i = 0
and 2n+1, Z
m
for odd i < 2n+1, and 0 otherwise. In particular, this implies that
L
2n+1
is orientable, which also follows since L
2n+1
is the orbit space of an action of
Z
m
on S
2n+1
by orientation preserving homeomorphisms; see the exercises at the
end of the section. By the universal coefﬁcient theorem, H
i
(L
2n+1
; Z
m
) is Z
m
for
each i ≤ 2n + 1. Let α ∈ H
1
(L
2n+1
; Z
m
) and β ∈ H
2
(L
2n+1
; Z
m
) be generators. The
statement we wish to prove is:
H
j
(L
2n+1
; Z
m
) is generated by
β
i
for j = 2i
αβ
i
for j = 2i +1
By induction on n we may assume this holds for j ≤ 2n−1 since we have a lens space
L
2n−1
⊂ L
2n+1
with this inclusion inducing an isomorphism on H
j
for j ≤ 2n − 1,
as one sees by comparing the cellular chain complexes for L
2n−1
and L
2n+1
. The
corollary does not apply directly for Z
m
coefﬁcients with arbitrary m, but its proof
does since the maps h: H
i
(L
2n+1
; Z
m
)→Hom(H
i
(L
2n+1
; Z
m
), Z
m
) are isomorphisms.
We conclude that β kαβ
n−1
generates H
2n+1
(L
2n+1
; Z
m
) for some integer k. We
must have k relatively prime to m, otherwise the product βkαβ
n−1
= kαβ
n
would
have order less than m and so could not generate H
2n+1
(L
2n+1
; Z
m
). Then since k
is relatively prime to m, αβ
n
is also a generator of H
2n+1
(L
2n+1
; Z
m
). From this it
follows that β
n
must generate H
2n
(L
2n+1
; Z
m
), otherwise it would have order less
than m and so therefore would αβ
n
.
The rest of the cup product structure on H
∗
(L
2n+1
; Z
m
) is determined once α
2
is expressed as a multiple of β. When m is odd, the commutativity formula for cup
product implies α
2
= 0. When m is even, commutativity implies only that α
2
is
either zero or the unique element of H
2
(L
2n+1
; Z
m
) ≈ Z
m
of order two. In fact it is
the latter possibility which holds, since the 2 skeleton L
2
is the circle L
1
with a 2 cell
attached by a map of degree m, and we computed the cup product structure in this
2 complex in Example 3.9. It does not seem to be possible to deduce the nontriviality
of α
2
from Poincar´e duality alone, except when m= 2.
The cup product structure for an inﬁnitedimensional lens space L
∞
follows from
the ﬁnitedimensional case since the restriction map H
j
(L
∞
; Z
m
)→H
j
L
2n+1
; Z
m
) is
an isomorphism for j ≤ 2n + 1. As with RP
n
, the ring structure in H
∗
(L
2n+1
; Z) is
determined by the ring structure in H
∗
(L
2n+1
; Z
m
), and likewise for L
∞
, where one
has the slightly simpler structure H
∗
(L
∞
; Z) ≈ Z[α]/(mα) with α 2 dimensional.
The case of L
2n+1
is obtained from this by setting α
n+1
= 0 and adjoining the extra
Z ≈ H
2n+1
(L
2n+1
; Z).
A different derivation of the cup product structure in lens spaces is given in
Example 3E.2.
Using the ad hoc notation H
k
free
(M) for H
k
(M) modulo its torsion subgroup,
the preceding proposition implies that for a closed orientable manifold M of dimen
sion 2n, the middledimensional cup product pairing H
n
free
(M)×H
n
free
(M)→Z is a
250 Chapter 3. Cohomology
nonsingular bilinear form on H
n
free
(M). This form is symmetric or skewsymmetric
according to whether n is even or odd. The algebra in the skewsymmetric case is
rather simple: With a suitable choice of basis, the matrix of a skewsymmetric nonsin
gular bilinear formover Z can be put into the standard formconsisting of 2×2 blocks
¸
0
1
−1
0
along the diagonal and zeros elsewhere, according to an algebra exercise at the
end of the section. In particular, the rank of H
n
(M
2n
) must be even when n is odd.
We are already familiar with these facts in the case n = 1 by the explicit computations
of cup products for surfaces in §3.2.
The symmetric case is much more interesting algebraically. There are only ﬁnitely
many isomorphism classes of symmetric nonsingular bilinear forms over Z of a ﬁxed
rank, but this ‘ﬁnitely many’ grows rather rapidly, e.g., more than 80 million for rank
32; see [Serre] for an exposition of this beautiful chapter of number theory. It is known
that for each even n ≥ 2, every symmetric nonsingular form actually occurs as the
cup product pairing in some closed manifold M
2n
. One can even take M
2n
to be
simplyconnected and have the bare minimum of homology: Z’s in dimensions 0 and
2n and a Z
k
in dimension n. For n = 2 there are at most two nonhomeomorphic
simplyconnected closed 4 manifolds with the same bilinear form. Namely, there are
two manifolds with the same form if the square αα of some α ∈ H
2
(M
4
) is an odd
multiple of a generator of H
4
(M
4
), e.g., if M = CP
2
; and otherwise the M
4
is unique,
e.g., if M = S
4
or S
2
×S
2
; see [FreedmanQuinn]. In §4.C we take the ﬁrst step in
this direction by proving a classical result of J.H.C.Whitehead that the homotopy type
of a simplyconnected closed 4 manifold is uniquely determined by its cup product
structure.
Other Forms of Duality
Generalizing the deﬁnition of a manifold, an n manifold with boundary is a Haus
dorff space M in which each point has an open neighborhood homeomorphic either
to R
n
or to the halfspace R
n
+
= ¦ (x
1
, ··· , x
n
) ∈ R
n
¦ x
n
≥ 0¦. If x ∈ M corresponds
under such a homeomorphismto a point (x
1
, ··· , x
n
) ∈ R
n
+
with x
n
= 0, then by exci
sion we have H
n
(M, M−¦x¦; Z) ≈ H
n
(R
n
+
, R
n
+
−¦0¦; Z) = 0, whereas if x corresponds
to a point (x
1
, ··· , x
n
) ∈ R
n
+
with x
n
> 0 or to a point of R
n
, then H
n
(M, M−¦x¦; Z) ≈
H
n
(R
n
, R
n
−¦0¦; Z) ≈ Z. Thus the points x with H
n
(M, M −¦x¦; Z) = 0 form a well
deﬁned subspace. This subspace is denoted ∂M, the boundary of M. For example,
∂R
n
+
= R
n−1
and ∂D
n
= S
n−1
. It is evident that ∂M is an (n−1) dimensional manifold
with empty boundary.
If M is a manifold with boundary, then a collar neighborhood of ∂M in M is an
open neighborhood homeomorphic to ∂M×[0, 1) by a homeomorphism taking ∂M
to ∂M×¦0¦.
Proposition 3.41. If M is a compact manifold with boundary, then ∂M has a collar
neighborhood.
Section 3.3. Poincar´e Duality 251
Proof: Let M
¹
be M with an external collar attached, i.e., M
¹
is the quotient of the
disjoint union of M and ∂M×[0, 1] in which x ∈ ∂M is identiﬁed with (x, 0) ∈
∂M×[0, 1]. It will sufﬁce to construct a homeomorphism h: M→M
¹
since ∂M
¹
c