HOME

TheInfoList



OR:

In mathematics, an absolute presentation is one method of defining a
group A group is a number of persons or things that are located, gathered, or classed together. Groups of people * Cultural group, a group whose members share the same cultural identity * Ethnic group, a group whose members share the same ethnic ide ...
.B. Neumann, ''The isomorphism problem for algebraically closed groups,'' in: Word Problems, Decision Problems, and the Burnside Problem in Group Theory, Amsterdam-London (1973), pp. 553–562. Recall that to define a group G by means of a
presentation A presentation conveys information from a speaker to an audience. Presentations are typically demonstrations, introduction, lecture, or speech meant to inform, persuade, inspire, motivate, build goodwill, or present a new idea/product. Presenta ...
, 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 \simeq \langle S \mid R \rangle. Informally G is the group generated by the set S such that r = 1 for all r \in R. But here there is a
tacit assumption A tacit assumption or implicit assumption is an assumption that underlies a logical argument, course of action, decision, or judgment that is not explicitly voiced nor necessarily understood by the decision maker or judge. These assumptions may b ...
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 A word is a basic element of language that carries an objective or practical meaning, can be used on its own, and is uninterruptible. Despite the fact that language speakers often have an intuitive grasp of what a word is, there is no conse ...
in S should not be equal to 1. That is we specify a set I, called the set of irrelations, such that i \ne 1 for all i \in I.


Formal definition

To define an absolute presentation of a group G one specifies a set S of generators and sets R and I of relations and irrelations among those generators. We then say G has absolute presentation :\langle S \mid R, I\rangle. provided that: # G has
presentation A presentation conveys information from a speaker to an audience. Presentations are typically demonstrations, introduction, lecture, or speech meant to inform, persuade, inspire, motivate, build goodwill, or present a new idea/product. Presenta ...
\langle S \mid R\rangle. # Given any
homomorphism In algebra, a homomorphism is a structure-preserving map between two algebraic structures of the same type (such as two groups, two rings, or two vector spaces). The word ''homomorphism'' comes from the Ancient Greek language: () meaning "same" ...
h:G\rightarrow 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\triangleleft G is a non-trivial normal subgroup of G then I\cap N\neq \left\ . 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, which is an instance of a
retronym A retronym is a newer name for an existing thing that helps differentiate the original form/version from a more recent one. It is thus a word or phrase created to avoid confusion between older and newer types, whereas previously (before there were ...
.


Example

The
cyclic group In group theory, a branch of abstract algebra in pure mathematics, a cyclic group or monogenous group is a group, denoted C''n'', that is generated by a single element. That is, it is a set of invertible elements with a single associative bina ...
of order 8 has the presentation :\langle a \mid a^8 = 1\rangle. But, up to isomorphism there are three more groups that "satisfy" the relation a^8 = 1, namely: :\langle a \mid a^4 = 1\rangle :\langle a \mid a^2 = 1\rangle and :\langle a \mid a = 1\rangle. However none of these satisfy the irrelation a^4 \neq 1. So an absolute presentation for the cyclic group of order 8 is: :\langle a \mid a^8 = 1, a^4 \neq 1\rangle. 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: :\langle a \mid a^8 = 1, a^2 \neq 1\rangle Is ''not'' an absolute presentation for the cyclic group of order 8 because the irrelation a^2 \neq 1 is satisfied in the cyclic group of order 4.


Background

The notion of an absolute presentation arises from
Bernhard Neumann Bernhard Hermann Neumann (15 October 1909 – 21 October 2002) was a German-born British-Australian mathematician, who was a leader in the study of group theory. Early life and education After gaining a D.Phil. from Friedrich-Wilhelms Universit ...
'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=\langle x_1,x_2 \mid R \rangle 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\rightarrow 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

Combinatorial group theory