The Setting
An attachment gives a filling problem in which a chain may leave a remainder on the attaching locus. The library defines absolute and relative exactness for families of finite faces, with chains graded by the number of vertices in a face.
Let be a vertex set and let be the field of integers modulo .โฆ The space of finitely supported simplicial chains on is the vector space of finitely supported functions from finite subsets of to .โฆ For a finite subset , the basis chain takes value at and elsewhere. The support of a chain is the set of finite subsets on which its coefficient is nonzero.
For a family of finite subsets of , the subspace of chains supported on is defined by (1): (1)โฆ For a family of finite subsets of and , the cardinality- subfamily consists of the members of with vertices, and is the subspace of supported on , as in (2): (2) Raw degree corresponds to augmented simplicial degree .
The simplicial boundary on is the linear map determined by the vertex deletion rule (3): (3)โฆ
The Definition
Definition 1. Let and be families of finite subsets of , and let . A family of finite subsets of a vertex set is exact in raw degree if every chain with admits a filling as in (4): (4)โฆ For families and of finite subsets of a vertex set and , the family is exact relative to in raw degree if every chain with admits a chain satisfying (5): (5)โฆ
In the paper, the result reads: for a nonidentity codistance with nonempty descent set in the type set and , the block is , where has vertices and is the opposition complex in a spherical -residue, the attaching locus is , and the surviving relative faces contain all of , yielding the chain isomorphism (6): (6)
What Is Checked
The definitions (4) and (5) are stated over a vertex set , families of finite subsets of , and a raw degree , using finitely supported chains over and their simplicial boundary.