OctoInformBeta

OpenAI preprint, September 2026 · §3. Comparison with an arbitrary aspherical presentation

§3 (setting): Edge boundaries and translated relator chains for an arbitrary group alphabet

Words give transport and integral chains.

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

An alphabet mapped to a group gives a directed graph whose paths are read as words. Comparing presentations uses both noncommutative transport along these paths and integral edge chains.

Let Γ\Gamma be a group, let SS be a set of letters, and let v:S→Γv:S\to\Gamma assign their group values. Distinct letters remain distinct even when their values agree. Write F(S)F(S) for the free group on SS, and let r:R→F(S)r:R\to F(S) be a family of chosen words, indexed by a set RR. The vertex chain group is C0=⨁g∈ΓℤδgC_0=\bigoplus_{g\in\Gamma}\mathbb Z\delta_g, where δg\delta_g is the basis vector at gg.

Let HH be a group and a:Γ×S→Ha:\Gamma\times S\to H a labeling of the positively oriented edges, with the edge indexed by (g,s)(g,s) running from gg to gv(s)gv(s); quaternion labels take values in H=SU(2)H=\mathrm{SU}(2), the unit quaternion group. The group Γ\Gamma acts on the group HΓH^\Gamma of functions by (γ⋅f)(g)=f(gγ)(\gamma\cdot f)(g)=f(g\gamma). The semidirect label homomorphism ℒa\mathcal L_a is the homomorphism determined by (1): ℒa:F(S)→HΓ⋊Γ,ℒa(s)=(a(⋅,s),v(s)).\mathcal L_a:F(S)\longrightarrow H^\Gamma\rtimes\Gamma, \qquad \mathcal L_a(s)=\bigl(a(\,\cdot\,,s),v(s)\bigr).(1)✦

For a word w=s1ε1⋯snεnw=s_1^{\varepsilon_1}\cdots s_n^{\varepsilon_n} with εi∈{1,−1}\varepsilon_i\in\{1,-1\} and a starting vertex gg, set g0=gg_0=g and gi=gi−1v(si)εig_i=g_{i-1}v(s_i)^{\varepsilon_i}. The initial vertex bib_i of the corresponding positively oriented edge is gi−1g_{i-1} when εi=1\varepsilon_i=1 and gig_i when εi=−1\varepsilon_i=-1. Write pr⁡1\operatorname{pr}_1 for the function component of an element of HΓ⋊ΓH^\Gamma\rtimes\Gamma.

The Definition

Definition 1. For the group Γ\Gamma, alphabet map vv, edge labels aa, and chosen words rr above, word evaluation ev⁡v\operatorname{ev}_v is the homomorphism from the free group on the alphabet to the group specified in (2): ev⁡v:F(S)→Γ,ev⁡v(w)=∏i=1nv(si)εi.\operatorname{ev}_v:F(S)\longrightarrow\Gamma, \qquad \operatorname{ev}_v(w)= \prod_{i=1}^{n}v(s_i)^{\varepsilon_i}.(2)✦

The group C1C_1 of based integral edge chains is the free abelian group in (3), whose basis vector at (g,s)(g,s) is denoted by e(g,s)e_{(g,s)}: C1=⨁(g,s)∈Γ×Sℤe(g,s).C_1=\bigoplus_{(g,s)\in\Gamma\times S}\mathbb Z e_{(g,s)}.(3)✦

The edge boundary ∂1\partial_1 from the edge chain group to the vertex chain group is the homomorphism of abelian groups specified on the basis by (4): ∂1:C1→C0,∂1e(g,s)=δgv(s)−δg.\partial_1:C_1\longrightarrow C_0, \qquad \partial_1 e_{(g,s)}=\delta_{gv(s)}-\delta_g.(4)✦

The cycle module Z1Z_1 is the subgroup of edge chains with zero boundary, as in (5): Z1=ker⁡∂1⊆C1.Z_1=\ker\partial_1\subseteq C_1.(5)✦

The path label product Aa(w,g)∈HA_a(w,g)\in H is defined by (6), with factors ordered by increasing ii: Aa(w,g)=pr⁡1(ℒa(w))(g)=∏i=1na(bi,si)εi.A_a(w,g)=\operatorname{pr}_1\bigl(\mathcal L_a(w)\bigr)(g) =\prod_{i=1}^{n}a(b_i,s_i)^{\varepsilon_i}.(6)✦

The signed path chain [w]g∈C1[w]_g\in C_1 based at gg is defined by (7): [w]g=∑i=1nεie(bi,si).[w]_g=\sum_{i=1}^{n}\varepsilon_i e_{(b_i,s_i)}.(7)✦

The relator-chain map ∂2\partial_2 is the homomorphism of abelian groups in (8), where E(g,ρ)E_{(g,\rho)} denotes the basis vector indexed by (g,ρ)(g,\rho): ∂2:⨁(g,ρ)∈Γ×RℤE(g,ρ)→C1,∂2E(g,ρ)=[r(ρ)]g.\partial_2:\bigoplus_{(g,\rho)\in\Gamma\times R} \mathbb Z E_{(g,\rho)}\longrightarrow C_1, \qquad \partial_2 E_{(g,\rho)}=[r(\rho)]_g.(8)✦

In the paper, the result reads: Γ\Gamma has a finite generating alphabet SS retaining distinct letters with the same group value, generator edges run from gg to gv(s)gv(s), Λ=ℤ[Γ]\Lambda=\mathbb Z[\Gamma] acts on the left, the edge boundary sends es=e(1,s)e_s=e_{(1,s)} to v(s)−1v(s)-1, [w]=[w]1[w]=[w]_1 is the signed edge chain based at 11, all words and chains have finite support, and products of HH-labels follow traversal order with inverse labels on reverse edges.

What Is Checked

These definitions are stated over an arbitrary group Γ\Gamma, sets SS and RR, an alphabet map v:S→Γv:S\to\Gamma, a family r:R→F(S)r:R\to F(S) of words, and edge labels a:Γ×S→Ha:\Gamma\times S\to H in a group HH.