Recall definitions of simplicial homology and singular homology.
Remark. The only reason we choose to use simplices is that its boundary is very easy to define and calculate; when dealing with geometric intuition, it's perfectly fine to replace the simplex with anything that is easy to define an oriented boundary.
Homotopy Invariance
Theorem. Homotopic maps induces same homomorphisms between homology groups.
This theorem agrees with our intuition that 1. homology groups count holes, and 2. homotopy doesn't change holes.
We first give a intuitive "proof" for this. We draw the image of , and continuously modulate it until it become . While doing this, we draw the "trace" of this image. Then every chain will be strectched out, becoming a prism; Therefore, corresponding chains will cancel out due to this prism.
Sketch of proof. Suppose and are homotopic through , and consider a singular simplex . Consider the prism . Divide this prism into disjoint simplices , giving the prism operators
Geometrically the boundary of the prism is made from the top face, the bottom face, and the sides. Algebraically this is expressed through the equation
Using this relation, we have, for every cycle , is a boundary, so and determine the same homology class.
A map between chain maps and satisfying is called a chain homotopy.
Proposition. Homotopy equivalences induce isomorphisms of homology groups.
Exact Sequences and Excision
Relative Homology Groups
When defining the chain groups, we can ignore chains in , replacing by . These are called the relative chain groups, and we can define the relative boundary map and relative homology groups on them.
Notice, however, that is generally not isomorphic to . A good way to think about this is: considering relative homology only allow us to "move around freely inside ", but the region itself cannot be ignored. To give an example, take to be a disk, and the same disk without its center. Then is contractible ( is the two-element space called the Sierpiński space), giving a trivial , but (intuitively) there is a non-trivial chain in : any 2-dimensional chain (imagine a surface) which covers the center (the reader should verify that it is actually a cycle). Intuition gives that , by counting the number of times the chain covers the center. Actually this is true.
However, for some nice pairs , and do coincide, as we will show later.
Now we try to extend the chain complex . We take a subspace of . Apparently there is an inclusion . The quotient map induces a quotient map , by replacing every element of by its homology class. Intuitively, and has the extra property that .
The boundary map is more complicated. For a relative -cycle , there is an -chain such that . Then should be trivial relative to , as formally shown in . Therefore is a chain in ; i.e. for some . Also, since . To sum up: loosely speaking, is the relative version of , and is the boundary of ; both and are cycles (but of different spaces). It should intuitively make sense to define , where denotes homology class; after all, is just "the boundary of adjusted to the correct space". (The is required only because we want to define "the boundary of a relative cycle" properly.)
(We still need to verify the boundary map is well-defined; i.e. independent of the choice of . This should be intuitively obvious, and we omit the proof here.)
As is a boundary, it should be in the trivial homology class of ; this is expressed rigorously by , or equivalently . Conversely, every cycle corresponds to some such that ; this implies , so .
, therefore , which means . Conversely, if , then ; we want some chain making and a cycle, then . Taking where clearly does this. Therefore, .
All these discussions gives us an exact sequence:
Excision
The core of excision is the idea that, if we remove a set in (but with enough space left), then the relative homology should not be affected.
The Excision Theorem. If such that , then the inclusion induces isomorphisms .
Setting , we get a more convenient version:
The Excision Theorem, second version. For such that , the inclusion induces isomorphisms .
Proof. We want a map , which induces isomorphisms on homology groups. Notice the quotient is free with basis the singular -simplices in that do not lie in . We now make the first step forward: we replace by . To make this operation available, we must modify to include chains in ; a rational choice is . We've managed to get closer to the target: . Now we need to prove the inclusion induces isomorphisms on homology groups. We first show that the inclusion is actually a chain homotopy equivalence.
Lemma. The inclusion is a chain homotopy equivalence.
Sketch of proof. The key is that we can do iterated barycentric division to a chain in , making it small enough so that every divided region is either in or in (by Lebesgue's theorem). Therefore, we need to 1. define "barycentric division" for singular simplices; and 2. establish a chain homotopy equivalence between the original chain and the divided one.
We first consider barycentric division of linear simplices , and establish the required notions. For a point , we can form a simplex by adding to , namely, the cone with apex and bottom . We denote this cone by . Notice that (the boundary of a cone is its sides and its bottom); therefore , so is a chain homotopy between and .
We now define the barycentric division . For a linear simplex , denote its barycenter by . We then define recursively as: . (Convince yourself that this is the barycentric division.) Intuition and calculation both gives , meaning is a chain map. To show is chain homotopic to , we again need to divide a prism: we connect all simplices on the bottom and the sides to the barycenter of the top, as indicated in the image.
This division induces a prism operator , satisfying (again, intuitively and rigorously through calculation) .
We can easily extend this set of notions to singular simplices, by compositing with a singular simplex . Now we're ready for iterated division. A chain homotopy between and is given by the tower of prisms: . (Imagine extending the prism above by building an identical prism upon each divided region on the top; iterate times.) For each singular simplex , there is a least integer such that after divisions every region of is either in or in ; i.e. . We now define by (i.e. a prism tower between and a sufficiently small division). We then claim that is a chain homotopy inverse for the inclusion . The proof is pure calculation, and is omitted here.
We can now return to the proof of the excision theorem. Knowing that and , we try to make quotient maps to actually get to and . Remarkably, all maps in these equations (, , , , ) are -stable. Therefore, we can factor out all chains in , and the quotient map thus induces an isomorphism on homology groups.
With the help of excision, we can finally relate and for some nice and .
Corollary. If is the deformation retract of some of its neighbourhood, then the quotient map induces isomorphisms .
Proof. Suppose is the deformation retract of , one of its neighbourhoods. We have a commutative diagram
The two unlabelled horizontal maps are isomorphisms by excision. is an isomorphism by the long exact sequence and the fact that (the pairs and are homotopy equivalent). The same argument shows that is also an isomorphism. The rightmost is an isomorphism since restricts to a homeomorphism on the complement of . From commutativity, the leftmost is also an isomorphism.
There's another way of converting relative homology to reduced homology using cones, which works for all pairs; suppose is the cone from point to , then
the first isomorphism is from the long exact sequence, second from excision, third from the deformation retraction of onto .