The Setting
The construction is a triangle complex with three vertices , and , built from points and punctured lines in a vector space of dimension over a finite field, and the group it presents. Each corner of a triangle of carries an angle, a multiple of , and the three angles of a triangle sum to . Angles are written as integers in units of , so is and is .
The link of a vertex of is the graph of the ends of edges at that vertex, two ends joined when they bound a corner of a triangle, and a walk in a link has an angle, the sum of the angles of its edges. The question is how small that angle can be on a closed walk without backtracking, and how few edges a walk at or at can take between two distinct -directions of one label, that is, between the ends of two distinct edges from to carrying the same label, a label being the name of a line in the vector space.
Walks in Graphs
Graphs here are simple. A walk of length in a graph is a sequence of vertices , each adjacent to the next, written ; it is closed when . A path is a walk whose vertices are distinct, and a cycle is a closed walk of positive length that repeats no edge and meets no vertex twice except at its ends. The girth of a graph is the least length of a cycle in it, infinite when there is none. A walk is reduced when no step immediately reverses the previous one: (1)✦ with no condition at the closing seam of a closed walk.
The bipartite graph of a relation between two sets has their disjoint union as vertices, an element of the first set and an element of the second adjacent when they are related, and no other edges.✦ A morphism of graphs is a map on vertices that sends adjacent vertices to adjacent vertices; it is locally injective when two neighbours of one vertex of with the same image are equal.✦
Lines and Blocks
Let be a prime, a positive integer and . A label names a line in : it carries a mark and a projective direction represented by a vector , and its line is the set of points with . A point is incident to when it lies on the punctured line .✦ Given a set of labels and a point , is the set of labels in it that are incident to , and the incidence graph is the bipartite graph of the relation between the points of and the labels.
Marked line data for and consist of a set with elements, a finite set of labels with distinct marks in and with projective directions, and a finite set of exceptional points, such that (2)✦ A point of outside is regular.✦
A Cartesian block with parameter is a finite set of labels with a bijection from onto , for positive integers .✦ A two-block partition of a set of labels is a pair of Cartesian blocks, block and block , whose label sets are disjoint with union .✦ The data fix a two-block partition of at every regular point .✦ A block index is a pair of a regular point and ✦, and the block at is block of the partition at , with label set , sides and , and coordinates .✦
The Complex and Its Links
The complex has three kinds of edges: from to , for a label and indices ✦; from to , for a block index , an index and ✦; and from to , for an index and .✦ A triangle of has one edge of each of the three kinds, with angle at and at and at , and its word is . The group is presented by one generator for each edge, with relators the triangle words and the two spanning-tree edges and picked out by the base block, block at a chosen regular point, and the base index .
An oriented edge of is an edge of traversed in one of its two directions, from its start to its end; it stands for the generator of the edge, or for its inverse when traversed backwards✦, and its reverse is the same edge traversed the other way.✦
A shift scheme over a set of labels, a set of points with a map to finite sets of labels, and an integer is a family of blocks , each with a size , a finite set of labels, a coordinate for each and a point , such that and two blocks at the same point that share a label are equal.✦ Its -directions are the triples of a label and two indices below ✦, and its -directions the triples of a block, an index below and .✦ The link is the bipartite graph of the relation (3)✦ between -directions and -directions, and the projection of is the morphism from to the bipartite graph of the relation with and .✦
The shift scheme at has the block indices as blocks, over the labels and the points of with : the block has size , labels , coordinates and point .✦ The shift scheme at is the same with and in place of and .✦ Their links are , with vertices and , and , with vertices and .
The directions at are the edges and themselves✦, and is the complete bipartite graph between the edges and the edges . The link of all directions is the disjoint union of , and .✦ The weight of a vertex of is the angle of a corner at the vertex of whose link contains : in and in and . The direction of an oriented edge is the vertex of at which arrives: arrives at and its reverse at , at and at , and the reverses of and at themselves, as directions at .✦
The Claim
Theorem 1. Let be a prime and a positive integer, and fix marked line data for and . Every reduced closed walk of positive length at a vertex of has angle (4)✦ The links at and at satisfy (5)✦ (6)✦ Let be a label and two pairs of indices. A path in , or in , between the -directions of at and at has length (7)✦ (8)✦ and a reduced walk in between them has length (9)✦ (10)✦ If is or its reverse and is or its reverse, with ending where begins, every reduced walk in from to has angle (11)✦ For every shift scheme , any two neighbours and of one vertex of satisfy (12)✦ Let be a locally injective morphism of graphs and a natural number with . If are vertices of with , every reduced walk in has length (13)✦
In the paper, the result reads: satisfies Theorem 2.1 with , and at either or the link distance between distinct -directions with the same label is at least , or is infinite.
In units of , the bound in (4) is , and edges at or at measure .
What Is Checked
The claim is stated over marked line data for a prime and a positive integer , subject to (2): over the complex and its oriented edges, the shift schemes at and at with their links, the link with the weights and the directions , and reduced walks, paths and cycles in these graphs.
The library proves that the data have a regular point, which carries the base block.✦ It proves that the labels of the block at lie in ✦ and that the two blocks at a regular point share no label✦: the two conditions a shift scheme asks of its blocks, for the schemes at and at .