The Setting
Fix a prime and let . The group of this item is built from a finite family of lines in , each with a marked point on it. At every point outside a finite exceptional set , the labels of the lines through , away from their marked points, are arranged in two rectangular grids whose sides are at least a fixed integer . Each label in a grid, with each pair of indices , gives a triangle of a combinatorial -complex with three vertices , and . The group is presented on the edges of and compared with the fundamental group of at .
Cartesian Blocks
A Cartesian block with parameter is a finite set of labels together with positive integers and a bijection (1)✦ The pair gives the coordinates of the label .
A two-block partition of a finite set of labels, with parameter , is a pair of Cartesian blocks with parameter , block and block , whose sets of labels are disjoint and cover : (2)✦
Marked Lines
Marked line data, for the prime and an integer , consist of a set of scalars; a finite set of labels, each label carrying a mark and a direction , the class of a nonzero vector in the projective space of , with distinct labels carrying distinct marks; and a finite set of exceptional points. A point is incident to a label when it lies on the punctured line , where is the line through in the direction ✦, and is the set of labels incident to : (3)✦
Marked line data satisfy the degree condition and the budget, (4)✦ and the girth condition: every cycle in the bipartite incidence graph, whose vertices are the points of and the labels, with adjacent to when is incident to , has length greater than .
A point of outside is regular.✦ For and a regular point , the chosen partition of is a two-block partition of with parameter , fixed once for each and written (5)✦
A block index is a pair of a regular point and , and the block at is block of the chosen partition at , with its coordinates , and side lengths , : (6)✦
The Complex and Its Group
Block presentation data with parameter , over a set of labels and a set of block indices, consist of a Cartesian block with parameter for each , a base block and a base index with .✦
The complex of block presentation data with parameter has three vertices , and and the oriented edges (7) the middle, left and right edges, for , , , and .
For , a label and indices , the triangle word is the element (8)✦ of the free group on the edges of , with taken modulo and modulo . Read from , it is the boundary of a triangle of with sides , and , and has one such triangle for each .
The presented group of block presentation data has one generator for each edge of ✦; its relators are the triangle words and the two tree edges and , which join to and to and form a spanning tree of the -skeleton: $$G = \bigl\langle\, \text{the edges of } K \;\mathrel{\big|}\; \text{the words } \eqref{eq:claim6},\ L_{b_0,u_0,0},\ R_{b_0,u_0,0} \,\bigr\rangle.$$(9)✦
The fundamental groupoid of is the free groupoid on its -skeleton, the directed graph with vertices , , and edges (7), modulo the relations that identify, for each triangle, the path along followed by with the path along .✦ The fundamental group is the group of loops at in this groupoid, with concatenation as product.✦
Write and for the paths along the tree edges and . The homomorphism sends each edge to a loop at through the tree: (10)✦
The fixed presentation of marked line data with is the block presentation data over its labels with block indices, blocks, base block and base index $$B = (P \setminus E) \times \{0, 1\}, \qquad b \mapsto I_b \text{ as in } \eqref{eq:claim5}, \qquad b_0 = (z_0, 0), \qquad u_0 = 0,$$(11)✦ where is a regular point fixed once.
The Claim
Theorem 1. Let .
Every integer can be written as (12)✦ with integers and .
Every finite set of labels with is the disjoint union (13)✦ of two Cartesian blocks and with parameter .
For block presentation data with parameter , the homomorphism of (10) is injective: (14)✦
In the paper, the result reads: for , the set is split into two blocks with , and a bijection , the complex has vertices , , , edges , and , and a triangle with sides , and and angles , , at , , in units of , and .
What Is Checked
The theorem is stated over Cartesian blocks with parameter and over arbitrary block presentation data, with their complex , presented group (9), fundamental group and homomorphism (10); the fixed presentation (11) of marked line data, built from the chosen partitions (5), is such data.
The library also proves that marked line data always have a regular point✦, and that the assignment (10) sends every relator of , each triangle word and each tree edge, to the trivial loop at .