The Setting
The geometry of connected supports in the Bass trace problem concerns barycentric mass on simplices and areas measured in tree coordinates. Let be a vertex set, and write for the finitely supported real functions on . For a connected simple graph on , the graph metric is shortest-path distance.✦ Let be a simplicial complex on , with barycentric realization .
For a pseudometric on , a function is -Lipschitz when for all vertices . The normalization parameter is an integer .
Tree Coordinates
For the area construction, let be a simplex with vertices and let be a simple graph on these vertices. A spanning tree of is a connected acyclic graph on the vertices of whose edges belong to ; write for the finite set of these trees.✦ For each tree , enumerate its edges and choose ordered endpoints for the th edge. A tree edge enumeration of is a bijection from to the edge set of .
The rooted vertex coordinate records the vertex after the coordinate of vertex has been omitted.✦ The integer reduced incidence matrix has the oriented edge coordinates as columns, as in (1)✦; its real reduced incidence matrix is the same matrix viewed over .✦ (1)
The barycentric parametrization and the tree parametrization are the affine maps in (2), with the domain of given its usual Euclidean metric. (2) For an integer , write for -dimensional Hausdorff measure on with its usual Euclidean metric.
The Definition
Definition 1. A finitely supported probability measure on is a nonnegative real function with finite support and total mass one; their set is given by (3). (3)✦
For and a real function on , the expectation and expectation difference are the finite sums in (4). (4) The dual transportation distance on for a pseudometric on is the supremum in (5). (5)✦ The normalized transportation distance on is the function given by (6). (6)✦ If and for distinct vertices, the probability metric on is the metric specified in (7). (7)✦
For a family of finite subsets of , the probability realization is the subset of in (8). (8)✦ For , its barycentric probability measure has coefficients .✦ Given a connected graph and a center , the function measuring distance from is defined by (9), using in . (9)✦
For a tree on the vertices of , an integer and a subset , the tree area is the Hausdorff measure of the inverse image in (10). (10)✦ The averaged simplex area for is the extended nonnegative real value in (11). (11)✦
In the paper, the result reads: for a real radius , writing for the Lipschitz constant of and for the relative interior of , consists of finitely supported probability vectors with simplicial support, uses graph distance, , and are respectively the closed ball, open ball and sphere, and on a top simplex the measure is the average of -dimensional Hausdorff measures, restricted to , over the Euclidean structures in which the oriented edge vectors of each spanning tree are orthonormal.
What Is Checked
The probability constructions are stated over a pseudometric vertex set, with and distances between distinct vertices at least one for the probability metric; the center function uses a connected graph and a simplicial complex. The area constructions are stated over a graph on the vertices of a finite simplex, an integer and an arbitrary subset of the real coordinate space.