AN ELEMENTARY APPROACH TO THE MACDONALD IDENTITIES* DENNIS STANTON

AN ELEMENTARY APPROACH TO THE MACDONALD IDENTITIES* DENNIS STANTON Abstract. Elementary proofs are given for the infinite families of Macdonald identities. The reflections of the Weyl group provide sign-reversing involutions which show that all terms not related to the constant term cancel.. Introduction. The purpose of this paper is to give an elementary approach to the Macdonald identities, accessible to all combinatorialists. Sign-reversing involutions have been used recently on a variety of combinatorial problems. The Macdonald identities can be proved with such involutions, we give the details in this paper. The basic idea of the proof does not differ from Macdonald s original proof for affine root systems [7]. Since that paper can be difficult for a novice in root systems, we offer an elementary approach for the infinite families of affine root systems. This approach was used in [9] to find new Macdonald identities in the low rank cases. The Macdonald identities [7] are the analogues of the Weyl denominator formula for affine root systems. The Weyl formula [7] expresses a finite sum as a finite product for root systems R: (. w W det(we w(ρ ρ = ( e a. a>0 a R For type A n, (. is just Vermonde s determinant: a determinant, which is a sum of n! terms, can be written as a product of n(n /2 terms. Vermonde s determinant can be proved by using the antisymmetry of the product to eliminate all terms in the expansion which have equal exponents. This leaves terms with different exponents (the n! terms of the determinant. Their coefficients can be found by finding any one coefficient, using the antisymmetry. The same program works to prove the Macdonald identities. We are exping infinite products instead of finite ones, so first we need to reduce the problem to a finite one. Then we use antisymmetry to show that all of the terms cancel, except for those related to a single term. Finally, we find the coefficient of that term. These three steps, their relation to the Macdonald identities, are explained at the end of 2. For the Weyl denominator formula the sign reversing involutions can be interpreted as acting upon combinatorial objects related to the root system [2],[3]. Since School of Mathematics, University of Minnesota, Minneapolis MN 55455. Typeset by AMS-TEX

2 DENNIS STANTON the same program works for the Macdonald identities, there should be combinatorial models proofs in this case too (see [2]. Asummaryoftherecentworkinthisareacanbefoundin[6]or[]. Twopapers related two special functions are [8] [5]. The very recent work of Gustafson [4] should also be consulted. The rest of the paper is organized in the following way. The Macdonald identities for affine root systems are stated in 2. We also explain the three main steps of the proof there. These steps are completed for types C n B n in 3 4. We have included type B n because the evaluation of the constant term is slightly different from type C n. Nevertheless, all of the infinite families have arguments similar to type B n or C n. These identities are explicitly given in 5. 2. Notation. In this section we establish the notation for the affine root systems, Weyl groups, functions to be considered for the Macdonald identities. Root systems are certain finite subsets of Euclidean n-space; thus a root is a vector, or dually a linear functional on Euclidean n-space. An affine root can be thought of as an affine functional, that is, a root plus a constant. An affine root system is a set of affine roots that satisfies certain conditions [7]. These conditions will not concern us, since we will use the explicit form of the infinite families of affine root systems. Macdonald [7, Appendix ] lists the reduced irreducible affine root systems S. Each such system S is attached to a finite root system R, thus S = S(R, can be explicitly given. We let {e,...,e n } be the stard basis for Euclidean n-space. For example, if R = C n (n 2, then (2. S(C n = {k ±2e i : k Z, i n} {k ±e i ±e j : k Z, i < j n}, The Macdonald identities exp the product (2.2 F(S = a>0 a S ( e a as a sum. For (2.2 to make sense, some roots in S must be positive others negative. This is defined by taking a certain basis for S, B = {a 0,...,a n }, so that any element of S has coefficients with respect to B that are all non-positive or all non-negative. For S(C n, a 0 = 2e, a n = 2e n, a i = e i e i+, i n. We also can choose the a i s so that n i=0 k ia i = c for unique positive integers k i with no common divisor. For C n, c =. The expansion of (2.2 takes place in the formal series ring Z[[e a 0,e a,...,e a n ]]. It will be more natural to consider the factors in (2.2 as functions of = e e i q = e c. (Macdonald labels e c with X. In this paper we put (2.3 F S (x,...,x n,q = a>0 a S Let (2.4 (x;q = ( e a ( xq i. i=0

AN ELEMENTARY APPROACH TO THE MACDONALD IDENTITIES* 3 We frequently will write (x for (x;q. Then (2., (2.3, (2.4 imply (2.5 n F Cn (x,...,x n,q = (/x 2 i (qx 2 i (/ x j (q x j (x j / (q /x j Clearly (2.5 can be interpreted as an element of the formal power series ring A[[q]], A = Z[x,...,x n,x,...,x n ]. This implies that, for some f(m,...,m n,q Z[[q]] (2.6 F Cn (x,...,x n,q = f(m,...,m n,qx m...x m n n. m,...,m n = In fact we shall see that (2.6 converges as a complex function of (x,...,x n for all x,...,x n, 0, if q < is fixed. The basic reason is that f(m,...,m n,q converges quadratically in q. Our proof will explicitly find f(m,...,m n,q. At first glance (2.6 appears different from Macdonald s [7, (0.4] as an element of A[[q]]: (2.7 P(qF S (x,...,x n,q = µ M χ(µq ( µ+ρ 2 ρ 2 /2g where P(q Z[[q]], M is a certain lattice in R n, g is a fixed constant, ρ is the half sum of positive roots of R. The function χ(µ is given by (2.8 χ(µ = w W det(we w(µ+ρ ρ where W is the Weyl group of R, det(w is the sign of w. The x-dependence in (2.7 is contained in χ(µ. In the course of the proof we identify M, g, χ(µ for each type R. We shall see that the proof also clearly gives (2.7. There are three basic steps to the proof. (I UsetheaffinepartoftheaffinerootsystemS(Rtofindfunctionalequations forf S (x,...,x n,qorf(m,...,m n,q. Thesefunctionalequationsreduce the unknown functions f(m,...,m n,q to a finite number, in effect, just a fundamental domain for the lattice M. The number g is also found in this step. (II Use the Weyl group W of the finite root system R, to show that only one function, f(0,0,...,0,q, is necessary. Sign-reversing involutions are given by W which show that all other terms are either zero, or a multiple of this constant term. The action w µ = w(µ+ρ ρ is identified here. (III The constant term f(0,0,...,0,q is found by specializing the identity in (II. We use a specialization which is simpler than Macdonald s. We carry out this program for types C n B n 3 4. 3. Type C n (n 2. Once we have fixed the affine root system, we shall drop the type S from the function F S (x,...,x n,q. We also suppress the q dependence. So for type C n n F(x,...,x n = (/x 2 i (qx 2 i (/ x j (q x j (x j / (q /x j.

4 DENNIS STANTON For step (I, let S(C n + be the positive affine roots of S(C n, S i (C n + be the elements of S(C n + with e i replaced by e i. It is easy to check from (2. that, except for signs, S(C n + S i (C n + = S i (C n + S(C n +. This shows that F(x,...,q,...,x n is closely related to F; in fact (3. F(x,...,q,...,x n x 2n+2 i q 2n i+2 = F(x,...,x n which implies (3.2 f(m,...,m n,q = f(m,...,m i 2n 2,...,m n,qq m i i. So f is uniquely determined by f(m,...,m n,q, 0 m i 2n+, M = {(2n+ 2(m,...,m n : m i Z}. Let the fundamental domain FD = {(m,...,m n : 0 m i 2n+, i n}. This finishes (I. For (II, note that the Weyl group of type C n is the hyperoctahedral group W = {(σ,π : σ S n,π Z n 2}. The generators of W are the transpositions σ i = ((i,i+,id, i n, σ n = (id,(,...,,, which changes the sign of the last coordinate. So we see that (3.3a + F(x,...,+,,...,x n = F(x,...,x n (3.3b x 2 n F(x,...,x n,/x n = F(x,...,x n. Clearly (3.3a (3.3b are equivalent to (3.4a f(m,...,m n,q = f(m,...,m i+,m i +,...,m n,q (3.4b f(m,...,m n,q = f(m,..., m n 2,q. Thus, for w = (σ,π W, f(m,...,m n,q = det(wf(w(m,...,m n,q where the ith component of w(m,...,m n is (3.5 w(m,...,m n (i = π(i(n+ σ(i+m σ(i (n+ i. Since ρ = (n,n,...,, we see that w(m,...,m n = w(µ + ρ ρ if µ = (m,...,m n. This is precisely the action given by Macdonald in (2.8. Our goal is to show that all terms f(m,...,m n,q in FD are zero, except for those corresponding to a W orbit of (0,...,0. Thus we need to find the representative of wµ in FD. We define m = (m,...,m n (m,...,m n = m if m m M.

AN ELEMENTARY APPROACH TO THE MACDONALD IDENTITIES* 5 Proposition 3.6. (i For µ,µ M, w,w W, if wµ = w µ, then µ = µ w = w. (ii For µ M, w,w W, if wµ w µ then w = w. Proof. Both assertions are clear from (3.5. A consequence of Proposition 3.6(ii is that the W-orbit of (0,0,...,0 contains n!2 n inequivalent elements, which can be mapped to FD. We now show that all other (m,...,m n FD satisfy f(m,...,m n,q = 0. To do this we use the reflections of W: the transpositions ((ij,(,,..., i < j n, the inversions e i e i, θ ij : e i e j, e j e i. If w(m,...,m n (m,...,m n for any of these elements w, which all have det(w =, then f(m,...,m n,q = 0. Proposition 3.7. The number of (m,...,m n FD which satisfy (i m i m j +i j mod 2n+2, (ii m i 2i m i mod 2n+2, (iii m i i+j m j mod 2n+2, for all i j n is n!2 n. Proof. Let m i = m i i, so that (i (iii becomes m i ± m j mod 2n + 2, i j, (ii becomes m i 0 or n+ mod 2n+2. The remaining residue classes mod 2n + 2 for m i are {(,2n +,...,(n,n + 2} so there are n!2 n solutions ( m,..., m n. Clearly, Propositions 3.7 3.6(i, (3.2 imply that (3.8 F(x,...,x n = c(q µ M χ(µx m (2n+2... x m n(2n+2 n q n [(m i + 2 (2n+2 im i ] where µ = (2n+2(m,...,m n. This agrees with (2.7. For (2.6, we note that the W-orbit of µ = (0,0,...,0 is w(ρ ρ. The Weyl denominator formula evaluates this sum (3.9 w W Combining (3.9 with (3.2, we have F(x,...,x n = c(q (3.0 n ( det(we wρ ρ = ( e a = (x,...,x n. a>0 a R x (2n+2m...x (2n+2m n n q n ( m i + 2 (2n+2 im i (m,...,m n = x 2 i q2m i ( x j q m i+m j ( x jq mj mi. Note that the inner product is (x q m,...,x n q m n. This completes step (II. It remains to evaluate the constant term c(q. Clearly (0,...,0 is the only element of FD all of whose entries are 0 mod 2n+2. So we just (2n+2-sect both sides of (3.0, i.e. replace each by ω j, 0 j 2n+, ω = exp(2πi/(2n+2 add.

6 DENNIS STANTON Under this operation the right side is evaluable by the Jacobi triple product identity [] to (3. RS = (2n+2 n c(q(q 2n+2 ;q 2n+2 n ( q /( q n+ ;q n+. For the left side, note that F(x,...,x n = 0 unless x j, x j, x 2 i. So each = ω j, where j {,2n+,2,2n,...,n,n+2}. As in Proposition 3.7, there are n!2 n such n-tuples (x,...,x n, which are precisely the orbit of W on (ω,ω 2,...,ω n. Since F(x,...,x n / (x,...,x n is invariant under W, the left side is (3.2 LS = F(x,...,x n w W w (x,...,x n at (ω,ω 2,...,ω n The Weyl denominator formula (3.9 implies (3.3 w W so that the left side becomes (3.4 LS = w (x,...,x n = (x,...,x n (/x,...,/x n n (ω 2i (ω 2i (ω i j (ω i+j (ω j i (ω i j. It is easy to see that the factor (ω k, 0 k 2n+, occurs n times if k is odd, n times if k is even. There is also an additional (ω n+ factor. Since 2n+ ( ωi = 2n+2, the left side becomes (3.5 LS = 2(2n+2 n (n+( q (q 2n+2 ;q 2n+2 n (q n+ ;q n+ /(q n. Combining (3.5 (3., we have (3.6 c(q = q/(q n. This completes step (III. 4. Type B n (n 3. For type B n we proceed in the same way. However the lattice M must be slightly modified if the analogues of Propositions 3.6 3.7 are to be true. In this case F(x,...,x n = (/ (q Instead of (3.-(3.4 we have (/ x j (q x j (x j / (q /x j (4. F(x,...,q,...,x n x 2n i q 2n i = F(x,...,x n, (4.2 f(m,...,m n,q = f(m,...,m i 2n+,...,m n,qq m i i+,

AN ELEMENTARY APPROACH TO THE MACDONALD IDENTITIES* 7 (4.3a + F(x,...,+,,...,x n = F(x,...,x n, (4.3b x n F(x,...,x n,/x n = F(x,...,x n, (4.4a f(m,...,m n,q = f(m,...,m i+,m i +,...,m n,q, (4.4b f(m,...,m n,q = f(m,...,m n, m n,q. The lattice M is replaced by M = {(2n (m,...,m n : m i Z}. The Weyl group action is (4.5 w(m,...,m n (i = π(i(n+/2 σ(i+m σ(i (n+/2 i where w = (σ,π as in type C n. Again this is the action w(µ + ρ ρ. This completes step (I. Proposition 3.6(ii is not true for M: there are non-zero elements of W which map M to itself, e.g. w = (id,(,,...,. However, if we restrict M to M = {(2n (m,...,m n : m i Z,m + +m n 0 mod 2} then Propositions 3.6(i (ii are true. As a fundamental domain take FD = {(m,...,m n : 2n m 2n 2,0 m i 2n 2,2 i n}. Again we show that there are n!2 n elements of the orbit (0,0,...,0 of D not fixed by a reflection. The conditions that replace those in Proposition 3.7 are m i i m j j (mod 2n,m i 2n +2i m i (mod 4n 2, m i i j m j 2n (mod 2n. If we put m i = m i i+ these are m i ± m j, i j. So for 0 m i 2n 2, the classes {(0,(,2n 2,...,(n,n} give n!2 n solutions. Allowing 2n m gives n!2 n + n!2 n = n!2 n solutions (m,...,m n. This establishes (2.7, (2.6 becomes F(x,...,x n = c(q µ M x (2n m...x (2n m n n q n ( m i + 2 (2n (i m i (4.6 n ( q m i ( q m i m j x j ( x jq mj mi. This completes step (II. For step (III, if we were to (2n -sect the right side of (4.6, the product (x q m,...,x n q m n would contain two terms: (x q m 2n. If we put each = ω j, 0 j 2n 2, ω = exp(2πi/(2n, sum, we obtain (4.7 RS = c(q(2n n µ M q n ( m i + 2 (2n (i m i,

8 DENNIS STANTON which is evaluable by the Jacobi triple product formula to (4.8 RS = (2n n c(q(q 2n ;q 2n n ( ;q 2n ( q. On the left side, again x j or x j, so the residue classes are {(0,(,2n 2,...,(n,n}. Thus, n!2 n valuesareallowedfor(x,...,x n. Sinceω 0 = ω 0, we again can average over all of W if we divide by 2. Equation (3.3 implies (4.9 LS = n ( ω i ( ω i (ω 2 i j (ω i+j 2 (ω j i (ω i j. 2 In (4.9, (ω k, k 2n 2, occurs n times, so 2n 2 (+ωi = implies (4.0 LS = 2 (2n n (q 2n ;q 2n n 4( q ( q 2n ;q 2n /(q n Clearly (4.8 (4.0 imply (4. c(q = /(q n. 5. The other infinite families. We give the Macdonald identities for types A n, D n, Bn, Cn, BC n in the form of (2.6. Type A n (n 2 (5. F(x,...,x n = (x j / (q /x j. (5.2 F(x,...,x n = c(q µ Mx nm...x nm n n q n 2 nm2 i +m i(n+ 2i ( x j q m j m i / where (5.3 M = {n(m,...,m n : m i Z, Type D n (n 4 (5.4 F(x,...,x n = c(q = /(q n. n m i = 0}, (x j / (q /x j (/ x j (q x j F(x,...,x n = c(q µ M x (2n 2m...x (2n 2m n n q n ( m i + 2 (2n 2 (i m i (5.5 ( x jq m j m i ( q mi mj x j

AN ELEMENTARY APPROACH TO THE MACDONALD IDENTITIES* 9 where (5.6 M = {(2n 2(m,...,m n : m i Z, (5.7 c(q = /(q n. n m i 0 (mod 2} Type Bn (n 3. (5.8 n F(x,...,x n = (/x 2 i;q 2 (q 2 x 2 i;q 2 (/ x j (q x j (x j / (q /x j. F(x,...,x n = c(q µ Mx 2nm...x 2nm n n q n ( m i + 2 2n (i m i (5.9 n ( x 2 i q2m i ( x jq m j m i ( q mi mj x j where (5.0 M = {2n(m,...,m n : m i Z, n m i 0 mod 2} (5. c(q = /(q n (q 2 ;q 2 Type C n (n 2 (5.2 n F(x,...,x n = (/ ;q /2 (q /2 ;q /2 (/ x j (q x j (x j / (q /x j F(x,...,x n = c(q µ Mx 2nm...x 2nm n n q n ( m i + 2 2n (i /2m i (5.3 n ( q m i ( q m i m j x j ( x jq mj mi where (5.4 M = {2n(m,...,m n : m i Z}

0 DENNIS STANTON (5.5 c(q = /(q n (q /2 ;q /2. Type BC n (n (5.6 F(x,...,x n = n (/ (q (qx 2 i;q 2 (q/x 2 i;q 2 F(x,...,x n = c(q µ M n ( q m (5.7 i where (/ x j (q x j (x j / (q /x j. x (2n+m...x (2n+m n n q n ( m i + 2 (2n+ im i ( q m i m j x j (5.8 M = {(2n+(m,...,m n : m i Z} (5.9 c(q = /(q n. ( x j q m j m i A few remarks are in order. For each type, the sum over µ M refers to the allowed (m,...,m n in M. For type D n, the constant term is evaluated as in type B n. The non-trivial element of W which maps M to M is (id,(,,...,,. A (2n 2-section inserts +q 2m (n for the inner product on the sum side. This changes the sum to one over M which is evaluable by the Jacobi triple product identity. In type B n a 2n-section fails to evaluate c(q. For F(x,...,x n 0 we need x 2, x j orx j, if = ω j, ω = exp(2πi/2n, thisisimpossible. Instead, we 2n-sect over x 2,...,x n fix x. The product is replaced by (x q m 2n, which changes the sum to M inserts a factor of ( m + +m n. So, here we have (5.20 RS = c(q(2n n (q 2n ;q 2n n (q ( q n ;q n (/x 2n ;q 2n (q 2n x 2n ;q 2n. The left side has (n!2 n terms, which is the Weyl group action on (x 2,...,x n evaluated at (ω,ω 2,...,ω n. For any such choice of (x 2,...,x n it is clear that (5.2 ( n x 2 ( x j ( = x x x j x 2n. j=2 So we can apply (3.6 for type C n to conclude that LS = ( (5.22 x 2n n (q 2 /x 2 ;q 2 (q 2 x 2 ;q 2 (ω 2(j ;q 2 (ω 2(j ;q 2 (qx ω j (qx ω j 2 i<j n j=2 (qω 2 i j (qω i+j 2 (qω j i (qω i j.

AN ELEMENTARY APPROACH TO THE MACDONALD IDENTITIES* It is not hard to see that (5.22 is (5.23 LS = (/x 2n ;q 2n (q 2n x 2n ;q 2n (q 2n ;q 2n n (2n n ( q /(q n 3 (q n ;q n (q 2 ;q 2 2. Finally, (5.20 (5.23 give (5.. Macdonald s form (2.7 also follows in these cases. References. G. Andrews, The Theory of Partitions, Addison-Wesley, Reading, 976. 2. D. Bressoud, Colored tournaments Weyl s denominator formula, Eur. J. of Comb. 8 (987, 245 255. 3. R. Calderbank P. Hanlon, The extension to root systems of a theorem on tournaments, J. Comb. Th. A 4 (986, 228 245. 4. R. Gustafson, A generalization of Selberg s integral, research announcement. 5. R. Gustafson, The Macdonald identities for affine root systems of classical type hypergeometric series very-well-poised on semisimple Lie algebras, preprint. 6. Laurent Habsieger, MacDonald conjectures the Selberg integral, Dennis Stanton (ed., q-series Partitions, IMA Volumes in Mathematics its Applications, Springer-Verlag, New York, 989. 7. I. Macdonald, Affine root systems Dedekind s η-function, Inv. Math. 5 (972, 9 43. 8. S. Milne, An elementary proof of the Macdonald identities for A (, Adv. Math. 57 (985, 34 70. 9. D. Stanton, Sign variations of the Macdonald identities, SIAM J. Math. Anal. 7 (986, 454 460. 0. J. Stembridge, A short proof of Macdonald s conjecture for the root systems of type A, Proc. AMS 02 (988, 777 786.. D. Zeilberger, A unified approach to Macdonald s root-system conjectures, SIAM J. Math. Anal. 9 (988, 987 03. 2. D. Zeilberger D. Bressoud, A proof of Andrews q-dyson conjecture, Disc. Math. 54 (985, 20 224.