betaFeedback

WorksMathematics

A torsion-free counterexample to reduced Baum–Connes injectivity

Abstract

We disprove rational injectivity of the coefficient-free reduced Baum–Connes assembly map for torsion-free groups. Specifically, we construct a finitely generated torsion-free discrete group whose degree-zero assembly map has a kernel class of infinite order.

Introduction

The Baum–Connes assembly map relates the topology of a discrete group to the operator algebra generated by its regular representation. For a torsion-free discrete group GinjG_{\mathrm{inj}}, its coefficient-free form is

μGinjr:K∗(BGinj)⟶K∗(Cr∗(Ginj)).\mu^{r}_{G_{\mathrm{inj}}}: K_{*}(BG_{\mathrm{inj}}) \longrightarrow K_{*}(C^{*}_{r}(G_{\mathrm{inj}})).

Here BGinjBG_{\mathrm{inj}} is a classifying space, K∗(BGinj)K_{*}(BG_{\mathrm{inj}}) is complex topological KK-homology with compact support, namely the directed limit over finite subcomplexes, and Cr∗(Ginj)C^{*}_{r}(G_{\mathrm{inj}}) is the reduced group C∗C^{*}-algebra. The Baum–Connes conjecture asserts that this map is an isomorphism [5]. In this formulation the coefficient algebra is C\mathbb{C} with its trivial action; the more general conjecture with coefficients allows a GinjG_{\mathrm{inj}}-algebra AA and has target K∗(A⋊rGinj)K_{*}(A \rtimes_{r} G_{\mathrm{inj}}).

Theorem 1.1. There exist a finitely generated torsion-free discrete group GinjG_{\mathrm{inj}}, an injective homomorphism i:Z2→Ginji:\mathbb{Z}^{2}\to G_{\mathrm{inj}}, and a class c∈H2(BGinj;Z)c\in H^{2}(BG_{\mathrm{inj}};\mathbb{Z}) such that

⟨(Bi)∗c,[T2]⟩=1,i∗(β)=0in K0(Cr∗Ginj),\left\langle(Bi)^{*}c,[T^{2}]\right\rangle=1,\qquad i_{*}(\beta)=0\quad\text{in }K_{0}(C^{*}_{r}G_{\mathrm{inj}}),

where β\beta is a rank-zero Bott generator of K0(C∗Z2)K_{0}(C^{*}\mathbb{Z}^{2}). In particular, h=(Bi)∗[DT2]h=(Bi)_{*}[D_{T^{2}}] has infinite order in K0(BGinj)K_{0}(BG_{\mathrm{inj}}), while its reduced analytic assembly image is zero. Here [DT2][D_{T^{2}}] is the spin Dirac KK-homology class of the oriented torus.

The theorem gives an integral reduced assembly kernel class of infinite order, and hence disproves rational injectivity of coefficient-free reduced assembly. Its two assertions have different roles. The cohomology class extends the orientation class of the embedded torus and detects its Dirac class by an index pairing. The vanishing of the corresponding rank-zero Bott class is proved by a separate operator-algebra construction. The group is finitely generated; finite presentation is not part of the conclusion.

The distinction from earlier counterexamples

Baum and Connes introduced this index-theoretic comparison in a preprint circulated in 1982 and published in 2000 [4], Section 1 and editors’ note]. The formulation using the classifying space for proper actions was developed with Higson [5]. In the torsion-free case that space gives the assembly map displayed above.

The conjecture is known for substantial classes of groups. Higson and Kasparov prove it with separable coefficients for groups acting properly by affine isometries on Hilbert space, including countable amenable groups [23]. The coefficient-free hyperbolic case was established by Mineyev–Yu using Lafforgue’s Banach-KKKK methods [29]; Lafforgue subsequently proved the version with coefficients [27]. Guentner, Higson, and Weinberger prove split injectivity with coefficients for countable linear groups [20]. These results describe major settings where the kernel constructed here cannot occur.

Higson, Lafforgue, and Skandalis constructed counterexamples in several assembly settings [24]. For discrete groups, their examples concern failure of surjectivity with nontrivial commutative coefficients; their paper explicitly distinguishes this from the conjecture for groups alone. Its groupoid examples also have failures of injectivity, but the groupoid and coefficient-free group assertions have different domains and targets. Theorem 1.1 concerns injectivity with coefficient algebra C\mathbb{C}.

