OctoInformBeta

Boone–Higman embeddings with higher finiteness

A group has type F∞F_\infty if it is the fundamental group of a connected Hausdorff CW complex with finitely many cells in each dimension and a contractible covering space. For a group with a specified finite generating set, decidability of the word problem means that an algorithm determines whether any word in the generators and their inverses represents the identity. The question is whether every finitely generated group with decidable word problem embeds in a finitely presented simple group.

A set of defining relations is recursively enumerable if an algorithm lists exactly its members. Higman’s embedding theorem characterizes the finitely generated subgroups of finitely presented groups as the groups admitting a recursively enumerable set of defining relations. Boone and Higman characterized decidability of the word problem for a finitely generated group GG by the existence of embeddings G↪H↪KG\hookrightarrow H\hookrightarrow K with HH simple and KK finitely presented.

The preprint proves that a finitely generated group has decidable word problem if and only if it embeds in a finitely presented simple group.

The Lean library UniversalGroup proves that there is a single group HH of type F∞F_\infty into which every finitely presented group embeds. The Lean library makes no assertion of simplicity or decidability of the word problem for HH. Lean has checked every result of the Lean library, so the Lean library is the reference for the statements on these pages. Each result is stated as in the Lean library and linked to its Lean declaration. Where the preprint gives a different statement, its statement appears beside the Lean library’s statement. The preprint is a guide only, supplying the order and names of the results.