The Setting
The group of the construction has a presentation read off a triangle complex with three vertices , , : a generator for each edge, a relator of length three for each triangle, and two relators killing the edges of a spanning tree. The edges of are indexed by labels arranged in blocks, and the definitions below give as combinatorial data: its vertices, oriented edges and triangles, the angles at the corners of a triangle, the walks without backtracking, and the link graph on the directions of edges at the vertices. Angles are integers in units of , so a straight angle is and a full turn is .
Cartesian Blocks and the Edges of
Fix a set of labels and an integer , and write . A Cartesian block of width with labels in is a finite set together with positive integers and a bijection from onto .✦ A block presentation of width with labels in , indexed by a set , consists of a Cartesian block of width with labels in for every , a base block and a base index .✦
The complex of a block presentation has middle edges , left edges and right edges , forming the sets (1) and its edge set is the disjoint union .✦
Marked Lines and Their Blocks
Let be a prime and . The line through a point in a projective direction is the image of the map from to , for a fixed representative of . A point is incident to when it lies on the punctured line .✦
For a point , let be the set of labels such that is incident to , and say that is incident to the labels in . Marked line data over of width consist of a set with elements, a finite set of labels, for each label a mark and a projective direction , distinct labels having distinct marks, and a finite set of exceptional points, such that every point outside is incident to at least labels, the inequality (2)✦ holds, and every cycle in the incidence graph of points and labels, the bipartite graph on joining to when , has length greater than .
A point of is regular when it is not exceptional.✦ A two-block partition of width of a finite set is a pair of Cartesian blocks of width with labels in whose label sets are disjoint with union .✦ For , fix for every regular point a two-block partition of of width , its blocks numbered and ✦. The presentation of marked line data of width with the fixed two-block partitions is the block presentation of width with labels in , indexed by the pairs with a regular point and , whose block at is the block numbered of the partition fixed at , with base block for a fixed regular point and base index .✦
Shift Schemes and Directions
The bipartite graph of a relation is the graph on the disjoint union that joins to when ; for it is the complete bipartite graph.✦
Let be a set of points, each with a finite set of labels incident to it. A shift scheme of width over , indexed by a set , assigns to each an integer , a finite set of labels, coordinates and a point , such that for every , and whenever and .✦ The -directions of the scheme are the triples ✦, its -directions the triples with , and ✦, and an -direction is attached to an -direction when (3)✦ The link of the scheme is the bipartite graph of the relation (3).✦
For marked line data of width , the shift scheme at is the scheme of width over , with the sets , indexed by the pairs , that assigns to the block at the size , the labels , the coordinates and the point ✦; the shift scheme at assigns and in place of and .✦ Write and for their links and , for their -directions. The -directions at are the triples indexing the left edges of the presentation, those at the triples indexing its right edges, and the directions at the three vertices of its complex are (4) with the set of all directions.✦
The Definition
Definition 1. Let be the complex of a block presentation of width with labels in , indexed by . The vertex set of is (5)✦ An oriented edge of is an edge of (1) with a sign, (6)✦ and its reversal is (7)✦ Writing for and for , the target of an oriented edge is the vertex (8)✦ A triangle face of is a triple of oriented edges read around a triangle with boundary word , from any corner and in either direction: for some block , label and , one of (9)✦ A walk in a graph is reduced when (10)✦ with no condition relating and when the walk is closed. The angle of a triangle at its corner , corner being the one at and corners , those at and , is (11)✦ For marked line data of width and the complex of their presentation, the link of is the graph on the directions (4) (12)✦ and the direction that an oriented edge defines at its target is (13)✦
In the paper, the result reads: a triangle complex is a finite graph with Euclidean triangles glued along full sides, the angular link at a vertex has a vertex for each edge germ at it and an edge, of length the corner angle, for each triangle corner at it, and a walk is reduced if it has no immediate reversal, cyclically reduced if it has none across the closing seam either.
What Is Checked
The vertex set, oriented edges, reversal, target and triangle faces (5) to (9) are stated over a block presentation of width with labels in a set , indexed by a set ; reduced walks (10) over walks in an arbitrary graph; the link (12) and the direction (13) over marked line data over of width , through their presentation and the shift schemes at and . The corner angles (11) are stated over the three corners of a triangle of .
The library proves that marked line data have a regular point✦ and, for , that every label of the block at is incident to ✦ and that two blocks at the same regular point with a common label are the same block.✦