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 be a finite directed network with vertex set and edge set , and let be a directed network with vertex set and the same edge set. The underlying simple graph of a directed network is the graph on its vertices in which distinct vertices are adjacent when an edge of has those endpoints.✦ A directed network is simple if it has no loops and at most one edge with each unordered pair of endpoints.✦
An edge of is incident with a vertex when is its tail or its head.✦ The star of a vertex of is the set of edges of incident with .✦ The oriented incidence matrix of has entry in row , column . For real functions and , the boundary operator and the gradient are given by (1); the subscript denotes the corresponding operators for . (1)
A cycle-cut duality between and is a relation in which their underlying graphs are connected and their real cycle and cut spaces satisfy (2). (2)✦
A triangle in a directed network is a subgraph with three distinct cyclic corners and three distinct sides , indexed modulo three, with joining to ; its edge set is precisely these three sides.✦
A colored duality is a cycle-cut duality in which is simple and cubic, is simple, and a black class gives a bipartition of . Each has a triangle in whose edge set is the star of in . For an edge of and a vertex , the outgoing sign is the real number when is the tail of and otherwise.✦ The triangles satisfy the orientation condition (3), where is the indicator of . (3)
Fix a root . The nonroot black triangles are indexed by , and consists of the vertices outside the three corners of . A triangle system on is a family of ordered triples of distinct corners in in which two triangles sharing two distinct corners are equal.✦ The black face triangle system on is the family of triangles in indexed by ; write and for its corner and side maps.✦
A triangle transversal 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 is a triangle transversal of the black face triangle system onto .✦ Write for its chosen corner index and for its selected vertex.
Charges and Corner Weights
The root-balanced white charge is the function in (4). (4)✦
For a real edge weight function , write for its signed outgoing weight at an endpoint of in . The corner potential of a dual triangle is the function on its three corner indices specified by (5). (5)✦ The black face corner weights are real numbers assigned to corners of triangles indexed by , as specified in (6). (6)✦
Cycle coordinates in a simple graph are an injective cyclic list of vertices, indexed modulo a length , with consecutive vertices adjacent.✦ A state cycle for consists of cycle coordinates in , triangles and corner indices such that and .✦ The cyclic index increment is the integer in (7), with indices taken modulo three. (7)✦ The total index increment and weight slope of a state cycle are the sums in (8). (8)
The Claim
Theorem 1. Let be a finite connected network and let be a charge with . Then (9)✦ In a finite colored duality , fix a root , a state and a state cycle . If satisfies , then (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 , allowing isolated vertices, on which there are real spoke weights 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.