On polyhedral formulas for Kirillov-Reshetikhin modules
Chul-hee Lee

TL;DR
This paper introduces a new method to verify polyhedral formulas for Kirillov-Reshetikhin modules, especially in exceptional Lie types, using rational function identities and residue comparisons, with applications to types F4 and G2.
Contribution
It develops a novel, computer-assisted approach to prove polyhedral formulas for KR modules, simplifying verification through rational function residue analysis.
Findings
Verified polyhedral formulas for KR modules in types F4 and G2.
Provided a uniform, computational framework for checking these formulas.
Extended the method to cases where formulas are conjectural, aiding future proofs.
Abstract
We propose a method to prove a polyhedral branching formula for Kirillov-Reshetikhin (KR) modules over a quantum affine algebra. When the underlying simple Lie algebra is of exceptional type, such a formula remains conjectural in many cases. Using a linear recurrence relation satisfied by the characters of KR modules, we convert the verification of a polyhedral formula into an identity between two rational functions of a single variable with only simple poles at known locations. It is then sufficient to compare the residues at those poles, which are explicitly computable quantities. By applying this strategy, we obtain new, computer-assisted and easily verifiable proofs of known polyhedral formulas in types and within a uniform framework.
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.
Taxonomy
TopicsAlgebraic structures and combinatorial models · Nonlinear Waves and Solitons · Advanced Topics in Algebra
On polyhedral formula for Kirillov-Reshetikhin modules
Chul-hee Lee
School of Mathematics, Korea Institute for Advanced Study, Seoul 130-722, Korea
(Date: January 1, 2019)
Abstract.
We propose a method to prove a polyhedral branching formula for Kirillov-Reshetikhin modules over a quantum affine algebra. When the underlying simple Lie algebra is of exceptional type, such a formula remains mostly conjectural. We convert a polyhedral formula into an identity between two rational functions of a single variable with only simple poles at known locations. It is then sufficient to check the equalities of the residues at those poles, which are explicitly computable quantities. By following this strategy, we obtain a computer-assisted proof of a conjectural polyhedral formula in type .
1. Introduction
Let be a complex simple Lie algebra. The Kirillov-Reshetikhin (KR) modules constitutes an important family of finite-dimensional irreducible representations of the quantum affine algebra . An interesting problem is to understand how a KR module or their tensor product decomposes into irreducible -modules. The fermionic formula by Kirillov and Reshetikhin [KR87], proven through a series of works [HKO*+*99, Nak03, Her06, DFK08], gives an answer to this question by expressing the multiplicity of each irreducible summand as a certain combinatorial rule. However, it is difficult to use in practice, and it is often desirable to have a more explicit and computationally cheaper way of decomposing a single KR module.
If is of classical type, there is a well-known explicit formula called the domino removal rule. It is a polyhedral formula in the sense that the highest weight of an irreducible summand with non-zero multiplicity is characterized as a lattice point in a suitable bounded polyhedron. Even when is of exceptional type, a polyhedral formula still seems to exist, but an irreducible summand with multiplicity greater than one may appear. Such a formula with multiplicity remains largely conjectural [HKO*+*99], and furthermore, even a conjectural formula has not been written completely (for example, in type , , or ). In fact, the only known polyhedral formula with multiplicity is when is of type [CM07] by Chari and Moura. Since their method is rather specific to type , it seems difficult to adapt it to other cases in general.
In this paper, we propose a method to prove a polyhedral formula. The key objects in our approach are the coefficients that appear when the characters of KR modules are written in some exponential form. They are essentially the residues at the poles of the generating function of the characters of KR modules. It turns out that it is possible to decompose a polyhedral formula into a finite list of identities involving these coefficients; see (3.2). Our method seems quite appropriate for a computer-aided mechanical approach. The difficulty of the actual implementation, of course, varies according to the type of . As our main objective in mind is of exceptional type, such a mechanical approach could be justified.
After presenting the general strategy, we consider a special case when is of type . For each node of the Dynkin diagram of and , let us denote the corresponding Kirillov-Reshetikhin module, as a -module, by . We obtain a computer-aided proof of the following polyhedral formula conjectured in [HKO*+*99] :
Theorem 1.1**.**
Let be of type . For every , the following holds :
[TABLE]
where
[TABLE]
and .
Here we have used the same convention for enumerating the nodes of the Dynkin diagram as in [HKO*+*99].
This paper is organized as follows. In Section 2 we review the necessary background for our approach such as the -system, and linear recurrence relations satisfied by the characters of KR modules. In Section 3, we explain the steps for proving a polyhedral formula for KR modules. In Section 4, we follow the procedures described in Section 3 to give a proof of Theorem (1.1).
2. Background
notation
We will use the following notation throughout the paper.
- •
: simple Lie algebra over of rank
- •
: Cartan subalgebra of
- •
: index set for the Dynkin diagram of
- •
: simple root
- •
: simple coroot
- •
: fundamental weight
- •
: Cartan matrix with
- •
: weight lattice
- •
: set of dominant integral weights
- •
: root lattice
- •
: Weyl vector
- •
: highest root
- •
: set of positive roots
- •
- •
: -bilinear form induced from the Killing form with
- •
: integral group ring of (which is the same as the ring of Laurent polynomials in )
- •
: field of rational functions in with coefficients in
- •
- •
: coefficients in the expansion
- •
: simple reflection acting on by
- •
: Weyl group generated by
- •
: isotropy subgroup of fixing
- •
: standard parabolic subgroup of generated by
- •
: irreducible highest weight representation of
- •
: character of a finite-dimensional -module with weight spaces , i.e.
- •
: -orbit of
2.1. Some properties of characters of KR modules
KR modules form a family of irreducible finite-dimensional representations of the quantum affine algebra , where is not a root of unity. For every , there exists a corresponding KR module . By restriction, we obtain a finite-dimensional -module , which can be denoted by since its isomorphism class does not depend on , the spectral parameter, as a -module.
Let . The -system
[TABLE]
is a difference equation that the characters of the KR modules satisfy. Nakajima and Hernandez proved the -characters of KR modules satisfy the -system from which we obtain the -system (2.1) by ignoring the spectral parameter.
In [Lee18a], we studied a linear recurrence relation with constant coefficients that the sequence satisfies. We can summarize its main properties in terms of its generating function as follows :
Theorem 2.1** ([Lee18a, Theorem 1.1]).**
Let be a simple Lie algebra which is not of type or . For each , there exist -invariant finite subsets and of with the following properties :
- (i)
If we set , then
[TABLE]
is a polynomial in with coefficients in and . 2. (ii)
, where . 3. (iii)
.
Let us fix and as in the Appendix of [Lee18a]. When is simply-laced, is simply the set of weights of the fundamental representation . Note that (ii) shows that has only simple roots.
From the partial fraction decomposition of , we deduce that for each there exists such that
[TABLE]
and it vanishes unless either
- •
with ; or,
- •
with and .
Due to the -symmetry of , we have
[TABLE]
Let for and for and . We can rewrite (2.3) as
[TABLE]
For we have an explicit product formula.
Theorem 2.2**.**
[Lee18b]** For each ,
[TABLE]
Here, denotes the coefficient in the expansion .
We call (2.6) the Mukhin-Young formula, which is originally conjectured in [MY14]. We note that, in general, coefficients other than do not seem to admit an expression as compact as (2.6).
2.2. fermionic formula
The fermionic formula, proposed by Kirillov and Reshetikhin [KR87], concerns the decomposition of a tensor product of Kirillov-Reshetikhin modules into irreducible -modules. Let be a family of non-negative integers such that is zero for all but finitely many . Consider
[TABLE]
a tensor product of Kirillov-Reshetikhin modules, and its decomposition into irreducible -representations
[TABLE]
where denotes an irreducible -representation with highest weight . The fermionic formula provides an explicit combinatorial description of the multiplicity in terms of and . Since this formula is somewhat complicated and not essentially used in this paper, we refer the reader, for example, to [HKO*+*99] for its precise statement.
2.3. polyhedral formula
Let be the highest root of . Fix such that . It is shown in [Cha01] (see also [CM06]) that there exist positive integers , and dominant integral weights for some finite set such that
[TABLE]
where , and for each . When , we still expect to have a similar formula, but now with multiplicity, of the form
[TABLE]
where is a piecewise step-polynomial. A polyhedral formula for the decomposition of KR modules will mean a formula of the form (2.9).
The fermionic formula can be used to decompose for small individual ’s, from which we can observe patterns and guess the form of (2.9). And then, we need a separate argument to prove (2.9) since it is now a formula which is supposed to be true for all . In the next section, we explain an approach for a proof of (2.9).
3. framework for proving polyhedral formula
Let denote the character of the right-hand side of (2.9), i.e.,
[TABLE]
Here the letter is chosen from the word ‘polyhedron’. When there is such a polyhedral formula, consider its generating function
[TABLE]
which is expected to be a rational function in in general. Then, is equivalent to
[TABLE]
an identity between two rational functions.
We can state the steps necessary to prove (3.1) as follows :
- (i)
Prove that has at most simple poles, and the set of poles of is a subset of the set of poles of . Also make sure that the degree of the denominator of is greater than that of its numerator. 2. (ii)
Prove the equality of the coefficients
[TABLE]
when belongs to one of the following cases :
- •
with ;
- •
with and .
Recall that we already know explicitly where the poles of are located, which are always simple. We can deduce from (i) that can be written in the form
[TABLE]
with , which vanishes unless the non-vanishing conditions for , stated after (2.3), are satisfied.
Step (ii) is equivalent to showing that and have the same residues at their poles, which are simple at most. Since both and are -invariant, the coefficients follow the same -symmetry in (2.4). Hence, it is enough to consider weights in because every element of has a unique element in in its -orbit.
Once is explicitly given as in (2.9), it is more or less straightforward to compute and . For computing , we can use the -system (2.1) along with previously known with such that ; when there is a known polyhedral formula for , we can explicitly compute .
Suppose that we already have proved (i). Then another way to finish the proof of is by showing for since now we know that both sequences satisfy the same linear recurrence relation of order . Although it is a purely mechanical task to check for given using the fermionic formula, we have found that it is still computationally challenging for large. By considering and , we localize the problem in the sense that we are looking at a single pole at a time, and thus obtain further simplifications.
In a nutshell, it is possible to check both (i) and (ii) algorithmically. In the next section, we follow this strategy to prove a conjectural polyhedral formula in type , where we discuss some practical issues in our method in detail.
Remark 3.1**.**
We know that is invariant under from (2.4). When we explicitly compute , it is given as a sum over ; see (4.9) for an example. Thus we can regard (3.2) as a summation formula over for .
4. Proof of Theorem 1.1
Let be a simple Lie algebra of type . When or , there is a known polyhedral formula for . The formula for is given in (4.8) and will be used later. The main goal of this section is to prove Theorem 1.1, namely, the polyhedral formula for .
For , let be the character of the right-hand side of (1.1) and . By following the strategy outlined in Section 3, we will show that
[TABLE]
that is,
[TABLE]
as rational functions in .
Before turning to proofs, we present a table for and from [Lee18a]. Since they are -invariant, they are given as a disjoint union of -orbits of elements of :
[TABLE]
Throughout the section, denotes the Weyl denominator and . We often need to explicitly deal with or its subgroups. One may refer to [Sno90] for an algorithm to find the Weyl orbit of a weight or a minimal coset representative for a coset of a standard parabolic subgroup of a Weyl group. The accompanying Mathematica notebook file for some computer calculations is available at https://github.com/chlee-0/KR-polyhedral-formula.
4.1. Step (i)
From (2.2), it is clear that can have only poles of order at most 1 and they can only be found at . Let us find the poles of . To write explicitly, define a sequence by
[TABLE]
whose generating function is
[TABLE]
By combining this with the Weyl character formula, can be written as
[TABLE]
At this point, it is not entirely clear whether has only simple poles at or not. For example, may have a double pole at .
Consider the partial fraction decomposition of a summand in (4.2) :
[TABLE]
where , and and are polynomials of degree at most 1. They are uniquely determined by this form of decomposition. For example,
[TABLE]
Because these expressions are long but easy to find, we do not write them here; one can refer to the accompanying file for an explicit description.
Proposition 4.1**.**
We have
[TABLE]
Proof.
It is sufficient to show that for ,
[TABLE]
We may use computers to verify this directly. Below, we will explain how to reduce the amount of calculation to check (4.5). While this reduction is not essential as long as we focus on type whose Weyl group is manageable in size, it might be useful for treating a similar vanishing sum over bigger groups in other types.
For , . The parabolic subgroup of satisfies
[TABLE]
which implies the vanishing of the sum over since (4.5) can be written as
[TABLE]
where is the set of minimal coset representatives for cosets in .
Similarly, when , we have and the following sum over the parabolic subgroup vanishes :
[TABLE]
When , we have not found any proper parabolic subgroup of , over which the sum vanishes. However, if we let
[TABLE]
then the left-hand side of (4.5) becomes
[TABLE]
where is the set of minimal coset representatives for cosets in . The size of is 12, and it is possible to partition this set into 6 pairs of distinct elements so that the contribution from each pair to the above sum is zero. In other words, for each , there exists such that
[TABLE]
∎
This proposition immediately implies the following :
Proposition 4.2**.**
The rational function has only simple poles, possibly at , and no other poles.
Now we know that the poles of and can only appear at .
4.2. Step (ii)
It remains to carry out the second step of our strategy in Section 3 to prove (4.1). As is empty, we have to show
[TABLE]
for . We first explain how to compute both sides, and then check their equality. Let us write and .
how to calculate
Let us explain how to calculate . Recall the -system relation (2.1)
[TABLE]
for . By rewriting this relation using (2.5), we obtain an expression for in terms of :
[TABLE]
where .
To handle (4.6) explicitly, we need a way to compute and . And these are all we need to find because with non-zero is given by .
Lemma 4.3**.**
We have
[TABLE]
and
[TABLE]
Proof.
Note that is given by Theorem 2.2, the Mukhin-Young formula. To find , we can exploit the known polyhedral formula from [Cha01]
[TABLE]
By the Weyl character formula,
[TABLE]
where
[TABLE]
Therefore,
[TABLE]
∎
how to calculate
Recall that we have
[TABLE]
By Proposition 4.1, we can write as
[TABLE]
For a dominant weight , is a standard parabolic subgroup of . Once we enumerate the elements of , it is straightforward to compute . Of course, it becomes computationally easier to manipulate (4.9) when is a proper subgroup of . In this sense, the most difficult case arises when .
Now we can compute both (4.6) and (4.9) and thus, are ready to check for . To use (4.6) we need , as described below. The cases of do not bring much difficulty, and a computer can easily simplify and return zero. We give further comments on the case, which is the most difficult one.
4.2.1. case
[TABLE]
4.2.2. case
In this case, . Thus (4.6) gives
[TABLE]
In fact, this identity is a special case of [Lee18b, Corollary 3.5].
4.2.3. case
[TABLE]
4.2.4. case
Our goal is to check whether is actually zero, but this calculation is not quite straightforward as before, since they are quite huge rational functions. (4.6) can be rewritten as
[TABLE]
and . And involves an alternating sum of orbits of (4.4) over the entire Weyl group and hence, it is obtained by adding rational functions in .
It is slightly better to work with and to simplify their denominators. Let us consider
[TABLE]
We can rewrite the above as
[TABLE]
where denotes the set of minimal coset representatives of cosets in . Note that the size of is 96. Let
[TABLE]
In our computer calculation, we further considered a partition of into 9 disjoint subsets , say, . We can write (4.10) as
[TABLE]
Finally, we start with , subtract , and simplify the expression at each step . Once we subtract every summand, the result becomes be zero, as we wanted. On our desktop computer with a 3.50GHz CPU and 8GB of RAM, it took about 1450 seconds to complete this calculation. We note that the partition for we used is simply found through many computer experiments to reduce the time required to complete the calculation, and may be hardly optimal.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[Cha 01] V. Chari, On the fermionic formula and the Kirillov-Reshetikhin conjecture , Internat. Math. Res. Notices (2001), no. 12, 629–654.
- 2[CM 06] V. Chari and A. Moura, The restricted Kirillov-Reshetikhin modules for the current and twisted current algebras , Comm. Math. Phys. 266 (2006), no. 2, 431–454.
- 3[CM 07] by same author, Kirillov-Reshetikhin modules associated to G 2 subscript 𝐺 2 G_{2} , Lie algebras, vertex operator algebras and their applications, Contemp. Math., vol. 442, Amer. Math. Soc., Providence, RI, 2007, pp. 41–59.
- 4[DFK 08] P. Di Francesco and R. Kedem, Proof of the combinatorial Kirillov-Reshetikhin conjecture , Internat. Math. Res. Notices (2008), no. 7, Art. ID rnn 006, 57.
- 5[Her 06] D. Hernandez, The Kirillov-Reshetikhin conjecture and solutions of T 𝑇 T -systems , J. Reine Angew. Math. 596 (2006), 63–87.
- 6[HKO + 99] G. Hatayama, A. Kuniba, M. Okado, T. Takagi, and Y. Yamada, Remarks on fermionic formula , Recent developments in quantum affine algebras and related topics (Raleigh, NC, 1998), Contemp. Math., vol. 248, Amer. Math. Soc., Providence, RI, 1999, pp. 243–291.
- 7[KR 87] A. N. Kirillov and N. Yu. Reshetikhin, Representations of Yangians and multiplicities of the inclusion of the irreducible components of the tensor product of representations of simple Lie algebras , Zap. Nauchn. Sem. Leningrad. Otdel. Mat. Inst. Steklov. (LOMI) 160 (1987), no. Anal. Teor. Chisel i Teor. Funktsiĭ. 8, 211–221, 301.
- 8[Lee 18a] C.-h. Lee, Linear recurrence relations in Q 𝑄 Q -systems via lattice points in polyhedra , Transform. Groups (2018), (to appear).
