OctoInformBeta

The ℓ¹-Bass conjecture for all discrete groups

For a discrete group GG, let K0(ℂG)K_0(\mathbb C G) denote the Grothendieck group of finitely generated projective right ℂG\mathbb C G-modules. The Hattori-Stallings trace of a projective module is the finitely supported complex function on the conjugacy classes of GG obtained from an idempotent presentation by summing its diagonal coefficients over each conjugacy class. The trace extends additively to K0(ℂG)K_0(\mathbb C G). The complex Bass trace conjecture asks whether this trace vanishes on every conjugacy class of infinite-order elements.

Bass proved this vanishing for linear groups.

The preprint proves that the Hattori-Stallings trace of every class in K0(ℂG)K_0(\mathbb C G) vanishes on every conjugacy class of infinite-order elements, for every discrete group GG. It also derives that, for every torsion-free group GG and every commutative unital domain RR of characteristic zero, the only idempotents in RGRG are 00 and 11.

The Lean library BassTrace is the reference for the results on these pages because Lean has checked every result of the Lean library. Each result is stated as in the Lean library and linked to the declaration behind it. Where the preprint states a result differently, its statement is given beside the Lean library’s statement. The preprint is a guide only, supplying the order and names of the results. The Lean library’s geometric vanishing theorem takes as a hypothesis a free continuous action of a countable group on a compact zero-dimensional Hausdorff space preserving a Borel probability measure. The preprint credits the existence of such a parameter to Hjorth and Molberg, following Braun and Sauer.

The Lean library: BassTrace

BassTrace is a Lean library: 29 items, in nine groups. Each has a page written by OctoInform, listed below.

§1. Introduction 4 items
  1. Projective modules, algebraic K0, and the class trace Projective modules and their class traces.
  2. Theorem 1.1 Bass traces vanish on infinite-order classes.
  3. Torsion-free trace and augmentation rank Traces and ranks of idempotent classes.
  4. Corollary 1.2 Idempotent traces are integral over torsion-free complex group rings.
§2. A vanishing theorem for sparse simplicial cycles 2 items
  1. Exterior chains, simplicial chains, and coinvariants Exterior chains and coinvariant relations.
  2. Theorem 2.1 Invariant cocycles vanish on sparse cycles.
§3. A metric and volume bound for connected supports 4 items
  1. Probability realization, transportation metric, and tree areas Probability geometry from transport and spanning trees.
  2. Lemma 3.1 Finiteness for transportation balls on connected supports.
  3. Lemma 3.2 Tree simplices have prescribed Euclidean volume.
  4. Ball volume and the high-dimensional margin Transportation ball volumes admit factorial bounds.
§4. Equivariant separating filtrations 5 items
  1. Lemma 4.1 Translations preserve the parameter measure.
  2. Allowed subdivisions and separating filtrations Separating filtrations organize equivariant simplicial cuts.
  3. Lemma 4.2 Compatible refinements for spherical filtration cuts.
  4. Lemma 4.3 Equivariant subdivisions admit separating filtrations.
  5. Lemma 4.4 Bottom points have prescribed simplex carriers.
§5. Local replacement and the number of zero strata 1 item
  1. Proposition 5.1 Large dimension permits sparse zero strata.
§6. From separating filtrations to finite chains 4 items
  1. Component labels and the averaged chain map Component labels define finite averaged chains.
  2. Lemma 6.1 Component labels remain in finite graph windows.
  3. Lemma 6.2 Flag counts bound sparse chain evaluations.
  4. Lemma 6.3 A natural homotopy to simplicial inclusion.
§7. Cycles from an idempotent 4 items
  1. Lemma 7.1 Restricting matrices and their conjugacy class traces.
  2. Centralizer action, a fixed support graph, and path weights Centralizer actions and weighted group ring paths.
  3. Lemma 7.2 Paths from idempotents have constant total weight.
  4. Proposition 7.3 Idempotents yield cycles on their support complexes.
§8. A Pfaffian cocycle detecting the trace coefficient 4 items
  1. Lemma 8.1 Infinite order admits relative exponents.
  2. Pfaffians and their deletion detector Pfaffian forms define path and coset evaluations.
  3. Lemma 8.2 Weighted Pfaffian sums satisfy a recurrence.
  4. Proposition 8.3 Pfaffian cocycles pair with even path chains.
§9. Completion of the trace theorem 1 item
  1. Assembly and passage to arbitrary groups The Bass trace theorem for arbitrary groups.

No item matches.