OctoInformBeta

OpenAI preprint, September 2026 · Section 5. A weighted cancellation argument

Lemma 5.3 [Positive spoke circulations; restricted replacement]: A zero-sum boundary equation supplies corner weights for directed cycles of triangle transversals

White charges prescribe the signs of cycle slopes.

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 incidence weights here belong to black triangles of a dual triangulation and measure changes of corner along state cycles.

A directed network has a specified tail and head for each edge.✦ Let NN be a finite directed network with vertex set VV and edge set EE, and let DD be a directed network with vertex set FF and the same edge set. The underlying simple graph of a directed network NN is the graph on its vertices in which distinct vertices are adjacent when an edge of NN has those endpoints.✦ A directed network NN is simple if it has no loops and at most one edge with each unordered pair of endpoints.✦

An edge ee of NN is incident with a vertex v∈Vv\in V when vv is its tail or its head.✦ The star of a vertex v∈Vv\in V of NN is the set of edges of NN incident with vv .✦ The oriented incidence matrix of NN has entry 𝟏v=head⁡(e)−𝟏v=tail⁡(e)\mathbf 1_{v=\operatorname{head}(e)}- \mathbf 1_{v=\operatorname{tail}(e)} in row vv , column ee . For real functions α:E→ℝ\alpha:E\to\mathbb R and f:V→ℝf:V\to\mathbb R , the boundary operator ∂N\partial_N and the gradient ∇N\nabla_N are given by (1); the subscript DD denotes the corresponding operators for DD . (∂Nα)(v)=∑head⁡(e)=vα(e)−∑tail⁡(e)=vα(e),(∇Nf)(e)=f(head⁡(e))−f(tail⁡(e)).\begin{aligned} (\partial_N\alpha)(v) &=\sum_{\operatorname{head}(e)=v}\alpha(e) -\sum_{\operatorname{tail}(e)=v}\alpha(e),\\ (\nabla_N f)(e)&=f(\operatorname{head}(e))-f(\operatorname{tail}(e)). \end{aligned}(1)

A cycle-cut duality between NN and DD is a relation in which their underlying graphs are connected and 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 in a directed network is a subgraph with three distinct cyclic corners cT(i)c_T(i) and three distinct sides eT(i)e_T(i), indexed modulo three, with eT(i)e_T(i) joining cT(i)c_T(i) to cT(i+1)c_T(i+1); its edge set is precisely these three sides.✦

A colored duality MM is a cycle-cut duality in which NN is simple and cubic, DD is simple, and a black class B⊆VB\subseteq V gives a bipartition of NN . Each v∈Vv\in V has a triangle TvT_v in DD whose edge set is the star of vv in NN . For an edge ee of DD and a vertex u∈Fu\in F, the outgoing sign εD(e,u)\varepsilon_D(e,u) is the real number +1+1 when uu is the tail of ee and −1-1 otherwise.✦ The triangles satisfy the orientation condition (3), where 𝟏v\mathbf 1_v is the indicator of vv . (∇N𝟏v)(eTv(i))=εD(eTv(i),cTv(i)).(\nabla_N\mathbf 1_v)(e_{T_v}(i)) =\varepsilon_D(e_{T_v}(i),c_{T_v}(i)).(3)

Fix a root t0∈Vt_0\in V . The nonroot black triangles are indexed by A=B\{t0}A=B\setminus\{t_0\} , and X⊆FX\subseteq F consists of the vertices outside the three corners of Tt0T_{t_0} . A triangle system (Tt)t∈A(T_t)_{t\in A} on FF is a family of ordered triples of distinct corners in FF in which two triangles sharing two distinct corners are equal.✦ The black face triangle system (Tt)t∈A(T_t)_{t\in A} on FF is the family of triangles in DD indexed by AA; write ctc_t and ete_t for its corner and side maps.✦

A triangle transversal ss of a triangle system onto a subset of its vertex set is a choice of one corner of each triangle, with the selected corners distinct and their image equal to that subset.✦ A state ss is a triangle transversal of the black face triangle system onto XX .✦ Write ks(t)k_s(t) for its chosen corner index and s(t)=ct(ks(t))s(t)=c_t(k_s(t)) for its selected vertex.

Charges and Corner Weights

The root-balanced white charge bt0:V→ℝb_{t_0}:V\to\mathbb R is the function in (4). bt0(v)=𝟏v∉B−|V\B|𝟏v=t0.b_{t_0}(v)=\mathbf 1_{v\notin B} -|V\setminus B|\,\mathbf 1_{v=t_0}.(4)✦

