Mathematics > Group Theory
[Submitted on 3 May 2018 (v1), last revised 13 Mar 2019 (this version, v4)]
Title:Amenability versus non-exactness of dense subgroups of a compact group
View PDFAbstract:Given a countable residually finite group, we construct a compact group K and two elements w and u of K with the following properties: The group generated by w and the cube of u is amenable, the group generated by w and u contains a copy of the given group, and these two groups are dense in K. By combining it with a construction of non-exact groups that are LEF by Osajda and Arzhantseva--Osajda and formation of diagonal products, we construct an example for which the latter dense group is non-exact. Our proof employs approximations in the space of marked groups of LEF ("Locally Embeddable into Finite groups") groups.
Submission history
From: Masato Mimura [view email][v1] Thu, 3 May 2018 16:10:29 UTC (22 KB)
[v2] Fri, 27 Jul 2018 17:31:49 UTC (33 KB)
[v3] Mon, 10 Sep 2018 06:41:37 UTC (34 KB)
[v4] Wed, 13 Mar 2019 08:44:59 UTC (37 KB)
Current browse context:
math.GR
References & Citations
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.