Presentation of a group

related topics
{math, number, function}
{group, member, jewish}

In mathematics, one method of defining a group is by 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 R of relations among those generators. We then say G has presentation

Informally, G has the above presentation if it is the "free-est group" generated by S subject only to the relations R. Formally, the group G is said to have the above presentation if it is isomorphic to the quotient of a free group on S by the normal subgroup generated by the relations R.

As a simple example, the cyclic group of order n has the presentation

where e is the group identity. This may be written equivalently as

since terms that don't include an equals sign are taken to be equal to the group identity. Such terms are called relators, distinguishing them from the relations that include an equals sign.

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

A closely related but different concept is that of an absolute presentation of a group.

Contents

Background

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

where the si are elements of S, adjacent si are distinct, and ai are non-zero integers (but n may be zero). In less formal terms, the group consists of words in the generators and their inverses, subject only to canceling a generator with its inverse.

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 D of order sixteen can be generated by a rotation, r, of order 8; and a flip, f, of order 2; and certainly any element of D is a product of r 's and f 's.

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

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

Full article ▸

related documents
Pushdown automaton
Axiom schema of replacement
Heine–Borel theorem
Euclidean algorithm
Glossary of topology
Binary relation
Factorization
Linear independence
Abstract interpretation
Type theory
E (mathematical constant)
Random variable
Algebraic structure
Linear combination
Probability density function
Ideal class group
IEEE 754-1985
Elliptic curve
Sequence
Gaussian quadrature
Homology (mathematics)
Natural transformation
Dijkstra's algorithm
Goldbach's conjecture
Fuzzy logic
Galois theory
Euler characteristic
Breadth-first search
Wiener process
Absolute convergence