The Setting
Let be a topological space and a geometric simplicial complex in a real normed space . A separating filtration step concerns a marked subset of and a smaller marked subset , with dimension measured along the original simplices and component diameter measured on . Write for the convex hull of a finite vertex set .
A marked subset of is a union of convex hulls of faces of : every belongs to some , with a face of .✦ For , the geometric restriction and the vertex restriction have the face sets in (1); compatibility of with means the last equality there holds for every face of . (1)
A simplicial subdivision of is a geometric complex with such that each simplex of lies in an original simplex, is compatible with every original simplex, and has finitely many faces for every face of .✦ Write when is such a subdivision.✦ A locally constant subdivision family over assigns a subdivision to each , with the face set of locally constant in for each original face ; write for these families.✦ A marked family for assigns a marked subset of to each , with the face set of locally constant in for each original .✦
For complexes and subsets , dimension drop is the condition in (2). For a subset of , a real bound , and a function , the component diameter condition requires every preconnected subset of to have pairwise -distance at most , as specified in (2).✦ (2)
An admissible step for consists of a family refining at each parameter, with still marked in , and a marked family for satisfying , , and for every .✦ Denote the set of these steps by .
Affine Cuts and Patch Triangulations
Universal cutting data on consist of linear forms and positive levels indexed by a set , and a finite set of relevant indices in for every finite vertex set , such that vanishes throughout when .✦ Locally finite cutting data on impose this condition only for faces of .✦ Restricting universal data to gives such cutting data.✦ For a finite index set and , the closed halfspace patch and its level boundary are defined by (3). (3)
A halfspace cell, or halfspace polyhedron, in is a set . The signed cuts of a parent cell are its intersections with the halfspaces defined by the signed forms and bounds , where . The cut parent cells are these signed cuts of the original parent cells.✦ A supporting face of a cell is an intersection for a linear form bounded above by on .✦ The nonempty supporting faces form a finite face family when their set is finite, and the face family is empty otherwise✦; closure of a finite cell family under supporting faces is the union of these face families.✦
The vertex mean of a finite set is the vector in , with value zero for .✦ The canonical vertex set of a cell is its set of extreme points when that set is finite, and is empty otherwise.✦ The canonical center of a cell is the vertex mean of its canonical vertex set.✦ For a finite cell family in and chosen centers , a face chain simplex in is the set of centers of a nonempty subfamily of linearly ordered by inclusion.✦ A compatible cell triangulation of a finite cell family is a finite geometric complex with underlying space , compatible with each , and with every simplex contained in a member of .✦
A finite simplex patch of is a finite collection of faces of .✦ The complex generated by a finite simplex patch of is the simplicial complex whose faces are the nonempty subsets of members of .✦ The simplex cells of are the convex hulls of its faces.✦ The relevant patch indices are .✦ The canonical patch triangulation is the compatible cell triangulation selected for these simplex cells using the cutting forms in .✦ The global cut complex of a complex is their directed union, whose faces are given by (4). (4)✦ For a subdivision of , its cut subdivision refinement is the subdivision of whose underlying complex is .
For subsets and activation sets , the activated unions and include exactly the indices active at .✦ For marked subsets of , the marked replacement at is the subset of given in (5). (5)
Graph Balls and Translated Forms
Let be a connected locally finite graph on a vertex set , with graph metric equal to shortest-path distance, and let now be the geometric realization of a simplicial complex on . Its ambient space is , the finitely supported real vertex vectors, with the Euclidean norm induced by the coordinate embedding into . A finitely supported probability on is a nonnegative coefficient function with finite support and .✦ For finitely supported probabilities on and a real-valued function on , the expectation of under is , and the expectation gap of is .✦ For finitely supported probabilities on and , the dual transportation distance and its normalization are the distances given in (6). (6)
A barycentric probability representation of is a finitely supported probability on whose coefficient vector is .✦ The realization distance is when both vectors lie in , and is zero otherwise.✦ For a probability center on , the distance function on the ambient vertex vectors is given by on and outside .✦ The closed ball , open ball , and sphere in the realization are the subsets specified by (7). (7)
For a vertex and , the finite graph neighborhood is a subset of defined recursively by and .✦ For a finite family of probability centers on and a radius , the finite ball support of is the subset of given in (8), for each . (8)✦ where .
For a finite subset of with the graph metric, the potential polytope is the set of real-valued functions on specified by . Its constraint forms are the differences and the two forms , with respective bounds and zero. Write for its extreme points, also called its polyhedron vertices. Coordinate evaluation is the continuous linear form .✦ For a potential on the finite ball support of a probability center , the expectation at is the real number in (9), and the ball branch form is the linear form on the ambient vertex vectors given there. (9) The ball branch indices are the pairs in , consisting of a center index and a vertex of the potential polytope on . A supported family of linear forms assigns a finite coordinate support to each form, which vanishes whenever all coordinates on that support vanish.✦ The ball branch data consist of the forms indexed by , with support .✦
Let a group act on and . Probability pushforward along a bijection reindexes coefficients by ; the actions on probabilities and vertex vectors are thus and . For , the translated branch form is the linear form on the ambient vertex vectors defined by .✦ A subdivision family is equivariant if is a face of for every face of ✦; a marked family is equivariant if for every .✦ For activation sets , write and .
The Claim
Theorem 1. Let be universal cutting data and . The family cut refinement of by the universal cutting data is the locally constant subdivision family in (10): (10)✦
Suppose has countably many faces and is countable, and let be arbitrary functions. The exceptional levels satisfy (11): (11)✦
Let be geometric complexes, let , and let be marked subsets of contained in levels of linear forms. Suppose every face of has, for each , a vertex with . Then the level union satisfies (12): (12)✦
Let be a marked family for , let be marked subsets of , and let be finite sets of cutting indices. Let be real-valued functions on . Suppose all cutting levels are , and . Assume each is continuous on , every point of satisfies for some , and for every and . Suppose also that every face of every has, for each cutting form, a vertex off its level, and that . The sphere cutting step has the admissibility asserted in (13): (13)✦
For graph balls, let be finite, , and . Let have , , and equivariant, and suppose each is clopen. Assume that for every , every face of , and every translated ball branch , some satisfies . The equivariant ball replacement satisfies (14): (14)✦
In the paper, the result reads: given real numbers , locally constant equivariant triangulation families with , subcomplex families and with , and a countable equivariant family with , clopen, and only finitely many meeting each original simplex, all outside a countable set admit a locally constant equivariant refinement of making and subcomplexes, where and are the unions of the active and , each inserted level meets every face of or in dimension at most , dimension drop of relative to passes to both sets, and a component diameter bound for passes to the replacement.
What Is Checked
The affine statements concern geometric simplicial complexes in real normed spaces and locally constant subdivision families with marked subsets. The ball replacement concerns probability centers in a simplicial realization over a connected locally finite graph, with the indicated group actions.
A finite simplex patch generates a complex with finitely many faces.✦ The extreme points of a polyhedron defined by finitely many halfspaces form a finite set.✦ The coordinate embedding into is injective✦, and every realization point admits a probability representation whose support is a simplex.✦ A family of marked subsets with locally constant intersections with every original simplex defines a marked subdivision family.✦