betaFeedback

WorksMathematics

A torsion-free counterexample to the Kadison–Kaplansky projection conjecture

Abstract

We construct a finitely generated torsion-free discrete group whose reduced group C∗-algebra contains a projection other than zero and the identity. This disproves the Kadison–Kaplansky projection conjecture.

Introduction

The projection form of the Kadison–Kaplansky conjecture asserts that the reduced group C∗\mathrm{C}^{*}-algebra of a torsion-free discrete group contains no projections other than zero and the identity. For a discrete group HH, this algebra is the operator-norm closure of its left regular group algebra on ℓ2(H)\ell^{2}(H), and its canonical trace is τH(x)=⟨xδ1,δ1⟩\tau_{H}(x)=\langle x\delta_{1},\delta_{1}\rangle. The conjecture concerns scalar projections in this completion. We prove the following result.

Theorem 1.1. There exist a finitely generated torsion-free discrete group GprojG_{\mathrm{proj}} and a projection e∈Cr∗(Gproj)e\in\mathrm{C}^{*}_{r}(G_{\mathrm{proj}}) such that

0<τGproj(e)<12.0<\tau_{G_{\mathrm{proj}}}(e)<\frac{1}{2}.

In particular, ee is neither zero nor the identity.

Theorem eq:1.1 resolves the projection form of the Kadison–Kaplansky conjecture negatively. The group is given by an infinite graphical presentation followed by a free product with a finitely generated free group. Every parameter is finite, although no useful bound on its size is sought. The choices of labeling tables and edge voltages are specified by finite distributions and proved simultaneous existence statements.

Context

Kadison traces his free-group projection problem to Kaplansky’s question about idempotents in simple unital C∗\mathrm{C}^{*}-algebras [24], pp. 222–224. Pimsner and Voiculescu proved the free-group case by computing the KK-theory of reduced crossed products by free groups [34], p. 131. A central route to projectionlessness is integrality of the canonical trace on K0(Cr∗(H))K_{0}(\mathrm{C}^{*}_{r}(H)), where the trace on matrices is the unnormalized sum of the diagonal traces. For torsion-free groups, the trace is integral on the image of reduced assembly with trivial coefficients [26], Theorem 0.3, [4], Proposition 10.3. Surjectivity therefore gives scalar projectionlessness. The survey [16], Section 4.5.3 explains the distinct scalar and stable formulations.

This implication covers substantial classes of groups. Higson and Kasparov proved Baum–Connes with coefficients for groups acting properly by affine isometries on Hilbert space, including countable amenable groups [21], Theorem 9.1 and Corollary 9.2. Mineyev and Yu established the coefficient-free hyperbolic case and deduced the projection conjecture for torsion-free subgroups of hyperbolic groups [29], Theorems 20–21; Lafforgue later established the hyperbolic case with arbitrary coefficients [25], Theorem 0.4. The group constructed here has a different geometry: its presentation encodes an infinite tower through embedded nilpotent covers.

For the group GprojG_{\mathrm{proj}} in Theorem 1.1, the complex group ring C[Gproj]\mathbb{C}[G_{\mathrm{proj}}] has no scalar idempotents other than zero and one [32], Corollary 1.2(ii). Thus the projection ee lies in the reduced completion but not in the group ring. The companion also gives integer trace range on algebraic K0(C[Gproj])K_{0}(\mathbb{C}[G_{\mathrm{proj}}]) and on its image in K0(Cr∗(Gproj))K_{0}(\mathrm{C}^{*}_{r}(G_{\mathrm{proj}})) under the comparison map induced by inclusion [32], Corollary 1.2(i) and Remark 10.1. This does not assert integrality on the whole completed K0K_{0}, where [e][e] has nonintegral trace.

Expanders also underlie the obstructions of Higson, Lafforgue, and Skandalis for groupoids, coarse spaces, and group actions with coefficients [22]. Their group-action statements concern assembly with coefficients, whereas the trace obstruction here concerns trivial coefficients.

