Boundary operator Created 2026-09-24 Updated 2026-10-14
The boundary operator of a chain complex is its degree-minus-one differential . The identity says that every chain boundary is a chain cycle.
Chain boundary Created 2026-09-24 Updated 2026-10-14
An element of a chain group is a boundary when it is the image of a higher-degree element under the boundary operator. Since , every boundary is a chain cycle. Thus , and a chain cycle represents zero in homology exactly when it is a boundary.
A filled triangle is a disk with three vertices, three edges and one two-dimensional topological cell, so . Its simplicial homology has : the filled triangle is contractible, and the three-edge chain cycle is the chain boundary of its face. Keeping only the cycle graph on those three vertices gives and , since that chain cycle no longer bounds a face. The surrounding plane's exterior is not part of either simplicial complex; do not add it to .
Figure 1.
The filled triangle, its midpoint subdivision, and its unfilled boundary
. Details.
A chain complex consists of abelian groups and homomorphisms with . Its groups of chain cycles and chain boundaries are and ; the identity ensures . Its homology groups are
For a nonnegative complex, take for .
The singular chain group is the free abelian group on continuous maps , called singular simplices. With the inclusion of the face opposite vertex , define
Deleting any two vertices in the two possible orders gives the same face with opposite signs, proving . This defines the singular chain complex and its singular homology. A continuous map induces the chain map ; it commutes with the boundary because composition commutes with restriction to faces.
To prove homotopy invariance of homology, let have endpoints . Triangulate by the simplices with ordered vertices
Let be their affine parameterizations. The singular prism operator is
On taking boundaries, shared internal faces of consecutive prism simplices cancel. The top and bottom faces give , and the remaining faces are with their induced signs. Thus
For a chain cycle , is a chain boundary, so on homology. If is a homotopy equivalence, its homotopy inverse therefore induces an inverse to , proving that singular homology depends only on homotopy type.
Use the standard CW complex for an orientable genus-three surface: one vertex, six edges , and a two-cell whose attaching word is . The cellular homology theorem identifies this cellular calculation with singular homology. The boundary of every edge is zero, and each edge's total exponent in the attaching word is zero, so the two-cell boundary is zero. Hence
Choose to be the nonseparating curve represented by , and choose as a small circle bounding a disc in a surface patch. Then is a nonzero primitive homology class, whereas the inclusion of induces zero on . If a homotopy equivalence carried onto , its restriction would factor through and kill , contradicting injectivity on first homology. This is the homology obstruction to carrying surface curves onto one another.
There is nevertheless such a continuous map. Map the edge homeomorphically onto and all other edges to its base point. The two-cell attaching word then has winding number zero in , hence is null-homotopic and the map extends to . Compose with a homeomorphism and the inclusion of in the surface. This gives . Thus an arbitrary map can carry the first curve onto the second, but a homotopy equivalence cannot.
For an unambiguous drawing, realize as the double of a manifold formed from a disc with three holes. Its two copies are glued along all four boundary circles. The red curve below follows an arc from the outer boundary to the first hole on the front copy and returns along the matching arc on the back copy; it is a nonseparating curve. The blue circle is entirely in a disc patch on the front copy and is contractible.
Figure 1.
Nonseparating and contractible circles on the genus-three surface, drawn as a doubled three-holed disc
. Details.
The chain map identity gives, for ,
Thus is a chain complex; it is a sign convention for the algebraic mapping cone.
Put with differential . Inclusion into the second summand and projection onto the first give a short exact sequence of chain complexes
Its connecting homomorphism is particularly explicit. If is a chain cycle, lift it to and take its boundary. The second component is , so the long exact sequence in homology contains
If every vanishes, the exact sequence makes every both injective and surjective. Conversely, if every is an isomorphism, the map has zero image, while has zero image and zero kernel; hence .
One can also see the converse directly on chain cycles. If is a chain cycle, then and . Injectivity of the induced map on homology gives . Subtracting the chain boundary leaves with . Surjectivity of the induced map on homology lets us choose a chain cycle and such that
Then . Thus every chain cycle in is a chain boundary, proving the mapping cone acyclicity criterion:
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.
Inclusion and passage to the quotient give a short exact sequence of chain complexes
Define the connecting homomorphism as follows. If , then , so . Since , it is a chain cycle in , and we set
Changing by a relative boundary or a chain in changes by a boundary in , so is well defined.
The resulting sequence is
We verify exactness directly. If a cycle of maps to zero in the relative homology, it differs from a boundary by a cycle in , so it lies in . If a relative cycle satisfies , then for some ; hence is a cycle in mapping to . Finally, if a cycle becomes a boundary in , say , then is a relative cycle with . The reverse containments follow immediately from consecutive composites being zero. This proves the long exact sequence in relative homology.
The Snake lemma associates to a commutative diagram with exact rows an exact sequence
For , apply it degree by degree to the short exact sequence of chain complexes
The resulting connecting maps splice the kernels modulo boundaries into the Mayer--Vietoris sequence
Now let satisfy the stated simplicial pseudomanifold conditions. In an -cycle, cancellation at a common -face determines the coefficient of either incident -simplex from the other, up to the orientation sign. Connectivity through such faces therefore determines every top-simplex coefficient from one integer. If the signs are globally compatible, their oriented sum is a cycle and generates ; if they are inconsistent, that integer must be zero and .
Let be the resulting fundamental class, represented by . Since the intersection has dimension below , split uniquely
into top chains in and . Then
and the Mayer--Vietoris boundary is
It is nonzero exactly when both and contain top-dimensional simplices; if one side contains none, the fundamental cycle already lies in the other side, while if both do, connectedness forces a nonempty interface and its oriented boundary represents a nonzero class.
Finally take , , and
. The preceding boundary
is a nonzero map between copies of and sends the fundamental class to the oriented boundary torus, hence is an isomorphism. Exactness then gives
The next part of the sequence is
Since , it follows that
. The degree-zero sequence makes connected. Therefore
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.
In an augmented chain complex of a simplex with vertices , put and when is absent, and zero when it is present. Direct expansion of the boundary operator gives . This proves that every positive-degree chain cycle is a chain boundary, without invoking cellular homology.