Permutation representation (symmetric group)
   HOME

TheInfoList



OR:

In mathematics, the representation theory of the symmetric group is a particular case of the
representation theory of finite groups The representation theory of groups is a part of mathematics which examines how groups act on given structures. Here the focus is in particular on operations of groups on vector spaces. Nevertheless, groups acting on other groups or on sets are ...
, for which a concrete and detailed theory can be obtained. This has a large area of potential applications, from
symmetric function In mathematics, a function of n variables is symmetric if its value is the same no matter the order of its arguments. For example, a function f\left(x_1,x_2\right) of two arguments is a symmetric function if and only if f\left(x_1,x_2\right) = f ...
theory to quantum chemistry studies of atoms, molecules and solids. The
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 ...
S''n'' has order ''n''!. Its
conjugacy class In mathematics, especially group theory, two elements a and b of a group are conjugate if there is an element g in the group such that b = gag^. This is an equivalence relation whose equivalence classes are called conjugacy classes. In other wo ...
es are labeled by
partition Partition may refer to: Computing Hardware * Disk partitioning, the division of a hard disk drive * Memory partition, a subdivision of a computer's memory, usually for use by a single job Software * Partition (database), the division of a ...
s of ''n''. Therefore according to the representation theory of a finite group, the number of inequivalent irreducible representations, over the
complex number In mathematics, a complex number is an element of a number system that extends the real numbers with a specific element denoted , called the imaginary unit and satisfying the equation i^= -1; every complex number can be expressed in the fo ...
s, is equal to the number of partitions of ''n''. Unlike the general situation for finite groups, there is in fact a natural way to parametrize irreducible representations by the same set that parametrizes conjugacy classes, namely by partitions of ''n'' or equivalently
Young diagram In mathematics, a Young tableau (; plural: tableaux) is a combinatorial object useful in representation theory and Schubert calculus. It provides a convenient way to describe the group representations of the symmetric and general linear groups ...
s of size ''n''. Each such irreducible representation can in fact be realized over the integers (every permutation acting by a matrix with integer coefficients); it can be explicitly constructed by computing the
Young symmetrizer In mathematics, a Young symmetrizer is an element of the group algebra of the symmetric group, constructed in such a way that, for the homomorphism from the group algebra to the endomorphisms of a vector space V^ obtained from the action of S_n o ...
s acting on a space generated by the
Young tableau In mathematics, a Young tableau (; plural: tableaux) is a combinatorial object useful in representation theory and Schubert calculus. It provides a convenient way to describe the group representations of the symmetric and general linear groups a ...
x of shape given by the Young diagram. The dimension d_\lambda of the representation that corresponds to the Young diagram \lambda is given by the
hook length formula In combinatorial mathematics, the hook length formula is a formula for the number of standard Young tableaux whose shape is a given Young diagram. It has applications in diverse areas such as representation theory, probability, and algorithm analy ...
. To each irreducible representation ρ we can associate an irreducible character, χρ. To compute χρ(π) where π is a permutation, one can use the combinatorial
Murnaghan–Nakayama rule In group theory, a branch of mathematics, the Murnaghan–Nakayama rule, named after Francis Murnaghan and Tadashi Nakayama, is a combinatorial method to compute irreducible character values of a symmetric group.Richard Stanley, ''Enumerative Comb ...
. Note that χρ is constant on conjugacy classes, that is, χρ(π) = χρ−1πσ) for all permutations σ. Over other
field Field may refer to: Expanses of open ground * Field (agriculture), an area of land used for agricultural purposes * Airfield, an aerodrome that lacks the infrastructure of an airport * Battlefield * Lawn, an area of mowed grass * Meadow, a grass ...
s the situation can become much more complicated. If the field ''K'' has characteristic equal to zero or greater than ''n'' then by Maschke's theorem the group algebra ''K''S''n'' is semisimple. In these cases the irreducible representations defined over the integers give the complete set of irreducible representations (after reduction modulo the characteristic if necessary). However, the irreducible representations of the symmetric group are not known in arbitrary characteristic. In this context it is more usual to use the language of
module Module, modular and modularity may refer to the concept of modularity. They may also refer to: Computing and engineering * Modular design, the engineering discipline of designing complex devices using separately designed sub-components * Mo ...
s rather than representations. The representation obtained from an irreducible representation defined over the integers by reducing modulo the characteristic will not in general be irreducible. The modules so constructed are called '' Specht modules'', and every irreducible does arise inside some such module. There are now fewer irreducibles, and although they can be classified they are very poorly understood. For example, even their
dimension In physics and mathematics, the dimension of a mathematical space (or object) is informally defined as the minimum number of coordinates needed to specify any point within it. Thus, a line has a dimension of one (1D) because only one coor ...
s are not known in general. The determination of the irreducible modules for the symmetric group over an arbitrary field is widely regarded as one of the most important open problems in representation theory.


