Presentation of a group: Difference between revisions

From Groupprops
m (6 revisions)
No edit summary
Line 36: Line 36:
More generally, the [[deficiency of a presentation]] measures the difference between the number of generators and the number of relators.
More generally, the [[deficiency of a presentation]] measures the difference between the number of generators and the number of relators.


==Related group properties==
==Effect of group operations==


Refer [[:Category: Properties of group presentations]] and [[:Category: Presentation-based group properties]]
We denote the input groups by <math>G_1</math> and <math>G_2</math>, their number of generators by <math>g_1</math> and <math>g_2</math> respectively, and their number of relators by <math>r_1</math> and <math>r_2</math> respectively.


==Relation with other group description rules==
{| class="wikitable" border="1"
! Operation !! Presentation of output in terms of presentations of inputs !! Number of generators of output !! Number of generators and relations of output
|-
| [[external direct product]] <math>G_1 \times G_2</math> || We take the (disjoint) union of the generating sets and the (disjoint) union of the relation sets, and add in relations stating that every generator of <math>G_1</math> commutes with every generator of <math>G_2</math> || <math>g_1 + g_2</math> generators, <math>r_1 + r_2 + g_1g_2</math> relations
|-
| [[external semidirect product]] <math>G_1 \rtimes G_2</math> (<math>G_2</math> acts on <math>G_1</math>) || We take the (disjoint) union of the generating sets and the (disjoint) union of the relation sets, and add in an ''action'' relation for the action of every generator of <math>G_2</math> on every generator of <math>G_1</math>, as well as (in the infinite case) an ''action'' relation for the action of the inverse of every generator of <math>G_2</math> on every element of <math>G_1</math> || <math>g_1 + g_2</math> generators, <math>r_1 + r_2 + 2g_1g_2</math> relations. In the finite case, suffices to have <math>r_1 + r_2 + g_1g_2</math> relations
|-
| [[external wreath product]] <math>G_1 \wr G_2</math>, with the acting group <math>G_2</math> finite of order <math>h</math> || We take the (disjoint) union of the generating sets, the (disjoint) union of the relations, and, for any two (possibly equal) generators of <math>G_1</math> and every element of <math>G_2</math>, a commutativity relation between the first generator for <math>G_1</math> and the conjugate by the element of <math>G_2</math> of the second generator || <math>g_1 + g_2</math> generators, <math>r_1 + r_2 + g_1^2h</math> relations
|-
| [[external free product]] <math>G_1 * G_2</math> || We take the (disjoint) union of the generators, and the (disjoint) union of the relations || <math>g_1 + g_2</math> generators, <math>r_1 + r_2</math> relations
|}


{{fillin}}
==Manipulating presentations==
==Manipulating presentations==



Revision as of 20:55, 14 April 2010

Template:Group description rule

Definition

Symbol-free definition

A presentation of a group is the following data:

  • A set of elements in the group that generate the group (that is, a generating set of the group)
  • A set of words in terms of these elements, that simplify to the identity in the group (that is, a set of relations among the elements) with the property that a word in the generators simplifies to the identity if and only if it can be expressed formally as a product of conjugates of these words and their inverses

Another way of defining a presentation of a group is as follows:

  • A quotient map from a free group to the given group (the images of free generators of the generating set denote generators of the given group).
  • A set of elements in the free group whose normal closure is the kernel of the quotient map. These elements play the role of relations.

Particular cases

Multiplication table presentation

In the multiplication table presentation of a group, we take the generating set as the set of all elements of the group and the set of relations as all the multiplication relations. Clearly, these relations are sufficient to determine the group.

Finite presentation

Further information: finite presentation A finite presentation of a group is a presentation where both the generating set and the set of relations is finite. A group that possesses a finite presentation is termed a finitely presented group.

A related notion is that of recursive presentation and recursively presented group.

Balanced presentation

Further information: balanced presentation

A balanced presentation is one where the number of generators equals the number of relations.

More generally, the deficiency of a presentation measures the difference between the number of generators and the number of relators.

Effect of group operations

We denote the input groups by and , their number of generators by and respectively, and their number of relators by and respectively.

Operation Presentation of output in terms of presentations of inputs Number of generators of output Number of generators and relations of output
external direct product We take the (disjoint) union of the generating sets and the (disjoint) union of the relation sets, and add in relations stating that every generator of commutes with every generator of generators, relations
external semidirect product ( acts on ) We take the (disjoint) union of the generating sets and the (disjoint) union of the relation sets, and add in an action relation for the action of every generator of on every generator of , as well as (in the infinite case) an action relation for the action of the inverse of every generator of on every element of generators, relations. In the finite case, suffices to have relations
external wreath product , with the acting group finite of order We take the (disjoint) union of the generating sets, the (disjoint) union of the relations, and, for any two (possibly equal) generators of and every element of , a commutativity relation between the first generator for and the conjugate by the element of of the second generator generators, relations
external free product We take the (disjoint) union of the generators, and the (disjoint) union of the relations generators, relations

Manipulating presentations

There are various techniques of manipulating presentations of a group to obtain new presentations, and further, to use presentations of a group to obtain presentations of a subgroup.

Study of this notion

Mathematical subject classification

Under the Mathematical subject classification, the study of this notion comes under the class: 20F05

External links

Definition links