The group of all permutations (self-bijections) of a set with the operation of composition (see Permutation group). The symmetric group on a set is denoted by . For equipotent and the groups and are isomorphic. The symmetric group of a finite set is denoted by . Every abstract group is isomorphic to a subgroup of the symmetric group of some set (Cayley's theorem).
Let be a finite set. Every permutation on can be uniquely described as a product of disjoint cycles (the (disjoint) cycle decomposition of a permutation); the sequence of integers
where is the number of cycles of length of , is called the cycle type (or cycle index) of . Two permutations and are conjugate in if and only if they have the same cycle type. Permutations with cycle type
are called transpositions; they form a system of generators for . The set of transpositions is a minimal set of generators for . In general, a set generates if the graph with as set of vertices and the pairs as edges is a tree . The number of such generating sets is .
The alternating group is a normal subgroup of . If , is the unique non-trivial proper normal subgroup, and contains only one other non-trivial normal subgroup — the Klein four-group: . For the group is solvable, but for it is not solvable and is a simple non-Abelian group. Hölder's theorem: For , the group is complete (see Complete group). The group is commutative, and has an outer automorphism of order 2.
All maximal intransitive and imprimitive subgroups in are known. For each partition , , the only maximal intransitive subgroups in are the subgroups . The only transitive imprimitive maximal subgroups in are the wreath products (cf. Wreath product) of with (for every decomposition ). The primitive maximal subgroups in have not yet been described (1992), but certain infinite series of them are known. For example, acts naturally on the set of all subsets of elements of ; for this determines a primitive group of permutations of . It is maximal in if , , , , , (see ). Another series is obtained by considering the group of semi-linear transformations of the -dimensional vector space over the finite field of elements. This group defines a primitive group of permutations of the Grassmann manifold , , which is maximal in for .
Let be an infinite set. The group of all permutations of that move only a finite number of elements of is called the finitary, or restricted, symmetric group on , and is denoted by ; its subgroup of even permutations is called the finite, or restricted, alternating group on , and is denoted by . The subgroups and are normal in . More generally, let be the cardinality of and let be an infinite cardinal; the set of permutations of which move at most elements of is a subgroup of , denoted by . Along with and , the groups are normal subgroups in for all , and in fact there are no other non-trivial normal subgroups in (the Schreier–Ulam–Baer theorem, see ).
See also the references to Permutation of a set.
|||L.A. Kaluzhnin, M.Kh. Klin, "On certain maximal subgroups of symmetric and alternating groups" Math. USSR Sb. , 16 : 1 (1972) pp. 95–123 Mat. Sb. , 87 : 1 (1972) pp. 91–121|
|||O. Ore, "Theory of graphs" , Amer. Math. Soc. (1962)|
|||B.I. Plotkin, "Groups of automorphisms of algebraic systems" , Wolters-Noordhoff (1972)|
|||V.A. Ustimenko-Bakumovskii, "Maximality of the group acting on subspaces of dimension " Soviet Math. Dokl. , 19 : 3 (1978) pp. 769–772 Dokl. Akad. Nauk SSSR , 240 : 6 (1978) pp. 1305–1308|
A complete group, i.e. a group without centre and outer automorphisms, is also called a perfect group.
See also [a1] for a result on the structure of subgroups of .
|[a1]||I.M. Aschbacher, L.L. Scott, "Maximal subgroups of finite groups" J. Algebra (1985) pp. 44–80|
|[a2]||H. Wielandt, "Finite permutation groups" , Acad. Press (1964) (Translated from German)|
|[a3]||D. Passman, "Permutation groups" , Benjamin (1968)|
Symmetric group. L.A. Kaluzhnin (originator), Encyclopedia of Mathematics. URL: http://www.encyclopediaofmath.org/index.php?title=Symmetric_group&oldid=19180