OctoInformBeta

OpenAI preprint, September 2026 · §3. Metrics, planar fillings, and torsion

Proposition 3.3: In triangle ribbons labelled in a link graph; and every rectangular word in the generators xi(u,v)x_i(u,v) of the group GG is nontrivial

Under the link condition, some boundary turn is not geodesic.

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 group GG has one generator for each edge of a triangle complex KK with three vertices OO, VV and WW, and its relators are the boundary words of the triangles of KK together with the two edges of a spanning tree.✦ The edges are the middle edges xiuvx_{iuv} from VV to WW, the left edges Lb,u,jL_{b,u,j} from OO to VV and the right edges Rb,v,kR_{b,v,k} from OO to WW, whose indices ii, bb, uu, vv, jj, kk are labels, blocks, indices and coordinates defined below; each triangle is bounded by a word LxR−1L\,x\,R^{-1}. Angles are integers 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, which is π\pi, and a full turn 2π2\pi is 1010.

By van Kampen’s lemma, a word in the generators is trivial in GG exactly when it is the boundary word of a van Kampen diagram, a disc of triangles of KK. The question is which closed edge paths bound such a disc, judged by angles in links: around an interior vertex of a diagram the corners form a closed walk in the link of KK at that vertex, and where the boundary passes through a vertex it turns through a walk in the link from one boundary edge to the next. The paths in view are the rectangular words, closed paths of four middle edges xiuvx_{iuv}, xiu′vx_{iu'v}, xiu′v′x_{iu'v'}, xiuv′x_{iuv'} with the same index ii, taken with u≠u′u \ne u' and v≠v′v \ne v', the second and fourth edges traversed backwards.

The library states the answer for triangle ribbons, diagrams given by finite sets of darts, each dart labelled by a vertex of a graph, the link graph, together with a count of angles on a disc. For the group GG built from marked line data, a family of lines in 𝔽q20\mathbb{F}_q^{20} with marked points, where qq is a prime, it states that the rectangular words in the generators xi(u,v)x_i(u,v) are nontrivial.

Triangle Ribbons

A triangle ribbon Δ\Delta is a finite set DD of darts with two permutations, a fixed-point-free involution ι\iota, the edge involution, and a face permutation ϕ\phi, together with an outer face f∞f_\infty among the cycles of ϕ\phi and a colouring κ\kappa of the cycles of σ=ιϕ\sigma = \iota\phi by three colours 00, 11, 22, subject to the two conditions below.✦ The edges of Δ\Delta are the cycles of ι\iota, the faces of Δ\Delta are the cycles of ϕ\phi, and the vertices of Δ\Delta are the cycles of the vertex permutation σ\sigma, the face permutation followed by the edge involution, which rotates the darts about their corners; [d][d] is the vertex of the dart dd. Every face other than f∞f_\infty is a triangle with one corner at each of OO, VV, WW: on its darts, d↦κ[d]d \mapsto \kappa[d] is a bijection onto {0,1,2}\{0, 1, 2\}, the colour 00 marking the corner at OO. The Euler count of a disc holds: #{vertices}+#{faces other than f∞}=#{edges}+1.\#\{\text{vertices}\} + \#\{\text{faces other than } f_\infty\} = \#\{\text{edges}\} + 1.(1)

The weight of a colour is the angle of its corner, w(0)=3w(0) = 3 and w(1)=w(2)=1w(1) = w(2) = 1, and a dart dd has weight w(d)=w(κ[d])w(d) = w(\kappa[d]).✦ A dart of Δ\Delta is outer when it lies in the outer face f∞f_\infty, on the boundary of the diagram.✦ The corner angle of a dart dd is 00 if dd is outer and w(d)w(d) otherwise.✦ At a vertex vv of Δ\Delta, the angle sum θ(v)\theta(v) is the sum of the corner angles of the darts at vv✦, and the number of visits ν(v)\nu(v) is the number of outer darts at vv, the number of times the boundary passes through vv: θ(v)=∑[d]=v,d∉f∞w(d),ν(v)=#{d∈f∞:[d]=v}.\theta(v) = \sum_{[d] = v,\ d \notin f_\infty} w(d), \qquad \nu(v) = \#\{d \in f_\infty : [d] = v\}.(2)✦

