English

Noun

1. An expression of the identity element of a group as a product of generators, used in the presentation of the group.

Related terms

• relation

Anagrams

• realtor

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

\langle S \mid R\rangle.

Informally, G has the above presentation if it is the "freest 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

\langle a \mid a^n = e\rangle.

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

\langle a \mid a^n\rangle,

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.

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:

s_1^ s_2^ \ldots s_n^

where each si is an element of S, and si ≠ si+1 for any i; and each ai is any non-zero integer. 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 D8 can be generated by a rotation, r, of order 8; 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, r7 = 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 8 = 1

f 2 = 1

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 D8.

If we then let N be the subgroup of F generated by all conjugates x−1 R x of R, then N is a normal subgroup of F; and each element of N, when considered as a product in D8, will also evaluate to 1. Thus D8 is isomorphic to the quotient group F/N. We then say that D8 has presentation

\langle r, f \mid r^8 = f^2 = (rf)^2 = 1\rangle.

Formal definition

Let S be a set and let be the free group on S. Let R be a set of words on S, so R naturally gives a subset of . To form a group with presentation the idea is take the smallest quotient of so that each element of R gets identified with the identity element. Note that R may not be a subgroup, let alone a normal subgroup of , so we cannot take a naive quotient by R. The solution is to take the normal closure N of R in , which is defined as the smallest normal subgroup in which contains R. The group is then defined as the quotient group

\langle S \mid R \rangle = \langle S \rangle / N.

The elements of S are called the generators of and the elements of R are called the relators. A group G is said to have the presentation if G is isomorphic to .

It is a common practice to write relators in the form x = y where x and y are words on S. What this means is that y^x \in R. This has the intuitive meaning that the images of x and y are supposed to be equal in the quotient group. Thus e.g. r^n in the list of relators is equivalent with r^n=1. Another common shorthand is to write [x,y] for a commutator xyx^y^.

A presentation is said to be finitely generated if S is finite and finitely related if R is finite. If both are finite it is said to be a finite presentation. A group is finitely generated (respectively finitely related, finitely presented) if it has a presentation that is finitely generated (respectively finitely related, a finite presentation).

If S is indexed by a set I consisting of all the natural numbers \mathbb or a finite subset of them, then it is easy to set up a simple one to one coding (or Gödel numbering) f:\langle S\rangle\rightarrow\mathbb from the free group on S to the natural numbers, such that we can find algorithms that, given f(w), calculate w, and vice versa. We can then call a subset U of \ recursive (respectively recursively enumerable) if f(U) is recursive (respectively recursively enumerable). If S is indexed as above and R recursively enumerable, then the presentation is a recursive presentation and the corresponding group is recursively presented. This usage may seem odd, but it is possible to prove that if a group has a presentation with R recursively enumerable then it has another one with R recursive.

For a finite group G, the multiplication table provides a presentation. We take S to be the elements g_i of G and R to be all words of the form g_ig_jg_k^, where g_ig_j=g_k\ is an entry in the multiplication table. A presentation can then be thought of as a generalization of a multiplication table.

Every finitely presented group is recursively presented, but there are recursively presented groups that cannot be finitely presented. However a remarkable theorem of Graham Higman states that a finitely generated group has a recursive presentation if and only if it can be embedded in a finitely presented group. From this we can deduce that there are (up to isomorphism) only countably many finitely generated recursively presented groups. Bernhard Neumann has shown that there are uncountably many non-isomorphic two generator groups. Therefore there are finitely generated groups that cannot be recursively presented.

Examples

The following table lists some examples of presentations for commonly studied groups. Note that in each case there are many other presentations that are possible. The presentation listed is not necessarily the most efficient one possible.

Some theorems

Every group G has a presentation. To see this consider the free group on G. Since G clearly generates itself one should be able to obtain it by a quotient of . Indeed, by the universal property of free groups there exists a unique group homomorphism φ : → G which covers the identity map. Let K be the kernel of this homomorphism. Then G clearly has the presentation . Note that this presentation is highly inefficient as both G and K are much larger than necessary.

Every finite group has a finite presentation.

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

Free product

If G has presentation and H has presentation with S and T being disjoint then the free product G * H has presentation .

Direct product

If G has presentation and H has presentation with S and T being disjoint then the direct product of G and H has presentation . Here [S,T] means that every element from S commutes with every element from T.

See also

• Cayley graph

References

• Presentations of Groups Schreier's method, Nielsen's method, free presentations, subgroups and HNN extensions, Golod-Shafarevich theorem, etc.

• Generators and Relations for Discrete Groups This useful reference has tables of presentations of all small finite groups, the reflection groups, and so forth.

anecdotist, fableist, fabler, fabulist, fictionist, mythmaker, mythopoet, narrator, novelettist, novelist, raconteur, reciter, recounter, romancer, romancist, sagaman, short-story writer, spinner of yarns, storier, storyteller, taleteller, teller of tales, word painter, yarn spinner