03.12.E2 · modern-geometry / homotopy

Singular and cellular homology exercise pack (Hatcher Ch. 2 supplement)

shippedIntermediate-onlyLean: nonepending prereqs

Anchor (Master):

Formal definition of the pack Intermediate

Hatcher's Chapter 2 builds ordinary homology three ways — simplicial, singular, and cellular — and proves they agree on CW complexes. The chapter's engine is the trio of Eilenberg-Steenrod axioms made operational: the long exact sequence of a pair, excision (packaged as Mayer-Vietoris), and the dimension axiom. With these in hand the chapter computes by induction, defines and computes the degree of a self-map of , and grinds out the cellular chain complexes of projective spaces, lens spaces, and Moore spaces.

This pack collects ten exercises drawn from §2.1, §2.2, and §2.C — three easy, four medium, three hard — each with a hint and a full solution. The exercises are grouped by technique: -complex and degree warm-ups (easy), Mayer-Vietoris and cellular-chain computations of standard spaces (medium), and the structural results that pin down homology up to isomorphism — the universal coefficient theorem in action and the homology of an infinite product of cells (hard).

The conventions are Hatcher's: denotes reduced or unreduced singular homology with coefficients unless stated, and the cellular boundary map is computed by the degree formula , where is the degree of the attaching-then-collapse map .

Key theorem with full solution Intermediate

Before the pack proper, we work one exercise in full as the model solution. The remaining nine follow the same structure (problem, hint, full answer in <details> blocks).

Lead exercise. Compute $H_(\mathbb{R}P^n; \mathbb{Z})$ from the cellular chain complex.*

Solution. Real projective -space has a CW structure with exactly one cell in each dimension , where and the attaching map is the standard double cover. The cellular chain complex is therefore

one in each degree through . The cellular boundary is multiplication by the degree of the composite . That composite is (the antipodal identification contributes the antipodal-map degree to the identity): so for odd and for even.

The complex thus alternates . Reading homology degree by degree:

  • (path-connected).
  • For odd: (kernel of is , image of multiplication-by- is ).
  • For even: (kernel of multiplication-by- is ).
  • if is odd (the top map into degree is , and out of degree does not exist), and if is even.

Summary: for ; for odd, ; for even, ; and in degree when is odd, when is even.

This computation is the template for every cellular calculation downstream: write the cells, compute each boundary by a degree, read off homology. The lens-space and exercises differ only in the cell dimensions and the boundary degrees.

Exercises Intermediate


Exercise pack EP2. Hatcher Chapter 2 supplement: singular, simplicial, and cellular homology, degree theory, Mayer-Vietoris, and the universal coefficient theorem across §2.1, §2.2, §2.C.