Computational topology 2026-11-05
Computational topology develops algorithms for topological questions about finite representations of spaces, such as simplicial complexes. It connects discrete data structures to invariants that ignore irrelevant geometric distortion. connected components and homology groups are examples of computable structural information.[ref]
For a small simplicial homology calculation over a field, take three vertices joined by three edges in a cycle, without a filled face. The matrix of the first boundary operator has matrix rank two, so this linear map has a kernel of a linear map of dimension one; with no two-dimensional face, that cycle is not a boundary. Thus the first Betti number is one. Adding the filled triangular face makes the same cycle a boundary and reduces the first Betti number to zero. The vertex coordinates need not change: the encoded incidence structure determines whether the hole is present.
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.
Finite simplicial complex 2026-11-05
A finite simplicial complex is a simplicial complex containing only finitely many simplexes. With the convention that every vertex belongs to a simplex, this is equivalent to having finitely many vertices of a simplicial complex: a finite vertex set has only finitely many subsets.
Its geometric realization is a finite union of compact geometric simplexes, hence compact. The simplicial chain groups have finite bases, so their boundary maps can be represented by finite matrices. This makes simplicial homology a finite linear-algebra calculation after coefficients are chosen.
Three vertices and their three joining edges form a finite complex whose realization is a circle. Adding the filled triangular face produces a finite complex realizing a disk, which is contractible. Thus finiteness makes the data manageable but does not determine the homotopy type.
Homology (mathematics) Created 2026-09-24 Updated 2026-11-05
For a chain complex , its th homology is the abelian group or module
The equation says that every chain boundary is a chain cycle. Homology identifies two chain cycles when their difference is a chain boundary; a homology class records exactly what survives this identification.
In singular homology, the chains are finite sums of maps from simplexes into a topological space. A continuous map induces homomorphisms on all homology groups, and homotopic maps induce the same homomorphisms. This makes homology a computable way to distinguish topological spaces that cannot be homotopy equivalent.[ref]
For a circle, records its one path component, while records signed winding around it. A closed disk has the homology of a point: its boundary circle becomes a chain boundary when filled by the disk. Simplicial homology and cellular homology replace singular chains by smaller chain complexes suited to triangulated or cellular spaces.
Use simplicial homology with a fixed coefficient group or ring. The Mayer–Vietoris sequence is
The inclusion maps define and . To define , split a simplicial cycle as with a chain in and in . Since , this boundary lies in , and . At degree zero the unreduced sequence ends with .
If , its representative is a boundary in and the negative of a boundary in , so . Thus .
Conversely if , choose and with . The chain is a simplicial cycle in . Its splitting into the chain and chain gives . Hence , the requested exactness at .
Simplicial chain 2026-11-05
A simplicial -chain is a finite formal linear combination of oriented -simplices of a simplicial complex, with coefficients in a specified abelian group or ring. With integer coefficients,
where reversing a simplex's orientation changes its sign. The chains form the simplicial chain group. In characteristic two the sign distinction disappears.
The boundary operator is extended linearly from
For a filled triangle, . Applying the boundary again gives , where each vertex label denotes its basis zero-chain. The cancellation exemplifies .
A chain with zero boundary is a simplicial cycle; a chain that is the boundary of a higher chain is a chain boundary. Their quotient is the relevant simplicial homology group.
Simplicial chain group 2026-11-05
For an abstract simplicial complex , the integer simplicial chain group is the free abelian group on its oriented -simplexes, with reversal of orientation changing sign. Thus a chain is a finite formal integer sum of oriented simplices. After choosing one orientation for each simplex, those chosen simplices form a basis of this abelian group.
For a filled triangle with vertices , , and . Its oriented two-simplex has boundary
Taking another boundary gives . This cancellation makes the simplicial chain complex possible: boundaries are cycles, and simplicial homology measures cycles modulo boundaries. With coefficients in an abelian group , use .[ref]