OctoInformBeta

OpenAI preprint, September 2026 · §2. The construction and the rank obstruction · §2.1

Triangle complexes and angular links: Three vertices O,V,WO,V,W, oriented edges with reversal and target, triangles LxR−1LxR^{-1}, corner angles 3π/5,π/5,π/53\pi/5,\pi/5,\pi/5, reduced walks and the link on edge directions

The triangle complex, its corner angles and its vertex links.

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 of the construction has a presentation read off a triangle complex KK with three vertices OO, VV, WW: a generator for each edge, a relator of length three for each triangle, and two relators killing the edges of a spanning tree. The edges of KK are indexed by labels arranged in blocks, and the definitions below give KK as combinatorial data: its vertices, oriented edges and triangles, the angles at the corners of a triangle, the walks without backtracking, and the link graph on the directions of edges at the vertices. Angles are integers in units of π/5\pi/5, so a straight angle is 55 and a full turn is 1010.

Cartesian Blocks and the Edges of KK

Fix a set II of labels and an integer r≥0r \ge 0, and write [r]={0,…,r−1}[r] = \{0, \dots, r-1\}. A Cartesian block of width rr with labels in II is a finite set Λ⊂I\Lambda \subset I together with positive integers s,t≥rs, t \ge r and a bijection i↦(α(i),β(i))i \mapsto (\alpha(i), \beta(i)) from Λ\Lambda onto ℤ/s×ℤ/t\mathbb{Z}/s \times \mathbb{Z}/t.✦ A block presentation of width rr with labels in II, indexed by a set BB, consists of a Cartesian block (Λb,sb,tb,αb,βb)(\Lambda_b, s_b, t_b, \alpha_b, \beta_b) of width rr with labels in II for every b∈Bb \in B, a base block b0∈Bb_0 \in B and a base index u0∈[r]u_0 \in [r].✦

The complex KK of a block presentation has middle edges xiuvx_{iuv}, left edges Lb,u,jL_{b,u,j} and right edges Rb,v,kR_{b,v,k}, forming the sets 𝒳={xiuv:i∈I,u,v∈[r]},ℒ={Lb,u,j:b∈B,u∈[r],j∈ℤ/sb},ℛ={Rb,v,k:b∈B,v∈[r],k∈ℤ/tb},\begin{gathered} \mathcal{X} = \{x_{iuv} : i \in I,\ u, v \in [r]\}, \qquad \mathcal{L} = \{L_{b,u,j} : b \in B,\ u \in [r],\ j \in \mathbb{Z}/s_b\},\\ \mathcal{R} = \{R_{b,v,k} : b \in B,\ v \in [r],\ k \in \mathbb{Z}/t_b\}, \end{gathered}(1) and its edge set is the disjoint union ℰ=𝒳⊔ℒ⊔ℛ\mathcal{E} = \mathcal{X} \sqcup \mathcal{L} \sqcup \mathcal{R}.✦

Marked Lines and Their Blocks

Let qq be a prime and P=𝔽q20P = \mathbb{F}_q^{20}. The line ℓ\ell through a point a∈Pa \in P in a projective direction [d]∈ℙ(𝔽q20)[d] \in \mathbb{P}(\mathbb{F}_q^{20}) is the image of the map x↦a+xdx \mapsto a + x d from 𝔽q\mathbb{F}_q to PP, for a fixed representative dd of [d][d]. A point z∈Pz \in P is incident to (a,[d])(a, [d]) when it lies on the punctured line ℓ\{a}\ell \setminus \{a\}.✦

For a point z∈Pz \in P, let I(z)I(z) be the set of labels ii such that zz is incident to (ai,[di])(a_i, [d_i]), and say that zz is incident to the labels in I(z)I(z). Marked line data over 𝔽q\mathbb{F}_q of width rr consist of a set S⊂𝔽qS \subset \mathbb{F}_q with ⌊q/100⌋\lfloor q/100 \rfloor elements, a finite set II of labels, for each label ii a mark ai∈S20a_i \in S^{20} and a projective direction [di][d_i], distinct labels having distinct marks, and a finite set E⊂PE \subset P of exceptional points, such that every point outside EE is incident to at least 4r24r^2 labels, the inequality 4(2q20+r|E|)<r|I|4\,(2q^{20} + r\,|E|) < r\,|I|(2)✦ holds, and every cycle in the incidence graph of points and labels, the bipartite graph on P⊔IP \sqcup I joining zz to ii when i∈I(z)i \in I(z), has length greater than 1212.

