OctoInformBeta

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

Lemma 3.5: On finite groups with an invertible extra relator boundary, ordinary relators can be solved under explicit numerical bounds

A comparison estimate permits controlled label extensions.

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

Prescribing labels on one alphabet of edges leaves the extra edge labels as unknowns. Ordinary relators impose exact product equations at every vertex, while distinguished words measure the holonomy to be kept small.

Let Γ\Gamma be a group, UU an alphabet and v:U→Γv:U\to\Gamma a value assignment. For a vertex gg of Γ\Gamma and a letter uu of UU, the based edge (g,u)(g,u) is an edge from gg to gv(u)gv(u); different letters remain distinct when their values agree. Write 𝔽(U)\mathbb F(U) for the free group on UU. The label group H=SU(2)H=\mathrm{SU}(2) consists of the norm-one quaternions in ℍ\mathbb H, and distance from the identity means the chord norm ∥h−1∥\|h-1\|.✦

For labels c:Γ×U→Hc:\Gamma\times U\to H, the semidirect label homomorphism ℓc:𝔽(U)→(Γ→H)⋊Γ\ell_c:\mathbb F(U)\to(\Gamma\to H)\rtimes\Gamma is the homomorphic extension specified in (1), with the shift action of Γ\Gamma on functions.✦ For a word w∈𝔽(U)w\in\mathbb F(U) and a vertex g∈Γg\in\Gamma, the path holonomy Lc(w,g)∈HL_c(w,g)\in H is the value at gg of the function component of ℓc(w)\ell_c(w): ℓc(u)=(c(⋅,u),v(u)),Lc(w,g)=pr⁡1(ℓc(w))(g).\ell_c(u)=\bigl(c(\,\cdot\,,u),v(u)\bigr), \qquad L_c(w,g)=\operatorname{pr}_1\bigl(\ell_c(w)\bigr)(g).(1) Products follow traversal order, and reverse traversal uses the inverse edge label. Let SS and TT be alphabets. For assignments a:Γ×S→Ha:\Gamma\times S\to H and b:Γ×T→Hb:\Gamma\times T\to H, the combined assignment a∪b:Γ×(S⊔T)→Ha\cup b:\Gamma\times(S\sqcup T)\to H uses aa on SS and bb on TT.✦

The based chain module C(Γ,U)=ℤ(Γ×U)C(\Gamma,U)=\mathbb Z^{(\Gamma\times U)} is the free abelian group with basis eg,ue_{g,u} indexed by based labelled edges.✦ The path chain [w]gv∈C(Γ,U)[w]^v_g\in C(\Gamma,U) counts the traversals of each edge along ww from gg, with reverse traversals counted negatively; c(e)c(e) denotes the coefficient of an edge ee in a chain cc.✦

