The Setting
Let be a prime and put . From a family of lines in , each with a marked point, one builds a triangle complex with three vertices , , and a group presented by its edges and triangles. Measured in units of , a corner of a triangle has angle at and at and at , so every triangle has angle sum , or .
The question is whether has torsion: is there an element with for some ? The library answers it together with four statements on diagrams and chains, and these notes give all five with the definitions they are built on.
Marked Line Data
Marked line data for and an integer consist of a set of scalars, a finite set of labels and a finite set of exceptional points, each label carrying a mark and a projective direction in , with distinct marks for distinct labels, subject to three conditions.β¦ A point of is incident to the label when it lies on the line through in direction and differs from , (1)β¦ and is the set of labels incident to .β¦ The three conditions are a degree bound, a budget and a girth bound: (2) where is the bipartite incidence graph on the points of and the labels, a point being adjacent to a label when . A point of is regular when it lies outside .β¦
A Cartesian block with parameter is a finite set of labels with a bijection onto , for positive side lengths .β¦ 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 , every regular point carries a fixed two-block partition of .β¦ A block index is a pair of a regular point and β¦, and the block at is block of the partition at , with side lengths , and coordinates , .β¦
The Complex and Its Group
Block presentation data over a set of labels and a set of block indices assign a Cartesian block with parameter to each and fix a base block and a base index with .β¦ For , the fixed presentation of is the block presentation data over its labels and block indices, each index carrying its block, with base block at a chosen regular point and base index .β¦
The complex of block presentation data has the vertices , , β¦ and the edges (3)β¦ for , , , and . For a block index , a label of its block and indices , , the triangle word is the element (4)β¦ of the free group on the edges, its indices taken modulo and . The group is the group generated by the edges of subject to all triangle words (4) and to the two tree edges and .β¦
An oriented edge of is an edge traversed forward, standing for its generator, or backward, standing for its inverse.β¦ The reversal of an oriented edge of is the same edge traversed the other way.β¦ The end of is the head of its arrow in (3) when is traversed forward and its tail when is traversed backward.β¦ The value of is the image of the generator when is traversed forward and of its inverse when is traversed backward.β¦ A triangle face of is a triple of oriented edges read cyclically around a triangle word (4) or its inverse, from any of its three letters.β¦ A positive face is a triangle face whose three edges end at , and in turn.β¦
The Lifted Complex and Its Diagrams
The lifted complex has as vertices the pairs of a vertex of and an element of β¦, and as edges the pairs of an oriented edge of and an element of β¦. A lifted edge has an end and a reversal, (5) and begins where its reversal ends. Three lifted edges form a lifted triangle when their oriented edges, in order, form a triangle face of and each begins where the one before it ends, cyclically.β¦ For vertices and of , a path from to in is a word of lifted edges whose first edge begins at , each further edge beginning where the one before ends and the last ending at ; the empty word is a path from to itself, and a closed path at is one from to .β¦
Diagrams are made of darts. A dart map is a finite set of darts with an involution of without fixed points, pairing the darts into edges, and a permutation of ; its faces are the cycles of , its vertices are the cycles of , and the degree of a vertex is its number of darts. A dart map is planar when (6)β¦ with the number of cycles of a permutation , fixed points included, and the number of orbits of the group generated by and . This is Eulerβs formula on every component, each of which has genus zero.
A labelling system consists of a set of labels, a reversal on it, an end map from it to a set of colours, and a set of triples of labels, the triangles. Over the labels are the lifted edges with the end and reversal (5), the colours are the vertices of , and the triangles are the lifted triangles. A labelled dart map is a planar dart map with a labelling of its darts such that for every dart and is constant on each vertex. The colour of a vertex is the common end of the labels of its darts.
A triangulated sphere is a labelled dart map in which every dart lies on a face of length three whose labels , , form a triangle.β¦ A triangulated sphere may have several components, and is empty when it has no darts. A dipole in a triangulated sphere is a pair of cycles and of on six distinct darts that share the edge and satisfy (7)β¦
When the colours are three, numbered , , , the angle of a vertex of a triangulated sphere is (8)β¦
A filling of a word of labels is a labelled dart map with a boundary , a list of distinct darts that runs once around a cycle of in order, or is empty, and whose labels spell , such that every dart off the boundary lies either on a face of length three whose labels form a triangle, or on a face of length two made of the two darts of one edge.β¦ A filling is triangular when every dart off its boundary lies on a face of length three.β¦
Chains
For a set and a group , the free chain module is the free abelian group on .β¦ An element of acts by translation on the basis elements of , with and β¦, and the augmentation sums the coefficients of a chain β¦. A finite subgroup of has the norm , the sum of the translations by its elements: (9)β¦
The 2-chain module of the presentation is , with the set of positive faces.β¦ For lifted edges , , , the bracket is the basis element of when is a positive face, and otherwise.β¦ The face chain of a filling over is (10)β¦
The Claim
Two of the statements hold for any labels and any group.
Theorem 1. Let labels be given with a reversal, an end map to three colours numbered , , and a set of triangles, the three labels of every triangle ending at three different colours. For a triangulated sphere over them, with the angles (8), if for every vertex , then (11)β¦ an angle of being .
Theorem 2. Let be a group, a finite cyclic subgroup of generated by , and for sets , , . Let and be homomorphisms commuting with the translations by the elements of , with and . For chains , and with , , and , one has (12)β¦
Theorem 3. Let be marked line data for a prime and an integer , the group of its fixed presentation and the lifted complex. Every triangulated sphere over that has no dipole is empty: (13)β¦ If is a closed path at a vertex of and , are triangular fillings of over , then (14)β¦ The group is torsion-free: (15)β¦ Every element of of finite order satisfies (16)β¦
In the paper, the result reads: the group is torsion-free, with standing for .
What Is Checked
The claims are stated over marked line data with , the group of its fixed presentation, and triangulated spheres, dipoles, triangular fillings of closed paths and face chains over the lifted complex ; the two general ones are stated over triangulated spheres with three colours and over free chain modules of a group with a finite cyclic subgroup.
About these constructions the library proves two facts beyond the claims: marked line data have a regular point, which gives the base block β¦, and a function on a set that is invariant under a permutation is constant on each cycle of the permutation.β¦