OctoInformBeta

OpenAI preprint, September 2026 · §5. From a coefficient relation to a planar surface

§5 (proof of Theorem 1.1): realizing conjugate products and removing components: Finite realizations of conjugate products and triviality of coefficient relations for unimodular relators

From coefficient relations to planar ribbons.

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

Let AA be a group and H=A*⟨t⟩H=A*\langle t\rangle, with coefficient inclusion ι:A→H\iota:A\to H.✦ For w∈Hw\in H, write ⟨⟨w⟩⟩H\langle\!\langle w\rangle\!\rangle_H for its normal closure. A coefficient relation is an element g∈Ag\in A sent to the identity by the canonical coefficient map in (1): ι‾w:A→H/⟨⟨w⟩⟩H,g↦ι(g)⟨⟨w⟩⟩H.\bar\iota_w:A\longrightarrow H/\langle\!\langle w\rangle\!\rangle_H, \qquad g\longmapsto\iota(g)\langle\!\langle w\rangle\!\rangle_H.(1) The generator tt of the infinite cyclic group ⟨t⟩\langle t\rangle corresponds to 1∈ℤ1\in\mathbb Z.

Relator data consist of a position set II, a permutation ρ\rho of II, coefficients a:I→Aa:I\to A and integer exponents s:I→ℤs:I\to\mathbb Z. When II is finite and nonempty and ρ\rho has one cycle, put n=|I|n=|I|, choose an enumeration i1,…,ini_1,\ldots,i_n following ρ\rho without repetitions, and put aj=a(ij)a_j=a(i_j) and sj=s(ij)s_j=s(i_j). The associated cyclic word is (2); identity coefficients are allowed. w=ts1ι(a1)⋯tsnι(an).w=t^{s_1}\iota(a_1)\cdots t^{s_n}\iota(a_n).(2) The exponent sum p:H→ℤp:H\to\mathbb Z is the homomorphism that kills ι(A)\iota(A) and sends tt to 11. The word ww is unimodular when p(w)∈{1,−1}p(w)\in\{1,-1\}.

Ribbon Diagrams

For permutations σ,θ\sigma,\theta of a finite dart set DD, the permutation cycles of a permutation π\pi are the equivalence classes for lying in the same cycle; write c(π)c(\pi) for their number. The ribbon components of (D,σ,θ)(D,\sigma,\theta) are the classes of the least equivalence relation on DD containing the same-cycle relations of σ\sigma and θ\theta; write bb for their number. The ribbon graph (D,σ,θ)(D,\sigma,\theta) is planar when (3) holds, where the boundary permutation σθ\sigma\theta applies θ\theta first: c(σ)+c(θ)+c(σθ)=|D|+2b.c(\sigma)+c(\theta)+c(\sigma\theta)=|D|+2b.(3) A closed permutation walk (o;L)(o;L) for σ\sigma, with L=(d1,…,dq)L=(d_1,\ldots,d_q), is a list (o,d1,…,dq,o)(o,d_1,\ldots,d_q,o) in which consecutive darts x,yx,y satisfy σ(x)=y\sigma(x)=y.✦

