Manipulating equations in groups
This is a survey article related to:group
View other survey articles about group
This article is about the basic rules of manipulating equations involving groups. It is written mainly for beginners to the subject of group theory.
- 1 A quick review of expressions in groups
- 2 The rules for manipulating equations in groups
- 3 Equations involving subsets
- 4 Notions of conjugate elements
- 5 Using equations to deduce abelianness
- 6 More on manipulating equations
A quick review of expressions in groups
Because of associativity of the group multiplication, we often omit the multiplication symbol. Thus, if is a group with multiplication operation , we often write for the product . For expressions of the form , we simply write . The identity element is denoted here as (it is also sometimes denoted as ).
The rules for manipulating equations in groups
A typical equation in groups has two expressions, with an equality sign between them. We can do the following:
- left multiply by an element: Both sides of the equation are multiplied on the left by the same element. For instance, the equation (for expressions involving elements of the group) can be multiplied on the left by an expression to get .
- right multiply by an element: Both sides of the equation are multiplied on the right by the same element. For instance, the equation (for expressions involving elements of the group) can be multiplied on the right by an expression to get .
- multiply two equations: Two equations are multiplied with each other. We need to decide in advance which of the equations is the left equation and which equation is the right equation. For instance, for expressions , the equations and can be multiplied to give any of the equations but cannot be used to give .
These are the basic operations.
Cancellation of elements
If we have an equation of the form:
we can cancel from the left, to conclude that . The formal justification of this is via left multiplication by . Similarly, if , we can cancel from the right, to conclude that .
However, if we have an equation like:
we cannot cancel . This is because appears on different sides.
Transposing terms to the other side
We can use multiplication by the inverse to transpose a term from one side to another. However, only those terms that are at the left or right end can be transposed. For instance:
Note that these transposing operations are reversible, because we can multiply back by the element to transpose back. Thus, we in fact have:
Transposing the term on the right end looks like this:
However, middle terms cannot be directly transposed; we first need to transpose enough terms to bring them to the edge, before transposing them.
Solving for an element
If an element occurs only once in the equation, then all the remaining elements can be gathered to the other side, so we can solve for that element in terms of the other elements. For instance, if we have the equation:
Then solving it for yields:
Not every equation can be solved for an element
An equation can be solved for an element only if that element occurs only once, on exactly one side of the equation. Given an equation of the form:
we cannot solve in terms of (there's no generic way of extracting a square root). Even worse, given an equation like:
we cannot isolate the powers of on one side.
Bringing everything to one side
Given any equation, we can transform it to the form where all the terms are on a single side. For instance, the equation:
solves to give:
Inverting a product
Further information: inverse map is involutive
This is a special case of the above, but may be useful to remember in isolation:
Equations involving subsets
If are subsets of a group, then we define:
If is a subset and is an element, we define:
and similarly we define . Many of the results we have for manipulating elements, work with subsets. For instance:
The rules for manipulating elements give rules for manipulating subsets. Below, are subsets of a group and is an element of the same group:
- Multiplication of subsets is associative
What's not true
It is not true that is the identity element. To understand this, note that is defined as:
In other words, it may well happen that . In this case, it is not true that is the identity element.
Similarly, we can define as follows:
Then, every element of the form , is in , but may well be strictly bigger.
In particular, we cannot do manipulations of the form:
All we can say is that if is non-empty:
Symmetric subsets are subsets that contain the identity element and are closed under the inverse map. If and are symmetric subsets, then:
Notions of conjugate elements
A useful notion when manipulating equations is that of conjugate elements. Given a group and elements , the conjugate of by is the element The key point is that conjugation is an automorphism, in the sense that:
The significance of this is that it allows us to do some computational manipulations.
Using equations to deduce abelianness
There are situations where we can use equations that are true for a group, to deduce that the group is Abelian. Here are some examples.
Inverse map is homomorphism implies group is abelian
Further information: Inverse map is automorphism iff abelian
For a group , if the map is an automorphism, then is abelian. This is a simple equation-manipulation. If we have:
Then, multiplying by yields:
Now multiplying by yields:
Thus showing that and commute.
Square map is endomorphism implies group is abelian
Further information: Square map is endomorphism iff abelian
If we have:
Then expanding this yields:
We can now cancel the leftmost and rightmost , and get:
Cube map is endomorphism...
Further information: Cube map is endomorphism iff abelian (if order is not a multiple of 3)
The map , the so-called cube map, is an endomorphism only if the group is Abelian, provided the group is finite and its order is not a multiple of 3. This involves a somewhat more tricky argument, that makes use of cancellation, and the fact that if the order is not a multiple of 3, then every element is a cube.
More on manipulating equations
The extent to which we can manipulate systems of equations involving groups is tremendous. In fact, given a group with a system of equations satisfied by some elements, it is in general impossible to determine whether that system of equations forces all elements to be the identity element.
This is related to the notion of a presentation of a group, the question of whether a group has a solvable word problem, and other notions. Usually, many of the apparently unmotivated formal manipulations involving groups actually come from deeper theoretical insights, that are beyond the scope of this survey article.