For v:S⊔T→Γv:S\sqcup T\to\Gamma and words ri∈𝔽(S⊔T)r_i\in\mathbb F(S\sqcup T) indexed by RR, the relator boundary ∂r:C(Γ,R)→C(Γ,S⊔T)\partial_r:C(\Gamma,R)\to C(\Gamma,S\sqcup T), extra edge projection πT:C(Γ,S⊔T)→C(Γ,T)\pi_T:C(\Gamma,S\sqcup T)\to C(\Gamma,T) and extra relator boundary Er:C(Γ,R)→C(Γ,T)E_r:C(\Gamma,R)\to C(\Gamma,T) are the integral linear maps given by (2): ∂r(eg,i)=[ri]gv,πT(eg,u)={0,u∈S,eg,u,u∈T,Er=πT∘∂r.\partial_r(e_{g,i})=[r_i]^v_g, \qquad \pi_T(e_{g,u})= \begin{cases} 0,&u\in S,\\ e_{g,u},&u\in T, \end{cases} \qquad E_r=\pi_T\circ\partial_r.(2)

Words with Coefficients

Let JJ be a coefficient alphabet and ξ1,…,ξm\xi_1,\ldots,\xi_m variable letters. For paths αj:ℝ→H\alpha_j:\mathbb R\to H and a family u=(ui)i∈Ku=(u_i)_{i\in K}, with KK finite, of words on J⊔{ξ1,…,ξm}J\sqcup\{\xi_1,\ldots,\xi_m\}, the coefficient word map 𝒲uα:ℝ×Hm→HK\mathcal W_u^\alpha:\mathbb R\times H^m\to H^K sends an input (t,x)(t,x), with x=(x1,…,xm)∈Hmx=(x_1,\ldots,x_m)\in H^m, to the tuple obtained by evaluating coefficient letters at αj(t)\alpha_j(t) and variable letters at xkx_k.✦ Coefficient erasure ε\varepsilon is the homomorphism from the free group on J⊔{ξ1,…,ξm}J\sqcup\{\xi_1,\ldots,\xi_m\} to the free group on the variable letters that sends each coefficient letter to 11 and fixes each ξk\xi_k.✦ For mm words w=(w1,…,wm)w=(w_1,\ldots,w_m), the exponent sum matrix M(w)M(w) is the integer matrix whose (i,k)(i,k) entry is the total signed exponent of ξk\xi_k after erasure, as in (3): 𝒲uα(t,x)i=ui((αj(t))j∈J,x1,…,xm),M(w)ik=exp⁡ξk(ε(wi)).\mathcal W_u^\alpha(t,x)_i=u_i\bigl((\alpha_j(t))_{j\in J},x_1,\ldots,x_m\bigr), \qquad M(w)_{ik}=\operatorname{exp}_{\xi_k}\bigl(\varepsilon(w_i)\bigr).(3) The norm ∥y−1∥∞\|y-1\|_\infty for a finite tuple in HH is the supremum of its coordinate chord distances from 11.

The Claim

Theorem 1. Let w1,…,wmw_1,\ldots,w_m and u1,…,udu_1,\ldots,u_d be coefficient words as above. Suppose each αj\alpha_j is smooth as a quaternion-valued function, αj(0)=1\alpha_j(0)=1, det⁡M(w)≠0\det M(w)\ne0 and δ>0\delta>0. Assume that, for 0≤t≤10\le t\le1, every solution of 𝒲wα(t,x)=1\mathcal W_w^\alpha(t,x)=1 has ∥𝒲uα(t,x)−1∥∞≠δ\|\mathcal W_u^\alpha(t,x)-1\|_\infty\ne\delta. Then sublevel word solvability gives an x∈Hmx\in H^m satisfying (4): 𝒲wα(1,x)=1,∥𝒲uα(1,x)−1∥∞<δ.\mathcal W_w^\alpha(1,x)=1, \qquad \|\mathcal W_u^\alpha(1,x)-1\|_\infty<\delta.(4)✦

Let Γ,D\Gamma,D be groups, v:S⊔T→Γv:S\sqcup T\to\Gamma a value assignment and ri∈𝔽(S⊔T)r_i\in\mathbb F(S\sqcup T) a family indexed by RR. Suppose Er:C(Γ,R)→C(Γ,T)E_r:C(\Gamma,R)\to C(\Gamma,T) is an integral linear isomorphism. For every homomorphism q:Γ→Dq:\Gamma\to D and injection j:I↪D×Rj:I\hookrightarrow D\times R with II finite, write j(i)=(gi,βi)j(i)=(g_i,\beta_i). There is an injection e:I↪D×Te:I\hookrightarrow D\times T giving the nonzero finite boundary minor (5): det⁡((πT[rβi]giq∘v)(e(k)))i,k∈I≠0.\det\left( \bigl(\pi_T[r_{\beta_i}]^{q\circ v}_{g_i}\bigr)(e(k)) \right)_{i,k\in I}\ne0.(5)✦

Let FF be a finite group with values v:S⊔T→Fv:S\sqcup T\to F, ordinary words ri∈𝔽(S⊔T)r_i\in\mathbb F(S\sqcup T) indexed by RR, distinguished words ρz∈𝔽(S⊔T)\rho_z\in\mathbb F(S\sqcup T) indexed by ZZ, and words ζz∈𝔽(S)\zeta_z\in\mathbb F(S), also regarded as words on S⊔TS\sqcup T. Let A⊆BA\subseteq B be finite subsets of RR, and suppose Er:C(F,R)→C(F,T)E_r:C(F,R)\to C(F,T) is an integral linear isomorphism. Suppose C≥0C\ge0, δ>0\delta>0 and 0<η<10<\eta<1 satisfy (6): C(δ+η)<12,Cη<δ2.C(\delta+\eta)<\tfrac12, \qquad C\eta<\tfrac\delta2.(6) Assume the comparison estimate (7) holds for all z∈Zz\in Z and g∈Fg\in F whenever h≥0h\ge0 and a full label assignment cc satisfies ∥c(g,s)−1∥≤η\|c(g,s)-1\|\le\eta on SS, Lc(ri,g)=1L_c(r_i,g)=1 for i∈Ai\in A, and ∥Lc(ρz,g)−1∥≤h\|L_c(\rho_z,g)-1\|\le h at every base vertex: ∥Lc(ζz,g)−Lc(ρz,g)∥≤C(η+h)h,∥Lc(ζz,g)−1∥≤Cη.\begin{aligned} \|L_c(\zeta_z,g)-L_c(\rho_z,g)\|&\le C(\eta+h)h,\\ \|L_c(\zeta_z,g)-1\|&\le C\eta. \end{aligned}(7) For every prescribed assignment a:F×S→Ha:F\times S\to H with ∥a(g,s)−1∥<η\|a(g,s)-1\|<\eta, there is an assignment b:F×T→Hb:F\times T\to H satisfying the finite group comparison conclusion (8): La∪b(ri,g)=1(i∈B,g∈F),∥La∪b(ρz,g)−1∥<δ(z∈Z,g∈F).\begin{aligned} L_{a\cup b}(r_i,g)&=1 &&(i\in B,\ g\in F),\\ \|L_{a\cup b}(\rho_z,g)-1\|&<\delta &&(z\in Z,\ g\in F). \end{aligned}(8)✦

In the paper, the result reads: for any finite quotient FF of Γ\Gamma, arbitrary prescribed SS-edge labels at distance less than η\eta from 11, and any finite B⊆RB\subseteq R containing AA, there are labels on all TT-edges such that La∪b(ri,g)=1L_{a\cup b}(r_i,g)=1 for i∈Bi\in B and all g∈Fg\in F, while max⁡z∈Z,g∈F∥La∪b(ρz,g)−1∥<δ\max_{z\in Z,\,g\in F}\|L_{a\cup b}(\rho_z,g)-1\|<\delta, with an empty maximum interpreted as zero.

What Is Checked

The assertions are stated over integral projected relator boundaries and quaternionic word evaluation, with a boundary isomorphism for (5) and (8), smooth coefficient paths and a nonsingular exponent sum matrix for (4), and the uniform estimate (7) with the bounds (6) for (8).