OctoInformBeta

OpenAI preprint, September 2026 ยท ยง2. The construction and the rank obstruction

Theorem 2.1: With KK built from marked line data and r>0r > 0; every labelled triangle filling has a short link walk; rectangular words are nontrivial

The group of the constructed complex is torsion-free and hyperbolic.

Hover over a blue or green term in the text, or a node in the graph, to find it in the other. Select it to read its declaration both in Lean and in words.

The Setting

The complex in question is a triangle complex KK with three vertices OO, VV and WW, built from punctured lines in ๐”ฝq20\mathbb{F}_q^{20} for a prime qq; each of its triangles has one corner at each vertex. Angles are measured in units of ฯ€/5\pi/5: a triangle has angle 33 at OO and 11 at VV and at WW, so its angles sum to 55, ฯ€\pi is 55 and 2ฯ€2\pi is 1010. The edges of KK from VV to WW come in rร—rr \times r arrays xiuvx_{iuv}, one for each of finitely many labels ii of the marked line data defined below, with 0โ‰คu,v<r0 \le u, v < r for a positive integer rr. A rectangular word of ii is the product xiuvxiuโ€ฒvโˆ’1xiuโ€ฒvโ€ฒxiuvโ€ฒโˆ’1x_{iuv}\, x_{iu'v}^{-1}\, x_{iu'v'}\, x_{iuv'}^{-1} of four of them, at the corners of a rectangle of indices, with uโ‰ uโ€ฒu \ne u' and vโ‰ vโ€ฒv \ne v'. With GG the group of KK, presented by its edges and triangles, the questions are whether GG is torsion-free and word hyperbolic, and whether its rectangular words are nontrivial.

The angles are read on triangle fillings, defined below: diagrams made of triangles, in the manner of van Kampen diagrams, whose corners are labelled by vertices of a graph ฮ›\Lambda, thought of as a link graph. A walk pp of length nn in ฮ›\Lambda, read at a corner of angle ww, has angular length wnwn; this is compared with 1010 for closed walks and with 55 for walks that run along the boundary.

Marked Line Data

Fix a prime qq and a natural number rr, and put P=๐”ฝq20P = \mathbb{F}_q^{20}. For a point aa of PP and a projective direction [v][v] in the projective space of PP, the line โ„“\ell through aa in direction [v][v] is the image of the affine parametrization xโ†ฆa+xvx \mapsto a + xv of ๐”ฝq\mathbb{F}_q, which takes the value aa at x=0x = 0. A point zz of PP is incident to aa and [v][v] when it lies on the punctured line โ„“\{a}={a+xv:xโˆˆ๐”ฝq}\{a}.\ell \setminus \{a\} = \{\, a + xv : x \in \mathbb{F}_q \,\} \setminus \{a\}.(1)โœฆ

Marked line data dd for qq and rr consist of a set SโŠ‚๐”ฝqS \subset \mathbb{F}_q of size โŒŠq/100โŒ‹\lfloor q/100 \rfloor; a finite set โ„\mathcal{I} of NN labels, each label ii carrying a mark aiโˆˆS20a_i \in S^{20} and a projective direction [vi][v_i], with distinct labels having distinct marks; and a finite set EโŠ‚PE \subset P of exceptional points.โœฆ Write โ„“i\ell_i for the line through aia_i in direction [vi][v_i], and I(z)I(z) for the set of labels whose punctured lines pass through a point zz. The data satisfy the degree and budget conditions |I(z)|โ‰ฅ4r2(zโˆˆP\E),4(2q20+r|E|)<rN,|I(z)| \ge 4r^2 \quad (z \in P \setminus E), \qquad 4\,(2q^{20} + r\,|E|) < rN,(2) and the girth condition: every cycle in the bipartite incidence graph, whose vertices are the points of PP and the labels, with each point zz adjacent to the labels in I(z)I(z), has length greater than 1212. The points of P\EP \setminus E are the regular points.โœฆ

