The Setting
Let be the group of unit quaternions.✦ An edge label takes values in ; its distance from the identity is the quaternion chord norm . The holonomy of a directed walk is the product of its labels in traversal order, with an inverse for each reverse traversal.
The seed presentation complex has two circles, labelled and , and two polygonal cells with boundary words (1)✦ Each circle is subdivided into three directed edges, running from the common base vertex through two interior vertices and back to the base vertex. The boundary polygon for in (1) has edges and is coned from its own vertex.✦ A sector of the seed presentation complex is a triangle obtained by coning a subdivided boundary polygon, indexed by the position of a boundary edge in the cyclic order.✦ Its letter is the letter of at position ✦; its circle edge has index for a positive letter and for a negative letter.✦ Its initial vertex is the initial endpoint of that circle edge for a positive letter and the terminal endpoint for a negative letter.✦ Its other two edges are the radial edges at that sector and the next sector. The endpoints of a circle edge are its initial and terminal vertices; the endpoints of the radial edge indexed by a sector are its polygon cone vertex and its sector initial vertex. The vertices of a sector form the union of the endpoint sets of its three edges.✦
Let be the set of vertices, edges and sectors of this complex.✦ Its cell incidence graph joins a vertex to an incident edge or sector, and an edge to a sector containing it.✦ Write , with standard generators , and let send every to . The source group is . For , the negative integral level and its directed steps are (2) A level walk in is a finite sequence of steps in (2), with adjacent to in and the ordered pair recorded at every step, including parallel edges; the empty walk stays at its initial vertex. For a label function , write for its holonomy, with value on the empty walk.✦ The level edge terminal vertex associated with the ordered pair is the point of . The pure power vertex associated with is the point of .
Quaternion Transport
The transport construction also applies to a finite graph on whose cliques have at most three vertices. A point of the coordinate simplex on is a nonnegative weight function on of total weight .✦ The face of the coordinate simplex on a subset is the set of weight functions supported on ; the simplex two-skeleton is (3)✦ For , choose a support vertex with .✦
Two vertices of are related when they are equal or adjacent.✦ A flat connection is a function such that (4)✦ A family of quaternions is in general position for when, for every and every subset of cardinality at most three, the family is linearly independent over .✦ The affine gauge and its normalized gauge are (5) Radial normalization at zero takes a fixed value in . Local chart transport, rooted transport and two-piece transport are, respectively, (6)
For a finite graph whose cliques have at most three vertices and an element , the reduced Artin normal trace records a reduced word for up to exchanges of adjacent commuting letters; when this trace has positive length, the Artin direction point has barycentric coordinates equal to its normalized initial-letter counts. At a negative integral level, write for , .✦ The level edge transport uses the upper vertex from (2): (7)✦ For a graph walk , write for the product of the labels along its successive directed edges.✦
Boundary-basis Words
A crossing shape of dimension in consists of an ordered simplex list with vertices and an integer lower height satisfying (8) For an ordered edge , its crossing edge shape is .✦ The alphabet assigns the group value to its letter; the letters remain distinct when their values coincide.✦
Fix a vertex . Translation identifies with , and pulls a level label function back to based labels : (9) In the Cayley graph for the alphabet , a letter runs from to ; let be the free group on , and let be a based label function. The semidirect label homomorphism and path holonomy are (10) where acts on functions by .
Write for the free generator corresponding to . For a crossing triangle , its boundary-basis triangle word is (11)✦ These are the lower and upper triangle words, respectively.
The Claim
Theorem 1. For the seed cell incidence graph , let . There exist , a function , a vertex and a closed level walk based at such that (12)✦
In the paper, the result reads: for every , the oriented edges of the level complex , with denoting the reverse edge, admit -labels with and , whose product around every triangular two-cell is but whose product along some closed edge path is not .
What Is Checked
The statement (12) is over the seed cell incidence graph and the translated negative integral levels , with level walks and quaternion holonomy as defined above. For the general transport (7), the graph is finite with cliques of cardinality at most three, and is in general position for .
Theorem 2. Every point of (3) has nonempty support.✦ An ordered triangle has the ordered edges , and used in (11).✦
For every there is such that (13)✦ Assume also that is flat. Let satisfy , and let three steps satisfy with indices modulo three. Then (14)✦ For a closed graph walk based at with , and any , there is a closed level walk based at satisfying (15)✦ Let assign inverse labels to reverse steps and have product on every closed triple of steps. For the based labels (9), every and satisfy (16)✦