OctoInformBeta

OpenAI preprint, September 2026 · Section 2. Plane trees and the triangulation statement

§2 (setting): roots, states, and paired states: Rooting a colored dual triangulation specifies the triangles and vertices available for selection

Corner choices define states and pairs.

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 NN and DD be finite networks with vertex sets VV and FF, respectively, and a common edge set EE.

A network KK on a vertex set WW is a directed multigraph assigning a tail and a head in WW to every edge.✦ The underlying simple graph of a network KK is the graph on its vertex set that joins distinct vertices whenever an edge of KK has those endpoints, in either order.✦ A simple network KK is a network with no loops and at most one edge with any given unordered pair of endpoints.✦ An edge ee of a network KK is incident with a vertex vv of KK when vv is the tail or the head of ee.✦ The star star⁡K(v)\operatorname{star}_K(v) of a vertex vv in a network KK is the set of all edges incident with vv.✦

The oriented incidence matrix IKI_K of a network KK is the matrix with entries given by (1), where 𝟏P\mathbf 1_P is 11 when PP holds and 00 otherwise. (IK)v,e=𝟏head⁡K(e)=v−𝟏tail⁡K(e)=v.(I_K)_{v,e} =\mathbf 1_{\operatorname{head}_K(e)=v} -\mathbf 1_{\operatorname{tail}_K(e)=v}.(1)✦ The boundary operator ∂K\partial_K of a network KK is the linear map that sends real edge weights to their signed net inflows at vertices.✦ The gradient operator ∇K\nabla_K of a network KK is the linear map that sends a real vertex potential to its differences across edges.✦ These linear maps are given by (2). ∂K:ℝE→ℝW,∂Kw=IKw,(∇Kf)(e)=f(head⁡K(e))−f(tail⁡K(e)).\partial_K:\mathbb R^E\longrightarrow\mathbb R^W, \qquad \partial_K w=I_Kw, \qquad (\nabla_K f)(e) =f(\operatorname{head}_K(e))-f(\operatorname{tail}_K(e)).(2)

A cycle-cut duality between networks NN and DD is an identification of their real cycle and cut spaces as in (3), with both underlying graphs connected. ker⁡∂N=im⁡∇D,ker⁡∂D=im⁡∇N.\ker\partial_N=\operatorname{im}\nabla_D, \qquad \ker\partial_D=\operatorname{im}\nabla_N.(3)✦

Put I=ℤ/3ℤI=\mathbb Z/3\mathbb Z. A triangle tt of a network KK on an edge set SS is a pair of families of distinct corners c(i)c(i) and distinct edges a(i)a(i), indexed by i∈Ii\in I, such that the edges exhaust SS and a(i)a(i) joins c(i)c(i) to c(i+1)c(i+1).✦ For an edge ee and a vertex vv of a network KK, the outgoing edge sign εK(e,v)\varepsilon_K(e,v) is the number +1+1 when vv is the tail of ee and −1-1 otherwise.✦

A colored triangulation duality between NN and DD is a cycle-cut duality in which both networks are simple and NN is cubic, together with a black class B⊆VB\subseteq V giving a bipartite coloring. Each v∈Vv\in V has a dual triangle with corners cv(i)c_v(i) and sides av(i)a_v(i) whose side set is star⁡N(v)\operatorname{star}_N(v). The orientation compatibility of these triangles is (4), where 𝟏v\mathbf 1_v is the potential equal to 11 at vv and 00 elsewhere. (∇N𝟏v)(av(i))=εD(av(i),cv(i))(v∈V,i∈I).(\nabla_N\mathbf 1_v)(a_v(i)) =\varepsilon_D(a_v(i),c_v(i)) \qquad(v\in V,\ i\in I).(4)

The Claim

Definition 1. Fix a black root triangle t0t_0, identified with its vertex in BB. The nonroot black triangles form the set AA✦, and the nonroot dual vertices form the set XX, defined by (5). A=B\{t0},X=F\{ct0(i):i∈I}.A=B\setminus\{t_0\}, \qquad X=F\setminus\{c_{t_0}(i):i\in I\}.(5)

A triangle system TT on a vertex set FF, indexed by a set AA, is a family of three distinct vertices for each triangle, with no two different triangles sharing two vertices.✦ Its corner map ν\nu satisfies (6). ν:A×I→F,ν(t,⋅) is injective for every t∈A,|{ν(t,i):i∈I}∩{ν(u,i):i∈I}|≤1(t≠u).\begin{gathered} \nu:A\times I\longrightarrow F, \qquad \nu(t,\cdot)\text{ is injective for every }t\in A,\\ \bigl|\{\nu(t,i):i\in I\}\cap\{\nu(u,i):i\in I\}\bigr|\leq 1 \qquad(t\ne u). \end{gathered}(6)✦

A state ss of TT on a set X⊆FX\subseteq F is a corner choice cs:A→Ic_s:A\to I whose selected vertices give a bijection onto XX, as in (7).✦ Write s(t)s(t) for the selected vertex of triangle tt, and 𝒮T(X)\mathcal S_T(X) for the set of states. s(t)=ν(t,cs(t)),s:A→∼X.s(t)=\nu(t,c_s(t)), \qquad s:A\xrightarrow{\sim}X.(7)✦

Two states r,s∈𝒮T(X)r,s\in\mathcal S_T(X) are partners, written r⟂Tsr\perp_T s, when they make distinct selections at every triangle, as specified in (8). r⟂Ts⇔r(t)≠s(t) for every t∈A.r\perp_T s \quad\Longleftrightarrow\quad r(t)\ne s(t)\text{ for every }t\in A.(8)✦

A paired state (r,s)(r,s) of TT on XX is an ordered pair of partner states of TT on XX.✦ The set 𝒫T(X)\mathcal P_T(X) of paired states of TT on XX is given by (9). 𝒫T(X)={(r,s)∈𝒮T(X)×𝒮T(X):r⟂Ts}.\mathcal P_T(X) =\{(r,s)\in\mathcal S_T(X)\times\mathcal S_T(X):r\perp_T s\}.(9)✦

What Is Checked

The state and partner definitions apply to any triangle system and any subset of its vertex set; the rooted sets arise from a finite colored triangulation duality with a black root.

Theorem 1. Let NN and DD have a finite colored triangulation duality, and let t0t_0 be a black root triangle. For the sets AA and XX of (5), the cardinality relation is (10). |X|=|A|.|X|=|A|.(10)✦