The Setting
The geometric setting of the Bass trace conjecture includes equivariant filtrations of a simplicial realization. The quantity at issue is the expected number of points of the lowest marked stratum in each original top-dimensional simplex.
Let act on a vertex set and a topological parameter space . Let be a connected graph on , let be an -invariant abstract simplicial complex on , and fix a nonnegative integer as the dimension parameter. The graph metric is shortest-path distance.✦ Write for the finitely supported real vertex vectors and for the unit vector at . Equip with the norm induced by its coordinate inclusion in and with the corresponding Borel structure. Write for the standard geometric realization complex and for its underlying space.
A finitely supported probability measure on is a finitely supported coefficient function with nonnegative values and total mass one.✦ For a real-valued function on , the expectation of under and its expectation difference from another finitely supported probability measure on are (1) The dual transportation distance uses the expectation difference in (1). For the graph metric, its normalized version is (2) For , the barycentric probability measure has coefficient vector and support a face of .✦ The realization distance on is (3)✦ where the normalization is that of (2).
Marked Subdivisions and Separating Filtrations
For a finite set of geometric vertices, write . The vertex restriction of a geometric complex to a subset is the geometric complex consisting of the faces of whose vertices lie in .✦ The geometric restriction of a geometric complex to a subset is the geometric complex consisting of the faces of whose convex hull lies in .✦ Simplicial compatibility of with means (4)✦ A simplicial subdivision of is a geometric complex with underlying space , each of whose faces lies in an original simplex, which satisfies (4) for each original simplex and has finitely many faces in the vertex restriction to that simplex.✦ A complex refines a complex if is the complex of a simplicial subdivision of .✦
A locally constant subdivision family over is a family of simplicial subdivisions of , indexed by , with the face set of the vertex restriction of to each original simplex locally constant in .✦ A marked subset of a geometric complex is a union of convex hulls of faces of .✦ A marked subdivision family for is a family marked in such that the face set of is locally constant for each original geometric face .✦
The vertex action extends to the linear reindexing on . An equivariant marked subdivision pair consists of a subdivision family and a marked family satisfying (5) Here the middle equality in (5) is equality of face sets. Subdivision equivariance of means that sends every face of to a face of for every and .✦ Marked subset equivariance of means that belongs to whenever , for every and .✦
A subset has component diameter at most for if for every pair of points in every connected subset of .✦ For geometric complexes and and subsets , dimension drop from to means that every face of with and every face of with satisfy .✦
A separating filtration of length and radius is a sequence of equivariant marked pairs , indexed by nonnegative integers, with (6) In addition to (6), there is dimension drop from to , and has component diameter at most .
An admissible step from a marked pair is a refinement with a marked family , in which remains marked, with dimension drop from to and component diameter at most for .✦ An equivariant admissible step from a marked pair is an admissible step whose new subdivision and marking satisfy (5); its resulting marked pair is denoted . For real-valued costs on marked pairs, a separating filtration is -near-minimal, written , if (7)✦
Simplex Areas and Expected Counts
An original top-dimensional simplex is a face of with vertices.✦ The action on these simplices is .✦ Choose an enumeration of the vertices of . For an original top-dimensional simplex with enumerated vertices , the simplex graph is the graph induced by in this enumeration✦, the coordinate map is ✦, and the original geometric simplex and its intrinsic interior are (8)✦ The standard simplex vertices associated with are the unit coordinate vectors for .✦
A spanning tree of a graph on is a tree on the same vertices whose edges belong to ; write for the set of spanning trees of .✦ Let denote the th unit vector of , and put and for . The integer reduced incidence matrix of a spanning tree with enumerated edges and chosen endpoint orders is the integer matrix with columns .✦ Regard this matrix over for the tree parametrization (9) For a nonnegative integer and a spanning tree , the tree area of a set is the -dimensional Euclidean Hausdorff measure of its inverse image under the map in (9).✦ The averaged simplex area of a set is the average of its tree areas over the spanning trees of : (10) These measures take values in . For a marked subdivision family , a linear coordinate map , a region , and a degree , the local marked simplex area at is the averaged simplex area in degree of .✦ The original simplex marked area uses the particular interior in (8): (11)✦ The rooted vertex coordinate of vertex is the vector : the root has coordinate zero, and each nonroot vertex has its corresponding unit coordinate vector.✦ An edge enumeration of a spanning tree on is a bijection from onto its edge set.✦ The barycentric parametrization in (9) adjoins a zeroth coordinate equal to one minus the sum of the given coordinates.✦ The real reduced incidence matrix of a spanning tree is obtained from its integer reduced incidence matrix by replacing each integer entry by the corresponding real number.✦
Let be a measure on , and let be finite. Write for the cardinality of the stabilizer of , assigned value zero if that stabilizer is infinite. For , let be its real value when finite and zero when . The stabilizer-normalized expected area is (12)✦ Write for the finite set formed by choosing one representative from each top-simplex orbit.✦ The costs in (7) will be those of (12).
The zero-stratum count and its two expected values are (13) The dimension threshold and the radius associated with a degree bound are (14) A finite orbit-covering face family is a finite collection of faces of such that every face of is for some and .
The Claim
Theorem 1. Suppose has a finite orbit-covering face family. For any measure , any finite , and positive and , there is a separating filtration of radius such that (15)✦
Let be finite and invariant under the action of . Suppose , every vertex of has at most neighbors, and , with and as in (14). For each there is a constant such that every and every separating filtration of radius satisfying obey (16)✦
Under these measure, degree and dimension assumptions, suppose also that has a finite orbit-covering face family. There are constants , chosen for all , such that for every there is a separating filtration of radius satisfying (17)✦ where the expected values are those of (13).
In the paper, the result reads: for the fixed graph , complex , free probability parameter , dimension and radii of Sections 3 and 4, with volume , every admits an admissible equivariant locally constant filtration satisfying for every original top simplex , where depends only on the fixed geometric data, independently of and the complexity of the chosen subdivisions.
What Is Checked
The assertions (15), (16) and (17) concern locally constant equivariant marked subdivisions of , the distance (3) and the costs (12), with finite face-orbit data for the existence assertions and an invariant finite measure under the degree and dimension bounds for the count estimates. The coordinate inclusion is injective.✦