Absolute presentation of a group

Last updated

In mathematics, an absolute presentation is one method of defining a group. [1]

Contents

Recall that to define a group by means of a presentation, one specifies a set of generators so that every element of the group can be written as a product of some of these generators, and a set of relations among those generators. In symbols:

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

Formal definition

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

provided that:

  1. has presentation
  2. Given any homomorphism such that the irrelations are satisfied in , is isomorphic to .

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

2a. If is a non-trivial normal subgroup of then

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.

Example

The cyclic group of order 8 has the presentation

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

and

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

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:

Is not an absolute presentation for the cyclic group of order 8 because the irrelation 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. [1]

A common strategy for considering whether two groups and 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 with finite presentation can be embedded in the algebraically closed group then given another algebraically closed group , we can ask "Can be embedded in ?"

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 , this homomorphism need not be an embedding. What is needed is a specification for that "forces" any homomorphism preserving that specification to be an embedding. An absolute presentation does precisely this.

Related Research Articles

In algebra, a homomorphism is a structure-preserving map between two algebraic structures of the same type. The word homomorphism comes from the Ancient Greek language: ὁμός meaning "same" and μορφή meaning "form" or "shape". However, the word was apparently introduced to mathematics due to a (mis)translation of German ähnlich meaning "similar" to ὁμός meaning "same". The term "homomorphism" appeared as early as 1892, when it was attributed to the German mathematician Felix Klein (1849–1925).

Monoid Algebraic structure with an associative operation and an identity element

In abstract algebra, a branch of mathematics, a monoid is a set equipped with an associative binary operation and an identity element.

In mathematics, profinite groups are topological groups that are in a certain sense assembled from finite groups. They share many properties with their finite quotients: for example, both Lagrange's theorem and the Sylow theorems generalise well to profinite groups.

In mathematics, especially in the area of abstract algebra known as combinatorial group theory, the word problem for a finitely generated group G is the algorithmic problem of deciding whether two words in the generators represent the same element. More precisely, if A is a finite set of generators for G then the word problem is the membership problem for the formal language of all words in A and a formal set of inverses that map to the identity under the natural map from the free monoid with involution on A to the group G. If B is another finite generating set for G, then the word problem over the generating set B is equivalent to the word problem over the generating set A. Thus one can speak unambiguously of the decidability of the word problem for the finitely generated group G.

Semidirect product Operation in group theory

In mathematics, specifically in group theory, the concept of a semidirect product is a generalization of a direct product. There are two closely related concepts of semidirect product:

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

In mathematics, a quotient algebra is the result of partitioning the elements of an algebraic structure using a congruence relation. Quotient algebras are also called factor algebras. Here, the congruence relation must be an equivalence relation that is additionally compatible with all the operations of the algebra, in the formal sense described below. Its equivalence classes partition the elements of the given algebraic structure. The quotient algebra has these classes as its elements, and the compatibility conditions are used to give the classes an algebraic structure.

Cayley graph

In mathematics, a Cayley graph, also known as a Cayley color graph, Cayley diagram, group diagram, or color group is a graph that encodes the abstract structure of a group. Its definition is suggested by Cayley's theorem and uses a specified, set of generators for the group. It is a central tool in combinatorial and geometric group theory.

In mathematics, specifically group theory, the free product is an operation that takes two groups G and H and constructs a new group GH. The result contains both G and H as subgroups, is generated by the elements of these subgroups, and is the “universal” group having these properties, in the sense that any two homomorphisms from G and H into a group K factor uniquely through a homomorphism from GH to K. Unless one of the groups G and H is trivial, the free product is always infinite. The construction of a free product is similar in spirit to the construction of a free group.

In the mathematical area of group theory, Artin groups, also known as Artin–Tits groups or generalized braid groups, are a family of infinite discrete groups defined by simple presentations. They are closely related with Coxeter groups. Examples are free groups, free abelian groups, braid groups, and right-angled Artin–Tits groups, among others.

In mathematics, the HNN extension is an important construction of combinatorial group theory.

Direct product of groups

In mathematics, specifically in group theory, the direct product is an operation that takes two groups G and H and constructs a new group, usually denoted G × H. This operation is the group-theoretic analogue of the Cartesian product of sets and is one of several important notions of direct product in mathematics.

In mathematics, the Burnside ring of a finite group is an algebraic construction that encodes the different ways the group can act on finite sets. The ideas were introduced by William Burnside at the end of the nineteenth century. The algebraic ring structure is a more recent development, due to Solomon (1967).

In mathematics, a Witt group of a field, named after Ernst Witt, is an abelian group whose elements are represented by symmetric bilinear forms over the field.

In group theory, a group is algebraically closed if any finite set of equations and inequations that "make sense" in have a solution in without needing a group extension. This notion will be made precise later in the article in § Formal definition.

In computer science, in the area of formal language theory, frequent use is made of a variety of string functions; however, the notation used is different from that used for computer programming, and some commonly used functions in the theoretical realm are rarely used when programming. This article defines some of these basic terms.

In the mathematical subject of group theory, small cancellation theory studies groups given by group presentations satisfying small cancellation conditions, that is where defining relations have "small overlaps" with each other. Small cancellation conditions imply algebraic, geometric and algorithmic properties of the group. Finitely presented groups satisfying sufficiently strong small cancellation conditions are word hyperbolic and have word problem solvable by Dehn's algorithm. Small cancellation methods are also used for constructing Tarski monsters, and for solutions of Burnside's problem.

In mathematics, the Farrell–Jones conjecture, named after F. Thomas Farrell and Lowell E. Jones, states that certain assembly maps are isomorphisms. These maps are given as certain homomorphisms.

In the mathematical subject of group theory, a one-relator group is a group given by a group presentation with a single defining relation. One-relator groups play an important role in geometric group theory by providing many explicit examples of finitely presented groups.

This is a glossary for the terminology in a mathematical field of functional analysis.

References

  1. 1 2 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.