OctoInformBeta

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

Blocks, the complex K and its triangles: For r≥1r \ge 1, sets of 4r24r^2 or more labels do; the blocks give the triangles of KK, whose presented group GG embeds in π1(K,O)\pi_1(K,O)

Large label sets split into two Cartesian blocks.

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

Fix a prime qq and let P=𝔽q20P = \mathbb{F}_q^{20}. The group GG of this item is built from a finite family of lines in PP, each with a marked point on it. At every point zz outside a finite exceptional set EE, the labels of the lines through zz, away from their marked points, are arranged in two rectangular grids whose sides are at least a fixed integer rr. Each label in a grid, with each pair of indices u,v∈{0,…,r−1}u, v \in \{0, \ldots, r-1\}, gives a triangle of a combinatorial 22-complex KK with three vertices OO, VV and WW. The group GG is presented on the edges of KK and compared with the fundamental group of KK at OO.

Cartesian Blocks

A Cartesian block bb with parameter rr is a finite set IbI_b of labels together with positive integers sb,tb≥rs_b, t_b \ge r and a bijection Ib→ℤ/sb×ℤ/tb,i↦(αb(i),βb(i)),I_b \to \mathbb{Z}/s_b \times \mathbb{Z}/t_b, \qquad i \mapsto (\alpha_b(i), \beta_b(i)),(1)✦ The pair (αb(i),βb(i))(\alpha_b(i), \beta_b(i)) gives the coordinates of the label ii.

A two-block partition of a finite set AA of labels, with parameter rr, is a pair of Cartesian blocks with parameter rr, block 00 and block 11, whose sets of labels are disjoint and cover AA: I0∩I1=∅,I0∪I1=A.I_0 \cap I_1 = \emptyset, \qquad I_0 \cup I_1 = A.(2)✦

Marked Lines

Marked line data, for the prime qq and an integer rr, consist of a set S⊂𝔽qS \subset \mathbb{F}_q of ⌊q/100⌋\lfloor q/100 \rfloor scalars; a finite set of NN labels, each label ii carrying a mark ai∈S20a_i \in S^{20} and a direction [vi][v_i], the class of a nonzero vector vi∈Pv_i \in P in the projective space of PP, with distinct labels carrying distinct marks; and a finite set E⊂PE \subset P of exceptional points. A point z∈Pz \in P is incident to a label ii when it lies on the punctured line ℓi\{ai}\ell_i \setminus \{a_i\}, where ℓi\ell_i is the line through aia_i in the direction [vi][v_i]✦, and I(z)I(z) is the set of labels incident to zz: ℓi={ai+xvi:x∈𝔽q},I(z)={i:z∈ℓi\{ai}}.\ell_i = \{\, a_i + x\,v_i : x \in \mathbb{F}_q \,\}, \qquad I(z) = \{\, i : z \in \ell_i \setminus \{a_i\} \,\}.(3)✦

Marked line data satisfy the degree condition and the budget, |I(z)|≥4r2for z∉E,4(2q20+r|E|)<rN,|I(z)| \ge 4r^2 \quad \text{for } z \notin E, \qquad 4\,(2q^{20} + r\,|E|) < rN,(4)✦ and the girth condition: every cycle in the bipartite incidence graph, whose vertices are the points of PP and the labels, with zz adjacent to ii when zz is incident to ii, has length greater than 1212.

A point of PP outside EE is regular.✦ For r≥1r \ge 1 and a regular point zz, the chosen partition of I(z)I(z) is a two-block partition of I(z)I(z) with parameter rr, fixed once for each zz and written I(z)=Iz0⊔Iz1.I(z) = I_z^0 \sqcup I_z^1.(5)✦

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 chosen partition at zz, with its coordinates αb\alpha_b, βb\beta_b and side lengths sbs_b, tbt_b: Ib=Izϵ,b=(z,ϵ).I_b = I_z^{\epsilon}, \qquad b = (z, \epsilon).(6)✦

The Complex and Its Group

Block presentation data with parameter rr, over a set II of labels and a set BB of block indices, consist of a Cartesian block Ib⊂II_b \subset I with parameter rr for each b∈Bb \in B, 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 three vertices OO, VV and WW and the oriented edges xiuv:V→W,Lb,u,j:O→V,Rb,v,k:O→W,x_{iuv}\colon V \to W, \qquad L_{b,u,j}\colon O \to V, \qquad R_{b,v,k}\colon O \to W,(7) the middle, left and right edges, for i∈Ii \in I, b∈Bb \in B, 0≤u,v<r0 \le u, v < r, j∈ℤ/sbj \in \mathbb{Z}/s_b and k∈ℤ/tbk \in \mathbb{Z}/t_b.

