OctoInformBeta

OpenAI preprint, September 2026 · §4. Uniform thinness and the Cayley graph

Proposition 4.3: Angle disk counts, fillings with linearly many active darts in the lifted complex, a cochain bound in the Cayley graph, and thin triangles from such bounds

The group presented by marked line data is word-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

Take a prime qq, the space P=𝔽q20P = \mathbb{F}_q^{20} and a finite family of lines in PP, each with a marked point. At each regular point of PP, a point outside a finite exceptional set, the lines through it are split into two Cartesian blocks, each a grid of lines indexed by pairs of residues, and the blocks give a triangle complex KK with three vertices OO, VV, WW: a middle edge xiuvx_{iuv} from VV to WW for each line ii and indices uu, vv below a natural number rr, and edges LL from OO to VV and RR from OO to WW that close the middle edges into triangles. The group GG is presented by the edges of KK, with the triangles as relators and two edges of a spanning tree set to 11. The question is whether GG is word-hyperbolic: whether the geodesic triangles of a Cayley graph of GG are uniformly thin.

The library states that GG is word-hyperbolic, together with six statements about angle disk counts, fillings in a lifted complex K̃\widetilde K of KK, clipped distance forms on the Cayley graph of GG with respect to the edges, and thin triangles in discrete metric spaces.

Marked Line Data

Let qq be a prime and P=𝔽q20P = \mathbb{F}_q^{20}. The line through a point aa of PP in a projective direction with representative vector vv is the set ℓ\ell of points a+tva + tv for t∈𝔽qt \in \mathbb{F}_q✦, and a point zz of PP is incident to aa in that direction when it lies on the punctured line ℓ\{a}\ell \setminus \{a\}✦.

Marked line data for qq and a natural number rr consist of a set S⊂𝔽qS \subset \mathbb{F}_q of size ⌊q/100⌋\lfloor q/100 \rfloor; a finite set of NN labels, each label ii with a mark ai∈S20a_i \in S^{20} and a projective direction in PP, distinct labels having distinct marks; and a finite set E⊂PE \subset P of exceptional points. With ℓi\ell_i the line through aia_i in the direction of ii, and I(z)I(z) the set of labels ii with z∈ℓi\{ai}z \in \ell_i \setminus \{a_i\}, the lines through zz, the data satisfy |I(z)|≥4r2(z∈P\E),4(2q20+r|E|)<rN,|I(z)| \ge 4r^2 \quad (z \in P \setminus E), \qquad 4\,\bigl(2q^{20} + r\,|E|\bigr) < rN,(1) and every cycle in the bipartite incidence graph on the points of PP and the labels, with zz joined to ii when i∈I(z)i \in I(z), has length greater than 1212. The regular points are the points of P\EP \setminus E.✦

A Cartesian block with parameter rr is a finite set of labels with a bijection i↦(α(i),β(i))i \mapsto (\alpha(i), \beta(i)) onto ℤ/s×ℤ/t\mathbb{Z}/s \times \mathbb{Z}/t, for positive side lengths ss and tt, both at least rr.✦ A two-block partition of a finite set AA of labels is a pair of Cartesian blocks, block 00 and block 11, whose label sets are disjoint with union AA.✦ For r>0r > 0 a two-block partition of I(z)I(z) is fixed at every regular point zz.✦ A block index is a pair b=(z,η)b = (z, \eta) of a regular point zz and η∈{0,1}\eta \in \{0, 1\}✦, and the block at bb, with side lengths sbs_b, tbt_b and coordinates (αb,βb)(\alpha_b, \beta_b), is block η\eta of the partition at zz✦.

The Presentation and Its Lift

Block presentation data with parameter rr consist of a Cartesian block for each index bb of a set BB, a base block b0∈Bb_0 \in B and a base index u0u_0 with 0≤u0<r0 \le u_0 < r.✦ The complex KK of block presentation data with parameter rr has vertices OO, VV, WW; middle edges xiuvx_{iuv} from VV to WW, for every label ii and 0≤u,v<r0 \le u, v < r✦; 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 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✦. The group GG presented by block presentation data with parameter rr is G=⟨xiuv,Lb,u,j,Rb,v,k|Lb,u,αb(i)+vxiuvRb,v,βb(i)+u−1,Lb0,u0,0,Rb0,u0,0⟩,G = \bigl\langle\, x_{iuv},\ L_{b,u,j},\ R_{b,v,k} \mathrel{\big|} L_{b,u,\alpha_b(i)+v}\, x_{iuv}\, R_{b,v,\beta_b(i)+u}^{-1},\ L_{b_0,u_0,0},\ R_{b_0,u_0,0} \,\bigr\rangle,(2)✦ with one triangle relator for each b∈Bb \in B, label ii of the block at bb and 0≤u,v<r0 \le u, v < r, the indices αb(i)+v\alpha_b(i)+v and βb(i)+u\beta_b(i)+u taken modulo sbs_b and tbt_b. The last two relators are the left and right tree edges.

