Skew Howe duality and random rectangular Young tableaux
Greta Panova, Piotr \'Sniady

TL;DR
This paper explores the decomposition of tensor products into irreducible components using skew Howe duality, revealing a probabilistic connection to random Young tableaux and analyzing their asymptotic behavior as dimensions grow large.
Contribution
It establishes a novel probabilistic interpretation of the irreducible components in tensor decompositions via random Young tableaux, extending understanding to asymptotic regimes.
Findings
Young diagram distribution matches entries ≤ p in a random rectangular Young tableau
Asymptotic behavior of decomposition analyzed as m, n, p tend to infinity
Skew Howe duality links tensor decomposition with random tableau models
Abstract
We consider the decomposition into irreducible components of the external power regarded as a -module. Skew Howe duality implies that the Young diagrams from each pair which contributes to this decomposition turn out to be conjugate to each other, i.e.~. We show that the Young diagram which corresponds to a randomly selected irreducible component has the same distribution as the Young diagram which consists of the boxes with entries of a random Young tableau of rectangular shape with rows and columns. This observation allows treatment of the asymptotic version of this decomposition in the limit as tend to infinity.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Skew Howe duality
and random rectangular Young tableaux
Greta Panova
UPenn Mathematics Department, 209 South 33rd St, Philadelphia, PA 19104, USA
and
Piotr Śniady
Institute of Mathematics, Polish Academy of Sciences, ul. Śniadeckich 8, 00-956 Warszawa, Poland
Abstract.
We consider the decomposition into irreducible components of the external power regarded as a -module. Skew Howe duality implies that the Young diagrams from each pair which contributes to this decomposition turn out to be conjugate to each other, i.e. . We show that the Young diagram which corresponds to a randomly selected irreducible component has the same distribution as the Young diagram which consists of the boxes with entries of a random Young tableau of rectangular shape with rows and columns. This observation allows treatment of the asymptotic version of this decomposition in the limit as tend to infinity.
Key words and phrases:
skew Howe duality, random Young diagrams, representations of general linear groups , representations of finite symmetric groups
2010 Mathematics Subject Classification:
22E46, 20C30, 60C05
1. Introduction
1.1. The problem
In this note we address the following question.
Consider
[TABLE]
*as a -module. […] I would like any information on the shapes of pairs of Young diagrams that give the largest contribution to the dimension asymptotically. […] *
Joseph M. Landsberg [Lan12]111The question of Landsberg is reproduced here in a slightly redacted version. In particular, the original question considered only the special case .
Above, denotes the Schur functor applied to or, in other words, the irreducible representation of the general linear group with the highest weight . The sum in (1) runs over Young diagrams with boxes, and such that the number of rows of is bounded from above by , and the number of columns of is bounded from above by . The decomposition (1) is nowadays referred to as skew Howe -duality, cf. [How95, Theorem 4.1.1]. Even though (1) provides full information about the decomposition into irreducible components, it is not very convenient for answering such asymptotic questions, see the introduction to the work of Biane [Bia98] for discussion of difficulties related to similar problems.
Despite improvements in the understanding of asymptotic problems related to the representation theory of the general linear groups [Bia95, BG15, CNŚ16], we do not see generic tools which would be suitable for investigation of the external power (1).
1.2. Motivations: Geometric Complexity Theory
Besides the natural interest in the question as a problem in asymptotic representation theory, this question is also relevant within Geometric Complexity Theory (GCT). The decomposition appears in the study of the complexity of matrix multiplication [LO15] and, in particular, in the study of the border rank of the matrix multiplication tensor as a standard measure of complexity. A lower bound for the border rank is obtained from the rank of a particular linear map, whose kernel can be decomposed as a representation. The general approach in GCT would be to study the irreducible components for polynomials to play the role of “obstruction candidates” and, depending on the precise setup, the multiplicities would show where to find the obstructions.
1.3. The main result
A partial answer to the question of Landsberg which we give in the current paper is based on a simple result which transforms the original problem into a question about the representation theory of the symmetric group for which more asymptotic tools are available, see Section 1.7 below.
We state our main result in two equivalent versions which are of quite distinct flavors:
- •
as Theorem 1.1 which is conceptually simpler and is a purely enumerative statement which relates some dimensions of the representations of the general linear groups to the dimensions of some representations of the symmetric groups , and
- •
as Theorem 1.4 which is a probabilistic statement which relates the distribution of a random irreducible component of the external power (1) to the distribution of a random irreducible component of a certain representation of the symmetric group . This second formulation is more convenient for addressing Landsberg’s problem.
The proof of Theorem 1.1 is shorter, but the proof of Theorem 1.4 might be advantageous for some readers who prefer more representation-theoretic viewpoint.
1.4. The main result: the enumerative version
Let be integers and let be a Young diagram with boxes which has at most rows and at most columns. We denote by the rectangular Young diagram with rows and columns. We denote by the dimension of the irreducible representation of corresponding to the Young diagram . Note that the skew Young diagram is a rotation by of a certain Young diagram therefore it defines an irreducible representation of .
Theorem 1.1**.**
For a Young diagram with boxes we have the following relationship between dimensions of representations of , and :
[TABLE]
Our proof of this result (see Section 2) will be based on algebraic combinatorial manipulations with the hook-length formula and the hook-content formula.
1.5. Bijective proofs?
Theorem 1.1 implies the following result.
Claim 1.2**.**
For all integers and the fraction
[TABLE]
is a constant which does not depend on the choice of a Young diagram with boxes.
Conversely, 1.2 implies Theorem 1.1 since
[TABLE]
implies
[TABLE]
(the left-hand side is an application of skew Howe duality (1)) which determines uniquely the constant .
This observation opens the following challenging problem.
Problem 1.3**.**
For a pair of Young diagrams , each with boxes, find a bijective proof of the identity
[TABLE]
which is clearly equivalent to 1.2 and thus to Theorem 1.1.
In fact, it would be enough to find such a bijection in the special case when is obtained from by a removal and an addition of a single box.
1.6. The main result: the probabilistic version
Theorem 1.4**.**
Let and be integer numbers.
The random irreducible component of (1) corresponds to a pair of Young diagrams , where has the same distribution as the Young diagram which consists of the boxes with entries of a uniformly random Young tableau with rectangular shape with rows and columns.
Alternatively: the random Young diagram has the same distribution as a Young diagram which corresponds to a random irreducible component of the restriction V^{n^{m}}\big{\downarrow}^{\mathfrak{S}_{mn}}_{\mathfrak{S}_{p}} of the irreducible representation of the symmetric group which corresponds to the rectangular diagram .
Above, when we speak about random irreducible component of a representation we refer to the following concept.
Definition 1.5**.**
For a representation of a group we consider its decomposition into irreducible components
[TABLE]
where denotes the multiplicity of in . This defines a probability measure on the set of irreducible representations given by
[TABLE]
With this definition in mind, each side of the identity (2) from Theorem 1.1 can be interpreted as the probability that an appropriate random Young diagram (which appears in Theorem 1.4) has a specified shape. This provides the link between Theorem 1.1 and Theorem 1.4.
1.7. Application: back to Landsberg’s problem
The problem of Landsberg is exactly a question about the statistical properties of the random Young diagram which appears in Theorem 1.4. This result gives an alternative description of in terms of the representation theory of the symmetric groups in which many asymptotic problems have well-known answers. Fortunately, this happens to be the case for the problem of understanding the restriction of irreducible representations which we encounter in Theorem 1.4.
In particular, the law of large numbers for the corresponding random Young diagrams has been proved in much wider generality by Biane [Bia98, Theorem 1.5.1] using the language of free cumulants of Young diagrams. The asymptotic Gaussianity of their fluctuations around the limit shape has been proved by the second-named author [Śni06, Example 7 combined with Theorem 8] using the same language.
In the specific case of the restriction V^{n^{m}}\big{\downarrow}^{\mathfrak{S}_{mn}}_{\mathfrak{S}_{p}} which is in the focus of the current paper, the above-mentioned generic tools [Bia98, Śni06] can be applied in the scaling when tend to infinity in such a way that the rectangle ratio converges to a strictly positive limit and the fraction converges to some limit. Pittel and Romik [PR07] have worked out this specific example and, among other results, found explicit asymptotic limit shapes of typical Young diagrams which contribute to such representations, see Figure 1. In the light of Theorem 1.4, the above references provide a partial answer to the question of Landsberg.
1.8. Hypothetical extensions of Theorem 1.4
The formulation of Theorem 1.4 might suggest that it is a special case of a more general result. We state it concretely as the following problem.
Problem 1.6**.**
Find a natural quantum random walk (in the spirit of Biane [Bia91]) on the set of irreducible representations (of some group? of some algebra?) with the property that the probability distribution on the set of paths of this random walk can be identified (via some hypothetical analogue of Theorem 1.4) with the uniform distribution on the set of standard Young tableaux of rectangular shape .
2. Proof of Theorem 1.1
First, we give an enumerative proof of Theorem 1.1 using the classical dimension formulas: the hook-length formula for
[TABLE]
where denotes the product of hook lengths in , and the hook-content formula for the dimensions of representations of :
[TABLE]
where is the hook-length of a box in the diagram of , and the content , if is at row and column of the diagram. Here is the corresponding Schur function.
Claim 2.1**.**
We have that
[TABLE]
for any , where is the complementary partition.
Proof.
By the combinatorial definition of Schur functions, we have that is the number of SSYTs of shape and entries . Consider such a SSYT as sitting inside the rectangular box containing . Each such a SSYT corresponds to a complementary SSYT of shape and entries via the bijection which we describe in the following.
In a given column of , let be the entries of in this column. Let be the remaining numbers in . Write them in increasing order top to bottom in the column in above as in Figure 2a; note that we use the French convention for drawing Young diagrams. Rotating the resulting tableau above by we obtain a SSYT of shape with entries in as in Figure 2b (the row inequalities are easily seen to be satisfied). ∎
Remark 2.2*.*
2.1 has also a purely representation-theoretic proof: the left-hand side of (5) is equal to the dimension of the representation of which corresponds to the Young diagram while the right-hand side is equal to the dimension of the tensor product of the one-dimensional representation with the representation contragradient to . Their dimensions are clearly equal.
We continue the proof of Theorem 1.1. Using the claim for we have that
[TABLE]
The last equality follows from the observation that , where the second complement is taken in the rectangle and so .
Consider the partitions and as sitting inside . More specifically, any box
[TABLE]
corresponds to the box
[TABLE]
see Figure 3, and so the content of regarded as a box of fulfills
[TABLE]
where the content is taken with respect to the partition.
Since (there is only one SSYT of shape and entries since each column is forced to be ), it follows from the hook-content formula (4) that
[TABLE]
Thus by (6), then by combining the diagrams and into the rectangle, and by (7)
[TABLE]
This concludes the proof of Theorem 1.1.
Remark 2.3*.*
Relationships between , and Schur function evaluations have also been derived by Stanley [Sta01] who used them further in computations of the normalized symmetric group character corresponding to rectangular partitions.
3. Proof of Theorem 1.4
3.1. Sketch of the proof
We start by presenting a one-paragraph summary of the proof. Schur–Weyl duality suggests exploring the link between the structure of the external power (1) viewed as a representation of some general linear group and the structure of the same space (1), this time viewed as a representation of the symmetric group . Regretfully, the external power (1) is not a representation of . This approach can be rescued if, instead, we view the external power as a module over the center of the symmetric group algebra. The character theory of the symmetric group can be easily adapted to the setting of . We will show that the characters of (for fixed values of and and for varying over ) are closely related to each other; in this way it is enough to identify such a character for . Yet another application of Schur–Weyl duality shows that this particular character is irreducible and corresponds to the rectangular Young diagram .
In the remaining part of this section we will present the details of the above sketch. For clarity the proof is split into a number of propositions.
3.2. Schur–Weyl duality. versus
Proposition 3.1**.**
The probability distributions of the following two pairs of random Young diagrams are equal:
- •
the pair of random Young diagrams which correspond to a random irreducible component of regarded as -module, and
- •
the pair of random Young diagrams which correspond to a random irreducible component of regarded as -module.
In the following we shall present the missing details of notation and the proof of this proposition.
The tensor power
[TABLE]
carries a natural structure of a -module and, more generally, a structure of a -module: the general linear group acts on all corresponding factors while the symmetric groups act by permuting the factors in the tensor product. Regretfully, its subspace
[TABLE]
which is in the focus in the current paper is not invariant under the action of the symmetric groups which are factors in
[TABLE]
and under the action of the corresponding symmetric group algebras . On the bright side, it is not difficult to check that the space (9) is invariant under the action of the center of the symmetric group algebra. Thus both (8) and (9) carry a structure of a -module. Our proof of Theorem 1.4 will be based on exploration of this module structure.
Proof of Proposition 3.1.
Consider the decomposition of the module (9) into irreducible components:
[TABLE]
where denotes the multiplicity, denotes the irreducible representation of the symmetric group which corresponds to the Young diagram and the sum runs over Young diagrams .
Schur–Weyl duality implies that a decomposition (analogous to (10)) of the tensor power (8) into irreducible components (no matter whether we regard (8) as a -module or as a -module) involves only summands for which and . It follows that the same is true for its -submodule (9), thus
[TABLE]
for some multiplicities .
The linear span of all irreducible components of (11) which correspond to a given pair of Young diagrams remains the same, no matter if we regard (11) as a -module or as a module. It follows that the corresponding probability distributions are equal. This concludes the proof of Proposition 3.1. ∎
Proposition 3.1 shows that in order to prove Theorem 1.4 it is enough to understand the structure of as a -module. We shall do it in the following.
3.3. Normalized characters
In this paper whenever we refer to a trace of a matrix we mean the normalized trace
[TABLE]
as opposed to the non-normalized trace
[TABLE]
For an operator we denote by its normalized trace, defined analogously.
Also, by the character of a group representation we mean the normalized character given by
[TABLE]
which is defined in terms of the normalized trace .
3.4. Modules over the center of the group algebra
In the following we will consider the following setup. We assume that is a finite group and is a -module. We also assume that is an idempotent with the property that commutes with the action of the center of the group algebra. We denote by the image of . The space is invariant under the action of ; in other words can be regarded as a -module.
We define the character of the -module as a function given by
[TABLE]
where denotes the action of on .
Our goal in this proof is to understand as a -module and to identify the corresponding character.
3.5. The key example
The key example we should keep in mind is the tensor product
[TABLE]
which carries a natural structure of -module, where
[TABLE]
is the Cartesian product of the symmetric groups which acts on by permuting the factors in the tensor product.
By rearranging the order of the factors we see that
[TABLE]
is a tensor power which carries another structure, this time of a -module. This action is related to the action from (14) via the diagonal inclusion of groups given by
[TABLE]
We consider the projection which is given by the action on (15) of the central projection
[TABLE]
which is not central.
The image of this projection is the external power
[TABLE]
which is in the focus of the current paper.
3.6. Modules over the center , revisited
Consider now a more general situation than in Section 3.4 in which is an arbitrary -module, without any additional structure.
We can define the character of by the formula
[TABLE]
Note that in the specific setup considered in Section 3.4 the formulas (13) and (19) define the same function.
Also, in the specific setup in which the structure of a -module on arises from the structure of a -module, the usual character of the group given by (12) coincides with the character from (19).
The algebra is commutative, hence each irreducible -module is one-dimensional. Each irreducible -module , viewed as a -module, is a direct sum of a number of copies of a single irreducible -module . Their characters are equal: .
More generally, there is a bijective correspondence between (equivalence classes of) irreducible -modules and (equivalence classes of) irreducible -modules; the characters of the corresponding modules are equal.
Any -module defines (analogously as in Definition 1.5) a probability measure on the set of irreducible representations of . Note that in the specific situation when the structure of a -module on arises from the structure of a -module, the corresponding measures are equal: , no matter if we regard as a -module or as a -module.
These probability measures are directly related to the character of the corresponding module:
[TABLE]
where is the minimal central projection which corresponds to the irreducible representation .
3.7. Characters of the external power do not depend on the exponent
We come back to the specific setup from Section 3.5. Assume that . There is a natural inclusion of the corresponding groups which allows us to compare the characters of the external powers for various values of the exponent .
Lemma 3.2**.**
For the character is equal to the restriction of the character .
Proof.
It is enough to prove this result in the case when .
Let . We denote by the corresponding permutations from the larger symmetric group; in this way corresponds to .
We consider the decomposition
[TABLE]
With respect to this decomposition, the action of on coincides with the action of :
[TABLE]
The projection viewed as in (17) as an element of can be written as the product
[TABLE]
where
[TABLE]
is a Jucys–Murphy element; above denotes the transposition which interchanges with . We view now (22) as an operator acting on (20); with this perspective
[TABLE]
is an element of .
A direct calculation on the elementary tensors shows that application of the (non-normalized) trace to the second factor in (23) yields a multiple of identity:
[TABLE]
By combining this idea with (21), (23) it follows that
[TABLE]
which concludes the proof. ∎
3.8. The character of
Until now we considered the symmetric group as the diagonal subgroup of via (16). In the following we take a different perspective and we shall view the symmetric group
[TABLE]
as the first factor in the Cartesian product.
In this way the space has a structure of a -module and a structure of a -module.
Corollary 3.3**.**
The character of -module is equal to the restriction of the irreducible character of the symmetric group which corresponds to the rectangular Young diagram .
Proof.
In the light of Lemma 3.2 it is enough to prove this result for the maximal possible value and to show the equality
[TABLE]
We shall do it in the following.
For the external power is a one-dimensional representation of which corresponds to a pair of Young diagrams
[TABLE]
The corresponding random pair of Young diagrams (associated via Definition 1.5) is deterministic, equal to (25). Proposition 3.1 shows that if we view as a -module, the corresponding pair of random Young diagrams is also deterministic, equal to (25). If we regard as -module, this implies that its character is equal to the character of the irreducible representation . This concludes the proof. ∎
3.9. Pair of random Young diagrams
One of the claims in Theorem 1.4 is that the random Young diagrams are related to each other by the equality . This result would follow from the decomposition (1). Below we present a short proof based on the original ideas of Howe [How95, Section 4.1.2].
For any permutations the action of on the external power coincides with the multiple of identity . It follows that
[TABLE]
By linearity, it follows that for the minimal central projections which correspond to the Young diagrams we have
[TABLE]
The left-hand side is equal to the probability of sampling the pair ; the right hand side vanishes unless which concludes the proof.
3.10. Stanley character formula
Remark 3.4*.*
It is easy to use the ideas presented in the above proof to find a new elementary proof of Stanley’s formula [Sta01, Theorem 1] for the character of the symmetric group which corresponds to the rectangular diagram ; for other proofs see also [Fér10, FŚ11]. More specifically, one should calculate the character directly by calculating the trace (13) in the standard basis of the tensor power and apply Corollary 3.3.
4. Outlook
We have to admit that in Section 1 we quoted only a part of the original question of Landsberg; in particular we have skipped the following more specific passage.
*[…] I am most interested in the case where is near . Is there a slowly growing function such that partitions with fewer than steps contribute negligibly? If so, can the fastest growing such be determined? *
Joseph M. Landsberg [Lan12]
It is not clear if the ideas presented in this note are sufficient to tackle this more specific problem. For more on this topic see the work of Sevak Mkrtchyan [Mkr17].
Acknowledgments
Research of PŚ was supported by Narodowe Centrum Nauki, grant number 2014/15/B/ST1/00064. Research of GP is partially supported by the NSF. We thank Paul Wedrich for pointing out the reference [How95]. We thank Vadim Gorin for an interesting discussion. Figure 1 has been provided by Dan Romik.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[BG 15] Alexey Bufetov and Vadim Gorin. Representations of classical Lie groups and quantized free convolution. Geom. Funct. Anal. , 25(3):763–814, 2015.
- 2[Bia 91] Philippe Biane. Quantum random walk on the dual of SU ( n ) SU 𝑛 {\rm SU}(n) . Probab. Theory Related Fields , 89(1):117–129, 1991.
- 3[Bia 95] Philippe Biane. Representations of unitary groups and free convolution. Publ. Res. Inst. Math. Sci. , 31(1):63–79, 1995.
- 4[Bia 98] Philippe Biane. Representations of symmetric groups and free probability. Adv. Math. , 138(1):126–181, 1998.
- 5[CNŚ16] Benoît Collins, Jonathan Novak, and Piotr Śniady. Semiclassical asymptotics of GL n ( ℂ ) subscript GL 𝑛 ℂ \operatorname{GL}_{n}(\mathbb{C}) tensor products and quantum random matrices. Preprint ar Xiv:1611.01892, 2016.
- 6[Fér 10] Valentin Féray. Stanley’s formula for characters of the symmetric group. Ann. Comb. , 13(4):453–461, 2010.
- 7[FŚ11] Valentin Féray and Piotr Śniady. Asymptotics of characters of symmetric groups related to Stanley character formula. Ann. of Math. (2) , 173(2):887–906, 2011.
- 8[How 95] Roger Howe. Perspectives on invariant theory: Schur duality, multiplicity-free actions and beyond. In The Schur lectures (1992) (Tel Aviv) , volume 8 of Israel Math. Conf. Proc. , pages 1–182. Bar-Ilan Univ., Ramat Gan, 1995.
