Papers
Topics
Authors
Recent
Search
2000 character limit reached

The Baum-Connes and the Mishchenko-Kasparov assembly maps for group extensions

Published 14 Jan 2026 in math.OA and math.KT | (2601.09615v1)

Abstract: The Baum-Connes assembly map with coefficients $e_{\ast}$ and the Mishchenko-Kasparov assembly map with coefficients $μ{\ast}$ are two homomorphisms from the equivariant $K$-homology of classifying spaces of groups to the $K$-theory of reduced crossed products. In this paper, we investigate these two assembly maps for group extensions $1\rightarrow N \rightarrow Γ\xrightarrow{q} Γ/ N \rightarrow 1$. Firstly, under the assumption that $e{\ast}$ is isomorphic for $q{-1}(F)$ for any finite subgroup $F$ of $Γ/N$, we prove that $e_{\ast}$ is injective, surjective and isomorphic for $Γ$ if they are also true for $Γ/N$, respectively. Secondly, under the assumption that $e_{\ast}$ is rationally isomorphic for $N$, we verify that $μ{\ast}$ is rationally injective for $Γ$ if it is also rationally injective for $Γ/N$. Finally, when $Γ$ is an isometric semi-direct product $N\rtimes G$, we confirm that $e{\ast}$ is injective, surjective and isomorphic for $Γ$ if they also hold for $G$ and $Γ$ satisfies three partial conjectures along $N$, respectively. As applications, we show that the strong Novikov conjecture, the surjective assembly conjecture and the Baum-Connes conjecture with coefficients are closed under direct products, central extensions of groups and extensions by finite groups. Meanwhile, we also show that the rational analytic Novikov conjecture with coefficients is preserved under extensions of finite groups. Besides, we employ these results to obtain some new examples for the rational analytic and the strong Novikov conjecture beyond the class of coarsely embeddable groups.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.