The Setting
The Euclidean size of a simplex and the variation of a vertex potential can be measured using a spanning tree on its vertices.
Fix a nonnegative integer and the vertex set , with root . The full barycentric simplex and the standard solid simplex are the sets in (1): (1) The barycentric parametrization is the affine map defined by (2): (2)✦
Tree Coordinates and Areas
A spanning tree of a simple graph on is a tree on whose edges belong to ; write for the set of such trees.✦ For a tree on , choose a tree edge enumeration, a bijection from to its edges, and choose an ordered pair of endpoints for its th edge.
The rooted vertex coordinate of is the vector in (3): (3)✦ The integer reduced incidence matrix has as its columns the rooted coordinate differences of the ordered edge endpoints✦; its real reduced incidence matrix is obtained by applying the inclusion to each entry, as in (4): (4)
The tree parametrization is the affine map obtained by composing with ✦, and the tree solid simplex is the inverse image of under : (5) Both constructions in (5) use the usual Euclidean structure on .
Let denote -dimensional Euclidean Hausdorff measure. The tree area of a set is the measure of its inverse image under .✦ For a simple graph on and a set , the averaged simplex area is the average of the tree areas over the spanning trees of , as in (6); both tree area and averaged simplex area take values in the extended nonnegative reals .✦ (6)
For , a vertex potential on is a function from to . The normalized tree gradient of a vertex potential on a tree is the vector of edge differences in (7), with its Euclidean norm: (7)✦
The Claim
Theorem 1. Let be a tree on . The volume and tree area identities are (8) and (9), where is Euclidean volume: (8)✦ (9)✦ For a connected simple graph on , the averaged area satisfies (10): (10)✦ Suppose and satisfies on every edge of . Its normalized tree gradient satisfies (11): (11)✦ Let and be real inner product spaces, let be an affine isometry, and take and . There is a vector satisfying (12): (12)✦
In the paper, the result reads: every top -simplex of a simplicial complex has volume in each tree Euclidean structure, and, for every in the geometric realization , every affine branch of on has gradient norm at most one, as does its restriction to any affine subspace of the span of , where is the dual transportation metric normalized by .
What Is Checked
The claims are stated over finite simple graphs and their spanning trees, the Euclidean measures defined by (6), vertex potentials with bounded tree edge differences, and affine isometries between real inner product spaces.