A Cartesian block CC with parameter rr is a finite set of labels together with positive integers s,tโ‰ฅrs, t \ge r and a bijection iโ†ฆ(ฮฑ(i),ฮฒ(i))i \mapsto (\alpha(i), \beta(i)) from CC onto โ„ค/sร—โ„ค/t\mathbb{Z}/s \times \mathbb{Z}/t.โœฆ A two-block partition of a finite set AA of labels is a pair of Cartesian blocks with parameter rr, block 00 and block 11, whose label sets are disjoint with union AA.โœฆ For r>0r > 0, every regular point zz carries a chosen two-block partition of I(z)I(z).โœฆ A block index of dd is a pair b=(z,ฯต)b = (z, \epsilon) of a regular point zz and ฯตโˆˆ{0,1}\epsilon \in \{0, 1\}โœฆ; its block CbC_b is block ฯต\epsilon of the partition chosen at zz, with sides sbs_b, tbt_b and coordinates iโ†ฆ(ฮฑb(i),ฮฒb(i))i \mapsto (\alpha_b(i), \beta_b(i))โœฆ.

The Complex and Its Group

Block presentation data with labels in โ„\mathcal{I} and parameter rr consist of a set BB of block indices, a Cartesian block CbC_b with parameter rr for each bโˆˆBb \in B, a base block b0โˆˆBb_0 \in B and a base index u0u_0 with 0โ‰คu0<r0 \le u_0 < r.โœฆ Such data define a triangle complex KK on the vertices OO, VV and WW. Its edges are the middle edges xiuvx_{iuv} from VV to WW, for iโˆˆโ„i \in \mathcal{I} and 0โ‰คu,v<r0 \le u, v < rโœฆ; the left edges Lb,u,jL_{b,u,j} from OO to VV, for bโˆˆBb \in B, 0โ‰คu<r0 \le u < r and jโˆˆโ„ค/sbj \in \mathbb{Z}/s_bโœฆ; and the right edges Rb,v,kR_{b,v,k} from OO to WW, for bโˆˆBb \in B, 0โ‰คv<r0 \le v < r and kโˆˆโ„ค/tbk \in \mathbb{Z}/t_bโœฆ. Its triangles, one for each block bb, label iโˆˆCbi \in C_b and pair of indices 0โ‰คu,v<r0 \le u, v < r, have the boundary words Lb,u,ฮฑb(i)+vxiuvRb,v,ฮฒb(i)+uโˆ’1,L_{b,u,\alpha_b(i)+v}\; x_{iuv}\; R_{b,v,\beta_b(i)+u}^{-1},(3)โœฆ with the indices of LL and RR taken modulo sbs_b and tbt_b.

The group GG of the data is presented by one generator for each edge of KK, with relators the triangle words (3) and the two spanning-tree edges Lb0,u0,0L_{b_0,u_0,0} and Rb0,u0,0R_{b_0,u_0,0}.โœฆ Each edge, xiuvx_{iuv} among them, also denotes its generator in GG.โœฆ

The fixed presentation of marked line data dd, for r>0r > 0, is the block presentation data with the labels of dd, the block indices of dd with their blocks CbC_b, the base block (z0,0)(z_0, 0) at a chosen regular point z0z_0, and the base index 00.โœฆ From here on, KK and GG are the complex and the group of this presentation.

Torsion-free and Hyperbolic Groups

A group ฮ“\Gamma is torsion-free when gn=1g^n = 1, for gโˆˆฮ“g \in \Gamma and an integer nโ‰ฅ1n \ge 1, forces g=1g = 1.โœฆ A walk in a graph is geodesic when its length equals the distance between its ends.โœฆ Given walks p1p_1 from y1y_1 to y2y_2, p2p_2 from y2y_2 to y3y_3 and p3p_3 from y3y_3 to y1y_1 in a graph XX, and a natural number ฮด\delta, the side p1p_1 is ฮด\delta-thin when dist⁡X(y,p2โˆชp3)โ‰คฮดfor every vertex y of p1.\operatorname{dist}_X(y, p_2 \cup p_3) \le \delta \quad \text{for every vertex } y \text{ of } p_1 .(4)โœฆ A group ฮ“\Gamma is word hyperbolic when it has a finite subset SS whose Cayley graph is connected and a natural number ฮด\delta such that, in every triangle of geodesic walks in that Cayley graph, each side is ฮด\delta-thin with respect to the other two.โœฆ

