My Solution for Hatcher 2.1 and 2.

2
Tao Biaoshuai

Hatcher 2.1, Question 9

First, we need to assume that the gluing of each preserves the ascending
order of indices. For example, if {0 , 2 , 5 } is glued to {0 , 1 , 2 }, then 0
is glued to 0 , 2 is glued to 1 , and 5 is glued to 2 . This assumption
is essential since the sign of each aect the denition of each boundary
operator.
For with (1 < ), it has + 1 faces, and all of them in is
identied to be the same. This would means that
{ 1

is even

1
=
(1)
=
0
is odd
=0

Considering the chain groups

+1

2
1

1
1
0 ,

each is just a cyclic group generated by just one element . Moreover,

above deduction tells us that is the identity map when is even and it is
the zero map when is odd. Therefore,
ker( )
=0
() =
im(+1 )
Additionally, we have () = 0 for > and 0 () = . For = ,
im(+1 ) is always trivial. However ker( ) is if is odd, and is 0 if is
even. Hence we have our answer:
{
= 0 or =
() =
for odd ;
0 Otherwise
{
=0
() =
for even .
0 Otherwise
1

Hatcher 2.1, Question 26

1 (/) is not.
We will show that 1 (, ) is countable while
Consider the long exact sequence of pair (, )

1 () 1 (, ) 0 () 0 ().
Obviously 1 () = 0. Then ker = im = {0}. This means that is oneto-one. Therefore, ker = im
= 1 (, ). Since 0 () =< 1, 21 , 13 , ..., 0 >
and 0 () is cyclic, just sends all the basis of 0 () to the generator of
0 (). Thus the kernel of is generated by the substraction 1 1 of any
two elements in the generators of 0 (), that is, < 1, 12 , 31 , ..., 0 >. Therefore
ker has a countable basis, and so is 1 (, ). Thus 1 (, ) is countable.
1
, 1 ]. Then each is homeomorphic to 1
(since
For /, let = [ +1
now all the points on are identied as the same point) and / = .
Therefore, / is homeomorphic to the shrinking wedge of circles as
shown in Example 1.25 of Hatcher. We know that 1 (/) is uncountable
in Example 1.25. If we consider the loops as 1-dimensional singular simplices, we can consider / as a singular complex with only one 0-cell (that
is the whole ) and innitely many 1-cells. For each element in 1 (/),
that is, each class of loops [] in /, it can also be consider as the element
in the chain group 1 (/) with 1 () = 0 (as it is a loop). Therefore,
1 (/) ker(1 ). This means that ker(1 ) is uncountable. Since im(2 ) is
1 (/) = ker(1 ), which is also uncountable.
clearly trivial, we have

1 (/) is uncountable.
We already show that 1 (, ) is countable but
Obviously they are not the same.

Hatcher 2.2, Question 21

Let () denote the number of cells in . Then for each , by inclusionexclusion principle, we have
() = () + () ( ).

Since () =
() =

=0 (1) (), we have

(1) ( () + () (

))

=0

=
(1) () +
(1) ()
(1) ( )
=0

=0

=0

= () + () ( ).

Hatcher 2.2, Question 24

Firstly, we decompose to a single 0-cell (say, the north pole) and a single
2-cell (say, the rest of north pole). We can see that ( ) = 1 0 + 1 = 2
since Euler characteristic is a invariant under homotopy equivalence.
For the rst graph, assume it is a decomposition of 2 . Then 0 = 5, 1 = 10.
Since 0 1 + 2 = 2, we have 2 = 7. In this graph, each cycle is at least of
length 3, so each 2-cell is bounded by at least three 1-cells. Since each 1-cell
is contained in exactly the boundaries of two 2-cells, we have 1 322 = 10.5.
This contradicts to the fact that 1 = 10.
For the second graph, assume it is a decomposition of 2 . Then 0 = 6, 1 = 9.
Since 0 1 + 2 = 2, we have 2 = 5. In this graph, each cycle is at least of
length 4, so each 2-cell is bounded by at least four 1-cells. Since each 1-cell
is contained in exactly the boundaries of two 2-cells, we have 1 422 = 10.
This contradicts to the fact that 1 = 9.

Hatcher 2.2, Question 32

Let be the cone of . Then = and = . By

the Mayer-Vietoris sequence, we have
()
()
()
1 ()
1 ()
1 ().

Notice that is contractible, the outer two terms is just 0 0 which is 0.

Therefore, the inner two terms should be an isomorphism, which is
() =
1 ()