The Setting
Proposition 5.1 concerns forests in the dual triangulation of a cubic bipartite network. Let and be finite directed networks on vertex sets and , respectively, with a common edge set . A directed network on vertex set with edge set is a network in which each edge of has a designated tail and head in .✦ The underlying simple graph of a directed network on is the graph on that joins distinct vertices when they are endpoints of an edge of .✦ A network is simple when its edges have distinct endpoints and no two edges have the same unordered endpoint pair.✦ An edge is incident to each of its endpoints✦; the star of a vertex is the set of edges incident to it.✦
For either network , write and for its head and tail maps. For a real edge vector and a real vertex function on , the oriented incidence matrix , boundary operator , and gradient operator are given by (1). (1)
A cycle cut duality is a pair of networks whose underlying graphs are connected and whose real cycle and cut spaces satisfy (2). (2)✦
A triangle on an edge set is a cyclic list of three distinct corners and three distinct edges, covering , in which each edge joins its corner to the next corner.✦ Indices are taken in . A colored dual is a cycle cut duality with simple and cubic, simple, and a black class containing exactly one endpoint of each edge. Each has a triangle in whose edge set is the star of in . Write and for its corners and sides. The outgoing edge sign is at the tail of and otherwise.✦ The triangles satisfy the orientation condition (3). (3)
A triangle system on , indexed by , assigns three distinct ordered corners to each , with no two distinct triangles sharing two distinct corners.✦ Fix a black root triangle , identified with its vertex of . The black triangle system consists of the triangles indexed by in (4); its nonroot vertices form the set there. (4)
States and Cycle Weights
For a finite triangle system on and a subset , a state is a corner assignment for which the selected vertex map in (5) is a bijection. (5)✦ Two states of a triangle system with selected vertex set are partners when for every triangle of . Write for the set of partners of , and for the set of ordered pairs of partners. The opposite graph is the simple graph on with one side opposite the choice of in each triangle, as in (6). (6)✦
The corner function , cyclic index increment , total index increment , and complex phase are defined in (7). For unequal indices, is the remaining corner index. (7) For a pair , the complementary assignment assigns the remaining corner index to each triangle, and its fixed complement class is the set of pairs with that same assignment, as in (8). (8)
For a finite set and coefficients in a commutative ring, let be the product of linear factors in (9). For real corner weights , that equation also defines the state weight and phased pair weight as complex polynomials. (9)
The transition permutation of a pair is .✦ The cycle class containing a triangle is the orbit of under the transition permutation of a pair .✦ Write for the set of these classes, and for the triangles in a class . The cycle increment , left and right cycle weights , and cycle slope are defined in (10). (10) Real corner weights satisfy the cycle sign condition when every pair and every satisfy (11). (11)
A cycle in a simple graph is a cyclic list of distinct vertices with successive vertices adjacent.✦ An opposite cycle of is such a cycle in , together with distinct triangles and corner indices satisfying and .✦ The opposite cycle increment of a partner along an opposite cycle of is the integer given in (12). The disk circulation condition for a triangle system with selected vertex set is the requirement that the membership in (12) hold for every state , opposite cycle of , and partner . (12)
The Claim
Theorem 1. For the black triangle system associated with a colored dual and black root , suppose that is nonempty. Then (13)✦
Let be a finite triangle system and a subset of its vertices. Suppose that pairs exist, the disk circulation condition holds, and there are real corner weights satisfying the cycle sign condition. Then (14)✦
For a finite triangle system with at least one pair, let be real corner weights satisfying the cycle sign condition. Then (15)✦
For a pair in a finite triangle system, suppose that for every . For any real corner weights , (16)✦
What Is Checked
The assertion (13) is stated over the black triangle system of a colored dual, with nonroot sets and from (4). The assertions (14) and (15) range over finite triangle systems with the stated circulation or weight conditions; (16) concerns a fixed complement class with cycle increments . The selected-vertex property of a state asserts that for every triangle .✦