OctoInformBeta

OpenAI preprint, September 2026 · §4. An acyclic level model for a height kernel

Lemma 4.1: Integral chain contractions and a flat quaternion connection on a finite cell incidence graph

An acyclic complex with nontrivial transport.

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

Consider integral simplicial chains and quaternion transport on the cell incidence graph of a subdivided presentation complex. The label group is the group of unit quaternions H=SU(2)H=\mathrm{SU}(2).✦

Let x,yx,y generate a free group. The relator words and the presentation group QQ are given by (1): r1=x2y−5,r2=x2(yx−1)3,Q=⟨x,y∣r1,r2⟩.r_1=x^2y^{-5},\qquad r_2=x^2(yx^{-1})^3,\qquad Q=\langle x,y\mid r_1,r_2\rangle .(1) The subdivided rose has a common vertex oo, two interior vertices vq,0v_{q,0} and vq,1v_{q,1} on each circle q∈{x,y}q\in\{x,y\}, and edges eq,0,eq,1,eq,2e_{q,0},e_{q,1},e_{q,2} following that circle in order from oo back to oo. Write RR for its vertex set. For r=1,2r=1,2, subdivide the relator boundary into NrN_r edges, where NrN_r is three times the signed word length of rrr_r, and add a cone vertex prp_r. A sector s=(r,i)s=(r,i) of the subdivided relator boundary is a pair with r=1,2r=1,2 and 0≤i<Nr0\le i<N_r; its successor s+s^+ increases ii modulo NrN_r.✦

The boundary edge bsb_s of a sector is determined by the signed letter at position ⌊i/3⌋\lfloor i/3\rfloor of its relator. If that letter is qεq^\varepsilon, then bs=eq,kb_s=e_{q,k} for ε=1\varepsilon=1 and bs=eq,2−kb_s=e_{q,2-k} for ε=−1\varepsilon=-1, where kk is the remainder of ii modulo three.✦ Its initial vertex tst_s is the initial vertex of bsb_s in the positive case and the terminal vertex in the negative case.✦ The radial edge dsd_s joins prp_r to tst_s. The triangular sector fsf_s has edges bs,ds,ds+b_s,d_s,d_{s^+}✦, and its vertices are the union of their endpoints.✦

The cell set 𝒞\mathcal C is the disjoint union of the vertices R⊔{p1,p2}R\sqcup\{p_1,p_2\}, the circle and radial edges, and the triangular sectors.✦ Proper face incidence means that a vertex is an endpoint of an edge or a vertex of a sector, or that an edge belongs to a sector’s three edges.✦ The incidence graph Γ\Gamma has vertex set 𝒞\mathcal C and joins two cells when one is a proper face of the other.✦ Let LL be the flag complex of the incidence graph Γ\Gamma. Write a∼ba\sim b when a=ba=b or aa and bb are adjacent in Γ\Gamma.✦

Integral Chains and Quaternion Labels

Fix the cell enumeration ι:𝒞→I\iota:\mathcal C\longrightarrow I, where I={0,…,102}I=\{0,\ldots,102\} and ι(o)=0\iota(o)=0. Order the cells by their indices✦, and let ΓI\Gamma_I be the incidence graph on II transported by ι\iota.✦ Write ι*\iota_* for the induced map on augmented integral chains. An increasing clique ww in an ordered graph is an increasing list of pairwise adjacent vertices of that graph. The simplex enumerations give the integral chain groups in (2), with boundary maps ∂1,∂2\partial_1,\partial_2 and augmentation ϵ\epsilon: C2(ΓI;ℤ)=ℤ270→∂2C1(ΓI;ℤ)=ℤ372→∂1C0(ΓI;ℤ)=ℤ103→ϵℤ.C_2(\Gamma_I;\mathbb Z)=\mathbb Z^{270} \xrightarrow{\ \partial_2\ } C_1(\Gamma_I;\mathbb Z)=\mathbb Z^{372} \xrightarrow{\ \partial_1\ } C_0(\Gamma_I;\mathbb Z)=\mathbb Z^{103} \xrightarrow{\ \epsilon\ }\mathbb Z .(2) Here ϵ\epsilon sends every vertex to 11. The boundary matrices are specified by their integral rows. Write h0:C0→C1h_0:C_0\to C_1 and h1:C1→C2h_1:C_1\to C_2 for the given integral matrix maps, and h1′h'_1 for the corrected edge map formed from ∂1,h0,h1\partial_1,h_0,h_1.

