OctoInformBeta

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

Based edge elements and rectangular words: The triangle relation for xiuvx_{iuv}, turns of angle at least π\pi at rectangle corners, and triangular fillings of trivial rectangular words

Rectangular words in the constructed group are nontrivial.

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 is presented by the edges of a complex KK of triangles with three vertices OO, VV and WW. Its middle edges xiuvx_{iuv} run from VV to WW, one for each label ii of a set II of labels and each pair of indices 0≤u,v<r0 \le u, v < r, where rr is the parameter of the construction, so the middle edges of one label form an r×rr \times r array. Two rows u≠u′u \neq u' and two columns v≠v′v \neq v' of the array span the rectangle loop (xiuv,xiu′v−1,xiu′v′,xiuv′−1)(x_{iuv}, x_{iu'v}^{-1}, x_{iu'v'}, x_{iuv'}^{-1}), a closed edge path at VV through WW, VV and WW, and its product xiuvxiu′v−1xiu′v′xiuv′−1x_{iuv}\,x_{iu'v}^{-1}\,x_{iu'v'}\,x_{iuv'}^{-1} in GG is a rectangular word. The question is whether a rectangular word can be trivial in GG, and how sharply a rectangle loop turns at its corners, measured in the links of VV and WW.

The library builds KK and GG from block presentation data, which describe them for any family of Cartesian blocks of labels, and specializes them to marked line data, where, for a prime qq, the labels are punctured lines in 𝔽q20\mathbb{F}_q^{20} and the blocks sit at points where the lines meet.

The Complex and Its Group

A Cartesian block of labels from a set II, with parameter rr, is a finite set of labels together with a bijection i↦(α(i),β(i))i \mapsto (\alpha(i), \beta(i)) onto ℤ/s×ℤ/t\mathbb{Z}/s \times \mathbb{Z}/t, where ss and tt are positive integers with s≥rs \ge r and t≥rt \ge r.✦ Block presentation data over labels in II with indices below rr consist of a set BB of block indices, a Cartesian block of labels for each b∈Bb \in B, with sides sbs_b, tbt_b and coordinates i↦(αb(i),βb(i))i \mapsto (\alpha_b(i), \beta_b(i)), a base block b0∈Bb_0 \in B and a base index 0≤u0<r0 \le u_0 < r.✦

The complex KK of these data has three vertices OO, VV, WW and three kinds of edges: the middle edges xiuvx_{iuv} from VV to WW, for i∈Ii \in 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✦. An oriented edge is an edge ee taken in its own direction, written ee, or backwards, written e−1e^{-1}✦; reversal exchanges the two✦, and the target of an oriented edge is the vertex where it ends✦.

For a block bb, a label ii of its Cartesian block and indices 0≤u,v<r0 \le u, v < r, the triangle relator word is the element Lb,u,αb(i)+vxiuvRb,v,βb(i)+u−1L_{b,u,\alpha_b(i)+v}\; x_{iuv}\; R_{b,v,\beta_b(i)+u}^{-1}(1)✦ of the free group on the edges, with αb(i)+v\alpha_b(i)+v taken modulo sbs_b and βb(i)+u\beta_b(i)+u modulo tbt_b. A triangle face of KK is a triple of oriented edges read around one triangle: the word (1) read cyclically from any of its three letters, or its inverse Rb,v,βb(i)+uxiuv−1Lb,u,αb(i)+v−1R_{b,v,\beta_b(i)+u}\, x_{iuv}^{-1}\, L_{b,u,\alpha_b(i)+v}^{-1} read cyclically from any of its letters.

The presented group GG is the group with one generator for each edge of KK, subject to the triangle relator words (1) and the two tree edges Lb0,u0,0L_{b_0,u_0,0} and Rb0,u0,0R_{b_0,u_0,0} as relators.✦ The edge generator of an edge is its image in GG, written with the edge’s own symbol✦: the middle generators xiuvx_{iuv}✦, the left generators Lb,u,jL_{b,u,j}✦ and the right generators Rb,v,kR_{b,v,k}✦.