The fixed presentation of marked line data, for r>0r > 0, is the block presentation data on the block indices, each carrying its block, with base block (z0,0)(z_0, 0) at a chosen regular point z0z_0 and base index 00; from here on GG is its group.✦ The edge generators are the images in GG of the edges of KK✦, Γ\Gamma is the Cayley graph of GG with respect to them✦, and the word metric dGd_G is the graph metric of Γ\Gamma✦.

An oriented edge ϵ\epsilon of KK is an edge with one of two orientations: forward, standing for its generator, or backward, standing for the inverse.✦ The reversal ϵ‾\bar\epsilon of an oriented edge ϵ\epsilon is the same edge with the other orientation.✦ The image [ϵ]∈G[\epsilon] \in G of ϵ\epsilon is the edge generator if ϵ\epsilon is forward and its inverse if ϵ\epsilon is backward.✦ The end t(ϵ)t(\epsilon) of ϵ\epsilon is the vertex where it ends: WW or VV for xiuvx_{iuv}, VV or OO for Lb,u,jL_{b,u,j}, WW or OO for Rb,v,kR_{b,v,k}, forward or backward.✦ The triangle faces of KK are the triples of oriented edges read around a triangle: a triangle relator LxR−1L x R^{-1} of (2) read from LL, from xx or from R−1R^{-1}, and its inverse Rx−1L−1R x^{-1} L^{-1} read from L−1L^{-1}, from RR or from x−1x^{-1}.✦

The lifted complex K̃\widetilde K has as vertices the pairs (y,g)(y, g) of a vertex yy of KK and an element g∈Gg \in G✦, and as oriented edges the pairs (ϵ,g)(\epsilon, g) of an oriented edge of KK and an element of GG✦, with reversal and end (ϵ,g)¯=(ϵ‾,g[ϵ]−1),t(ϵ,g)=(t(ϵ),g).\overline{(\epsilon, g)} = \bigl(\bar\epsilon,\ g\,[\epsilon]^{-1}\bigr), \qquad t(\epsilon, g) = \bigl(t(\epsilon),\ g\bigr).(3) Three oriented edges e1e_1, e2e_2, e3e_3 of K̃\widetilde K form a lifted triangle face when their oriented edges in KK form a triangle face in this order and t(e‾2)=t(e1)t(\bar e_2) = t(e_1), t(e‾3)=t(e2)t(\bar e_3) = t(e_2) and t(e‾1)=t(e3)t(\bar e_1) = t(e_3).✦

Thin Triangles and Clipped Cochains

A discrete metric on a set XX is a function d:X×X→ℕd \colon X \times X \to \mathbb{N} with d(x,x)=0d(x,x) = 0, d(x,y)=d(y,x)d(x,y) = d(y,x) and d(x,z)≤d(x,y)+d(y,z)d(x,z) \le d(x,y) + d(y,z)✦; the graph metric of a connected graph, its path distance, is one✦. A path γ\gamma of length nn from aa to bb in (X,d)(X, d) is a sequence of points γ0,γ1,…\gamma_0, \gamma_1, \dots with γ0=a,γi=b(i≥n),d(γi,γi+1)≤1(i<n);\gamma_0 = a, \qquad \gamma_i = b \quad (i \ge n), \qquad d(\gamma_i, \gamma_{i+1}) \le 1 \quad (i < n);(4)✦ The points of γ\gamma are γ0,…,γn\gamma_0, \dots, \gamma_n; γ\gamma is closed when a=ba = b and geodesic when n=d(a,b)n = d(a, b)✦. A discrete metric space (X,d)(X, d) is geodesic when any two points of XX are joined by a geodesic path.✦

A walk in a graph is geodesic when its length is the distance between its ends.✦ Let σ1\sigma_1, σ2\sigma_2, σ3\sigma_3 be the sides of a triangle, three walks in a graph or three paths in a discrete metric space, each joining two of three points, and let T∈ℕT \in \mathbb{N}. The side σ1\sigma_1 is TT-thin when miny∈σ2∪σ3d(x,y)≤Tfor every point x of σ1,\min_{y \in \sigma_2 \cup \sigma_3} d(x, y) \le T \quad \text{for every point } x \text{ of } \sigma_1,(5) and the triangle is TT-thin when each side is TT-thin with respect to the other two. A group is word-hyperbolic when it has a finite subset SS whose Cayley graph is connected and a natural number δ\delta such that every triangle of geodesic walks in that Cayley graph, from g1g_1 to g2g_2, from g2g_2 to g3g_3 and from g3g_3 to g1g_1, is δ\delta-thin.✦