The later analysis of expander index obstructions by Willett and Yu [40] gives another relevant spectral and coarse-geometric precedent. Its group consequences likewise use coefficients.

Austin constructed rational group-ring operators with irrational von Neumann kernel dimension [3]. Such a dimension alone does not imply that the kernel projection lies in the reduced C∗C^*-algebra. Here a uniform separated spectral band for a finite matrix group-algebra operator in its regular representation gives reduced-algebra membership by continuous functional calculus. Scalar compression is applied after this matrix projection has been obtained.

The obstruction and the proof strategy

The first task is to obtain a matrix projection whose unnormalized trace is strictly between zero and 1/21/2. A spectral projection in the group von Neumann algebra is insufficient. We construct a finite self-adjoint matrix TT over the group algebra of a torsion-free group Γproj\Gamma_{\mathrm{proj}} whose regular spectrum has a nonempty band near +1+1, separated from all remaining spectrum. Continuous functional calculus then places its upper projection p0p_0 in MN(Cr∗(Γproj))M_N(C_r^*(\Gamma_{\mathrm{proj}})). The difficult part is to retain that gap while making the unnormalized trace small.

Begin with finite sets AiA_i, BiB_i, indexed by i∈Zi \in\mathbb{Z}, and bipartite incidences between AiA_i and BkB_k for ∣i−k∣≤1\lvert i-k\rvert\le1. Their normalized operators preserve constant vectors and contract the orthogonal complements by a common positive amount. Two versions of the same tower serve different purposes: Y0Y^0 provides expansion and Y#Y^\# provides recovery of long paths from words in a finite alphabet. They agree after deleting a uniformly small fraction of vertices. The survivor YY is the base of a voltage cover PP: its vertices are pairs (v,f)(v,f), with ff in a torsion-free nilpotent group, and an edge changes the second coordinate by its assigned group element. The voltages give large girth and will also realize the required operators.

The analytic model is indexed by a central Fourier variable tt. Twisted-convolution projections with effective parameters tt and t−δt-\delta, for a small positive δ\delta, give a nonzero fiber projection for 0<t<δ0<t<\delta. Normalized combinations of the constant vectors on at most two adjacent layers produce an eigenvalue +1+1, while expansion separates all the other positive spectrum. As tt approaches either endpoint, these supporting layers move toward an end of the tower and their fiber trace decreases. A finite magnetic representation is essential to obtain small trace at both endpoints. The result is a summable trace estimate even after the geometric weights needed for intersections of copies have been included.

One edge voltage and one matrix weight per edge approximate this model in the full regular norm. The same finite sampling construction enforces the girth required for the group presentation. Long-word recovery then embeds components of PP as indexed copies in the Cayley graph of Γproj\Gamma_{\mathrm{proj}}. A common-root order confines every earlier intersection with a copy to one finite tree ball. Removing those intersections leaves disjoint domains; the remaining Cayley edges form a forest. The trace estimate controls the loss in the upper spaces caused by the removed balls, and a forest norm estimate controls the unused edges. Together they preserve the separated band for the finite matrix TT. For the trace estimate, we restrict a vector to every indexed copy and project to its local upper space. This map is equivariant, although the assignment of domains need not be. Disjointness and the same weighted loss estimate bound its retained and removed parts. Its injectivity on the global upper space then bounds the unnormalized trace by the total trace of the local upper spaces.

The final passage to a scalar projection is a separate free-product argument. Scale and comparison in reduced free products were studied by Dykema and Rørdam [8, 9, 10]. Recent work on selfless reduced free products and comparison by trace [13, 37] also underlies a conditional argument of Sauers [38] that turns a nonintegral matrix projection over Cr∗(H)C_r^*(H) into a scalar projection over Cr∗(H∗Z)C_r^*(H \ast\mathbb{Z}). Such a reduction still requires an actual nonintegral matrix projection. Here Proposition 2.2 gives a direct quantitative estimate at trace below 1/21/2: adjoining NN free generators compresses p0p_0 to a scalar projection of the same trace. This gives Γproj=Γproj∗FN\Gamma_{\mathrm{proj}}=\Gamma_{\mathrm{proj}} \ast\mathbb{F}_N, preserving finite generation and torsion-freeness. The same small trace also places [p_0] outside the coefficient-free reduced assembly image for Γproj\Gamma_{\mathrm{proj}}.

