Group presentation is a method to express groups as a quotient of a free group and a normal subgroup. In a presentation, there are generators and relators, and the presentation yields a ‘minimalist implementation’ of these generators and relations. Some cases of special interests are finitely generated/related/presented groups. From the definition, finite generation + finite relation is not linguistically equivalent to finite presentation. There has been some discussion on the relation of the three properties for several other algebraic structures. This entry proves that finite generation + finite relation implies finite presentation for groups.
For modules, finite generation and finite relation implies finite presentation. For abelian groups (i.e., -modules), finite generation implies finite relation and finite presentation.
We’ll go through the necessary definitions and then prove the following proposition:
If for some finite , then both are isomorphic to with finite . That is, a group that is both finitely generated and finitely related must be finitely presented.
Group, free group (constructive, ), generated (normal) subgroup ( and ) are omitted.
Presentation Given a pair of set , where , the group is denoted by .
Finite -tion If a group is isomorphic to some where [resp. , both and ] is [resp. is, are] finite, is said to be finitely generated [resp. related, presented].
Remarks Here the definition of finitely generated group is different from what is usually known in the textbooks. One can regard the textbook definition as the internal version and the one here as the external version. Indeed, they are equivalent.
If for some finite , define then .
Conversely, if for some finite via isomorphism , then
We now prove that if a group is both finitely generated and finitely related, it is finitely presented.
Suppose where are finite. Let be an isomorphism. Write and .
We write for each , where is a finite product of elements and their inverses in . I.e., they use finitely many symbols from . For each relator in , it uses only finitely many symbols from . Collect these symbols and put them into a (finite) set .
We claim . Suppose not, and . Define where is the truth indication function, i.e., maps to and everything else in to . (Uniquely) extend to a homomorphism . Note that for all , by definition, , and since only uses symbols in , we conclude . Now, where is a finite product of elements and their inverses in . To get this, first write as a coset of translated by a finite product of elements and their inverses in . Then apply on each term in the product, and write the outcome as a coset of translated by a product of finite products of elements and their inverses in (by our choice). Applying to both sides of the equation yields , a contradiction.
Therefore, and is a finite presentation.