Misplaced Pages

Representation theory of the symmetric group

Article snapshot taken from Wikipedia with creative commons attribution-sharealike license. Give it a read and then ask your questions in the chat. We can research this topic together.
(Redirected from Permutation representation (symmetric group)) Theory in mathematics
This article includes a list of general references, but it lacks sufficient corresponding inline citations. Please help to improve this article by introducing more precise citations. (April 2014) (Learn how and when to remove this message)

In mathematics, the representation theory of the symmetric group is a particular case of the representation theory of finite groups, for which a concrete and detailed theory can be obtained. This has a large area of potential applications, from symmetric function theory to quantum chemistry studies of atoms, molecules and solids.

The symmetric group Sn has order n!. Its conjugacy classes are labeled by partitions of n. Therefore according to the representation theory of a finite group, the number of inequivalent irreducible representations, over the complex numbers, 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 diagrams 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 symmetrizers acting on a space generated by the Young tableaux of shape given by the Young diagram. The dimension d λ {\displaystyle d_{\lambda }} of the representation that corresponds to the Young diagram λ {\displaystyle \lambda } is given by the hook length formula.

To each irreducible representation ρ we can associate an irreducible character, χ. To compute χ(π) where π is a permutation, one can use the combinatorial Murnaghan–Nakayama rule . Note that χ is constant on conjugacy classes, that is, χ(π) = χ(σπσ) for all permutations σ.

Over other fields 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 KSn 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 modules 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 dimensions 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 n ≥ 2, 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 of the symmetric group is C2, the cyclic group of order 2.

For all n, there is an n-dimensional representation of the symmetric group of order n!, called the natural permutation representation, 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 n ≥ 2, the representation on this subspace is an (n − 1)-dimensional irreducible representation, called the standard representation. Another (n − 1)-dimensional irreducible representation is found by tensoring with the sign representation. An exterior power Λ k V {\displaystyle \Lambda ^{k}V} of the standard representation V {\displaystyle V} is irreducible provided 0 ≤ k ≤ n − 1 {\displaystyle 0\leq k\leq n-1} (Fulton & Harris 2004).

For n ≥ 7, these are the lowest-dimensional irreducible representations of Sn – all other irreducible representations have dimension at least n. However for n = 4, the surjection from S4 to S3 allows S4 to inherit a two-dimensional irreducible representation. For n = 6, the exceptional transitive embedding of S5 into S6 produces another pair of five-dimensional irreducible representations.

Irreducible representation of S n {\displaystyle S_{n}} Dimension Young diagram of size n {\displaystyle n}
Trivial representation 1 {\displaystyle 1} ( n ) {\displaystyle (n)}
Sign representation 1 {\displaystyle 1} ( 1 n ) = ( 1 , 1 , … , 1 ) {\displaystyle (1^{n})=(1,1,\dots ,1)}
Standard representation V {\displaystyle V} n − 1 {\displaystyle n-1} ( n − 1 , 1 ) {\displaystyle (n-1,1)}
Exterior power Λ k V {\displaystyle \Lambda ^{k}V} ( n − 1 k ) {\displaystyle {\binom {n-1}{k}}} ( n − k , 1 k ) {\displaystyle (n-k,1^{k})}

Alternating groups

The compound of five tetrahedra, on which A5 acts, giving a 3-dimensional representation.

The representation theory of the alternating groups is similar, though the sign representation disappears. For n ≥ 7, the lowest-dimensional irreducible representations are the trivial representation in dimension one, and the (n − 1)-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 n ≥ 5 have only one one-dimensional irreducible representation, the trivial representation. For n = 3, 4 there are two additional one-dimensional irreducible representations, corresponding to maps to the cyclic group of order 3: A3 ≅ C3 and A4 → A4/V ≅ C3.

  • For n ≥ 7, there is just one irreducible representation of degree n − 1, and this is the smallest degree of a non-trivial irreducible representation.
  • For n = 3 the obvious analogue of the (n − 1)-dimensional representation is reducible – the permutation representation coincides with the regular representation, and thus breaks up into the three one-dimensional representations, as A3 ≅ C3 is abelian; see the discrete Fourier transform for representation theory of cyclic groups.
  • For n = 4, there is just one n − 1 irreducible representation, but there are the exceptional irreducible representations of dimension 1.
  • For n = 5, there are two dual irreducible representations of dimension 3, corresponding to its action as icosahedral symmetry.
  • For n = 6, there is an extra irreducible representation of dimension 5 corresponding to the exceptional transitive embedding of A5 in A6.