Lines Over a Finite Field

For a field 𝔽\mathbb{F} and an index set TT, the affine line through a point aa of 𝔽T\mathbb{F}^T in the direction of a vector yy is the map t↦a+tyt \mapsto a + t\,y on 𝔽\mathbb{F}, with value aa at t=0t = 0.✦ A point zz of a vector space over 𝔽\mathbb{F} lies on the line through aa in a projective direction [y][y] when z=a+tyz = a + t\,y for some t∈𝔽t \in \mathbb{F}, with yy a representative of [y][y]✦; it is incident to aa and [y][y] in the punctured sense when moreover z≠az \neq a.✦ Over a finite field, the punctured line ℓ\{a}\ell \setminus \{a\} of the line ℓ\ell through aa in direction [y][y] is the finite set of points incident to aa and [y][y].✦ For a finite family of lines ℓi\ell_i through points aia_i and a point zz, the lines through zz are the indices ii with z∈ℓi\{ai}z \in \ell_i \setminus \{a_i\}.✦

The bipartite graph of a relation between two sets AA and BB has vertex set A⊔BA \sqcup B, an edge between a∈Aa \in A and b∈Bb \in B exactly when they are related, and no edge inside AA or inside BB.✦

Fix a prime qq and an integer rr, and put 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 II of NN labels, each label ii carrying a mark ai∈S20a_i \in S^{20}, with distinct marks for distinct labels, and a projective direction [yi][y_i] of PP; and a finite set E⊂PE \subset P of exceptional points.✦ Write ℓi\ell_i for the line through aia_i in direction [yi][y_i] and I(z)I(z) for the set of lines incident at zz. The incidence graph of marked line data is the bipartite graph of punctured incidence between the points of PP and the labels. The data satisfy the degree condition, the budget and the girth condition: |I(z)|≥4r2 for z∉E,4(2q20+r|E|)<rN,every cycle of the incidence graph has length>12.|I(z)| \ge 4r^2 \ \text{ for } z \notin E, \qquad 4\,(2q^{20} + r\,|E|) < rN, \qquad \text{every cycle of the incidence graph has length} > 12.(2)✦

A regular point is a point of PP outside EE.✦ 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.✦ A two-block partition of I(z)I(z) is chosen at every regular point zz✦; a block index is a pair (z,ϵ)(z, \epsilon) of a regular point zz and ϵ∈{0,1}\epsilon \in \{0, 1\}✦, and the block at (z,ϵ)(z, \epsilon) is block ϵ\epsilon of the partition chosen at zz✦. For r>0r > 0, the fixed presentation of marked line data is the block presentation data over the labels II whose blocks are indexed by 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.✦ For marked line data, KK, GG and xiuvx_{iuv} are those of the fixed presentation.

Links and Angles