An augmented integral chain contraction AA of a graph Δ\Delta is a family of homomorphisms An:Cn(Δ;ℤ)→Cn+1(Δ;ℤ)A_n:C_n(\Delta;\mathbb Z)\to C_{n+1}(\Delta;\mathbb Z), including C−1=ℤC_{-1}=\mathbb Z, satisfying (3), where ∂0=ϵ\partial_0=\epsilon: ∂n+1An+An−1∂n=id⁡Cn(Δ;ℤ)(n≥−1).\partial_{n+1}A_n+A_{n-1}\partial_n =\operatorname{id}_{C_n(\Delta;\mathbb Z)} \qquad(n\ge -1).(3) Terms below degree −1-1 are zero. Denote the set of these contractions by Con⁡(Δ;ℤ)\operatorname{Con}(\Delta;\mathbb Z).

Let η0:ℤ→C0(ΓI;ℤ)\eta_0:\mathbb Z\to C_0(\Gamma_I;\mathbb Z) send 11 to [0][0].

Let 𝒊,𝒋\mathbf i,\mathbf j be the standard quaternion units. The exponent sum matrix MM and generator quaternions X,Y∈HX,Y\in H are specified in (4): M=(2−5−13),X=𝒊,Y=1+54+12𝒊+3−58𝒋.M=\begin{pmatrix}2&-5\\-1&3\end{pmatrix},\qquad X=\mathbf i,\qquad Y=\frac{1+\sqrt5}{4}+\frac12\mathbf i+ \sqrt{\frac{3-\sqrt5}{8}}\,\mathbf j .(4) The monodromy homomorphism ρ:Q→H\rho:Q\to H sends xx to XX and yy to YY.✦

For a circle edge eq,je_{q,j}, denoted also by ee, let its free group word be qq when j=0j=0 and 11 otherwise, and let ge∈Hg_e\in H be its value under x↦X,y↦Yx\mapsto X,\ y\mapsto Y.✦ The oriented boundary word usu_s is the word of bsb_s or its inverse, according to the sign of the sector letter.✦ For each polygon the boundary word sequence lists these usu_s in sector order.✦ The radial label gsg_s is the quaternion value of the product of the first ii words in that sequence, for s=(r,i)s=(r,i).✦