Triangle Fillings and Link Walks

A triangle filling ฮ”\Delta consists of a finite set DD of darts, a fixed-point-free involution ฯ\rho of DD, a permutation ฯ†\varphi of DD with one of its cycles marked as the outer face, and a coloring by 00, 11 and 22 of the cycles of ฯƒ=ฯโˆ˜ฯ†\sigma = \rho \circ \varphi.โœฆ The cycles of ฯ\rho, ฯ†\varphi and ฯƒ\sigma are the edges, faces and vertices of ฮ”\Delta, and a dart lies at the vertex that is its cycle under ฯƒ\sigma. Every face other than the outer one has exactly three darts, lying at vertices of the three colors, one each; and with n0n_0, n1n_1 and n2n_2 the numbers of vertices, edges and faces other than the outer one, n0โˆ’n1+n2=1.n_0 - n_1 + n_2 = 1 .(5)โœฆ

The darts of the outer face are the boundary darts.โœฆ The corner weight w(a)w(a) of a dart aa is the angle at its vertex: 33 when the vertex has color 00, the corner at OO, and 11 when it has color 11 or 22, at VV or WW.โœฆ

A labelling of ฮ”\Delta in a graph ฮ›\Lambda is a map ฮป\lambda from the darts of ฮ”\Delta to the vertices of ฮ›\Lambda.

A walk in a graph ฮ›\Lambda is reduced when no step immediately reverses the previous one; no condition is imposed at the closing seam of a closed walk.โœฆ

The Claim

Theorem 1. Let dd be marked line data for a prime qq and a positive integer rr, and let GG be the group of its fixed presentation. Then G is torsion-free,G \text{ is torsion-free},(6)โœฆ G is word hyperbolic,G \text{ is word hyperbolic},(7)โœฆ and for every label ii of dd and all indices uโ‰ uโ€ฒu \ne u' and vโ‰ vโ€ฒv \ne v' below rr, xiuvxiuโ€ฒvโˆ’1xiuโ€ฒvโ€ฒxiuvโ€ฒโˆ’1โ‰ 1in G.x_{iuv}\, x_{iu'v}^{-1}\, x_{iu'v'}\, x_{iuv'}^{-1} \ne 1 \quad \text{in } G.(8)โœฆ Let ฮ”\Delta be a triangle filling and ฮป\lambda a labelling of ฮ”\Delta in a graph ฮ›\Lambda. Then there are a dart aa and a reduced walk pp in ฮ›\Lambda, either closed at ฮป(a)\lambda(a) and of positive length, or running from ฮป(ฯƒ(a))\lambda(\sigma(a)) to ฮป(a)\lambda(a) with aa a boundary dart, such that, respectively, w(a)|p|<10orw(a)|p|<5.w(a)\,|p| < 10 \qquad \text{or} \qquad w(a)\,|p| < 5 .(9)โœฆ

In the paper, the result reads: for a connected finite Euclidean triangle complex in which, for some ฮท>0\eta > 0, every nonempty cyclically reduced closed edge walk in each vertex link has angular length at least 2ฯ€+ฮท2\pi + \eta, the fundamental group is torsion-free and word hyperbolic, and a nonempty closed edge path whose every cyclic turn has link distance at least ฯ€\pi is not nullhomotopic.

The library states the paperโ€™s result for the one complex KK, with the conditions on links read on triangle fillings in (9) and the conclusion on closed paths given for the rectangular words in (8).

What Is Checked

The claims (6), (7) and (8) are stated over marked line data dd for a prime qq and a positive integer rr, through the fixed presentation of dd: its block indices with the Cartesian blocks of the chosen two-block partitions, and the group GG presented by the edges of KK with the triangle words (3) and two spanning-tree edges as relators. The claim (9) is stated over any triangle filling, with its corner weights, and any labelling of its darts in a graph ฮ›\Lambda.

Besides the claim, the library proves that marked line data have a regular point.โœฆ