Samiksha Jaiswal (Editor)

Absolute presentation of a group

Updated on
Edit
Like
Comment
Share on FacebookTweet on TwitterShare on LinkedInShare on Reddit

In mathematics, one method of defining a group is by an absolute presentation.

Contents

Recall that to define a group G   by means of 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. In symbols:

G ≃ ⟨ S ∣ R ⟩ .

Informally G   is the group generated by the set S   such that r = 1   for all r ∈ R . But here there is a tacit assumption that G   is the "freest" such group as clearly the relations are satisfied in any homomorphic image of G   . One way of being able to eliminate this tacit assumption is by specifying that certain words in S   should not be equal to 1. That is we specify a set I   , called the set of irrelations, such that i ≠ 1   for all i ∈ I .

Formal Definition

To define an absolute presentation of a group G   one specifies a set S   of generators, a set R   of relations among those generators and a set I   of irrelations among those generators. We then say G   has absolute presentation

⟨ S ∣ R , I ⟩ .

provided that:

  1. G   has presentation ⟨ S ∣ R ⟩ .
  2. Given any homomorphism h : G → H such that the irrelations I   are satisfied in h ( G )   , G   is isomorphic to h ( G )   .

A more algebraic, but equivalent, way of stating condition 2 is:

2a. if N ◃ G   is a non-trivial normal subgroup of G then I ∩ N ≠ { 1 } .

Remark: The concept of an absolute presentation has been fruitful in fields such as algebraically closed groups and the Grigorchuk topology. In the literature, in a context where absolute presentations are being discussed, a presentation (in the usual sense of the word) is sometimes referred to as a relative presentation. The term seems rather strange as one may well ask "relative to what?" and the only justification seems to be that relative is habitually used as an antonym to absolute.

Example

The cyclic group of order 8 has the presentation

⟨ a ∣ a 8 = 1 ⟩ .

But, up to isomorphism there are three more groups that "satisfy" the relation a 8 = 1 namely:

⟨ a ∣ a 4 = 1 ⟩ ⟨ a ∣ a 2 = 1 ⟩ and ⟨ a ∣ a = 1 ⟩ .

However none of these satisfy the irrelation a 4 ≠ 1 . So an absolute presentation for the cyclic group of order 8 is:

⟨ a ∣ a 8 = 1 , a 4 ≠ 1 ⟩ .

It is part of the definition of an absolute presentation that the irrelations are not satisfied in any proper homomorphic image of the group. Therefore:

⟨ a ∣ a 8 = 1 , a 2 ≠ 1 ⟩

Is not an absolute presentation for the cyclic group of order 8 because the irrelation a 2 ≠ 1 is satisfied in the cyclic group of order 4.

Background

The notion of an absolute presentation arises from Bernhard Neumann's study of the isomorphism problem for algebraically closed groups.

A common strategy for considering whether two groups G and H are isomorphic is to consider whether a presentation for one might be transformed into a presentation for the other. However algebraically closed groups are neither finitely generated nor recursively presented and so it is impossible to compare their presentations. Neumann considered the following alternative strategy:

Suppose we know that a group G with finite presentation G = ⟨ x 1 , x 2 ∣ R ⟩ can be embedded in the algebraically closed group G ∗ then given another algebraically closed group H ∗ , we can ask "Can G be embedded in H ∗ ?"

It soon becomes apparent that a presentation for a group does not contain enough information to make this decision for while there may be a homomorphism h : G → H ∗ , this homomorphism need not be an embedding. What is needed is a specification for G ∗ that "forces" any homomorphism preserving that specification to be an embedding. An absolute presentation does precisely this.

References

Absolute presentation of a group Wikipedia
(Text) CC BY-SA