Organization

Section 2 reduces Theorem 1.1 to the small unnormalized matrix-trace target stated in Section 3. Sections 4–6 construct the auxiliary graph Y0Y^0 with expanding incidences, the gated graph Y#Y^\# with path recovery, and their common pruned induced subgraph YY.

Section 7 proves the embedding, overlap, forest, and torsion conclusions under a girth hypothesis on the voltage cover PP. Section 8 constructs the deck group and the small-trace fiber projections. Section 9 identifies the model’s upper band, then chooses voltages and matrix weights satisfying both the girth hypothesis and the regular operator approximation.

Section 10 passes the upper spectral band from the model to the cover and then to the Cayley operator, and bounds its unnormalized trace using all indexed copies. Section 11 applies scalar compression to complete the proof.

From a small matrix projection to a scalar projection

We first isolate a reduction that will be useful independently of the construction. Its trace convention is essential. For related results on the scale and comparison of projections in reduced free products, see Dykema–Rørdam [8, 9, 10]. The explicit row estimate used here is proved below. For a discrete group Λ\Lambda, let

(λΛ(g)ξ)(h)=ξ(g−1h),Cr∗(Λ)=λΛ(C[Λ])∥⋅∥.(\lambda_\Lambda(g)\xi)(h)=\xi(g^{-1}h), \qquad C_r^*(\Lambda)=\lambda_\Lambda(\mathbb{C}[\Lambda])^{\|\cdot\|}.

The canonical trace is τΛ(x)=⟨xδ1,δ1⟩\tau_\Lambda(x)=\langle x\delta_1,\delta_1\rangle. It is tracial on finite group-algebra sums by taking the identity coefficient, and hence on their norm closure. It is faithful: if x≥0x\ge0 and τΛ(x)=0\tau_\Lambda(x)=0, then x1/2δ1=0x^{1/2}\delta_1=0. Since x1/2x^{1/2} commutes with the right regular action, it annihilates every basis vector and is zero. On matrices we always use the unnormalized extension

τΛ,N(x)=∑j=1NτΛ(xjj).(1)\tau_{\Lambda,N}(x)=\sum_{j=1}^{N}\tau_\Lambda(x_{jj}). \tag*{(1)}

The same formula applies to positive equivariant operators on finite regular multiples. In particular, τΛ,N(p)>0\tau_{\Lambda,N}(p)>0 for a nonzero projection pp.

Lemma 2.1 (Reduced subgroup inclusion). If Λ\Lambda is a subgroup of a discrete group KK, the inclusion of group algebras extends to an isometric unital inclusion Cr∗(Λ)⊆Cr∗(K)C_r^*(\Lambda)\subseteq C_r^*(K), preserving the canonical traces and their finite matrix extensions.

Proof. Choose one representative vv from every left Λ\Lambda-orbit Λv\Lambda v in KK. The unitary δγ↦δγv\delta_\gamma\mapsto\delta_{\gamma v} identifies the restriction of the left regular action to ℓ2(Λv)\ell^2(\Lambda v) with the left regular action on ℓ2(Λ)\ell^2(\Lambda). Thus the representation restricted to C[Λ]\mathbb{C}[\Lambda] is a direct sum of regular representations, so its norm is precisely the reduced norm on Λ\Lambda. Taking closures gives the inclusion. The identity diagonal proves preservation of trace; summing diagonal entries proves the matrix statement. □\square

Proposition 2.2 (Scalar compression after a free product). Let Λ\Lambda be a discrete group and p∈MN(Cr∗(Λ))p\in M_N(C_r^*(\Lambda)) a projection with

