The Setting
Take a prime , the space and a finite family of lines in , each with a marked point. At each regular point of , a point outside a finite exceptional set, the lines through it are split into two Cartesian blocks, each a grid of lines indexed by pairs of residues, and the blocks give a triangle complex with three vertices , , : a middle edge from to for each line and indices , below a natural number , and edges from to and from to that close the middle edges into triangles. The group is presented by the edges of , with the triangles as relators and two edges of a spanning tree set to . The question is whether is word-hyperbolic: whether the geodesic triangles of a Cayley graph of are uniformly thin.
The library states that is word-hyperbolic, together with six statements about angle disk counts, fillings in a lifted complex of , clipped distance forms on the Cayley graph of with respect to the edges, and thin triangles in discrete metric spaces.
Marked Line Data
Let be a prime and . The line through a point of in a projective direction with representative vector is the set of points for ✦, and a point of is incident to in that direction when it lies on the punctured line ✦.
Marked line data for and a natural number consist of a set of size ; a finite set of labels, each label with a mark and a projective direction in , distinct labels having distinct marks; and a finite set of exceptional points. With the line through in the direction of , and the set of labels with , the lines through , the data satisfy (1) and every cycle in the bipartite incidence graph on the points of and the labels, with joined to when , has length greater than . The regular points are the points of .✦
A Cartesian block with parameter is a finite set of labels with a bijection onto , for positive side lengths and , both at least .✦ A two-block partition of a finite set of labels is a pair of Cartesian blocks, block and block , whose label sets are disjoint with union .✦ For a two-block partition of is fixed at every regular point .✦ A block index is a pair of a regular point and ✦, and the block at , with side lengths , and coordinates , is block of the partition at ✦.
The Presentation and Its Lift
Block presentation data with parameter consist of a Cartesian block for each index of a set , a base block and a base index with .✦ The complex of block presentation data with parameter has vertices , , ; middle edges from to , for every label and ✦; left edges from to , for , and ✦; and right edges from to , for , and ✦. The group presented by block presentation data with parameter is (2)✦ with one triangle relator for each , label of the block at and , the indices and taken modulo and . The last two relators are the left and right tree edges.
The fixed presentation of marked line data, for , is the block presentation data on the block indices, each carrying its block, with base block at a chosen regular point and base index ; from here on is its group.✦ The edge generators are the images in of the edges of ✦, is the Cayley graph of with respect to them✦, and the word metric is the graph metric of ✦.
An oriented edge of is an edge with one of two orientations: forward, standing for its generator, or backward, standing for the inverse.✦ The reversal of an oriented edge is the same edge with the other orientation.✦ The image of is the edge generator if is forward and its inverse if is backward.✦ The end of is the vertex where it ends: or for , or for , or for , forward or backward.✦ The triangle faces of are the triples of oriented edges read around a triangle: a triangle relator of (2) read from , from or from , and its inverse read from , from or from .✦
The lifted complex has as vertices the pairs of a vertex of and an element ✦, and as oriented edges the pairs of an oriented edge of and an element of ✦, with reversal and end (3) Three oriented edges , , of form a lifted triangle face when their oriented edges in form a triangle face in this order and , and .✦
Thin Triangles and Clipped Cochains
A discrete metric on a set is a function with , and ✦; the graph metric of a connected graph, its path distance, is one✦. A path of length from to in is a sequence of points with (4)✦ The points of are ; is closed when and geodesic when ✦. A discrete metric space is geodesic when any two points of are joined by a geodesic path.✦
A walk in a graph is geodesic when its length is the distance between its ends.✦ Let , , be the sides of a triangle, three walks in a graph or three paths in a discrete metric space, each joining two of three points, and let . The side is -thin when (5) and the triangle is -thin when each side is -thin with respect to the other two. A group is word-hyperbolic when it has a finite subset whose Cayley graph is connected and a natural number such that every triangle of geodesic walks in that Cayley graph, from to , from to and from to , is -thin.✦
For a function on pairs of points with integer values, the integral of along a path of length is .✦ For points , of and , the tent function and the clipped distance form are (6) A discrete metric space satisfies the linear cochain bound with constant when, for all and , every closed path of length in satisfies (7) On , for and , the lifted clipped form of an oriented edge is the clipped distance form of from the group element where it begins to the one where it ends: (8)✦
Fillings and Angled Disks
Let a set of labels be given, with a reversal of the labels, an end vertex for each label , so that begins at , and a set of triangle faces, which are triples of labels. In the labels are its oriented edges, with the reversal and end of (3) and the lifted triangle faces. A word of labels is a word path from to when begins at , each begins where ends and ends at ; the empty word is a word path from to itself, and a word path is closed when .✦
Two permutations and of a finite set form a planar map when (9)✦ where counts the cycles of a permutation, fixed points included, and counts the components, the orbits of the group generated by and . The elements of are called darts; with pairing darts into edges, running around the faces and around the vertices, (9) is Euler’s formula for the sphere on each component.
A triangle filling of a word consists of a finite set of darts, a label for each dart , a fixed-point-free involution and a face permutation of that form a planar map, and a boundary , a possibly empty sequence of distinct darts with cyclically, such that, for every dart , (10)✦ and such that every dart off in the component of a boundary dart lies on a cycle of of length three whose labels form a triangle face. A word of labels is fillable when it has a triangle filling.✦ A dart is active when it lies in the component of a boundary dart✦, and is the number of active darts✦.
A cancelling dipole of is a family of six distinct darts off , the corners of two triangles, on which acts as the permutation of the indices, with , active, , , and .✦
Angle disk counts consist of a finite set of vertices, a number of edges, a number of faces, and at each vertex a number of boundary visits, counted with multiplicity, and a real angle in units of , in which is . They satisfy the Euler relation, the exterior count and the angle sum (11) and their boundary length is ✦.
The Claim
Theorem 1. Let marked line data be given for a prime and a natural number , let be the group of their fixed presentation, with word metric , and let be its lifted complex.
Then (12)✦
For all , and every closed path of length in , (13)✦
For all , and every closed word path in , (14)✦
Every fillable word in has a triangle filling with (15)✦
Every triangle filling of a word in without a cancelling dipole has (16)✦
In a geodesic discrete metric space satisfying the linear cochain bound (7) with constant , every triangle of geodesic paths, from to , from to and from to , is -thin for (17)✦
Angle disk counts in which every vertex with has satisfy (18)✦
In the paper, the result reads: the group is word-hyperbolic.
What Is Checked
The claim is stated over marked line data for a prime and , with the group of their fixed presentation (2) and its word metric ; over closed word paths and triangle fillings in the lifted complex ; over geodesic discrete metric spaces with the linear cochain bound (7); and over angle disk counts (11).
About these constructions the library proves that marked line data have a regular point✦ and that the Cayley graph of with respect to the edge generators is connected✦.