The Setting
An edge shared by the original network and the dual triangulation has a direction in each network. Write and for their respective vertex sets and 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 in the underlying simple graph of are a cyclic list of distinct vertices of , where and consecutive vertices are adjacent.✦ For each index , let be a chosen edge joining to .✦
The gradient of a real potential is the edge weight defined by (1). (1)✦ The outgoing edge sign of an edge at a vertex is the real number in (2). (2)✦
Let be the black vertex set, and let be its indicator, taking value on and elsewhere. Number the three corners of a triangle cyclically by .
The Definition
Definition 1. For corner indices , the cyclic corner sign is defined by (3), with addition modulo three. (3)✦ For a black vertex set and cycle coordinates in , the black boundary sum is defined by (4). (4)✦
In the paper, the result reads: for adjacent vertices of , is when the black face lies to the left of traversal from to and otherwise; it is antisymmetric, and counterclockwise sides of a bounded black triangle have weight .
What Is Checked
The definitions are stated over three cyclic corner indices and over directed networks and with a common edge set, a black subset of the vertices of , and cycle coordinates in the underlying simple graph of .
The gradient is linear: for real potentials and real scalars , it satisfies (5). (5)