Nielsen transformation

In mathematics, especially in the area of abstract algebra known as combinatorial group theory, Nielsen transformations, named after Jakob Nielsen, are certain automorphisms of a free group which are a non-commutative analogue of row reduction and one of the main tools used in studying free groups, . They were introduced in to prove that every subgroup of a free group is free (the Nielsen–Schreier theorem), but are now used in a variety of mathematics, including computational group theory, k-theory, and knot theory. The textbook devotes all of chapter 3 to Nielsen transformations. One of the simplest definitions of a Nielsen transformation is an automorphism of a free group, but this was not their original definition. The following gives a more constructive definition. A Nielsen transformation on a finitely generated free group with ordered basis [ x1, ..., xn ] can be factored into elementary Nielsen transformations of the following sorts: Switch x1 and x2 Cyclically permute x1, x2, ..., xn, to x2, ..., xn, x1. Replace x1 with x1−1 Replace x1 with x1·x2 These transformations are the analogues of the elementary row operations. Transformations of the first two kinds are analogous to row swaps, and cyclic row permutations. Transformations of the third kind correspond to scaling a row by an invertible scalar. Transformations of the fourth kind correspond to row additions. Transformations of the first two types suffice to permute the generators in any order, so the third type may be applied to any of the generators, and the fourth type to any pair of generators. When dealing with groups that are not free, one instead applies these transformations to finite ordered subsets of a group. In this situation, compositions of the elementary transformations are called regular. If one allows removing elements of the subset that are the identity element, then the transformation is called singular. The image under a Nielsen transformation (elementary or not, regular or not) of a generating set of a group G is also a generating set of G.

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related publications (1)

Related concepts (5)

Related lectures (1)

Nielsen Equivalence In Gupta-Sidki Groups

Aglaia Myropolska

For a group G generated by k elements, the Nielsen equivalence classes are defined as orbits of the action of AutF(k), the automorphism group of the free group of rank k, on the set of generating k-tuples of G. Let p >= 3 be prime and G(p) the Gupta-Sidki p-group. We prove that there are infinitely many Nielsen equivalence classes on generating pairs of G(p).

Amer Mathematical Soc2017

Nielsen transformation

Finitely generated group

In algebra, a finitely generated group is a group G that has some finite generating set S so that every element of G can be written as the combination (under the group operation) of finitely many elements of S and of inverses of such elements. By definition, every finite group is finitely generated, since S can be taken to be G itself. Every infinite finitely generated group must be countable but countable groups need not be finitely generated. The additive group of rational numbers Q is an example of a countable group that is not finitely generated.

Word problem for 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.

Visual Intelligence: Machines and Minds

Explores visual intelligence, perception, image classification, and the connection between vision and action in complex systems.