For a function FF on pairs of points with integer values, the integral of FF along a path γ\gamma of length nn is ∫γF=∑i<nF(γi,γi+1)\int_\gamma F = \sum_{i<n} F(\gamma_i, \gamma_{i+1}).✦ For points oo, aa of XX and T∈ℕT \in \mathbb{N}, the tent function τo,T\tau_{o,T} and the clipped distance form ωo,a,T\omega_{o,a,T} are τo,T(x)=max⁡(0,T−d(o,x)),ωo,a,T(x,y)=(τo,T(x)+τo,T(y))(d(a,y)−d(a,x)).\tau_{o,T}(x) = \max\bigl(0,\ T - d(o,x)\bigr), \qquad \omega_{o,a,T}(x,y) = \bigl(\tau_{o,T}(x) + \tau_{o,T}(y)\bigr)\bigl(d(a,y) - d(a,x)\bigr).(6) A discrete metric space (X,d)(X, d) satisfies the linear cochain bound with constant B∈ℕB \in \mathbb{N} when, for all o,a∈Xo, a \in X and T∈ℕT \in \mathbb{N}, every closed path γ\gamma of length nn in XX satisfies |∫γωo,a,T|≤Bn.\Bigl| \int_\gamma \omega_{o,a,T} \Bigr| \le B\,n.(7) On K̃\widetilde K, for o,a∈Go, a \in G and T∈ℕT \in \mathbb{N}, the lifted clipped form of an oriented edge is the clipped distance form of dGd_G from the group element where it begins to the one where it ends: λo,a,T(ϵ,g)=ωo,a,T(g[ϵ]−1,g).\lambda_{o,a,T}(\epsilon, g) = \omega_{o,a,T}\bigl(g\,[\epsilon]^{-1},\ g\bigr).(8)✦

Fillings and Angled Disks

Let a set of labels be given, with a reversal e↦e‾e \mapsto \bar e of the labels, an end vertex t(e)t(e) for each label ee, so that ee begins at t(e‾)t(\bar e), and a set of triangle faces, which are triples of labels. In K̃\widetilde K the labels are its oriented edges, with the reversal and end of (3) and the lifted triangle faces. A word e1⋯eme_1 \cdots e_m of labels is a word path from yy to y′y' when e1e_1 begins at yy, each ek+1e_{k+1} begins where eke_k ends and eme_m ends at y′y'; the empty word is a word path from yy to itself, and a word path is closed when y′=yy' = y.✦

Two permutations α\alpha and φ\varphi of a finite set AA form a planar map when c(α)+c(φ)+c(αφ)=|A|+2k(α,φ),c(\alpha) + c(\varphi) + c(\alpha\varphi) = |A| + 2\,k(\alpha, \varphi),(9)✦ where cc counts the cycles of a permutation, fixed points included, and k(α,φ)k(\alpha, \varphi) counts the components, the orbits of the group generated by α\alpha and φ\varphi. The elements of AA are called darts; with α\alpha pairing darts into edges, φ\varphi running around the faces and αφ\alpha\varphi around the vertices, (9) is Euler’s formula for the sphere on each component.

A triangle filling DD of a word ww consists of a finite set AA of darts, a label κ(x)\kappa(x) for each dart xx, a fixed-point-free involution α\alpha and a face permutation φ\varphi of AA that form a planar map, and a boundary ∂D=(x1,…,xm)\partial D = (x_1, \dots, x_m), a possibly empty sequence of distinct darts with φ(xk)=xk+1\varphi(x_k) = x_{k+1} cyclically, such that, for every dart xx, κ(αx)=κ(x)¯,t(κ(αφx))=t(κ(x)),κ(x1)⋯κ(xm)=w,\kappa(\alpha x) = \overline{\kappa(x)}, \qquad t\bigl(\kappa(\alpha\varphi x)\bigr) = t\bigl(\kappa(x)\bigr), \qquad \kappa(x_1) \cdots \kappa(x_m) = w,(10)✦ and such that every dart xx off ∂D\partial D in the component of a boundary dart lies on a cycle (x,φx,φ2x)(x, \varphi x, \varphi^2 x) of φ\varphi of length three whose labels form a triangle face. A word ww of labels is fillable when it has a triangle filling.✦ A dart is active when it lies in the component of a boundary dart✦, and act⁡(D)\operatorname{act}(D) is the number of active darts✦.

