OctoInformBeta

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

§5 (proof of Theorem 1.1): normalizing the relator: Equality in A*⟨t⟩A * \langle t\rangle for a group AA and infinite cyclic ⟨t⟩\langle t\rangle; at least two syllables, identity coefficients allowed

Words admit presentations with unit exponents.

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 an arbitrary group and let H=A*⟨t⟩H=A*\langle t\rangle, where ⟨t⟩\langle t\rangle is infinite cyclic.✦ The normalization problem asks for exponents of absolute value one in a syllable presentation of a prescribed word in HH.

The exponent sum p:H→ℤp:H\to\mathbb Z is the homomorphism determined by (1), with AA identified with its canonical image in HH. p(a)=0(a∈A),p(t)=1.p(a)=0\quad(a\in A),\qquad p(t)=1.(1)

Syllable Presentations

A syllable list ℓ=((s1,a1),…,(sn,an))\ell=((s_1,a_1),\ldots,(s_n,a_n)) over AA is a finite ordered list in ℤ×A\mathbb Z\times A, of length n≥0n\geq0.

The evaluation W(ℓ)W(\ell) of a syllable list ℓ\ell is the element of HH given by the ordered product in (2); the empty product is 11. W(ℓ)=∏i=1ntsiai=ts1a1⋯tsnan.W(\ell)=\prod_{i=1}^{n}t^{s_i}a_i =t^{s_1}a_1\cdots t^{s_n}a_n.(2)✦

A syllable list ℓ=((s1,a1),…,(sn,an))\ell=((s_1,a_1),\ldots,(s_n,a_n)) over AA with unit exponents is a finite ordered list in ℤ×A\mathbb Z\times A whose integer entries satisfy (3). si∈{1,−1}(1≤i≤n).s_i\in\{1,-1\}\qquad(1\leq i\leq n).(3)✦

The Claim

Theorem 1. Let ww be an element of HH. There is a syllable list ℓ\ell with unit exponents whose length and evaluation satisfy (4). |ℓ|≥2,W(ℓ)=w.|\ell|\geq2,\qquad W(\ell)=w.(4)✦

In the paper, the result reads: a word ww with p(w)=1p(w)=1 or p(w)=−1p(w)=-1 can be cyclically conjugated to begin with a letter tt or t−1t^{-1}, after which its tt-powers can be split into individual letters, giving the cyclic form used in §4 with identity coefficients allowed.

What Is Checked

The statement is over the free product of an arbitrary coefficient group AA with ⟨t⟩\langle t\rangle, and the evaluation of finite syllable lists in that free product.