OctoInformBeta

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

Lemma 2.3: Angle at least 2π+2π/52\pi + 2\pi/5 on each, and at least 1414 edges on reduced walks joining distinct xx-directions of one label

Reduced closed walks in the links of KK exceed 2π2\pi..

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 construction is a triangle complex KK with three vertices OO, VV and WW, built from points and punctured lines in a vector space of dimension 2020 over a finite field, and the group GG it presents. Each corner of a triangle of KK carries an angle, a multiple of π/5\pi/5, and the three angles of a triangle sum to π\pi. Angles are written as integers in units of π/5\pi/5, so π\pi is 55 and 2π2\pi is 1010.

The link of a vertex of KK is the graph of the ends of edges at that vertex, two ends joined when they bound a corner of a triangle, and a walk in a link has an angle, the sum of the angles of its edges. The question is how small that angle can be on a closed walk without backtracking, and how few edges a walk at VV or at WW can take between two distinct xx-directions of one label, that is, between the ends of two distinct edges from VV to WW carrying the same label, a label being the name of a line in the vector space.

Walks in Graphs

Graphs here are simple. A walk pp of length |p|=n|p| = n in a graph is a sequence of vertices y0,…,yny_0, \dots, y_n, each adjacent to the next, written p:y0→ynp\colon y_0 \to y_n; it is closed when yn=y0y_n = y_0. A path is a walk whose vertices are distinct, and a cycle is a closed walk of positive length that repeats no edge and meets no vertex twice except at its ends. The girth of a graph is the least length of a cycle in it, infinite when there is none. A walk is reduced when no step immediately reverses the previous one: ym≠ym+2(0≤m≤n−2),y_m \neq y_{m+2} \qquad (0 \le m \le n-2),(1)✦ with no condition at the closing seam of a closed walk.

The bipartite graph of a relation between two sets has their disjoint union as vertices, an element of the first set and an element of the second adjacent when they are related, and no other edges.✦ A morphism f:Θ→Δf\colon \Theta \to \Delta of graphs is a map on vertices that sends adjacent vertices to adjacent vertices; it is locally injective when two neighbours of one vertex of Θ\Theta with the same image are equal.✦

Lines and Blocks

Let qq be a prime, rr a positive integer and P=𝔽q20P = \mathbb{F}_q^{20}. A label ii names a line in PP: it carries a mark ai∈Pa_i \in P and a projective direction represented by a vector did_i, and its line ℓi\ell_i is the set of points ai+λdia_i + \lambda d_i with λ∈𝔽q\lambda \in \mathbb{F}_q. A point z∈Pz \in P is incident to ii when it lies on the punctured line ℓi\{ai}\ell_i \setminus \{a_i\}.✦ Given a set of labels and a point z∈Pz \in P, I(z)I(z) is the set of labels in it that are incident to zz, and the incidence graph Γ\Gamma is the bipartite graph of the relation i∈I(z)i \in I(z) between the points of PP and the labels.

Marked line data for qq and rr consist of a set S⊂𝔽qS \subset \mathbb{F}_q with ⌊q/100⌋\lfloor q/100 \rfloor elements, a finite set of NN labels with distinct marks in S20S^{20} and with projective directions, and a finite set E⊂PE \subset P of exceptional points, such that |I(z)|≥4r2 for z∉E,4(2q20+r|E|)<rN,girth⁡Γ>12.|I(z)| \ge 4r^2 \ \text{ for } z \notin E, \qquad 4\,\bigl(2q^{20} + r\,|E|\bigr) < rN, \qquad \operatorname{girth} \Gamma > 12.(2)✦ A point of PP outside EE is regular.✦

A Cartesian block with parameter rr is a finite set Λ\Lambda of labels with a bijection i↦(α(i),β(i))i \mapsto (\alpha(i), \beta(i)) from Λ\Lambda 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 set AA of labels is a pair of Cartesian blocks, block 00 and block 11, whose label sets are disjoint with union AA.✦ The data fix a two-block partition of I(z)I(z) at every regular point zz.✦ 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, with label set Λb\Lambda_b, sides sbs_b and tbt_b, and coordinates (αb(i),βb(i))(\alpha_b(i), \beta_b(i)).✦

The Complex and Its Links

