OctoInformBeta

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

Lemma 4.2: For the cell incidence graph of a subdivided presentation complex with two fixed relators

The height kernel is residually finite.

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 fixed presentation complex has generators x,yx,y and relator words w0,w1w_0,w_1 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)✦ A signed letter is a pair (a,ε)(a,\varepsilon), where a∈{x,y}a\in\{x,y\} and ε∈{+1,−1}\varepsilon\in\{+1,-1\} specifies its sign.

The subdivided rose has vertex set RR consisting of a common vertex v*v_* and two interior vertices va,0,va,1v_{a,0},v_{a,1} for each a∈{x,y}a\in\{x,y\}.✦ The circle edges of the subdivided rose form the set C={ca,j:a∈{x,y},0≤j<3}C=\{c_{a,j}:a\in\{x,y\},\ 0\leq j<3\}.✦ Their initial and terminal vertices are specified by (2): ca,0:v*→va,0,ca,1:va,0→va,1,ca,2:va,1→v*.c_{a,0}:v_*\longrightarrow v_{a,0},\qquad c_{a,1}:v_{a,0}\longrightarrow v_{a,1},\qquad c_{a,2}:v_{a,1}\longrightarrow v_*.(2) Write init⁡(c)\operatorname{init}(c) and term⁡(c)\operatorname{term}(c) for the initial and terminal vertices of a circle edge cc.

For a relator label r∈{0,1}r\in\{0,1\}, the boundary polygon length brb_r is three times the number of letters in wrw_r.✦ A polygon sector is a pair (r,i)(r,i) in the set SS of (3): br=3|wr|,S={(r,i):r∈{0,1},0≤i<br}.b_r=3|w_r|,\qquad S=\{(r,i):r\in\{0,1\},\ 0\leq i<b_r\}.(3)✦ The successor s+s^+ of a sector s=(r,i)s=(r,i) is the sector with the same relator label and its index increased by one modulo brb_r, as in (4): s+=(r,(i+1)mod⁡br).s^+=(r,(i+1)\bmod b_r).(4) The sector relator letter ℓ(s)=(a(s),ε(s))\ell(s)=(a(s),\varepsilon(s)) is the signed letter of wrw_r at position ⌊i/3⌋\lfloor i/3\rfloor, counting positions from zero.✦

The boundary circle edge c(s)c(s) and initial rose vertex u(s)u(s) of a sector s=(r,i)s=(r,i) are defined by (5); here imod⁡3i\bmod 3 is the nonnegative remainder: c(s)={ca(s),imod⁡3,ε(s)=+1,ca(s),2−(imod⁡3),ε(s)=−1,u(s)={init⁡(c(s)),ε(s)=+1,term⁡(c(s)),ε(s)=−1.\begin{aligned} c(s)&= \begin{cases} c_{a(s),\,i\bmod 3},&\varepsilon(s)=+1,\\ c_{a(s),\,2-(i\bmod 3)},&\varepsilon(s)=-1, \end{cases}\\ u(s)&= \begin{cases} \operatorname{init}(c(s)),&\varepsilon(s)=+1,\\ \operatorname{term}(c(s)),&\varepsilon(s)=-1. \end{cases} \end{aligned}(5)

Adjoin cone vertices q0,q1q_0,q_1 and radial edges dsd_s indexed by sectors s∈Ss\in S. The vertex set VV, edge set EE, and cell set 𝒞\mathcal C of the presentation complex are the disjoint unions in (6); each sector also indexes a triangular cell: V=R⊔{q0,q1},E=C⊔{ds:s∈S},𝒞=V⊔E⊔S.V=R\sqcup\{q_0,q_1\},\qquad E=C\sqcup\{d_s:s\in S\},\qquad \mathcal C=V\sqcup E\sqcup S.(6) The endpoint set V(e)V(e) of an edge e∈Ee\in E is the finite subset of VV given by (7), with s=(r,i)s=(r,i): V(c)={init⁡(c),term⁡(c)}(c∈C),V(ds)={qr,u(s)}.V(c)=\{\operatorname{init}(c),\operatorname{term}(c)\}\quad(c\in C), \qquad V(d_s)=\{q_r,u(s)\}.(7)✦ The edge set E(s)E(s) and vertex set V(s)V(s) of a triangular sector ss are the finite sets in (8): E(s)={c(s),ds,ds+},V(s)=⋃e∈E(s)V(e).E(s)=\{c(s),d_s,d_{s^+}\},\qquad V(s)=\bigcup_{e\in E(s)}V(e).(8)

The proper face incidence relation a≺ba\prec b on the cells of 𝒞\mathcal C is the relation specified by (9): a≺b⇔{a∈V(b),a∈V,b∈E,a∈V(b),a∈V,b∈S,a∈E(b),a∈E,b∈S,false,otherwise.a\prec b\quad\Longleftrightarrow\quad \begin{cases} a\in V(b),&a\in V,\ b\in E,\\ a\in V(b),&a\in V,\ b\in S,\\ a\in E(b),&a\in E,\ b\in S,\\ \text{false},&\text{otherwise}. \end{cases}(9) The cell incidence graph LL is the simple graph with vertex set 𝒞\mathcal C in which two cells are adjacent when either is a proper face of the other.✦

Let P=ALP=A_L be the right-angled Artin group of LL. The height homomorphism λ:P→ℤ\lambda:P\longrightarrow\mathbb Z sends each standard generator to 11. The Artin height kernel GG is the subgroup of PP in (10): G=ker⁡λ={g∈P:λ(g)=0}.G=\ker\lambda=\{g\in P:\lambda(g)=0\}.(10)✦

A group Γ\Gamma is residually finite if every nonidentity element g∈Γg\in\Gamma has nonidentity image under some homomorphism φ:Γ→Q\varphi:\Gamma\longrightarrow Q to a finite group QQ.

The Claim

Theorem 1. For the fixed cell incidence graph LL and the height homomorphism λ\lambda on P=ALP=A_L, the height kernel GG satisfies G is residually finite.G\text{ is residually finite}.(11)✦

In the paper, the result reads: the right-angled Artin group associated to any finite commutation graph is residually finite; in particular, PP and GG are residually finite.

What Is Checked

The assertion (11) concerns the kernel of the standard height homomorphism on the right-angled Artin group of this fixed cell incidence graph LL.