A subgroup of a finitely generated group is benign if some finitely presented group contains and some finitely generated subgroup satisfies . The subgroup itself need not be finitely generated. A centralizing HNN extension of along is finitely presented even when the corresponding intersection subgroup is infinitely generated.
If is a benign subgroup, use its witness inside a finitely presented group. Enumerate words on the generators of , together with proofs that each equals a substituted word on the generators of . This enumerates exactly the null words of , giving a recursive presentation of a group. The Higman embedding theorem then embeds the finitely generated quotient in a finitely presented group.
For benign subgroups , amalgamate their finite-presentation witnesses over the finitely generated , then adjoin independent stable letters centralizing their finite-generation witnesses. Britton's lemma identifies the subgroup generated by with the extension centralizing . In it, and . Both conjugate witnesses are finitely generated, proving benignity. For the second identity, the subgroup generated by is the iterated amalgamated free product ; its normal forms show that adjoining each outer copy intersects the central copy only in the subgroup already generated by .
These upper and lower quantities use , without subtracting one. For a free group with , the Nielsen–Schreier formula gives . The upper value is , attained at the whole group, and the lower value is , approached by kernels of maps onto cyclic groups of arbitrarily large finite order. The frequently used shifted rank gradient replaces by and therefore gives different upper values.
If has generators, there are at most group homomorphisms . Each subgroup of index is a point stabilizer in a transitive coset group action, so there are at most such subgroups. Consequently finitely many subgroups have index at most any fixed bound. Intersecting them gives a finite-index characteristic subgroup, useful in proving residual finiteness of semidirect products.
The rank of a finitely generated group is the minimum cardinality of a generating set of a group of .
Articles by others on the same topic
A finitely generated group is a group \( G \) that can be generated by a finite set of elements. More formally, there exists a finite set of elements \( \{ g_1, g_2, \ldots, g_n \} \) in \( G \) such that every element \( g \in G \) can be expressed as a finite combination of these generators and their inverses.