SearcharxivSearch

arXiv · 2305.18904

Bounded cohomology is not a profinite invariant

Abstract

We construct pairs of residually finite groups with isomorphic profinite completions such that one has non-vanishing and the other has vanishing real second bounded cohomology. The examples are lattices in different higher rank simple Lie groups. Using Galois cohomology, we actually show that $\operatorname{SO}^0(n,2)$ for $n \ge 6$ and the exceptional groups $E_{6(-14)}$ and $E_{7(-25)}$ constitute the complete list of higher rank Lie groups admitting such examples.

Explore related subjects

Keep this discovery

BibTeXRIS

Daniel Echtler, Holger Kammeyer. 2023-05-30. Bounded cohomology is not a profinite invariant. https://doi.org/10.4153/s0008439523000826

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR