Finitely generated group

The dihedral group of order 8 requires two generators, as represented by this cycle diagram.

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 product of finitely many elements of the finite set 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 quotient of a finitely generated group is finitely generated. A subgroup of a finitely generated group need not be finitely generated.

Cyclic groups

A group that is generated by a single element is called cyclic. Every infinite cyclic group is isomorphic to the additive group of the integers Z.

A group is locally cyclic if every finitely generated subgroup is cyclic. The additive group of the rational numbers Q is an example of a non-cyclic locally cyclic group.^[2] Every locally cyclic group is abelian.^[3] Every finitely generated locally cyclic group is cyclic.

Finitely generated abelian groups

The six 6th complex roots of unity form a cyclic group under multiplication.

Every abelian group can be seen as a module over the ring of integers Z, and in a finitely generated abelian group with generators x₁, ..., x_n, every group element x can be written as a linear combination of these generators,

x = α₁⋅x₁ + α₂⋅x₂ + ... + α_n⋅x_s

with integers α₁, ..., α_n.

The fundamental theorem of finitely generated abelian groups states that a finitely generated abelian group is the direct sum of a free abelian group of finite rank and a finite abelian group, each of which are unique up to isomorphism.

Subgroups

A subgroup of a finitely generated group need not be finitely generated. The commutator subgroup of the free group on two generators is an example of a subgroup of a finitely generated group that is not 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.^[4]

In 1954, A. G. Howson showed that the intersection of two finitely generated subgroups of a free group is again finitely generated. Furthermore, if and are the numbers of generators of the two finitely generated subgroups then their intersection is generated by at most generators.^[5] This upper bound was then significantly improved by Hanna Neumann to , 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.^[6]

Geometric group theory

Geometric group theory studies the connections between algebraic properties of finitely generated groups and topological and geometric properties of spaces on which these groups act.

Related notions

The word problem for a finitely generated group is the decision problem 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.

See also

• Finitely generated module
• Presentation of a group

Notes

References

• 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. ISBN 0-486-68194-7.