The Setting
The question is whether a particular Artin height kernel admits a two-dimensional classifying space. Its defining graph comes from a subdivided presentation complex. The presentation relators are the words in the free group on given by (1). (1)✦
The subdivided rose has a common vertex and two interior vertices for each circle label .✦ Its circle edges , with , have the initial and terminal vertices displayed in (2). (2)
For , the boundary polygon length is , where the bars denote word length.✦ A polygon sector is a pair with ✦; its next sector has index modulo .✦ The sector relator letter is the signed letter of at position .✦ If its circle label is , the sector boundary edge is for a positive letter and for a negative letter.✦ The sector initial vertex is the initial endpoint of this edge for a positive letter and its terminal endpoint for a negative letter.✦
The presentation complex vertices consist of the rose vertices and two cone vertices .✦ Its edges consist of the circle edges and a radial edge for every sector , with endpoints and the sector initial vertex. The triangular sector has as edges its boundary circle edge and the radial edges indexed by and ✦; its vertices are all their endpoints.✦ The presentation complex cells are the disjoint union of these vertices, edges and triangular sectors.✦ Proper face incidence consists precisely of these vertex-edge, vertex-triangle and edge-triangle incidences.✦ The cell incidence graph is the simple graph with these cells as vertices, joining two cells when one is a proper face of the other.✦
The ambient right-angled Artin group , its height homomorphism and the source group are defined in (3); here denotes the standard Artin generator corresponding to a vertex of . (3)
For a group and a nonnegative integer , an ordinary classifying space of dimension at most is a path-connected Hausdorff cell complex with the closure-finiteness and weak-topology (CW) properties, no cells above dimension , a point and an isomorphism , admitting a surjective covering map from a contractible space .✦ Write for the collection of these spaces, allowing any number of cells. The integral cohomological dimension of a group is the projective dimension of the trivial left module over the integral group ring , as in (4). (4)✦
Presentations and Boundary Bases
Let be a generator alphabet for a group , with assigned values ; distinct letters may have the same value. For and , the edge labelled runs from to . The based edge chain group is the free abelian group on these edges.✦ The edge boundary and the Cayley cycle module are defined by (5), where and vertices are identified with the usual basis of . (5)
Word evaluation is the homomorphism from the free group extending .✦ A genuine presentation of a group consists of a generator alphabet , assigned values and a relator family satisfying (6); the double angle brackets denote normal closure in . (6)
The signed based path chain of a word is the sum of its traversed edges from , with negative coefficients for reverse traversals.✦ The relator boundary map is the integral linear map specified on based relators by (7). (7)✦
A genuine boundary-basis presentation of a group is a genuine presentation of whose relator boundary map is an isomorphism of abelian groups onto its Cayley cycle module, as in (8). Let be the collection of these presentations, with arbitrary generator alphabets and relator index sets. (8)
Level Labels
The unit quaternion group consists of the quaternions of norm one; its distance from the identity is the chord norm .✦ For edge labels , path holonomy is the product of labels along a word’s Cayley path in traversal order, with inverses for reverse traversals.✦ The semidirect label homomorphism is the homomorphism , for the shift action, sending to ; its function component evaluated at is the path holonomy based at .
For a graph on , let be the height homomorphism on its right-angled Artin group sending every standard generator to . For a nonnegative integer , the negative integral level and its terminal-vertex map are defined by (9). (9) A directed level walk is a finite sequence of steps with and adjacent in , retaining every ordered pair , including parallel edges.✦ The empty walk stays at its initial vertex. For labels , the labelled walk holonomy is the product of the labels of the walk in traversal order; the empty product is .✦
A graph admits arbitrarily small nontrivial level transport if, for every real , there are an integer , labels and a closed directed level walk satisfying (10). The first two conditions range over all and . The third ranges over all triples of terminal-vertex steps with for and . (10)
The Claim
Theorem 1. Let be any graph admitting arbitrarily small nontrivial level transport. Its height kernel satisfies the boundary-basis obstruction (11). (11)✦ For the source group , the presentation obstruction is (12), and the classifying-space obstruction is (13). (12)✦ (13)✦ The source group has the properties in (14). (14)✦
What Is Checked
The transport obstruction is stated over arbitrary graphs and genuine presentations; its source instances concern the height kernel of the specified cell incidence graph and ordinary CW classifying spaces.
The terminal-vertex map preserves each negative integral level.