Namespaces
Variants
Actions

Difference between revisions of "Finitely-presented group"

From Encyclopedia of Mathematics
Jump to: navigation, search
(Importing text file)
 
(Category:Group theory and generalizations)
 
(One intermediate revision by one other user not shown)
Line 1: Line 1:
 +
{{TEX|done}}
 
A group on finitely many generators defined by finitely many relations between these generators. Up to an isomorphism, there are countably many such groups. Every set of defining relations between the elements of any finite generating set of a finitely-presented group contains a finite set of defining relations in these generators.
 
A group on finitely many generators defined by finitely many relations between these generators. Up to an isomorphism, there are countably many such groups. Every set of defining relations between the elements of any finite generating set of a finitely-presented group contains a finite set of defining relations in these generators.
  
Line 7: Line 8:
  
 
====Comments====
 
====Comments====
A finitely-presented group is isomorphic to a quotient group <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/f/f040/f040360/f0403601.png" />, where <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/f/f040/f040360/f0403602.png" /> is a [[Free group|free group]] of finite rank and <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/f/f040/f040360/f0403603.png" /> is the smallest [[Normal subgroup|normal subgroup]] of <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/f/f040/f040360/f0403604.png" /> containing a given finite subset <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/f/f040/f040360/f0403605.png" /> of <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/f/f040/f040360/f0403606.png" /> (the set of relations).
+
A finitely-presented group is isomorphic to a quotient group $F/N(R)$, where $F$ is a [[Free group|free group]] of finite rank and $N(R)$ is the smallest [[Normal subgroup|normal subgroup]] of $F$ containing a given finite subset $R$ of $F$ (the set of relations).
  
 
Some standard references on group presentations are [[#References|[a1]]]–[[#References|[a4]]].
 
Some standard references on group presentations are [[#References|[a1]]]–[[#References|[a4]]].
  
 
====References====
 
====References====
<table><TR><TD valign="top">[a1]</TD> <TD valign="top">  H.S.M. Coxeter,  W.O.J. Moser,  "Generators and relations for discrete groups" , Springer  (1984)</TD></TR><TR><TD valign="top">[a2]</TD> <TD valign="top">  D.L. Johnson,  "Presentations of groups" , Cambridge Univ. Press  (1988)</TD></TR><TR><TD valign="top">[a3]</TD> <TD valign="top">  R.C. Lyndon,  P.E. Schupp,  "Combinatorial group theory" , Springer  (1977)</TD></TR><TR><TD valign="top">[a4]</TD> <TD valign="top">  W. Magnus,  A. Karrass,  B. Solitar,  "Combinatorial group theory: presentations in terms of generators and relations" , Wiley (Interscience)  (1966)</TD></TR></table>
+
<table>
 +
<TR><TD valign="top">[a1]</TD> <TD valign="top">  H.S.M. Coxeter,  W.O.J. Moser,  "Generators and relations for discrete groups" , Springer  (1984)</TD></TR>
 +
<TR><TD valign="top">[a2]</TD> <TD valign="top">  D.L. Johnson,  "Presentations of groups" , Cambridge Univ. Press  (1988)</TD></TR>
 +
<TR><TD valign="top">[a3]</TD> <TD valign="top">  R.C. Lyndon,  P.E. Schupp,  "Combinatorial group theory" , Springer  (1977)</TD></TR>
 +
<TR><TD valign="top">[a4]</TD> <TD valign="top">  W. Magnus,  A. Karrass,  B. Solitar,  "Combinatorial group theory: presentations in terms of generators and relations" , Wiley (Interscience)  (1966)</TD></TR>
 +
</table>
 +
 
 +
[[Category:Group theory and generalizations]]

Latest revision as of 18:26, 26 October 2014

A group on finitely many generators defined by finitely many relations between these generators. Up to an isomorphism, there are countably many such groups. Every set of defining relations between the elements of any finite generating set of a finitely-presented group contains a finite set of defining relations in these generators.

References

[1] A.G. Kurosh, "The theory of groups" , 1–2 , Chelsea (1955–1956) (Translated from Russian)


Comments

A finitely-presented group is isomorphic to a quotient group $F/N(R)$, where $F$ is a free group of finite rank and $N(R)$ is the smallest normal subgroup of $F$ containing a given finite subset $R$ of $F$ (the set of relations).

Some standard references on group presentations are [a1][a4].

References

[a1] H.S.M. Coxeter, W.O.J. Moser, "Generators and relations for discrete groups" , Springer (1984)
[a2] D.L. Johnson, "Presentations of groups" , Cambridge Univ. Press (1988)
[a3] R.C. Lyndon, P.E. Schupp, "Combinatorial group theory" , Springer (1977)
[a4] W. Magnus, A. Karrass, B. Solitar, "Combinatorial group theory: presentations in terms of generators and relations" , Wiley (Interscience) (1966)
How to Cite This Entry:
Finitely-presented group. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Finitely-presented_group&oldid=13915
This article was adapted from an original article by O.A. Ivanova (originator), which appeared in Encyclopedia of Mathematics - ISBN 1402006098. See original article