The strong profinite genus of a finitely presented group can be infinite. (Q303826)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 6618712
Language Label Description Also known as
default for all languages
No label defined
    English
    The strong profinite genus of a finitely presented group can be infinite.
    scientific article; zbMATH DE number 6618712

      Statements

      The strong profinite genus of a finitely presented group can be infinite. (English)
      0 references
      0 references
      22 August 2016
      0 references
      profinite completions
      0 references
      profinite genus
      0 references
      finitely presented groups
      0 references
      residually finite groups
      0 references
      Grothendieck pairs
      0 references
      In 1970 Alexander Grothendieck posed the following problem: let \(\Gamma_1\) and \(\Gamma_2\) be residually finite groups and let \(u\colon\Gamma_1\to\Gamma_2\) be a homomorphism such that the induced map of profinite completions \(\widehat u\colon\widehat\Gamma_1\to\widehat\Gamma_2\) is an isomorphism; if \(\Gamma_1\) and \(\Gamma_2\) are finitely presented, must \(u\) be an isomorphism?NEWLINENEWLINE This problem was settled [in Ann. Math. (2) 160, No. 1, 359-373 (2004; Zbl 1083.20023)] by \textit{F. J. Grunewald} and the author who showed that \(u\) need not be an isomorphism. There has since been a considerable amount of work exploring the extent to which \(\Gamma_1\) can differ from \(\Gamma_2\).NEWLINENEWLINE In this paper the author constructs the first examples of finitely presented, residually finite groups \(\Gamma\) that contain an infinite sequence of non-isomorphic finitely presented subgroups \(P_n\hookrightarrow\Gamma\) such that the inclusion maps induce isomorphisms of profinite completions \(\widehat P_n\cong\widehat\Gamma\).
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references