OctoInformBeta

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

Lemma 4.1 [Disk identity]: A corner matching determines a cut and its signed boundary sum, together with an integer count identity

State cycles bound signed shores.

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 disk identity concerns simple directed cycles in the dual triangulation of a cubic bipartite graph. A matching between black triangles and corners specifies the allowed departures along a cycle; its shore boundary has a sign and a black boundary sum.

A network NN on a finite vertex set VV and finite edge set EE assigns a tail and a head to every edge.✦ The underlying simple graph of a network NN is the simple graph in which distinct vertices are adjacent whenever an edge of NN has those endpoints.✦ A simple network NN is a network with no loops and at most one edge with any given unordered pair of endpoints.✦ An edge is incident to either endpoint;✦ the star st⁡N(v)\operatorname{st}_N(v) is the set of edges incident to vv.✦ Let DD be a second network, on a finite vertex set FF and the same edge set EE.

For a vertex set SS, let 𝟏S\mathbf 1_S denote its indicator. The oriented incidence matrix 𝖨N\mathsf I_N, boundary operator ∂N\partial_N, and gradient ∇N\nabla_N have the formulas in (1), for real edge weights aa and a real vertex potential ff; use the corresponding notation for DD. 𝖨N(v,e)=𝟏{head⁡N(e)}(v)−𝟏{tail⁡N(e)}(v),(∂Na)(v)=∑e∈E𝖨N(v,e)a(e),(∇Nf)(e)=f(head⁡N(e))−f(tail⁡N(e)).\begin{aligned} \mathsf I_N(v,e) &=\mathbf 1_{\{\operatorname{head}_N(e)\}}(v) -\mathbf 1_{\{\operatorname{tail}_N(e)\}}(v),\\ (\partial_N a)(v)&=\sum_{e\in E}\mathsf I_N(v,e)a(e),& (\nabla_N f)(e)&=f(\operatorname{head}_N(e))-f(\operatorname{tail}_N(e)). \end{aligned}(1) A cycle cut duality between NN and DD is a condition on the pair of networks requiring that both underlying graphs be connected and that their real cycle and cut spaces satisfy (2). ker⁡∂N=im⁡∇D,ker⁡∂D=im⁡∇N.\ker\partial_N=\operatorname{im}\nabla_D, \qquad \ker\partial_D=\operatorname{im}\nabla_N.(2)✦

A triangle TT on an edge set JJ in DD is a cyclic list of three distinct corners and three distinct edges, with edge set JJ, whose successive corners are the endpoints of the corresponding edge.✦ Suppose NN is simple and cubic, DD is simple, and each star st⁡N(v)\operatorname{st}_N(v) is the edge set of a triangle TvT_v in DD. Write uv,ju_{v,j} for its corners and av,ja_{v,j} for its edges, with jj taken modulo three. A black class B⊆VB\subseteq V is a bipartite coloring when every edge has one black endpoint and one endpoint outside BB. Write b(e)b(e) for its black endpoint: the tail when the tail is black, and the head otherwise.✦

The outgoing edge sign σH(e,z)\sigma_H(e,z) in either network HH is +1+1 when zz is the tail of ee, and −1-1 otherwise.✦ A colored triangulation duality between NN and DD is a pair of networks with the cycle cut duality, simplicity, cubic degree, coloring and triangles just specified, satisfying the orientation compatibility in (3). (∇N𝟏{v})(av,j)=σD(av,j,uv,j).(\nabla_N\mathbf 1_{\{v\}})(a_{v,j}) =\sigma_D(a_{v,j},u_{v,j}).(3)✦

Choose a root triangle Tt0T_{t_0}. The nonroot black triangles are indexed by AA, and XX is the set of dual vertices outside the three root corners, as in (4). A=B\{t0},X=F\{ut0,0,ut0,1,ut0,2}.A=B\setminus\{t_0\}, \qquad X=F\setminus\{u_{t_0,0},u_{t_0,1},u_{t_0,2}\}.(4) A triangle system on FF, indexed by AA, is a family of ordered triples of distinct corners such that two members sharing two distinct corners have the same index.✦ The black face family on FF indexed by AA is the family of corner triples of the triangles TtT_t for t∈At\in A.✦ A triangle transversal ss of a triangle system indexed by AA onto XX is a function on AA that selects one corner of each triangle, with distinct selected corners and image exactly XX.✦ A state ss of the black face family is a triangle transversal onto XX; write s(t)s(t) for the selected vertex of TtT_t.

