Symmetric group in the context of Permutation


Symmetric group in the context of Permutation

Symmetric group Study page number 1 of 1

Play TriviaQuestions Online!

or

Skip to study material about Symmetric group in the context of "Permutation"


⭐ Core Definition: Symmetric group

In abstract algebra, the symmetric group defined over any set is the group whose elements are all the bijections from the set to itself, and whose group operation is the composition of functions. In particular, the finite symmetric group defined over a finite set of symbols consists of the permutations that can be performed on the symbols. Since there are ( factorial) such permutation operations, the order (number of elements) of the symmetric group is .

Although symmetric groups can be defined on infinite sets, this article focuses on the finite symmetric groups: their applications, their elements, their conjugacy classes, a finite presentation, their subgroups, their automorphism groups, and their representation theory. For the remainder of this article, "symmetric group" will mean a symmetric group on a finite set.

↓ Menu
HINT:

In this Dossier

Symmetric group in the context of Octahedral symmetry

A regular octahedron has 24 rotational (or orientation-preserving) 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.

The group of orientation-preserving symmetries is S4, the symmetric group or the group of permutations of four objects, since there is exactly one such symmetry for each permutation of the four diagonals of the cube.

View the full Wikipedia page for Octahedral symmetry
↑ Return to Menu

Symmetric group in the context of Rubik's Cube group

The Rubik's Cube group represents the mathematical 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 . The group operation 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 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 a sequence of cube moves in a different order can result in a different configuration.

View the full Wikipedia page for Rubik's Cube group
↑ Return to Menu

Symmetric group in the context of Pyritohedral symmetry

A regular tetrahedron has 12 rotational (or orientation-preserving) symmetries, and a symmetry order of 24 including transformations that combine a reflection and a rotation.

The group of all (not necessarily orientation preserving) symmetries is isomorphic to the group S4, the symmetric group of permutations of four objects, since there is exactly one such symmetry for each permutation of the vertices of the tetrahedron. The set of orientation-preserving symmetries forms a group referred to as the alternating subgroup A4 of S4.

View the full Wikipedia page for Pyritohedral symmetry
↑ Return to Menu

Symmetric group in the context of Permutation group

In mathematics, a permutation group is a group G whose elements are permutations of a given set M and whose group operation is the composition of permutations in G (which are thought of as bijective functions from the set M to itself). The group of all permutations of a set M is the symmetric group of M, often written as Sym(M). The term permutation group thus means a subgroup of the symmetric group. If M = {1, 2, ..., n} then Sym(M) is usually denoted by Sn, and may be called the symmetric group on n letters.

By Cayley's theorem, every group is isomorphic to some permutation group.

View the full Wikipedia page for Permutation group
↑ Return to Menu