OctoInformBeta

OpenAI preprint, September 2026 · Completion of the proof

Completion of the proof: Finite generation and residual finiteness coexist with integral cohomological dimension two and a three-dimensional classifying space

A height kernel without a two-dimensional classifying space.

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 question is whether a particular Artin height kernel admits a two-dimensional classifying space. Its defining graph comes from a subdivided presentation complex. The presentation relators are the words w0,w1w_0,w_1 in the free group on x,yx,y given by (1). w0=x2y−5,w1=x2(yx−1)3.w_0=x^2y^{-5},\qquad w_1=x^2(yx^{-1})^3.(1)✦

The subdivided rose has a common vertex *\ast and two interior vertices vℓ,0,vℓ,1v_{\ell,0},v_{\ell,1} for each circle label ℓ∈{x,y}\ell\in\{x,y\}.✦ Its circle edges eℓ,ie_{\ell,i}, with i∈{0,1,2}i\in\{0,1,2\}, have the initial and terminal vertices displayed in (2). *→eℓ,0vℓ,0→eℓ,1vℓ,1→eℓ,2*.\ast\xrightarrow{e_{\ell,0}}v_{\ell,0} \xrightarrow{e_{\ell,1}}v_{\ell,1} \xrightarrow{e_{\ell,2}}\ast.(2)

For ρ∈{0,1}\rho\in\{0,1\}, the boundary polygon length is mρ=3|wρ|m_\rho=3|w_\rho|, where the bars denote word length.✦ A polygon sector is a pair s=(ρ,i)s=(\rho,i) with 0≤i<mρ0\leq i<m_\rho✦; its next sector s+s^+ has index i+1i+1 modulo mρm_\rho.✦ The sector relator letter is the signed letter of wρw_\rho at position ⌊i/3⌋\lfloor i/3\rfloor.✦ If its circle label is ℓ\ell, the sector boundary edge is eℓ,imod⁡3e_{\ell,i\bmod 3} for a positive letter and eℓ,2−(imod⁡3)e_{\ell,2-(i\bmod 3)} for a negative letter.✦ The sector initial vertex is the initial endpoint of this edge for a positive letter and its terminal endpoint for a negative letter.✦

The presentation complex vertices consist of the rose vertices and two cone vertices c0,c1c_0,c_1.✦ Its edges consist of the circle edges and a radial edge for every sector s=(ρ,i)s=(\rho,i), with endpoints cρc_\rho and the sector initial vertex. The triangular sector ss has as edges its boundary circle edge and the radial edges indexed by ss and s+s^+✦; its vertices are all their endpoints.✦ The presentation complex cells are the disjoint union of these vertices, edges and triangular sectors.✦ Proper face incidence consists precisely of these vertex-edge, vertex-triangle and edge-triangle incidences.✦ The cell incidence graph LL is the simple graph with these cells as vertices, joining two cells when one is a proper face of the other.✦

The ambient right-angled Artin group PP, its height homomorphism λ\lambda and the source group GG are defined in (3); here xvx_v denotes the standard Artin generator corresponding to a vertex vv of LL. P=AL,λ:P→ℤ,λ(xv)=1,G=ker⁡λ.P=A_L,\qquad \lambda:P\longrightarrow\mathbb Z,\qquad \lambda(x_v)=1,\qquad G=\ker\lambda.(3)

For a group Γ\Gamma and a nonnegative integer nn, an ordinary classifying space XX of dimension at most nn is a path-connected Hausdorff cell complex with the closure-finiteness and weak-topology (CW) properties, no cells above dimension nn, a point x∈Xx\in X and an isomorphism π1(X,x)≅Γ\pi_1(X,x)\cong\Gamma, admitting a surjective covering map E→XE\to X from a contractible space EE.✦ Write 𝒦n(Γ)\mathcal K_n(\Gamma) for the collection of these spaces, allowing any number of cells. The integral cohomological dimension cd⁡ℤΓ\operatorname{cd}_{\mathbb Z}\Gamma of a group Γ\Gamma is the projective dimension of the trivial left module ℤ\mathbb Z over the integral group ring Λ=ℤ[Γ]\Lambda=\mathbb Z[\Gamma], as in (4). cd⁡ℤΓ=pd⁡Λℤ.\operatorname{cd}_{\mathbb Z}\Gamma =\operatorname{pd}_{\Lambda}\mathbb Z.(4)✦

Presentations and Boundary Bases

Let SS be a generator alphabet for a group Γ\Gamma, with assigned values v:S→Γv:S\to\Gamma; distinct letters may have the same value. For g∈Γg\in\Gamma and s∈Ss\in S, the edge eg,se_{g,s} labelled ss runs from gg to gv(s)gv(s). The based edge chain group C1(Γ,S)C_1(\Gamma,S) is the free abelian group on these edges.✦ The edge boundary and the Cayley cycle module Z1(v)Z_1(v) are defined by (5), where es=e1,se_s=e_{1,s} and vertices are identified with the usual basis of ℤ[Γ]\mathbb Z[\Gamma]. C1(Γ,S)=ℤ[Γ×S],∂eg,s=gv(s)−g,∂es=v(s)−1,Z1(v)=ker⁡∂.\begin{aligned} C_1(\Gamma,S)&=\mathbb Z[\Gamma\times S],& \partial e_{g,s}&=gv(s)-g,\\ \partial e_s&=v(s)-1,& Z_1(v)&=\ker\partial. \end{aligned}(5)

