OctoInformBeta

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

§4 (proof of Theorem 4.1): prescribed boundary phases: Opposite slot phases across bands realize prescribed totals at the boundary labels

Connected boundary adjacency realizes zero-sum phases.

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

In a disk and band assembly, a boundary phase prescribes the total of real slot phases along a boundary component. Slots paired across a band must carry opposite phases.

Let DD be a finite set of slots and ZZ a finite set of boundary labels. A boundary assignment b:D→Zb\colon D\to Z is a function from the slot set DD to the boundary label set ZZ. The disk successor σ\sigma is a permutation of DD; the band pairing θ\theta is an involution of DD, so θ(θd)=d\theta(\theta d)=d for every d∈Dd\in D. The boundary permutation is σθ\sigma\theta.

The oriented dual adjacency ∼\sim on ZZ is the relation defined by (1): x∼y⇔there is d∈D with b(d)=x and b(θd)=y.x\sim y \quad\Longleftrightarrow\quad \text{there is }d\in D\text{ with }b(d)=x\text{ and }b(\theta d)=y.(1)✦ The reachability relation ⤳\leadsto on ZZ is the relation in which x⤳yx\leadsto y means that a finite sequence of directed adjacency steps joins xx to yy, allowing a sequence of length zero. The dual adjacency relation ∼\sim on ZZ is connected when x⤳yx\leadsto y for every x,y∈Zx,y\in Z.

The Claim

Theorem 1. Suppose that bb is surjective, that b(σ(θd))=b(d)b(\sigma(\theta d))=b(d) for every d∈Dd\in D, and that any two slots can be joined by a finite sequence of moves d↦σdd\mapsto\sigma d or d↦θdd\mapsto\theta d. Then x⤳y(x,y∈Z).x\leadsto y\qquad(x,y\in Z).(2)✦

Let b:D→Zb\colon D\to Z be any boundary assignment, with ZZ nonempty, and let θ\theta be an involution whose dual adjacency is connected. For real boundary phases ηz\eta_z satisfying ∑z∈Zηz=0\sum_{z\in Z}\eta_z=0, there is a function γ:D→ℝ\gamma\colon D\to\mathbb R such that γθd=−γd(d∈D),∑d∈Db(d)=zγd=ηz(z∈Z).\gamma_{\theta d}=-\gamma_d\quad(d\in D), \qquad \sum_{\substack{d\in D\\b(d)=z}}\gamma_d=\eta_z\quad(z\in Z).(3)✦

In the paper, the result reads: for a connected assembly the dual graph on boundary cycles is connected, and every assignment of real boundary phases ηz\eta_z with ∑zηz=0\sum_z\eta_z=0 admits slot phases γd\gamma_d with γθd=−γd\gamma_{\theta d}=-\gamma_d and ∑d∈zγd=ηz\sum_{d\in z}\gamma_d=\eta_z.

What Is Checked

The statements (2) and (3) concern finite slot and boundary sets, a boundary assignment, and a band involution, with a disk successor and connected slot moves in (2), and connected dual adjacency and a nonempty boundary set in (3).