Simplicial chains and boundary operators

Fix a commutative coefficient ring $R$ with identity and order the vertices of a simplicial complex. The group $C_n(K;R)$ is the free R-module on oriented n-simplices, with reversing orientation changing the sign. A chain is a finite R-linear combination of these generators. The boundary of an ordered simplex is the alternating sum of the faces obtained by omitting one vertex. Choosing a different coherent orientation changes basis signs; it does not change the resulting homology modules.

For an edge, the boundary is its terminal vertex minus its initial vertex. For a triangle, one of the three edges appears with a minus sign under the standard vertex ordering. These signs do not express a geometric preference for one side. They ensure that each codimension-two face occurs twice with opposite coefficients when a boundary is taken again. Over a ring of characteristic two, minus and plus agree, but paired terms still cancel because twice a coefficient is zero.

An n-cycle is a chain in $\ker\partial_n$, and an n-boundary lies in $\operatorname{im}\partial_{n+1}$. The identity just proved puts boundaries inside cycles, making their quotient a well-defined module. A cycle is zero in homology exactly when it is a boundary, not merely when its own boundary is zero. The available higher-dimensional simplices decide which cycles become boundaries. Removing a filled triangle while retaining its edges changes that quotient even though the visible triangular outline remains.

With integer coefficients, homology groups may have finite-order classes as well as free generators. Gaussian elimination over a field computes vector-space ranks but can lose this integral information; integer boundary matrices call for integral methods such as Smith normal form. Even over a field, finding the kernel of one boundary matrix is only half the calculation. One must also quotient by the image of the next matrix. A count of closed chains without that quotient generally overcounts the topological classes.

Ordinary H₀ of a nonempty finite complex is a free module with one generator for each path component. Edge boundaries identify vertices in the same component without removing the last generator of that component. Reduced homology adds an augmentation from zero-chains to the coefficient ring by summing coefficients. Its degree-zero kernel removes one overall component contribution. For a nonempty path-connected complex, reduced H₀ is zero while ordinary H₀ remains the coefficient ring; positive-degree groups are unchanged.

A simplicial complex is combinatorial input together with its geometric realization. Subdividing changes the chain groups and matrices, yet the associated homology of the realization remains the same. Establishing this invariance needs a theorem connecting subdivisions or connecting simplicial and singular homology; it does not follow from the number of vertices being unchanged, since that number may increase. Small explicit computations are valuable reference cases for checking orientations, degree-zero conventions, and matrix algorithms before larger examples hide these distinctions.