OctoInformBeta

OpenAI preprint, September 2026 · §4. A planar surface cannot have one nontrivial boundary

Theorem 4.1 [Planar boundary theorem]: Boundary and corner statements for connected signed disk configurations with unimodular exponent sum

A sole planar boundary defect vanishes.

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 boundary components of disks joined by bands carry products in a coefficient group AA. The disk coefficients and the directions in which bands meet the disks determine these products.

Let II and KK be finite sets, write n=|I|n=|I| and k=|K|k=|K|, and take a permutation ρ\rho of II, coefficients ai∈Aa_i\in A, and signs si∈{1,−1}s_i\in\{1,-1\} with ∑i∈Isi∈{1,−1}\sum_{i\in I}s_i\in\{1,-1\}. When ρ\rho is a single cycle, number II in its cyclic order. Let tt generate an infinite cyclic group; the associated unimodular word is (1), and identity coefficients are allowed. w=ts1a1⋯tsnan.w=t^{s_1}a_1\cdots t^{s_n}a_n.(1)

Let K+K_+ and K−K_- be the positive and negative copies of KK, with q+q^+ and q−q^- denoting the copies of q∈Kq\in K; the signed slot set DD in (2) has one slot for each i∈Ii\in I on each signed disk. D=(K+⊔K−)×I.D=(K_+\sqcup K_-)\times I.(2) The disk successor σ\sigma is the permutation advancing around each signed disk, and the traversal sign sD:D→ℤs_D:D\to\mathbb Z records its direction at a slot, as in (3). σ(q+,i)=(q+,ρi),σ(q−,i)=(q−,ρ−1i),sD(q+,i)=si,sD(q−,i)=−si.\begin{aligned} \sigma(q^+,i)&=(q^+,\rho i),& \sigma(q^-,i)&=(q^-,\rho^{-1}i),\\ s_D(q^+,i)&=s_i,&s_D(q^-,i)&=-s_i. \end{aligned}(3) The incidence coefficient λ:D→A\lambda:D\to A is the inverse geometric corner label defined by (4). λ(q+,i)=ai−1,λ(q−,i)=aρ−1i.\lambda(q^+,i)=a_i^{-1},\qquad \lambda(q^-,i)=a_{\rho^{-1}i}.(4)✦ A band pairing θ\theta of DD is an involution reversing traversal signs: θ2=id\theta^2=\mathrm{id} and sD(θd)=−sD(d)s_D(\theta d)=-s_D(d).

For a permutation π\pi of a finite set EE, labels b:E→Ab:E\to A, a nonnegative integer rr, and a slot d∈Ed\in E, the circuit weight Wπ,b(r,d)∈AW_{\pi,b}(r,d)\in A is the product of the first rr labels encountered from dd, with the last encountered label on the left, defined by (5). Wπ,b(0,d)=1,Wπ,b(r+1,d)=b(πrd)Wπ,b(r,d).W_{\pi,b}(0,d)=1,\qquad W_{\pi,b}(r+1,d)=b(\pi^r d)W_{\pi,b}(r,d).(5)✦ Let ZZ index boundary circuits, with positive lengths ℓz\ell_z, and let e:∐z∈Zℤ/ℓzℤ→De:\coprod_{z\in Z}\mathbb Z/\ell_z\mathbb Z\longrightarrow D be a bijection; write ez(j)=e(z,j)e_z(j)=e(z,j). Such a bijection is a boundary enumeration when σθez(j)=ez(j+1)\sigma\theta e_z(j)=e_z(j+1). The boundary product Bz∈AB_z\in A is the circuit weight in (6). Bz=Wσθ,λ∘θ(ℓz,ez(0)).B_z=W_{\sigma\theta,\lambda\circ\theta}(\ell_z,e_z(0)).(6)

Ribbon Components and Corners