Let VV be a disk set with integer orientations ε:V→ℤ\varepsilon:V\to\mathbb Z. The oriented vertex successor N:V×I→V×IN:V\times I\to V\times I and signed vertex coefficient C:V×I→AC:V\times I\to A are defined by (4): N(v,i)={(v,ρi),εv=1,(v,ρ−1i),εv≠1,C(v,i)={ai,εv=1,aρ−1i−1,εv≠1.\begin{aligned} N(v,i)&=\begin{cases}(v,\rho i),&\varepsilon_v=1,\\ (v,\rho^{-1}i),&\varepsilon_v\ne1,\end{cases}\\ C(v,i)&=\begin{cases}a_i,&\varepsilon_v=1,\\ a_{\rho^{-1}i}^{-1},&\varepsilon_v\ne1.\end{cases} \end{aligned}(4) For a sign function τ:D→ℤ\tau:D\to\mathbb Z, a relator disk atlas in (D,σ,τ)(D,\sigma,\tau) is a family of disjoint relator disks with an injection e:V×I↪De:V\times I\hookrightarrow D and polarities εv∈{1,−1}\varepsilon_v\in\{1,-1\} satisfying (5): σ(e(v,i))=e(N(v,i)),τ(e(v,i))=εvsi.\sigma(e(v,i))=e(N(v,i)),\qquad \tau(e(v,i))=\varepsilon_v s_i.(5)

For coefficient labels u:D→Au:D\to A, the corner coefficient γ:D→A\gamma:D\to A is defined by (6): γ(d)=u(θd)u(σd)−1.\gamma(d)=u(\theta d)u(\sigma d)^{-1}.(6)✦ A finite planar relator ribbon rr consists of finite sets D,VD,V, permutations σ,θ\sigma,\theta satisfying (3), signs τ:D→ℤ\tau:D\to\mathbb Z, labels u:D→Au:D\to A, and a relator disk atlas, subject to (7). The outside walk (o;L)(o;L) of a finite planar relator ribbon rr is a closed permutation walk for σ\sigma with distinct darts o,d1,…,dqo,d_1,\ldots,d_q, and τ(dj)∈{1,−1}\tau(d_j)\in\{1,-1\} for every entry of LL. Write O=(o,d1,…,dq)O=(o,d_1,\ldots,d_q), also denoting its set of entries. θ2=id,τ(θd)=−τ(d),θ(o)=o,τ(o)=0,γ(e(v,i))=C(v,i),e(V×I)∩O=⌀,D=e(V×I)∪O∪{d∈D:σd=d=θd}.\begin{gathered} \theta^2=\mathrm{id},\qquad \tau(\theta d)=-\tau(d),\qquad \theta(o)=o,\qquad \tau(o)=0,\\ \gamma(e(v,i))=C(v,i),\qquad e(V\times I)\cap O=\varnothing,\\ D=e(V\times I)\cup O\cup\{d\in D:\sigma d=d=\theta d\}. \end{gathered}(7) For signs τ\tau and coefficients c:D→Ac:D\to A, the dart letter λτ,c(d)∈H\lambda_{\tau,c}(d)\in H and dart word evaluation Eτ,c(L)∈HE_{\tau,c}(L)\in H are the ordered products in (8): λτ,c(d)=tτ(d)ι(c(d)),Eτ,c(d1,…,dq)=λτ,c(d1)⋯λτ,c(dq).\lambda_{\tau,c}(d)=t^{\tau(d)}\iota(c(d)),\qquad E_{\tau,c}(d_1,\ldots,d_q)=\lambda_{\tau,c}(d_1)\cdots\lambda_{\tau,c}(d_q).(8) The outside boundary word v(r)∈Hv(r)\in H and the set ℛρ,a,s\mathcal R_{\rho,a,s} of words having a finite planar realization are defined in (9): v(r)=Eτ,γ(O),ℛρ,a,s={y∈H:some finite planar relator ribbon r has v(r)=y}.v(r)=E_{\tau,\gamma}(O),\qquad \mathcal R_{\rho,a,s}=\{y\in H:\text{some finite planar relator ribbon }r \text{ has }v(r)=y\}.(9)

The Claim

Theorem 1. Suppose II is finite and nonempty, ρ\rho has one cycle, and each sis_i is 11 or −1-1. For the cyclic word ww in (2), w∈ℛρ,a,s.w\in\mathcal R_{\rho,a,s}.(10)✦ For arbitrary relator data, let y,z∈Hy,z\in H have finite planar realizations for those data, and let x∈Hx\in H. Then yz∈ℛρ,a,s,yz\in\mathcal R_{\rho,a,s},(11)✦ y−1∈ℛρ,a,s,y^{-1}\in\mathcal R_{\rho,a,s},(12)✦ xyx−1∈ℛρ,a,s.xyx^{-1}\in\mathcal R_{\rho,a,s}.(13)✦

Suppose II is finite and nonempty, ρ\rho has one cycle, each sis_i is 11 or −1-1, and ∑i∈Isi∈{1,−1}\sum_{i\in I}s_i\in\{1,-1\}. Let g∈Ag\in A. For a finite planar relator ribbon rr with v(r)=ι(g)v(r)=\iota(g), g=1.g=1.(14)✦ For a coefficient word ι(g)\iota(g) having a finite planar realization, g=1.g=1.(15)✦ For the cyclic word ww in (2), if ι(g)∈⟨⟨w⟩⟩H\iota(g)\in\langle\!\langle w\rangle\!\rangle_H, then g=1.g=1.(16)✦

In the paper, the result reads: a finite conjugate product gives a planar disk-and-band relation, and removing innermost components with trivial inner boundary words makes their exterior words trivial by Theorem 4.1, with repetition leaving g=1g=1.

What Is Checked

The realization statements (10), (11), (12) and (13) concern finite dart and disk sets with the prescribed relator data, and the coefficient statements (14), (15) and (16) impose the single-cycle and unimodularity conditions on nonempty finite position sets with signs in {1,−1}\{1,-1\}.