0<a:=τΛ,N(p)<12.0<a:=\tau_{\Lambda,N}(p)<\frac{1}{2}.

Put K=Λ∗FNK = \Lambda* F_N, where t1,…,tNt_1,\ldots,t_N freely generate FNF_N, and regard pp as a matrix over Cr∗(K)C_r^*(K) by Lemma 2.1. Set

U=(λK(t1),…,λK(tN)),A=pU∗Up.U = (\lambda_K(t_1),\ldots,\lambda_K(t_N)), \qquad A = pU^*Up.

Then AA is invertible in the unital corner pMN(Cr∗(K))ppM_N(C_r^*(K))p, and

e=(Up)A−1(Up)∗e = (Up)A^{-1}(Up)^*

is a projection in the scalar algebra Cr∗(K)C_r^*(K) with τK(e)=a\tau_K(e)=a. If Λ\Lambda is finitely generated and torsion-free, then so is KK.

Proof. To bound UU below on pℓ2(K)Np\ell^2(K)^N, we separate noncancelling inputs, whose outputs are disjoint, from cancelling inputs, whose size both before and after applying UU is controlled by the trace aa. Use free-product normal forms, writing entries of the free factor in reduced free letters. Let RR consist of the identity and the normal words whose first factor is in FNF_N. Every element of KK has a unique expression γv\gamma v with γ∈Λ\gamma\in\Lambda and v∈Rv\in R: remove its initial Λ\Lambda-factor, if present. Thus RR is a transversal for the orbits used in Lemma 2.1.

Write aj=τΛ(pjj)a_j=\tau_\Lambda(p_{jj}), so aj≥0a_j\ge0 and ∑jaj=a\sum_j a_j=a. If ξ=pξ∈ℓ2(K)N\xi=p\xi\in\ell^2(K)^N, put

mv=∥ξ∣Λv∥2,∑v∈Rmv=∥ξ∥2.m_v=\|\xi|_{\Lambda v}\|^2,\qquad\sum_{v\in R}m_v=\|\xi\|^2.

Restriction to an orbit commutes with pp. Applying Cauchy–Schwarz to the projection on that orbit gives

∣ξj(v)∣2=∣⟨ξ∣Λv,pδ(v,j)⟩∣2≤ajmv.|\xi_j(v)|^2=|\langle\xi|_{\Lambda v},p\delta_{(v,j)}\rangle|^2\le a_jm_v.

Here ∥pδ(v,j)∥2=⟨pδ(v,j),δ(v,j)⟩=aj\|p\delta_{(v,j)}\|^2=\langle p\delta_{(v,j)},\delta_{(v,j)}\rangle=a_j.

In coordinate jj, call a position bad if its reduced word starts with tj−1t_j^{-1}, and good otherwise. Split ξ\xi accordingly as ξ=ξg+ξb\xi=\xi_g+\xi_b. Every bad position belongs to RR; its first letter determines its bad coordinate uniquely. Therefore

∥ξb∥2≤a∑v∈Rmv=a∥ξ∥2.(2)\|\xi_b\|^2\le a\sum_{v\in R}m_v=a\|\xi\|^2. \tag*{(2)}

Left multiplication by tjt_j sends every good position to a word starting with tjt_j. These output sets are disjoint for different jj, and multiplication is injective within each coordinate. Hence

