The Setting
A group presentation with three generators may have an infinite list of relators. The question is when such a group can occur as a subgroup of a finitely presented group.
Let be the three-letter alphabet (1)✦ An unreduced signed word over the alphabet of (1) is a finite sequence of letters paired with signs or , including the empty sequence.✦ Let be the set of unreduced signed words over : (2)✦ Let be the free group on , and write for the element represented by a word in (2).
A total computable enumeration of relators is a function for which an algorithm terminates on every input and returns . For a total computable enumeration of relators, define the group by the presentation (3)
The Claim
Theorem 1. Let be total and computable, and let be the group in (3). There is a finitely presented group and an embedding (4)✦
In the paper, the result reads: an embedding is an injective group homomorphism, and Higman’s embedding theorem characterizes the finitely generated subgroups of finitely presented groups as the groups admitting a recursively enumerable set of defining relations.
What Is Checked
The claim (4) is stated over total computable enumerations of unreduced signed words on the fixed alphabet .