For an edge ee and a triangular sector ff of 𝒞\mathcal C, the local trivializations τe,τf\tau_e,\tau_f are quaternion-valued functions on the vertices of their respective cells given by (5); a(e)a(e) denotes the initial vertex of a circle edge and the cone vertex of a radial edge: τeq,j(v)={1v=a(eq,j),geq,jotherwise,τds(v)={1v=pr,gsotherwise,τfs(v)={1v=pr,gsv≠pr,v=ts,gs+otherwise.\begin{aligned} \tau_{e_{q,j}}(v)&= \begin{cases}1&v=a(e_{q,j}),\\ g_{e_{q,j}}&\text{otherwise},\end{cases} &\tau_{d_s}(v)&= \begin{cases}1&v=p_r,\\ g_s&\text{otherwise},\end{cases}\\ \tau_{f_s}(v)&= \begin{cases} 1&v=p_r,\\ g_s&v\ne p_r,\ v=t_s,\\ g_{s^+}&\text{otherwise}. \end{cases} \end{aligned}(5) Give vertices rank zero, edges rank one and sectors rank two.✦ The ascending label u(a,b)u(a,b) and the connection c(a,b)∈Hc(a,b)\in H are defined by (6): u(v,e)=τe(v)−1,u(v,f)=τf(v)−1,u(e,f)=τf(a(e))−1,u(a,b)=1in all other cell types,c(a,b)={u(a,b)rank⁡(a)≤rank⁡(b),u(b,a)−1rank⁡(a)>rank⁡(b).\begin{aligned} u(v,e)&=\tau_e(v)^{-1},& u(v,f)&=\tau_f(v)^{-1},& u(e,f)&=\tau_f(a(e))^{-1},\\ u(a,b)&=1\quad\text{in all other cell types},\qquad& c(a,b)&= \begin{cases} u(a,b)&\operatorname{rank}(a)\le\operatorname{rank}(b),\\ u(b,a)^{-1}&\operatorname{rank}(a)>\operatorname{rank}(b). \end{cases} \end{aligned}(6) For a cell path γ=(a0,…,am)\gamma=(a_0,\ldots,a_m), its transport Hol⁡c(γ)\operatorname{Hol}_c(\gamma) is the product c(a0,a1)⋯c(am−1,am)c(a_0,a_1)\cdots c(a_{m-1},a_m) in traversal order. The subdivided xx loop is the closed path β\beta in (7): β=(o,ex,0,vx,0,ex,1,vx,1,ex,2,o).\beta=(o,e_{x,0},v_{x,0},e_{x,1},v_{x,1},e_{x,2},o).(7)✦

The Claim

Theorem 1. For the incidence graph and the chain maps above, Γis connected.\Gamma\ \text{is connected}.(8)✦ The indexed augmented chains have the contraction K=(η0,h0,h1′,0,…)∈Con⁡(ΓI;ℤ).K=(\eta_0,h_0,h'_1,0,\ldots) \in\operatorname{Con}(\Gamma_I;\mathbb Z).(9)✦ For every A∈Con⁡(ΓI;ℤ)A\in\operatorname{Con}(\Gamma_I;\mathbb Z), contraction transport along the cell enumeration gives ι*−1Aι*∈Con⁡(Γ;ℤ).\iota_*^{-1}A\iota_*\in\operatorname{Con}(\Gamma;\mathbb Z).(10)✦ Every increasing clique ww in Γ\Gamma satisfies |w|≤3.|w|\le 3.(11)✦ For the exponent sum matrix and the monodromy, det⁡M=1,\det M=1,(12)✦ ρ(x)≠1.\rho(x)\ne 1.(13)✦ For pairwise related cells a,b,da,b,d, the connection satisfies c(a,b)c(b,d)=c(a,d).c(a,b)c(b,d)=c(a,d).(14)✦ Its transport around the subdivided xx loop satisfies Hol⁡c(β)≠1.\operatorname{Hol}_c(\beta)\ne 1.(15)✦

In the paper, the result reads: there is a finite, connected, two-dimensional flag simplicial complex LL with vanishing reduced integral homology and a nontrivial homomorphism α:π1(L)→SU(2)\alpha:\pi_1(L)\to\mathrm{SU}(2).

What Is Checked

The graph assertions (8) and (11) concern the incidence relation on the explicit cell set 𝒞\mathcal C. The contractions (9) and (10) use augmented integral chains. The matrix and monodromy assertions (12) and (13) concern the two relators of QQ. For (14) and (15), the connection has the quaternion labels of (6), and the closed path is (7).

The edge enumeration recovers each edge’s index from its endpoints.✦ For an indexed triangle (a,b,d)(a,b,d), the three listed edges have endpoints (b,d),(a,d),(a,b)(b,d),(a,d),(a,b) in that order.✦ The indexed increasing cliques also have length at most three.✦ The cell enumeration ι\iota sends every increasing clique of Γ\Gamma to an increasing clique of ΓI\Gamma_I. The inverse cell enumeration ι−1\iota^{-1} sends every increasing clique of ΓI\Gamma_I to an increasing clique of Γ\Gamma.