Fundamental class of an orientable simplicial pseudomanifold Created 2026-09-24 Updated 2026-11-05
Let be a finite -dimensional simplicial pseudomanifold, , without boundary. If its top-dimensional simplexes admit compatible orientations, their signed sum is a simplicial cycle . Compatibility means that the two induced orientations on each shared codimension-one face of a simplex cancel. Since the top simplexes are connected through such faces, every integral top-dimensional cycle has one common coefficient, up to these orientation signs. Thereforegenerated by . If compatible orientations do not exist, propagating a coefficient around an orientation-reversing chain of faces forces it to equal its negative; the integral top homology is then zero.
Finiteness matters for ordinary homology: a triangulated real line is orientable but has . Summing all its edges is an infinite, locally finite chain, rather than an ordinary finite singular chain. Its orientation class belongs instead to Borel-Moore homology.
Past exam of the mathematics course of the University of Cambridge 2007 ii Paper 2 21H Solution Created 2026-09-24 Updated 2026-10-14
Use simplicial homology with a fixed coefficient group or ring. The Mayer–Vietoris sequence isThe 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 .
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 .
Past exam of the mathematics course of the University of Cambridge 2015 ii Paper 4 18H Solution Created 2026-09-24 Updated 2026-10-14
The Mayer–Vietoris sequence for is the long exact sequence in homologyWe use integer coefficients. A simplicial cycle in can be written with chains in . Since , this chain lies in and is a cycle. Define ; changing the splitting or the cycle representative changes this by a boundary, giving a well-defined connecting homomorphism.
First consider two acyclic subcomplexes. Their intersection is either empty or acyclic. If empty, positive-degree homology of their disjoint union vanishes. If nonempty, the reduced Mayer–Vietoris sequence implies the same conclusion, including degree one since the intersection has zero reduced . This proves the claim for two subcomplexes.
Inductively let , , and . Discard empty members as necessary. Both and satisfy the same intersection hypothesis with at most members, so their homology vanishes in degrees at least . The exact segment then gives . For these degrees are positive and the induction applies directly; empty again means a disjoint union.
For sharpness, take the boundary of an -simplex, covered by its facets. Every nonempty proper intersection of facets is a simplex and thus has the homology of a point; the intersection of all facets is empty. The union is a sphere and is nonzero. For it is two isolated vertices and ; for , . The degree bound cannot be lowered.
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 fromFor 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.