Presentation of a group

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^{a_1} s_2^{a_2} \cdots s_n^{a_n} 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 an adjacent occurrence of 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 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 D8 is a product of rs and fs. However, we have, for example, , , etc., so such products are not unique in D8. Each such product equivalence can be expressed as an equality to the identity, such as : , : , or : . Informally, we can consider these products on the left hand side as being elements of the free group , and let . That is, we let R be the subgroup generated by the strings rfrf, r8, f2, each of which is also equivalent to 1 when considered as products in D8. If we then let N be the subgroup of F generated by all conjugates x−1Rx of R, then it follows by definition that every element of N is a finite product x1−1r1x1 ... xm−1rm xm of members of such conjugates. It follows that each element of N, when considered as a product in D8, will also evaluate to 1; and thus that N is a normal subgroup of F. Thus D8 is isomorphic to the quotient group . We then say that D8 has presentation : \langle r, f \mid r^8 = 1, f^2 = 1, (rf)^2 = 1\rangle. Here the set of generators is , and the set of relations is {{math|1=R = {r 8 = 1, f 2 = 1, (rf )2 = 1} }}. We often see R abbreviated, giving the presentation : \langle r, f \mid r^8 = f^2 = (rf)^2 = 1\rangle. An even shorter form drops the equality and identity signs, to list just the set of relators, which is {{math|1= {r 8, f 2, (rf )2} }}. Doing this gives the presentation : \langle r, f \mid r^8, f^2, (rf)^2 \rangle. All three presentations are equivalent. == Notation ==

Although the notation used in this article for a presentation is now the most common, earlier writers used different variations on the same format. Such notations include the following: • • • • == Definition ==

Let S be a set and let FS be the free group on S. Let R be a set of words on S, so R naturally gives a subset of F_S. To form a group with presentation \langle S \mid R\rangle, take the quotient of F_S by the smallest normal subgroup that contains each element of R. (This subgroup is called the normal closure N of R in F_S.) The group \langle S \mid R\rangle is then defined as the quotient group :\langle S \mid R \rangle = F_S / N. The elements of S are called the generators of \langle S \mid R\rangle and the elements of R are called the relators. A group G is said to have the presentation \langle S \mid R\rangle if G is isomorphic to \langle S \mid R\rangle. 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^{-1}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, for example, rn in the list of relators is equivalent with r^n=1. For a finite group G, it is possible to build a presentation of G from the group multiplication table, as follows. Take S to be the set elements g_i of G and R to be all words of the form g_ig_jg_k^{-1}, where g_ig_j=g_k is an entry in the multiplication table. Alternate definition The definition of group presentation may alternatively be recast in terms of equivalence classes of words on the alphabet S \cup S^{-1}. In this perspective, we declare two words to be equivalent if it is possible to get from one to the other by a sequence of moves, where each move consists of adding or removing a consecutive pair x x^{-1} or x^{-1} x for some in , or by adding or removing a consecutive copy of a relator. The group elements are the equivalence classes, and the group operation is concatenation. This point of view is particularly common in the field of combinatorial group theory. == Finitely presented groups ==

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, ') if it has a presentation that is finitely generated (respectively finitely related, a finite presentation). A group which has a finite presentation with a single relation is called a one-relator group'. == Recursively presented groups ==

If S is indexed by a set I consisting of all the natural numbers N or a finite subset of them, then it is easy to set up a simple one to one coding (or Gödel numbering) 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 FS 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. Every finitely presented group is recursively presented, but there are recursively presented groups that cannot be finitely presented. However a 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. == History ==

One of the earliest presentations of a group by generators and relations was given by the Irish mathematician William Rowan Hamilton in 1856, in his icosian calculus – a presentation of the icosahedral group. The first systematic study was given by Walther von Dyck, student of Felix Klein, in the early 1880s, laying the foundations for combinatorial group theory. == 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. An example of a finitely generated group that is not finitely presented is the wreath product \mathbf{Z} \wr \mathbf{Z} of the group of integers with itself. == Some theorems ==

Theorem. Every group has a presentation. To see this, given a group G, consider the free group FG on G. By the universal property of free groups, there exists a unique group homomorphism whose restriction to G is the identity map. Let K be the kernel of this homomorphism. Then K is normal in FG, therefore is equal to its normal closure, so . Since the identity map is surjective, φ is also surjective, so by the First Isomorphism Theorem, . This presentation may be highly inefficient if both G and K are much larger than necessary. Corollary. Every finite group has a finite presentation. One may take the elements of the group for generators and the Cayley table for relations. Novikov–Boone theorem 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. This was shown by Pyotr Novikov in 1955 and a different proof was obtained by William Boone in 1958. == Constructions ==

Suppose G has presentation and H has presentation with S and T being disjoint. Then • the free product has presentation ; • the direct product has presentation , where [S, T] means that every element from S commutes with every element from T (cf. commutator); and • the semidirect product has presentation {{math|⟨S, T R, Q, {t s t−1 φt(s)−1 s in S, t in T}⟩}}. == Deficiency ==

The deficiency of a finite presentation is just and the deficiency of a finitely presented group G, denoted def(G), is the maximum of the deficiency over all presentations of G. The deficiency of a finite group is non-positive. The Schur multiplicator of a finite group G can be generated by −def(G) generators, and G is efficient if this number is required. == Geometric group theory ==

A presentation of a group determines a geometry, in the sense of geometric group theory: one has the Cayley graph, which has a metric, called the word metric. These are also two resulting orders, the weak order and the Bruhat order, and corresponding Hasse diagrams. An important example is in the Coxeter groups. Further, some properties of this graph (the coarse geometry) are intrinsic, meaning independent of choice of generators. == See also ==