fbpx
Wikipedia

Higman's embedding theorem

In group theory, Higman's embedding theorem states that every finitely generated recursively presented group R can be embedded as a subgroup of some finitely presented group G. This is a result of Graham Higman from the 1960s.[1]

On the other hand, it is an easy theorem that every finitely generated subgroup of a finitely presented group is recursively presented, so the recursively presented finitely generated groups are (up to isomorphism) exactly the finitely generated subgroups of finitely presented groups.

Since every countable group is a subgroup of a finitely generated group, the theorem can be restated for those groups.

As a corollary, there is a universal finitely presented group that contains all finitely presented groups as subgroups (up to isomorphism); in fact, its finitely generated subgroups are exactly the finitely generated recursively presented groups (again, up to isomorphism).

Higman's embedding theorem also implies the Novikov-Boone theorem (originally proved in the 1950s by other methods) about the existence of a finitely presented group with algorithmically undecidable word problem. Indeed, it is fairly easy to construct a finitely generated recursively presented group with undecidable word problem. Then any finitely presented group that contains this group as a subgroup will have undecidable word problem as well.

The usual proof of the theorem uses a sequence of HNN extensions starting with R and ending with a group G which can be shown to have a finite presentation.[2]

References Edit

  1. ^ Graham Higman, Subgroups of finitely presented groups. Proceedings of the Royal Society. Series A. Mathematical and Physical Sciences. vol. 262 (1961), pp. 455-475.
  2. ^ Roger C. Lyndon and Paul E. Schupp. Combinatorial Group Theory. Springer-Verlag, New York, 2001. "Classics in Mathematics" series, reprint of the 1977 edition. ISBN 978-3-540-41158-1

higman, embedding, theorem, confused, with, universal, embedding, theorem, group, theory, states, that, every, finitely, generated, recursively, presented, group, embedded, subgroup, some, finitely, presented, group, this, result, graham, higman, from, 1960s, . Not to be confused with Universal embedding theorem In group theory Higman s embedding theorem states that every finitely generated recursively presented group R can be embedded as a subgroup of some finitely presented group G This is a result of Graham Higman from the 1960s 1 On the other hand it is an easy theorem that every finitely generated subgroup of a finitely presented group is recursively presented so the recursively presented finitely generated groups are up to isomorphism exactly the finitely generated subgroups of finitely presented groups Since every countable group is a subgroup of a finitely generated group the theorem can be restated for those groups As a corollary there is a universal finitely presented group that contains all finitely presented groups as subgroups up to isomorphism in fact its finitely generated subgroups are exactly the finitely generated recursively presented groups again up to isomorphism Higman s embedding theorem also implies the Novikov Boone theorem originally proved in the 1950s by other methods about the existence of a finitely presented group with algorithmically undecidable word problem Indeed it is fairly easy to construct a finitely generated recursively presented group with undecidable word problem Then any finitely presented group that contains this group as a subgroup will have undecidable word problem as well The usual proof of the theorem uses a sequence of HNN extensions starting with R and ending with a group G which can be shown to have a finite presentation 2 References Edit Graham Higman Subgroups of finitely presented groups Proceedings of the Royal Society Series A Mathematical and Physical Sciences vol 262 1961 pp 455 475 Roger C Lyndon and Paul E Schupp Combinatorial Group Theory Springer Verlag New York 2001 Classics in Mathematics series reprint of the 1977 edition ISBN 978 3 540 41158 1 Retrieved from https en wikipedia org w index php title Higman 27s embedding theorem amp oldid 905854060, wikipedia, wiki, book, books, library,

article

, read, download, free, free download, mp3, video, mp4, 3gp, jpg, jpeg, gif, png, picture, music, song, movie, book, game, games.