In mathematics, a presentation is one method of specifying a group. A presentation of a group G comprises a set S of generators—so that every element of the group can be written as a product of powers 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 "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
where 1 is the group identity. This may be written equivalently as
thanks to the convention that terms that do not include an equals sign are taken to be equal to the group identity. Such terms are called relators, distinguishing them from the relations that do 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:
where the s_{i} are elements of S, adjacent s_{i} are distinct, and a_{i} are nonzero 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 D_{8} 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_{8} is a product of r's and f's.
However, we have, for example, rfr = f, r^{7} = r^{−1}, etc., so such products are not unique in D_{8}. Each such product equivalence can be expressed as an equality to the identity, such as
 rfrf = 1,
 r^{8} = 1, or
 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 D_{8}.
If we then let N be the subgroup of F generated by all conjugates x^{−1}Rx of R, then it follows by definition that every element of N is a finite product x_{1}^{−1}r_{1}x_{1} ... x_{m}^{−1}r_{m} x_{m} of members of such conjugates. It follows that each element of N, when considered as a product in D_{8}, will also evaluate to 1; and thus that N is a normal subgroup of F. Thus D_{8} is isomorphic to the quotient group F/N. We then say that D_{8} has presentation
Here the set of generators is S = {r, f }, and the set of relations is R = {r ^{8} = 1, f ^{2} = 1, (rf )^{2} = 1}. We often see R abbreviated, giving the presentation
An even shorter form drops the equality and identity signs, to list just the set of relators, which is {r ^{8}, f ^{2}, (rf )^{2}}. Doing this gives the presentation
All three presentations are equivalent.
Notation
Although the notation ⟨S  R⟩ 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:^{[citation needed]}
 ⟨S  R⟩
 (S  R)
 {S; R}
 ⟨S; R⟩
Definition
Let S be a set and let F_{S} 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 , take the quotient of by the smallest normal subgroup that contains each element of R. (This subgroup is called the normal closure N of R in .) The group is then defined as the quotient group
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 .^{[1]}
It is a common practice to write relators in the form where x and y are words on S. What this means is that . This has the intuitive meaning that the images of x and y are supposed to be equal in the quotient group. Thus, for example, r^{n} in the list of relators is equivalent with .^{[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 of G and R to be all words of the form , where 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 . 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 or for some x in S, or by adding or removing a consecutive copy of a relator. The group elements are the equivalence classes, and the group operation is concatenation.^{[1]}
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, finitely presented) 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 onerelator 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) f : F_{S} → N 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 F_{S} 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 nonisomorphic 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.^{[2]} 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.^{[3]}
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.
Group  Presentation  Comments 

the free group on S  A free group is "free" in the sense that it is subject to no relations.  
C_{n}, the cyclic group of order n  
D_{n}, the dihedral group of order 2n  Here r represents a rotation and f a reflection  
D_{∞}, the infinite dihedral group  
Dic_{n}, the dicyclic group  The quaternion group Q_{8} is a special case when n = 2  
Z × Z  
Z/mZ × Z/nZ  
the free abelian group on S  where R is the set of all commutators of elements of S  
S_{n}, the symmetric group on n symbols  generators: relations:
The last set of relations can be transformed into using . 
Here σ_{i} is the permutation that swaps the ith element with the i+1st one. The product σ_{i}σ_{i+1} is a 3cycle on the set {i, i+1, i+2}. 
B_{n}, the braid groups  generators: relations:

Note the similarity with the symmetric group; the only difference is the removal of the relation . 
T ≅ A_{4}, the tetrahedral group  
O ≅ S_{4}, the octahedral group  
I ≅ A_{5}, the icosahedral group  
Q_{8}, the quaternion group  For an alternative presentation see Dic_{n} above with n=2.  
SL(2, Z)  topologically a and b can be visualized as Dehn twists on the torus  
GL(2, Z)  nontrivial Z/2Z – group extension of SL(2, Z)  
PSL(2, Z), the modular group  PSL(2, Z) is the free product of the cyclic groups Z/2Z and Z/3Z  
Heisenberg group  
BS(m, n), the Baumslag–Solitar groups  
Tits group  [a, b] is the commutator 
An example of a finitely generated group that is not finitely presented is the wreath product 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 F_{G} on G. By the universal property of free groups, there exists a unique group homomorphism φ : F_{G} → G whose restriction to G is the identity map. Let K be the kernel of this homomorphism. Then K is normal in F_{G}, therefore is equal to its normal closure, so ⟨G  K⟩ = F_{G}/K. Since the identity map is surjective, φ is also surjective, so by the First Isomorphism Theorem, ⟨G  K⟩ ��� im(φ) = G. 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 ⟨S  R⟩ 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^{[4]} and a different proof was obtained by William Boone in 1958.^{[5]}
Constructions
Suppose G has presentation ⟨S  R⟩ and H has presentation ⟨T  Q⟩ with S and T being disjoint. Then
 the free product G ∗ H has presentation ⟨S, T  R, Q⟩ and
 the direct product G × H has presentation ⟨S, T  R, Q, [S, T]⟩, where [S, T] means that every element from S commutes with every element from T (cf. commutator).
Deficiency
The deficiency of a finite presentation ⟨S  R⟩ is just S − R 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 nonpositive. The Schur multiplicator of a finite group G can be generated by −def(G) generators, and G is efficient if this number is required.^{[6]}
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
Notes
 ^ ^{a} ^{b} ^{c} Peifer, David (1997). "An Introduction to Combinatorial Group Theory and the Word Problem". Mathematics Magazine. 70 (1): 3–10. doi:10.1080/0025570X.1997.11996491.
 ^ Sir William Rowan Hamilton (1856). "Memorandum respecting a new System of Roots of Unity" (PDF). Philosophical Magazine. 12: 446.
 ^ Stillwell, John (2002). Mathematics and its history. Springer. p. 374. ISBN 9780387953366.
 ^ Novikov, Pyotr S. (1955), "On the algorithmic unsolvability of the word problem in group theory", Proceedings of the Steklov Institute of Mathematics (in Russian), 44: 1–143, Zbl 0068.01301
 ^ Boone, William W. (1958), "The word problem" (PDF), Proceedings of the National Academy of Sciences, 44 (10): 1061–1065, doi:10.1073/pnas.44.10.1061, PMC 528693, PMID 16590307, Zbl 0086.24701
 ^ Johnson, D.L.; Robertson, E.L. (1979). "Finite groups of deficiency zero". In Wall, C.T.C. (ed.). Homological Group Theory. London Mathematical Society Lecture Note Series. 36. Cambridge University Press. pp. 275–289. ISBN 0521227291. Zbl 0423.20029.
References
 Coxeter, H. S. M.; Moser, W. O. J. (1980). Generators and Relations for Discrete Groups. New York: SpringerVerlag. ISBN 0387092129. ― This useful reference has tables of presentations of all small finite groups, the reflection groups, and so forth.
 Johnson, D. L. (1997). Presentations of Groups (2nd ed.). Cambridge: Cambridge University Press. ISBN 0521585422. ― Schreier's method, Nielsen's method, free presentations, subgroups and HNN extensions, Golod–Shafarevich theorem, etc.
 Sims, Charles C. (1994). Computation with Finitely Presented Groups (1st ed.). Cambridge: Cambridge University Press. ISBN 9780521135078. ― fundamental algorithms from theoretical computer science, computational number theory, and computational commutative algebra, etc.