SearcharxivSearch

arXiv · 2511.20787

Coset correct means on groups and the probability that two elements commute

Abstract

Amenable groups are those admitting an invariant mean -- a finitely additive probability mean that assigns equal ``weight'' to any two translates of the same set. We introduce coset correct means (CCMs), a class of finitely additive means that, for any subgroup, assigns equal weight to all its cosets, weakening and therefore generalising the notion of an invariant mean. We show that, unlike the case for invariant means, every group admits a CCM and give two constructions -- one via the Ultrafilter Lemma and one via the Hahn--Banach Theorem -- both relying on a Theorem of B. H. Neumann. Using CCMs, we define a degree of commutativity for arbitrary groups, measuring the ``probability'' that two random elements of a group commute. We prove that this degree of commutativity is independent of the choice of CCM and is positive precisely for finite-by-abelian-by-finite groups, recovering and unifying previous characterisations. We also introduce a defect function that quantifies the failure of left invariance for finitely additive means, and define the defect of a group as the infimum of these. We then prove a dichotomy: the defect for a group is either 0 or 1, with 0 characterising amenable groups.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Armando Martino, Motiejus Valiunas. 2025-11-25. Coset correct means on groups and the probability that two elements commute. https://arxiv.org/abs/2511.20787

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