Quick description
This page lists various constructions of new examples of groups and subgroups from known examples, and gives some brief notes of what each construction is good for.
![]() |
General discussion
This is a list of various standard constructions of groups and subgroups.
-
Direct products
-
Semidirect products
-
Extensions
-
Central extensions
-
-
Fibre products
-
Wreath products
-
Amalgamated free products
-
Free products
-
-
HNN extensions
-
Graphs of groups
-modules, this construction can be seen as a way of constructing abelian groups.Semidirect products
The group law on the direct product
is determined by the requirement that
for every
and
. That is,
acts on
by conjugation, and the action is trivial. The semidirect product construction derives from the observation that any action of
on
could be used to construct a new group in the same way. Let
be a right-action of
on
, so for any
we have an automorphism
of
that acts on the right, sending an element
to
. The semidirect product
is in bijection with the set of pairs
where
and
, and the group law is determined by the requirement that
.
![]() |
Often the action
is suppressed. By construction, the subgroup
of
is normal, and the quotient is isomorphic to
. So
is an extension of
by
. In fact, any split extension of
by
is a semidirect product.
Extensions
A group
is an extension of a group
by a group
if there is a short exact sequence
(In other words, the
is the quotient of
by
.) The following example takes advantage of two features of extensions.
-
The subgroup
is to
as the trivial subgroup is to
. -
Often
can be chosen to have better properties than
. In particular, any presentation for
corresponds to an extension where
is free.
Example 1
It is a famous and non-trivial fact that there exists a finite group presentation
in which the word problem is unsolvable. That is, there is no algorithm that will tell you whether or not a given word in the generators represents the identity in
. (We will not use the fact that
is finite in this example. But it will be important in Example 2 below.)
We will use group extensions to produce a different pathology in a much better behaved group—a free group.
Let
be the free group on
. The relations
can be thought of as elements of
. By the universal property of free groups, the obvious map
extends to a surjection
. The kernel of this surjection is precisely
, the normal subgroup of
generated by the relations. That is, we have a short exact sequence
The fact that the word problem is unsolvable in
can now be restated precisely as the assertion that there are normal subgroups of
with unsolvable membership problem.
of
with the property that there is no algorithm to determine whether or not a given element of
is in
.So we see that the existence of the highly pathological group
corresponds to a different sort of pathological behaviour in the well-behaved group 
Fibred products
The fibred product construction in the category of groups is the same as in the category of sets. If
and
are surjections then the fibred product of
and
is the subgroup of
defined as the preimage of the diagonal subgroup of
under the map
. That is,
Fibred products can be used to improve the finiteness properties of subgroups. Example 1 showed how to construct a non-trivial subgroup
of a free group with unsolvable membership problem. Although
was finitely generated as a normal subgroup of
, it is a consequence of Greenberg's Theorem (Greenberg's Theorem states that every finitely generated normal subgroup of a finitely generated free group is of finite index) that
is not finitely generated as a group. In fact, every finitely generated subgroup of a free group has solvable membership problem.
In the following example, we will use a fibred product to construct a finitely generated subgroup of a direct product of two free groups that has unsolvable membership problem.
Example 2
Let
be a finitely presented group with unsolvable word problem as in Example 1 and let
be the quotient map derived from the presentation. Let
be the fibre product of two copies of
, a subgroup of
. Then
where
is the diagonal subgroup of
. The membership problem for
in
is unsolvable, (indeed,
is an element of
if and only if
is trivial in
) and this translates precisely to the statement that the membership problem for
in
is unsolvable. But the finite set
generates
.
We have proved the following.
of
with the property that there is no algorithm to determine whether or not a given element of
is in
.Wreath products
A wreath product is a special case of a semidirect product. We will first restrict our attention to the wreath product of two finite groups
and
. The set of set maps
is a group (multiplication comes from multiplication in
) and is naturally equipped with a right-action of
, namely the action by left translation. (It is easy to get confused by the fact that left translation is a right action!) We can think of
as the direct sum of copies of
, indexed by the elements of
, and
acts by permuting the factors. This is precisely the data needed for a semidirect product construction.
The wreath product of
by
is defined to be
where
acts on
by left translation.
When
or
may be infinite, we define
to be precisely those set maps that equal the identity on all but finitely many elements of
. This has the effect that
is isomorphic to the direct sum, rather than the direct product, of
copies of
. Our first example of a wreath product shows how to construct a 2-generator group with an abelian subgroup of infinite rank.
Example 3
The group
is the direct sum of countably many copies of
, and so can be thought of as the group of biinfinite sequences of integers that are equal to zero in all but finitely many coordinates. It admits an action of
, where the integer
acts by moving the
th coordinate to the
th coordinate. The orbit of the sequence that is
in every non-zero coordinate and
in the
th coordinate generates
. (Here the fact that
is the direct sum, rather than the direct product, is important.) The resulting semidirect product is precisely the wreath product
. It contains the infinite-rank abelian group
as a subgroup, and is generated by just two elements.
More generally, given any transitive action of
on a set
, one can define the wreath product
to be the semidirect product of
and
, where as before
acts on
by left-translation.
![]() |
Amalgamated free products
Amalgamated free products are push-outs in the category of groups. If
and
are both injective then the push-out of the corresponding diagram is by definition the amalgamated free product
. This is the freest possible group that contains
and
as subgroups in which the two copies of
are identified.
The Seifert–van Kampen Theorem asserts that if a path-connected topological space
can be decomposed as the union of two closed, path-connected subsets then the fundamental group of
is a push-out. Therefore, amalgamated free products arise very naturally in topology.
Example 4
Suppose
is a compact orientable surface and
is a simple closed curve that is not homotopic to a point. Suppose further that
is separating—that is,
has two path-components; we shall denote their closures by
and
. Because
is not homotopic to a point, the natural inclusions
are injective at the level of
for
. (This follows from the classification of surfaces.) Therefore
by the Seifert–van Kampen Theorem.
HNN extensions
Example 4 explains what happen at the level of
when you cut a surface
along a separating curve. But the separating hypothesis is rather unnatural—it makes just as much sense to cut
along a non-separating curve
. What happens in this case? The answer is that
decomposes as an HNN extension.
Suppose
are both injective homomorphisms. If
has presentation
then the Higman–Neumann–Neumann (HNN) extension is
Example 5
Suppose
is a compact orientable surface and
is a simple closed curve that is not homotopic to a point. Suppose further that
is non-separating, so
has one path-component
, and two-sided (that is,
is not the core of a Möbius band). Then
by the Seifert–van Kampen Theorem.
There are two things to notice about this definition. The first is that, a priori, it seems to depend on the chosen presentation for
—however, one can show that the definition is in fact independent of this choice. More importantly,
is rather poor notation as it does not specify the maps
and
. Often, as in Example 5, the two maps are implicit. One way of getting round this ambiguity is to set
and write
instead of
.
Tricki

Comments
Tensor products are not
Sat, 25/04/2009 - 05:55 — emertonTensor products are not really defined for groups, but rather for modules
-modules, and so tensor products are defined for abelian groups, but this is a construction of a very different flavour
over rings. Abelian groups are
to all the other constructions listed on this page.
Perhaps it would be better to have a comment somewhere on the page to this effect
(i.e. that one can define the tensor product of two abelian groups), and then just
link to the How to use tensor products page for more details.
If there are no objections, I will do this some time soon.
I agree
Sat, 25/04/2009 - 09:28 — JoseBroxYes, I was thinking about the tensor product for abelian groups as a special case of a product construction (in Ring theory it is quite usual to think of everything as modules). Feel free to change it as you say, I added it just as a suggestion (I put it on the list because there really isn't any more on the stub at the moment!)
There could be a link
Mon, 11/05/2009 - 05:11 — emertonThere could be a link somewhere among the later examples to Use topology to study your group, although I haven't thought very carefully about where it would sit best.