finitely generated group

mathematics

Written by

The Information Architects of Encyclopaedia Britannica

Last updated

July 20, 2026

Quick Summary

A finitely generated group is a group where all elements can be created by combining a finite set of "generating" elements using the group's operation and its inverse. In essence, you start with a small, fixed set of elements and repeatedly apply the group's rule to produce every other element in the group.12

Modern algebra studies abstract structures like groups, focusing on their properties rather than specific elements. Groups are fundamental in mathematics and have applications in geometry, physics, and chemistry, often representing symmetry or transformations. The set of integers with addition is an example of an abelian (commutative) group.312

Summary created from Britannica articles using AI. AI can make mistakes, so verify using Britannica articles.

3 Britannica Sources

Ask Britannica AI about this topic

Britannica doesn't have a full article on this topic, so we've curated a list of our relevant coverage.

Burnside problem
…problem of determining if a finitely generated periodic group with each element of finite order must necessarily be a finite group. The problem was formulated by the English mathematician William Burnside in 1902.
Read More
…problem of determining if a finitely generated periodic group with each element of finite order must necessarily be a finite group. The problem was formulated by the English mathematician William Burnside in 1902.
Read More