Gromov’s graph-labeled small-cancellation strategy connects expander geometry to group constructions [16]. Graphical small-cancellation methods subsequently gave further group constructions with coefficient obstructions. For example, Osajda’s graphical constructions, together with the coefficient result of Willett and Yu, give a suitable coefficient algebra for which reduced assembly is injective and not surjective [33][36]. This provides relevant geometric precedent without supplying the coefficient-free kernel required here.

The exact crossed-product reformulation of Baum, Guentner, and Willett was designed to address the failures involving coefficients [6]. It replaces the reduced crossed product by the minimal exact Morita-compatible crossed product. That reformulation, the reduced coefficient-free conjecture, and the maximal assembly map must be kept distinct when interpreting the present construction.

Maximal assembly and the Novikov conjecture

Write μGinjmax⁡\mu^{\max}_{G_{\mathrm{inj}}} for assembly with target K∗(Cmax⁡∗(Ginj))K_{*}(C^{*}_{\max}(G_{\mathrm{inj}})), and let λGinj\lambda_{G_{\mathrm{inj}}} be the regular quotient from Cmax⁡∗(Ginj)C^{*}_{\max}(G_{\mathrm{inj}}) to Cr∗(Ginj)C^{*}_{r}(G_{\mathrm{inj}}). By the completion comparison [28],

μGinjr=(λGinj)∗μGinjmax⁡.\mu^{r}_{G_{\mathrm{inj}}}=(\lambda_{G_{\mathrm{inj}}})_{*}\mu^{\max}_{G_{\mathrm{inj}}}.

Hanke and Schick prove maximal rational nonvanishing for every discrete group whenever a KK-homology class is detected by the subring of rational cohomology generated in degrees at most two [22]. Consequently the class hh in Theorem 1.1 satisfies

μGinjmax⁡(h)⊗1≠0,(λGinj)∗(μGinjmax⁡(h))=0.\mu^{\max}_{G_{\mathrm{inj}}}(h)\otimes1\ne0,\qquad(\lambda_{G_{\mathrm{inj}}})_{*}\bigl(\mu^{\max}_{G_{\mathrm{inj}}}(h)\bigr)=0.

The name strong Novikov conjecture is used for both maximal and reduced rational injectivity in the literature [5]. Theorem 1.1 disproves the reduced formulation, while maximal assembly detects the same class hh. The classical Novikov conjecture concerns oriented homotopy invariance of higher signatures. Our result disproves neither maximal rational injectivity nor this classical assertion; in particular, higher signatures associated to low-degree cohomology already have the homotopy invariance established in [22].

Antonini, Buss, Engel, and Siebenand extend the low-degree nonvanishing result to suitable exotic group C∗C^{*}-algebras [1]. Their corrected statement assumes a finitely presented group and applies, in particular, to the group algebra of the minimal exact Morita-compatible crossed-product functor. For exact groups this algebra agrees with the reduced group algebra.

The asserted agreement for all groups was affected by the gap recorded in the erratum of Buss, Echterhoff, and Willett [10]. Accordingly we use the corrected version of [1], arXiv:1905.07730v3, rather than its original reduced-algebra claim. Theorem 1.1 asserts finite generation; it supplies neither finite presentation nor exactness.

A further distinction concerns projections. For a countable torsion-free group, a nontrivial projection in the scalar algebra Cr∗(Ginj)C^*_{r}(G_{\mathrm{inj}}) would obstruct surjectivity of coefficient-free assembly [26], Corollary 1.6]. Such a projection alone does not identify an assembly kernel class. Here matrix-valued Bott representatives are used to prove a specific vanishing while the integral detector proves that the corresponding geometric class survives.

The construction

In the operator model, localized rank-zero Bott representatives occupy coordinates indexed by heights i≥0i \ge0. The analytic aim is to cancel the class at height zero by moving bounded families of these representatives. Rotations and rescalings on the disjoint adjacent pairs (0,1),(2,3),…(0,1),(2,3),\ldots move the even family to the odd family. The pairs (1,2),(3,4),…(1,2),(3,4),\ldots then move the odd family to the positive-even family. These two homotopies identify the even family with the family obtained by removing its height-zero term. Finite additivity therefore forces that term to vanish. The families must be actual bounded operators, their homotopies must belong to a reduced-algebra norm quotient, and the resulting equality must yield a finite witness in one group algebra. These requirements determine the construction below.