A point of PP is regular when it is not exceptional.✦ A two-block partition of width rr of a finite set A⊂IA \subset I is a pair of Cartesian blocks of width rr with labels in II whose label sets are disjoint with union AA.✦ For r≥1r \ge 1, fix for every regular point zz a two-block partition of I(z)I(z) of width rr, its blocks numbered 00 and 11✦. The presentation of marked line data of width r≥1r \ge 1 with the fixed two-block partitions is the block presentation of width rr with labels in II, indexed by the pairs (z,ε)(z, \varepsilon) with zz a regular point and ε∈{0,1}\varepsilon \in \{0, 1\}, whose block at (z,ε)(z, \varepsilon) is the block numbered ε\varepsilon of the partition fixed at zz, with base block (z0,0)(z_0, 0) for a fixed regular point z0z_0 and base index 00.✦

Shift Schemes and Directions

The bipartite graph Γ(R)\Gamma(R) of a relation R⊂A×A′R \subset A \times A' is the graph on the disjoint union A⊔A′A \sqcup A' that joins a∈Aa \in A to a′∈A′a' \in A' when (a,a′)∈R(a, a') \in R; for R=A×A′R = A \times A' it is the complete bipartite graph.✦

Let ZZ be a set of points, each z∈Zz \in Z with a finite set I(z)⊂II(z) \subset I of labels incident to it. A shift scheme of width rr over ZZ, indexed by a set BB, assigns to each b∈Bb \in B an integer nb≥rn_b \ge r, a finite set Λb⊂I\Lambda_b \subset I of labels, coordinates cb:Λb→ℤ/nbc_b \colon \Lambda_b \to \mathbb{Z}/n_b and a point pb∈Zp_b \in Z, such that Λb⊂I(pb)\Lambda_b \subset I(p_b) for every bb, and b=b′b = b' whenever pb=pb′p_b = p_{b'} and Λb∩Λb′≠∅\Lambda_b \cap \Lambda_{b'} \neq \emptyset.✦ The XX-directions of the scheme are the triples (i,u,v)∈I×[r]×[r](i, u, v) \in I \times [r] \times [r]✦, its LL-directions the triples (b,u,j)(b, u, j) with b∈Bb \in B, u∈[r]u \in [r] and j∈ℤ/nbj \in \mathbb{Z}/n_b✦, and an XX-direction is attached to an LL-direction when (i,u,v)∼(b,u′,j)⇔i∈Λb,u′=u and j=cb(i)+v.(i, u, v) \sim (b, u', j) \iff i \in \Lambda_b,\ u' = u \text{ and } j = c_b(i) + v.(3)✦ The link of the scheme is the bipartite graph Γ(∼)\Gamma(\sim) of the relation (3).✦

For marked line data of width r≥1r \ge 1, the shift scheme at VV is the scheme of width rr over PP, with the sets I(z)I(z), indexed by the pairs (z,ε)(z, \varepsilon), that assigns to the block bb at (z,ε)(z, \varepsilon) the size sbs_b, the labels Λb\Lambda_b, the coordinates αb\alpha_b and the point zz✦; the shift scheme at WW assigns tbt_b and βb\beta_b in place of sbs_b and αb\alpha_b.✦ Write ΓV\Gamma_V and ΓW\Gamma_W for their links and XVX_V, XWX_W for their XX-directions. The LL-directions at VV are the triples (b,u,j)(b, u, j) indexing the left edges of the presentation, those at WW the triples (b,v,k)(b, v, k) indexing its right edges, and the directions at the three vertices of its complex are DO=ℒ⊔ℛ,DV=XV⊔ℒ,DW=XW⊔ℛ,D_O = \mathcal{L} \sqcup \mathcal{R}, \qquad D_V = X_V \sqcup \mathcal{L}, \qquad D_W = X_W \sqcup \mathcal{R},(4) with D=DO⊔DV⊔DWD = D_O \sqcup D_V \sqcup D_W the set of all directions.✦

The Definition