A cancelling dipole of DD is a family of six distinct darts ξ0,…,ξ5\xi_0, \dots, \xi_5 off ∂D\partial D, the corners of two triangles, on which φ\varphi acts as the permutation (012)(345)(0\,1\,2)(3\,4\,5) of the indices, with αξ0=ξ3\alpha\xi_0 = \xi_3, ξ0\xi_0 active, t(κ(ξ1))≠t(κ(ξ0))t(\kappa(\xi_1)) \ne t(\kappa(\xi_0)), t(κ(ξ2))≠t(κ(ξ1))t(\kappa(\xi_2)) \ne t(\kappa(\xi_1)), κ(ξ5)=κ(ξ1)¯\kappa(\xi_5) = \overline{\kappa(\xi_1)} and κ(ξ4)=κ(ξ2)¯\kappa(\xi_4) = \overline{\kappa(\xi_2)}.✦

Angle disk counts consist of a finite set 𝒱\mathcal{V} of vertices, a number n1n_1 of edges, a number n2n_2 of faces, and at each vertex yy a number ν(y)\nu(y) of boundary visits, counted with multiplicity, and a real angle θ(y)≥0\theta(y) \ge 0 in units of π/5\pi/5, in which 1212 is 2π+2π/52\pi + 2\pi/5. They satisfy the Euler relation, the exterior count and the angle sum |𝒱|+n2=n1+1,∑yν(y)+3n2=2n1,∑yθ(y)=5n2,|\mathcal{V}| + n_2 = n_1 + 1, \qquad \sum_{y} \nu(y) + 3n_2 = 2n_1, \qquad \sum_{y} \theta(y) = 5n_2,(11) and their boundary length is n∂=∑yν(y)n_\partial = \sum_{y} \nu(y)✦.

The Claim

Theorem 1. Let marked line data be given for a prime qq and a natural number r>0r > 0, let GG be the group of their fixed presentation, with word metric dGd_G, and let K̃\widetilde K be its lifted complex.

  1. Then Gis word-hyperbolic.G \ \text{is word-hyperbolic.}(12)✦

  2. For all o,a∈Go, a \in G, T∈ℕT \in \mathbb{N} and every closed path γ\gamma of length nn in (G,dG)(G, d_G), |∫γωo,a,T|≤114n.\Bigl| \int_\gamma \omega_{o,a,T} \Bigr| \le 114\,n.(13)✦

  3. For all o,a∈Go, a \in G, T∈ℕT \in \mathbb{N} and every closed word path e1⋯eme_1 \cdots e_m in K̃\widetilde K, |∑k=1mλo,a,T(ek)|≤38m.\Bigl| \sum_{k=1}^{m} \lambda_{o,a,T}(e_k) \Bigr| \le 38\,m.(14)✦

  4. Every fillable word ww in K̃\widetilde K has a triangle filling DD with act⁡(D)≤19|w|.\operatorname{act}(D) \le 19\,|w|.(15)✦

  5. Every triangle filling DD of a word ww in K̃\widetilde K without a cancelling dipole has act⁡(D)+36≤19|w|.\operatorname{act}(D) + 36 \le 19\,|w|.(16)✦

  6. In a geodesic discrete metric space satisfying the linear cochain bound (7) with constant BB, every triangle of geodesic paths, from x1x_1 to x2x_2, from x2x_2 to x3x_3 and from x1x_1 to x3x_3, is TT-thin for T=10000(B+1).T = 10000\,(B + 1).(17)✦

  7. Angle disk counts in which every vertex yy with ν(y)=0\nu(y) = 0 has θ(y)≥12\theta(y) \ge 12 satisfy n2+12≤6n∂.n_2 + 12 \le 6\,n_\partial.(18)✦

In the paper, the result reads: the group G=π1(K)G = \pi_1(K) is word-hyperbolic.

What Is Checked

The claim is stated over marked line data for a prime qq and r>0r > 0, with the group GG of their fixed presentation (2) and its word metric dGd_G; over closed word paths and triangle fillings in the lifted complex K̃\widetilde K; over geodesic discrete metric spaces with the linear cochain bound (7); and over angle disk counts (11).

About these constructions the library proves that marked line data have a regular point✦ and that the Cayley graph Γ\Gamma of GG with respect to the edge generators is connected✦.