Rubik's Cube group

Last updated • 6 min readFrom Wikipedia, The Free Encyclopedia
The manipulations of the Rubik's Cube form the Rubik's Cube group Rubik's cube.svg
The manipulations of the Rubik's Cube form the Rubik's Cube group

The Rubik's Cube group represents the structure of the Rubik's Cube mechanical puzzle. Each element of the set 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 . [1] [2] The group operation is the composition of cube moves, corresponding to the result of performing one cube move after another.

Contents

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 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 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 Rubik's Cube consists of faces, each with colored squares called facelets, for a total of facelets. A solved cube has all of the facelets on each face having the same color.

A cube move rotates one of the faces either or (half-turn metric). [3] A center facelet rotates about its axis but otherwise stays in the same position. [1]

Cube moves are described with the Singmaster notation: [4]

Basic 90°180°-90°
turns the front clockwise turns the front clockwise twice turns the front counter-clockwise
turns the back clockwise turns the back clockwise twice turns the back counter-clockwise
turns the top clockwise turns the top clockwise twice turns the top counter-clockwise
turns the bottom clockwise turns the bottom clockwise twice turns the bottom counter-clockwise
turns the left face clockwise turns the left face clockwise twice turns the left face counter-clockwise
turns the right face clockwise turns the right face clockwise twice turns the right face counter-clockwise

The empty move is . [note 1] The concatenation is the same as , and is the same as .

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 S48 according to how each move permutes the various facelets. The Rubik's Cube group, G, is then defined to be the subgroup of S48 generated by the 6 face rotations, .

The cardinality of G is given by[ citation needed ] 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 [3] (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 [5] ).

The largest order of an element in G is 1260. For example, one such element of order 1260 is

. [1]

G is non-abelian (that is, not all cube moves commute with each other) since, for example, is not the same as . [2] 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 Co 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:

(twist two corners)
(flip two edges).

Second, we take the subgroup 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. [note 2] One choice is the following group, given by generators (the last generator is a 3 cycle on the edges):

Since Co is a normal subgroup and the intersection of Co and Cp 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

Next we can take a closer look at these two groups. The structure of Co is

since the group of rotations of each corner (resp. edge) cube is (resp. ), 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, Cp, is a little more complicated. It has the following two disjoint normal subgroups: the group of even permutations on the corners A8 and the group of even permutations on the edges A12. 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

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

This group can also be described as the subdirect product

,

in the notation of Griess [ citation needed ].

Generalizations

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

(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

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[ citation needed ].)

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

Conjugacy classes

It has been reported that the Rubik's Cube Group has 81,120 conjugacy classes. [6] 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. [7]

Number of conjugacy classes in the Rubik's Cube Group and various subgroups [7]
GroupNo. evenNo. oddNo. psTotal
Corner positions1210222
Edge positions4037377
All positions856
Corners14013010270
Edges30829117599
Whole cube81,120

See also

Notes

  1. Not to be confused with as used in the extended Singmaster Notation, where it represents a quarter-turn of the equator layer (i.e., the central layer between and ), in the same direction as .
  2. One way of defining orientation is as follows, adapted from pages 314–315 of Metamagical Themas by Douglas Hofstadter. Define two notions: the chief color of a block and the chief facet of a position, where a position means the location of a block. The chief facet of a position will be the one on the front or back face of the cube, if that position has such a facet; otherwise it will be the one on the left or right face. There are nine chief facelets on F, nine on B, two on L, and two on R. The chief color of a block is defined as the color that should be on the block's chief facet when the block "comes home" to its proper position in a solved cube. A cube move preserves orientation if, when has been applied to a solved cube, the chief color of every block is on the chief facet of its position.

Related Research Articles

<span class="mw-page-title-main">Rubik's Cube</span> 3D combination puzzle

