ENCYCLOPEDIA 4U .com

 Web Encyclopedia4u.com

# Presentation of a group

In mathematics, one method of defining a group is with a presentation. One specifies a set S of generators so that every element of the group can be written as a product of some of these generators, and a set T of relations among those generators. We then say G has presentation (S;T).

Every group has a presentation, and in fact many; a presentation is often the most compact way of describing the structure of the group.

Formally, the group is then specified as being isomorphic to a quotient group of a free group, where the free group is given by S and the quotient group is specified by the relations T.

### Background

A free group on a set S = {si} is a group where each element can be uniquely described as a finite length product of the form:

x1a1 x2a2 ... xnan

where each xi is a member of S, and xixi+1 for any i; and each ai is any non-zero integer.

If G is any group, and S is a generating subset of G, then every element of G is also of the above form; but in general, these products will not uniquely describe an element of G.

For example, the dihedral group D8 can be generated by a rotation, '\'r, of order 4; and a flip, f, of order 2; and certainly any element of D8 is a product of r 's and f'' 's.

However, we have, for example, r f r = f, r3 = r -1, etc.; so such products are not unique in D8. Each such product equivalence can be expressed as an equality to the identity; such as

r f r f = 1
r 4 = 1
f 2 = 1

Informally, we can consider these products on the left hand side as being elements of the free group F = F({r,f}), and can consider the subgroup H of F which is generated by these strings; each of which would also be equivalent to 1 when considered as products in D8.

If we then let K be the subgroup of F generated by all conjugates x -1 H x of H, then K is a normal subgroup of F; and each element of K, when considered as a product in D8, will also evaluate to 1.

This leads us to consider the quotient group F/K, and the associated homomorphism U | FF/K, with K = Ker(U). Then D8 is isomorphic to F/K; and we write D8 has presentation ({r,f}; {r4, f2, (rf)2}).

### Formal definition

More formally, let S be a set, and T be a set of words in letters of S such that each t in T is of the form:

x1a1 x2a2 ... xnan

where each xi is a member of S, and xixi+1 for any i; and each ai is any non-zero integer.

Then if F is freely generated by S, there is an obvious function f | TF. Let TF be the (normal) subgroup of F generated by all conjugates of f(T) in F; then if G = F/TF, we say that G has representation (S;T), or equivalently, that G is generated by S with relations T.

### Examples

If G is freely generated by S, then G has presentation (S; {}).

For any natural number n, the cyclic group Cn has presentation ({x}; {xn}).

If D2n is the dihedral group with 2n elements, then it has presentation ({x,y}; {xn, y2, (xy)2}).

The symmetric group S4 has presentation ({x,y}; {x3, y4, (xy)2}).

### Some theorems

Every group G has a presentation, in fact infinitely many.

If G has presentation (S;T) and S and T are finite, then G has finite presentation.

Every finite group has a finite presentation.

The negative solution to the word problem for groups states that there is no general algorithm which, for a given presentation (S;T) and two words u, v, decides whether u and v describe the same element in the group.

Group Theory, W. R. Scott, Dover Publications

Content on this web site is provided for informational purposes only. We accept no responsibility for any loss, injury or inconvenience sustained by any person resulting from information published on this site. We encourage you to verify any critical information with the relevant authorities.