For a permutation π\pi of a finite slot set EE, its cycle set 𝒞(π)\mathcal C(\pi) is the set of equivalence classes under lying in the same π\pi-cycle✦, and its cycle count is c(π)=|𝒞(π)|c(\pi)=|\mathcal C(\pi)|.✦ The class count of an equivalence relation ∼\sim on EE is |E/∼||E/{\sim}|.✦ For permutations σ,θ\sigma,\theta of EE, ribbon components are the equivalence classes generated by the cycles of σ\sigma and θ\theta; let κ(σ,θ)\kappa(\sigma,\theta) be their number.✦ A pair of permutations σ,θ\sigma,\theta of a finite slot set EE is connected when any two slots belong to the same ribbon component, and planar when the cycle counts satisfy (7). c(σ)+c(θ)+c(σθ)=|E|+2κ(σ,θ).c(\sigma)+c(\theta)+c(\sigma\theta) =|E|+2\kappa(\sigma,\theta).(7) For permutations σ,θ\sigma,\theta of a finite slot set EE and a function u:E→Au:E\to A, the corner coefficient Cσ,θ,u:E→AC_{\sigma,\theta,u}:E\to A is the function defined by (8). Cσ,θ,u(d)=u(θd)u(σd)−1.C_{\sigma,\theta,u}(d)=u(\theta d)u(\sigma d)^{-1}.(8)✦

For the relator corner statement, take a finite vertex set VV, orientations εv∈{1,−1}\varepsilon_v\in\{1,-1\}, and a bijection e:V×I→Ee:V\times I\longrightarrow E. The oriented vertex successor ν\nu is the permutation of V×IV\times I given in (9), and the signed vertex coefficient α:V×I→A\alpha:V\times I\to A is the function given there. ν(v,i)={(v,ρi),εv=1,(v,ρ−1i),εv=−1,α(v,i)={ai,εv=1,aρ−1i−1,εv=−1.\begin{aligned} \nu(v,i)&= \begin{cases}(v,\rho i),&\varepsilon_v=1,\\ (v,\rho^{-1}i),&\varepsilon_v=-1, \end{cases}\\ \alpha(v,i)&= \begin{cases}a_i,&\varepsilon_v=1,\\ a_{\rho^{-1}i}^{-1},&\varepsilon_v=-1. \end{cases} \end{aligned}(9) The disk successor σ\sigma on EE is the permutation satisfying σ(e(v,i))=e(ν(v,i))\sigma(e(v,i))=e(\nu(v,i)), and the traversal sign η:E→ℤ\eta:E\to\mathbb Z is the function satisfying η(e(v,i))=εvsi\eta(e(v,i))=\varepsilon_v s_i; a band pairing θ\theta on EE is an involution satisfying η(θd)=−η(d)\eta(\theta d)=-\eta(d).

The Claim

Theorem 1. For the signed slots DD, suppose the disk and band moves connect any two slots, and take a boundary enumeration indexed by ZZ. Assume the Euler identity (10). |Z|+2k=2+nk.|Z|+2k=2+nk.(10) If z0∈Zz_0\in Z and Bz=1B_z=1 for every z≠z0z\ne z_0, then Bz0=1.B_{z_0}=1.(11)✦

For the corner statement on DD, suppose II and KK are nonempty, ρ\rho has a single cycle, and the ribbon data are connected and planar. Let u:D→Au:D\to A and p∈Dp\in D. If λ(d)−1=Cσ,θ,u(d)\lambda(d)^{-1}=C_{\sigma,\theta,u}(d) for every d≠pd\ne p, then λ(p)−1=Cσ,θ,u(p).\lambda(p)^{-1}=C_{\sigma,\theta,u}(p).(12)✦

For the relator corner statement on EE, suppose II is nonempty, ρ\rho has a single cycle, and the ribbon data are connected and planar. Let u:E→Au:E\to A and p∈Ep\in E. If α(v,i)=Cσ,θ,u(e(v,i))\alpha(v,i)=C_{\sigma,\theta,u}(e(v,i)) whenever e(v,i)≠pe(v,i)\ne p, then α(e−1p)=Cσ,θ,u(p).\alpha(e^{-1}p)=C_{\sigma,\theta,u}(p).(13)✦

In the paper, the result reads: let Σ\Sigma be a connected surface of genus zero constructed from a nonempty finite collection of word disks for ww and bands using every slot exactly once and joining opposite traversal signs; if every boundary word except possibly one is trivial in AA, then the remaining boundary word is trivial as well.

What Is Checked

The boundary assertion (11) is stated over finite signed slots with a complete enumeration of boundary cycles, while the corner assertions (12) and (13) are stated over connected ribbon data with planarity in the sense of (7).