Low-dimensional representations


Symmetric groups

The lowest-dimensional representations of the symmetric groups can be described explicitly, and over arbitrary fields. The smallest two degrees in characteristic zero are described here: Every symmetric group has a one-dimensional representation called the trivial representation, where every element acts as the one by one identity matrix. For , there is another irreducible representation of degree 1, called the sign representation or alternating character, which takes a permutation to the one by one matrix with entry ±1 based on the sign of the permutation. These are the only one-dimensional representations of the symmetric groups, as one-dimensional representations are abelian, and the
abelianization In mathematics, more specifically in abstract algebra, the commutator subgroup or derived subgroup of a group is the subgroup generated by all the commutators of the group. The commutator subgroup is important because it is the smallest normal ...
of the symmetric group is C2, the
cyclic group In group theory, a branch of abstract algebra in pure mathematics, a cyclic group or monogenous group is a group, denoted C''n'', that is generated by a single element. That is, it is a set of invertible elements with a single associative bina ...
of order 2. For all ''n'', there is an ''n''-dimensional representation of the symmetric group of order ''n!'', called the , which consists of permuting ''n'' coordinates. This has the trivial subrepresentation consisting of vectors whose coordinates are all equal. The orthogonal complement consists of those vectors whose coordinates sum to zero, and when , the representation on this subspace is an -dimensional irreducible representation, called the standard representation. Another -dimensional irreducible representation is found by tensoring with the sign representation. An
exterior power In mathematics, the exterior algebra, or Grassmann algebra, named after Hermann Grassmann, is an algebra that uses the exterior product or wedge product as its multiplication. In mathematics, the exterior product or wedge product of vectors is ...
\Lambda^k V of the standard representation V is irreducible provided 0\leq k\leq n-1 . For , these are the lowest-dimensional irreducible representations of S''n'' – all other irreducible representations have dimension at least ''n''. However for , the surjection from S4 to S3 allows S4 to inherit a two-dimensional irreducible representation. For , the exceptional transitive embedding of S5 into S6 produces another pair of five-dimensional irreducible representations.


Alternating groups

