The Setting
For a matrix over a complex group ring, consider paths whose closing step is twisted by a fixed group element. Let be a group, let be a finite index set, and let be a group ring matrix. The corresponding complex matrix algebra is .✦ Fix , and write for the ordinary matrix trace.
For , the centralizer is the subgroup of specified in (1)✦, and the cyclic subgroup of is generated by .✦ (1)
The matrix support is the finite set of group elements having a nonzero coefficient in some entry of , as in (2). (2)✦
For , a path in is a tuple . The twisted increments of a path are the group elements defined in (3). (3)✦ Centralizer equivalence of paths is the relation on given by (4). (4)✦
The Claim
Definition 1 (Centralizer action and path weights). The centralizer quotient is the quotient group of by ✦, and the vertex space is the set of right cosets of in , as specified in (5)✦; right translation by sends to .✦ (5)
Let be finite and symmetric, meaning . The support graph is the simple graph on with adjacency (6). (6)✦ The centralizer quotient action is free as in (7). (7)✦ The degree bound is (8). (8)✦ If generates , then (9) holds. (9)✦ If is finitely generated, a finite set can be chosen with the properties in (10). (10)✦
The coefficient matrix of at is defined by (11). (11)✦ The convolution kernel is given by (12). (12)✦
For , the path orbit space is the quotient in (13) by the centralizer equivalence (4). (13)✦ The path weight is defined by (14), with the matrix factors ordered by increasing . (14)✦ The orbit weight is the function assigning the path weight to the orbit , as in (15). (15)✦ Write for the basis vector at in the free complex vector space on . The weighted path orbit vector in is the finitely supported vector defined in (16). (16)✦
In the paper, the result reads: for a finitely generated group , an idempotent , and an infinite-order element , put , , and ; a finite symmetric generating set containing the nonidentity coefficient support and its inverses gives a connected simple graph on by right steps in , of degree at most , on which acts freely by graph automorphisms, while for the weight of a tuple in , with only the closing factor when , gives a finite chain on .
What Is Checked
The constructions are stated over arbitrary group ring matrices on a finite index set and arbitrary ; finite generation is assumed for the choice of in (10).
For every finite symmetric set , each vertex of has finitely many neighbors✦, so is locally finite.✦ For every , the orbit weight is nonzero on only finitely many orbits.✦