HOME

TheInfoList



OR:

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. By definition, every
finite group Finite is the opposite of infinite. It may refer to: * Finite number (disambiguation) * Finite set, a set whose cardinality (number of elements) is some natural number * Finite verb, a verb form that has a subject, usually being inflected or marked ...
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.


Examples

* 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 subgroup of a finitely generated group need not be finitely generated. * A group that is generated by a single element is called cyclic. Every infinite cyclic group is
isomorphic In mathematics, an isomorphism is a structure-preserving mapping between two structures of the same type that can be reversed by an inverse mapping. Two mathematical structures are isomorphic if an isomorphism exists between them. The word is ...
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.


Finitely generated Abelian groups

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''1, ..., ''x''''n'', every group element ''x'' can be written as a linear combination of these generators, :''x'' = ''α''1⋅''x''1 + ''α''2⋅''x''2 + ... + ''α''''n''⋅''x''''n'' with integers ''α''1, ..., ''α''''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 The direct sum is an operation between structures in abstract algebra, a branch of mathematics. It is defined differently, but analogously, for different kinds of structures. To see how the direct sum is used in abstract algebra, consider a more ...
of a
free Abelian group In mathematics, a free abelian group is an abelian group with a basis. Being an abelian group means that it is a set with an addition operation that is associative, commutative, and invertible. A basis, also called an integral basis, is a subse ...
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 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 Index (or its plural form indices) may refer to: Arts, entertainment, and media Fictional entities * Index (''A Certain Magical Index''), a character in the light novel series ''A Certain Magical Index'' * The Index, an item on a Halo megastru ...
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 Albert Geoffrey Howson (1931 – 1 November 2022) was a British mathematician and educationist. He started to work as algebraist and in 1954 published the Howson property of groups and proved it for some types of groups. Later he devoted himsel ...
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. 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 Order, ORDER or Orders may refer to: * Categorization, the process in which ideas and objects are recognized, differentiated, and understood * Heterarchy, a system of organization wherein the elements have the potential to be ranked a number of d ...
. Conversely, every periodic abelian group is locally finite.


Applications

Geometric group theory studies the connections between algebraic properties of finitely generated groups and topological and
geometric Geometry (; ) is, with arithmetic, one of the oldest branches of mathematics. It is concerned with properties of space such as the distance, shape, size, and relative position of figures. A mathematician who works in the field of geometry is ca ...
properties of
spaces Spaces may refer to: * Google Spaces (app), a cross-platform application for group messaging and sharing * Windows Live Spaces, the next generation of MSN Spaces * Spaces (software), a virtual desktop manager implemented in Mac OS X Leopard * Spac ...
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 In mathematics, the cardinality of a set is a measure of the number of elements of the set. For example, the set A = \ contains 3 elements, and therefore A has a cardinality of 3. Beginning in the late 19th century, this concept was generalized ...
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

* {{cite book , last=Rose , first=John S. , date=2012 , title=A Course on Group Theory , publisher=Dover Publications , isbn=978-0-486-68194-8 , orig-year=unabridged and unaltered republication of a work first published by the Cambridge University Press, Cambridge, England, in 1978 Group theory Properties of groups