In this paper
AbstractIntroductionTrace rank and the idempotent conjectureThe two parts of the proofRelation to previous workA vanishing theorem for sparse simplicial cyclesA metric and volume bound for connected supportsThe metric and its finite local geometrySimplex areas and distance gradientsThe volume margin in high dimensionEquivariant separating filtrationsA free probability parameterThe allowed filtrationsDimension drop along the entire filtrationLocal replacement and the number of zero strataSuccessive near minimizersDisjoint replacements in the parameter and spatial variablesSlicing and the strict volume marginFrom separating filtrations to finite chainsComponent averages and their finite supportCounting the surviving flagsEquivariant comparison and passage to coinvariantsCycles from an idempotentA fixed graph and finite path sumsEven-dimensional cyclesA Pfaffian cocycle detecting the trace coefficientRelative exponents between liftsThe cyclic Pfaffian identityDescent to an exterior cocycleCompletion of the trace theoremThe integral traceHomotopy idempotents and Lefschetz numbersTorsion-free groups: trace rank and idempotentsReferencesWorksMathematics
The Bass trace conjecture and the characteristic-zero Kaplansky idempotent conjecture
Abstract
We prove the complex group-ring Bass trace conjecture for every discrete group: the Hattori–Stallings trace of a finitely generated projective module over its complex group ring is supported on conjugacy classes of finite-order elements. As a consequence, for every torsion-free group G and every commutative unital domain R of characteristic zero, the only idempotents in are 0 and 1. This proves Kaplansky's idempotent conjecture in characteristic zero.
Introduction
The rank of a projective module over a group ring contains information about individual conjugacy classes. This refinement of ordinary rank is a basic ingredient of group-ring Euler characteristics: alternating sums of projective-module ranks retain information that a numerical Euler characteristic forgets [3, 4]. The Bass trace conjecture asks how much of that information can occur at elements of infinite order. We first specify the complex version of this question.
For a unital complex algebra , let be the Grothendieck group of finitely generated projective right -modules, and set
where is the complex linear span of commutators. An idempotent represents the projective right module , with matrices acting on columns by left multiplication. Its Hattori–Stallings trace is
extended additively to virtual projective classes.
Let be a discrete group and write for its set of conjugacy classes. The quotient identifies with by
Indeed, a commutator has zero sum on each conjugacy class, and the differences of conjugate group elements span the kernel of the displayed map. Such differences are commutators: . All sums arising from an element of have finite support. We write for the coefficient at .
The complex group-ring Bass conjecture asks whether these coefficients vanish on every infinite-order conjugacy class, for every group and every class in ; see [5] Conjecture 2.1 and [11] Conjecture 2.
Theorem 1.1. Let be any discrete group. For every and every infinite-order element ,
Equivalently, if denotes the conjugacy classes of finite-order elements, then
This resolves the complex group-ring formulation positively. Finite-order coefficients need not vanish away from the identity: for a finite group , the idempotent has coefficient at every conjugacy class . The conclusion therefore differs from the identity-only support assertion for integral group rings. That integral assertion follows in Section 9 by combining Theorem 1.1 with the known restriction on its finite-order coefficients.
Trace rank and the idempotent conjecture
For a torsion-free group the identity is the only finite-order element, so Theorem 1.1 also has numerical and ring-theoretic consequences. Define the canonical trace and the augmentation by
For a matrix , put , and let be the entrywise augmentation. The coefficient at of the Hattori–Stallings trace defines
The augmentation also defines the integer-valued augmentation rank
The idempotent conjecture commonly attributed to Kaplansky asks whether, for every torsion-free group and every field , an element satisfying must be or ; see [21], Problem 3. It concerns elements of the group ring itself, not arbitrary idempotent matrices over that ring.
Corollary 1.2. Let be any torsion-free discrete group.
(i) For every and every idempotent ,
Consequently , with viewed as a subgroup of , and
(ii) For every commutative unital domain of characteristic zero, every satisfying
is either or .
Part (ii) resolves the characteristic-zero Kaplansky idempotent conjecture positively, and includes coefficient domains as well as fields. Section 10 derives both parts from the trace theorem. The integer range in part (i) concerns algebraic ; its relation to the reduced -completion is made explicit there.
The integral trace consequence also links the theorem to fixed-point theory. A map is a homotopy idempotent if . Berrick, Chatterji and Mislin’s equivalences [6] [Theorems 1–2] then imply that every homotopy idempotent on a connected closed smooth oriented manifold of dimension greater than two is freely homotopic to a map with exactly one fixed point. They also identify ordinary and -Lefschetz numbers for pointed homotopy idempotents of connected closed smooth oriented manifolds that induce the identity on the fundamental group. Corollary 9.2 states these consequences precisely; Section 9 explains their connection to projective Euler characteristics.
The two parts of the proof
We first describe the algebraic construction to explain the geometric statement it needs. The body of the paper begins with that geometric statement, formulated independently of group rings, and completes its proof before constructing the cycles and cocycles to which it applies.
For a finitely generated group , the algebraic construction starts with an idempotent and one infinite-order element . The finitely many nonzero group coefficients of determine a finite set of steps. Products of matrix coefficients along paths from to , followed by the ordinary matrix trace, give complex weights on finite lists of group elements. Idempotency says that summing over any intermediate vertex removes that vertex. Cyclicity of matrix trace gives a second identity, a cyclic shift whose last vertex is multiplied by .
Project the vertices to the coset set . The group , where is the centralizer of , acts freely on . For every positive even dimension , the weighted lists define a simplicial cycle modulo this action. Its simplices use connected sets of vertices in one graph of bounded degree, fixed as increases. A Pfaffian cocycle evaluates on this cycle as . Here a cocycle means an alternating function on vertex lists that vanishes on simplicial boundaries. The explicit construction and the evaluation occupy Sections 7 and 8.
The geometric part, proved first in Sections 2–6, shows that every invariant cocycle evaluates to zero on cycles of this kind in sufficiently high dimension. We cut the supporting simplicial complex successively into pieces of bounded diameter, choosing the separating sets nearly to minimize their areas. A volume estimate and repeated slicing make the expected number of points in the final zero-dimensional set arbitrarily small. A subdivision construction turns this point count into a bound for cocycle evaluations. Equivariant chain homotopy keeps the evaluation unchanged throughout the construction.
The fixed graph degree makes increasing the dimension useful. Through each vertex there are only exponentially many connected vertex sets of a given size. On an -simplex, Euclidean structures chosen from spanning trees of its vertex set give volume ; repeated slicing produces the same factorial in the comparison with a point of the final separating set. After these factors cancel, radii chosen in terms of the fixed degree bound make the remaining volume ratio tend to zero with . The local replacement argument turns this strict volume margin into the small expected point count. No homological-dimension bound on is assumed.
Two features permit this argument for arbitrary groups. A compact probability space with a free action separates overlapping translates of local modifications, without any amenability assumption. Also, each top simplex has its own averaged Euclidean area functional. The areas need not match along common faces; the successive cuts keep the relevant dimensional measures away from those faces. The cocycles need not be globally bounded: near each original simplex, the construction uses only a fixed finite set of possible vertices. Bounding the cocycle on those lists suffices for the evaluation estimate.
The final assembly in Section 9 chooses a large even dimension, forcing the individual trace coefficient to vanish. Passing from finitely generated groups to arbitrary groups uses the exact sum over subgroup conjugacy classes contained in an ambient conjugacy class. Section 10 then extracts the augmentation rank from the identity coefficient. In the scalar case this rank is 0 or 1, and the standard faithful-trace argument forces the idempotent itself to be 0 or 1. A finite-coefficient reduction extends that conclusion from complex coefficients to every commutative characteristic-zero domain.
Relation to previous work
The rank construction comes from Hattori and Stallings [16, 24]; Bass developed its relation to Euler characteristics and formulated the integral conjecture in [3]; see also [4], Conjecture (4.5). Bass proved complex trace vanishing at infinite-order elements for linear groups [4], Theorem (6.1)(f). For the integral trace, Linnell established a restriction on the possible nonzero coefficients [19], Lemma 4.1, later recovered through topological Hochschild homology by Berrick and Hesselholt [7], Theorem A. Its finite-order consequence is the input used in Section 9.
The scalar idempotent problem also has a long history of trace methods. Formanek proved the characteristic-zero conclusion for torsion-free groups satisfying the ascending chain condition on subgroups [15], Theorem 1. Burger and Valette revisit the theorems of Kaplansky and Zalesskii: the canonical trace of a complex scalar idempotent lies in , its endpoints force the idempotent to be trivial, and its value is rational [9], Theorems 1.3 and 2.1. They also obtain [9], Corollary 1.2. Rationality still permits nonintegral values strictly between zero and one. For torsion-free groups, Theorem 1.1 identifies the trace with augmentation rank, which excludes those values. The subsequent faithful-trace argument is classical and is included in Section 10.
Broader group classes have been treated by algebraic and analytic methods. Farrell and Linnell proved the complex Bass statement for elementary amenable groups as part of a result over integral domains [14], Theorem 1.6. Berrick, Chatterji and Mislin obtained it for amenable groups through rational surjectivity of the degree-zero Rost assembly map for countable groups [5], Theorems 1.3–1.4 and Lemma 1.5. Their result concerns the stronger trace assertion on , with finite support on finite-order classes. An algebraic route uses induction from finite subgroups: the Farrell–Jones conjecture with complex coefficients implies the complex Bass statement [2], Theorems 1.5 and 1.9. The present proof uses the finite support of group-ring idempotents throughout; it requires neither an assembly hypothesis nor a statement about a completed group algebra.
For some groups, analytic methods give a stronger idempotent conclusion in the reduced group -algebra , the operator-norm closure of acting on . Using Lafforgue’s Banach -theory, Mineyev and Yu proved this for torsion-free subgroups of hyperbolic groups [20], Theorems 19–21. Puschnigg independently obtained the torsion-free hyperbolic case through local cyclic homology [23]; see also [20], Section 6. Our conclusion for arbitrary torsion-free groups concerns the group ring and the trace on its algebraic , as distinguished in Section 10.
The higher-dimensional algebraic construction has antecedents in the cyclic-homological approach to the conjecture. Connes constructed a pairing of even cyclic cocycles with projective classes [12], Part II, §2, Proposition 14. Burghelea’s decomposition of cyclic homology by conjugacy classes identifies the infinite-order components through the reduced centralizers [10]. Eckmann used higher-degree vanishing to obtain trace vanishing over rational group rings for specified classes of groups of finite rational homological dimension [13]. Sections 7–8 give direct finite-chain constructions in this tradition, including the normalization of the Pfaffian detector; no cyclic-homology theorem is needed as an input. The sparse-chain theorem replaces a homological-dimension hypothesis with connected-support control on the particular cycles.
The geometric proof develops the separating-set method of Papasoglu [22], the separating filtrations and simplex-counting argument of Alpert [1], and the Cantor-parameter approach of Braun and Sauer [8]. Alpert’s equivariant formulations [1] provide the closest model for the local comparisons. Alpert’s filtration results concern manifold geometry and compatible metrics. We give the full piecewise-linear argument needed for simplex-dependent areas and arbitrary cycles in the coinvariant chain complex. The separate Pfaffian calculation converts this geometric vanishing into a statement about each conjugacy-class coefficient.
A vanishing theorem for sparse simplicial cycles
We formulate the geometric statement independently of group rings. Its input is a graph with a free group action and a simplicial complex whose top-dimensional vertex sets are connected in that graph. Its output is the vanishing of every invariant cocycle evaluation in sufficiently high dimension.
For a set , let be the vector space with basis , consisting of finite linear combinations. The augmented chains of the full simplex on are
The differential is contraction with the functional :
In degree zero this is the augmentation to ; the empty wedge is . For a simplicial subcomplex , its augmented oriented chains form a subcomplex of .
If a group acts on , it acts on both chain complexes by permuting vertices, with the signs prescribed by the exterior product. For an -module , its coinvariants are
The differentials induce differentials on coinvariants. A cycle in is a class whose boundary is zero there; an arbitrary finite chain representing it need not have zero boundary before passage to coinvariants. An -invariant linear functional descends to . We call it a cocycle when on .
Theorem 2.1 (Sparse-chain vanishing). For each integer there is an integer with the following property. Let be the vertex set of a countable connected simple graph of degree at most , and let a countable group act by graph automorphisms, freely on vertices. Suppose and is an -invariant subcomplex of the full simplex on such that: (i) is generated by its -simplices and has finitely many -orbits of simplices;
(ii) the vertices of each -simplex span a connected subgraph of .
Then every -invariant cocycle evaluates to zero on the image in of every cycle in .
The bound depends only on the graph degree, not on , or . There is no boundedness hypothesis on . We will bound it only on a finite set of basis wedges associated with each fixed original simplex. This distinction is necessary in the application.
For the proof assume ; the empty case has no positive degree chains. Its realization consists of finitely supported probability vectors whose supports are simplices of . A simplex will also denote its closed affine realization; denotes its relative interior. We call simplices of original to distinguish them from the later subdivisions, and call its -simplices top simplices.
The proof has three steps. First, we choose a metric and simplexwise areas for which balls have small volume in high dimension. Second, we construct separating filtrations with very few points in their final stratum, on average over a free probability parameter. Third, we use their subdivisions to construct equivariant chain maps homotopic to inclusion whose cocycle evaluations approach zero. Each approximation uses a finite filtration; no limiting filtration is needed.
A metric and volume bound for connected supports
We work with the graph , group , and nonempty -dimensional complex of Theorem 2.1, where . We need two kinds of geometric control: a metric with finite neighborhoods in which to make cuts, and Euclidean area functionals for which those cuts satisfy a slicing inequality. We will use a scaled transportation metric on and, separately inside each top simplex, Euclidean structures determined by its spanning trees. Each top simplex will have volume , while every affine branch of a distance function will have gradient norm at most one in each of these structures. Counting the possible connected vertex supports will then give the ball-volume estimate used in the separating argument.
The metric and its finite local geometry
Represent a point of by a probability vector on whose support lies in a simplex of . Let denote graph distance and define
This is the scaled Kantorovich–Rubinstein metric on finitely supported probability measures, in its Lipschitz-potential form [18], pp. 1381–1382. We establish its needed properties directly. Only finitely many terms occur in the pairing. To see that the supremum is finite and describe the distance function on each simplex, let be a nonempty finite set and put
This is a nonempty compact polytope. Indeed, its difference constraints and zero mean bound every coordinate by . Each extends to a 1-Lipschitz function on by
The difference constraints show that this extension agrees with on , and the triangle inequality proves that it is 1-Lipschitz. Conversely, a global 1-Lipschitz function restricts, after subtraction of its mean, to an element of . Constants pair to zero with . Consequently, when contains both supports, the supremum in (2) is the maximum over .
Symmetry follows by replacing with , and the triangle inequality follows by applying each potential to . The indicator of a single vertex is 1-Lipschitz for , so
Thus separates points and is a metric. It is -invariant because graph automorphisms permute the admissible potentials. On probability vectors supported in a fixed finite set, it is the restriction of a norm on the finite-dimensional space of vectors with coordinate sum zero. It therefore gives the usual topology on every finite subcomplex.
For , write
On a fixed closed simplex , the function is a maximum of finitely many affine functions: use the extreme points of . Here denotes the vertex set of . Taking all these extreme points makes the collection of affine branches equivariant under .
Lemma 3.1. Every closed -ball meets only finitely many simplices of . The complex is locally finite, and gives its usual realization topology and is proper. For each , , and simplex , the set
is finite. The setwise stabilizer of a nonempty simplex is finite as well.
Proof. Let . The function is 1-Lipschitz and vanishes on . Using its negative in (2) gives
If a top simplex meets at , it therefore contains a vertex within distance of . The graph on its vertices is connected, so every vertex of is within another steps of that vertex. Thus all such simplices use vertices in the finite graph neighborhood
There are only finitely many possibilities for and its faces. Likewise, every top simplex containing a specified vertex uses vertices in ; hence each vertex has a finite star.
For completeness, the finite-subcomplex topology statement implies the corresponding statement on all of . Given , let . By (3), the ball of radius about lies in the finite star of . Within this star the metric and realization topologies agree. The open star of is also a neighborhood of in the locally finite realization, so the agreement is local in both topologies. A closed metric ball is a closed subset of the finite union of closed simplices it meets, and is therefore compact.
If meets , eq:3 supplies and with . For each , the map is injective because acts freely on vertices. The finitely many pairs and finite graph balls therefore allow only finitely many . Finally, for , the same injection maps into . In particular, .
We will also use the following consequence. For fixed and , only finitely many satisfy
Indeed, an intersection gives , and then eq:3 puts some vertex of within distance of . The same injectivity argument applies.
Simplex areas and distance gradients
The metric now provides finite neighborhoods in which we can make cuts. For area comparisons, we use Euclidean structures separately inside the top simplices. They need not agree on shared faces.
Fix a top simplex . For each spanning tree of the connected graph on , equip its affine span with the Euclidean structure in which the tree-edge vectors , with either orientation for each edge, form an orthonormal basis of the translation space. For , let be the average, over these finitely many trees, of Euclidean -area on polyhedral subsets of of dimension at most . We allow relatively open faces in these sets; pieces of dimension less than have zero -area, and is counting measure. These area functionals are covariant under , since the action permutes the spanning trees.
Lemma 3.2. In every tree Euclidean structure on a top simplex , its -volume is . Every affine branch of has gradient of norm at most one, for every . The same gradient bound holds after restriction to any affine subspace of the span of .
Proof. Root the tree at , orient its edges away from the root, and order the remaining vertices so that each parent precedes its children. Put
Each is the sum of the along its root path. Thus the change-of-basis matrix is triangular with diagonal entries one. The are an orthonormal basis in the chosen metric, so the parallelepiped spanned by the has volume one. The simplex has volume .
An affine branch has derivative along equal, up to sign, to
for a 1-Lipschitz potential . Since the two vertices are adjacent, this derivative has absolute value at most . The squared gradient norm is the sum of the squares of these derivatives and is at most one. Restriction to an affine subspace replaces the gradient by its orthogonal projection, which cannot increase its norm.
The volume margin in high dimension
We next bound the total top-dimensional area of a metric ball by counting its possible connected vertex supports. Fix
For a specified vertex , there are at most connected sets of vertices containing . To prove this, choose a spanning tree of each such set rooted at . A traversal using each tree edge once in each direction is a walk of length , starting at , whose visited set is exactly the prescribed set. Choosing one such walk per set gives an injection into the length- walks from , of which there are at most .
Set . A graph ball of radius has at most
vertices, since . As , there are at most vertices within distance of . By (4), each top simplex meeting contains one of them. The connected-set count and Lemma 3.2 therefore give, for every ,
Counting a simplex more than once only enlarges this upper bound.
With fixed, the ratio of this estimate to is
Indeed, its logarithm is . We may therefore choose so that, for every ,
For the remainder of the geometric proof, fix such an . The graph degree bound , and hence and , remain fixed as dimensions increase. The strict margin (3.6) will convert successive area comparisons into a bound on the number of points at the bottom of a separating filtration.
Equivariant separating filtrations
We retain the complex , the metric , and the radii from Section 3. We will repeatedly cut into pieces of diameter at most , lowering the dimension of the separating set at each step. The cuts vary over a compact probability space on which acts freely. This allows local modifications to be separated after taking account of the parameter, even when their translates overlap in .
A free probability parameter
The following construction is a finite-color variant of the coinduction argument in Braun and Sauer [8], who credit the existence theorem to Hjorth and Molberg [17]. We include the construction, including its torsion case, so that no free-action theorem is an input.
Lemma 4.1. Every countable group admits a continuous free action on a compact metrizable zero-dimensional space , preserving a Borel probability measure .
Proof. For , put if has finite order, and otherwise. Let
This is a closed subspace of the product of finite discrete spaces . Choose a representative for each left coset . A coloring in is specified uniquely by offsets , through . This is well defined also when has finite order, because the modulus is then its order. Thus is nonempty, compact and zero-dimensional.
Give the offsets independent uniform distributions. The left action
preserves and its probability measure: it permutes the cosets and adds a fixed element of to each offset. These operations preserve every finite cylinder probability. Take the product over to obtain and . Countability gives metrizability, and the coordinatewise action is continuous and measure preserving. For any and any point of , its -coordinate satisfies
Hence no nonidentity element fixes a point. If is trivial, take a one-point probability space.
Fix such for the rest of the geometric argument. In particular, no amenability assumption on is needed.
The allowed filtrations
A triangulation refining means a finite affine simplicial subdivision of each closed original simplex, with agreement on shared faces. A family of such triangulations, together with specified subcomplexes, is locally constant if, on each original simplex, all its exact affine simplices and subcomplex markings are constant on the pieces of a finite clopen partition of . The partition may depend on the original simplex. We require equivariance: , and likewise for every specified subcomplex. Refinement of triangulations always preserves their earlier subcomplexes.
Begin with and . At stage , where , suppose that is a subcomplex of . An admissible next choice consists of a locally constant equivariant refinement and its subcomplex such that
;
for every simplex of contained in ,
(iii) every connected component of has -diameter at most .
A negative dimension bound means that the intersection is empty. Thus the new separator avoids the vertices of and meets each higher-dimensional face in lower dimension; its own vertices belong to the finer triangulation . Connected components use the subspace topology given by . We call a filtration satisfying these conditions admissible. In particular, these conditions imply .
The local operation behind the construction is easiest to describe at a fixed parameter. For a separator , a center , and , remove the part of inside the ball and insert the corresponding slice of :
The inserted slice prevents a component of from passing between the ball and its exterior. Inside the ball its diameter is at most ; outside, the old separator remains. The next lemma makes this operation compatible with triangulations, group translates, and clopen parameter choices. It also constructs the level cuts used to start a filtration. Only the affine descriptions of distance levels enter the construction; no Euclidean metrics need to agree across faces.
Lemma 4.2 (Compatible cuts). Fix locally constant equivariant triangulation families and , where refines , and subcomplex families and with . Let be a countable equivariant family of centers and clopen sets . Assume that only finitely many of the balls meet any given original simplex. Set
Outside a countable set of radii , there is a locally constant equivariant triangulation refining in which both
are subcomplexes. Each inserted level meets every face of or in dimension at most . Consequently, if satisfies the dimension-drop condition relative to , both displayed sets do also. If every component of has diameter at most , the second displayed set preserves that property.
Proof. On a fixed original simplex the function is a maximum of finitely many affine functions. For a fixed face , a level can have full dimension in only if one of these affine functions is identically on the affine span of . Otherwise the level is contained in a finite union of proper affine hyperplanes. Thus only finitely many levels are exceptional for this face and center. There are countably many original simplices and centers, and only finitely many exact triangulation types on each original simplex. Excluding the resulting countable union of exceptional levels gives the stated dimension drop simultaneously for all faces of and .
We give the compatible refinement explicitly. On each original simplex , cut the simplices of by all hyperplanes , where is an affine branch for one of the finitely many relevant centers. Use the canonical branch collection from the finite potential polytope in Section 3. On each piece of the finite clopen partition recording the old data and active conditions, this gives a finite polytopal complex . It represents the old subcomplexes and the closed conditions defining the two sets in (6). These polytopal complexes may initially disagree on original faces. For each original simplex , let be the common polytopal refinement of
over all original cofaces , including . There are finitely many cofaces by Lemma 3.1. The common refinement consists of the nonempty intersections of cells and their faces. If is a face of , then refines , since every coface of is also a coface of .
Triangulate the original simplices in increasing dimension. When handling , its boundary has already been triangulated by a refinement of the boundary restrictions of . Extend this triangulation over the cells of in increasing cell dimension. Keep cells in the original boundary as already triangulated. For every other positive-dimensional cell, cone its triangulated boundary to the arithmetic mean of its vertices, which lies in its relative interior. Zero-dimensional cells need no operation. The cones agree on common faces and give the desired finite affine subdivision, preserving the prescribed boundary triangulation.
Every operation commutes with the affine maps induced by : restriction, common refinement, and the mean of the full vertex set of a polytope are all canonical. This proves equivariance even for nontrivial simplex stabilizers. On each original simplex the procedure uses only finitely many data: those on its faces and their original cofaces, together with finitely many relevant cuts. A common finite clopen partition makes all these data constant. Thus the output has the required local constancy. No manifold condition on is involved.
The first set in (4.1) has the dimension bound already proved for the levels. The second is contained in the union of those levels with , so it has the same bound whenever does. For its separation property, let be a component of its complement in . If meets an active , continuity of and connectedness of imply that stays in that ball, since it avoids the inserted level. Its diameter is then at most . Otherwise lies outside all active open balls, where the old set was retained. It is therefore contained in an old component of and has diameter at most . □
The genericity against is useful when already contains the old separator : intersections of an inserted level with its faces have one less dimension. The later area comparison will use precisely this conclusion. The lemma itself does not require disjoint active balls; disjointness will be imposed when their areas are counted.
Lemma 4.3. For any allowed choices through stage , an allowed choice of exists. Hence a filtration can be continued to .
Proof. Each original simplex is compact in . Cover representatives of the finitely many original simplex orbits by finitely many open balls , and take all their -translates. These balls cover . By Lemma 3.1, only finitely many translated radius- balls meet a given original simplex. Apply Lemma 4.2 with every activation set equal to , with , and with . For a common allowed radius , take
This is a subcomplex of the resulting refinement and has the required dimension drop. If is a component of , choose and a covering ball containing it. The connected set avoids and contains a value below , so . Its diameter is at most . The assertion is vacuous for an empty component space. □
Dimension drop along the entire filtration
We record the consequence that will control chains in Section 6. For any simplex of contained in and any ,
Indeed, the first step is the defining condition. Its intersection is a subcomplex in the next refinement. Applying the next dimension drop to each simplex of that subcomplex decreases its maximal dimension by one. Induction gives (4.2). Applied with , this also shows that a proper original face meets in dimension strictly less than .
Lemma 4.4 (Carriers of the zero-dimensional stratum). Let be an allowed filtration and let . For every , there is a unique -simplex of contained in and containing . The point lies in its relative interior. In particular, every point of lies in the interior of an original top simplex.
Proof. Let be the unique simplex of whose relative interior contains . Since is a subcomplex containing , it contains , and . If , then (4.2) with would make empty. Thus . Every other simplex containing has as a face, so no other -simplex contains it. Taking proves the last assertion.
We have obtained a nonempty class of equivariant separating filtrations, together with a local cutting operation that stays within that class. The next section chooses separators with area close to the infimum and compares them with these cuts.
Local replacement and the number of zero strata
We now choose the separating filtration so that its zero-dimensional set has small expected cardinality in each original simplex. Throughout this section the graph, complex, parameter space, dimension, and radii are fixed as in Sections 3 and 4. In particular, the strict inequality (3.6) holds. Only the filtration will depend on a positive number .
Proposition 5.1. For every there is an admissible equivariant locally constant filtration such that, for every original top simplex of ,
Here depends on the fixed geometric data but is independent of and of the complexity of the chosen triangulations.
Successive near minimizers
The comparison with a cut through a ball follows the separating-set method of Papasoglu [22], Section 2, especially Lemma 2.5, and its iterated and equivariant forms in Alpert [1], Lemmas 6–7 and 11–12. We prove the comparisons for our simplex-dependent areas, retaining the error from each near minimizer.
Proof of Proposition 5.1. For an equivariant family of dimension at most , define
The sum runs over representatives of the original top simplices, and is the finite setwise stabilizer of . This quantity is finite for an admissible family. There are finitely many representatives, and, on each, local constancy and compactness of give finitely many finite polyhedral configurations, each of finite area.
Start with . At step , keep all previously chosen data fixed and choose the admissible pair so that is within of the infimum over the admissible choices at this step. Lemma 4.3 ensures that this class is nonempty. Its infimum is a finite nonnegative number, so such a choice exists. Consequently, for every admissible replacement at this step,
Neither an attained minimum nor a limit of filtrations is used.
Disjoint replacements in the parameter and spatial variables
Fix a center . The set
is finite. Indeed such an intersection implies ; the support-distance bound, the finite graph balls and freeness on vertices then leave only finitely many possibilities for .
There is a finite clopen partition of into sets satisfying for every . To construct one, use the free action and the zero-dimensional Hausdorff topology to choose, around each , a clopen neighborhood disjoint from its translates by this finite set. A finite subcover exists by compactness; the atoms of its common refinement have the required property. Thus
is a pairwise disjoint family. {#eq:5.4}
This partition is fixed independently of . The assertion concerns the product of parameter and spatial variables; the sets alone need not be disjoint.
Fix one atom and any clopen subset . For put
For a generic , also put
These sums involve only finitely many original simplices. Unlike (7), they run over all such simplices and carry no stabilizer weights.
At stage , write and . For each , make the simultaneous replacement
The active closed balls are pairwise disjoint by eq:5.4. The families of balls and levels are locally finite, and their use is conditioned on clopen sets, so the construction is equivariant and locally constant on every original simplex. Apply Lemma 4.2 with , , , , and the centers and activation sets . Outside a countable set of levels, it represents by an admissible common refinement: the inserted levels have the required dimension drop on faces of and of the old finer triangulation , and the lemma preserves the diameter bound on components of .
We next compute the change in (7). Genericity against the faces of implies that the old set meets any inserted level in dimension at most . When , that intersection is empty. Hence the removed -area is unchanged if the open ball is replaced by its closure, and the inserted cut has zero -area overlap with the retained old set.
The normalization in (7) makes the removed area exactly and the inserted area exactly . Here is the orbit-counting identity behind this assertion. Let denote the relevant equivariant set, and let denote either the ball or the level. Covariance of area and invariance of give
The map takes each value in the simplex orbit exactly times. All local contributions are nonnegative, and only finitely many translates meet any fixed representative simplex. The disjointness and zero-overlap statements above therefore yield
Combining this identity with (8) gives
Slicing and the strict volume margin
We have compared the area of a separating set inside a ball with that of a cut through the preceding set. Slicing now connects these comparisons across the successive dimensions.
Work first in one original top simplex and one of its tree metrics. Decompose into affine polyhedral pieces on which is affine. On a -dimensional piece , its tangential gradient has norm by Lemma 3.2. Euclidean slicing perpendicular to that gradient gives
A constant branch contributes at only one level. Pieces of dimension less than , including interfaces of this decomposition, have zero -slice area outside finitely many exceptional levels. Averaging over the tree metrics, summing over original top interiors, and integrating over yields
These operations are legitimate by local finiteness and local constancy; on the fixed ball only finitely many configurations are involved. Every comparison has taken place in a single simplex metric before averaging, so no compatibility of metrics across original faces is needed. Indeed (4.2) bounds on a proper original face by dimension , and its generic level slice by dimension . Such faces contribute no area to the preceding comparison. The same dimension estimate says that misses every proper original face.
Induction, beginning with the monotonicity of , gives
Set
Since , the volume bound (5) implies
We may now choose
This set is clopen: finitely many original simplices meet the ball, and their exact filtration data are constant on a common finite clopen partition. Although uses the completed filtration, its use in an earlier comparison is legitimate. Inequality (8) holds for every admissible competitor with the data down to stage fixed; it imposes no condition on the later stages. The same can therefore be used in every comparison leading to (12).
Each contributes at least one zero stratum, and each such point lies in a unique original top interior. Thus . Moreover is the integral of the point count over all of , because that count is zero on . The strict inequality now gives the direct expected-count bound
To pass from the ball estimate to (5.1), cover a fixed original top simplex by finitely many open -balls with fixed centers . Such a cover exists by compactness of the simplex. For each center, use the fixed clopen partition constructed above, and write for its number of atoms. Sum (13) over these atoms and then over the balls. Since the corresponding closed balls also cover , this proves (5.1) with
All quantities in this constant were fixed independently of . In particular, no bound on the number of subdivision simplices or on the cardinality of an individual zero-dimensional fiber is needed.
From separating filtrations to finite chains
Fix the dimension and radii chosen in Section 3. For each , use the filtration supplied by Proposition 5.1. We will turn it into an -equivariant chain map
that is equivariantly chain homotopic to inclusion. Its evaluation by a fixed invariant cocycle will tend to zero. These two properties prove Theorem 2.1. Throughout this section remains fixed while tends to zero.
Component averages and their finite support
For a fixed parameter , take the barycentric subdivision of the final triangulation . Its vertices are the barycenters of nonempty simplices of . Define
All are subcomplexes of , so is equivalent to . Let be the connected component of containing . For any such component , set
The next lemma proves that is finite and controls these labels as varies. The intended image of an oriented barycentric simplex is
This choice uses the separating filtration in a specific way. If nested faces have the same level , the segment joining their barycenters lies in . Except at its endpoint , it lies in the relative interior of , which the subcomplex misses; the endpoint also avoids by its level. The two barycenters therefore receive the same component vector, making any exterior term containing both zero. Along a complete flag , with , the levels are nondecreasing: if , then . A nonzero image must consequently use all levels , beginning at a point of . We will bound the number of these flags after establishing that the labels define finite chains.
Lemma 6.1. For every original simplex of , there is a finite set , independent of and , such that whenever . The triangulation over , together with all its assigned vectors , is locally constant in . These assignments are equivariant.
Proof. Each component of has -diameter at most . For the components are singletons, since is a locally finite zero-dimensional subcomplex. If and , the support-distance bound from Lemma 3.1 gives
Choose an original top simplex containing . Its vertices span a connected graph, so every vertex in is within graph distance of the vertex furnished by this inequality. Consequently we may take
The bounded degree of makes this set finite. Notice that the support of need not itself span a connected graph; we used the containing top simplex.
Let be the finite subcomplex consisting of the simplices whose vertices belong to . The whole component lies in its realization. It follows that is exactly the component containing in
Indeed is a connected subset of this restriction, and every connected subset of the restriction containing also lies in the original component. Thus restricting to this finite subcomplex does not cut off a part of the component needed to compute .
There are finitely many original simplices in . A common refinement of their finite clopen parameter partitions makes all their triangulation and filtration data constant. On each resulting piece the components and their sets of support vertices are constant as well. This proves local constancy of the assignments over . Finally, , and hence , proving equivariance.
Subdivide each oriented original simplex into its fundamental subdivision chain and apply the exterior assignment (6.2) to every term. This defines a map . Both operations commute with the augmented boundary. For subdivision, interior facets cancel in pairs and the boundary facets give the compatible subdivision on each original face. For the second operation, each assigned vector has coefficient sum one, so contraction with the coefficient-sum functional gives
Thus is an augmented chain map.
By Lemma 6.1, its value on any original simplex is constant on a finite clopen partition and is supported in a fixed finite exterior space. We may therefore define
This integral is an actual finite chain: for every it is a finite linear combination of finitely many chain values. It commutes with the augmented boundary. Moreover, , so invariance of shows that is -equivariant.
Counting the surviving flags
We now bound the evaluation of on a top simplex. The number of subdivision simplices may depend on ; the following bound depends instead on the number of zero-stratum points. The component-labeling and flag-counting method is modeled on Alpert [1], the carrier argument below supplies the bound without a manifold hypothesis.
Lemma 6.2. For every original top simplex and every , at most
terms in its fundamental barycentric subdivision chain have nonzero images under the exterior replacement map.
Proof. Suppress . Such a term corresponds to a complete flag
in the restriction of to . As shown when defining (6.2), a nonzero term has levels exactly . In particular for a point and for every .
By Lemma 4.4, lies in the relative interior of a unique -simplex of contained in . To see why this carrier controls the final refinement, let occur in a surviving flag through . The -carrier of a relative-interior point of contains by refinement and belongs to , because is a subcomplex. That carrier has dimension at least , since it contains , and at most , since . It contains , so it equals . Hence .
For a fixed preceding face , the possible are thus full-dimensional simplices in a triangulation of the single affine -simplex , having as a facet. There is at most one on either side of the affine hyperplane spanned by that facet. Otherwise two simplices on the same side would have intersecting relative interiors near an interior point of the facet. There are therefore at most two choices at each stage and at most surviving flags through . Summing over proves the assertion. This argument concerns one carrier simplex at a time and uses no manifold assumption on or on the strata.
Figure 1 illustrates the two choices at each of the two stages when .

Figure 1. The flag count in dimension two. The point has two possible incident edges along its one-dimensional carrier. Each edge has at most two incident triangles inside the original two-dimensional carrier. The four shaded triangles give the four possible flags through in this example. The unshaded triangle has no one-dimensional-stratum edge through .
Let be the invariant cocycle in Theorem 2.1. For an original top simplex , put
This is finite, even though need not be bounded on all basis simplices of the infinite vertex set. Every vector in (14) is a nonnegative convex combination of vertices in . Multilinearity therefore bounds the evaluation of each surviving term by . The preceding lemma and Proposition 5.1 give
All constants here are independent of . Since chains have finite support, the same convergence holds on every fixed .
Equivariant comparison and passage to coinvariants
It remains to show that the small evaluations just obtained equal the original cocycle evaluation on every coinvariant cycle. We do this by constructing a homotopy before taking coinvariants.
Lemma 6.3. Let be a simplicial complex with an -action and finite setwise simplex stabilizers. Let be the augmented exterior chain complex on a nonempty -set. Any two -equivariant augmented chain maps that agree in degree are -equivariantly chain homotopic.
Proof. The target is acyclic as an augmented complex. Indeed, for any fixed vertex , the operator satisfies
This contraction need not be equivariant. We use it only to choose finite fillers and then impose equivariance by finite averaging.
Set . Suppose the homotopy has been constructed below degree . For an oriented -simplex , the residual
is a cycle, by the chain-map identities and the previously constructed homotopy. Choose a finite chain with . Let be the setwise stabilizer of and let be its orientation character, so that . The residual is equivariant, and hence . Define
Then and . Choose such a filler for one oriented representative of every simplex orbit, put , and extend equivariantly and linearly. The orientation-character identity makes the extension well-defined, including when the stabilizer reverses orientation. This gives in degree and completes the induction. □
Proof of Theorem 2.1. The geometric construction applies for every sufficiently large depending only on , as fixed by (3.6). For nonempty , construct as above. The stabilizers are finite by Lemma 3.1, and and inclusion both induce the identity in augmented degree . Lemma 6.3 supplies an equivariant homotopy
Let be a cycle of and choose a finite chain lift . We do not assume that is a cycle before taking coinvariants. Its boundary is a finite sum of differences . Equivariance of the homotopy makes another such sum, which the invariant functional annihilates. The cocycle identity annihilates . Thus, for every ,
The right-hand side tends to zero by (15), whereas the left-hand side does not depend on . Hence it is zero. The evaluation depends only on the coinvariant class because is invariant. For empty there is no nonzero top chain to consider. □
Cycles from an idempotent
We now return to group rings. For an idempotent and one infinite-order conjugacy class, we will construct cycles in every positive even degree. Their vertices follow steps in one fixed graph of bounded degree. In sufficiently high dimension, the supporting complexes will therefore satisfy the hypotheses of Theorem 2.1. We first record why it suffices to perform this construction for finitely generated groups.
The use of cyclic idempotent expressions and reduced centralizers has its conceptual background in Connes’s pairing with projective classes [12] and Burghelea’s conjugacy-class decomposition [10]. Our finite path identities and the detector’s normalization are proved directly; no cyclic-homology identification is assumed.
Lemma 7.1 (Subgroup locality). Let be an inclusion of discrete groups. Extension of scalars defines , and for every and ,
Only finitely many terms are nonzero. Moreover, every is induced from a finitely generated subgroup, which may be required to contain any prescribed finite subset of . Consequently, the finite-order-support assertion of Theorem 1.1 for all finitely generated groups implies that assertion for all discrete groups.
Proof. We regard free right modules as columns: an idempotent acts on the left, with image . Tensoring the split decomposition defined by with identifies the extended image with . The coefficient sum in an ambient class is the sum of its coefficient sums over all -classes contained in . This proves (7.1) for the image of an idempotent and then, by subtraction, for every virtual class. Finiteness follows from the finite coefficient support of the matrices representing that class.
Write an arbitrary as the difference of the classes of two finite idempotent matrices. The group generated by their coefficient supports and the prescribed finite subset is finitely generated. The same matrices are idempotent over its group ring, since that ring embeds in , and their difference induces . Finally, if an ambient class consists of infinite-order elements, so does every subgroup class occurring in (7.1): subgroup inclusion preserves the order of an element. Vanishing of each subgroup coefficient therefore gives vanishing of the ambient coefficient. This uses all the subgroup classes in the sum, since an ambient conjugacy class can split into several of them. □
A fixed graph and finite path sums
For the rest of this section, fix a finitely generated group , an idempotent , and an infinite-order element . Write
The set is finite. Idempotence says that for every . Thus the matrix-valued kernel
is invariant under simultaneous left translation and satisfies
All these sums are finite. In particular, the order of the matrix factors agrees with the column convention for right modules.
Put
Choose a finite symmetric generating set containing and its inverses. Give the simple undirected graph whose edges join to for ; loops are omitted and repeated edges identified. The graph is connected and has degree at most the fixed integer
The group acts by left multiplication. This is well-defined because centralizes , and it preserves right-step edges. It is free on vertices: with implies for an integer , and hence . Both and are countable. We keep this graph and this value of throughout all subsequent choices of dimension.
For , let , with simultaneous left translation on tuples. Define the weight of a tuple by
where . These weights are -invariant. They define a finite complex linear combination of elements of . Indeed, a nonzero weight has increments
in , with
An increment list determines the tuple from . Any two choices of with this conjugate differ by left multiplication in , so the list determines at most one element of . Hence has at most nonzero coefficients. For a -invariant function on , write for the finite weighted sum of its values. These weights need not be real or positive.
Lemma 7.2 (Path identities). For the path sums associated to and , the twisted cyclic shift
preserves . For , deletion of any entry induces a map satisfying
Every has the same total weight
Proof. The shift is a -equivariant bijection, with inverse
For , the shift is the identity on , since . For , the shifted weight has the factors of (17) in cyclic order, since . Cyclicity of the matrix trace proves .
For deletion, fix a representative of the shorter tuple. Each orbit in its fibre has a unique representative with exactly those retained entries, because simultaneous left translation acts freely on any nonempty tuple. Thus the fibre sum is over the missing entry in , without a stabilizer factor. Internal deletions follow from (7.2), as does deletion of the last entry using
For the first deletion, fix and put , with when . Then
Here the first equality uses trace cyclicity and left invariance; the second uses (7.2) with the substitution . This also proves the assertion for . The kernel has finite row and column support, so every fibre sum used in these computations is finite.
The deletion identities show that all total weights equal . Finally,
is a bijection: equality of the conjugates is equivalent to . Therefore , which is precisely the indicated Hattori–Stallings coefficient.
Even-dimensional cycles
The path identities now turn the finite sums into cycles. We use the exterior complex on the graph . For , define
The map is well-defined because changing a tuple by an element of changes its projected vertices by a simultaneous -translation. Set , and, for , set
Proposition 7.3. For every positive even integer , the chain is a cycle. Moreover, either its defining sum has no nonzero distinct-vertex terms, so , or it is the image of a cycle in for an -invariant simplicial complex generated by -simplices, with finitely many simplex orbits, whose top vertex sets span connected subgraphs of . The graph and its degree bound are independent of .
Proof. Since , the twisted shift projects to the cyclic permutation of the wedge factors. Hence
Together with , this shows that whenever is even. The deletion identities give
For even , it follows that .
A tuple with repeated projected vertices contributes zero to the wedge. For every remaining tuple with nonzero weight, consecutive projected vertices are joined by edges from the fixed step set . Their path visits all its vertices, so the subgraph spanned by those vertices is connected. Let be generated by these vertex sets and their -translates. Finite support of gives finitely many orbits of top simplices and of their faces.
The same finite expression for defines a chain in . To see that its boundary is zero there, decompose in every degree as the direct sum of the span of the oriented simplices belonging to and the span of all other oriented simplices. Both summands are -invariant, including their orientation signs. Thus
In particular the inclusion remains injective after taking coinvariants. The boundary of the chain in maps to , so it is zero already in .
We have obtained the required sparse cycles in arbitrarily large even degrees. The underlying path sums all have total weight , the trace coefficient in (18). The next section constructs a cocycle whose value on recovers a nonzero scalar multiple of that coefficient.
A Pfaffian cocycle detecting the trace coefficient
Retain the finitely generated group , idempotent, infinite-order element , and notation of Section 7. We construct an -invariant cocycle whose value on is . The construction first records the relative powers of between two lifts of vertices of . An alternating Pfaffian expression will then remove the dependence on those lifts.
Relative exponents between lifts
Lemma 8.1. There is a -invariant function such that
Proof. The diagonal -action on the set of ordered pairs is free, because its action on the first coordinate is free. This also applies to diagonal pairs . For each orbit choose a representative and lifts . For , there is a unique carrying the appropriate representative to the projected pair. Choose a lift and write
For fixed , the integers are unique because has infinite order. Replacing by replaces them by . Thus is well defined. Commutation with shows that is -invariant, and independently changing the two lifts gives
The antisymmetrization
has all the required properties.
The function itself need not descend to . In fact, (19) gives even though these two lifts project to the same vertex. Nor is there a difficulty if an element exchanges two distinct projected vertices. If a lift satisfies and , its invariance merely requires
which is precisely what antisymmetrization gives. Real values are useful here: for and , the value is forced.
The cyclic Pfaffian identity
In degree two, a lift-independent expression is
Changing to adds , so depends only on the projected vertices. In higher even degrees we replace by a Pfaffian and take the same alternating deletion sum. The Pfaffian still depends on the lifts; its deletion sum will define the cocycle. We first compute the weighted Pfaffian sum, then prove the descent and cocycle properties of its deletion sum.
For a list with , let
We use the convention that is the coefficient of in , where are the coordinate one-forms on the space of list positions and
In particular, , and is alternating in its entries and -invariant. The finite weighted sums
are therefore defined. No boundedness of on all lists is needed.
Lemma 8.2. For every , one has and hence .
Proof. An ordinary cyclic rotation of a list of length changes its Pfaffian by the sign . In the twisted rotation
replacing the last entry by adds 1 to every matrix entry in the last column above the diagonal. Expansion along that column gives
Indeed the last-column cofactor in position , with positions numbered , has sign ; each Pfaffian matching uses exactly one entry from that column.
For , each minor on the second line omits and from the original list. Applying the deletion identity in Lemma 7.2 twice shows that its weighted sum under is . For , the minor is , whose weighted sum is the total weight . Thus this endpoint uses no vector . The invariance of under and now turn (20) into
The claimed formulas follow.
Descent to an exterior cocycle
The preceding calculation detects the coefficient on lists of lifts. We next descend it to the exterior complex on , where the sparse-chain theorem applies.
Proposition 8.3. For every integer , the formula
where is any lift of , defines an -invariant linear functional satisfying
Here evaluation on the coinvariant chain is defined by -invariance.
Proof. On the list positions put
The right side of (8.3) is the coefficient of the ordered top form in . Moving the factor past its preceding positions gives exactly the sign in that formula.
Changing the lifts to replaces by . Thus it replaces by , with . Every correction term in contains two factors and vanishes. This proves independence of the lifts.
The expression is alternating in the lifted list. After lift independence has been established, it is therefore alternating in the projected vertices as well. In particular, if two projected vertices coincide, choose equal lifts for them to see that the expression vanishes. It consequently defines a linear functional on . For , choose and use as the lifts of the translated vertices. The -invariance of proves the -invariance of .
To check the cocycle identity, choose lifts simultaneously for a list of vertices. On every face, (8.3) is the alternating deletion coboundary of on these same lifts. A second deletion cancels each twice-omitted list in its two possible orders. Hence .
Finally, is the exterior projection of . Each one-deletion term in (8.3) has weighted sum , by Lemma 7.2. Since , their signed sum gives
using Lemma 8.2. Repeated projected vertices already have zero exterior image and zero value under , so they require no separate restriction in this evaluation.
Completion of the trace theorem
We now combine the geometric vanishing with the detector. The order of the choices matters: the graph is fixed by the idempotent before its cycle dimension is chosen.
Proof of Theorem 1.1. First let be finitely generated, let be an idempotent, and fix an infinite-order . Construct the graph on and the free action of as in Section 7. Let be a degree bound for this fixed graph, and choose an even integer with .
Proposition 7.3 gives the cycle , and Proposition 8.3 gives an -invariant cocycle with
If no nonzero simplices occur, and this identity already gives . Otherwise Proposition 7.3 realizes as a cycle in for an -invariant complex satisfying all hypotheses of Theorem 2.1. That theorem gives , with the same conclusion. Every finitely generated projective right -module is represented by an idempotent, and every element of is a difference of two such classes. Additivity proves the assertion for all finitely generated groups.
For an arbitrary discrete group , choose idempotents representing and let be generated by and all group elements occurring in their entries. Then is finitely generated and for some , where . Lemma 7.1 expresses as the sum of the coefficients over those -conjugacy classes . Only finitely many terms are nonzero, and every element in every such class has infinite order. Each term vanishes by the finitely generated case.
The integral trace
For the integral group ring, the same idempotent formula defines
where commutators are now taken with their additive span. The integral Bass trace conjecture asks for support only at the identity class.
Corollary 9.1. For every discrete group , the Hattori–Stallings trace of every class in is supported on .
Proof. If is a finitely generated projective right -module, the same idempotent matrix over represents . Consequently its trace coefficients are the images under of those of . Theorem 1.1 and this coefficientwise injection give vanishing at all infinite-order elements. No injectivity assertion about the map between the two groups is required.
For finite-order elements we use Linnell’s restriction [19], in the form stated and reproved by Berrick and Hesselholt [7]: if the integral trace of a finitely generated projective module is nonzero at , there is an integer such that is conjugate to for every integer . Their convention also uses right modules. If has finite order , take . Then , so the restriction would make conjugate to , a contradiction. Thus every nonidentity finite-order coefficient also vanishes. Taking differences of projective classes finishes the proof. □
Homotopy idempotents and Lefschetz numbers
The integral support statement also has fixed-point consequences. A self-map is a homotopy idempotent if . Such a map on a connected finite CW complex admits maps and with
[6], Section 3. The second identity says that is finitely dominated by . For a pointed homotopy idempotent with , where , the induced maps and identify with . The universal-cover chains of are chain homotopy equivalent to a finite complex of finitely generated projective -modules. The sum is its projective Euler class. The Hattori–Stallings trace of this class records the fixed-point class indices of : it is the Reidemeister trace, with conjugacy classes inverted when passing from the left-module convention of [6], Lemma 4.1, to ours. The augmentation trace and the identity coefficient of this projective class give the ordinary and -Lefschetz numbers, respectively [6], Lemmas 8.1–8.2. Berrick, Chatterji and Mislin use these relations to deduce the following consequences of the integral support statement and its numerical trace consequence.
Corollary 9.2 (Berrick–Chatterji–Mislin consequences). Let be a connected closed smooth oriented manifold.
(i) If and satisfies by free homotopy, then some self-map freely homotopic to has exactly one fixed point.
(ii) Choose and put . If satisfies by based homotopy and , then
Here is the lift to the universal cover fixing a chosen point above ; it is -equivariant. The left side is the ordinary Lefschetz number, and the right side is the alternating sum of von Neumann traces on the induced -homology maps, as in [6], Definition 7.1.
Proof. For write . The augmentation trace is the sum of these coefficients, while the Kaplansky trace is the identity coefficient. The sum is finite, and Corollary 9.1 gives
This is the weak Bass conjecture for every group. The cited paper uses projective left modules, whereas we use right modules. The anti-involution , together with transpose on idempotent matrices, transports between these conventions and relabels the coefficient at by . It preserves identity support and both and . Thus Corollary 9.1 gives the classical Bass conjecture in the cited convention, and the displayed equality gives weak Bass there. The forward implications of [6] now give (i) and (ii), respectively.
Torsion-free groups: trace rank and idempotents
For a torsion-free group, the support theorem leaves only the identity conjugacy class. We first identify its coefficient with augmentation rank, and then use the two possible scalar ranks to determine scalar idempotents.
Proof of Corollary 1.2(i). Let be idempotent and put . Since is torsion-free, Theorem 1.1 says that is supported on . Therefore
The class sum is finite because the entries of have finite group support. The last equality holds because is an idempotent complex matrix: its image-kernel decomposition makes its trace equal to its rank. Taking differences of projective classes gives . This map has range exactly , since its values are integers and has value 1.
For matrices the conclusion is numerical. For example, is an idempotent other than zero and the identity, with augmentation rank one. The scalar case is special because its augmentation rank can only be zero or one.
Proof of Corollary 1.2(ii). First take and let be idempotent. Equation (10.1) with gives
We use the standard faithful-trace argument, as in [9], spelling out a similarity to a projection. Embed by left convolution in the group von Neumann algebra , the commutant of the right regular representation on . Its canonical normalized trace is
Its faithfulness can be seen directly: if and , then . Since commutes with right translations and their translates of span a dense subspace, , hence .
Set
For every ,
Thus is positive and invertible in , and a direct multiplication gives . With , the element satisfies and . Hence is a projection, and traciality gives . If this value is zero, faithfulness applied to gives . If it is one, faithfulness applied to gives . Similarity then gives or .
Now let be any commutative unital domain of characteristic zero and write an idempotent as with finite. Put
The field is finitely generated over , and therefore embeds in . Indeed, send a finite transcendence basis of to an algebraically independent tuple of complex numbers; the resulting embedding of the rational function field extends across the finite algebraic extension because is algebraically closed. The coefficientwise maps and are injective. Thus already holds in , and its image in is an idempotent. The complex case makes that image or , and injectivity gives the same conclusion for . Only the finitely generated coefficient field was embedded; no embedding of all of into is required.
Remark 10.1 (Algebraic and completed trace ranges). Continue to assume that is torsion-free. Let be the inclusion into the reduced group -algebra, and let
be the comparison map to topological -theory. Write for the canonical trace pairing. It agrees with on this image: the same positive similarity used above, applied in a matrix algebra over , produces a projection representing the image of a matrix idempotent, and traciality preserves its trace. Consequently
This is the integer range on the algebraic image, not a statement about every class of . In particular, the argument does not presume that the algebraic augmentation extends to the reduced completion. The stronger completed idempotent question is the Kadison–Kaplansky conjecture; see [21], Section 1.
The coefficient reduction above uses characteristic zero. An idempotent would give nonzero zero divisors through , so the zero-divisor conjecture would imply the idempotent conjecture. The reverse implication is not established here.
References
- [1]Hannah Alpert. Simplicial volume and 0-strata of separating filtrations, 2024. arXiv:2211.06362v3.arxiv.org/abs/2211.06362
- [2]Arthur Bartels, Wolfgang Lück, and Holger Reich. On the Farrell–Jones conjecture and its applications. Journal of Topology, 1(1):57–86, 2008.arxiv.org/abs/math/0703548
- [3]Hyman Bass. Euler characteristics and characters of discrete groups. Inventiones Mathematicae, 35:155–196, 1976.DOI
- [4]Hyman Bass. Traces and Euler characteristics. In C. T. C. Wall, editor, Homological Group Theory, volume 36 of London Mathematical Society Lecture Note Series, pages 1–26. Cambridge University Press, Cambridge, 1979.DOI
- [5]A. J. Berrick, Indira Chatterji, and Guido Mislin. From acyclic groups to the Bass conjecture for amenable groups. Mathematische Annalen, 329(4):597–621, 2004.
- [6]A. J. Berrick, Indira Chatterji, and Guido Mislin. Homotopy idempotents on manifolds and Bass’ conjectures. Geometry & Topology Monographs, 10:41–62, 2007.
- [7]A. J. Berrick and Lars Hesselholt. Topological Hochschild homology and the Bass trace conjecture. J. reine angew. Math., 704:169–185, 2015.
- [8]Sabine Braun and Roman Sauer. Volume and macroscopic scalar curvature. Geometric and Functional Analysis, 31(6):1321–1376, 2021.arxiv.org/abs/2012.08999
- [9]Marc Burger and Alain Valette. Idempotents in complex group rings: theorems of Zalesskii and Bass revisited. Journal of Lie Theory, 8(2):219–228, 1998.DOI
- [10]Dan Burghelea. The cyclic homology of the group rings. Commentarii Mathematici Helvetici, 60:354–365, 1985.
- [11]Indira Chatterji and Guido Mislin. Hattori–Stallings trace and Euler characteristics for groups. In Martin R. Bridson, Peter H. Kropholler, and Ian J. Leary, editors, Geometric and Cohomological Methods in Group Theory, volume 358 of London Mathematical Society Lecture Note Series, pages 256–271. Cambridge University Press, 2009.
- [12]Alain Connes. Non-commutative differential geometry. Publications Mathématiques de l’IHÉS, 62:41–144, 1985.DOI
- [13]Beno Eckmann. Cyclic homology of groups and the Bass conjecture. Commentarii Mathematici Helvetici, 61:193–202, 1986.
- [14]F. Thomas Farrell and Peter A. Linnell. Whitehead groups and the Bass conjecture. Mathematische Annalen, 326:723–757, 2003.
- [15]Edward Formanek. Idempotents in Noetherian group rings. Canadian Journal of Mathematics, 25(2):366–369, 1973.DOI
- [16]Akira Hattori. Rank element of a projective module. Nagoya Mathematical Journal, 25:113–120, 1965.DOI
- [17]Greg Hjorth and Mats Molberg. Free continuous actions on zero-dimensional spaces. Topology and its Applications, 153(7):1116–1131, 2006.
- [18]L. V. Kantorovich. On the translocation of masses. Journal of Mathematical Sciences, 133(4):1381–1382, 2006. Translation of the 1942 original.DOI
- [19]P. A. Linnell. Decomposition of augmentation ideals and relation modules. Proceedings of the London Mathematical Society, 47(1):83–127, 1983.
- [20]Igor Mineyev and Guoliang Yu. The Baum–Connes conjecture for hyperbolic groups. Inventiones Mathematicae, 149(1):97–122, 2002.
- [21]Johan Öinert and Stefan Wagner. Complex group rings and group C*-algebras of group extensions. Journal of Algebraic Combinatorics, 58:387–397, 2023.arxiv.org/abs/1811.06424
- [22]Panos Papasoglu. Uryson width and volume. Geometric and Functional Analysis, 30(2):574–587, 2020.
- [23]Michael Puschnigg. The Kadison–Kaplansky conjecture for word-hyperbolic groups. Inventiones Mathematicae, 149(1):153–194, 2002.DOI
- [24]John Stallings. Centerless groups—an algebraic formulation of Gottlieb’s theorem. Topology, 4(2):129–134, 1965.DOI