The proof connects three ingredients. Its graph-labeling stage is related to the finite-alphabet separation method of Osajda [33], §2]; the layered graph, the sequential expansion constraints, and the simultaneous spectral requirements below are additional features. The voltage-cover language follows Gross and Gross–Tucker [17, 18]. Neither reference supplies the analytic realization needed here.

First, a layered graph is labeled by interleaved finite streams. Two incident labels recover successive blocks of a vertex state. The recovery procedure gives uniqueness for sufficiently long immersed words, while the random tables can be selected with a uniform expansion gap. Products of these incidences and their adjoints will later isolate the normalized constant coordinates on which the Bott families act. Pruning removes short coherent returns and configurations that would obstruct the required overlap bounds. The central issue is to retain enough independent constraints after conditioning on expansion. Proposition 2.6, Proposition 3.4, and Proposition 4.14 give the labeling, selection law, and counting estimates with compatible parameters.

Second, the graph is given voltages in the integral Heisenberg group

H=⟨x,y,z∣[x,y]=z, [x,z]=[y,z]=1⟩.\mathrm{H}=\langle x,y,z \mid[x,y]=z,\ [x,z]=[y,z]=1\rangle.

A voltage assigns a group element heh_e to an oriented base edge v→wv \to w; its lift sends (v,f)(v,f) to (w,fhe)(w,fh_e), and the reverse edge uses he−1h_e^{-1}. Short circuits surviving pruning are not laws in H. The voltage choice simultaneously separates these circuits and approximates the required spectral averages. Continuous matrix-valued symbols spread the Bott class across spectral bands, and finite sampling is controlled in the full regular operator norm. Proposition 5.2 supplies this analytic selection. The Heisenberg group provides a torsion-free source for the voltage cover and also contains the commuting pair (z,x)(z,x) used for the final torus.

Third, the geometric realization keeps the Heisenberg subgroup embedded and makes its degree-two detector extend to the ambient group. A sheet is a translate of the embedded cover in the Cayley graph. Integral cycle decompositions in a complex built from these sheets control both torsion and restriction in cohomology; see Proposition 6.4 and Proposition 7.11. Disjoint domains in the sheets allow the spectral operators to act on the group’s regular Hilbert space. The number of excluded coordinates in each sheet is bounded, and the spectral support projections have traces small enough relative to these bounds that the loss on the supported operators is small in norm. The remaining Cayley edges form a forest, whose contribution is controlled by the ratio of the square root of the label count to the incidence normalizer. This is why the finite alphabet must retain a sharp margin throughout the graph construction. These estimates realize the bounded Bott families and their homotopies in the reduced-algebra norm quotient. Proposition 8.8 then obtains integral Bott vanishing in an actual reduced group algebra. The finite-witness argument retains this equality in the group generated by the finitely many group elements in polynomial approximations to that witness, together with the Heisenberg generators. This finitely generated subgroup is the group in Theorem 1.1. Figure 1 records the main dependencies.

Figure 1. Principal dependencies in the construction. The stream rules, sequential selection, and pruning precede the joint voltage and spectral choice. Geometric realization supports both the integral detector and the reduced Bott cancellation. A finite witness retains both properties in a finitely generated subgroup.

Reading the construction

There are two indices: height runs through one infinite graph tower, while accuracy indexes a sequence of increasingly precise constructions. The graph degree is constant across heights in any one construction and may increase with accuracy. Section 9 records the complete order of parameter choices after the required objects have been defined.

Sections 2–5 construct and sample the labeled voltage tower. Sections 6–7 realize it in a group and prove the cohomological detector and torsion claims. Section 8 establishes the reduced Bott cancellation and extracts a finite witness. The final section puts these conclusions together with compatible parameters and identifies the detected torus Dirac class and its assembly image.

Throughout, all group C∗C^*-algebras and all KK-groups are complex. Commutators mean [a,b]=aba−1b−1[a,b]=aba^{-1}b^{-1}. The graph construction uses binary logarithms. Matrix dimensions remain fixed along each approximation sequence in which quotient KK-theory is used; finite generation is extracted only after an exact finite witness has been obtained.

