The Setting
An alphabet mapped to a group gives a directed graph whose paths are read as words. Comparing presentations uses both noncommutative transport along these paths and integral edge chains.
Let be a group, let be a set of letters, and let assign their group values. Distinct letters remain distinct even when their values agree. Write for the free group on , and let be a family of chosen words, indexed by a set . The vertex chain group is , where is the basis vector at .
Let be a group and a labeling of the positively oriented edges, with the edge indexed by running from to ; quaternion labels take values in , the unit quaternion group. The group acts on the group of functions by . The semidirect label homomorphism is the homomorphism determined by (1): (1)✦
For a word with and a starting vertex , set and . The initial vertex of the corresponding positively oriented edge is when and when . Write for the function component of an element of .
The Definition
Definition 1. For the group , alphabet map , edge labels , and chosen words above, word evaluation is the homomorphism from the free group on the alphabet to the group specified in (2): (2)✦
The group of based integral edge chains is the free abelian group in (3), whose basis vector at is denoted by : (3)✦
The edge boundary from the edge chain group to the vertex chain group is the homomorphism of abelian groups specified on the basis by (4): (4)✦
The cycle module is the subgroup of edge chains with zero boundary, as in (5): (5)✦
The path label product is defined by (6), with factors ordered by increasing : (6)✦
The signed path chain based at is defined by (7): (7)✦
The relator-chain map is the homomorphism of abelian groups in (8), where denotes the basis vector indexed by : (8)✦
In the paper, the result reads: has a finite generating alphabet retaining distinct letters with the same group value, generator edges run from to , acts on the left, the edge boundary sends to , is the signed edge chain based at , all words and chains have finite support, and products of -labels follow traversal order with inverse labels on reverse edges.
What Is Checked
These definitions are stated over an arbitrary group , sets and , an alphabet map , a family of words, and edge labels in a group .