A shift scheme for labels in II, over a set of points with incidence sets I(z)I(z) and with parameter rr, is a family of blocks indexed by a set BB, each block bb having a size sb≥rs_b \ge r, a finite set of labels, each label ii with a coordinate cb(i)∈ℤ/sbc_b(i) \in \mathbb{Z}/s_b, and a point zbz_b, such that every label of bb lies in I(zb)I(z_b) and two blocks at the same point that share a label are equal.✦ The XX-directions of a shift scheme are the triples (i,u,v)(i, u, v) with i∈Ii \in I and 0≤u,v<r0 \le u, v < r✦, and the LL-directions of a shift scheme are the triples (b,u,j)(b, u, j) with b∈Bb \in B, 0≤u<r0 \le u < r and j∈ℤ/sbj \in \mathbb{Z}/s_b.✦ An XX-direction (i,u,v)(i, u, v) is attached to an LL-direction (b,u′,j)(b, u', j) when i is a label of b,u′=u,j=cb(i)+v in ℤ/sb,i \text{ is a label of } b, \qquad u' = u, \qquad j = c_b(i) + v \ \text{ in } \mathbb{Z}/s_b,(3)✦ and the link of the scheme is the bipartite graph of this relation.✦

For marked line data with r>0r > 0, the shift scheme at VV has the block indices as blocks, the block b=(z,ϵ)b = (z, \epsilon) having size sbs_b, the labels of the block at bb with coordinates cb=αbc_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✦.

The directions at a vertex of KK are the ends of the edges there: at OO, the left and the right edges✦; at VV, the XX-directions and the LL-directions of the scheme at VV✦; at WW, those of the scheme at WW✦. The link of all directions is the disjoint union of three graphs: at OO the complete bipartite graph between left and right edges, at VV and at WW the links of the two shift schemes.✦ The direction δ(e)\delta(e) of an oriented edge ee is its end at its target: Lb,u,j−1L_{b,u,j}^{-1} and Rb,v,k−1R_{b,v,k}^{-1} give themselves at OO, Lb,u,jL_{b,u,j} gives (b,u,j)(b, u, j) at VV and Rb,v,kR_{b,v,k} gives (b,v,k)(b, v, k) at WW, while xiuv−1x_{iuv}^{-1} gives (i,u,v)(i, u, v) at VV and xiuvx_{iuv} gives (i,v,u)(i, v, u) at WW.✦

Angles are measured in units of π/5\pi/5, so that π\pi is 55. Each direction carries the angle ω\omega of a triangle corner at its vertex: 33 at OO and 11 at VV and WW, so the angles of a triangle sum to 55.✦

A walk pp in a graph is reduced when no step immediately reverses the previous one: the vertices of pp at positions nn and n+2n + 2 differ whenever n+2n + 2 is at most the length |p||p| of pp.✦

Triangular Fillings

For permutations σ\sigma and φ\varphi of a finite set DD, write c(σ)c(\sigma) for the number of cycles of σ\sigma, fixed points included✦, and k(σ,φ)k(\sigma, \varphi) for the number of components, the classes of the equivalence relation on DD generated by lying in a common cycle of σ\sigma or of φ\varphi.✦ The pair (σ,φ)(\sigma, \varphi) is a planar map when c(σ)+c(φ)+c(σφ)=|D|+2k(σ,φ);c(\sigma) + c(\varphi) + c(\sigma\varphi) = |D| + 2\,k(\sigma, \varphi);(4)✦ when σ\sigma is an involution on the set of edges of the map and φ\varphi is the permutation around its faces, the equation (4) is an Euler count saying that every component has genus zero.

A triangular filling of a word (e1,…,en)(e_1, \dots, e_n) of oriented edges of KK is a finite set DD of darts with a fixed-point-free involution σ\sigma, a permutation φ\varphi forming a planar map with σ\sigma, a labelling λ\lambda of the darts by oriented edges of KK and a boundary, a list of distinct darts d1,…,dnd_1, \dots, d_n, such that for every dart dd we have λ(σd)=λ(d)−1\lambda(\sigma d) = \lambda(d)^{-1} and the edge λ(φd)\lambda(\varphi d) starts where λ(d)\lambda(d) ends, φ\varphi acts on the boundary as the cycle d1↦⋯↦dn↦d1d_1 \mapsto \cdots \mapsto d_n \mapsto d_1 with λ(dk)=ek\lambda(d_k) = e_k, and every other dart in a component that meets the boundary lies in a cycle of φ\varphi of length three whose labels, read along φ\varphi, form a triangle face of KK.✦ A word is fillable when it has a triangular filling.✦

The Claim

Definition 1. A family (guv)u,v∈ι(g_{uv})_{u, v \in \iota} of elements of a group FF, indexed by pairs from a set ι\iota, has surviving rectangles when guvgu′v−1gu′v′guv′−1≠1for all u≠u′ and v≠v′ in ι.g_{uv}\, g_{u'v}^{-1}\, g_{u'v'}\, g_{uv'}^{-1} \neq 1 \qquad \text{for all } u \neq u' \text{ and } v \neq v' \text{ in } \iota.(5)✦

Theorem 1. Let block presentation data be given, with complex KK and presented group GG. For every block b∈Bb \in B, every label ii of its Cartesian block and all indices 0≤u,v<r0 \le u, v < r, the triangle relation holds: xiuv=Lb,u,αb(i)+v−1Rb,v,βb(i)+u.x_{iuv} = L_{b,u,\alpha_b(i)+v}^{-1}\, R_{b,v,\beta_b(i)+u}.(6)✦ For every label ii and all indices 0≤u,u′,v,v′<r0 \le u, u', v, v' < r with xiuvxiu′v−1xiu′v′xiuv′−1=1x_{iuv}\,x_{iu'v}^{-1}\,x_{iu'v'}\,x_{iuv'}^{-1} = 1 in GG, the word (xiuv,xiu′v−1,xiu′v′,xiuv′−1)(x_{iuv}, x_{iu'v}^{-1}, x_{iu'v'}, x_{iuv'}^{-1}) is fillable: it has a triangular filling whose boundary darts carry (λ(d1),λ(d2),λ(d3),λ(d4))=(xiuv,xiu′v−1,xiu′v′,xiuv′−1).\bigl(\lambda(d_1), \lambda(d_2), \lambda(d_3), \lambda(d_4)\bigr) = \bigl(x_{iuv},\ x_{iu'v}^{-1},\ x_{iu'v'},\ x_{iuv'}^{-1}\bigr).(7)✦

Let marked line data with r>0r > 0 be given. They have rectangular nontriviality: in the group GG of the fixed presentation, the middle generators of every label have surviving rectangles, xiuvxiu′v−1xiu′v′xiuv′−1≠1for every label i,u≠u′ and v≠v′.x_{iuv}\,x_{iu'v}^{-1}\,x_{iu'v'}\,x_{iuv'}^{-1} \neq 1 \qquad \text{for every label } i,\ u \neq u' \text{ and } v \neq v'.(8)✦ For a label ii, indices u≠u′u \neq u' and v≠v′v \neq v', and two oriented edges ee and ff of the rectangle loop of ii, uu, u′u', vv, v′v' such that ff starts where ee ends, every reduced walk pp in the link of all directions from δ(f−1)\delta(f^{-1}) to δ(e)\delta(e), of length |p||p|, satisfies ω(δ(e))|p|≥5.\omega(\delta(e))\,|p| \ge 5.(9)✦

In the paper, the result reads: with geg_e the based loop of an oriented edge ee, the triangles give giuv=gL−1gRg_{iuv} = g_L^{-1} g_R, and the rectangular words giuvgiu′v−1giu′v′giuv′−1g_{iuv}\,g_{iu'v}^{-1}\,g_{iu'v'}\,g_{iuv'}^{-1} with u≠u′u \neq u' and v≠v′v \neq v' are different from 11, where giuvg_{iuv}, gLg_L and gRg_R stand for the page’s xiuvx_{iuv}, Lb,u,αb(i)+vL_{b,u,\alpha_b(i)+v} and Rb,v,βb(i)+uR_{b,v,\beta_b(i)+u}.

What Is Checked

The claim is stated over block presentation data, with the complex KK, its oriented edges and triangle faces, the presented group GG and triangular fillings of words; and over marked line data with r>0r > 0, with the fixed presentation, the shift schemes at VV and WW, the link of all directions with its angles, and reduced walks.

Beyond the claim, the library shows that marked line data have a regular point✦, and that the shift schemes at VV and WW meet the two conditions of a shift scheme: the labels of the block at (z,ϵ)(z, \epsilon) lie in I(z)I(z)✦, and two blocks at the same regular point that share a label are equal✦.