A finite alphabet with deterministic recovery

We construct a labeled graph in layers, with the aim that every sufficiently long immersed word has only one occurrence. The alphabet must also remain small relative to the incidence degrees. The finite-alphabet separation objective is shared with Osajda’s construction [33]; here the graph and its labels are built together, and uniqueness will follow from explicit recovery of vertex coordinates.

The local recovery step is elementary. Over a finite field, subtracting two evaluations E1=v+c1uE_1=v+c_1u and E2=v+c2uE_2=v+c_2u with c1≠c2c_1\ne c_2 determines uu; either equation then determines vv. We apply this observation block by block. Labels and previously recovered neighboring blocks will supply the evaluations. The rules below make this process compatible with partial terminal blocks and with comparisons between different heights.

A slot is a named candidate incidence at a vertex. Once the coefficient pools are fixed, the incidence, recovery, and vertex-deletion assertions in this section hold for every choice of permutation tables. Deletion fractions are counted using uniform vertex coordinates for each fixed table realization. The probability law on the tables is a separate choice, made in Section 3. All logarithms in this section have base two.

The padded-stream construction and recovery scheme adapt [32]. The exponents, cutoff requirements, and gated corrections needed for the present interfaces are established below; the projection theorem is not an existence input.

States, families, and extra coordinates

Fix a positive integer bb. Let ss be a sufficiently large multiple of 20000 and 5b5b, and put

r=35s,d=2.40005s,D=2.60005s,q=2.50005s.(1)r=\frac{3}{5}s,\qquad d=2^{.40005s},\qquad D=2^{.60005s},\qquad q=2^{.50005s}. \tag*{(1)}

The numbers d,Dd,D will be the two incidence degrees in a fixed slice, and q=dDq=\sqrt{dD} their geometric mean. The exponent choices allow both distinct coefficients for recovery and an alphabet whose square root is small compared with qq; the precise alphabet estimate is eq:20 below. These parameters stay fixed as the height ii varies. They may change when a later construction asks for a smaller approximation error. Choose an integer n0≥106n_0\ge10^6, to be increased later. For i≥0i\ge0 write bi=2sai+tib_i=2sa_i+t_i, where 0≤ti<2s0\le t_i<2s, and define

ℓA(i)=r+n0s+ais+max⁡{ti−s,0},ℓB(i)=n0s+ais+min⁡{ti,s}.(2)\ell_A(i)=r+n_0s+a_is+\max\{t_i-s,0\}, \qquad \ell_B(i)=n_0s+a_is+\min\{t_i,s\}. \tag*{(2)}
Ai=F2ℓA(i)×F2r+ℓB(i),Bi=F2ℓB(i)×F2s−r+ℓA(i).\mathcal{A}_i=\mathbb{F}_2^{\ell_A(i)}\times\mathbb{F}_2^{r+\ell_B(i)}, \qquad \mathcal{B}_i=\mathbb{F}_2^{\ell_B(i)}\times\mathbb{F}_2^{s-r+\ell_A(i)}.

The two coordinates are denoted (u,v)(u,v). Regard each as an infinite bit stream by adjoining zero coordinates. Both coordinates on a side use that side’s block convention: an A stream has an initial block A0A_0 of length rr and blocks A1,A2,…A_1,A_2,\ldots of length ss; a B stream has blocks B1,B2,…B_1,B_2,\ldots, all of length ss. Index their interleaving by

A0 (0), B1 (1), A1 (2), B2 (3), A2 (4),…(3)A_0\ (0),\ B_1\ (1),\ A_1\ (2),\ B_2\ (3),\ A_2\ (4),\ldots \tag*{(3)}

For the pair of spaces at height ii, the active coordinates of uAu_A and uBu_B together form an initial segment of this interleaving. Its length and the logarithmic state size are

Li=r+2n0s+bi,Hi=Li+s−r=(2n0+1)s+bi,L_i=r+2n_0s+b_i,\qquad H_i=L_i+s-r=(2n_0+1)s+b_i,
∣Bi∣=2Hi,∣Ai∣=2Hi+2r−s.(4)|\mathcal{B}_i|=2^{H_i},\qquad|\mathcal{A}_i|=2^{H_i+2r-s}. \tag*{(4)}

