Relative homology
Suppose a simplicial complex is embedded within another simplicial complex . The homology of relative to is given by zeroing (quotienting out) the cycles fully within . Only cycles that inescapably involve outside of contribute to the relative homology.
More precisely, suppose that , so vertices and simplices of are also vertices and simplices of .
Then observe that chains in are automatically chains in , and thus:
(A subgroup: because a sum of chains in is still a chain in .)
Relative chain complex
Suppose is an inclusion of simplicial complexes.
Define , the relative chain group, as the quotient:
Proposition: Boundary maps descend to relative chain groups
The boundary maps send chains in to chains in and thus descend to the quotient groups, giving a relative chain complex:
(Here is just the map induced by on the quotient groups.)
Proof of Proposition: Boundary maps descend to relative chain groups
It is sufficient to establish that boundaries from must also reside in , i.e. that:
But this is clear because is a simplicial complex, so it is closed under taking boundaries.
Relative homology
Suppose is an inclusion of simplicial complexes.
Define , the relative homology group, as the homology group of the relative chain complex:
Remark: Relativizing before homology
It is tempting to try relativizing the homology groups directly.
The inclusion does induce maps . We could study the groups .
These quotient groups are not what relative homology is after! See the illustrations.
Cochain complex
Recall that the chain group is the free abelian group of formal linear combinations of -simplices in :
One should think of the chains as assignments of integers to the various -simplices in .
Thinking in this way, the boundary map is given on chains by simple linear extension of its definition for individual simplices. Thus .
Cohomology is created by interpreting the integers not as coefficients, but as the outputs of linear functions .
To notate this effectively, define indicator functions for each of the -simplices:
Cochains
The space of linear maps is isomorphic to the free abelian group of formal linear combinations of indicator functions:
Elements of this space, written generically as formal sums , are called cochains.
(For cochains it is not necessary that be finite.)
Since there is a bijective correspondence of sets between oriented simplices and their indicator functions, we see that as abelian groups; we have simply reinterpreted the chains as assignments of integers to the indicators of -simplices in .
In both cases, the data of a chain / cochain consists of the assignment of a number ( or ) to each of the -simplices in . But the difference in interpretation of this data allows a difference in the construction of boundary operators:
Coboundary operator
Define the coboundary operator thus:
In words: the coboundary of a simplex indicator indicates that simplex in the boundary of a higher simplex.
For example, in the triangular 2-simplex:
If is the indicator of , then the coboundary indicates the presence of in the boundaries of 2-simplices. It returns for the triangle itself, , since the boundary of the triangle includes the term .
Thus, in general, , in contrast to that we saw for .
Witness a simple computation, applying to an arbitrary indicator:
Cochain complex
Given a simplicial (or -) complex of maximal dimension , we define the cochain complex of as the sequence of morphisms:
This sequence is a complex because:
The image and kernel groups are named in the obvious way:
- — called the coboundary cochains
- — called the cocycles
Cohomology
Cohomology
The cohomology of is defined as the quotient group of cocycles modulo coboundary chains:
Cohomology is an upgrade from homology because it has an additional product structure, so cohomology actually gives a collection of rings.
Cup product on cochains, for simplicial complexes
Suppose we are given a simplicial complex , together with a chosen ordering of all vertices of .
There are maps of cochain groups defined as follows:
For any pair of cochains and , and any vertices ordered according to , with the -simplex they form, we have:
Note: the oriented simplices here may be written with various orderings, but the splitting into - and -simplices must follow the order of .
Cup product using indicators
Let be the indicator of an oriented simplex , and let be the indicator of another oriented simplex .
Let be the vertices of the total list
reordered in the ordering of (allowing repetition), so .
Then is defined as follows: it is the indicator of provided:
- (i) the are all distinct,
- (ii) for all ;
and if (i) and (ii) do not hold.
The definition is extended bilinearly to all of .
Vertex orderings and the cup product
Instead of choosing a total ordering of all vertices of , it is sufficient to choose a partial ordering of the vertices of having the property that induces a total ordering of each simplex of .
A set of compatible orderings of the vertices in each simplex is used to define a ‘front half’ and ‘back half’ of each -simplex , thereby cutting into one -simplex and one -simplex.
The cutting method applied to a given simplex must be compatible with the method applied to every other simplex. A global vertex ordering ensures this compatibility.
Cup product on cohomology
The cup product has the following relation to the coboundary operator, a type of signed Leibniz rule:
when .
This formula implies that if and are cocycles (or coboundaries), then is also a cocyle (coboundary). Therefore the cup product descends to cohomology:
The cup product on cohomology provides a ring structure to the direct sum . The product, and the ring structure, do not depend on the choice of ordering used to define the product on cochains.
(Note: The cup product is always zero when is greater than the maximal simplex dimension.)
Coefficients
It is possible to define homology and cohomology with other coefficients. Given an abelian group , one defines the chain groups thus:
And the cochain groups thus:
Homology and cohomology are defined in the usual way from these chain groups.
The most important cases are (which eliminates torsion), and (where coefficients track parity only).