Finitely generated group

In algebra, a finitely generated group is a group G that has some finite generating set S so that every element of G can be written as the combination (under the group operation) of finitely many elements of S and of inverses of such elements.^[1]

By definition, every finite group is finitely generated, since S can be taken to be G itself. Every infinite finitely generated group must be countable but countable groups need not be finitely generated. The additive group of rational numbers Q is an example of a countable group that is not finitely generated.

Every of a finitely generated group G is finitely generated; the quotient group is generated by the images of the generators of G under the canonical projection.

quotient

locally cyclic group

The on a finite set is finitely generated by the elements of that set (§Examples).

free group

every finitely presented group (§Examples) is finitely generated.

A fortiori

Subgroups[edit]

A subgroup of a finitely generated group need not be finitely generated. The commutator subgroup of the free group $F_{2}$ on two generators is an example of a subgroup of a finitely generated group that is not finitely generated.

On the other hand, all subgroups of a finitely generated abelian group are finitely generated.

A subgroup of finite index in a finitely generated group is always finitely generated, and the Schreier index formula gives a bound on the number of generators required.^[2]

In 1954, Albert G. Howson showed that the intersection of two finitely generated subgroups of a free group is again finitely generated. Furthermore, if $m$ and $n$ are the numbers of generators of the two finitely generated subgroups then their intersection is generated by at most $2mn-m-n+1$ generators.^[3] This upper bound was then significantly improved by Hanna Neumann to $2(m-1)(n-1)+1$ ; see Hanna Neumann conjecture.

The lattice of subgroups of a group satisfies the ascending chain condition if and only if all subgroups of the group are finitely generated. A group such that all its subgroups are finitely generated is called Noetherian.

A group such that every finitely generated subgroup is finite is called locally finite. Every locally finite group is periodic, i.e., every element has finite order. Conversely, every periodic abelian group is locally finite.^[4]

Related notions[edit]

The word problem for a finitely generated group is the decision problem of whether two words in the generators of the group represent the same element. The word problem for a given finitely generated group is solvable if and only if the group can be embedded in every algebraically closed group.

The rank of a group is often defined to be the smallest cardinality of a generating set for the group. By definition, the rank of a finitely generated group is finite.

Finitely generated module

Presentation of a group

Rose, John S. (2012) [unabridged and unaltered republication of a work first published by the Cambridge University Press, Cambridge, England, in 1978]. A Course on Group Theory. Dover Publications. 978-0-486-68194-8.