OctoInformBeta

OpenAI preprint, September 2026 · Section 4. The disk identity

§4 (setting): the signed edge weight: Edge directions and a black vertex set determine contributions along a cycle

Cyclic signs and the black boundary sum.

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

An edge shared by the original network NN and the dual triangulation DD has a direction in each network. Write VV and WW for their respective vertex sets and EE for their common edge set. A directed network assigns to each edge a tail and a head.✦ The underlying simple graph of a directed network is the graph in which distinct vertices are adjacent when an edge has those endpoints, in either order.✦

Cycle coordinates CC in the underlying simple graph of DD are a cyclic list (vi)i∈ℤ/mℤ(v_i)_{i\in\mathbb Z/m\mathbb Z} of distinct vertices of WW, where m≥3m\geq3 and consecutive vertices are adjacent.✦ For each index ii, let ei∈Ee_i\in E be a chosen edge joining viv_i to vi+1v_{i+1}.✦

The gradient ∇Nf\nabla_N f of a real potential f:V→ℝf\colon V\to\mathbb R is the edge weight defined by (1). (∇Nf)(e)=f(head⁡Ne)−f(tail⁡Ne).(\nabla_N f)(e)=f(\operatorname{head}_N e)-f(\operatorname{tail}_N e).(1)✦ The outgoing edge sign σD(e,w)\sigma_D(e,w) of an edge e∈Ee\in E at a vertex w∈Ww\in W is the real number in (2). σD(e,w)={1,tail⁡De=w,−1,otherwise.\sigma_D(e,w)= \begin{cases} 1,&\operatorname{tail}_D e=w,\\ -1,&\text{otherwise}. \end{cases}(2)✦

Let B⊆VB\subseteq V be the black vertex set, and let χB:V→ℝ\chi_B\colon V\to\mathbb R be its indicator, taking value 11 on BB and 00 elsewhere. Number the three corners of a triangle cyclically by ℤ/3ℤ\mathbb Z/3\mathbb Z.

The Definition

Definition 1. For corner indices i,j∈ℤ/3ℤi,j\in\mathbb Z/3\mathbb Z, the cyclic corner sign δ(i,j)∈ℤ\delta(i,j)\in\mathbb Z is defined by (3), with addition modulo three. δ(i,j)={0,i=j,1,j=i+1,−1,otherwise.\delta(i,j)= \begin{cases} 0,&i=j,\\ 1,&j=i+1,\\ -1,&\text{otherwise}. \end{cases}(3)✦ For a black vertex set B⊆VB\subseteq V and cycle coordinates CC in DD, the black boundary sum ΔB(C)∈ℝ\Delta_B(C)\in\mathbb R is defined by (4). ΔB(C)=∑i∈ℤ/mℤ(∇NχB)(ei)σD(ei,vi).\Delta_B(C)=\sum_{i\in\mathbb Z/m\mathbb Z} (\nabla_N\chi_B)(e_i)\,\sigma_D(e_i,v_i).(4)✦

In the paper, the result reads: for adjacent vertices v,wv,w of DD, δ(v,w)\delta(v,w) is +1+1 when the black face lies to the left of traversal from vv to ww and −1-1 otherwise; it is antisymmetric, and counterclockwise sides of a bounded black triangle have weight +1+1.

What Is Checked

The definitions are stated over three cyclic corner indices and over directed networks NN and DD with a common edge set, a black subset of the vertices of NN, and cycle coordinates in the underlying simple graph of DD.

The gradient is linear: for real potentials f,g:V→ℝf,g\colon V\to\mathbb R and real scalars a,ba,b, it satisfies (5). ∇N(af+bg)=a∇Nf+b∇Ng.\nabla_N(af+bg)=a\nabla_N f+b\nabla_N g.(5)