The University of Southampton
University of Southampton Institutional Repository

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

Coset correct means on groups and the probability that two elements commute
Coset correct means on groups and the probability that two elements commute
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.
Martino, Armando
65f1ff81-7659-4543-8ee2-0a109be286f1
Valiunas, Motiejus
23b32cdf-14c1-409c-9fc7-d53b54623233
Martino, Armando
65f1ff81-7659-4543-8ee2-0a109be286f1
Valiunas, Motiejus
23b32cdf-14c1-409c-9fc7-d53b54623233

[Unknown type: UNSPECIFIED]

Record type: UNSPECIFIED

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.

Text
2511.20787v1 - Author's Original
Download (567kB)

More information

Published date: 25 November 2025

Identifiers

Local EPrints ID: 507209
URI: http://eprints.soton.ac.uk/id/eprint/507209
PURE UUID: 70445a8e-3dd1-40e1-95a8-bacfdec95318
ORCID for Armando Martino: ORCID iD orcid.org/0000-0002-5350-3029
ORCID for Motiejus Valiunas: ORCID iD orcid.org/0000-0003-1519-6643

Catalogue record

Date deposited: 01 Dec 2025 17:45
Last modified: 02 Dec 2025 02:43

Export record

Altmetrics

Contributors

Author: Armando Martino ORCID iD
Author: Motiejus Valiunas ORCID iD

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×