Simplicial homology
Builds on Simplicial complexFree abelian groupKernel of a homomorphism
Definition
Let be a simplicial complex with a total order on its vertex set. For let be the free abelian group with basis the -simplices of , and let for . An -simplex with vertices is written . The boundary map is the homomorphism given on basis elements by where means that is omitted, and . Then , so is a chain complex. The -th simplicial homology group of is
Remarks
Elements of are -cycles and elements of are -boundaries; the kernel contains the image because . The groups do not depend on the vertex order up to isomorphism. With coefficients in an abelian group , one uses .
Example: let be the boundary of a triangle, with vertices and edges , , . Then , , . The kernel of is generated by , and there are no -simplices, so ; also .
Non-example: dropping the signs does not give a chain complex over . For the -simplex, the unsigned boundary of is , whose unsigned boundary is .
Reading path
To understand this page from the ground up, read these 6 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Free abelian group concept
- Group concept
- Simplicial complex concept
- Group homomorphism definition
- Kernel of a homomorphism definition
- Simplicial homology definition
Further reading
About this page
| Tag | R1RQ3226WV |
|---|---|
| URI | m2://R1RQ3226WV |
| Kind | definition |
| Writing | W0 stub |
| MSC | 55N10, 55U10 |
| Defines | Simplicial homology |
| Uses | Simplicial complex, Free abelian group, Kernel of a homomorphism |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.