For a real edge weight function α:E→ℝ\alpha:E\to\mathbb R, write δα(e,u)=α(e)εD(e,u)\delta_\alpha(e,u)=\alpha(e)\varepsilon_D(e,u) for its signed outgoing weight at an endpoint uu of ee in DD. The corner potential pTαp_T^\alpha of a dual triangle TT is the function on its three corner indices specified by (5). (pTα(0),pTα(1),pTα(2))=(0,δα(eT(0),cT(0)),δα(eT(0),cT(0))+δα(eT(1),cT(1))).\bigl(p_T^\alpha(0),p_T^\alpha(1),p_T^\alpha(2)\bigr) =\bigl(0,\delta_\alpha(e_T(0),c_T(0)), \delta_\alpha(e_T(0),c_T(0))+\delta_\alpha(e_T(1),c_T(1))\bigr).(5)✦ The black face corner weights a(t,u)a(t,u) are real numbers assigned to corners uu of triangles indexed by t∈At\in A, as specified in (6). a(t,ct(i))=pTtα(i),t∈A,i∈ℤ/3ℤ.a(t,c_t(i))=p_{T_t}^\alpha(i),\qquad t\in A,\quad i\in\mathbb Z/3\mathbb Z.(6)✦

Cycle coordinates viv_i in a simple graph are an injective cyclic list of vertices, indexed modulo a length ℓ≥3\ell\geq3, with consecutive vertices adjacent.✦ A state cycle CC for ss consists of cycle coordinates in DD, triangles ti∈At_i\in A and corner indices jij_i such that s(ti)=vis(t_i)=v_i and cti(ji)=vi+1c_{t_i}(j_i)=v_{i+1}.✦ The cyclic index increment η(i,j)\eta(i,j) is the integer in (7), with indices taken modulo three. η(i,j)={0,i=j,1,j=i+1,−1,otherwise.\eta(i,j)= \begin{cases} 0,&i=j,\\ 1,&j=i+1,\\ -1,&\text{otherwise}. \end{cases}(7)✦ The total index increment Δ(C)\Delta(C) and weight slope Lα(C)L_\alpha(C) of a state cycle are the sums in (8). Δ(C)=∑i∈ℤ/ℓℤη(ks(ti),ji),Lα(C)=∑i∈ℤ/ℓℤ(a(ti,cti(ji))−a(ti,s(ti))).\begin{aligned} \Delta(C)&=\sum_{i\in\mathbb Z/\ell\mathbb Z}\eta(k_s(t_i),j_i),\\ L_\alpha(C)&=\sum_{i\in\mathbb Z/\ell\mathbb Z} \bigl(a(t_i,c_{t_i}(j_i))-a(t_i,s(t_i))\bigr). \end{aligned}(8)

The Claim

Theorem 1. Let NN be a finite connected network and let b:V→ℝb:V\to\mathbb R be a charge with ∑v∈Vb(v)=0\sum_{v\in V}b(v)=0. Then there exists α:E→ℝ such that ∂Nα=b.\text{there exists }\alpha:E\to\mathbb R\text{ such that }\partial_N\alpha=b.(9)✦ In a finite colored duality MM, fix a root t0t_0, a state ss and a state cycle CC. If α:E→ℝ\alpha:E\to\mathbb R satisfies ∂Nα=bt0\partial_N\alpha=b_{t_0}, then (Δ(C)=−3 and Lα(C)>0)or(Δ(C)=3 and Lα(C)<0).\bigl(\Delta(C)=-3\ \text{ and }\ L_\alpha(C)>0\bigr) \quad\text{or}\quad \bigl(\Delta(C)=3\ \text{ and }\ L_\alpha(C)<0\bigr).(10)✦

In the paper, the result reads: putting a center in every bounded black triangle and joining it to the triangle’s vertices by disjoint incidence spokes gives a plane graph H0H_0, allowing isolated vertices, on which there are real spoke weights a(t,v)a(t,v) such that every counterclockwise simple spoke cycle has strictly positive total weight, counting center-to-vertex traversal positively and the reverse traversal negatively.

What Is Checked

The boundary statement (9) is stated over finite connected networks and real charges of total zero. The cycle statement (10) is stated over colored dualities, their triangle transversal states and state cycles, with an edge weight function whose boundary is the root-balanced white charge; its corner weights are those of (6).

The boundary and gradient operators in (1) are real linear maps.