The Setting
The labels attached to a refined simplex are complex vectors on the vertices of a graph. They come from the component of a filtration stratum containing the simplex’s barycenter. The parameter of the filtration varies in a topological space .
Fix the graph geometry of a simplicial complex on a vertex set . The graph on is connected and has finite neighbor sets. Its graph metric is shortest-path distance, regarded as a real number.✦ Let a group act on and . Write for the finitely supported real vectors, with the Euclidean norm induced by the coordinate embedding into . For , the vertex action on , and on , reindexes coordinates by .
For , let be the real unit coordinate vector and its complex counterpart. The standard simplex vertices and their convex hull are given by (1); the geometric realization of in is denoted by , with underlying space . (1)
A finitely supported probability measure on is a nonnegative real coefficient function with finite support and total coefficient one.✦ For finitely supported probability measures on , a function , and a positive integer , the expectation , expectation difference , dual transportation distance , and normalized distance are defined by (2). (2) The barycentric probability measure of a realization point has coefficient function .✦ For vectors , the realization distance between them is when both belong to , and is zero otherwise.✦
Subdivisions and Filtrations
For a geometric simplicial complex in and a subset of , the vertex restriction is the subcomplex of consisting of the faces whose vertices all lie in .✦ The geometric restriction of a geometric simplicial complex in to a subset of consists of the faces of whose convex hulls lie in .✦ A geometric simplicial complex in respects a subset of if, for each face of , the intersection is the convex hull of the vertices of that belong to .✦
A simplicial subdivision of a geometric complex is a geometric simplicial complex with the same underlying space as , each of whose faces is carried by a face of . It respects the convex hull of each face of , and its vertex restriction to each such hull has finitely many faces. A refinement of a geometric complex is the complex of a simplicial subdivision of .✦
A locally constant subdivision family assigns a subdivision of to each , with the face set of locally constant for each original face .✦ A marked subset of a geometric complex is a union of convex hulls of its faces.✦ For a locally constant subdivision family of over , a marked subdivision family is a family of marked subsets of , indexed by , for which the face set of is locally constant for every original face .✦ An equivariant marked subdivision pair over is a pair consisting of a locally constant subdivision family of and a marked subdivision family for , for which sends faces at to faces at and marked points at to marked points at , for every .✦
Fix and . A separating filtration is a sequence of equivariant marked subdivision pairs with the top and nesting conditions in (3), and with refining for . (3) Its dimension drop condition says that if is a face of contained geometrically in , and is a face of whose convex hull lies in , then .✦ The difference has component diameter bound for : every preconnected subset of that difference has for all its points .✦
Components and Weights
At a fixed , the complexes and marked sets form the pointwise filtration .✦ A final triangulation face at is a face of .✦ The vertex mean of a final triangulation face at is the vector in obtained by averaging the vertices of , with value zero when is empty.✦ The stratum , face level , and face stratum component are specified in (4); the component is taken in the Euclidean topology of . (4)
The vertex support of a subset is the subset of consisting of vertices occurring in the support of at least one vector in .✦ For a final face, write for its component vertices, as in (5). (5)
For a finite vertex set , its uniform vertex vector is defined by (6). The component weight is the uniform vector on the component vertices .✦ (6)✦ Fix . The extended face weight is the function on finite subsets of defined by (7). (7)✦
For a vertex , a nonnegative integer , and a finite vertex set , the finite graph neighborhoods and vertex label window are defined by (8), where is the greatest nonnegative integer at most for . (8) For an original face , let be the face set of .
The Claim
Theorem 1. Let be a separating filtration in the graph geometry above, with and . If is a final face at and its vertex mean belongs to for a finite set , the support bound is (9). (9)✦ For every final face at , (10) holds. (10)✦ Fix an original face and . There is a neighborhood of on which (11) holds for every , with the component equality applying to every common final face at and whose convex hull lies in . (11)✦ There is a neighborhood of on which (12) holds for every , with ranging over in the weight equality. (12)✦ For , , and a final face at , the equivariance identity is (13). (13)✦
In the paper, the result reads: for every original simplex there is a finite , independent of the filtration parameter and of , such that whenever , and the triangulation over together with all assigned vectors is locally constant in , with these assignments equivariant.
What Is Checked
The assertions are stated over the standard coordinate realization of with its normalized graph transportation distance, and an equivariant separating filtration of positive length with nonnegative radius. Every realization point admits a barycentric probability measure whose support is a face of .✦ The barycenter of each final face meets a marked level .✦ The coordinate embedding is injective.✦