References

  1. [1]Noga Alon and Vitali D. Milman. λ₁, isoperimetric inequalities for graphs, and super-concentrators. Journal of Combinatorial Theory, Series B, 38:73–88, 1985. doi:10.1016/0095-8956(85)90092-9.DOI
  2. [2]Noga Alon and Joel H. Spencer. The Probabilistic Method. Wiley Series in Discrete Mathematics and Optimization. John Wiley & Sons, fourth edition, 2016.
  3. [3]Tim Austin. Rational Group Ring Elements with Kernels Having Irrational Dimension. Proceedings of the London Mathematical Society, 107(6):1424–1448, 2013. doi:10.1112/plms/pdt029.DOI
  4. [4]Paul Baum, Erik Guentner, and Rufus Willett. Exactness and the Kadison–Kaplansky Conjecture. In Robert S. Doran and Efton Park, editors, Operator Algebras and Their Applications: A Tribute to Richard V. Kadison, volume 671 of Contemporary Mathematics, pages 1–33. American Mathematical Society, Providence, RI, 2016. doi:10.1090/conm/671/13501.DOI
  5. [5]Kenneth S. Brown. Lectures on the cohomology of groups. In Cohomology of Groups and Algebraic K-Theory, volume 12 of Advanced Lectures in Mathematics, pages 131–166. International Press, Somerville, MA, 2010. Author version.
  6. [6]Richard A. DeMillo and Richard J. Lipton. A probabilistic remark on algebraic program testing. Information Processing Letters, 7(4):193–195, 1978.DOI
  7. [7]Józef Dodziuk. Difference equations, isoperimetric inequality and transience of certain random walks. Transactions of the American Mathematical Society, 284(2):787–794, 1984. doi:10.1090/S0002-9947-1984-0743744-X.DOI
  8. [8]Kenneth J. Dykema and Mikael Rørdam. Projections in Free Product C*-Algebras. Geometric and Functional Analysis, 8(1):1–16, 1998. doi:10.1007/s000390050046.DOI
  9. [9]Kenneth J. Dykema and Mikael Rørdam. Erratum to Projections in Free Product C*-Algebras. Geometric and Functional Analysis, 10:975, 2000. doi:10.1007/PL00001644.DOI
  10. [10]Kenneth J. Dykema and Mikael Rørdam. Projections in free product C*-algebras, II. Mathematische Zeitschrift, 234:103–113, 2000. doi:10.1007/s002090050505.DOI
  11. [11]Siegfried Echterhoff and Dana P. Williams. Structure of crossed products by strictly proper actions on continuous-trace algebras, 2012. arXiv:1208.4488v1, August 22, 2012.
  12. [12]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.
  13. [13]Felipe Flores, Mario Klisse, Mícheál Ó Cobthaigh, and Matteo Pagliero. Selfless reduced free products and graph products of C*-algebras, 2026. arXiv:2510.24675v3, August 5, 2026.
  14. [14]Gerald B. Folland. Real Analysis: Modern Techniques and Their Applications. John Wiley & Sons, second edition, 1999.
  15. [15]S. M. Gersten. Subgroups of word hyperbolic groups in dimension 2. Journal of the London Mathematical Society, 54(2):261–283, 1996. doi:10.1112/jlms/54.2.261.DOI
  16. [16]Gómez Aparicio, Pierre Julg, and Alain Valette. The Baum–Connes Conjecture: An Extended Survey. In Ali Chamseddine, Caterina Consani, Nigel Higson, Masoud Khalkhali, Henri Moscovici, and Guoliang Yu, editors, Advances in Noncommutative Geometry: On the Occasion of Alain Connes’ 70th Birthday, pages 127–244. Springer, Cham, 2019. doi:10.1007/978-3-030-29597-4_3.
  17. [17]Mikhail Gromov. Random walk in random groups. Geometric and Functional Analysis, 13:73–146, 2003. doi:10.1007/s000390300002.DOI
  18. [18]Jonathan L. Gross. Voltage graphs. Discrete Mathematics, 9(3):239–246, 1974. doi:10.1016/0012-365X(74)90006-5.DOI
  19. [19]Jonathan L. Gross and Thomas W. Tucker. Generating all graph coverings by permutation voltage assignments. Discrete Mathematics, 18(3):273–283, 1977. doi:10.1016/0012-365X(77)90131-5.DOI
  20. [20]Dominik Gruber. Groups with graphical C(6) and C(7) small cancellation presentations. Transactions of the American Mathematical Society, 367:2051–2078, 2015. arXiv:1210.0178.arxiv.org/abs/1210.0178
  21. [21]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:10.1007/s002220000118.DOI
  22. [22]Nigel Higson, Vincent Lafforgue, and Georges Skandalis. Counterexamples to the Baum–Connes Conjecture. Geometric and Functional Analysis, 12(2):330–354, 2002. doi:10.1007/s00039-002-8249-5.DOI
  23. [23]Wassily Hoeffding. Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association, 58(301):13–30, 1963. doi:10.1080/01621459.1963.10500830.
  24. [24]Richard V. Kadison. Irving kaplansky’s role in mid-twentieth century functional analysis. Notices of the American Mathematical Society, 55(2):216–225, 2008.
  25. [25]Vincent Lafforgue. La conjecture de Baum–Connes à coefficients pour les groupes hyperboliques. Journal of Noncommutative Geometry, 6(1):1–197, 2012. doi:10.4171/JNCG/89.DOI
  26. [26]Wolfgang Lück. The relation between the Baum–Connes conjecture and the trace conjecture. Inventiones Mathematicae, 149:123–152, 2002. doi:10.1007/s002220200215.DOI
  27. [27]Roger C. Lyndon and Paul E. Schupp. Combinatorial Group Theory, volume 89 of Ergebnisse der Mathematik und ihrer Grenzgebiete. Springer-Verlag, Berlin–Heidelberg–New York, 1977.
  28. [28]Wilhelm Magnus. Beziehungen zwischen gruppen und idealen in einem speziellen ring. Mathematische Annalen, 111:259–280, 1935. doi:10.1007/BF01472217.DOI
  29. [29]Igor Mineyev and Guoliang Yu. The Baum–Connes conjecture for hyperbolic groups. Inventiones Mathematicae, 149:97–122, 2002. doi:10.1007/s002220200214.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. doi:10.1145/1667053.1667060.DOI
  31. [31]Yann Ollivier. On a small cancellation theorem of Gromov. Bulletin of the Belgian Mathematical Society – Simon Stevin, 13:75–89, 2006. Revised author version, arXiv:math/0310022v2, September 25, 2024.arxiv.org/abs/math/0310022
  32. [32]OpenAI. The Bass trace conjecture and the characteristic-zero Kaplansky idempotent conjecture. OpenAI Math Release preprint OAI:The-Bass-trace-conjecture-for-complex-group-rings-September-24-2026, 2026.
  33. [33]Damian Osaida. Small cancellation labellings of some infinite graphs and applications. Acta Mathematica, 225:159–191, 2020. doi:10.4310/ACTA.2020.v225.n1.a3.
  34. [34]Mihai Pimsner and Dan Voiculescu. K-groups of reduced crossed products by free groups. Journal of Operator Theory, 8(1):131–156, 1982. Publisher full text.
  35. [35]Michael Reed and Barry Simon. Methods of Modern Mathematical Physics. I: Functional Analysis. Academic Press, revised and enlarged edition, 1980.
  36. [36]Marc A. Rieffel. Projective modules over higher-dimensional non-commutative tori. Canadian Journal of Mathematics, 40(2):257–338, 1988. doi:10.4153/CJM-1988-012-9.DOI
  37. [37]Leonel Robert. Selfless C*-algebras, 2025. arXiv:2309.14188v3, June 6, 2025.arxiv.org/abs/2309.14188
  38. [38]Sauers. A matrix projection of non-integer trace over G gives a projection of fractional trace in C*_r(G * Z), so Kadison–Kaplansky is equivalent to the torsion-free trace conjecture, 2026. Public research note, September 13, 2026. Archived public text.
  39. [39]Jacob T. Schwartz. Fast probabilistic algorithms for verification of polynomial identities. Journal of the ACM, 27(4):701–717, 1980. doi:10.1145/322217.322225.DOI
  40. [40]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:10.1016/j.aim.2011.10.024.DOI
  41. [41]Richard Zippel. Probabilistic algorithms for sparse polynomials. In Edward W. Ng, editor, Symbolic and Algebraic Computation, volume 72 of Lecture Notes in Computer Science, pages 216–226. Springer, 1979.DOI

Paper details

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

views · 10

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