For chain maps , a chain homotopy from to is a family of group homomorphisms satisfying
If is a chain cycle, then is a chain boundary. Consequently , so on every homology group.
Order the vertices of the simplex as . Its simplicial chain complex has
and zero groups otherwise. An arbitrary ordering represents the sign of the permutation times the increasing ordering. Its boundary operator is
In each face obtained by deleting the vertices in positions occurs twice. Deleting first gives sign , whereas deleting first gives . These signs are opposite, so all terms cancel. The case follows directly from . Thus .
For the homology calculation, add the augmentation sending every vertex to . Regard as the group in degree of an augmented chain complex. Define the simplicial cone chain contraction by
If the simplex does not contain , expansion of its coned boundary gives . If it contains , the only face on which is nonzero is the face omitting , and . In degree zero this uses the augmentation, and in degree it says . Hence
Every positive-degree chain cycle is therefore a chain boundary. In degree zero, the same identity says , so the augmentation induces an isomorphism , with inverse . Thus, including ,
This is a direct chain homotopy calculation and uses no result about cellular homology.
Represent a class in by a chain cycle . Since every simplex of belongs to at least one of the two simplicial subcomplexes, split the chain in the simplicial chain complex as
Because , we have
The left side lies in and the right side in , so this common chain is supported in . It is a cycle because . The connecting homomorphism is therefore
Changing the decomposition or the representative changes only by a boundary in , which is why the construction descends to homology classes.
Because is a simplicial subcomplex of , every face of a simplex of also belongs to . The simplicial boundary operator therefore satisfies
so is a chain subcomplex of the simplicial chain complex .
Define a map on the quotient groups by
If with , then , so this definition is independent of the representative. Moreover,
Thus is the relative simplicial chain complex.
Use the orientations
The simplicial chain complex has
with
The map is injective, so . The complex is connected, so and . Hence has rank ; quotienting by the rank-one primitive subgroup gives
There are no higher simplices. Therefore
The result agrees with the Euler characteristic .
Use the cellular chain complex or simplicial chain complex over , rather than the infinite singular chain complex. Put , with . The rank-nullity theorem gives ; quotienting the chain cycles by the chain boundaries then gives . Each boundary operator's rank occurs in adjacent degrees with opposite signs, so
Finiteness makes this cancellation an ordinary finite sum. This is the algebra behind the cell-count formula for Euler characteristic.