The Schur multiplier, profinite completions and decidability

preprint2009arXivOpen access

Abstract

We fix a finitely presented group QQ and consider short exact sequences 1→N→G→Q→11\to N\to G\to Q\to 1 with GG finitely generated. The inclusion N→GN\to G induces a morphism of profinite completions N^→G^\hat N\to \hat G. We prove that this is an isomorphism for all NN and GG if and only if QQ is super-perfect and has no proper subgroups of finite index. We prove that there is no algorithm that, given a finitely presented, residually finite group GG and a finitely presentable subgroup P⊂GP\subset G, can determine whether or not P^→G^\hat P\to\hat G is an isomorphism.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.