Definition 1. Let KK be the complex of a block presentation of width rr with labels in II, indexed by BB. The vertex set of KK is {O,V,W}.\{O, V, W\}.(5)✦ An oriented edge of KK is an edge of (1) with a sign, (e,σ)∈ℰ×{+1,−1},(e, \sigma) \in \mathcal{E} \times \{+1, -1\},(6)✦ and its reversal is (e,σ)¯=(e,−σ).\overline{(e, \sigma)} = (e, -\sigma).(7)✦ Writing ee for (e,+1)(e, +1) and e‾\bar{e} for (e,−1)(e, -1), the target of an oriented edge is the vertex τ(x)=W,τ(x‾)=V,τ(L)=V,τ(L‾)=O,τ(R)=W,τ(R‾)=O,x∈𝒳,L∈ℒ,R∈ℛ.\begin{gathered} \tau(x) = W,\quad \tau(\bar{x}) = V, \qquad \tau(L) = V,\quad \tau(\bar{L}) = O, \qquad \tau(R) = W,\quad \tau(\bar{R}) = O,\\ x \in \mathcal{X},\ L \in \mathcal{L},\ R \in \mathcal{R}. \end{gathered}(8)✦ A triangle face of KK is a triple of oriented edges read around a triangle with boundary word LxR−1L x R^{-1}, from any corner and in either direction: for some block b∈Bb \in B, label i∈Λbi \in \Lambda_b and u,v∈[r]u, v \in [r], one of (L,x,R‾),(x,R‾,L),(R‾,L,x),(L‾,R,x‾),(R,x‾,L‾),(x‾,L‾,R),where L=Lb,u,αb(i)+v,x=xiuv,R=Rb,v,βb(i)+u.\begin{gathered} (L, x, \bar{R}), \quad (x, \bar{R}, L), \quad (\bar{R}, L, x), \quad (\bar{L}, R, \bar{x}), \quad (R, \bar{x}, \bar{L}), \quad (\bar{x}, \bar{L}, R),\\ \text{where } L = L_{b,u,\alpha_b(i)+v}, \quad x = x_{iuv}, \quad R = R_{b,v,\beta_b(i)+u}. \end{gathered}(9)✦ A walk p0p1⋯pnp_0 p_1 \cdots p_n in a graph is reduced when pm≠pm+2(0≤m≤n−2),p_m \neq p_{m+2} \qquad (0 \le m \le n-2),(10)✦ with no condition relating pn−1p_{n-1} and p1p_1 when the walk is closed. The angle of a triangle at its corner c∈{0,1,2}c \in \{0, 1, 2\}, corner 00 being the one at OO and corners 11, 22 those at VV and WW, is θ(0)=3,θ(1)=θ(2)=1.\theta(0) = 3, \qquad \theta(1) = \theta(2) = 1.(11)✦ For marked line data of width r≥1r \ge 1 and KK the complex of their presentation, the link of KK is the graph on the directions (4) Lk⁡=Γ(ℒ×ℛ)⊔ΓV⊔ΓW,\operatorname{Lk} = \Gamma(\mathcal{L} \times \mathcal{R}) \sqcup \Gamma_V \sqcup \Gamma_W,(12)✦ and the direction δ(e)∈D\delta(e) \in D that an oriented edge ee defines at its target τ(e)\tau(e) is δ(x‾iuv)=(i,u,v)∈XV,δ(xiuv)=(i,v,u)∈XW,δ(L‾)=L∈DO,δ(L)=L∈DV,δ(R‾)=R∈DO,δ(R)=R∈DW.\begin{gathered} \delta(\bar{x}_{iuv}) = (i, u, v) \in X_V, \qquad \delta(x_{iuv}) = (i, v, u) \in X_W,\\ \delta(\bar{L}) = L \in D_O, \quad \delta(L) = L \in D_V, \qquad \delta(\bar{R}) = R \in D_O, \quad \delta(R) = R \in D_W. \end{gathered}(13)✦

In the paper, the result reads: a triangle complex is a finite graph with Euclidean triangles glued along full sides, the angular link at a vertex has a vertex for each edge germ at it and an edge, of length the corner angle, for each triangle corner at it, and a walk is reduced if it has no immediate reversal, cyclically reduced if it has none across the closing seam either.

What Is Checked

The vertex set, oriented edges, reversal, target and triangle faces (5) to (9) are stated over a block presentation of width rr with labels in a set II, indexed by a set BB; reduced walks (10) over walks in an arbitrary graph; the link (12) and the direction δ\delta (13) over marked line data over 𝔽q\mathbb{F}_q of width r≥1r \ge 1, through their presentation and the shift schemes at VV and WW. The corner angles (11) are stated over the three corners of a triangle of KK.

The library proves that marked line data have a regular point✦ and, for r≥1r \ge 1, that every label of the block at (z,ε)(z, \varepsilon) is incident to zz✦ and that two blocks at the same regular point with a common label are the same block.✦