The Setting
The complex in question is a triangle complex with three vertices , and , built from punctured lines in for a prime ; each of its triangles has one corner at each vertex. Angles are measured in units of : a triangle has angle at and at and at , so its angles sum to , is and is . The edges of from to come in arrays , one for each of finitely many labels of the marked line data defined below, with for a positive integer . A rectangular word of is the product of four of them, at the corners of a rectangle of indices, with and . With the group of , presented by its edges and triangles, the questions are whether is torsion-free and word hyperbolic, and whether its rectangular words are nontrivial.
The angles are read on triangle fillings, defined below: diagrams made of triangles, in the manner of van Kampen diagrams, whose corners are labelled by vertices of a graph , thought of as a link graph. A walk of length in , read at a corner of angle , has angular length ; this is compared with for closed walks and with for walks that run along the boundary.
Marked Line Data
Fix a prime and a natural number , and put . For a point of and a projective direction in the projective space of , the line through in direction is the image of the affine parametrization of , which takes the value at . A point of is incident to and when it lies on the punctured line (1)โฆ
Marked line data for and consist of a set of size ; a finite set of labels, each label carrying a mark and a projective direction , with distinct labels having distinct marks; and a finite set of exceptional points.โฆ Write for the line through in direction , and for the set of labels whose punctured lines pass through a point . The data satisfy the degree and budget conditions (2) and the girth condition: every cycle in the bipartite incidence graph, whose vertices are the points of and the labels, with each point adjacent to the labels in , has length greater than . The points of are the regular points.โฆ
A Cartesian block with parameter is a finite set of labels together with positive integers and a bijection from onto .โฆ A two-block partition of a finite set of labels is a pair of Cartesian blocks with parameter , block and block , whose label sets are disjoint with union .โฆ For , every regular point carries a chosen two-block partition of .โฆ A block index of is a pair of a regular point and โฆ; its block is block of the partition chosen at , with sides , and coordinates โฆ.
The Complex and Its Group
Block presentation data with labels in and parameter consist of a set of block indices, a Cartesian block with parameter for each , a base block and a base index with .โฆ Such data define a triangle complex on the vertices , and . Its edges are the middle edges from to , for and โฆ; the left edges from to , for , and โฆ; and the right edges from to , for , and โฆ. Its triangles, one for each block , label and pair of indices , have the boundary words (3)โฆ with the indices of and taken modulo and .
The group of the data is presented by one generator for each edge of , with relators the triangle words (3) and the two spanning-tree edges and .โฆ Each edge, among them, also denotes its generator in .โฆ
The fixed presentation of marked line data , for , is the block presentation data with the labels of , the block indices of with their blocks , the base block at a chosen regular point , and the base index .โฆ From here on, and are the complex and the group of this presentation.
Torsion-free and Hyperbolic Groups
A group is torsion-free when , for and an integer , forces .โฆ A walk in a graph is geodesic when its length equals the distance between its ends.โฆ Given walks from to , from to and from to in a graph , and a natural number , the side is -thin when (4)โฆ A group is word hyperbolic when it has a finite subset whose Cayley graph is connected and a natural number such that, in every triangle of geodesic walks in that Cayley graph, each side is -thin with respect to the other two.โฆ
Triangle Fillings and Link Walks
A triangle filling consists of a finite set of darts, a fixed-point-free involution of , a permutation of with one of its cycles marked as the outer face, and a coloring by , and of the cycles of .โฆ The cycles of , and are the edges, faces and vertices of , and a dart lies at the vertex that is its cycle under . Every face other than the outer one has exactly three darts, lying at vertices of the three colors, one each; and with , and the numbers of vertices, edges and faces other than the outer one, (5)โฆ
The darts of the outer face are the boundary darts.โฆ The corner weight of a dart is the angle at its vertex: when the vertex has color , the corner at , and when it has color or , at or .โฆ
A labelling of in a graph is a map from the darts of to the vertices of .
A walk in a graph is reduced when no step immediately reverses the previous one; no condition is imposed at the closing seam of a closed walk.โฆ
The Claim
Theorem 1. Let be marked line data for a prime and a positive integer , and let be the group of its fixed presentation. Then (6)โฆ (7)โฆ and for every label of and all indices and below , (8)โฆ Let be a triangle filling and a labelling of in a graph . Then there are a dart and a reduced walk in , either closed at and of positive length, or running from to with a boundary dart, such that, respectively, (9)โฆ
In the paper, the result reads: for a connected finite Euclidean triangle complex in which, for some , every nonempty cyclically reduced closed edge walk in each vertex link has angular length at least , the fundamental group is torsion-free and word hyperbolic, and a nonempty closed edge path whose every cyclic turn has link distance at least is not nullhomotopic.
The library states the paperโs result for the one complex , with the conditions on links read on triangle fillings in (9) and the conclusion on closed paths given for the rectangular words in (8).
What Is Checked
The claims (6), (7) and (8) are stated over marked line data for a prime and a positive integer , through the fixed presentation of : its block indices with the Cartesian blocks of the chosen two-block partitions, and the group presented by the edges of with the triangle words (3) and two spanning-tree edges as relators. The claim (9) is stated over any triangle filling, with its corner weights, and any labelling of its darts in a graph .
Besides the claim, the library proves that marked line data have a regular point.โฆ