The complexity of isomorphism between countably based profinite groups
Group Theory
2019-02-08 v2
Abstract
A topological group G is profinite if it is compact and totally disconnected. Equivalently, G is the inverse limit of a surjective system of finite groups carrying the discrete topology. We discuss how to represent a countably based profinite group as a point in a Polish space. Then we study the complexity of isomorphism using the theory of Borel reducibility in descriptive set theory. For topologically finitely generated profinite groups this complexity is the same as the one of identity for reals. In general, it is the same as the complexity of isomorphism for countable graphs.
Cite
@article{arxiv.1604.00609,
title = {The complexity of isomorphism between countably based profinite groups},
author = {Andre Nies},
journal= {arXiv preprint arXiv:1604.00609},
year = {2019}
}
Comments
This version fixed an error pointed out by Henry Wilton. Not every 3-solvable f.g. group is r.f