Grad Alg Top Mooremethod
Grad Alg Top Mooremethod
M382C
Michael Starbird
Fall 2007
Contents
1 Introduction
1.1 Basic Examples . . . . . . . . . . . . . . .
1.2 Simplices . . . . . . . . . . . . . . . . . .
1.3 Simplicial Complexes . . . . . . . . . . . .
1.4 2-manifolds . . . . . . . . . . . . . . . . .
1.4.1 2-manifolds as simplicial complexes
1.4.2 2-manifolds as quotient spaces . .
1.5 Questions . . . . . . . . . . . . . . . . . .
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
5
5
6
7
9
11
14
17
2 2-manifolds
2.1 Classification of 2-manifolds .
2.1.1 Classification Proof I .
2.1.2 Classification Proof II
2.2 PL Homeomorphism . . . . .
2.3 Invariants . . . . . . . . . . .
2.3.1 Euler characteristic . .
2.3.2 Orientability . . . . .
2.4 CW complexes . . . . . . . .
2.5 2-manifolds with boundary .
2.6 *Non-compact surfaces . . . .
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
19
19
20
23
27
28
28
29
35
38
42
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
connected
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
intersec. . . . . .
49
50
56
57
58
60
61
CONTENTS
3.3.2 Van Kampens Theorem: simply connected pieces case
3.4 Fundamental groups of surfaces . . . . . . . . . . . . . . . . .
3.5 Van Kampens Theorem, II . . . . . . . . . . . . . . . . . . .
3.6 3-manifolds . . . . . . . . . . . . . . . . . . . . . . . . . . . .
3.6.1 Lens spaces . . . . . . . . . . . . . . . . . . . . . . . .
3.6.2 Knots in S3 . . . . . . . . . . . . . . . . . . . . . . . .
3.7 Homotopy equivalence of spaces . . . . . . . . . . . . . . . . .
3.8 Higher homotopy groups . . . . . . . . . . . . . . . . . . . . .
3.9 Covering spaces . . . . . . . . . . . . . . . . . . . . . . . . . .
3.10 Theorems about groups . . . . . . . . . . . . . . . . . . . . .
63
63
66
67
67
69
72
73
75
82
4 Homology
4.1 Z2 homology . . . . . . . . . . . . . . . . . . . . . . . . . . .
4.1.1 Simplicial Z2 homology . . . . . . . . . . . . . . . . .
4.1.2 CW Z2 -homology . . . . . . . . . . . . . . . . . . . . .
4.2 Homology from parts, special cases . . . . . . . . . . . . . . .
4.3 Chain groups and induced homomorphisms . . . . . . . . . .
4.4 Applications of Z2 homology . . . . . . . . . . . . . . . . . .
4.5 Z2 Mayer-Vietoris Theorem . . . . . . . . . . . . . . . . . . .
4.6 Introduction to simplicial Z-homology . . . . . . . . . . . . .
4.6.1 Chains, boundaries, and definition of simplicial Zhomology . . . . . . . . . . . . . . . . . . . . . . . . .
4.7 Chain groups and induced homomorphisms . . . . . . . . . .
4.8 Relationship between fundamental group and first homology .
4.9 Mayer-Vietoris Theorem . . . . . . . . . . . . . . . . . . . . .
83
84
85
86
91
93
96
97
100
111
117
125
127
100
105
106
107
Chapter 1
Introduction
Abstracting and generalizing essential features of familiar objects often lead
to the development of important mathematical ideas. One goal of geometrical analysis is to describe the relationships and features that make up the
essential qualities of what we perceive as our physical world. The strategy
is to find ideas that we view as central and then to generalize those ideas
and to explore those more abstract extensions of what we perceive directly.
Much of topology is aimed at exploring abstract versions of geometrical
objects in our world. The concept of geometrical abstraction dates back
at least to the time of Euclid (c. 225 B.C.E.) The most famous and basic
spaces are named for him, the Euclidean spaces. All of the objects that we
will study in this course will be subsets of the Euclidean spaces.
1.1
Basic Examples
z
}|
{
[0, 1] [0, 1] [0, 1] Rn .
5
CHAPTER 1. INTRODUCTION
For example, D1 = [0, 1]. D1 is also called the unit interval, sometimes
denoted by I.
Definition (standard n-ball, standard n-cell). The n-dimensional ball or
cell, denoted Bn , is defined as:
Bn := {(x1 , . . . , xn ) Rn |x21 + . . . + x2n 1}.
Fact 1.1. The standard n-ball and the standard n-disk are compact and
homeomorphic.
Definition (standard n-sphere). The n-dimensional sphere, denoted Sn , is
defined as
Sn := {(x0 , . . . , xn ) Rn+1 |x20 + . . . + x2n = 1}.
Note. Bd Bn+1 = Sn
As usual, the term n-sphere will apply to any space homeomorphic to
the standard n-sphere.
Question 1.2. Describe S0 , S1 , and S2 . Are they homeomorphic? If not,
are there any properties that would help you distinguish between them?
1.2
Simplices
One class of spaces in Rn we will be studying will be manifolds or kmanifolds, which are made up of pieces that locally look like Rk , put together in a nice way. In particular, we will be studying manifolds that
use triangles (or their higher-dimensional equivalents) as the basic building
blocks.
Since k-dimensional triangles in Rn (called simplices) are the basic
building blocks we will be using, we begin by giving a vector description of
them.
Definition (1-simplex). Let v0 , v1 be two points in Rn . If we consider v0
and v1 as vectors from the origin, then 1 = {v1 + (1 )v0 | 0 1}
is the straight line segment between v0 and v1 . 1 can be denoted by {v0 v1 }
or {v1 v0 } (the order the vertices are listed in doesnt matter). The set 1 is
called a 1-simplex or edge with vertices (or 0-simplices) v0 and v1 .
1.3
Simplicial Complexes
CHAPTER 1. INTRODUCTION
running over all simplices ij in T is a finite simplicial complex with triangulation T , denoted (K, T ). The set K is often called the underlying space
of the simplicial complex. If n is the maximum dimension of all simplices
in T , then we say (K, T ) is of dimension n.
Example 1. Consider (K, T ) to be the simplicial complex in the plane where
T
={
{(0, 0)(0, 1)(1, 0)}, {(0, 0)(0, 1)}, {(0, 1)(1, 0)},
{(0, 0)(0, 1)}, {(0, 1)(1, 0)}, {(1, 0)(0, 0)},
{(0, 0)}, {(0, 1)}, {(1, 0)}, {(0, 1)}} .
(0,0)
(1,0)
(0,1)
Exercise 1.5. Draw a space made of triangles that is not a simplicial complex, and explain why it is not a simplicial complex.
We have started by making spaces using simplices as building blocks.
But what if we have a space, and we want to break it up into simplices? If J
is a topological space homeomorphic to K where K is a the underlying space
of a simplicial complex (K, T ) in Rm , then we say that J is triangulable.
Exercise 1.6. Show that the following space is triangulable:
1.4. 2-MANIFOLDS
(K,T)
(K,T)
1
3 v0
1.4
2-manifolds
The concept of the real line and the Euclidean spaces produced from the
real line are fundamental to a large part of mathematics. So it is natural to
10
CHAPTER 1. INTRODUCTION
1.4. 2-MANIFOLDS
1.4.1
11
V3
V2
V0
V1
Figure 1.3: Tetrahedral surface
The following theorem asserts that every compact 2-manifold is triangulable, but its proof entails some technicalities that would take us too far
afield. So we will analyze triangulated 2-manifolds and simply note here
without proof that our results about triangulated 2-manifolds actually hold
in the topological category as well.
Theorem 1.7. A compact, 2-manifold is homeomorphic to a compact, triangulated 2-manifold, in other words, all compact 2-manifolds are triangulable.
Definitions (1-skeleton and dual 1-skeleton).
1. The 1-skeleton of a triangulation T equals
T } and is denoted T (1) .
{j | j is a 1-simplex in
12
CHAPTER 1. INTRODUCTION
S
2. The dual 1-skeleton of a triangulation T equals {j | j is an edge of
a 2-simplex in T 0 and neither vertex of j is a vertex of a 2-simplex of
T }. An edge in the dual 1-skeleton has each of its ends at the barycenters of 2-simplices of the original triangulation, that is, physically each
edge in the dual 1-skeleton is composed of two segments, each running
from the barycenter of a 2-simplex to the middle of the edge they share
in the original triangulation. So an edge in the dual 1-skeleton is the
union of two 1-simplices in T 0 .
1.4. 2-MANIFOLDS
13
14
CHAPTER 1. INTRODUCTION
1.4.2
1.4. 2-MANIFOLDS
15
b
a
a
b
b
b
a
a
16
CHAPTER 1. INTRODUCTION
c
a
d
d
c
b
a
a
b
1.5. QUESTIONS
17
b
a
a
b
1.5
Questions
18
CHAPTER 1. INTRODUCTION
space or to specify what is different about two spaces, we must examine the
spaces looking for features or properties that are of topological significance.
Question 1.16. What features of the examples studied are interesting either
in their own right or for the purpose of distinguishing one from another?
Chapter 2
2-manifolds
2.1
20
CHAPTER 2. 2-MANIFOLDS
2.1.1
The basic idea of this proof is to show that removing an open disk from
a compact triangulated 2-manifold gives us a space homeomorphic to a
(closed) disk with some number of bands attached to its boundary in a
specified way. The number of bands, and how they are attached then gives
us the classification of the surface.
Theorem 2.4. Let M 2 be a compact, triangulated 2-manifold with triangulation T . Let S be a tree whose edges are 1-simplices in the 1-skeleton of T .
Then N (S), the regular neighborhood of S, is homeomorphic to D2 .
21
Theorem 2.5. Let M 2 be a compact, triangulated 2-manifold with triangulation T . Let S be a tree equal to a union of edges in the dual 1-skeleton of
T . Then {j00 | j00 T 00 and j00 S 6= } is homeomorphic to D2 .
Theorem 2.6. Let M 2 be a connected, compact, triangulated 2-manifold
with triangulation T . Let S be a tree in the 1-skeleton of T . Let S 0 be the
subgraph of the dual 1-skeleton of T whose edges do not intersect S. Then
S 0 is connected.
The following two theorems state that M 2 can be divided into two pieces,
one a disk D0 , and the other a disk (D1 ) with bands (the Hi s) attached to
it.
Theorem 2.7. Let M 2Sbe a connected,
compact, triangulated 2-manifold.
Then M 2 = D0 D1 ki=1 Hi where D0 , D1 , and each Hi is homeomorS
phic to D2 , Int D0 D1 = , the Hi s are disjoint, ki=1 Int Hi (D0 D1 ) =
, and for each i, Hi D1 equals 2 disjoint arcs each arc on the boundary
of each of Hi and D1 .
Theorem 2.8. Let M 2 be a connected, compact, triangulated 2-manifold.
Then:
1. There is a disk D0 in M 2 such that M 2 (Int D0 ) is homeomorphic to
the following subset of R3 : a disk D1 with a finite number of disjoint
strips, Hi for i {1, . . . n}, attached to boundary of D1 where each
strip has no twist or 1/2 twist. (See Figure 2.1.)
Sk
2. Furthermore, the boundary of the disk with strips, D1
i=1 Hi , is
connected.
Exercise 2.9. In the set-up in the previous theorem, any strip Hi divides
the boundary of D0 into two edges e1i and e2i , where Hi is not attached.
Show that if a strip Hj is attached to D0 with no twists, then there must be
a strip Hk that is attached to both e1j and e2j .
Theorem 2.10. Let M 2 be a connected, compact, triangulated 2-manifold.
Then there is a disk D0 in M 2 such that M 2 Int D0 is homeomorphic to a
disk D1 with strips attached as follows: first come a finite number of strips
with 1/2 twist each whose attaching arcs are consecutive along Bd D1 , next
come a finite number of pairs of untwisted strips, each pair with attaching
arcs entwined as pictured with the four arcs from each pair consecutive along
Bd D1 .
22
CHAPTER 2. 2-MANIFOLDS
Theorem 2.11. Let X be a disk D0 with one strip attached with a 1/2 twist
with its attaching arcs consecutive along Bd D0 and one pair of untwisted
strips with attaching arcs entwined as pictured with the four arcs consecutive
along Bd D0 . Let Y be a disk D1 with three strips with a 1/2 twist each whose
attaching arcs are consecutive along Bd D1 . Then X is homeomorphic to Y .
Theorem 2.12. Let M 2 be a connected, compact, triangulated 2-manifold.
Then there is a disk D0 in M 2 such that M 2 Int D0 is homeomorphic to
one of the following:
a) a disk D1 ,
b) a disk D1 with k 12 -twisted strips with consecutive attaching arcs, or
c) a disk D1 with k pairs of untwisted strips, each pair in entwining position with the four attaching arcs from each pair consecutive.
23
2.1.2
We now outline a different approach to proving that any compact, connected, triangulated 2-manifold is a sphere, the connected sum of tori, or
the connected sum of projective planes. This approach uses the quotient or
identification topology described in the previous chapter.
Suppose that we are gluing the edges of a polygonal disk to create a
2-manifold. If we assign a unique letter to each pair of edges that are glued
24
CHAPTER 2. 2-MANIFOLDS
together, and we read the letters as we follow the edges along the boundary
of the disk (starting at a certain edge) going clockwise, we get a word
made up of these letters. However, to specify the gluing we need to know
not only which edges are glued together, but in what orientation. To keep
track of that, we will write the letter alone if the orientation given on the
edge agrees with the direction were reading the edges in, and the letter to
the 1 power if it disagrees. For example, abca1 dcb1 d represents a gluing
of the octagon as indicated, so that the orientations of two identified edges
agree:
a
b
c
a
d
d
c
25
26
CHAPTER 2. 2-MANIFOLDS
Theorem 2.23. Any compact, connected, triangulated 2-manifold is homeomorphic to a 2n-gon with edges identified in pairs as specified in one of
the three following ways: aa1 , or a0 a0 a1 a1 . . . an an (where n 0) or
1
1 1
a0 a1 a1
0 a1 . . . an1 an an1 an (where n 1 is odd ).
Theorem 2.24 (Classification of compact, connected 2-manifolds). Any
connected, compact, triangulated 2-manifold is homeomorphic to the 2-sphere
S2 , a connected sum of tori, or a connected sum of projective planes.
2.2. PL HOMEOMORPHISM
2.2
27
PL Homeomorphism
28
2.3
CHAPTER 2. 2-MANIFOLDS
Invariants
2.3.1
Euler characteristic
number of vertices in T
e =
number of 1-simplices in T
number of 2-simplices in T
2.3. INVARIANTS
29
Theorem 2.26. Let M12 and M22 be connected, compact, triangulated 2manifolds. If M12 is PL-homeomorphic to M22 , then (M12 ) = (M22 ).
Since PL-homeomorphic manifolds must have the same Euler characteristic, Euler characteristic helps to distinguish between 2-manifolds that are
not PL-homeomorphic.
Theorem 2.27.
1. (S2 ) = 2.
2. (T2 ) = 0.
3. (RP2 ) = 1.
4. (K2 ) = 0.
Theorem 2.28. Let M12 and M22 be two connected, compact, triangulated
2-manifolds. Then (M12 # M22 ) = (M12 ) + (M22 ) 2.
Theorem 2.29. Let T2i be the torus for i = 1, . . . , n. Then
#
i=1
T2i
= 2 2n.
= # T2 is n.
i=1
2.3.2
Orientability
Euler characteristic is a useful invariant, in that it helps to distinguish 2manifolds. However, it does not distinguish between the torus and the Klein
bottle, for example. In fact, for each even number 0 there are two nonhomeomorphic compact, connected, triangulated 2-manifolds of that Euler
characteristic, one a connected sum of tori, and one a connected sum of projective planes. So although Euler characteristic is useful for distinguishing
non-homeomorphic surfaces, it does not differentiate all different surfaces.
30
CHAPTER 2. 2-MANIFOLDS
There is a second invariant which, when combined with Euler characteristic, will allow us to distinguish between any two non-homeomorphic,
compact, connected 2-manifolds. This invariant is orientability.
A surface is orientable if we can choose an ordered basis for the local
Euclidean structure at each point of the surface in such a way that the
bases change smoothly as the point moves along a path in the surface.
Note that orientability on its own is a very coarse invariant: a 2-manifold
is either orientable or non-orientable. In other words, orientability divides
the set of all 2-manifolds into two classes. It turns out that the combination
of orientability and Euler characteristic is enough to differentiate any two
compact, connected, triangulated 2-manifolds.
We can explore the concept of orientability in triangulated surfaces by
considering orderings of the vertices of each simplex.
First let us see what we mean by an orientation of a 0-, 1-, and 2-simplex.
Definitions (oriented simplices). Let 2 be the 2-simplex {v0 v1 v2 }, 1 be
the 1-simplex {w0 w1 }, and 0 be the 0-simplex {u0 }.
1. Two orderings of the vertices v0 , v1 , . . . vn of an n-simplex n are
said to be equivalent if they differ by an even permutation. Thus
{v0 , v1 , v2 } {v1 , v2 , v0 }. However, {v0 , v1 , v2 } 6 {v1 , v0 , v2 } since
they differ by a single 2-cycle, which is an odd permutation. Note that
this equivalence relation produces precisely two equivalence classes of
orderings of vertices of an n-simplex for n 1. An equivalence class
will be denoted by [v0 v1 . . . vn ], where {v0 , v1 , . . . , vn } is an element of
the equivalence class.
2. An orientation of the 2-simplex 2 is a one-to-one and onto function
o from the two equivalence classes of the orderings of the vertices of
2 to {1, 1}. Note that there are two possible such orientations for
2 . Any vertex ordering that lies in the equivalence class whose image
is +1 will be called positively oriented or will be said to have a positive
orientation, orderings in the other class will be said to be negatively
oriented or have a negative orientation. We can indicate the chosen
positive orientation for 2 by denoting 2 as [v0 v1 v2 ], where [v0 v1 v2 ]
is in the positive equivalence class. Note that o[v0 v1 v2 ] = o[v1 v0 v2 ].
You can draw a circular arrow inside the 2-simplex in the direction
indicated by any of the positively oriented orderings. That circular
arrow (which will be either clockwise or counterclockwise on the page)
indicates the choice of (positive) orientation for that 2-simplex.
2.3. INVARIANTS
31
32
CHAPTER 2. 2-MANIFOLDS
We can now define what we mean by an orientable, triangulated 2manifold. Intuitively, a triangulated 2-manifold is orientable if it is possible
to select orientations for each 2-simplex in such a way that neighboring 2simplices have compatible orientations. The concept of compatible comes
from the following observation. If you draw two triangles in the plane that
share an edge and orient them both in a counterclockwise ordering, say,
then the shared edge has induced orientations from the two triangles that
are opposite to each other. In other words, when the orientations on both
triangles are the same, then the induced orientations on a shared edge are
opposite. This observation gives rise to the definition of orientability.
Definition (orientablity). A triangulated 2-manifold M 2 is orientable if and
only if an orientation can be assigned to each 2-simplex in the triangulation
such that given any 1-simplex e 1 2 , the orientation induced on e by 1 is
opposite to the orientation induced by 2 . Otherwise, M 2 is non-orientable.
A choice of orientations of the 2-simplices of a triangulation of M 2 satisfying the condition stated above is called an orientation of M 2 .
Note.
Theorem 2.32. Suppose (M 2 , T ) is a 2-manifold with triangulation T and
T 0 is a subdivision of T . Then if (M 2 , T ) is orientable, so is (M 2 , T 0 ).
Theorem 2.33. Orientability is preserved under PL homeomorphism.
Theorem 2.34. M 2 is orientable if and only if it contains no M
obius band.
Theorem 2.35. Let M = M1 # . . . # Mn . Then M is orientable if and only
if Mi is orientable for each i {1, . . . , n}.
Compact, connected, triangulated 2-manifolds are determined by orientability and Euler characteristic.
Theorem 2.36 (Classification of compact, connected 2-manifolds). If M 2
is a connected, compact, triangulated 2-manifold then:
(a) if (M 2 ) = 2, then M 2
= S2 .
(b) if M 2 is orientable and (M 2 ) = 2 2n, for n 1, then
M
=
2
#
i=1
Ti2
.
2.3. INVARIANTS
33
34
CHAPTER 2. 2-MANIFOLDS
Problem 2.37. Identify the following 2-manifolds as a sphere, or a connected sum of n tori (specifying n), or a connected sum of n projective planes
(specifying n).
a. T#RP
b. K#RP
c. RP#T#K#RP
d. K#T#T#RP#K#T
2.4. CW COMPLEXES
2.4
35
CW complexes
u
w
w
v
w
v
36
CHAPTER 2. 2-MANIFOLDS
2.4. CW COMPLEXES
37
u3
u2
v
g2
u1
g
u4
g1
u0
u3
g4
u2
g3
g2
u1
u4
g1
u0
38
CHAPTER 2. 2-MANIFOLDS
c
a
d
d
c
b. The surface obtained by identifying the edges of the decagon as indicated (See Figure 2.10):
b
c
e
c
2.5
Exercise 2.46. What should be the definition of a connected, compact, triangulated 2-manifold-with-boundary?
39
Your definition should be general enough to include the following examples of 2-manifolds-with-boundary:
1. D2
3. Pair of pants:
40
CHAPTER 2. 2-MANIFOLDS
Figure 2.13:
Figure 2.14:
Once you have the above work done, you should be able to completely
classify and identify all connected, compact, triangulated 2-manifolds, with
and without boundary.
To distinguish a compact manifold with no boundary from one with topological boundary or to emphasize that a compact manifold has no boundary
the term closed manifold is often used. Beware: this term does not mean
topologically closed, as in the complement of an open set, but rather it
means a manifold that is compact without boundary. Both closed manifolds and compact manifolds-with-boundary are in fact closed subsets (in
the topological sense) of Rn and non-compact manifolds might be embedded as topologically closed subsets of Rn . This unfortunate terminology is
one of many examples of the use of a single word to signify several different
meanings. Context usually makes the meaning clear.
Problem 2.48. Identify the following surfaces made by two disks joined by
bands as indicated (See Figures 2.15 and 2.16):
Exercise 2.49. Fill out the following table, using the connected sum decom-
41
2
1
0
1
2
3
4
5
0
orient.
1
non-or.
orient.
2
non-or.
orient.
3
non-or.
orient.
non-or.
42
CHAPTER 2. 2-MANIFOLDS
2.6
*Non-compact surfaces
The surfaces studied so far in this chapter are all compact and connected
2-manifolds, with or without boundary. We can also consider non-compact
2-manifolds, but we will not do so in this class. An interesting question to
ask yourself is: how do you extend all the concepts learned about compact
spaces to non-compact ones?
For example, can you formulate and prove a classification theorem for
non-compact, connected, triangulated 2-manifolds? One of the difficulties
that arises in the non-compact case is that we no longer have a finite set of
simplices in the triangulation.
The following exercises illustrate what some of the complications of classifying non-compact 2-manifolds may be, even when we restrict to the orientable case:
Exercise 2.50. Below are some non-compact 2-manifolds. Are any of these
spaces are homeomorphic? (Beware! It may be harder than you think!) Can
you prove whether they are or are not homeomorphic? (See Figure 2.17)
Exercise 2.51. Let M be the non-compact 2-manifold made by taking the
two parallel planes {(x, y, 1)|x, y R} and {(x, y, 0)|x, y R}, removing
43
44
v0
CHAPTER 2. 2-MANIFOLDS
v1
v2
v3
v0
v3
b
v4
v0
v4
v1
v2
v0
v0
v1
45
v2
v3
v0
v3
b
v4
v0
v4
v1
v2
v0
46
v0
CHAPTER 2. 2-MANIFOLDS
v1
v2
v3
v0
v3
b
v4
v0
v4
v1
v2
v0
v0
v1
47
v2
v3
v0
v3
b
v4
v0
v4
v1
v2
Figure 2.21: The Klein bottle triangled by its second baricentric subdivision
v0
48
CHAPTER 2. 2-MANIFOLDS
Chapter 3
track. To make the analogy exact, we will insist that the car does return to
the exact point where it started.
Lets become a little more mathematical in our description of the fundamental group of the racetrack. A racetrack is known mathematically as an
annulus, which we could describe as A2 = {(x, y) R2 |1/2 x2 + y 2 1}
(See Figure 3.1).
We choose a point x0 on the annulus to be the base point. Then consider any continuous function f from a simple closed curve (
= S1 ) into the
1
annulus. We will choose a point on S to start, call it z, and require that
f (z) = x0 . Intuitively, that map f of S1 into the annulus goes around the
annulus some number of times. Physically, we can think of f as laying a
rubber band around the annulus with the point z placed on top of x0 . If we
think about the intuitive concept of how many times the map goes around
the annulus, we soon see that, in the rubber band model, if we could distort
the rubber band to a new position without lifting it out of the annulus,
then it would still go around the same number of times. Sliding around and
distorting a map are really giving a continuous family of maps of S1 into
the annulus. Such a continuous family of maps is called a homotopy. The
fundamental group just makes mathematically precise the idea of putting
maps of a circle into a space into equivalence classes via the idea of homotopy. To get to the idea of fundamental group, well first develop the idea
of a homotopy between maps from any space to any other space and then
specialize that idea to define the fundamental group.
3.1
Fundamental group
We all have a familiarity with the idea of a homotopy, because we have all
watched movies. Lets think of the physical objects that are being projected
onto the screen as the domain and think of the screen as the plane R2 . So,
51
our domain might be two people, a dog, and a table. We will assume that all
of these objects are projected at every moment of our movie and that we are
thinking of an idealized projection system that projects that image at every
instant of time. So, this movie has uncountably many frames per second.
We are also thinking of the camera as being fixed throughout. When the
scene opens at time 0, the people, dog, and table are shown posed in some
no doubt interesting tableau. Every point in each person, dog, and table is
mapped to a point on the screen. Notice that this map is not 11. Points on
the inside of each object certainly are mapped to places where other points
map as well. At time 0, the action commences. The people move about,
gesticulating animatedly. The dog barks and wags its tail. The table just
sits there. At every instant of the film, each point in the people, dog, and
table are mapped via projection to a point in R2 , also known as the silver
screen. At time 1, the movie is over. It ends with the points of the people,
dog, and table being mapped to points on the screen. The first scene of the
move, which was a function from the domain (people, dog, table) into the
range (R2 ), was transformed via a continuous family of maps (the scenes at
each moment) into the last scene of the movie, which was another function
from the domain (people, dog, table) into the range (R2 ). The beginning
scene and final scene of our movie illustrate the idea of homotopic maps,
which we now define formally.
Definition (homotopic maps). Let f , g : X Y be two continuous functions. f and g are said to be homotopic if there is a continuous map
F : X [0, 1] Y such that F (x, 0) = f (x) and F (x, 1) = g(x) for all
x X. We denote that maps f and g are homotopic by writing f ' g. The
map F is called a homotopy between f and g.
If g is a constant map (mapping all points in X to a single point in Y )
and f ' g, then we say f is null homotopic.
Theorem 3.1. Given topological spaces X and Y , ' is an equivalence relation on the set of all continuous functions from X to Y .
We can think of a homotopy of two maps as a continuous 1-parameter
family of maps Ft from X to Y deforming f into g (i.e., F0 = f and
F1 = g).
Notice that in the gripping movie that we described earlier, the table
remained fixed throughout. So at each moment of the film, the function
when restricted to the table was the same for the whole duration of the
movie. That consistency on a subset of the domain gives rise to the idea of
a relative homotopy.
53
(0)
(0)
(1)
(1)
(0)
(1)
(0)
(1)
Notice the need to speed up in order to accomplish both the paths and
during the prescribed 1 unit of time allotted for a path.
Theorem 3.5. If 0 and 0 , then 0 0 .
Thus products of paths can be extended to products of equivalence
classes by defining [] [] := [ ]. Products of paths and products of
equivalence classes of paths enjoy the associative property.
Theorem 3.6. Given , , and , then ( ) ( ) and ([]
[]) [] [] ([] []).
If we think of a path as taking us from (0) to (1), then traversing
that same trail in reverse is the inverse path.
Definition (path inverse). Let be a path, then its path inverse 1 is the
path defined by 1 (t) = (1 t).
If we take a path and then take its inverse, that combined path is equivalent to not moving at all.
Theorem 3.7. Let be a path with (0) = x0 , then 1 ex0 , where
ex0 is the constant path ex0 : [0, 1] x0 . Stated differently, if is a path,
then 1 is homotopically trivial.
We now have all the ingredients to associate a group with a topological
space. This group has been designed to try to capture the idea of holes in
the space.
Definition (fundamental group). Let x0 X, a topological space. Then the
set of equivalence classes of loops based at x0 with binary operation [][] =
[ ] is a called the fundamental group of X based at x0 and is denoted
1 (X, x0 ). The point x0 is called the base point of the fundamental group.
Theorem 3.8. The fundamental group 1 (X, x0 ) is a group. The identity
element is the class of homotopically trivial loops based at x0 .
55
3.1.1
Cartesian products
3.1.2
57
Induced homomorphisms
3.2
59
We can re-word the definition in terms of homotopies: a strong deformation retraction r : X A is a retraction that is homotopic to the identity
on X relative to A.
Exercise 3.25. Show that R2 {2 points} strong deformation retracts onto
the wedge of two circles. In addition, show that R2 {2 points} strong
deformation retracts onto a theta curve. Are the wedge of two circles and
the theta curve homeomorphic? (See Figure 3.4)
Figure 3.4: The wedge of two circles (left) and theta curve right
a
a
3.3
At this stage, S1 is the only source of examples of spaces with non-trivial fundamental groups. It seems a lot of work for not much payoff! So the question
now becomes: How can we compute the fundamental group of more complex
spaces, in particular, spaces with 1 (X) 6= 1. So far, we only have the ability
to compute the fundamental group of spaces two ways: taking the Cartesian
product of spaces whose fundamental groups we already know, and taking
strong deformation retracts involving one space whose fundamental group
we already know. The first allowed us to compute the fundamental group of
products of Sn , and, in particular, the fundamental group of the torus and
the annulus, and the second allowed us to calculate the fundamental group
of the annulus a second way, and also the fundamental group of other spaces
such as the dunces hat and the house with two rooms. But at this point we
cant compute the fundamental groups of any surfaces other than the torus,
let alone more general spaces.
To expand the number of spaces whose fundamental groups we can compute, our strategy will be to think about breaking up spaces into pieces
whose fundamental groups we know and analyzing how the fundamental
61
3.3.1
There are many ways of creating new groups from given groups. One of
them, which is useful in the context of fundamental groups, is the free
product. Here is how to think about the free product of two groups G
and H. Each element of the free product G H is just a finite string of
letters from G and H juxtaposed. So elements (called words) of G H
are of the form g1 h1 g2 h2 . . . gn hn , h1 g2 h2 . . . gn hn , g1 h1 g2 h2 . . . hn1 gn or
h1 g1 h2 g2 . . . gn1 hn . To multiply two such strings, we just juxtapose them.
If there are two gs next to each other, we multiply them in G and replace
them by the answer. We do the same procedure with two hs next to each
other. If any g or h is the identity in its respective group, then we erase
it. This means that the identities are really considered the same identity,
which is the identity of G H. And thats it.
Here is a more formal definition using group presentations:
Definition (free product of groups). Let G and H be two groups. The free
product of G and H, denoted GH is the group generated by all the elements
of G and H, subject only to the relations for G and H. In other words, if
G = hg1 , . . . , gn |r1 , . . . , ru i
63
[We state the following theorem about the fundamental group of the
Hawaiian earring just for interest, but it does not fit into the flow of the
current discussion.
*Theorem 3.39. Show that 1 (Hawaiian earring) is not finitely generated,
in fact, 1 (Hawaiian earring) is not countably generated.]
3.3.2
Sometimes, one can break up a space into two pieces that are each simply
connected.
Theorem 3.40 (Van Kampens Theorem, simply connected pieces case).
Let X = U V where U and V are open, path connected, and simply connected subsets of X and U V is path connected. Then X is simply connected.
Exercise 3.41.
1. 1 (S2 ) = 1
2. 1 (Sn ) = 1
A good strategy when presented with a theorem is to ask yourself if the
hypotheses can be further weakened. A good habit when learning a new
theorem is to try to generate counterexamples that illustrate the limits of
theorems and the necessity of each hypothesis.
Question 3.42. Can you find an example where U and V are simply connected, but X = U V is not simply connected?
3.4
65
natural for us to think about how the fundamental group of a connected sum
is related to the fundamental groups of the two punctured surfaces whose
union makes it up.
Exercise 3.48. Suppose that M 2 = T1 #T2 where T1 and T2 are tori and
M 2 = U V where U is an open set of T1 homeomorphic to T1 (a disk), V is
an open set of T2 homeomorphic to T2 (a disk), and U V is homeomorphic
to an open annulus. Let p U V . We know from a previous exercise that
1 (U, p) is generated by two loops and . Likewise, 1 (V, p) is generated by
two loops and . Consider the loop that generates 1 (U V, p). Represent
in terms of the generators of 1 (U, p). Now represent in terms of the
generators of 1 (V, p). So the single loop is equivalent to two different loops
in M 2 . 1 (M 2 , p) is generated by {, , , }. What relations exist among
these generators? Give a presentation of 1 (M 2 , p) whose generators are
{, , , }.
The exercise above gives the basic insight into how we can deduce the
fundamental group of a union of two pieces from the fundamental groups of
the two pieces.
3.5
Van Kampens Theorem says that if we can split a space X into two parts U
and V satisfying certain conditions, and we know what 1 (U ) and 1 (V ) are,
then we can find 1 (X) (up to isomorphism, as always). We have already
seen two special cases of this result. Let us now see Van Kampens Theorem
in full generality.
Group presentations are useful, concrete ways of representing 1 (although not completely trouble-free, as it is hard to tell when two presentations represent the same group). Van Kampens Theorem can be stated in
the language of group presentations.
Theorem 3.49 (Van Kampens Theorem; group presentations version).
Let X = U V , where U, V are open and path connected and U V is path
connected and non-empty. Let x U V .
Let 1 (U, x) = hg1 , . . . , gn |r1 , . . . , rm i, 1 (V, x) = hh1 , . . . , ht |s1 , . . . , su i
and 1 (U V, x) = hk1 , . . . , kv |t1 , . . . , tw i then
1 (X, x) = hg1 , . . . , gn , h1 , . . . , ht | r1 , . . . , rm , s1 , . . . , su ,
i (k1 ) = j (k1 ), . . . , i (kv ) = j (kv )i
where i, j are the inclusion maps of U V into U and V respectively.
Without the language of group presentations, Van Kampens Theorem
is stated as follows:
Theorem 3.50 (Van Kampens Theorem). Let X = U V where U, V are
open and path connected and U V is path connected and non-empty. Let
x U V . Then
1 (U, x) 1 (V, x)
1 (X, x)
=
N
where N is the smallest normal subgroup containing {i ()j (1 )}1 (U V,x)
and i, j are the inclusion maps of U V in U and V respectively. Note that
N is the set of products of conjugates of i ()j (1 ).
Exercise 3.51. Use Van Kampens theorem to explicitly calculate the group
presentation of the double torus T2 # T2 .
The following two exercises probably should have occurred in the fundamental group section.
Exercise 3.52. Let K be the space shown in Figure 3.7. What is 1 (K)?
Exercise 3.53. For any finitely presented group G, describe a 2-complex K
such that 1 (K) = G.
3.6. 3-MANIFOLDS
67
v
a
b
c
a
3.6
3-manifolds
3.6.1
Lens spaces
11111111111111
00000000000000
0000
1111
000000000000001111
11111111111111
0000
00000000000000
11111111111111
0000
1111
000000000000001111
11111111111111
0000
00000000000000
11111111111111
0000
1111
00000000
11111111
0000000000000011111111
11111111111111
0000
1111
00000000
00000000
11111111
00000000
11111111
00000000
11111111
00000000
11111111
J
Figure 3.9: Solid torus with meridian
triangles around the equator. The resulting quotient space is a lens space
(See Figure 3.8).
Definition (isotopy). A homotopy Ht : X Y (t I) is an isotopy if and
only if for every t in I, Ht is an embedding.
Exercise 3.54. Show that isotopies form an equivalence relation on the set
of all embeddings of X into Y .
Definition (meridian). Let V
= D2 S1 be a solid torus. A simple closed
curve J on Bd V is a meridian if and only if it bounds a disk in V (See
Figure 3.9).
Definition (longitude). Let V
= D2 S1 . A simple closed curve K on Bd V
is a longitude or longitudinal curve if and only if K represents the generator
3.6. 3-MANIFOLDS
69
3.6.2
Knots in S3
3.6. 3-MANIFOLDS
71
a1
a3
a2
b
c
a
Exercise 3.62. Find the fundamental group of the complement of the unknot (See Figure 3.13).
Exercise 3.63. Find the fundamental group of the complement of the trefoil
knot.
Exercise 3.64. Find the fundamental group of the complement of the figure8 knot (See Figure 3.14).
3.7
73
3.8
3.9
75
Covering spaces
Theorem 3.69.
1. Any loop : I S1 can be written =
e, where
e : I R1 ,
Figure 3.17:
77
e e if and only if .
e p) is a cover of X, then p is a monomorphism (i.e.,
Theorem 3.83. If (X,
e into 1 (X).
11 or injective) from 1 (X)
The previous theorem implies that the fundamental group of a cover of
X is isomorphic to a subgroup of the fundamental group of the space X.
e p) be a cover of X, a loop in X, and x
e
Theorem 3.84. Let (X,
e0 X
such that p(e
x0 ) = (0). Then lifts to a loop based at x
e0 if and only if
e
[] p (1 (X, x
e0 )).
79
e1 , p1 ) and (X
e2 , p2 ) be covering spaces of X. Let x
Theorem 3.91. Let (X
e1
e
e
X1 and x
e2 X2 such that p1 (e
x1 ) = p2 (e
x2 ). Then there is cover isomorphism
e1 X
e2 with f (e
e1 , x
e2 , x
f :X
x1 ) = x
e2 if and only if p (1 (X
e1 )) = p (1 (X
e2 )).
e p) be a covering space. Then
Definition (covering transformation). Let (X,
e
a cover isomorphism from X to itself is called a covering transformation.
e p), is a group where the
The set of covering transformations, denoted C(X,
group operation is composition.
e p) for the covering space of the figure eight
Exercise 3.92. What is C(X,
shown in Figure 3.19.
e p) is a covering space of X and f C(X,
e p), then
Theorem 3.93. If (X,
f = IdXe if and only if f has a fixed point.
e p) be a covering space of X. If p (1 (X))/
e
Definition (regular cover). Let (X,
e
1 (X), then (X, p) is a regular covering space.
Question 3.94. Consider the second three-fold covering space of the figure
e which, when conjugated,
eight in Example 3. Find an element of p (1 (X))
e
is not in p (1 (X)).
e p) is a regular covering space of X and x1 , x2 X
e
Theorem 3.95. If (X,
e p) such that
such that p(x1 ) = p(x2 ), then there exists a unique h C(X,
h(x1 ) = x2 .
81
Question 3.96. The preceding theorem tells us that for a regular covering
space, there is a (unique) covering transformation carrying any point in the
set p1 (x) to any other point in the same set. Is this true of an irregular
covering space?
Theorem 3.97. A covering space is regular if and only if for every loop
either all its lifts are loops or all its lifts are paths that are not loops.
Exercise 3.98.
1. Describe all regular 3-fold covering spaces of a figure eight.
2. Describe all irregular 3-fold covering spaces of a figure eight.
3. Describe all regular 4-fold covering spaces of a figure eight.
4. Describe all irregular 4-fold covering spaces of a figure eight.
5. Describe all regular 3-fold covering spaces of a wedge of 3 circles.
6. Describe all regular 4-fold covering spaces of a wedge of 3 circles.
There is an important correspondence between the covering transformations of regular covers of X and the normal subgroups of 1 (X).
e p) be a regular covering space of X. Then C(X,
e p)
Theorem 3.99. Let (X,
=
e
e
e
1 (X)/p (1 (X)). In particular, C(X, p) = 1 (X) if X is simply connected.
Exercise 3.100. Observe that the standard wrap map is a regular covering
map of S1 by R1 . Describe the covering transformations for this covering
space. Describe the covering map that maps R2 to the torus T2 and describe
the covering transformations for this covering space.
Definition (semi-locally simply connected). A space X is called semi-locally
simply connected if and only if every x X is contained in an open set U
such that every loop in U based at x is homotopically trivial in X.
Note that U need not be simply connected itself.
Theorem 3.101 (Existence of covering spaces). Let X be connected, locally path connected, and semi-locally simply connected. Then for every
e p) of X and x
e such that
G < 1 (X, x0 ) there is a covering space (X,
e0 X
e
e
p (1 (X, x
e0 )) = G. Furthermore, (X, p) is unique up to isomorphism.
Definition (universal cover). A connected, locally path connected cover is
called universal if and only if its fundamental group is trivial.
3.10
Chapter 4
Homology
We have seen that the fundamental group of a space uses loops that are not
null-homotopic to understand the holeyness of a space. For distinguishing
spaces, the fundamental group is a valuable tool, but has some challenges
associated with it. For one thing, the fundamental group is in general not
an abelian group. This feature makes it difficult to determine in general
whether two fundamental groups might be the same if they have different
presentations. The Classification of Abelian Groups allows us to determine
which abelian groups are isomorphic and which are not, so it would be nice to
associate meaningful abelian groups with spaces. Of course, the fundamental group of a space may be giving us more refined information. However,
in many cases, we dont need that much information to capture some of the
holeyness of a space. For example, recall that when we used the fundamental group to distinguish surfaces from one another, the abelianizations
of the fundamental groups were sufficient to make the distinctionsthe whole
fundamental group was not used.
The second shortcoming of the fundamental group for measuring holeyness of spaces is that it captures only holes that are surrounded by loops.
It does not measure holes surrounded by spheres, for example. A 3-ball
with a sub-ball removed still has trivial fundamental group. In this chapter, then, we will introduce the concept of homology, which associates with
spaces abelian groups that measure holes in all dimensions and are often
easy to compute.
We will study the homology of simplicial complexes. The ideas we develop here can be generalized to apply to more comprehensive classes of
spaces, but we will not study those generalizations in this course.
83
84
CHAPTER 4. HOMOLOGY
v2
e2
v1
e6
e3
v5
e4
1
e1
v3
e7
e5
v4
4.1
Z2 homology
4.1. Z2 HOMOLOGY
4.1.1
85
Simplicial Z2 homology
where the
in1 s
Definition
(Z2 -boundary of an n-chain). The Z2 -boundary of the n-chain
Pk
n
i=1 i is
k
k
X
X
n
(
i ) =
(in )
i=1
i=1
where the sum is mod 2; i.e., if a simplex appears an even number of times
it cancels.
For example, 1 + 2 + 2 + 3 + 3 + 3 = 1 + 3 .
Notice that boundary of an n-chain is an (n 1)-chain.
Definition (Z2 n-cycle). A Z2 n-cycle is an n-chain whose Z2 -boundary is
zero.
Theorem 4.1. For any Z2 n-chain C, ((C)) = 0, that is, the boundary
of any n-chain is an (n 1)-cycle.
Definition (Z2 -equivalence of cycles). In a complex (K, T ) n-cycles An and
B n are Z2 -equivalent if and only if An B n (= An + B n ) = (C n+1 ), where
C n+1 is an (n + 1)-chain. The equivalence class that An is a member of will
be denoted by [An ].
[Note: We use the minus sign in An B n in anticipation of Z homology
to come.]
86
CHAPTER 4. HOMOLOGY
Question 4.2. List all the equivalence classes of 0-, 1- and 2-cycles in
a triangulated sphere, torus, projective plane, Klein bottle, and then each
compact, connected, triangulated 2-manifold.
Definition (Z2 nth -simplicial homology). The Z2 nth -homology of a finite simplicial complex (K, T ), denoted Hn ((K, T ); Z2 ) is the additive group
whose elements are equivalence classes of cycles under the Z2 -equivalence
defined above, where [An ] + [B n ] := [An + B n ].
Exercise 4.3. Show that the addition for Hn ((K, T ); Z2 ) defined above is
well-defined.
Theorem 4.4. Let (K, T ) be a finite simplicial complex with triangulation
T , then Hn ((K, T ); Z2 ) is an abelian group.
Theorem 4.5. Let K be connected and let (K, T ) be a finite simplicial
complex with triangulation T , then H0 ((K, T ); Z2 ) is Z2 .
Homology would be an uninteresting concept if it depended on the particular triangulation selected; however, in fact, the homology groups of a
space are independent of which triangulation is used. For now, lets accept
the following two theorems, which are the basis of that fact, and later well
look at an outline of how they are proved. The first of these theorems simply
states that subdividing the triangulation of a complex does not change the
homology that we compute.
Theorem 4.6. Let (K, T ) be a finite simplicial complex and let T 0 be a
subdivision of T . Then Hn ((K, T ); Z2 ) is isomorphic to Hn ((K, T 0 ); Z2 ) .
Theorem 4.7. Let K be a subset of Rn and let T and T 0 be triangulations
of K that make (K, T ) and (K, T 0 ) finite simplicial complexes. Then there
is a triangulation T 00 that is a subdivision of both T and T 0 .
Corollary 4.8. Let K be the underlying subset of a finite simplicial complex.
Then Hn ((K, T ); Z2 )
= Hn ((K, T 0 ); Z2 ) for any triangulations T and T 0 of
K.
This corollary means that the homology of a set is independent of the
particular triangulation chosen for it.
4.1.2
CW Z2 -homology
The difficulty with simplicial complexes is that they frequently have a lot of
simplices. To compute Hn , we would need to consider the boundaries of all
4.1. Z2 HOMOLOGY
87
, denoted by Int() or , be = .
Theorem 4.9. Let (K, T ) be a finite simplicial complex where T = {i }i=1,..k .
Then K
k
G
K=
i ,
1
88
CHAPTER 4. HOMOLOGY
Examples 1.
1. Let (K, T ) be a simple closed curve with triangulation shown (a square).
Then one vertex and one open cell would form a CW decomposition of
K.
4.1. Z2 HOMOLOGY
89
v
a
b
c
a
90
CHAPTER 4. HOMOLOGY
Since any triangulation or CW decomposition of K yields the same homology groups, we often suppress the triangulation or CW decomposition
in the notation and just refer to Hn (K; Z2 ).
Question 4.12. For each space K below, describe a CW decomposition of
it and describe Hn (K; Z2 ) for n = 0, 1, 2, 3, . . .:
1. the sphere.
2. the torus.
3. the projective plane.
4. the Klein bottle.
5. the double torus.
6. any compact, connected, triangulated 2-manifold.
7. the M
obius band.
8. the annulus.
9. Two (hollow) triangles joined at a vertex.
91
4.2
One strategy for computing homology is to divide the space into parts and
see how the homology groups of the whole are related to the homology
groups of its parts. The next several theorems should remind the reader
of special cases of Van Kampens theorem from the theory of fundamental
groups.
Theorem 4.19. Let K L denote the wedge of finite simplicial complexes
K and L. Then Hn (K L; Z2 )
= Hn (K; Z2 ) Hn (L; Z2 ) for n > 0.
Theorem 4.20. Suppose M is a finite simplicial complex with subcomplexes
K and L such that K L = M . If Hn (K L; Z2 ) = 0, then Hn (M ; Z2 )
=
Hn (K; Z2 ) Hn (L; Z2 ).
Exercise 4.21. Compute Hn (K; Z2 ) (n = 0, 1, 2, . . .) for each complex K
below.
1. A wedge of k circles.
2. A wedge of a 2-sphere and a circle.
3. A 2-sphere union its equatorial disk.
4. A double solid torus.
Theorem 4.22. Let M be a finite simplicial complex with subcomplexes K
and L such that K L = M . Suppose n 2 and that for every n-cycle Z in
K L, Z Z2 0 in K and Z Z2 0 in L, and Hn1 (K L; Z2 ) = 0. Then
Hn (M ; Z2 )
= Hn (K; Z2 ) Hn (L; Z2 ).
The case n = 1 is slightly different, namely, suppose for every 1-cycle Z
in K L, Z Z2 0 in K and Z Z2 0 in L, and H0 (K L; Z2 ) = Z2 . Then
H1 (M ; Z2 )
= H1 (K; Z2 ) H1 (L; Z2 ).
92
CHAPTER 4. HOMOLOGY
Again, the previous theorem might remind the reader of a a special case
of Van Kampens Theorem.
Question 4.23. State and prove a theorem giving the Z2 -homology groups
for connected compact 2-manifolds, using the theorem above and the connected sum decomposition of each 2-manifold.
4.3
93
f
f# y
y#
94
CHAPTER 4. HOMOLOGY
Note that at this point, it is not clear that f takes cycles to cycles. The
following theorem asserts that all is well.
Theorem 4.27. Let (K, T ) and (L, S) be finite simplicial complexes. Let
f : K L be a simplicial map. Then the induced homomorphism f :
Hn (K; Z2 ) Hn (L; Z2 ) is a well-defined homomorphism.
In order to deal with continuous functions rather than simply with simplicial maps, we sketch a proof below that any continuous function can be
approximated by a simplicial map that is homotopic to it.
Theorem 4.28. Let (K, T ) and (L, S) be finite simplicial complexes and
f : K L be a continuous function. Then there exists a subdivision T 0 of
T and a simplicial map g : (K, T 0 ) (L, S) such that f is homotopic to g
and g is a simplicial map.
The proof of this theorem uses the following.
Definition (star of a vertex). Let (K, T ) be a simplicial complex. Then
the star of v, where v is a vertex of T , is defined as St(v, T ) = {
T |v is a vertex of }.
Sketch of Proof. Subdivide T to obtain T 0 such that for every vertex v of
T 0 , f (St(v, T 0 )) Int(St(w, S)) for some vertex w of S. For each v define
g(v) = w where w is any vertex in S for which f (St(v, T 0 )) Int(St(w, S)).
Extend g linearly over each simplex. Show that g is a simplicial map and g
is homotopic to f .
2.
Theorem 4.29. Let T and T 0 be two different triangulations of a finite
simplicial complex K and let (L, S) be a finite simplicial complex. Suppose
f : (K, T ) (L, S) and g : (K, T 0 ) (L, S) are simplicial maps such that
f is homotopic to g. Then the induced homomorphism f : Hn (K; Z2 )
Hn (L; Z2 ) is the same homomorphism as g .
Sketch of Proof. Find a simplicial approximation of the homotopy H
between f and g that is linear with respect to a common subdivision T of
T and T 0 . For any n-cycle A in (K, T ), show that [f# (A)] = [g# (A)] by
using the (n + 1)-chain H# (A [0, 1]).
2.
These results allow us to extend our definition of the induced homomorphism f to apply to continuous functions f : K L (rather than just
applying to simplicial maps) and to know that f is well-defined.
Theorem 4.30. Let K and L be finite simplicial complexes such that K is
a strong deformation retract of L. Then Hn (K; Z2 )
= Hn (L; Z2 ).
95
96
4.4
CHAPTER 4. HOMOLOGY
Applications of Z2 homology
97
4.5
Z2 Mayer-Vietoris Theorem
The goal of this section is to describe how the homology groups of a complex
are related to the homology groups of pieces of the complex. We begin with
some theorems that relate cycles in the whole complex to cycles and chains
in its parts.
Theorem 4.47. Let K be a finite simplicial complex and K0 and K1 be
subcomplexes such that K = K0 K1 . If A0 , A1 are (n 1)-cycles in K0
and K1 respectively and if A0 Z2 A1 in K, then there is a (n 1)-cycle C
in K0 K1 such that A0 Z2 C in K0 and A1 Z2 C in K1 .
Theorem 4.48. Let K be a finite simplicial complex and K0 and K1 be
subcomplexes such that K = K0 K1 . Let Z be a Z2 n-cycle on K. Then
there exist Z2 n-chains W0 and W1 in K0 and K1 respectively such that:
1. Z = W0 + W1 and
2. (W0 ) = (W1 ) is an (n 1)-cycle C in K0 K1 .
98
CHAPTER 4. HOMOLOGY
. . . G1 G2 G3 . . .
then the sequence is exact at G2 if and only if im 1 = ker 2 .
2. The sequence is called an exact sequence if it is everywhere exact (except at the first and last groups if they exist).
Theorem 4.50.
99
Question 4.53. What compact, triangulated 2-manifolds are not distinguished from one another by Z2 -homology?
Question 4.54. Use the Mayer-Vietoris Theorem to compute Hn (K; Z2 )
for the complexes K pictured in Figure 4.5.
Exercise 4.55. Use the Mayer-Vietoris Theorem to find the Z2 homology
of the following:
1. Sn .
2. a cone over a finite simplicial complex (K, T ) (that is, the finite simplicial complex (K St v, T St v) created by adding a vertex v in a higher
dimension and creating from each simplex in T , a new simplex with
one more vertex, v.).
3. a suspension over a finite simplical complex (K, T ) (that is, the finite
simplicial complex created by gluing two cones over K along K).
4. RPn (= Sn with antipodal points identified).
Question 4.56. What are Hn (L(p, q); Z2 ) for n = 0, 1, 2, . . .?
100
4.6
CHAPTER 4. HOMOLOGY
In this section, we will refine the concept of homology to include the idea
of the orientation of simplices. In Z2 -homology, orientation of simplices was
not mentioned. For example, Z2 -homology made no distinction between the
edge [v0 v1 ] and the edge [v1 v0 ]. That edge was either present or absent.
Failing to consider the orientation of simplices caused Z2 -homology to fail
to detect distinctions among some 2-manifolds. Recall that Z2 -homology
does not distinguish between T2 , the torus, and K2 , the Klein bottle, for
example. Note that orientability is a basic difference between those two
spaces.
So our strategy now is to repeat the same development that we used for
Z2 -homology, but now taking orientation into account. The effect of this
shift in perspective is that now our basic objects will be oriented simplices
(in effect, the order of the vertices matters) and they will come with an
integer coefficient. These coefficients make the objects of Z-homology become abstractions of the directly geometrical interpretation available when
we were talking about Z2 -homology. What does five times a cycle mean geometrically? What does negative two times a simplex mean geometrically?
From one point of view, these are just abstract generalizations, but in another sense, the coefficients retain some geometrical meaning. In particular,
the negative of a simplex means the same simplex with the opposite orientation. Including these coefficients will allow us to draw finer distinctions
among spaces. For example, we will find that T2 and K2 have different second homology groups (that is, second Z-homology groups), and, in fact, we
will see that the Z-homology groups will successfully distinguish all compact,
connected surfaces from one another.
Z-homology is the most common type of homology used, so when people
refer to the homology of a space without specifying what type of homology,
they are referring to Z-homology.
4.6.1
101
Definition (oriented simplex). Let (K, T ) be a simplicial complex. An oriented n-simplex n = [v0 v1 . . . vn ] is an n-simplex {v0 v1 . . . vn } in T along
with a particular ordering of its vertices up to even permutation. That is,
the orientation of an n-simplex is the choice of an equivalence class of all
possible ordering of its vertices, where two orderings are equivalent if and
only if they differ by an even permutation.
In other words, the oriented n-simplex with underlying (unoriented) nsimplex {v0 v1 . . . vn } and whose chosen ordering of the vertices differs from
[v0 v1 vn ] by an even permutation represents the same oriented n-simplex
n . Any ordering of those same vertices that differs from [v0 v1 vn ] by an
odd permutation is the negative of that oriented n-simplex, and is denoted
by n .
Definition (n-chain group). In order to define the n-chain group Cn (K, T ),
we need to say what the elements are and what the addition operation is. The
n-chain group Cn (K, T ) is the free abelian group whose set of generators
consists of one oriented n-simplex for each n-simplex in (K, T ).
Example 2. Let (K, T ) be the simplicial complex in the plane where
T
= { {(0, 0)(0, 1)(1, 0)}, {(0, 0)(0, 1)}, {(0, 1)(1, 0)},
{(0, 0)(0, 1)}, {(0, 1)(1, 0)}, {(1, 0)(0, 0)},
{(0, 0)}, {(0, 1)}, {(1, 0)}, {(0, 1)}} .
Then C2 (K, T ) has one generator which is an oriented 2-simplex, perhaps, [(0, 1)(0, 0)(1, 0)]. So C2 (K, T ) is isomorphic to Z. We are free to
choose any ordering of the vertices in selecting this generator of C2 (K, T ).
C1 (K, T ) is a free abelian group on 5 generators, which could be the
oriented 1-simplices [(0, 0)(0, 1)], [(1, 0)(0, 1)], [(0, 1)(0, 0)], [(0, 1)(1, 0)],
102
CHAPTER 4. HOMOLOGY
and [(1, 0)(0, 0)]. We are free to choose any ordering of the vertices that we
wish for each 1-simplex.
C0 (K, T ) is a free abelian group on 4 generators, namely, [(0, 0)], [(0, 1)],
[(1, 0)], and [(0, 1)]. Of course, in the case of vertices, there is no choice
of order involved.
Definition (Z n-chain). Each element of Cn (K, T ) is called an n-chain.
It
Pk
n
is the formal sum of oriented n-simplices with coefficients in Z, i=1 ci i .
The definition of Cn (K, T ) already tells us what the sums of n-chains
are, but lets just record it here.
P
Definition (Z n-chain sum). The Z-sum of two n-chains C = ki=1 ci in
P
P
Pm
n
and D = j=1 di jn is given by C + D = ki=1 ci in + m
j=1 di j .
For example, 31n +2n +2n 53n = 31n +22n 53n and 1n +(1n ) = 0,
the empty n-chain.
Definition (induced orientation on a subsimplex). A non-oriented (n 1)subsimplex {v0 . . . vbj . . . vn } of an oriented n-simplex = [v0 . . . vn ] will have
the orientation induced by if it is oriented as j = (1)j [v0 . . . vbj . . . vn ].
Definition (boundary of a simplex). The Z-boundary of an oriented nsimplex n = [v0 . . . vn ] is
( n ) =
n
X
kn1 =
n
X
k=0
k=0
kn1 s
ci i =
ci (in ).
i=1
i=1
103
104
CHAPTER 4. HOMOLOGY
Definition (Zn ). Let (K, T ) be a finite simplicial complex. Then the group
ker : Cn (K, T ) Cn1 (K, T ) is denoted by Zn (K, T ). Its elements are
called cycles.
Elements of the image of the boundary operator are the cycles that
bound.
Definition (Bn ). Let (K, T ) be a finite simplicial complex. Then the group
Im : Cn+1 (K, T ) Cn (K, T ) is denoted by Bn (K, T ). Its elements are
called bounding cycles.
These allow us to give an algebraic definition of the homology groups.
Definition (algebraic definition of Hn ). Let (K, T ) be a finite simplicial
complex. Then Hn (K; Z)
= Zn (K; Z)/Bn (K; Z).
We refer to this fact as homology is cycles mod boundaries. You should
verify that this definition is equivalent to the first definition of homology
given.
As with Z2 homology, integer homology would be an uninteresting concept if it depended on the particular triangulation selected. Fortunately, as
in the Z2 case, one can show that integer homology is independent of triangulation. So we will write Hn (K; Z) or Hn (K) instead of Hn ((K, T ); Z)
to denote the nth -homology group of the complex K. As with Z2 -homology,
Z-homology can be computed from a CW-decomposition. Also, just as in
the case of Z2 -homology, Z-homology does not distinguish between homotopy equivalent spaces. Feel free to use these facts in doing the following
exercises.
Question 4.65. For each space K below, describe Hn (K; Z) for n = 0, 1,
2, 3, . . .:
1. the sphere.
2. the torus.
3. the projective plane.
4. the Klein bottle.
5. the double torus.
6. any compact, connected, triangulated 2-manifold.
7. the M
obius band.
105
8. the annulus.
9. Two (hollow) triangles joined at a vertex.
Question 4.66. What is Hn (K) if dim(K)< n?
Question 4.67. What are Hn (G) for n = 0, 1, 2, . . . for a graph G?
Question 4.68. What are Hn (Sk ) for n = 0, 1, 2, . . . and k = 0, 1, 2, . . .?
Question 4.69. For any n, what is Hn (M n ) where M n is a connected nmanifold?
Question 4.70. For any n, what is Hn (M n ) where M n is a connected nmanifold with non-empty boundary?
Question 4.71. What are Hn (T ) for n = 0, 1, 2, . . . for a solid torus T ?
4.7
The ideas in this section are small variations of those that occurred in the
Z2 -homology section.
We will now investigate how simplicial maps from one complex to another
induce homomorphisms on homology groups.
Definition. Let (K, T ) and (L, S) be finite simplicial complexes.
Pk Letnf :
(K, T ) (L, S) be a simplicial map. Suppose that C =
i=1 ci i
Cn (K; Z). To get a natural definition for the induced map f# : Cn (K; Z)
Cn (L; Z) we first define f# ([v0 . . . vn ]) = 0 if the images of the vi s are not
distinct, and otherwise f# ([v0 . . . vn ]) = [f (v0 ) . . . f (vn )]. We can then exP
tend f# to all elements of Cn (K; Z) by f# (C) = ki=1 ci f# (in ). Notice that
the map f# is a homomorphism of n-chains of K to n-chains of L.
Theorem 4.72. Let f : K L be a simplicial map, and let f# be the
induced map f# : Cn (K; Z) Cn (L; Z). Then for any C Cn (K; Z),
(f# (C)) = f# ((C)). In other words, the diagram:
f
f# y
y#
106
CHAPTER 4. HOMOLOGY
4.8
107
4.9
Mayer-Vietoris Theorem
The goal of this section is to describe how the homology groups of a complex
are related to the homology groups of pieces of the complex. We begin with
some theorems that relate cycles in the whole complex to cycles and chains
in its parts.
Theorem 4.79. Let M be a finite simplicial complex with subcomplexes K
and L such that K L = M . Suppose n 2 and that for every n-cycle Z
in K L, Z Z 0 in K and Z Z 0 in L, and Hn1 (K L) = 0. Then
Hn (M )
= Hn (K) Hn (L).
The case n = 1 is slightly different, namely, suppose for every 1-cycle
Z in K L, Z Z 0 in K and Z Z 0 in L, and H0 (K L) = Z. Then
H1 (M )
= H1 (K) H1 (L).
Theorem 4.80. Let K be a finite simplicial complex and K0 and K1 be
subcomplexes such that K = K0 K1 . If A0 , A1 are (n 1)-cycles in K0
and K1 respectively and if A0 A1 in K, then there is an (n 1)-cycle C
in K0 K1 such that A0 C in K0 and A1 C in K1 .
Theorem 4.81. Let K be a finite simplicial complex and K0 and K1 be
subcomplexes such that K = K0 K1 . Let Z be an n-cycle on K. Then
there exist n-chains W0 and W1 in K0 and K1 respectively such that:
1. Z = W0 W1 and
2. (W0 ) = (W1 ), and (W0 ) is an (n 1)-cycle C in K0 K1 .
108
CHAPTER 4. HOMOLOGY
Figure 4.7: Here are two interesting spaces with interesting homology
109
3. a suspension over a finite simplical complex (K, T ) (that is, the finite
simplicial complex created by gluing two cones over K along K).
4. RPn (= Sn with antipodal points identified).
Question 4.87. What are Hn (L(p, q)) for n = 0, 1, 2, . . .?
110
CHAPTER 4. HOMOLOGY
Appendix A
Review of Point-Set
Topology
Definition (topology). A topology on a set X is a non-empty collection T
of subsets of X such that:
1. T
2. X T
[
3.
U T for any {U }J T
4.
J
n
\
112
2. R with
T = { U = iJ (ai , bi )|ai < bi , ai , bi R} {} ,
called the standard topology on R. All non-empty open subsets of R
consist of unions of open intervals.
The second example above suggests that we can define a topology by
giving a subcollection of open sets that generate the toplogy:
Definition (basis for a topology). A basis of a topology is a sub-collection
B T such that for every U T , U can be written as the union of an
arbitrary collection of sets in B.
Equivalently, B T is a basis for T if for every U T , and every x U ,
there is some B B such that x B B.
Definition (limit point). Given a toplogical space (X, T ), and A X,
x X is a limit point of A if any neighborhood of x contains a point in A
different from x. The set of all limit points of A is denoted by A0 .
Note that if x A0 , then x may or may not be in A itself. Also, if x A,
it may or may not be in A0 .
Definition (closed set). Given a toplogical space (X, T ), then if C X
contains all of its limit points, C is called a closed set.
Theorem A.1. Given a toplogical space (X, T ), then if C X closed, then
C = X U for some U T .
Note that there can be (and often are) sets that are neither open nor
closed, and sets that are both open and closed.
Exercise A.2. Define a topology in terms of the closed sets. What conditions must a collection of closed sets possess so that their complements form
a topology?
Definition (closure of a set). Let (X, T ) be a topological space. Then the
closure of A X, denoted by A or Cl A, is A A0 .
Theorem A.3. Let (X, T ) be a topological space. Then the closure of
A X, A is the smallest closed set containing A, in other words, it is the
intersection of all closed sets of (X, T ) that contain A.
113
Definition (interior of a set). Let (X, T ) be a set X endowed with the
114
[
1 2
1
2
2
Sn R Sn = (x, y) x
+y = 2
2n
4n
n=1
115
3. d(x, z) d(x, y) + d(y, z) (triangle inequality)
is called a d-metric on X.
Definition (metric space). Let X be a space with a metric d. Then B =
{Bd (x, r) = {y X|d(x, y) < r}} is a basis for a topology on X, called the
metric topology. Bd (x, r) is called the open ball of radius r centered at x.
116
Appendix B
118
119
Exercise B.5. Show that if we let a represent a reflection along a line
passing through the polygons center and a vertex, and b a rotation of 2/n
around its center, then the elements of Dn are the set {1, b, . . . , bn1 , ab, . . . , abn1 }
Exercise B.6. Show that in Dn as above, we have ab = bn1 a, and thus
Dn is not abelian for n > 2.
Definition (subgroup). A subgroup H of a group G is a subset of G such
that H is a group with the binary operation of G.
Exercise B.7. Show that Dn is isomorphic to a proper subgroup of Sn .
Question B.8. Under what conditions, if ever, is Dn is isomorphic to a
subgroup of An ?
Since the symmetries of a polygon induce permutations on its vertices,
it is easy to see that Dn
= H Sn , and H 6= Sn .
Definition (left coset). Let g G, a group, and H be a subgroup of G.
Then the left coset of H by g is
gH := {gh|h H}.
We can define the right coset Hg similarly.
Exercise B.9. Let g, g 0 G. Then either gH = g 0 H or gH g 0 H = .
Definition (index of a subgroup). Let H be a subgroup of G, then the index
of H in G, denoted [G : H], is the number of left cosets of H in G.
Theorem B.10 (Lagranges Theorem). Let G be a finite group, and H a
subgroup. Then the cardinality |H| of H divides the cardinality |G|of G and
[G : H] =
|G|
|H|
Definition (normal subgroup). A subgroup H of G is called a normal subgroup of G (denoted H G) if gHg 1 = H, where aHb := {ahb|h H}.
Multiplying a group or an element on the left by one element and on the
right by its inverse is called conjugation, so a normal subgroup is one which
is unchanged (set-wise) by conjugation.
Theorem B.11. Let H G be a normal subgroup. Then its left and right
cosets coincide for all g G, in other words gH = Hg for all g G.
120
121
Definition (cyclic subgroup). Let g G. Then hgi the cyclic subgroup
generated by g is the subgroup formed by all powers of g:
hgi := {g n |n Z}
n times
n times
z
}|
{
z }| {
n
where g = g g g if n > 0, g 0 = 1, and g n = g 1 g 1 g 1 for n N.
n times
}|
{
z
}|
{
z
g + g + + g for n N, g 0 = 0, and ng = g + g + + g for n N.
Definition (cyclic group). If G = hgi for some g G we say G is a cyclic
group with generator g.
Note that cyclic groups are abelian.
Definition (finite cyclic group of order n). If G = hgi and there exists
n Z such that g n = 1, then there exists a least n N such that g n = 1. G
is said to have order n, |G| = n.
Theorem B.15. A cyclic group that is non-finite must be isomorphic to Z.
Theorem B.16. A finite cyclic group of order n is isomorphic to Zn , the
integers with addition mod n.
n times
z
}|
{
Definition (free abelian group of rank n). A group G
= Z Z . . . Z is
called the free abelian group of rank n. G has a generating set of n elements
of infinite order, one for each Z factor.
Definition (generators). Let G be a group and S G. Then the smallest
subgroup H of G containing S is called the subgroup generated by S. If
H = G then we say G is generated by S, or that S generates G.
Note that the set of generators of a group is by no means necessarily
unique. We can view the subgroup H generated by S as the set of all
possible products g1 g2 . . . gn where gi S or gi1 S. We can also view H
as the intersection of all subgroups of G that contain S.
Exercise B.17.
1. Verify that the dihedral group Dn = {1, b, . . . , bn1 , ab, . . . , abn1 } is
generated by {a, b}.
122
123
We can write the infinite cyclic group as:
C = ha|
i.
Exercise B.20. Confirm that the lists of generators and relations given
above completely determine the groups.
We should note that since the relations g g 1 = 1, g 1 = g and 1 g = g
hold for any g G, as they are implicit in the definition of a group, such
relations are not included in the list of relations. In general a group G can be
written as G = hgenerators|relationsi. This is called a group presentation G.
This notation is very useful, especially when dealing with fundamental group
and Van Kampens theorem. The problem with this notation, however, is
that it is very difficult, in general, given two groups with this notation, to
tell if the groups are isomorphic or not, or even if two words represent the
same group element.
Exercise B.21. What is a group presentation for an arbitrary finitely generated abelian group? for the symmetric group?
124
Appendix C
126
127
Michael Starbird
Department of Mathematics
RLM 8.100
The University of Texas at Austin
Austin, TX 78712
starbird@math.utexas.edu