Word evaluation ev⁡v:F(S)→Γ\operatorname{ev}_v:F(S)\to\Gamma is the homomorphism from the free group extending vv.✦ A genuine presentation of a group Γ\Gamma consists of a generator alphabet SS, assigned values v:S→Γv:S\to\Gamma and a relator family r:R→F(S)r:R\to F(S) satisfying (6); the double angle brackets denote normal closure in F(S)F(S). ev⁡v(F(S))=Γ,ev⁡v(ri)=1(i∈R),ker⁡ev⁡v=⟨⟨ri:i∈R⟩⟩.\operatorname{ev}_v(F(S))=\Gamma,\qquad \operatorname{ev}_v(r_i)=1\quad(i\in R),\qquad \ker\operatorname{ev}_v=\langle\!\langle r_i:i\in R\rangle\!\rangle.(6)

The signed based path chain [w]g∈C1(Γ,S)[w]_g\in C_1(\Gamma,S) of a word w∈F(S)w\in F(S) is the sum of its traversed edges from gg, with negative coefficients for reverse traversals.✦ The relator boundary map is the integral linear map specified on based relators by (7). ∂r:ℤ[Γ×R]→C1(Γ,S),∂r(eg,i)=[ri]g.\partial_r:\mathbb Z[\Gamma\times R]\longrightarrow C_1(\Gamma,S), \qquad \partial_r(e_{g,i})=[r_i]_g.(7)✦

A genuine boundary-basis presentation of a group Γ\Gamma is a genuine presentation of Γ\Gamma whose relator boundary map is an isomorphism of abelian groups onto its Cayley cycle module, as in (8). Let ℬ(Γ)\mathcal B(\Gamma) be the collection of these presentations, with arbitrary generator alphabets and relator index sets. ∂r:ℤ[Γ×R]→≅Z1(v).\partial_r:\mathbb Z[\Gamma\times R]\xrightarrow{\ \cong\ }Z_1(v).(8)

Level Labels

The unit quaternion group H=SU(2)H=\mathrm{SU}(2) consists of the quaternions of norm one; its distance from the identity is the chord norm ∥h−1∥ℍ\|h-1\|_{\mathbb H}.✦ For edge labels b:Γ×S→Hb:\Gamma\times S\to H, path holonomy is the product of labels along a word’s Cayley path in traversal order, with inverses for reverse traversals.✦ The semidirect label homomorphism is the homomorphism F(S)→HΓ⋊ΓF(S)\to H^\Gamma\rtimes\Gamma, for the shift action, sending ss to (b(⋅,s),v(s))(b(\cdot,s),v(s)); its function component evaluated at gg is the path holonomy based at gg.

For a graph LL on VV, let λ\lambda be the height homomorphism on its right-angled Artin group sending every standard generator to 11. For a nonnegative integer NN, the negative integral level P−NP_{-N} and its terminal-vertex map tqrt_{qr} are defined by (9). P−N={g∈AL:λ(g)=−N},tqr(g)=gxqxr−1(q,r∈V).P_{-N}=\{g\in A_L:\lambda(g)=-N\},\qquad t_{qr}(g)=gx_qx_r^{-1}\quad(q,r\in V).(9) A directed level walk is a finite sequence of steps g→tqr(g)g\to t_{qr}(g) with qq and rr adjacent in LL, retaining every ordered pair (q,r)(q,r), including parallel edges.✦ The empty walk stays at its initial vertex. For labels a:P−N×V×V→Ha:P_{-N}\times V\times V\to H, the labelled walk holonomy Hol⁡a(p)\operatorname{Hol}_a(p) is the product of the labels of the walk pp in traversal order; the empty product is 11.✦

A graph LL admits arbitrarily small nontrivial level transport if, for every real ε>0\varepsilon>0, there are an integer N>1N>1, labels a:P−N×V×V→Ha:P_{-N}\times V\times V\to H and a closed directed level walk pp satisfying (10). The first two conditions range over all g∈P−Ng\in P_{-N} and q,r∈Vq,r\in V. The third ranges over all triples of terminal-vertex steps with gj+1=tqjrj(gj)g_{j+1}=t_{q_jr_j}(g_j) for j=0,1,2j=0,1,2 and g3=g0g_3=g_0. a(tqr(g),r,q)=a(g,q,r)−1,∥a(g,q,r)−1∥ℍ<ε,a(g0,q0,r0)a(g1,q1,r1)a(g2,q2,r2)=1,Hol⁡a(p)≠1.\begin{aligned} a(t_{qr}(g),r,q)&=a(g,q,r)^{-1},\\ \|a(g,q,r)-1\|_{\mathbb H}&<\varepsilon,\\ a(g_0,q_0,r_0)a(g_1,q_1,r_1)a(g_2,q_2,r_2)&=1,\\ \operatorname{Hol}_a(p)&\ne1. \end{aligned}(10)

The Claim

Theorem 1. Let LL be any graph admitting arbitrarily small nontrivial level transport. Its height kernel satisfies the boundary-basis obstruction (11). ℬ(ker⁡λ)=⌀.\mathcal B(\ker\lambda)=\varnothing.(11)✦ For the source group GG, the presentation obstruction is (12), and the classifying-space obstruction is (13). ℬ(G)=⌀.\mathcal B(G)=\varnothing.(12)✦ 𝒦2(G)=⌀.\mathcal K_2(G)=\varnothing.(13)✦ The source group has the properties in (14). G is finitely generated and residually finite,cd⁡ℤG=2,𝒦3(G)≠⌀.\begin{gathered} G\text{ is finitely generated and residually finite},\\ \operatorname{cd}_{\mathbb Z}G=2,\qquad \mathcal K_3(G)\ne\varnothing. \end{gathered}(14)✦

What Is Checked

The transport obstruction is stated over arbitrary graphs and genuine presentations; its source instances concern the height kernel of the specified cell incidence graph and ordinary CW classifying spaces.

The terminal-vertex map preserves each negative integral level.