For b∈Bb \in B, a label i∈Ibi \in I_b and indices 0≤u,v<r0 \le u, v < r, the triangle 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}(8)✦ of the free group on the edges of KK, with αb(i)+v\alpha_b(i)+v taken modulo sbs_b and βb(i)+u\beta_b(i)+u modulo tbt_b. Read from OO, it is the boundary of a triangle of KK with sides Lb,u,αb(i)+vL_{b,u,\alpha_b(i)+v}, xiuvx_{iuv} and Rb,v,βb(i)+uR_{b,v,\beta_b(i)+u}, and KK has one such triangle for each (b,i,u,v)(b, i, u, v).

The presented group GG of block presentation data has one generator for each edge of KK✦; its relators are the triangle words and the two tree edges Lb0,u0,0L_{b_0,u_0,0} and Rb0,u0,0R_{b_0,u_0,0}, which join OO to VV and OO to WW and form a spanning tree of the 11-skeleton: $$G = \bigl\langle\, \text{the edges of } K \;\mathrel{\big|}\; \text{the words } \eqref{eq:claim6},\ L_{b_0,u_0,0},\ R_{b_0,u_0,0} \,\bigr\rangle.$$(9)✦

The fundamental groupoid of KK is the free groupoid on its 11-skeleton, the directed graph with vertices OO, VV, WW and edges (7), modulo the relations that identify, for each triangle, the path along Lb,u,αb(i)+vL_{b,u,\alpha_b(i)+v} followed by xiuvx_{iuv} with the path along Rb,v,βb(i)+uR_{b,v,\beta_b(i)+u}.✦ The fundamental group π1(K,O)\pi_1(K, O) is the group of loops at OO in this groupoid, with concatenation as product.✦

Write TVT_V and TWT_W for the paths along the tree edges Lb0,u0,0L_{b_0,u_0,0} and Rb0,u0,0R_{b_0,u_0,0}. The homomorphism ϕ:G→π1(K,O)\phi\colon G \to \pi_1(K, O) sends each edge to a loop at OO through the tree: ϕ(xiuv)=TVxiuvTW−1,ϕ(Lb,u,j)=Lb,u,jTV−1,ϕ(Rb,v,k)=Rb,v,kTW−1.\phi(x_{iuv}) = T_V\, x_{iuv}\, T_W^{-1}, \qquad \phi(L_{b,u,j}) = L_{b,u,j}\, T_V^{-1}, \qquad \phi(R_{b,v,k}) = R_{b,v,k}\, T_W^{-1}.(10)✦

The fixed presentation of marked line data with r≥1r \ge 1 is the block presentation data over its labels with block indices, blocks, base block and base index $$B = (P \setminus E) \times \{0, 1\}, \qquad b \mapsto I_b \text{ as in } \eqref{eq:claim5}, \qquad b_0 = (z_0, 0), \qquad u_0 = 0,$$(11)✦ where z0z_0 is a regular point fixed once.

The Claim

Theorem 1. Let r≥1r \ge 1.

  1. Every integer d≥4r2d \ge 4r^2 can be written as d=rn1+(r+1)n2d = r\,n_1 + (r+1)\,n_2(12)✦ with integers n1≥rn_1 \ge r and r≤n2<2rr \le n_2 < 2r.

  2. Every finite set AA of labels with |A|≥4r2|A| \ge 4r^2 is the disjoint union A=I0⊔I1A = I_0 \sqcup I_1(13)✦ of two Cartesian blocks I0I_0 and I1I_1 with parameter rr.

  3. For block presentation data with parameter rr, the homomorphism ϕ\phi of (10) is injective: ϕ:G↪π1(K,O).\phi\colon G \hookrightarrow \pi_1(K, O).(14)✦

In the paper, the result reads: for z∉Ez \notin E, the set I(z)I(z) is split into two blocks IbI_b with |Ib|=sbtb|I_b| = s_b t_b, sb,tb≥rs_b, t_b \ge r and a bijection i↦(αb(i),βb(i))∈ℤ/sb×ℤ/tbi \mapsto (\alpha_b(i), \beta_b(i)) \in \mathbb{Z}/s_b \times \mathbb{Z}/t_b, the complex KK has vertices OO, VV, WW, edges xiuv:V→Wx_{iuv}\colon V \to W, Lb,u,j:O→VL_{b,u,j}\colon O \to V and Rb,v,k:O→WR_{b,v,k}\colon O \to W, and a triangle with sides 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} and angles 33, 11, 11 at OO, VV, WW in units of π/5\pi/5, and G=π1(K,O)G = \pi_1(K, O).

What Is Checked

The theorem is stated over Cartesian blocks with parameter rr and over arbitrary block presentation data, with their complex KK, presented group GG (9), fundamental group π1(K,O)\pi_1(K, O) and homomorphism ϕ\phi (10); the fixed presentation (11) of marked line data, built from the chosen partitions (5), is such data.

The library also proves that marked line data always have a regular point✦, and that the assignment (10) sends every relator of GG, each triangle word and each tree edge, to the trivial loop at OO.