The Friedman embedding theorem.
2-generator groupsBorel equivalence relationscombinatorial group theorycountable groupsHigman-Neumann-Neumann embedding theoremHigman-Neumann-Neumann extensionsrecursion theoryTuring degrees
Word problems, etc. in computability and recursion theory (03D40) Descriptive set theory (03E15) Free products of groups, free products with amalgamation, Higman-Neumann-Neumann extensions, and generalizations (20E06) Subgroup theorems; subgroup growth (20E07) Generators, relations, and presentations of groups (20F05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)
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\).
- A remark on the Higman–Neumann–Neumann embedding theorem
- Borel determinacy
- Borel equivalence relations and classifications of countable models
- DEGREES OF GROWTH OF FINITELY GENERATED GROUPS, AND THE THEORY OF INVARIANT MEANS
- Embedding Countable Groups in 2-Generator Groups
- Embedding Theorems for Groups
- Embeddings into hopfian groups
- scientific article; zbMATH DE number 4091484 (Why is no real title available?)
- scientific article; zbMATH DE number 3574107 (Why is no real title available?)
- scientific article; zbMATH DE number 722611 (Why is no real title available?)
- On the complexity of the isomorphism relation for finitely generated groups
- The axiom of determinateness and reduction principles in the analytical hierarchy
- The space of finitely generated groups
This page was built for publication: The Friedman embedding theorem.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q645257)