The Rubik's Cube is a 3D combination puzzle invented in 1974 by Hungarian sculptor and professor of architecture Ernő Rubik. Originally called the Magic Cube, the puzzle was licensed by Rubik to be sold by Pentangle Puzzles in the UK in 1978, and then by Ideal Toy Corp in 1980 via businessman Tibor Laczi and Seven Towns founder Tom Kremer. The cube was released internationally in 1980 and became one of the most recognized icons in popular culture. It won the 1980 German Game of the Year special award for Best Puzzle. As of January 2024, around 500 million cubes had been sold worldwide, making it the world's bestselling puzzle game and bestselling toy. The Rubik's Cube was inducted into the US National Toy Hall of Fame in 2014.

<span class="mw-page-title-main">Symmetry group</span> Group of transformations under which the object is invariant

In group theory, the symmetry group of a geometric object is the group of all transformations under which the object is invariant, endowed with the group operation of composition. Such a transformation is an invertible mapping of the ambient space which takes the object to itself, and which preserves all the relevant structure of the object. A frequent notation for the symmetry group of an object X is G = Sym(X).

<span class="mw-page-title-main">Klein four-group</span> Mathematical abelian group

In mathematics, the Klein four-group is an abelian group with four elements, in which each element is self-inverse and in which composing any two of the three non-identity elements produces the third one. It can be described as the symmetry group of a non-square rectangle, as the group of bitwise exclusive-or operations on two-bit binary values, or more abstractly as , the direct product of two copies of the cyclic group of order 2 by the Fundamental Theorem of Finitely Generated Abelian Groups. It was named Vierergruppe, meaning four-group) by Felix Klein in 1884. It is also called the Klein group, and is often symbolized by the letter or as .

<span class="mw-page-title-main">Semidirect product</span> Operation in group theory

In mathematics, specifically in group theory, the concept of a semidirect product is a generalization of a direct product. It is usually denoted with the symbol . There are two closely related concepts of semidirect product:

<span class="mw-page-title-main">Solvable group</span> Group with subnormal series where all factors are abelian

In mathematics, more specifically in the field of group theory, a solvable group or soluble group is a group that can be constructed from abelian groups using extensions. Equivalently, a solvable group is a group whose derived series terminates in the trivial subgroup.

<span class="mw-page-title-main">Wreath product</span> Topic in group theory

In group theory, the wreath product is a special combination of two groups based on the semidirect product. It is formed by the action of one group on many copies of another group, somewhat analogous to exponentiation. Wreath products are used in the classification of permutation groups and also provide a way of constructing interesting examples of groups.

<span class="mw-page-title-main">Covering space</span> Type of continuous map in topology

In topology, a covering or covering projection is a map between topological spaces that, intuitively, locally acts like a projection of multiple copies of a space onto itself. In particular, coverings are special types of local homeomorphisms. If is a covering, is said to be a covering space or cover of , and is said to be the base of the covering, or simply the base. By abuse of terminology, and may sometimes be called covering spaces as well. Since coverings are local homeomorphisms, a covering space is a special kind of étale space.

In mathematics, the indefinite orthogonal group, O(p, q) is the Lie group of all linear transformations of an n-dimensional real vector space that leave invariant a nondegenerate, symmetric bilinear form of signature (p, q), where n = p + q. It is also called the pseudo-orthogonal group or generalized orthogonal group. The dimension of the group is n(n − 1)/2.

<span class="mw-page-title-main">Optimal solutions for the Rubik's Cube</span>

Optimal solutions for the Rubik's Cube are solutions that are the shortest in some sense. There are two common ways to measure the length of a solution. The first is to count the number of quarter turns. The second is to count the number of outer-layer twists, called "face turns". A move to turn an outer layer two quarter (90°) turns in the same direction would be counted as two moves in the quarter turn metric (QTM), but as one turn in the face metric.

In mathematics, a congruence subgroup of a matrix group with integer entries is a subgroup defined by congruence conditions on the entries. A very simple example is the subgroup of invertible 2 × 2 integer matrices of determinant 1 in which the off-diagonal entries are even. More generally, the notion of congruence subgroup can be defined for arithmetic subgroups of algebraic groups; that is, those for which we have a notion of 'integral structure' and can define reduction maps modulo an integer.

