The Setting
The comparison concerns transport around null words in a Cayley graph, with flatness prescribed on a finite basis of its cycle module.
Let be residually finite, let be a finite alphabet, and let assign group values to its letters. Distinct letters remain distinct even when their values coincide. The word evaluation is the homomorphism from the free group sending to ; a null word is an element of its kernel.✦ The generator edge runs from to .
Put , acting on the left. The based edge chain module is the free abelian group on these edges, with boundary in and cycle module defined by (1): (1) For a word , its signed based edge chain is the sum of its positively traversed edges minus the edges traversed in reverse, starting at .✦ The relator boundary map for a family of words is the homomorphism in (2): (2)✦ A boundary basis for , indexed by a finite set , is a family of null words for which is an isomorphism.
A genuine presentation of is a pair consisting of a generator map with surjective evaluation and a family of null relators satisfying (3), where the brackets denote normal closure in : (3)
For a group , an edge labeling of the generator edges of is a function . The reverse of receives the inverse of , and products follow traversal order. The label lift is the homomorphism determined by (4), where acts on functions by right translation.✦ The path transport of a word from a vertex is the value at of the first coordinate of : (4)
The unit quaternion group consists of the quaternions of norm one.✦ For , the set of small flat -labelings is defined by (5); the norm is the quaternion chord norm: (5)
For an extension of the generator map on , the extra edge projection is the homomorphism that kills the -edges and retains the -edges.✦ For relators indexed by , the extra relator boundary is the map in (6): (6)✦ Write for the inclusion. For labelings and , the combined labeling equals on the -edges and on the -edges.✦
The Fixed Height Kernel
The fixed presentation has generating letters ; its relators and their boundary polygon lengths are given in (7), where counts signed letters: (7) The subdivided rose has a common vertex and two interior vertices for each circle .✦ Its circle edges run in order along , specifying their initial and terminal vertices.
A polygon sector , with , is a triangle in the coned boundary polygon for .✦ The next sector of is the polygon sector .✦ The relator letter of a polygon sector is the letter at position in .✦ If that letter is , the sector boundary edge is ; for it is .✦ The initial vertex of a polygon sector is the initial vertex of when the sector relator letter is positive and its terminal vertex when that letter is negative.✦
The presentation complex vertices are the rose vertices together with the two cone vertices .✦ The edges of the presentation complex are the circle edges and the radial edges from to .✦ The sector edges of triangle are ✦, and its sector vertices are the union of their endpoint sets.✦ The presentation complex cells are its vertices, edges and triangles.✦ Proper face incidence between cells of the presentation complex is the relation given by vertex membership in an edge’s endpoint set or a triangle’s vertex set, or edge membership in a triangle’s edge set.✦ The cell incidence graph has these cells as vertices and joins two cells when either is a proper face of the other.✦
The Artin height kernel of the right-angled Artin group on is the kernel of the height homomorphism in (8), with denoting the standard generator corresponding to a vertex of : (8)✦
For a group , an ordinary CW classifying space of dimension at most is a path-connected Hausdorff space with a CW structure on all of , no cells in dimensions greater than , and a point with , admitting a surjective covering map from a contractible space .✦ There is no restriction on the number of cells.
The Claim
Theorem 1. (i) Suppose is surjective and is a boundary basis. Suppose also that has a genuine presentation for which is an isomorphism. Then (9)✦
(ii) Let send every letter of to , and put . Let be null for , and let , indexed by , be null for . Suppose is normally generated by the , is injective, for every , and the extra relator boundary is an isomorphism of abelian groups. Then (10)✦
(iii) Let be a compact topological group and let be any generator map. Let index words , starting vertices , and closed subsets . Let contain , and let take values in . Suppose that for every normal subgroup of finite index, every finite , and every labeling , there is a labeling whose combined transport, for the generator values induced by in , lies in on at every starting vertex whenever . Then (11)✦
(iv) For the fixed Artin height kernel, (12)✦
In the paper, the result reads: if a residually finite group has a finite generating alphabet , a finite indexed family of null words for which is an isomorphism , and a of dimension at most two, then some makes every oriented generator-edge -labeling with inverse labels on reversals, chord distance less than from , and trivial transport on every translate of every , have trivial product on every closed edge path.
What Is Checked
The rigidity statements (9) and (10) use the relator boundary maps and ordered unit quaternion path products, while finite quotient compactness (11) uses compact topological groups with closed target sets and (12) uses ordinary CW classifying spaces of the fixed height kernel .