The Setting
The chain problems concern attachment along the boundary of a simplex and descent from an increasing union of face families. Coefficients are in . An abstract simplicial complex on a vertex set is a family of finite subsets of containing the empty set and closed under taking subsets.โฆ
A finite chain on a vertex set is a finitely supported -valued function on the finite subsets of .โฆ For a finite subset of , write for the chain with coefficient one at and zero elsewhere. For a family of finite subsets of and a nonnegative integer , the chain space is the space of finite chains on supported on , and the grade chain space is the space of such chains supported on faces of cardinality , as in (1): (1) Grade corresponds to augmented simplicial degree . The simplicial boundary is the linear map on defined by (2): (2)โฆ
Exactness in grade for a family of finite subsets of is the condition that every grade cycle supported on is the boundary of a grade chain supported on .โฆ Relative exactness in grade for two families and of finite subsets of is the condition that every grade chain supported on whose boundary is supported on differs from a boundary in by a grade chain supported on .โฆ (3)
The Attachment
Let be a vertex set disjoint from , and let be finite. The simplex join is the family of faces whose part is contained in and whose part is a face of .โฆ The boundary attachment of the simplex join is the family of faces of whose part is a proper subset of .โฆ For a subset of and a finite subset of , write for their union in the disjoint union of the vertex sets; these families are given by (4): (4)
The relative join projection is the linear map that retains the coefficient of each face containing the whole block and removes that block, as specified in (5): (5)โฆ
The Claim
Theorem 1. Let be an abstract simplicial complex on , and let be a finite subset of a disjoint vertex set . For every , the projection and boundary satisfy (6): (6)โฆ
Let . Assume whenever . Then the attachment has the relative exactness in (7): (7)โฆ
Let be an increasing sequence of families of finite subsets of a vertex set. Assume for every and . Then exactness descends as in (8): (8)โฆ
In the paper, the result reads: for the infinite coset complex of a group relative to subgroups , with construction parameter , with chosen as in the construction and for the spherical opposition input, for .
What Is Checked
The claims are stated over finitely supported -chains on abstract simplicial complexes for the attachment statements, and over arbitrary increasing families of finite subsets for filtration descent.