Word (group theory)

In group theory, a word is any written product of group elements and their inverses. For example, if "x", "y" and "z" are elements of a group "G", then "xy", "z"−1"xzz" and "y"−1"zxx"−1"yz"−1 are words in the set {"x", "y", "z"}. Two different words may evaluate to the same value in "G", or even in every group. Words play an important role in the theory of free groups and presentations, and are central objects of study in combinatorial group theory.
Definition.
Let "G" be a group, and let "S" be a subset of "G". A word in "S" is any expression of the form
where "s"1...,"sn" are elements of "S" and each "εi" is ±1. The number "n" is known as the length of the word.
Each word in "S" represents an element of "G", namely the product of the expression. By convention, the identity (unique) element can be represented by the empty word, which is the unique word of length zero.
Notation.
When writing words, it is common to use exponential notation as an abbreviation. For example, the word
could be written as
This latter expression is not a word itself—it is simply a shorter notation for the original.
When dealing with long words, it can be helpful to use an overline to denote inverses of elements of "S". Using overline notation, the above word would be written as follows:
Words and presentations.
A subset "S" of a group "G" is called a generating set if every element of "G" can be represented by a word in "S". If "S" is a generating set, a relation is a pair of words in "S" that represent the same element of "G". These are usually written as equations, e.g. formula_5
A set formula_6 of relations defines "G" if every relation in "G" follows logically from those in formula_6, using the axioms for a group. A presentation for "G" is a pair formula_8, where "S" is a generating set for "G" and formula_6 is a defining set of relations.
For example, the Klein four-group can be defined by the presentation
Here 1 denotes the empty word, which represents the identity element.
When "S" is not a generating set for "G", the set of elements represented by words in "S" is a subgroup of "G". This is known as the subgroup of "G" generated by "S", and is usually denoted formula_11. It is the smallest subgroup of "G" that contains the elements of "S".
Reduced words.
Any word in which a generator appears next to its own inverse ("xx"−1 or "x"−1"x") can be simplified by omitting the redundant pair:
This operation is known as reduction, and it does not change the group element represented by the word. (Reductions can be thought of as relations that follow from the group axioms.)
A reduced word is a word that contains no redundant pairs. Any word can be simplified to a reduced word by performing a sequence of reductions:
The result does not depend on the order in which the reductions are performed.
If "S" is any set, the free group over "S" is the group with presentation formula_14. That is, the free group over "S" is the group generated by the elements of "S", with no extra relations. Every element of the free group can be written uniquely as a reduced word in "S".
A word is cyclically reduced if and only if every cyclic permutation of the word is reduced.
Normal forms.
A normal form for a group "G" with generating set "S" is a choice of one reduced word in "S" for each element of "G". For example:
Operations on words.
The product of two words is obtained by concatenation:
Even if the two words are reduced, the product may not be.
The inverse of a word is obtained by inverting each generator, and switching the order of the elements:
The product of a word with its inverse can be reduced to the empty word:
You can move a generator from the beginning to the end of a word by conjugation:
The word problem.
Given a presentation formula_19 for a group "G", the word problem is the algorithmic problem of deciding, given as input two words in "S", whether they represent the same element of "G". The word problem is one of three algorithmic problems for groups proposed by Max Dehn in 1911. It was shown by Pyotr Novikov in 1955 that there exists a finitely presented group "G" such that the word problem for "G" is undecidable.