Tensor products of representations

Kronecker coefficients

The tensor product of two representations of S n {\displaystyle S_{n}} corresponding to the Young diagrams λ , μ {\displaystyle \lambda ,\mu } is a combination of irreducible representations of S n {\displaystyle S_{n}} ,

V λ ⊗ V μ ≅ ∑ ν C λ , μ , ν V ν {\displaystyle V_{\lambda }\otimes V_{\mu }\cong \sum _{\nu }C_{\lambda ,\mu ,\nu }V_{\nu }}

The coefficients C λ μ ν ∈ N {\displaystyle C_{\lambda \mu \nu }\in \mathbb {N} } are called the Kronecker coefficients of the symmetric group. They can be computed from the characters of the representations (Fulton & Harris 2004):

C λ , μ , ν = ∑ ρ 1 z ρ χ λ ( C ρ ) χ μ ( C ρ ) χ ν ( C ρ ) {\displaystyle C_{\lambda ,\mu ,\nu }=\sum _{\rho }{\frac {1}{z_{\rho }}}\chi _{\lambda }(C_{\rho })\chi _{\mu }(C_{\rho })\chi _{\nu }(C_{\rho })}

The sum is over partitions ρ {\displaystyle \rho } of n {\displaystyle n} , with C ρ {\displaystyle C_{\rho }} the corresponding conjugacy classes. The values of the characters χ λ ( C ρ ) {\displaystyle \chi _{\lambda }(C_{\rho })} can be computed using the Frobenius formula. The coefficients z ρ {\displaystyle z_{\rho }} are

z ρ = ∏ j = 0 n j i j i j ! = n ! | C ρ | {\displaystyle z_{\rho }=\prod _{j=0}^{n}j^{i_{j}}i_{j}!={\frac {n!}{|C_{\rho }|}}}

where i j {\displaystyle i_{j}} is the number of times j {\displaystyle j} appears in ρ {\displaystyle \rho } , so that ∑ i j j = n {\displaystyle \sum i_{j}j=n} .

A few examples, written in terms of Young diagrams (Hamermesh 1989):

