The Setting
The replacement of a subdivided simplex by component averages is an operation on exterior chains over complex vertex modules. Its evaluation by a complex linear functional depends on the flags of faces admitted by a separating filtration.
For a vertex set , let be the finitely supported complex functions on , with coordinate vectors . For , the exterior chain spaces and oriented vertex wedges are defined by (1). (1) After fixing an order on the vertex set, the oriented simplex basis vector of a finite vertex set is the wedge of its increasing enumeration. A vertex map has a linearization sending to ✦ and an induced map on each exterior power. An alternating function , where is a vertex set and is an abelian group, is a function that changes by the sign under a permutation and vanishes on repeated vertices.✦ For values in a complex vector space, its linear extension sends to its value on the increasing enumeration of .✦
Let be a real normed vector space and a geometric simplicial complex in . Write for the convex hull of a finite vertex set and for the realization. The vertex restriction of a complex to keeps the faces whose vertices belong to ✦; the geometric restriction keeps the faces whose convex hull lies in .✦ A complex respects if for every face of .✦
A subdivision of is a complex with such that the convex hull of each face of lies in the convex hull of a face of , respects every for a face of , and has finitely many faces.✦ A complex refines a complex if is a subdivision of .✦ A marked subset of is a union of convex hulls of faces of .✦ Dimension drop from to means that whenever is a face of with , each face of with has .✦
A marked point filtration of of length is a sequence of pairs, indexed by , in which is a complex and is marked in , with and . For , the complex refines , the inclusion holds, and there is dimension drop from to .
A final triangulation face is a face of .✦ For a face of the final triangulation of a marked point filtration , the vertex mean , the least marked level , the filtration strata , and the stratum component are given by (2); the vertex mean of the empty set is zero. (2) Extend to all finite subsets of by setting it to zero off the faces of .✦ For a finite family of finite vertex sets and , a pointed flag in is a chain of faces of belonging to , with , , and .✦ For , the pointed flag set is empty.
For a set of cardinality , its filtered flag count is defined by (3), where denotes an indicator. (3)✦ For a finite complex , let be its faces with vertices and put .✦
Labeled Fundamental Chains
For a finite family of -vertex subsets and a coordinate map , the fundamental chain is defined by (4); is the increasing enumeration of . (4)✦ For a vertex set , a face labeling is a function assigning a vector of to each finite subset of . The barycentric label map associated to a face labeling is the complex linear map obtained by recursively coning the labeled boundary of a simplex with its label ; in degree it is the identity.✦ The uniform vertex vector of a finite set is , with value zero for .✦
Separating Families and Sparse Operators
Let be a connected locally finite graph on , with shortest-path metric , and fix and . Regard as the coordinate-preserving subspace of , with its induced Euclidean norm and Borel sets. A finitely supported probability measure on is a finitely supported real function with nonnegative coefficients summing to one.✦ For finitely supported probability measures on and a real function on , write for its Lipschitz constant with respect to ; the expectation, expectation difference, dual transportation distance, and normalization are defined by (5). (5) For a complex on , let be its standard realization in . The barycentric probability measure of has coefficients and support a face of . The realization distance is when both vectors belong to , and zero otherwise.✦ For a finite set , its standard simplex has vertex set and convex hull .✦
Let a group act on and a topological parameter space . Its vertex action on vectors is the linear reindexing .✦ A locally constant subdivision family of over is a family of subdivisions indexed by for which the face set of is locally constant in for every face of .✦ A marked subdivision family for over is a family of subsets indexed by such that is marked in and the face set of is locally constant in .✦ Subdivision equivariance requires to be a face of whenever is a face of ✦; marked equivariance requires .✦ An equivariant marked subdivision pair over is a locally constant subdivision family of together with a marked subdivision family satisfying subdivision equivariance and marked equivariance.✦
A separating filtration of over of length and radius is a sequence of equivariant marked subdivision pairs whose evaluation is a marked point filtration of . Each difference , for , has component diameter at most for : any two points in any connected subset of that difference have distance at most .
For the component averages, assume the stipulated simplicial hypothesis of the sparse chain construction. The vertex support of is .✦ For a final face of , its component vertex set is the vertex support of ✦, and its component weight is .✦ Choose a base vertex . The extended face weight is the face labeling on finite subsets of whose value is for faces of and for other finite vertex sets.✦
For a subdivision of , its restricted simplex triangulation is .✦ The simplex coordinate chart of a tuple is the map from to given by .✦ The ordered simplex subdivision associated to a tuple and a subdivision is the exterior chain when the image of is a face of , and zero otherwise.✦ The subdivision map is the linear extension of this alternating subdivision function; in degree it is the induced exterior power map of .✦ The sparse chain operator family is the composition in (6). (6)✦
The finite graph neighborhoods are defined recursively by and .✦ The label window is the finite vertex set in (7). (7)✦ Here is the natural-number floor. Write , where is counting measure and its real value is zero at infinity.
The Claim
Theorem 1. Let be a marked point filtration of of length , and suppose every face of has at most vertices. For any finite family , , and , the pointed flags satisfy (8). (8)✦ Let be a finite geometric simplicial complex all of whose faces are faces of . For , the filtered flag count satisfies (9). (9)✦ Let be finite, and let be a face labeling with whenever are faces of with . Suppose every on is for some nonempty . Let and let be complex linear. If and for all tuples with entries in , then (10) holds. (10)✦ Suppose every face of has at most vertices. For the sparse operator family above, let and let be an injective tuple whose image is a face of . Let be complex linear and . If for every tuple with entries in , then the sparse chain bound is (11). (11)✦
In the paper, the result reads: for every original top simplex and every parameter , at most terms of its fundamental barycentric subdivision chain have nonzero images under the exterior replacement map.
What Is Checked
The flag estimates are stated over marked point filtrations with the face cardinality bound. The labeled chain estimate uses a finite subcomplex with uniform face labels; the sparse estimate uses the separating family over the graph realization with and . Every final face has its vertex mean in some marked stage of index at most .✦ The component vertex sets are finite.✦