Presentation of a group

Presentation of a group

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 angle.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 angle.where e is the group identity. This may be written equivalently as:langle a mid a^n angle,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^{a_1} s_2^{a_2} ldots s_n^{a_n}

where each "s""i" is an element of S, and "s""i" ≠ "s""i"+1 for any "i"; and each "a""i" 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 "D"8 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, "r f r" = "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

:"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 "D"8.

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 "D"8, will also evaluate to 1. Thus "D"8 is isomorphic to the quotient group "F" /"N". We then say that "D"8 has presentation:langle r, f mid r^8 = f^2 = (rf)^2 = 1 angle.

Formal definition

Let "S" be a set and let <"S"> be the free group on "S". Let "R" be a set of words on "S", so "R" naturally gives a subset of <"S">. To form a group with presentation <"S"|"R"> the idea is take the smallest quotient of <"S"> 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 <"S">, so we cannot take a naive quotient by "R". The solution is to take the normal closure "N" of "R" in <"S">, which is defined as the smallest normal subgroup in <"S"> which contains "R". The group <"S"|"R"> is then defined as the quotient group:langle S mid R angle = langle S angle / N.The elements of "S" are called the generators of <"S"|"R"> and the elements of "R" are called the relators. A group "G" is said to have the presentation <"S"|"R"> if "G" is isomorphic to <"S"|"R">.

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 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^{-1}y^{-1}.

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{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:langle S angle ightarrowmathbb{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 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^{-1}, 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 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 <"G"> on "G". Since "G" clearly generates itself one should be able to obtain it by a quotient of <"G">. Indeed, by the universal property of free groups there exists a unique group homomorphism &phi; : <"G"> &rarr; "G" which covers the identity map. Let "K" be the kernel of this homomorphism. Then "G" clearly has the presentation <"G"|"K">. 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 <"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.

Free product

If "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">.

Direct product

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

See also

* Cayley graph
* Nielsen transformation
* Tietze transformation
* Schur multiplier

References

*cite book | author=Johnson, D. L. | title=Presentations of Groups | location=Cambridge | publisher=Cambridge University Press | year=1990 | id=ISBN 0-521-37824-9 Schreier's method, Nielsen's method, free presentations, subgroups and HNN extensions, Golod-Shafarevich theorem, etc.

*cite book | author=Coxeter, H. S. M. and Moser, W. O. J. | title=Generators and Relations for Discrete Groups | location=New York | publisher=Springer-Verlag | year=1980 | id=ISBN 0-387-09212-9 This useful reference has tables of presentations of all small finite groups, the reflection groups, and so forth.


Wikimedia Foundation. 2010.

Игры ⚽ Поможем решить контрольную работу

Look at other dictionaries:

  • Absolute presentation of a group — In mathematics, one method of defining a group is by an absolute presentation.B. Neumann, The isomorphism problem for algebraically closed groups, in: Word Problems, Decision Problems, and the Burnside Problem in Group Theory, Amsterdam London… …   Wikipedia

  • Group theory — is a mathematical discipline, the part of abstract algebra that studies the algebraic structures known as groups. The development of group theory sprang from three main sources: number theory, theory of algebraic equations, and geometry. The… …   Wikipedia

  • Presentation (disambiguation) — Presentation is the process of presenting the content of a topic to an audience.Presentation may also refer to: * Presentation program, computer software used to make presentations, such as Microsoft PowerPoint *Corel Presentations, a slideshow,… …   Wikipedia

  • Presentation complex — In geometric group theory, a presentation complex is a 2 dimensional cell complex associated to any presentation of a group G . The complex has a single vertex, and one loop at the vertex for each generator of G . There is one 2 cell for each… …   Wikipedia

  • Group (mathematics) — This article covers basic notions. For advanced topics, see Group theory. The possible manipulations of this Rubik s Cube form a group. In mathematics, a group is an algebraic structure consisting of a set together with an operation that combines …   Wikipedia

  • Presentation College, San Fernando — Presentation College is a selective, government assisted Roman Catholic secondary school located in San Fernando, Trinidad and Tobago. It claims to be the first Catholic secondary school in South Trinidad, having been established circa 1930 in… …   Wikipedia

  • Presentation d'un groupe — Présentation d un groupe En théorie des groupes, un groupe peut se définir par sa présentation autrement dit la donnée d un ensemble de générateurs et de relations que ceux ci doivent vérifier. La possibilité de cette définition découle de ce que …   Wikipédia en Français

  • Group f/64 — was a group of famous San Francisco photographers who espoused a common philosophy and photographic style. The group was created in 1932, and it is usually listed as including: * Ansel Adams+ * Imogen Cunningham+ * John Paul Edwards+ * Consuelo… …   Wikipedia

  • Présentation d'un groupe — En théorie des groupes, un groupe peut se définir par une présentation autrement dit la donnée d un ensemble de générateurs et d un ensemble de relations que ceux ci vérifient. La possibilité d une telle définition découle de ce que tout groupe… …   Wikipédia en Français

  • Presentation Brothers College, Cork — For other schools of the same name, see Presentation College (disambiguation). PBC Cork Viriliter Age (Act Manly) Location Mardyke, Cor …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”