The Friedman embedding theorem. (Q645257): Difference between revisions

The article is a sequel to the same author's article [in J. Group Theory 12, No. 4, 561-565 (2009; Zbl 1215.20034)] which already dealt with the ``Borelness'' of HNN constructions. In the former, the author showed that there exists \textit{no} Borel map \(\varphi\) from the space of countable groups to that of 2-generated groups such that: (1) any countable group \(G\) embeds into \(\varphi(G)\) and (2) if \(G\) and \(H\) are isomorphic, then so are \(\varphi(G)\) and \(\varphi(H)\). It was however claimed with no proof that there actually \textit{exists} a Borel map with properties (1) and (2) from the space of \textit{finitely generated} groups to that of 2-generated groups. The latter statement, attributed by the author to Harvey Friedman (for unpublished work), is the main theorem (Theorem 1.2) of the article under review. It is obtained by using some recursion theory, namely by first embedding a finitely-generated group \(G\) into the group of permutations of the integers with Turing degree not greater than the Turing degree of the word problem in \(G\). Another ingredient is a combinatorial group theoretic argument of \textit{F. Galvin} [Am. Math. Mon. 100, No. 6, 578-580 (1993; Zbl 0937.20501)]. In section 6 some conjectures are made, around the (non-)existence of a ``purely group-theoretic'' method, i.e. continuous \(\varphi\).