The Setting
The group of the construction is presented by the edges of a complex of triangles with three vertices , and . Its middle edges run from to , one for each label of a set of labels and each pair of indices , where is the parameter of the construction, so the middle edges of one label form an array. Two rows and two columns of the array span the rectangle loop , a closed edge path at through , and , and its product in is a rectangular word. The question is whether a rectangular word can be trivial in , and how sharply a rectangle loop turns at its corners, measured in the links of and .
The library builds and from block presentation data, which describe them for any family of Cartesian blocks of labels, and specializes them to marked line data, where, for a prime , the labels are punctured lines in and the blocks sit at points where the lines meet.
The Complex and Its Group
A Cartesian block of labels from a set , with parameter , is a finite set of labels together with a bijection onto , where and are positive integers with and .✦ Block presentation data over labels in with indices below consist of a set of block indices, a Cartesian block of labels for each , with sides , and coordinates , a base block and a base index .✦
The complex of these data has three vertices , , and three kinds of edges: the middle edges from to , for and ✦; the left edges from to , for , and ✦; and the right edges from to , for , and ✦. An oriented edge is an edge taken in its own direction, written , or backwards, written ✦; reversal exchanges the two✦, and the target of an oriented edge is the vertex where it ends✦.
For a block , a label of its Cartesian block and indices , the triangle relator word is the element (1)✦ of the free group on the edges, with taken modulo and modulo . A triangle face of is a triple of oriented edges read around one triangle: the word (1) read cyclically from any of its three letters, or its inverse read cyclically from any of its letters.
The presented group is the group with one generator for each edge of , subject to the triangle relator words (1) and the two tree edges and as relators.✦ The edge generator of an edge is its image in , written with the edge’s own symbol✦: the middle generators ✦, the left generators ✦ and the right generators ✦.
Lines Over a Finite Field
For a field and an index set , the affine line through a point of in the direction of a vector is the map on , with value at .✦ A point of a vector space over lies on the line through in a projective direction when for some , with a representative of ✦; it is incident to and in the punctured sense when moreover .✦ Over a finite field, the punctured line of the line through in direction is the finite set of points incident to and .✦ For a finite family of lines through points and a point , the lines through are the indices with .✦
The bipartite graph of a relation between two sets and has vertex set , an edge between and exactly when they are related, and no edge inside or inside .✦
Fix a prime and an integer , and put . Marked line data consist of a set of size ; a finite set of labels, each label carrying a mark , with distinct marks for distinct labels, and a projective direction of ; and a finite set of exceptional points.✦ Write for the line through in direction and for the set of lines incident at . The incidence graph of marked line data is the bipartite graph of punctured incidence between the points of and the labels. The data satisfy the degree condition, the budget and the girth condition: (2)✦
A regular point is a point of outside .✦ 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 .✦ A two-block partition of is chosen at every regular point ✦; a block index is a pair of a regular point and ✦, and the block at is block of the partition chosen at ✦. For , the fixed presentation of marked line data is the block presentation data over the labels whose blocks are indexed by the block indices, each carrying its block, with base block at a chosen regular point and base index .✦ For marked line data, , and are those of the fixed presentation.
Links and Angles
A shift scheme for labels in , over a set of points with incidence sets and with parameter , is a family of blocks indexed by a set , each block having a size , a finite set of labels, each label with a coordinate , and a point , such that every label of lies in and two blocks at the same point that share a label are equal.✦ The -directions of a shift scheme are the triples with and ✦, and the -directions of a shift scheme are the triples with , and .✦ An -direction is attached to an -direction when (3)✦ and the link of the scheme is the bipartite graph of this relation.✦
For marked line data with , the shift scheme at has the block indices as blocks, the block having size , the labels of the block at with coordinates , and point ✦; the shift scheme at is the same with and in place of and ✦.
The directions at a vertex of are the ends of the edges there: at , the left and the right edges✦; at , the -directions and the -directions of the scheme at ✦; at , those of the scheme at ✦. The link of all directions is the disjoint union of three graphs: at the complete bipartite graph between left and right edges, at and at the links of the two shift schemes.✦ The direction of an oriented edge is its end at its target: and give themselves at , gives at and gives at , while gives at and gives at .✦
Angles are measured in units of , so that is . Each direction carries the angle of a triangle corner at its vertex: at and at and , so the angles of a triangle sum to .✦
A walk in a graph is reduced when no step immediately reverses the previous one: the vertices of at positions and differ whenever is at most the length of .✦
Triangular Fillings
For permutations and of a finite set , write for the number of cycles of , fixed points included✦, and for the number of components, the classes of the equivalence relation on generated by lying in a common cycle of or of .✦ The pair is a planar map when (4)✦ when is an involution on the set of edges of the map and is the permutation around its faces, the equation (4) is an Euler count saying that every component has genus zero.
A triangular filling of a word of oriented edges of is a finite set of darts with a fixed-point-free involution , a permutation forming a planar map with , a labelling of the darts by oriented edges of and a boundary, a list of distinct darts , such that for every dart we have and the edge starts where ends, acts on the boundary as the cycle with , and every other dart in a component that meets the boundary lies in a cycle of of length three whose labels, read along , form a triangle face of .✦ A word is fillable when it has a triangular filling.✦
The Claim
Definition 1. A family of elements of a group , indexed by pairs from a set , has surviving rectangles when (5)✦
Theorem 1. Let block presentation data be given, with complex and presented group . For every block , every label of its Cartesian block and all indices , the triangle relation holds: (6)✦ For every label and all indices with in , the word is fillable: it has a triangular filling whose boundary darts carry (7)✦
Let marked line data with be given. They have rectangular nontriviality: in the group of the fixed presentation, the middle generators of every label have surviving rectangles, (8)✦ For a label , indices and , and two oriented edges and of the rectangle loop of , , , , such that starts where ends, every reduced walk in the link of all directions from to , of length , satisfies (9)✦
In the paper, the result reads: with the based loop of an oriented edge , the triangles give , and the rectangular words with and are different from , where , and stand for the page’s , and .
What Is Checked
The claim is stated over block presentation data, with the complex , its oriented edges and triangle faces, the presented group and triangular fillings of words; and over marked line data with , with the fixed presentation, the shift schemes at and , the link of all directions with its angles, and reduced walks.
Beyond the claim, the library shows that marked line data have a regular point✦, and that the shift schemes at and meet the two conditions of a shift scheme: the labels of the block at lie in ✦, and two blocks at the same regular point that share a label are equal✦.