The Setting
The group has one generator for each edge of a triangle complex with three vertices , and , and its relators are the boundary words of the triangles of together with the two edges of a spanning tree.✦ The edges are the middle edges from to , the left edges from to and the right edges from to , whose indices , , , , , are labels, blocks, indices and coordinates defined below; each triangle is bounded by a word . Angles are integers in units of : a triangle has angle at and at and at , so its angles sum to , which is , and a full turn is .
By van Kampen’s lemma, a word in the generators is trivial in exactly when it is the boundary word of a van Kampen diagram, a disc of triangles of . The question is which closed edge paths bound such a disc, judged by angles in links: around an interior vertex of a diagram the corners form a closed walk in the link of at that vertex, and where the boundary passes through a vertex it turns through a walk in the link from one boundary edge to the next. The paths in view are the rectangular words, closed paths of four middle edges , , , with the same index , taken with and , the second and fourth edges traversed backwards.
The library states the answer for triangle ribbons, diagrams given by finite sets of darts, each dart labelled by a vertex of a graph, the link graph, together with a count of angles on a disc. For the group built from marked line data, a family of lines in with marked points, where is a prime, it states that the rectangular words in the generators are nontrivial.
Triangle Ribbons
A triangle ribbon is a finite set of darts with two permutations, a fixed-point-free involution , the edge involution, and a face permutation , together with an outer face among the cycles of and a colouring of the cycles of by three colours , , , subject to the two conditions below.✦ The edges of are the cycles of , the faces of are the cycles of , and the vertices of are the cycles of the vertex permutation , the face permutation followed by the edge involution, which rotates the darts about their corners; is the vertex of the dart . Every face other than is a triangle with one corner at each of , , : on its darts, is a bijection onto , the colour marking the corner at . The Euler count of a disc holds: (1)
The weight of a colour is the angle of its corner, and , and a dart has weight .✦ A dart of is outer when it lies in the outer face , on the boundary of the diagram.✦ The corner angle of a dart is if is outer and otherwise.✦ At a vertex of , the angle sum is the sum of the corner angles of the darts at ✦, and the number of visits is the number of outer darts at , the number of times the boundary passes through : (2)✦
A walk in a simple graph, of length , is reduced when no step immediately reverses the previous one: its vertices at positions and differ whenever .✦ No condition is imposed at the closing seam of a closed walk.
A labelling of in a graph , the link graph, is a map from the darts of to the vertices of . The labelled ribbon satisfies the link condition when, for every dart , every closed reduced walk of positive length at has , that is . The boundary turn at an outer dart goes from to ; it is geodesic when every reduced walk in from to has , that is .
Angle Counts on a Disc
Angle disc counts consist of a finite set of vertices, a number of edges, a number of faces and, at each vertex , a number of visits and a nonnegative real angle sum , subject to (3)✦
Marked Line Data and the Group
Fix a prime and a natural number , and let . Marked line data consist of a set of size ; a finite set of labels, each label carrying a mark and a projective direction of , distinct labels having distinct marks; and a finite set of exceptional points.✦ A point of is incident to the label when and for some ; the punctured line through in direction is the set of points incident to ; is the set of labels incident to . The data satisfy the degree condition and the budget, (4) and the girth condition: in the bipartite incidence graph, whose vertices are the points of and the labels, a point being adjacent to the labels incident to it and two points or two labels never adjacent, every cycle has length greater than .
A point of outside is regular.✦ A Cartesian block with parameter is a finite set of labels with a bijection onto , for positive integers .✦ A two-block partition of a finite set of labels is a pair of Cartesian blocks, block and block , with disjoint label sets whose union is .✦ For , each regular point carries a chosen two-block partition of .✦ A block index is a pair of a regular point and ✦, and the block at is block of the partition at .✦
Block presentation data over a set of labels consist of a Cartesian block for each index of a set , with sides , and coordinates , a base block and a base index with .✦ Their edges are the middle edges for every label and , the left edges for , and , and the right edges for , and .✦ For a block , a label in it and indices , , the triangle word is (5)✦ with taken modulo and modulo . The two tree edges are and , and is the image of in .✦
The fixed presentation of marked line data with is the block presentation data over their labels whose blocks are indexed by the block indices, each index carrying its block, with base block at a chosen regular point and base index .✦ A family of elements of a group, indexed by pairs, has surviving rectangles when each of its rectangular words with and is not the identity.✦ Marked line data have rectangular nontriviality when, for every label , the middle generators of the fixed presentation have surviving rectangles.✦
The Claim
Theorem 1.
Let be a triangle ribbon labelled in a graph , and suppose that satisfies the link condition. Then there are an outer dart and a reduced walk in from to with (6)✦
Let be a triangle ribbon labelled in a graph , and suppose that every boundary turn of is geodesic. Then every vertex of with has (7)✦
Let angle disc counts be given in which every vertex with has . Then some vertex has (8)✦
Let marked line data with be given, and let be the group of their fixed presentation. Then for every label and all indices and , (9)✦
In the paper, the result reads: in , or in any compatible Euclidean simplicial subdivision of , a nonempty closed edge path whose every cyclic turn has link distance at least is not nullhomotopic.
What Is Checked
Parts 1 and 2 of the claim are stated over a triangle ribbon labelled in a graph, with the corner weights and , the angle sums and visits of (2) and reduced walks in the link graph; part 3 is stated over angle disc counts subject to (3), and part 4 over marked line data with and the group of their fixed presentation.
The library proves, beside the claim, that marked line data have a regular point.✦