Finitely generated group

• Every quotient 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.
• 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 locally cyclic group is a group in which every finitely generated subgroup is cyclic.
• The free group on a finite set is finitely generated by the elements of that set (§Examples).
• A fortiori, every finitely presented group (§Examples) is finitely generated.

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_n

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

Subgroups of a finitely generated abelian group are themselves finitely generated.

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.

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.

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.

In 1954, Albert 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. 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.

Finitely generated groups arise in diverse mathematical and scientific contexts. A frequent way they do so is by the Švarc-Milnor lemma, or more generally thanks to an action through which a group inherits some finiteness property of a space. 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.

Differential geometry and topology

• Fundamental groups of compact manifolds are finitely generated. Their geometry coarsely reflects the possible geometries of the manifold: for instance, non-positively curved compact manifolds have CAT(0) fundamental groups, whereas uniformly positively-curved manifolds have finite fundamental group (see Myers' theorem).
• Mostow's rigidity theorem: for compact hyperbolic manifolds of dimension at least 3, an isomorphism between their fundamental groups extends to a Riemannian isometry.
• Mapping class groups of surfaces are also important finitely generated groups in low-dimensional topology.

Algebraic geometry and number theory

• Lattices in Lie groups, in p-adic groups...
• Superrigidity, Margulis' arithmeticity theorem

Combinatorics, algorithmics and cryptography

• Infinite families of expander graphs can be constructed thanks to finitely generated groups with property T
• Algorithmic problems in combinatorial group theory
• Group-based cryptography attempts to make use of hard algorithmic problems related to group presentations in order to construct quantum-resilient cryptographic protocols

Analysis

Probability theory

• Random walks on Cayley graphs of finitely generated groups provide approachable examples of random walks on graphs
• Percolation on Cayley graphs

Physics and chemistry

• Crystallographic groups
• Molecular symmetry groups
• Mapping class groups appear in topological quantum field theories

Biology

• Knot groups are used to study molecular knots

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.