References

  1. [1]Paolo Antonini, Alcides Buss, Alexander Engel, and Timo Siebenand. Strong Novikov conjecture for low degree cohomology and exotic group C*-algebras. Transactions of the American Mathematical Society, 374(7):5071–5093, 2021. Corrected formulation: arXiv:1905.07730v3, 14 December 2020; DOI.arxiv.org/abs/1905.07730
  2. [2]Michael F. Atiyah and Raoul Bott. On the periodicity theorem for complex vector bundles. Acta Mathematica, 112:229–247, 1964. DOI.
  3. [3]Michael F. Atiyah and Isadore M. Singer. The index of elliptic operators on compact manifolds. Bulletin of the American Mathematical Society, 69:422–433, 1963. DOI.
  4. [4]Paul Baum and Alain Connes. Geometric K-theory for Lie groups and foliations. L’Enseignement Mathématique (2), 46(1–2):3–42, 2000. First circulated in 1982; DOI.DOI
  5. [5]Paul Baum, Alain Connes, and Nigel Higson. Classifying space for proper actions and K-theory of group C*-algebras. In C*-Algebras: 1943–1993, volume 167 of Contemporary Mathematics, pages 240–291. American Mathematical Society, Providence, RI, 1994. DOI.
  6. [6]Paul Baum, Erik Guentner, and Rufus Willett. Expanders, exact crossed products, and the Baum–Connes conjecture. Annals of K-Theory, 1(2):155–208, 2016. DOI.DOI
  7. [7]Paul Baum, Nigel Higson, and Thomas Schick. On the equivalence of geometric and analytic K-homology. Pure and Applied Mathematics Quarterly, 3(1):1–24, 2007. arXiv:math/0701484v4.DOI
  8. [8]Paul F. Baum and Erik van Erp. K-homology and Fredholm operators I: Dirac operators. Journal of Geometry and Physics, 134:101–118, 2018. arXiv:1604.03502.arxiv.org/abs/1604.03502
  9. [9]Bruce Blackadar. K-Theory for Operator Algebras, volume 5 of Mathematical Sciences Research Institute Publications. Cambridge University Press, Cambridge, 2 edition, 1998. Author text.
  10. [10]Alcides Buss, Siegfried Echterhoff, and Rufus Willett. Erratum to: “The minimal exact crossed product”. Documenta Mathematica, 26:1629–1632, 2021. DOI.DOI
  11. [11]Fan Chung. Four Cheeger-type inequalities for graph partitioning algorithms. ICCM 2007, author version, 2007. Author text.
  12. [12]Heath Emerson and Dan Hudson. Baum–Connes and the Fourier–Mukai transform, 2020. arXiv:2001.06124v2.arxiv.org/abs/2001.06124
  13. [13]Paul Erdős and László Lovász. Problems and results on 3-chromatic hypergraphs and some related questions. In Infinite and Finite Sets, Vol. II, volume 10 of Colloquia Mathematica Societatis János Bolyai, pages 609–627. North-Holland, Amsterdam, 1975. Author text.
  14. [14]Joel Friedman, Alice Izsak, and Lior Silberman. Abelian girth and girth, 2015. arXiv:1511.03678v1, 11 November 2015.arxiv.org/abs/1511.03678
  15. [15]Zoltán Füredi and János Komlós. The eigenvalues of random symmetric matrices. Combinatorica, 1(3):233–241, 1981. DOI.DOI
  16. [16]Mikhail Gromov. Random walk in random groups. Geometric and Functional Analysis, 13:73–146, 2003. DOI.DOI
  17. [17]Jonathan L. Gross. Voltage graphs. Discrete Mathematics, 9:239–246, 1974. DOI.
  18. [18]Jonathan L. Gross and Thomas W. Tucker. Generating all graph coverings by permutation voltage assignments. Discrete Mathematics, 18:273–283, 1977. DOI.DOI
  19. [19]Dominik Gruber. Groups with graphical C(6) and C(7) small cancellation presentations. Transactions of the American Mathematical Society, 367(3):2051–2078, 2015. DOI; arXiv:1210.0178v2, 24 July 2014.arxiv.org/abs/1210.0178
  20. [20]Erik Guentner, Nigel Higson, and Shmuel Weinberger. The Novikov conjecture for linear groups. Publications Mathématiques de l’IHÉS, 101:243–268, 2005. DOI.DOI
  21. [21]Bernhard Haeupler, Barna Saha, and Aravind Srinivasan. New constructive aspects of the Lovász local lemma. Journal of the ACM, 58(6):28:1–28:28, 2011. DOI; arXiv:1001.1231v5, 2 October 2011.arxiv.org/abs/1001.1231
  22. [22]Bernhard Hanke and Thomas Schick. The strong Novikov conjecture for low degree cohomology. Geometriae Dedicata, 135:119–127, 2008. DOI; arXiv:0705.2578v1, 17 May 2007.DOI
  23. [23]Nigel Higson and Gennadi Kasparov. E-theory and KK-theory for groups which act properly and isometrically on Hilbert space. Inventiones Mathematicae, 144:23–74, 2001. DOI.DOI
  24. [24]Nigel Higson, Vincent Lafforgue, and Georges Skandalis. Counterexamples to the Baum–Connes conjecture. Geometric and Functional Analysis, 12(2):330–354, 2002. DOI; author text.DOI
  25. [25]Nigel Higson, Erik Kjær Pedersen, and John Roe. C*-algebras and controlled topology. K-Theory, 11(3):209–239, 1997. DOI.DOI
  26. [26]Jens Kaad and Valerio Proietti. Index theory on the Miščenko bundle. Kyoto Journal of Mathematics, 62(1):103–131, 2022. DOI; arXiv:1807.05757v2, 5 March 2020.
  27. [27]Vincent Lafforgue. La conjecture de Baum–Connes à coefficients pour les groupes hyperboliques. Journal of Noncommutative Geometry, 6(1):1–197, 2012. DOI.arxiv.org/abs/1201.4653
  28. [28]Markus Land. The analytical assembly map and index theory. Journal of Noncommutative Geometry, 9(2):603–619, 2015. DOI.arxiv.org/abs/1306.5657
  29. [29]Igor Mineyev and Guoliang Yu. The Baum–Connes conjecture for hyperbolic groups. Inventiones Mathematicae, 149:97–122, 2002. DOI.
  30. [30]Robin A. Moser and Gábor Tardos. A constructive proof of the general Lovász local lemma. Journal of the ACM, 57(2):11:1–11:15, 2010. arXiv:0903.0544v3.arxiv.org/abs/0903.0544
  31. [31]Yann Ollivier. On a small cancellation theorem of Gromov. Bulletin of the Belgian Mathematical Society – Simon Stevin, 13(1):75–89, 2006. Corrected proof: arXiv:math/0310022v2, 25 September 2024; DOI.arxiv.org/abs/math/0310022
  32. [32]OpenAI. A torsion-free counterexample to the Kadison–Kaplansky projection conjecture. OpenAI Math Release preprint OAI:A-Torsion-Free-Counterexample-to-the-Kadison-Kaplansky-Projection-Conjecture-September-23-2026, 2026. Sections 4, 6, and 7.6.
  33. [33]Damian Osajda. Small cancellation labellings of some infinite graphs and applications. Acta Mathematica, 225(1):159–191, 2020. Final preprint: arXiv:1406.5015v3, 17 May 2020; DOI.
  34. [34]Jacob T. Schwartz. Fast probabilistic algorithms for verification of polynomial identities. Journal of the ACM, 27(4):701–717, 1980. DOI.DOI
  35. [35]Alistair Sinclair and Mark Jerrum. Approximate counting, uniform generation and rapidly mixing Markov chains. Information and Computation, 82(1):93–133, 1989. DOI; author text.
  36. [36]Rufus Willett and Guoliang Yu. Higher index theory for certain expanders and Gromov monster groups, I. Advances in Mathematics, 229(3):1380–1416, 2012. DOI; arXiv:1012.4150v1, 19 December 2010.arxiv.org/abs/1012.4150

Paper details

vlnc:W_f6x6kvj8
Version
v1 · latest
Published
License
LicenseRef-OpenAI-public
Usage

views · 15

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

unreleased internal OpenAI model

View statement
Looking for related papers…
Contents