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 Sn defined over a finite set of n symbols consists of the permutation operations that can be performed on the n symbols. Since there are n! (n factorial) possible permutation operations that can be performed on a tuple composed of n symbols, it follows that the number of elements (the order) of the symmetric group Sn is n!. 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 Sn defined over a finite set of n symbols consists of the permutation operations that can be performed on the n symbols. Since there are n! (n factorial) possible permutation operations that can be performed on a tuple composed of n symbols, it follows that the number of elements (the order) of the symmetric group Sn is n!. 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. The symmetric group is important to diverse areas of mathematics such as Galois theory, invariant theory, the representation theory of Lie groups, and combinatorics. Cayley's theorem states that every group G is isomorphic to a subgroup of the symmetric group on G. The symmetric group on a finite set X is the group whose elements are all bijective functions from X to X and whose group operation is that of function composition. For finite sets, 'permutations' and 'bijective functions' refer to the same operation, namely rearrangement. The symmetric group of degree n is the symmetric group on the set X = { 1, 2, ..., n }. The symmetric group on a set X is denoted in various ways including SX, ?X, ΣX, X! and Sym(X). If X is the set { 1, 2, ..., n }, then the symmetric group on X is also denoted Sn, ?n, Σn, and Sym(n). Symmetric groups on infinite sets behave quite differently from symmetric groups on finite sets, and are discussed in (Scott 1987, Ch. 11), (Dixon & Mortimer 1996, Ch. 8), and (Cameron 1999). The symmetric group on a set of n elements has order n! (the factorial of n). It is abelian if and only if n is less than or equal to 2. For n = 0 and n = 1 (the empty set and the singleton set), the symmetric group is trivial (it has order 0! = 1! = 1). The group Sn is solvable if and only if n ≤ 4. This is an essential part of the proof of the Abel–Ruffini theorem that shows that for every n > 4 there are polynomials of degree n which are not solvable by radicals, that is, the solutions cannot be expressed by performing a finite number of operations of addition, subtraction, multiplication, division and root extraction on the polynomial's coefficients. The symmetric group on a set of size n is the Galois group of the general polynomial of degree n and plays an important role in Galois theory. In invariant theory, the symmetric group acts on the variables of a multi-variate function, and the functions left invariant are the so-called symmetric functions. In the representation theory of Lie groups, the representation theory of the symmetric group plays a fundamental role through the ideas of Schur functors. In the theory of Coxeter groups, the symmetric group is the Coxeter group of type An and occurs as the Weyl group of the general linear group. In combinatorics, the symmetric groups, their elements (permutations), and their representations provide a rich source of problems involving Young tableaux, plactic monoids, and the Bruhat order. Subgroups of symmetric groups are called permutation groups and are widely studied because of their importance in understanding group actions, homogeneous spaces, and automorphism groups of graphs, such as the Higman–Sims group and the Higman–Sims graph. The elements of the symmetric group on a set X are the permutations of X.