The Setting
Let be a finite group and let be a family of subgroups, where . Faces of the associated coset complex have a common representative in . Their simplicial homology is compared with the obstruction to writing a cocycle on the finite coset complex as a coboundary. All coefficients are in , the field of integers modulo .✦
An abstract simplicial complex on a set is a family of finite subsets of that contains the empty set and is closed under taking subsets.✦ A typed coset vertex in the vertex set associated with the family of subgroups of is a pair consisting of a type and a left coset of in .✦ The vertex map and the coset face , for and , are defined in (1). The typed coset complex on is the abstract simplicial complex with the faces specified in (1).✦ (1)
A finite simplicial complex on vertices is a family of subsets of containing the empty set and every singleton, and closed under taking subsets.✦ Choose the vertex labelling bijection . The labelled vertex , the chamber and the finite coset complex are given by (2); denotes the power set. (2)
Chains and Cochains
For an abstract simplicial complex , a face of raw grade is a member of with vertices.✦ The space of finitely supported chains of raw grade on an abstract simplicial complex is the free vector space on the faces of with vertices, as in (3).✦ Raw grade corresponds to augmented simplicial degree . (3)
Vertex deletion sends a face and a vertex to .✦ The simplicial boundary of an abstract simplicial complex is the linear map from to determined on a face by the sum of its vertex deletions, as in (4).✦ (4)
The simplicial chain complex is indexed by nonnegative simplicial degree, with terms and differentials in (5).✦ Write for its homology in degree . (5)
For a finite complex , an -face is a member of with vertices.✦ An -cochain on a finite simplicial complex is a function from the faces of with vertices to .✦ The dual chain space is the linear dual of the cochain space, with its face basis of evaluation functionals, as in (6). (6)
The simplicial coboundary of a finite simplicial complex is the linear map from to whose value on an -face is the sum of the input cochain over its -faces. The dual boundary of a finite simplicial complex is the linear map that sends a functional to the functional evaluating each cochain by applying to , as in (7).✦ These dual chain spaces and boundaries form the chain complex .✦ (7)
An -cocycle on a finite simplicial complex is a cochain in whose coboundary vanishes.✦ A coboundary of positive degree on a finite simplicial complex is a cochain in obtained by applying to a cochain in ; a coboundary of degree zero on is a constant function in .✦ The corresponding sets are defined in (8). (8)
The typed face bijection from to is the map sending a typed face to its set of vertex labels.✦ The typed chain identification from to is the linear bijection that sends each face to the corresponding evaluation functional, as in (9); here the are coefficients in and .✦ (9)
A finite simplicial complex has a connected one-skeleton when its vertex set is nonempty and any two vertices are joined by a finite path.✦ A path may have length zero; each step joins distinct vertices with .
The Claim
Theorem 1. Let be a finite group and let be a family of subgroups. The degreewise identifications give an isomorphism of chain complexes (10)✦ Let , and suppose that . Then (11)✦ Let be a finite simplicial complex with connected one-skeleton. Then (12)✦
What Is Checked
The coset assertions (10) and (11) are stated over a finite group with specified subgroups and coefficients in ; the vanishing hypothesis concerns the chain complex in (5). The degree-zero assertion (12) is stated over a finite simplicial complex with nonempty connected one-skeleton.