The complex KK has three kinds of edges: xiuvx_{iuv} from VV to WW, for a label ii and indices u,v∈{0,…,r−1}u, v \in \{0, \dots, r-1\}✦; Lb,u,jL_{b,u,j} from OO to VV, for a block index bb, an index uu and j∈ℤ/sbj \in \mathbb{Z}/s_b✦; and Rb,v,kR_{b,v,k} from OO to WW, for an index vv and k∈ℤ/tbk \in \mathbb{Z}/t_b.✦ A triangle of KK has one edge of each of the three kinds, with angle 33 at OO and 11 at VV and at WW, and its word is LxR−1L x R^{-1}. The group GG is presented by one generator for each edge, with relators the triangle words and the two spanning-tree edges LL and RR picked out by the base block, block 00 at a chosen regular point, and the base index 00.

An oriented edge ee of KK is an edge of KK traversed in one of its two directions, from its start to its end; it stands for the generator of the edge, or for its inverse when traversed backwards✦, and its reverse e‾\bar e is the same edge traversed the other way.✦

A shift scheme 𝒮\mathcal{S} over a set of labels, a set of points with a map z↦I(z)z \mapsto I(z) to finite sets of labels, and an integer rr is a family of blocks b∈Bb \in B, each with a size σb≥r\sigma_b \ge r, a finite set Λb\Lambda_b of labels, a coordinate cb(i)∈ℤ/σbc_b(i) \in \mathbb{Z}/\sigma_b for each i∈Λbi \in \Lambda_b and a point zbz_b, such that Λb⊂I(zb)\Lambda_b \subset I(z_b) and two blocks at the same point that share a label are equal.✦ Its xx-directions are the triples (i,u,v)(i,u,v) of a label and two indices below rr✦, and its LL-directions the triples (b,u,j)(b,u,j) of a block, an index below rr and j∈ℤ/σbj \in \mathbb{Z}/\sigma_b.✦ The link Lk(𝒮)\mathrm{Lk}(\mathcal{S}) is the bipartite graph of the relation (i,u,v)∼(b,u′,j)⇔u′=u,i∈Λbandj=cb(i)+vinℤ/σb(i,u,v) \sim (b,u',j) \iff u' = u,\ i \in \Lambda_b \ \text{and}\ j = c_b(i) + v \ \text{in}\ \mathbb{Z}/\sigma_b(3)✦ between xx-directions and LL-directions, and the projection of 𝒮\mathcal{S} is the morphism ρ\rho from Lk(𝒮)\mathrm{Lk}(\mathcal{S}) to the bipartite graph of the relation i∈I(z)i \in I(z) with ρ(i,u,v)=i\rho(i,u,v) = i and ρ(b,u,j)=zb\rho(b,u,j) = z_b.✦

The shift scheme at VV has the block indices as blocks, over the labels and the points of PP with z↦I(z)z \mapsto I(z): the block b=(z,ϵ)b = (z, \epsilon) has size sbs_b, labels Λb\Lambda_b, coordinates αb\alpha_b and point zz.✦ The shift scheme at WW is the same with tbt_b and βb\beta_b in place of sbs_b and αb\alpha_b.✦ Their links are Lk(V)\mathrm{Lk}(V), with vertices (i,u,v)V(i,u,v)_V and (b,u,j)V(b,u,j)_V, and Lk(W)\mathrm{Lk}(W), with vertices (i,u,v)W(i,u,v)_W and (b,u,k)W(b,u,k)_W.

The directions at OO are the edges Lb,u,jL_{b,u,j} and Rb,v,kR_{b,v,k} themselves✦, and Lk(O)\mathrm{Lk}(O) is the complete bipartite graph between the edges LL and the edges RR. The link Lk(K)\mathrm{Lk}(K) of all directions is the disjoint union of Lk(O)\mathrm{Lk}(O), Lk(V)\mathrm{Lk}(V) and Lk(W)\mathrm{Lk}(W).✦ The weight ω(y)\omega(y) of a vertex yy of Lk(K)\mathrm{Lk}(K) is the angle of a corner at the vertex of KK whose link contains yy: 33 in Lk(O)\mathrm{Lk}(O) and 11 in Lk(V)\mathrm{Lk}(V) and Lk(W)\mathrm{Lk}(W). The direction δ(e)\delta(e) of an oriented edge ee is the vertex of Lk(K)\mathrm{Lk}(K) at which ee arrives: xiuvx_{iuv} arrives at (i,v,u)W(i,v,u)_W and its reverse at (i,u,v)V(i,u,v)_V, Lb,u,jL_{b,u,j} at (b,u,j)V(b,u,j)_V and Rb,v,kR_{b,v,k} at (b,v,k)W(b,v,k)_W, and the reverses of Lb,u,jL_{b,u,j} and Rb,v,kR_{b,v,k} at themselves, as directions at OO.✦

The Claim

Theorem 1. Let qq be a prime and rr a positive integer, and fix marked line data for qq and rr. Every reduced closed walk pp of positive length at a vertex yy of Lk(K)\mathrm{Lk}(K) has angle ω(y)|p|≥12.\omega(y)\,|p| \ge 12.(4)✦ The links at VV and at WW satisfy girth⁡Lk(V)≥14,\operatorname{girth} \mathrm{Lk}(V) \ge 14,(5)✦ girth⁡Lk(W)≥14.\operatorname{girth} \mathrm{Lk}(W) \ge 14.(6)✦ Let ii be a label and (u,v)≠(u′,v′)(u,v) \neq (u',v') two pairs of indices. A path pp in Lk(V)\mathrm{Lk}(V), or in Lk(W)\mathrm{Lk}(W), between the xx-directions of ii at (u,v)(u,v) and at (u′,v′)(u',v') has length |p|≥14(p:(i,u,v)V→(i,u′,v′)V),|p| \ge 14 \qquad \bigl(p\colon (i,u,v)_V \to (i,u',v')_V\bigr),(7)✦ |p|≥14(p:(i,u,v)W→(i,u′,v′)W),|p| \ge 14 \qquad \bigl(p\colon (i,u,v)_W \to (i,u',v')_W\bigr),(8)✦ and a reduced walk pp in Lk(K)\mathrm{Lk}(K) between them has length |p|≥14(p:(i,u,v)V→(i,u′,v′)Vreduced),|p| \ge 14 \qquad \bigl(p\colon (i,u,v)_V \to (i,u',v')_V \ \text{reduced}\bigr),(9)✦ |p|≥14(p:(i,u,v)W→(i,u′,v′)Wreduced).|p| \ge 14 \qquad \bigl(p\colon (i,u,v)_W \to (i,u',v')_W \ \text{reduced}\bigr).(10)✦ If ee is xiuvx_{iuv} or its reverse and e′e' is xiu′v′x_{iu'v'} or its reverse, with ee ending where e′e' begins, every reduced walk pp in Lk(K)\mathrm{Lk}(K) from δ(e‾′)\delta(\bar e') to δ(e)\delta(e) has angle ω(δ(e))|p|≥5.\omega(\delta(e))\,|p| \ge 5.(11)✦ For every shift scheme 𝒮\mathcal{S}, any two neighbours ξ\xi and ξ′\xi' of one vertex of Lk(𝒮)\mathrm{Lk}(\mathcal{S}) satisfy ρ(ξ)=ρ(ξ′)⟹ξ=ξ′.\rho(\xi) = \rho(\xi') \implies \xi = \xi'.(12)✦ Let f:Θ→Δf\colon \Theta \to \Delta be a locally injective morphism of graphs and gg a natural number with girth⁡Δ≥g\operatorname{girth} \Delta \ge g. If y≠y′y \neq y' are vertices of Θ\Theta with f(y)=f(y′)f(y) = f(y'), every reduced walk p:y→y′p\colon y \to y' in Θ\Theta has length |p|≥g.|p| \ge g.(13)✦

In the paper, the result reads: KK satisfies Theorem 2.1 with η=2π/5\eta = 2\pi/5, and at either VV or WW the link distance between distinct xx-directions with the same label ii is at least 14π/514\pi/5, or is infinite.

In units of π/5\pi/5, the bound 1212 in (4) is 2π+2π/52\pi + 2\pi/5, and 1414 edges at VV or at WW measure 14π/514\pi/5.

What Is Checked

The claim is stated over marked line data for a prime qq and a positive integer rr, subject to (2): over the complex KK and its oriented edges, the shift schemes at VV and at WW with their links, the link Lk(K)\mathrm{Lk}(K) with the weights ω\omega and the directions δ\delta, and reduced walks, paths and cycles in these graphs.

The library proves that the data have a regular point, which carries the base block.✦ It proves that the labels of the block at (z,ϵ)(z, \epsilon) lie in I(z)I(z)✦ and that the two blocks at a regular point share no label✦: the two conditions a shift scheme asks of its blocks, for the schemes at VV and at WW.