Maps and homology
Theory - Simplicial maps, chain maps
Simplicial maps, chain maps
Simplicial map
A map between simplicial complexes is simplicial if it maps vertices of to vertices of , and it maps simplices of linearly to simplices of .
For example:
- Inclusions of one simplicial complex into another.
- Reduction of a simplicial complex to lower dimension, e.g. .
Chain map
A chain map is a map between chain complexes, which consists of a collection of homomorphisms:
of abelian groups which commute with the boundary operators:
Such a chain map makes the following diagram commute:
- The homomorphisms can be collected under a single map , and the commutativity condition expressed simply:
Link to originalTheorem: Induced chain map
A simplicial map determines a map of chain complexes .
The simplicial map is extended linearly from simplices to chains (from generators to linear combinations).
Theory - Induced maps on homology
Induced maps on homology
Theorem: Induced map on homology
A chain map determines a map of homology groups which splits by degrees:
A chain map sends cycles to cycles and boundaries to boundaries, so it descends to a map of quotient groups.
Proof of Theorem: Induced map on homology
It is sufficient to check that maps cycles to cycles and boundaries to boundaries:
- By mapping boundaries to boundaries, is well-defined on homology groups.
- By mapping cycles to cycles, maps elements of homology to elements of homology.
Checking maps cycles to cycles:
If , meaning that is a cycle, then for some , whence:
but this implies .
Checking maps boundaries to boundaries:
If , then:
but this means the image of is a cycle.
Proposition: Homotopic maps are the same on homology
If two maps of simplicial complexes are homotopic, then they induce the same maps on homology groups, :
In words: continuous deformations do not change the map induced on homology.
Proposition: Homology respects composition of maps
Given a composition of simplicial maps:
the map induced by the composite agrees with the composite of the induced maps:
The property of respecting composition of maps is called functoriality.
Corollary: Homotopy equivalence implies homology isomorphism
Homotopy equivalent simplicial complexes have isomorphic homology groups:
Link to originalProof of Corollary
Suppose we have a homotopy equivalence:
Now apply functoriality to the induced maps on homology:
Therefore is the inverse of as homomorphisms of abelian groups.
Illustration
Contraction to a point
Link to originalContraction to a point
The map for some point is a homotopy equivalence, so it induces an isomorphism on homology. Therefore:
Dunce Hat
Link to originalDunce Hat
The Dunce Hat is formed by identifying all sides of a triangle with non-circular identifications:
The Dunce Hat is contractible, but it is not collapsible. The contraction can be performed by embedding the Hat in a 3-ball in .
Because it is contractible, the Dunce Hat has the homology of a point.
Homology of a cylinder
Link to originalHomology of a cylinder
Recall that the cylinder is homotopic to the circle (§06):
A circle is homeomorphic to a triangle.
We have computed the homology of a triangle (§11 of Part I).
Therefore the homology of the cylinder is:
Homology variations
Theory - Relative homology
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:
Link to originalRemark: 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.
Illustration
Homology of a simplex relative to its boundary
Homology of a simplex relative to its boundary
Consider a simple 2-simplex and the simplicial complex that it determines:
Let be the boundary 1-simplex (the edges only from ).
There are no 2-simplices in , so:
All 0- and 1-simplices in are also in , so:
The relative chain complex:
becomes:
It follows that the relative homology is:
Compare this to the homology of a sphere!
Homology of a sphere:
Notice that is homeomorphic to the quotient space .
This comparison of homologies is apt; we just need to explain versus .
Link to originalCompare this against the quotient of homology groups!
The homology of is:
The homology of , because it is contractible, is:
The quotient of homology groups is:
- Relative homology treats as a single point.
- The quotient of homology annihilates generators (“holes”) in which are also generators (“holes”) in .
- Different results for different constructions!
Theory - Cochain complex
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:
Link to original
- — called the coboundary cochains
- — called the cocycles
Theory - Cohomology
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.
Link to originalCup 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.)
Illustration
Some cohomology classes on the 2-torus
Link to originalSome cohomology classes on the 2-torus
Consider the 2-torus :
The red (poloidal) and pink (toroidal) curves together generate the degree one homology, .
Now recall a simplicial complex representation of the torus:
Let be the cochain which assigns 1 to every edge in the middle column, and zero to all other edges. (So it is 1 on the edges directly below the label, including the diagonals, but excluding all verticals.) Let be the cochain which assigns 1 to every edge in the middle row, and zero to all other edges. (So it is 1 on the edges directly to the right of the label, including the diagonals, but excluding all horizontals.) Accounting now for orientations, let give on edges directed rightwards, and give on edges directed upwards.
One can check directly, going around the boundaries of each 2-simplex, that and : The sum of the numbers on any triangle, accounting for orientations, is zero. So these cochains are both cocycles.
In order to see that and are not boundaries, and thus represent nontrivial homology classes, and also to see that they don’t represent the same homology class, we devise a method of representing coboundaries of 0-cochains.
A 0-cochain is the assignment of integers to each of the vertices. The condition , which means , states that these numbers cannot change as one moves across an edge from vertex to vertex. (Applying to any edge gives . By linearity, . Therefore when the condition holds.)
From this it follows that . The isomorphism is given by sending to the integer it gives on a vertex.
Return now to . A boundary in is a cochain assigning numbers to directed edges such that there is a vertex labeling cochain with . In other words, that it is possible to derive the edge numbers as the differences of a single vertex numbering scheme.
Now one can see that is not a coboundary. Vertex integers must increase by one as one passes across the middle column of edges, and stay fixed going across all other edges. This is impossible because the left-most and right-most edges are identified. Similarly is not a coboundary, and is not a coboundary.
(To witness a contrasting case, let be a 1-cochain giving 1 only on the non-vertical edges in the right-most column. This is shifted to the right. Now is a coboundary: assign 1 on vertices in the middle-right column, and 0 on all other vertices.)
Much more work would be required to show that and have no relations in homology, and that they jointly generate homology.
A cup product on the 2-torus
Link to originalA cup product on the 2-torus
We study the cup product :
We must provide an ordering of all the vertices of the torus. Order them as in a book: top-to-bottom, then left-to-right.
Let us see how to verify the values on the green and yellow 2-simplices. Label the vertices of the inner square as in the figure; the index ordering is compatible with .
For the green 2-simplex , we have and , so:
For the yellow 2-simplex , we have and , so:
A calculation with more details (illustrating bilinearity) can be performed in terms of the indicator functions. Write:
where is the indicator for the edge in the support of which is in the place from the top (oriented rightwards), and analogously is for the one for in the place from the left (oriented upwards).
Applying bilinearity to expand the cup product:
The edges with indicators and could span one of the 2-simplices only when and . And in fact the pairs can be ruled out as well. The only terms to consider are these six:
- Now is the indicator for and is the indicator for , so because so the total list does not split according to the ordering of .
- Then is the indicator for , so is the indicator for , meaning it returns on the green 2-simplex.
- Then is the indicator for , so .
- Then is the indicator for , so because .
- Then is the indicator for , so because .
- Then as well, also because .
By adding these results, we see that is the indicator for the central 2-simplex, oriented clockwise.
This cochain in is automatically a cocycle because is empty.
Is it a coboundary?
To see that the answer is “no,” we can devise another scheme to represent coboundaries, now for -simplices. We give here only a sketch. Give a 1-cochain which assigns integers to the edges. Draw oriented paths crossing the edges, with the number of paths crossing matching . Then for a triangle counts the total flow of paths into or out from ; it is a ‘sink’ or ‘source’ number describing extra paths originating or terminating inside . The condition would mean that the paths are conserved in , none created or destroyed.
With this perspective, it is obvious that the cochain depicted in the figure cannot be a coboundary. Every 2-cochain which is a coboundary describes a collection of oriented paths that are created or destroyed only in triangles with nonzero assignments, according to that assignment. So would describe a single path terminating in the green triangle, but originating nowhere, since there is no other sink or source.
Another observation is worth making about . It is the generator of .
Note that the full cohomology of is given by:
Here is a fact: All indicator functions on 2-simplices determine the same cohomology class. To see this, take the difference of any two indicators. Draw a simple oriented path out of one of them into the other. This path will define a 1-cochain by assigning on any edge it crosses on the way (according to their mutual orientations), and 0 on all edges it does not cross. The coboundary of this cochain gives on the triangle from which the path emanates, and on the triangle in which the path terminates, and zero on all other triangles. That is exactly the difference of indicator 2-simplices we started with.
Since is generated by indicator 2-simplices, and they are all equivalent, we deduce that it is generated by .
To see that it is in fact infinite and isomorphic to , we must exclude relations among the multiples of . A relation is equivalent to the relation for . But we can exclude any such relation by the reasoning used above: a cochain cannot be a coboundary because it would represent oriented paths terminating in the green 2-simplex, and originating nowhere.
Therefore we have proven that:
The cocycle is called the fundamental cocycle of .
Cohomology ring has topological significance
Link to originalCohomology ring has topological significance
Let , the 2-torus.
Let , a 2-sphere with two circles attached at one common point.
The cohomology groups are isomorphic:
However, the cup product operations differ, so the ring structures differ.
- In , the cup product of the two generating cocycles is the fundamental coclass of the 2-torus.
- In , the cup product of the two generating cocycles (dual to the two copies of ), is zero.
Theory - Coefficients
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).
Link to original