A walk pp in a simple graph, of length |p||p|, is reduced when no step immediately reverses the previous one: its vertices at positions nn and n+2n + 2 differ whenever n+2≤|p|n + 2 \le |p|.✦ No condition is imposed at the closing seam of a closed walk.

A labelling of Δ\Delta in a graph Λ\Lambda, the link graph, is a map λ\lambda from the darts of Δ\Delta to the vertices of Λ\Lambda. The labelled ribbon satisfies the link condition when, for every dart aa, every closed reduced walk pp of positive length at λ(a)\lambda(a) has w(a)|p|≥10w(a)\,|p| \ge 10, that is 2π2\pi. The boundary turn at an outer dart aa goes from λ(σa)\lambda(\sigma a) to λ(a)\lambda(a); it is geodesic when every reduced walk pp in Λ\Lambda from λ(σa)\lambda(\sigma a) to λ(a)\lambda(a) has w(a)|p|≥5w(a)\,|p| \ge 5, that is π\pi.

Angle Counts on a Disc

Angle disc counts consist of a finite set 𝒱\mathcal V of vertices, a number ee of edges, a number ff of faces and, at each vertex vv, a number ν(v)\nu(v) of visits and a nonnegative real angle sum θ(v)\theta(v), subject to |𝒱|+f=e+1,∑v∈𝒱ν(v)+3f=2e,∑v∈𝒱θ(v)=5f.|\mathcal V| + f = e + 1, \qquad \sum_{v \in \mathcal V} \nu(v) + 3f = 2e, \qquad \sum_{v \in \mathcal V} \theta(v) = 5f.(3)✦

Marked Line Data and the Group

Fix a prime qq and a natural number rr, and let P=𝔽q20P = \mathbb{F}_q^{20}. Marked line data 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 [ξi][\xi_i] of PP, distinct labels having distinct marks; and a finite set E⊂PE \subset P of exceptional points.✦ A point zz of PP is incident to the label ii when z≠aiz \ne a_i and z=ai+tξiz = a_i + t\,\xi_i for some t∈𝔽qt \in \mathbb{F}_q; the punctured line ℓi\{ai}\ell_i \setminus \{a_i\} through aia_i in direction [ξi][\xi_i] is the set of points incident to ii; I(z)I(z) is the set of labels incident to zz. The data satisfy the degree condition and the budget, |I(z)|≥4r2 for z∉E,4(2q20+r|E|)<rN,|I(z)| \ge 4r^2 \ \text{ for } z \notin E, \qquad 4\,(2q^{20} + r\,|E|) < rN,(4) and the girth condition: in the bipartite incidence graph, whose vertices are the points of PP and the labels, a point being adjacent to the labels incident to it and two points or two labels never adjacent, every cycle has length greater than 1212.

A point of PP outside EE is regular.✦ 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 integers s,t≥rs, t \ge r.✦ A two-block partition of a finite set AA of labels is a pair of Cartesian blocks, block 00 and block 11, with disjoint label sets whose union is AA.✦ For r≥1r \ge 1, each regular point zz carries a chosen two-block partition of I(z)I(z).✦ A block index is a pair b=(z,ϵ)b = (z, \epsilon) of a regular point zz and ϵ∈{0,1}\epsilon \in \{0, 1\}✦, and the block at bb is block ϵ\epsilon of the partition at zz.✦

