The Setting
Take a disk diagram built from triangles of the complex , which has three vertices , and and whose triangles each have one corner at each of them. Angles are measured in units of : each triangle has angle at its corner at and at its corners at and , so its angles sum to , which is , and a full turn is . At a vertex of the disk, is the sum of the angles of the triangles with a corner at , and is the number of times the boundary of the disk passes through .
The library states the combinatorial Gauss-Bonnet formula for abstract counts of a disk, and attaches such counts to every triangle ribbon, a combinatorial filling by triangles with one outer face.
Angle Disk Counts
A system of angle disk counts is a finite set of vertices with natural numbers and of edges and faces and, at each vertex , a natural number of exterior visits and a real angle , such that , and satisfy Euler’s relation for a disk and the visits and angles satisfy two counting identities: (1)✦
The curvature of at a vertex is (2)✦
Triangle Ribbons
The cycles of a permutation of a finite set are the classes of under the equivalence relation in which and are equivalent when for some integer ✦; the cycle of an element is its class, the set of images of under the powers of .✦
A triangle ribbon is a finite set of darts with a fixed-point-free involution of (the edge involution), a permutation of (the face permutation), a cycle of (the outer face) and a coloring of the cycles of by the colors , and , subject to two conditions.✦ The vertex permutation applies and then ; it rotates the darts about a vertex.✦ The edges, vertices and inner faces of are the cycles of , the cycles of and the cycles of other than , forming the sets , and , and a dart is the corner of the face at the vertex . The first condition, the triangle condition, asks that for every inner face the map be a bijection from onto . The second, the Euler count of a disk, asks that (3)✦
The color stands for and the colors and for and , and the weight of a color is the angle of a triangle of at the corresponding corner.✦ The corner angle of a dart is when lies in the outer face and otherwise.✦ At a vertex of , the angle is the sum of the corner angles of the darts of ✦, and the number of exterior visits is the number of darts of that lie in : (4)✦
The Claim
Theorem 1. (i) Let be a system of angle disk counts with vertex set . Then the curvatures of sum to a full turn: (5)✦
(ii) Let be a triangle ribbon with edges and inner faces, and with the angles and exterior visits of (4). Then every is nonnegative✦ and (6)✦ so that, with the Euler count (3), the vertices of with these numbers form a system of angle disk counts, the angle disk counts of , and (5) holds for them.✦
In the paper, the result reads , the sum running over the vertices of a diagram, with the exterior visits at .
What Is Checked
The claim is stated over systems of angle disk counts, a finite set of vertices with numbers of edges and faces, exterior visits and nonnegative angles bound by (1), with the curvature (2), and over triangle ribbons, whose edges, vertices and inner faces are the cycles of the edge involution, the vertex permutation and the face permutation, and whose angles and exterior visits (4) are built from the color weights and the corner angles.