<span class="mw-page-title-main">Pocket Cube</span> 2x2x2 combination puzzle

The Pocket Cube is a 2×2×2 combination puzzle invented in 1970 by American puzzle designer Larry D. Nichols. The cube consists of 8 pieces, which are all corners.

<span class="mw-page-title-main">Frobenius group</span>

In mathematics, a Frobenius group is a transitive permutation group on a finite set, such that no non-trivial element fixes more than one point and some non-trivial element fixes a point. They are named after F. G. Frobenius.

<span class="mw-page-title-main">Dihedral group of order 6</span> Non-commutative group with 6 elements

In mathematics, D3 (sometimes alternatively denoted by D6) is the dihedral group of degree 3 and order 6. It equals the symmetric group S3. It is also the smallest non-abelian group.

<span class="mw-page-title-main">Octahedral symmetry</span> 3D symmetry group

A regular octahedron has 24 rotational symmetries, and 48 symmetries altogether. These include transformations that combine a reflection and a rotation. A cube has the same set of symmetries, since it is the polyhedron that is dual to an octahedron.

SL<sub>2</sub>(<b>R</b>) Group of real 2×2 matrices with unit determinant

In mathematics, the special linear group SL(2, R) or SL2(R) is the group of 2 × 2 real matrices with determinant one:

In mathematics, Out(Fn) is the outer automorphism group of a free group on n generators. These groups are at universal stage in geometric group theory, as they act on the set of presentations with generators of any finitely generated group. Despite geometric analogies with general linear groups and mapping class groups, their complexity is generally regarded as more challenging, which has fueled the development of new techniques in the field.

In group theory, a branch of mathematics, the automorphisms and outer automorphisms of the symmetric groups and alternating groups are both standard examples of these automorphisms, and objects of study in their own right, particularly the exceptional outer automorphism of S6, the symmetric group on 6 elements.

<span class="mw-page-title-main">Morwen Thistlethwaite</span> Mathematician specializing in knot theory

Morwen Bernard Thistlethwaite is a knot theorist and professor of mathematics for the University of Tennessee in Knoxville. He has made important contributions to both knot theory and Rubik's Cube group theory.

The original Rubik's cube was a mechanical 3×3×3 cube puzzle invented in 1974 by the Hungarian sculptor and professor of architecture Ernő Rubik. Extensions of the Rubik's cube have been around for a long time and come in both hardware and software forms. The major extension have been the availability of cubes of larger size and the availability of the more complex cubes with marked centres. The properties of Rubik’s family cubes of any size together with some special attention to software cubes is the main focus of this article. Many properties are mathematical in nature and are functions of the cube size variable.

<span class="mw-page-title-main">Infinity cube</span> Foldable cube made of die

An Infinity cube is a kind of mechanical puzzle toy with mathematical principles. Its shape is similar to a 2×2 Rubik's cube. It can be opened and put back together from different directions, thus creating a visually interesting effect.

References

  1. 1 2 3 Joyner, David (2002). Adventures in group theory: Rubik's Cube, Merlin's machine, and Other Mathematical Toys . Johns Hopkins University Press. ISBN   0-8018-6947-1.
  2. 1 2 Davis, Tom (2006). "Group Theory via Rubik's Cube" (PDF).
  3. 1 2 Rokicki, Tomas; et al. "God's Number is 20".
  4. Singmaster, David (1981). Notes on Rubik's Magic Cube. Penguin Books. ISBN   0-907395-00-7.
  5. God's Number is 26 in the Quarter-Turn Metric
  6. Garron, Lucas (March 8, 2010). "The Permutation Group of the Rubik's Cube" (PDF). Semantic Scholar. S2CID   18785794. Archived from the original (PDF) on February 22, 2019. Retrieved August 1, 2020.
  7. 1 2 brac37 (October 20, 2009). "Conjugacy classes of the cube". Domain of the Cube Forum. Retrieved August 1, 2020.{{cite web}}: CS1 maint: numeric names: authors list (link)