The representation theory of the
alternating group In mathematics, an alternating group is the group of even permutations of a finite set. The alternating group on a set of elements is called the alternating group of degree , or the alternating group on letters and denoted by or Basic pr ...
s is similar, though the sign representation disappears. For , the lowest-dimensional irreducible representations are the trivial representation in dimension one, and the -dimensional representation from the other summand of the permutation representation, with all other irreducible representations having higher dimension, but there are exceptions for smaller ''n''. The alternating groups for have only one one-dimensional irreducible representation, the trivial representation. For there are two additional one-dimensional irreducible representations, corresponding to maps to the cyclic group of order 3: and . * For , there is just one irreducible representation of degree , and this is the smallest degree of a non-trivial irreducible representation. * For the obvious analogue of the -dimensional representation is reducible – the permutation representation coincides with the regular representation, and thus breaks up into the three one-dimensional representations, as is abelian; see the
discrete Fourier transform In mathematics, the discrete Fourier transform (DFT) converts a finite sequence of equally-spaced samples of a function into a same-length sequence of equally-spaced samples of the discrete-time Fourier transform (DTFT), which is a comple ...
for representation theory of cyclic groups. * For , there is just one irreducible representation, but there are the exceptional irreducible representations of dimension 1. * For , there are two dual irreducible representations of dimension 3, corresponding to its action as
icosahedral symmetry In mathematics, and especially in geometry, an object has icosahedral symmetry if it has the same symmetries as a regular icosahedron. Examples of other polyhedra with icosahedral symmetry include the regular dodecahedron (the dual polyhedr ...
. * For , there is an extra irreducible representation of dimension 5 corresponding to the exceptional transitive embedding of ''A''5 in ''A''6.


Tensor products of representations


Kronecker coefficients

The
tensor product In mathematics, the tensor product V \otimes W of two vector spaces and (over the same field) is a vector space to which is associated a bilinear map V\times W \to V\otimes W that maps a pair (v,w),\ v\in V, w\in W to an element of V \otime ...
of two representations of S_n corresponding to the Young diagrams \lambda,\mu is a combination of irreducible representations of S_n, : V_\lambda\otimes V_\mu \cong \sum_\nu C_ V_\nu The coefficients C_\in\mathbb are called the Kronecker coefficients of the symmetric group. They can be computed from the
characters Character or Characters may refer to: Arts, entertainment, and media Literature * ''Character'' (novel), a 1936 Dutch novel by Ferdinand Bordewijk * ''Characters'' (Theophrastus), a classical Greek set of character sketches attributed to The ...
of the representations : : C_ = \sum_\rho \frac \chi_\lambda(C_\rho)\chi_\mu(C_\rho)\chi_\nu(C_\rho) The sum is over partitions \rho of n, with C_\rho the corresponding conjugacy classes. The values of the characters \chi_\lambda(C_\rho) can be computed using the Frobenius formula. The coefficients z_\rho are : z_\rho = \prod_^n j^i_j! = \frac where i_j is the number of times j appears in \rho, so that \sum i_jj = n. A few examples, written in terms of Young diagrams : : (n - 1, 1) \otimes (n - 1, 1) \cong (n) + (n - 1, 1) + (n - 2, 2) + (n - 2, 1,1) : (n - 1, 1) \otimes (n - 2, 2) \underset (n - 1, 1) + (n - 2, 2) + (n - 2, 1, 1) + (n - 3, 3) + (n - 3, 2, 1) : (n - 1, 1) \otimes (n - 2, 1,1) \cong (n - 1, 1) + (n - 2, 2) + (n - 2, 1,1) + (n - 3, 2, 1) + (n - 3, 1,1,1) : \begin (n - 2, 2) \otimes (n - 2, 2) \cong & (n) + (n - 1, 1) + 2(n - 2, 2) + (n - 2, 1,1) + (n - 3, 3) \\ & + 2(n - 3, 2, 1) + (n - 3, 1,1,1) + (n - 4, 4) + (n - 4, 3, 1) + (n - 4, 2, 2) \end There is a simple rule for computing (n-1,1)\otimes \lambda for any Young diagram \lambda : the result is the sum of all Young diagrams that are obtained from \lambda by removing one box and then adding one box, where the coefficients are one except for \lambda itself, whose coefficient is \#\-1, i.e., the number of different row lengths minus one. A constraint on the irreducible constituents of V_\lambda\otimes V_\mu is : C_>0 \implies , d_\lambda-d_\mu, \leq d_\nu \leq d_\lambda+d_\mu where the depth d_\lambda=n-\lambda_1 of a Young diagram is the number of boxes that do not belong to the first row.


Reduced Kronecker coefficients

For \lambda a Young diagram and n\geq \lambda_1, \lambda (n-, \lambda, ,\lambda) is a Young diagram of size n. Then C_ is a bounded, non-decreasing function of n, and : \bar_ = \lim_ C_ is called a reduced Kronecker coefficient or stable Kronecker coefficient. There are known bounds on the value of n where C_ reaches its limit. The reduced Kronecker coefficients are structure constants of Deligne categories of representations of S_n with n\in \mathbb-\mathbb. In contrast to Kronecker coefficients, reduced Kronecker coefficients are defined for any triple of Young diagrams, not necessarily of the same size. If , \nu, =, \lambda, +, \mu, , then \bar_ coincides with the Littlewood-Richardson coefficient c_^\nu. Reduced Kronecker coefficients can be written as linear combinations of Littlewood-Richardson coefficients via a change of bases in the space of symmetric functions, giving rise to expressions that are manifestly integral although not manifestly positive. Reduced Kronecker coefficients can also be written in terms of Kronecker and Littlewood-Richardson coefficients c^\lambda_ via Littlewood's formula : \bar_ = \sum_ C_ c^_ c^_ c^\nu_ Conversely, it is possible to recover the Kronecker coefficients as linear combinations of reduced Kronecker coefficients. Reduced Kronecker coefficients are implemented in the computer algebra system
SageMath SageMath (previously Sage or SAGE, "System for Algebra and Geometry Experimentation") is a computer algebra system (CAS) with features covering many aspects of mathematics, including algebra, combinatorics, graph theory, numerical analysis, numbe ...
.


Eigenvalues of complex representations

Given an element w\in S_n of cycle-type \mu=(\mu_1,\mu_2,\dots,\mu_k) and order m=\text(\mu_i), the eigenvalues of w in a complex representation of S_n are of the type \omega^ with \omega=e^, where the integers e_j\in \frac are called the cyclic exponents of w with respect to the representation. There is a combinatorial description of the cyclic exponents of the symmetric group (and
wreath product 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 i ...
s thereof). Defining \left(b_\mu(1),\dots,b_\mu(n)\right) = \left(\frac,2\frac,\dots, m, \frac,2\frac,\dots, m,\dots\right), let the \mu-index of a standard Young tableau be the sum of the values of b_\mu over the tableau's descents, \text_\mu(T) = \sum_ b_\mu(k)\bmod m. Then the cyclic exponents of the representation of S_n described by the Young diagram \lambda are the \mu-indices of the corresponding Young tableaux. In particular, if w is of order n, then b_\mu(k)=k, and \text_\mu(T) coincides with the major index of T (the sum of the descents). The cyclic exponents of an irreducible representation of S_n then describe how it decomposes into representations of the
cyclic group In group theory, a branch of abstract algebra in pure mathematics, a cyclic group or monogenous group is a group, denoted C''n'', that is generated by a single element. That is, it is a set of invertible elements with a single associative bina ...
\frac, with \omega^ being interpreted as the image of w in the (one-dimensional) representation characterized by e_j.


See also

*
Alternating polynomials In algebra, an alternating polynomial is a polynomial f(x_1,\dots,x_n) such that if one switches any two of the variables, the polynomial changes sign: :f(x_1,\dots,x_j,\dots,x_i,\dots,x_n) = -f(x_1,\dots,x_i,\dots,x_j,\dots,x_n). Equivalently, if o ...
* Symmetric polynomials * Schur functor *
Robinson–Schensted correspondence In mathematics, the Robinson–Schensted correspondence is a bijective correspondence between permutations and pairs of standard Young tableaux of the same shape. It has various descriptions, all of which are of algorithmic nature, it has many rem ...
*
Schur–Weyl duality Schur–Weyl duality is a mathematical theorem in representation theory that relates irreducible finite-dimensional representations of the general linear and symmetric groups. It is named after two pioneers of representation theory of Lie groups, ...
* Jucys–Murphy element * Garnir relations


References


Cited Publications

* * * * {{Citation , last1=James , first1=G. D. , title=On the minimal dimensions of irreducible representations of symmetric groups , doi=10.1017/S0305004100000803 , mr=720791 , year=1983 , journal=Mathematical Proceedings of the Cambridge Philosophical Society , issn=0305-0041 , volume=94 , issue=3 , pages=417–424, bibcode=1983MPCPS..94..417J Representation theory of finite groups Permutations Integer partitions