Cycle and Shore Notation

A simple cycle CC in the underlying graph of DD is an injective cyclic list (zi)i∈ℤ/kℤ(z_i)_{i\in\mathbb Z/k\mathbb Z} of vertices, with k≥3k\geq3 and adjacent consecutive vertices.✦ Let eie_i be the edge joining ziz_i to zi+1z_{i+1}, and let E(C)E(C) be the set of these edges. The oriented cycle flow fCf_C of CC is the real edge weight on DD given by (5), where 𝒆e\mathbf e_e is the standard edge basis vector with value one at ee and zero at other edges. fC=∑i∈ℤ/kℤσD(ei,zi)𝒆ei.f_C=\sum_{i\in\mathbb Z/k\mathbb Z}\sigma_D(e_i,z_i)\mathbf e_{e_i}.(5) For adjacent dual vertices x,yx,y, let e(x,y)e(x,y) be their joining edge. The antisymmetric signed edge weight δ\delta on ordered pairs of adjacent vertices of DD and the black boundary sum Δ(C)\Delta(C) of the cycle CC are the real function and real sum defined by (6). δ(x,y)=(∇N𝟏B)(e(x,y))σD(e(x,y),x),Δ(C)=∑i∈ℤ/kℤδ(zi,zi+1).\delta(x,y)=(\nabla_N\mathbf 1_B)(e(x,y))\sigma_D(e(x,y),x), \qquad \Delta(C)=\sum_{i\in\mathbb Z/k\mathbb Z}\delta(z_i,z_{i+1}).(6)

For a shore S⊆VS\subseteq V, the cut K(S)K(S) consists of edges with exactly one endpoint in SS.✦ The set KB(S)K_B(S) of black interior cut edges of a shore S⊆VS\subseteq V is given by (7). KB(S)={e∈K(S):b(e)∈S}.K_B(S)=\{e\in K(S):b(e)\in S\}.(7)✦

The Claim

Theorem 1 (Disk identity). Suppose N,DN,D have a cycle cut duality, are simple, and NN is cubic with bipartite black class BB and triangles TvT_v on its stars. Let m:V→Fm:V\to F restrict to a bijection from AA onto XX, selecting a corner of TtT_t for every t∈At\in A. Let CC be a cycle with b(ei)≠t0b(e_i)\ne t_0 and m(b(ei))=zim(b(e_i))=z_i at every index. There are a nonempty shore S⊆VS\subseteq V avoiding t0t_0 and a sign c∈{+1,−1}c\in\{+1,-1\} such that (8) holds. fC=c∇N𝟏S,K(S)=E(C),|K(S)|=2|KB(S)|+3,Δ(C)=−3c.\begin{aligned} f_C&=c\nabla_N\mathbf 1_S,& K(S)&=E(C),\\ |K(S)|&=2|K_B(S)|+3,& \Delta(C)&=-3c. \end{aligned}(8)✦

For a colored triangulation duality, let ss be a state and let CC be a cycle. Suppose there are triangles ti∈At_i\in A with ei∈st⁡N(ti)e_i\in\operatorname{st}_N(t_i) and s(ti)=zis(t_i)=z_i at every index. The conclusions in (8) also hold under these hypotheses. fC=c∇N𝟏S,K(S)=E(C),|K(S)|=2|KB(S)|+3,Δ(C)=−3c.\begin{aligned} f_C&=c\nabla_N\mathbf 1_S,& K(S)&=E(C),\\ |K(S)|&=2|K_B(S)|+3,& \Delta(C)&=-3c. \end{aligned}(9)✦

For integers B0,W0,I,h,ℓB_0,W_0,I,h,\ell satisfying B0+W0=2I+h−2B_0+W_0=2I+h-2, 3(B0−W0)=2ℓ−h3(B_0-W_0)=2\ell-h, and B0=I+ℓB_0=I+\ell, the disk count identity is (10). 2ℓ−h=−3.2\ell-h=-3.(10)✦

In the paper, the result reads: for a state rr, choose in each nonouter black triangle tt an edge directed from r(t)r(t) to another corner; every simple directed cycle in these edges avoids the roots and has δ\delta-sum −3-3 counterclockwise and +3+3 clockwise.

What Is Checked

The cycle statements concern finite cycle cut dual networks with the specified triangles and corner matchings, and the count statement concerns five integers satisfying its three relations. The black face family of a colored triangulation duality is a triangle system.