Block presentation data over a set of labels consist of a Cartesian block for each index bb of a set BB, with sides sbs_b, tbt_b and coordinates (αb,βb)(\alpha_b, \beta_b), a base block b0∈Bb_0 \in B and a base index u0u_0 with 0≤u0<r0 \le u_0 < r.✦ Their edges are the middle edges xiuvx_{iuv} for every label ii and 0≤u,v<r0 \le u, v < r, the left edges Lb,u,jL_{b,u,j} for b∈Bb \in B, u<ru < r and j∈ℤ/sbj \in \mathbb{Z}/s_b, and the right edges Rb,v,kR_{b,v,k} for b∈Bb \in B, v<rv < r and k∈ℤ/tbk \in \mathbb{Z}/t_b.✦ For a block bb, a label ii in it and indices uu, vv, the triangle word is 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},(5)✦ with αb(i)+v\alpha_b(i)+v taken modulo sbs_b and βb(i)+u\beta_b(i)+u modulo tbt_b. The two tree edges are Lb0,u0,0L_{b_0,u_0,0} and Rb0,u0,0R_{b_0,u_0,0}, and xi(u,v)x_i(u,v) is the image of xiuvx_{iuv} in GG.✦

The fixed presentation of marked line data with r≥1r \ge 1 is the block presentation data over their labels whose blocks are indexed by the block indices, each index carrying its block, with base block (z0,0)(z_0, 0) at a chosen regular point z0z_0 and base index 00.✦ A family g(u,v)g(u,v) of elements of a group, indexed by pairs, has surviving rectangles when each of its rectangular words g(u,v)g(u′,v)−1g(u′,v′)g(u,v′)−1g(u,v)\,g(u',v)^{-1}\,g(u',v')\,g(u,v')^{-1} with u≠u′u \ne u' and v≠v′v \ne v' is not the identity.✦ Marked line data have rectangular nontriviality when, for every label ii, the middle generators xi(u,v)x_i(u,v) of the fixed presentation have surviving rectangles.✦

The Claim

Theorem 1.

  1. Let Δ\Delta be a triangle ribbon labelled in a graph Λ\Lambda, and suppose that Δ\Delta satisfies the link condition. Then there are an outer dart aa and a reduced walk pp in Λ\Lambda from λ(σa)\lambda(\sigma a) to λ(a)\lambda(a) with w(a)|p|<5.w(a)\,|p| < 5.(6)✦

  2. Let Δ\Delta be a triangle ribbon labelled in a graph Λ\Lambda, and suppose that every boundary turn of Δ\Delta is geodesic. Then every vertex vv of Δ\Delta with ν(v)=1\nu(v) = 1 has θ(v)≥5.\theta(v) \ge 5.(7)✦

  3. Let angle disc counts be given in which every vertex vv with ν(v)=0\nu(v) = 0 has θ(v)≥10\theta(v) \ge 10. Then some vertex vv has ν(v)=1andθ(v)<5.\nu(v) = 1 \quad \text{and} \quad \theta(v) < 5.(8)✦

  4. Let marked line data with r≥1r \ge 1 be given, and let GG be the group of their fixed presentation. Then for every label ii and all indices u≠u′u \ne u' and v≠v′v \ne v', xi(u,v)xi(u′,v)−1xi(u′,v′)xi(u,v′)−1≠1.x_i(u,v)\,x_i(u',v)^{-1}\,x_i(u',v')\,x_i(u,v')^{-1} \ne 1.(9)✦

In the paper, the result reads: in KK, or in any compatible Euclidean simplicial subdivision of KK, a nonempty closed edge path whose every cyclic turn has link distance at least π\pi is not nullhomotopic.

What Is Checked

Parts 1 and 2 of the claim are stated over a triangle ribbon labelled in a graph, with the corner weights 33 and 11, the angle sums and visits of (2) and reduced walks in the link graph; part 3 is stated over angle disc counts subject to (3), and part 4 over marked line data with r≥1r \ge 1 and the group GG of their fixed presentation.

The library proves, beside the claim, that marked line data have a regular point.✦