nonabelian group
A group is said to be nonabelian, or noncommutative, ifhas elements which do not commute, that is, if there exist and in the group such that . Equivalently, a group isnonabelian if there exist and in the group such that thecommutator
is not equal to the identity
of the group. Thereexist many natural nonabelian groups, with order as small as .While any group for which the square map is a homomorphism
is abelian
,there exist nonabelian groups of order as small as for which thecube map is a homomorphism.
In the first section we give a way to visualize the group of rotations
of a sphere and prove that it is nonabelian. This should be readableby an undergraduate student in algebra
. In the second section, wediscuss groups admitting a cube map and show that there are smallnonabelian examples. The second section is somewhat more technicalthan the first and will require more facility with group theory,especially working with finitely presented groups and the commutatorcalculus.
1 Concrete examples of nonabelian groups
Although most number systems we use are abelian by design, there existquite natural nonabelian groups. Perhaps the simplest example tovisualize is given by the group of rotations of a sphere.11Thetreatment we give here is informal. For a more formal treatment ofthe group of rotations, consult the entries “Rotationmatrix (http://planetmath.org/RotationMatrix)” and “Dimension
of the specialorthogonal group
(http://planetmath.org/DimensionOfTheSpecialOrthogonalGroup)”. We cancompose two rotations by performing them in sequence
, and we caninvert a rotation by rotating in the opposite direction, so rotationsdo form a group. To follow what rotation does to the sphere, imaginethat inside is suspended a copy of Marshall Hall’s classic text The Theory of Groups. We will keep track of three pieces ofinformation, namely, the directions that the front cover, the spine, andthe bottom of the book face. When the sphere is in the identity position,the front cover faces the reader, the spine faces the left, and thebottom of the book is oriented downward.
In preparation for verifying that the group is not abelian, we definetwo rotations, and . First, let (for “flip”) be therotation which takes the point at the very top of the sphere and movesit forward through an angle of . For example, if we start withthe sphere in the identity position and then perform , the frontcover will face away from the reader, the spine will remain to theleft, and the bottom of the book will be oriented upward. Second, let (for “rotate”) be the rotation which takes the point at thevery top of the sphere and moves it left through an angle of. If we start with the sphere in the identity positionand then perform , the front cover will continue to face thereader, the spine will face downward, and the bottom of the book willbe oriented to the right.
We now verify that the group of rotations is not abelian. If we startwith the sphere in the identity position and perform , that is,first , then , then the front cover will face away from thereader, the spine will face downward, and the bottom will be orientedto the left. On the other hand, if we start with the sphere in theidentity position and perform , then while the front cover willface away from the reader, the spine will face upward, and thebottom will be oriented to the right. So it matters in whichorder we perform and , that is, , proving that thegroup is not abelian.
Since every rotation in three-dimensional Euclidean space can bedecomposed as a finite sequence of reflections and rotations in theEuclidean plane, one might hope that we can find finite nonabeliangroups arising from objects in the plane, and in fact we can. Foreach regular polygon
, there is an associated group, the dihedral group
, which is the group of symmetries
of the polygon
. (Here denotes the number of the sides of the polygon, and gives thenumber of elements of the group of symmetries.) It is generated bytwo elements, (for “flip”) and (for “rotate”). Theseelements can be defined by analogy
with the and above; forfull details, consult the entry “Dihedralgroup (http://planetmath.org/DihedralGroup)”, where flips are labelled instead by (for“mirror”). If (so we are dealing with an actual polygonhere), it is possible to show that . Moreover, every groupwith order , , or , where is a prime, is abelian. Thusthe smallest possible order for a nonabelian group is . But has elements and is nonabelian, so it is thesmallest possible nonabelian group.
2 Small nonabelian groups admitting a cube map
When we say that a group admits , we mean that thefunction defined on the group by the formula is a homomorphism, that is, that is, that for any and inthe group,
If a group admits , then for any and we havethat . Multiplying on the left by and onthe right by yields the identity . Thus all suchgroups are abelian. Moreover, the generalized commutativity andassociativity laws for abelian groups imply that an abelian groupadmits all maps . It is therefore reasonable to wonderwhether the converse holds. In fact it is possible for a nonabeliangroup to admit . The smallest order for such a group is. It is beyond the scope of this entry to prove that is the smallestpossible order, but we will give an explicit example.
Let be the group with presentation
This can be realized concretely as the group of upper-triangularmatrices over with s on the diagonal, but forsimplicity we shall work directly with the presentation.
The first three relators tell us that each generator of the group hasorder . The next two tell us that is central — since itcommutes with the other two generators and commutes with itself, itmust therefore commute with everything. The final relator is perhapsthe most interesting. We can interpret it as the rewrite rule
that is,
“when moves past it turns into .” |
Thus given an element of we can always write it in the normal form, where , and all such elementsare distinct. This proves that the cardinality of is .Moreover, we also observe that
so is not abelian.
It remains to check that admits the cube map. We will prove thesimpler statement that has exponent . Given in , wefirst normalize it, so . Since is in thecenter of ,
To normalize the word , we push each past all of thes. Since pushing past a single turns it into , pushingit past turns it into , that is,
By induction it follows that
Applying this result to , we get that
Since is trivial for any , it follows that admits thecube map.
The other nonabelian group of order has exponent and also admits thecube map. This will be described in an attached entry.