( n − 1 , 1 ) ⊗ ( n − 1 , 1 ) ≅ ( n ) + ( n − 1 , 1 ) + ( n − 2 , 2 ) + ( n − 2 , 1 , 1 ) {\displaystyle (n-1,1)\otimes (n-1,1)\cong (n)+(n-1,1)+(n-2,2)+(n-2,1,1)}
( n − 1 , 1 ) ⊗ ( n − 2 , 2 ) ≅ n > 4 ( n − 1 , 1 ) + ( n − 2 , 2 ) + ( n − 2 , 1 , 1 ) + ( n − 3 , 3 ) + ( n − 3 , 2 , 1 ) {\displaystyle (n-1,1)\otimes (n-2,2){\underset {n>4}{\cong }}(n-1,1)+(n-2,2)+(n-2,1,1)+(n-3,3)+(n-3,2,1)}
( n − 1 , 1 ) ⊗ ( n − 2 , 1 , 1 ) ≅ ( n − 1 , 1 ) + ( n − 2 , 2 ) + ( n − 2 , 1 , 1 ) + ( n − 3 , 2 , 1 ) + ( n − 3 , 1 , 1 , 1 ) {\displaystyle (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)}
( n − 2 , 2 ) ⊗ ( n − 2 , 2 ) ≅ ( 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 ) {\displaystyle {\begin{aligned}(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{aligned}}}

There is a simple rule for computing ( n − 1 , 1 ) ⊗ λ {\displaystyle (n-1,1)\otimes \lambda } for any Young diagram λ {\displaystyle \lambda } (Hamermesh 1989): the result is the sum of all Young diagrams that are obtained from λ {\displaystyle \lambda } by removing one box and then adding one box, where the coefficients are one except for λ {\displaystyle \lambda } itself, whose coefficient is # { λ i } − 1 {\displaystyle \#\{\lambda _{i}\}-1} , i.e., the number of different row lengths minus one.

A constraint on the irreducible constituents of V λ ⊗ V μ {\displaystyle V_{\lambda }\otimes V_{\mu }} is (James & Kerber 1981)

C λ , μ , ν > 0 ⟹ | d λ − d μ | ≤ d ν ≤ d λ + d μ {\displaystyle C_{\lambda ,\mu ,\nu }>0\implies |d_{\lambda }-d_{\mu }|\leq d_{\nu }\leq d_{\lambda }+d_{\mu }}

where the depth d λ = n − λ 1 {\displaystyle 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 λ {\displaystyle \lambda } a Young diagram and n ≥ λ 1 {\displaystyle n\geq \lambda _{1}} , λ [ n ] = ( n − | λ | , λ ) {\displaystyle \lambda =(n-|\lambda |,\lambda )} is a Young diagram of size n {\displaystyle n} . Then C λ [ n ] , μ [ n ] , ν [ n ] {\displaystyle C_{\lambda ,\mu ,\nu }} is a bounded, non-decreasing function of n {\displaystyle n} , and

C ¯ λ , μ , ν = lim n → ∞ C λ [ n ] , μ [ n ] , ν [ n ] {\displaystyle {\bar {C}}_{\lambda ,\mu ,\nu }=\lim _{n\to \infty }C_{\lambda ,\mu ,\nu }}

is called a reduced Kronecker coefficient or stable Kronecker coefficient. There are known bounds on the value of n {\displaystyle n} where C λ [ n ] , μ [ n ] , ν [ n ] {\displaystyle C_{\lambda ,\mu ,\nu }} reaches its limit. The reduced Kronecker coefficients are structure constants of Deligne categories of representations of S n {\displaystyle S_{n}} with n ∈ C − N {\displaystyle n\in \mathbb {C} -\mathbb {N} } .

In contrast to Kronecker coefficients, reduced Kronecker coefficients are defined for any triple of Young diagrams, not necessarily of the same size. If | ν | = | λ | + | μ | {\displaystyle |\nu |=|\lambda |+|\mu |} , then C ¯ λ , μ , ν {\displaystyle {\bar {C}}_{\lambda ,\mu ,\nu }} coincides with the Littlewood-Richardson coefficient c λ , μ ν {\displaystyle c_{\lambda ,\mu }^{\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 α β γ λ {\displaystyle c_{\alpha \beta \gamma }^{\lambda }} via Littlewood's formula

C ¯ λ , μ , ν = ∑ λ ′ , μ ′ , ν ′ , α , β , γ C λ ′ , μ ′ , ν ′ c λ ′ β γ λ c μ ′ α γ μ c ν ′ α β ν {\displaystyle {\bar {C}}_{\lambda ,\mu ,\nu }=\sum _{\lambda ',\mu ',\nu ',\alpha ,\beta ,\gamma }C_{\lambda ',\mu ',\nu '}c_{\lambda '\beta \gamma }^{\lambda }c_{\mu '\alpha \gamma }^{\mu }c_{\nu '\alpha \beta }^{\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.

Eigenvalues of complex representations

Given an element w ∈ S n {\displaystyle w\in S_{n}} of cycle-type μ = ( μ 1 , μ 2 , … , μ k ) {\displaystyle \mu =(\mu _{1},\mu _{2},\dots ,\mu _{k})} and order m = lcm ( μ i ) {\displaystyle m={\text{lcm}}(\mu _{i})} , the eigenvalues of w {\displaystyle w} in a complex representation of S n {\displaystyle S_{n}} are of the type ω e j {\displaystyle \omega ^{e_{j}}} with ω = e 2 π i m {\displaystyle \omega =e^{\frac {2\pi i}{m}}} , where the integers e j ∈ Z m Z {\displaystyle e_{j}\in {\frac {\mathbb {Z} }{m\mathbb {Z} }}} are called the cyclic exponents of w {\displaystyle w} with respect to the representation.

There is a combinatorial description of the cyclic exponents of the symmetric group (and wreath products thereof). Defining ( b μ ( 1 ) , … , b μ ( n ) ) = ( m μ 1 , 2 m μ 1 , … , m , m μ 2 , 2 m μ 2 , … , m , … ) {\displaystyle \left(b_{\mu }(1),\dots ,b_{\mu }(n)\right)=\left({\frac {m}{\mu _{1}}},2{\frac {m}{\mu _{1}}},\dots ,m,{\frac {m}{\mu _{2}}},2{\frac {m}{\mu _{2}}},\dots ,m,\dots \right)} , let the μ {\displaystyle \mu } -index of a standard Young tableau be the sum of the values of b μ {\displaystyle b_{\mu }} over the tableau's descents, ind μ ( T ) = ∑ k ∈ { descents ( T ) } b μ ( k ) mod m {\displaystyle {\text{ind}}_{\mu }(T)=\sum _{k\in \{{\text{descents}}(T)\}}b_{\mu }(k){\bmod {m}}} . Then the cyclic exponents of the representation of S n {\displaystyle S_{n}} described by the Young diagram λ {\displaystyle \lambda } are the μ {\displaystyle \mu } -indices of the corresponding Young tableaux.

In particular, if w {\displaystyle w} is of order n {\displaystyle n} , then b μ ( k ) = k {\displaystyle b_{\mu }(k)=k} , and ind μ ( T ) {\displaystyle {\text{ind}}_{\mu }(T)} coincides with the major index of T {\displaystyle T} (the sum of the descents). The cyclic exponents of an irreducible representation of S n {\displaystyle S_{n}} then describe how it decomposes into representations of the cyclic group Z n Z {\displaystyle {\frac {\mathbb {Z} }{n\mathbb {Z} }}} , with ω e j {\displaystyle \omega ^{e_{j}}} being interpreted as the image of w {\displaystyle w} in the (one-dimensional) representation characterized by e j {\displaystyle e_{j}} .

See also

References

  1. Philip R. Bunker and Per Jensen (1998) Molecular Symmetry and Spectroscopy, 2nd ed. NRC Research Press, Ottawa pp.198-202.ISBN 9780660196282
  2. R.Pauncz (1995) The Symmetric Group in Quantum Chemistry, CRC Press, Boca Raton, Florida
  3. Richard Stanley, Enumerative Combinatorics, Vol. 2
  4. Burnside, William (1955), Theory of groups of finite order, New York: Dover Publications, MR 0069818
  5. Rasala, Richard (1977), "On the minimal degrees of characters of Sn", Journal of Algebra, 45 (1): 132–181, doi:10.1016/0021-8693(77)90366-0, ISSN 0021-8693, MR 0427445
  6. James & Kerber 1981.
  7. ^ Briand, Emmanuel; Orellana, Rosa; Rosas, Mercedes (2009-07-27). "The stability of the Kronecker products of Schur functions". Journal of Algebra. 331: 11–27. arXiv:0907.4652. doi:10.1016/j.jalgebra.2010.12.026. S2CID 16714030.
  8. ^ Assaf, Sami H.; Speyer, David E. (2018-09-26). "Specht modules decompose as alternating sums of restrictions of Schur modules". Proceedings of the American Mathematical Society. 148 (3): 1015–1029. arXiv:1809.10125. doi:10.1090/proc/14815. S2CID 119692633.
  9. Entova-Aizenbud, Inna (2014-07-06). "Deligne categories and reduced Kronecker coefficients". arXiv:1407.1506v1 .
  10. Dvir, Yoav (1996-02-15). "On the Kronecker Product of Sn Characters". Journal of Algebra. 154: 125–140. doi:10.1006/jabr.1993.1008.
  11. Littlewood, D. E. (1958). "Products and Plethysms of Characters with Orthogonal, Symplectic and Symmetric Groups". Canadian Journal of Mathematics. 10. Canadian Mathematical Society: 17–32. doi:10.4153/cjm-1958-002-7. ISSN 0008-414X.
  12. Orellana, Rosa; Zabrocki, Mike (2017-09-23). "Products of characters of the symmetric group". arXiv:1709.08098v1 .
  13. Orellana, Rosa; Zabrocki, Mike (2015-10-01). "Symmetric group characters as symmetric functions (extended abstract)". arXiv:1510.00438v2 .
  14. "Characters of the symmetric group as bases of the symmetric functions". Sage 9.3 Reference Manual: Combinatorics. Retrieved 2021-07-05.
  15. ^ Stembridge, John (1989-12-01). "On the eigenvalues of representations of reflection groups and wreath products". Pacific Journal of Mathematics. 140 (2). Mathematical Sciences Publishers: 353–396. doi:10.2140/pjm.1989.140.353. ISSN 0030-8730.

Cited Publications

Categories: