Rubik's Cube group

The Rubik's Cube group $(G, \cdot )$ represents the mathematical structure of the Rubik's Cube mechanical puzzle. Each element of the set $G$ corresponds to a cube move, which is the effect of any sequence of rotations of the cube's faces. With this representation, not only can any cube move be represented, but any position of the cube as well, by detailing the cube moves required to rotate the solved cube into that position. Indeed with the solved position as a starting point, there is a one-to-one correspondence between each of the legal positions of the Rubik's Cube and the elements of $G$. The group operation $\cdot$ is the composition of cube moves, corresponding to the result of performing one cube move after another.

The Rubik's Cube is constructed by labeling each of the 48 non-center facets with the integers 1 to 48. Each configuration of the cube can be represented as a permutation of the labels 1 to 48, depending on the position of each facet. Using this representation, the solved cube is the identity permutation which leaves the cube unchanged, while the twelve cube moves that rotate a layer of the cube 90 degrees are represented by their respective permutations. The Rubik's Cube group is the subgroup of the symmetric group $S_$ generated by the six permutations corresponding to the six clockwise cube moves. With this construction, any configuration of the cube reachable through a sequence of cube moves is within the group. Its operation $\cdot$ refers to the composition of two permutations; within the cube, this refers to combining two sequences of cube moves together, doing one after the other. The Rubik's Cube group is non-abelian as composition of cube moves is not commutative; doing two sequences of cube moves in a different order can result in a different configuration.

Cube moves

A $3 \times 3 \times 3$ Rubik's Cube consists of $6$ ''faces'', each with $9$ colored squares called ''facelets,'' for a total of $54$ facelets. A solved cube has all of the facelets on each face having the same color.

A cube move rotates one of the $6$ faces either $90^\circ , 180^\circ,$ or $-90^\circ$ (half-turn metric). A center facelet rotates about its axis but otherwise stays in the same position.

Cube moves are described with the Singmaster notation:

The empty move is $E$. The concatenation $LLLL$ is the same as $E$, and $RRR$ is the same as $R^\prime$.

Group structure

The following uses the notation described in How to solve the Rubik's Cube. The orientation of the six centre facelets is fixed.

We can identify each of the six face rotations as elements in the symmetric group on the set of non-center facelets. More concretely, we can label the non-center facelets by the numbers 1 through 48, and then identify the six face rotations as elements of the symmetric group ''S''₄₈ according to how each move permutes the various facelets. The Rubik's Cube group, ''G'', is then defined to be the subgroup of ''S''₄₈ generated by the 6 face rotations, $\$.

The cardinality of ''G'' is given by:
:$, G, = 43252003274489856000\,\!$$= \bigl(\bigl( 12! \cdot 8! \bigr) \div 2 \bigr) \cdot \bigl( 2^ \div 2 \bigr) \cdot \bigl( 3^8 \div 3 \bigr)$$= \; 2^ 3^ 5^3 7^2 11$

Despite being this large, God's Number for Rubik's Cube is 20; that is, any position can be solved in 20 or fewer moves (where a half-twist is counted as a single move; if a half-twist is counted as two quarter-twists, then God's number is 26).

The largest order of an element in ''G'' is 1260. For example, one such element of order 1260 is
:$(RU^2D^BD^)$.

''G'' is non-abelian (that is, not all cube moves commute with each other) since, for example, $FR$ is not the same as $RF$. The center of ''G'' consists of only two elements: the identity (i.e. the solved state), and the superflip.

Subgroups

We consider two subgroups of ''G'': First the subgroup ''C''_''o'' of ''cube orientations'', the moves that leave the position of every block fixed, but can change the orientations of blocks. This group is a normal subgroup of ''G''. It can be represented as the normal closure of some moves that flip a few edges or twist a few corners. For example, it is the normal closure of the following two moves:

:$B R^\prime D^2 R B^\prime U^2 B R^\prime D^2 R B^\prime U^2,\,\!$ (twist two corners)
:$R U D B^2 U^2 B^\prime U B U B^2 D^\prime R^\prime U^\prime,\,\!$ (flip two edges).

Second, we take the subgroup $C_P$ of ''cube permutations'', the moves which can change the positions of the blocks, but leave the orientation fixed. For this subgroup there are several choices, depending on the precise way 'orientation' is defined. One choice is the following group, given by generators (the last generator is a 3 cycle on the edges):

:C_p = ^2, D^2, F, B, L^2, R^2, R^2 U^\prime F B^\prime R^2 F^\prime B U^\prime R^2\,\!

Since ''C''_''o'' is a normal subgroup and the intersection of ''C''_''o'' and ''C''_''p'' is the identity and their product is the whole cube group, it follows that the cube group ''G'' is the semi-direct product of these two groups. That is

:$G = C_o \rtimes C_p. \,$

Next we can take a closer look at these two groups. The structure of ''C''_''o'' is

:$\mathbb Z_3^7 \times \mathbb Z_2^,\$

since the group of rotations of each corner (resp. edge) cube is $\mathbb Z_3$ (resp. $\mathbb Z_2$), and in each case all but one may be rotated freely, but these rotations determine the orientation of the last one. Noticing that there are 8 corners and 12 edges, and that all the rotation groups are abelian, gives the above structure.

Cube permutations, ''C_p'', is a little more complicated. It has the following two disjoint normal subgroups: the group of even permutations on the corners ''A''₈ and the group of even permutations on the edges ''A''₁₂. Complementary to these two subgroups is a permutation that swaps two corners and swaps two edges. It turns out that these generate all possible permutations, which means

:$C_p = (A_8 \times A_)\, \rtimes \mathbb Z_2.$

Putting all the pieces together we get that the cube group is isomorphic to

:$(\mathbb Z_3^7 \times \mathbb Z_2^) \rtimes \,((A_8 \times A_) \rtimes \mathbb Z_2).$

This group can also be described as the subdirect product
: \mathbb Z_3^7 \rtimes \mathrm S_8) \times (\mathbb Z_2^ \rtimes \mathrm_)\frac,
in the notation of Griess.

Generalizations

When the centre facet symmetries are taken into account, the symmetry group is a subgroup of

: mathbb Z_4^6 \times (\mathbb Z_3^7 \rtimes \mathrm S_8) \times (\mathbb Z_2^ \rtimes \mathrm S_)\frac.

''(This unimportance of centre facet rotations is an implicit example of a quotient group at work, shielding the reader from the full automorphism group of the object in question.)''

The symmetry group of the Rubik's Cube obtained by disassembling and reassembling it is slightly larger: namely it is the direct product

: $\mathbb Z_4^6 \times (\mathbb Z_3 \wr \mathrm S_8) \times (\mathbb Z_2\wr \mathrm S_).$

The first factor is accounted for solely by rotations of the centre pieces, the second solely by symmetries of the corners, and the third solely by symmetries of the edges. The latter two factors are examples of generalized symmetric groups, which are themselves examples of wreath products. (There is no factor for re-arrangements of the center faces, because on virtually all Rubik's Cube models, re-arranging these faces is impossible with a simple disassembly.)

The simple groups that occur as quotients in the composition series of the standard cube group (i.e. ignoring centre piece rotations) are $A_8$, $A_$, $\mathbb Z_3$ (7 times), and $\mathbb Z_2$ (12 times).

Conjugacy classes

It has been reported that the Rubik's Cube Group has 81,120 conjugacy classes. The number was calculated by counting the number of even and odd conjugacy classes in the edge and corner groups separately and then multiplying them, ensuring that the total parity is always even. Special care must be taken to count so-called ''parity-sensitive'' conjugacy classes, whose elements always differ when conjugated with any even element versus any odd element.

See also

*Commutator
*Conjugacy class
*Coset
* Optimal solutions for Rubik's Cube
*Solvable group
* Thistlethwaite's algorithm

Notes

References

{{Rubik's Cube

Finite groups
Permutation groups
Rubik's Cube