THE FACTORIZATION OF A POLYNOMIAL DEFINED BY PARTITIONS

THE FACTORIZATION OF A POLYNOMIAL DEFINED BY PARTITIONS ROBERT P LANGLANDS Introduction It is best to work with unordered partitions Thus if k is a positive integer, a partition of length r of the interval [0, k] is a sequence, 0 = k 0 < k < < k r = k, of positive integers Set k = k k i Fix k, and let x, Y, and be three indeterminates From the polynomial P k x, Y, ) given by r x k r k i + Y + k i k i ) ) r k i k ) {k,,k r } i= In the summation r is not fixed, so that the sum runs over all unordered partitions of k The polynomial is of degree k in Y, and the coefficient of Y k is k )! ) 2 It can be factored explicitly For this it is convenient to write = h p,q m) = m + )p mq)2 4mm + ) Observe that if m 0, then, given, this equation can always be solved for p and q Set Y s m) = k) 2 p q + s) 2) m 2 + 2 k) p q + s)p)m + p 2) /4mm + ) = h,k m) h p,q s m), Y r m) = k ) 2 p r q) 2) m 2 + 2 k )k p r q)p r) ) m + k 2 p r) 2) /4mm + ) = h k, m) h p r,q m) Theorem a) If m is defined by x = m/m + ) and if = h p,q m), then P k x, Y, ) = k )! ) 2 Y Ys m) ) s <k s k mod 2) b) If m is defined by x = m + )/m and if = h p,q m), then P k x, Y, ) = k )! ) 2 Y Y r m) ) Appeared in Commun Math Phys vol 24 989) r <k r k mod 2) i=

2 ROBERT P LANGLANDS The purpose of this paper is to prove this theorem As is explained in an appendix, it has its origins in the theory of the Virasoro algebra and conformally invariant quantum fields Thanks are due to Y Saint-Aubin for explaining to me the formulas A), A2) proved by him and Benoit in [BSA], for they were the starting point of this paper, to W Casselman for a number of conversations and, in particular, for checking the critical Identity 24 on the computer long before I was able to prove it, to Lyman Hurd for instruction in the use of the computer, and to W-C Hsiang for avuncular advice about the title 2 Simple Reductions The two parts of the theorem are equivalent They are both stated, because they are both to be used in the Appendix If m = m then m + m = m m + and h p,q m) = h q,p m ) for all p, q Thus upon interchange of p and q the expression Y s m ) becomes Y sm) It is enough to prove the first statement of the theorem We begin with a sequence of observations, stated as lemmas To indicate the dependence of Y s m) on k we write Ys k m) Lemma 2 Ys k+2 m) = Ys k m) k + )x The difference Ys k+2 m) Ys k m) is seen upon inspection to be k + ) 2 k ) 2 )m 2 2k + ) k ))m 4mm + ) Lemma 22 The product is equal to = km m + Y Y k+2 k+ m)) Y Y k+2 k m)) Y + )Y + + k + ) + k + )x Y + k + 2) ) The lemma is tantamount to two assertions: = k + )m m + Y k+2 k+2 k+ m) + Y k m) = 2 k + ) k + )x; Y k+2 k+2 k+ m) + Y k m) = + k + ) + k + )k + 2)x The sum on the left of the first identity is equal to 2p q) 2 m 2 4k + )m 4p q)pm + 2 p 2 ) ) /4mm + ) Since = p q) 2 m 2 + 2p q)pm + p 2 ) /4mm + ), the first equality is immediate For the second, one observes that the product on the left is p q) 2 m 2 + 2 k + ) + p q)p ) m + p 2 ) 2 4k + ) 2 p q)m 2 + pm ) 2) /6m 2 m + ) 2

THE FACTORIZATION OF A POLYNOMIAL DEFINED BY PARTITIONS 3 and this is + k + ) 2 k + ) 2 + /4mm + ) ) m/m + ) 2m + ) The second equality follows Lemma 23 a) P x, Y, ) = Y Y0 m), b) P 2 x, Y, ) = Y Y m) ) 2 Y Y 2 m) ) The first assertion is clear; the second follows from the previous lemma and a direct calculation of P 2 x, Y, ) as Y + + )Y + ) + xy + 2 ) Theorem a) is thus seen to be equivalent to the validity of the following identity Identity 24 The polynomial P k+2 x, Y, ) is equal to the product of ) 2Pk ) 2a) kk + ) x, Y + + k + )x, and Y + )Y + + k + ) + k + )x Y + k + 2) ) Fix r > 2 and consider on both sides of the identity the coefficient of x k r On the left it is P r+2 k+2 Y, ), the sum over all partitions {k,, k r+ } of [0, k + 2] into r + 2 intervals of the expression r+2 k i + Y + k i k i ) ) r+2 k i k i) i= Since k i k i = k i k i, this equals 2b) i= r+2 Y + k i ) + )Y + k ) ) r+ k i k i) i= If S r k Y +, ) is the coefficient of xk r in 2a) then the coefficient of x k r on the right side of the identity is 2c) S r ky +, )Y + )Y + + k + ) + S r+ k Y +, )k + ) Y + k + 2) ) We fix k and r, and show that the coefficients x k r on both sides of the identity are equal 3 Further Reductions To calculate Sk r Y, ) we have to expand the products s k i + Y + k + )x + k i k i ) ), x k s i= retaining only the coefficient of x k r Thus we obtain a sum over all partitions of k and over all subsets Σ with r elements of those partitions of 3a) k + ) s r i Σ i= k i + Y + k i k i) ) s k i k i) i=

4 ROBERT P LANGLANDS Observe that r is fixed but that s varies from term to term in the sum The notation i Σ is abusive It is the interval I = [k i, k i ] that belongs to Σ Let e I = k i, e I = k i The union of the intervals I in Σ may or may not cover [0, k] There will be a certain number gσ) of open intervals or gaps left uncovered We divide the endpoints θ of the intervals in Σ into four types, the extreme, the bound, the left free, the right free The corresponding sets will be denoted Θ e, Θ b, Θ lf, Θ rf The endpoint θ will be said to be extreme if it is 0 or k, to be left free if it separates a gap on its left from an interval of Σ on its right, to be right free if it separates an interval on its left from a gap on its right, and to be bound if it is a common endpoint of two intervals in I Lemma 3 The coefficient Sk r Y +, ) is the sum over all Σ with r elements of the product of k + ) gσ) 2 Y + k + 2 ei + ) ) + )Y + e I + ) ) I Σ and { } k θk θ) k θ)k + + θ) θθ + ) Θ e Θ b Θ lf Θ rf The product in the first factor is obtained by writing k i + Y + + k i k i) = Y + k + 2 e I + ) ) + )Y + e I + ) The factor k + ) 2 is extracted from the factor kk + ) ) 2 in 2a) Ignoring it, we have to evaluate the sum over all partitions containing a given Σ of 3b) s k 2 k + ) s r k i k i) The partitions containing Σ are obtained by partitioning all the gaps Thus the sum of the expressions 3b) is the product of { } k θk θ) Θ e Θ b with the product over all gaps of 3c) aa + h)a a + h) ) a + j) a + h j) a + a + h + ) A + A j A Here a is the left endpoint of the gap, a is the distance of its right endpoint from k, and h its length, so that k = a + a + h If one of a or a is 0, it is to be omitted from the factor preceding the sum, which runs over all subsets of {,, h } The expansion 3c) is the product of k + with aa + h)a a + h) ) h Upon simplification this become aa + h)a a + h) ) h j= j= i= + a + a + h + a + j)a + h j) a + j + )a + h j + ) a + j)a + h j) ) = aa a + )a + )

THE FACTORIZATION OF A POLYNOMIAL DEFINED BY PARTITIONS 5 The lemma follows Notice that if, for example, a = 0 then it is to be omitted, and a + = ; so the right side of this equality is /a a + ) The expression 2b) is equal to Y + k + 2 ei ) + )Y + e I) ) r+ k i k i) I The first product is over the intervals in the partitions We expand this product by writing each of the linear factors in the first product as a sum of four terms: Y + k + 2); e I ; )Y ; )e I To these we attach respectively the labels:, 0);, );, 0);, ); or often, and preferably, the symbols: ; ; ; The labels or the symbols are to be regarded as attached to the interval defining the linear factor, so that the label may be written αi), µi) ) The first term defines the direction of the arrow The whole collection of symbols defines a diagram 3d), the lengths of the arrows being the lengths of the partitions Let a, a, b, b be the number of arrows of the four types, so that a + a + b + b = r + 2 Then P r+2 k+2 Y, ) may be written as ) a a +a ) b +b Y + k + 2) a Y b P k+2 a, a, b, b) a,a,b,b The expression P k+2 a, a, b, b) is the sum over all diagrams 3d) for which a, a, b, b have the given values of AI), I where AI) = e µi) I e I if I is negatively oriented, and AI) = e µi) I e I if it is positively oriented It is again understood that e I or e I is suppressed if it is 0 Moreover, those diagrams for which the initial interval is of type or the final interval of type are excluded from the sum It is clear from Lemma 3 that Sk r Y +, ) has a similar expansion ) a a +a ) b +b Y + k + 2) a Y b S k a, a, b, b), a,a,b,b where now the constraint on a, a, b, b is that a + a + b + b = r If any of a, a, b, b is negative then S k a, a, b, b) is understood to be 0 Observe that Y + )Y + + k + ) is equal to the sum of 2 Y + k + 2) 2 + 2 )Y Y + k + 2) + ) 2 Y 2, )k + ) 2 )Y k + ) + )Y + k + 2)k + ), and 2 Y + k + 2)k + ) + ) 2 k + ), while Y + k + 2) = Y + k + 2) + )Y Thus the identity is a result of the following lemma i=

6 ROBERT P LANGLANDS Lemma 32 P k+2 a, a, b, b) is equal to the sum of the four expressions: S k a 2, a, b, b) + 2S k a, a, b, b) + S k a, a, b 2, b); k + ) 2 S k a, a,b, b ) + k + )S k a, a, b, b ) + k + )S k a, a, b, b); k + )S k a, a, b, b ) + k + )S k a, a, b, b); and k + )S k a, a, b, b) + k + )S k a, a, b, b) If we ignore the length of the arrows in 3d) we obtain diagrams in which only the direction and the type of arrow is significant Given such a diagram, we let P ) be the sum over all partitions and labelings of type of I AI) To each diagram we can attach integers a ), a ), b ), and b ) Then P k+2 a, a, b, b) = P k+2 ), the sum being over all diagrams with the given values of a, a, b, and b For example, recalling the conditions on the extreme arrows, we see that P k+2 0,,, ) equals P k+2 ) + P k+2 ) + P k+2 ) In the same way, S k a, a, b, b) = S k ) If a = b = 0 then Lemma 32 reduces to 4 A Special Case P k+2 0, a, 0, b) = k + ) 2 S k 0, a, 0, b ) This is implied immediately by the following proposition Proposition 4 If a ) = b ) = 0 then P k+2 ) = k + ) 2 S k ) The abstract diagram is obtained by juxtaposing a sequence of diagrams of the form θ 0 θ θ i θ i θ i+ θ s 4a), in which a sequence of positively directed arrows is followed by a sequence of negatively directed arrows The contribution to P ) from a concrete diagram, one in which the endpoints of all arrows have been fixed, is the product over the diagrams 4a) of θ 0 θ θ i+ θ i ) θ i k + 2 θ i+ k + 2 θ s k + 2 θ s Notice that θ i does not occur here and the only condition on the sequence θ 0, θ,, θ i, θ i+ θ s is that θ 0 < θ < < θ i < θ i+ < < θ s < θ s

THE FACTORIZATION OF A POLYNOMIAL DEFINED BY PARTITIONS 7 Notice that /θ 0 is suppressed if θ 0 = 0 and /k + 2 θ s is suppressed if θ s = k + 2 On the other hand, the abstract diagram begins with a sequence, that is then followed by a sequence of diagrams θ<j<η, and finally by a sequence Any or all of these sequences may be empty The expression k + ) 2 S k ) will be treated using Lemma 3 Since we have multiplied by k + ) 2 the factor k + ) gσ) 2 may be replaced by k + ) gσ) There are two simple but important relations to note before beginning: 4b) k θ)j k + j + )k + η) + k θ η = θ + )k + η) ; 4c) θ<j<η ηk j) k + k + j)θ + ) + k θ)η = θ + )k + η) Since jj + ) = j j +, k j)k j + ) = k j k j +, the left-hand sides are easily calculated and found to be equal to the right-hand sides We next calculate a factor of that part of S k ) obtained from diagrams whose first segment is η θ η s θ s with θ,, θ s given Fixing θ and summing over the possible η, we obtain a contribution { θ k + k + θ ) k + η )k η ) + } = θ k θ η = The factor k + θ comes from the product in the first term of Lemma 3 The factor k + ) in the numerator in the sum comes from the first gap, which is present if η > 0 but not if η = 0 The factor /θ is there whether θ is right free or bound If θ is right free the additional factor /θ + ) will be part of the contribution attached to the second arrow The factor k + η )k η ) is there because η is left free if it is positive If η = 0 then it is extreme and contributes /k Passing on to the contribution from the second arrow, we fix θ and θ 2, and form the sum, k + θ 2 ) { θ2 η 2 =θ + k + k + + η 2 )k η 2 ) θ 2 + k θ )θ 2 } = θ + Continuing, we obtain as the contribution from the initial segment, except for a supplementary factor arising from the last arrow that is to be treated later, θ + θ s +,

8 ROBERT P LANGLANDS where 0 < θ < < θ s In the same way the contribution of the final segment η η t is k + η ) k + η t ) We now turn our attention to the contribution of one of the intermediate segments First of all, fix θ, η and consider the total contribution of θ i j for all possible i, j It is η θ ) k θ)η Once again, if θ is left free we do not include the factor /k + θ), and if η is right free we do not include the factor /η + ), nor do we include a factor k + ) from a gap at either end For a fixed i and j the contribution is θ + k θ ii + ) k + η) k + ) i < j, k j)k + j) η θ + k θ ik j) k + η i = j η Fixing j and summing over i we obtain θ<j<η η k j) k + η k + j) η = η θ ) k θ)η This is not a very useful form in which to have the contribution To transform it, we prove some simple lemmas To have some notation, set k + f θ θ ) = θ > θ, θ + )k + θ ) = θ = θ Set k + g η η ) = k + η)η + ) η < η = η = η Lemma 42 If θ and η are given, θ < η then f θ θ ) η θ ) g η η ) k θ )η is equal to θ θ <η <η θ + )k + η) θ<θ 2 <η θ 2 k θ 2 ) θ 2 + )k + θ 2 )

THE FACTORIZATION OF A POLYNOMIAL DEFINED BY PARTITIONS 9 To calculate the sum over θ, η we write η η θ = k θ ) + η k + ), obtaining three sums that we easily evaluate using 4b) and 4c) { f θ θ )g η η ) } k + )k θ ) = η θ η θ + )k + η) k + θ )θ + ) + k θ, θ<θ <η { f θ θ )g η η ) } k + )η = k θ ) θ + )k + η) k + η )η + ) + η, θ θ<θ 2 <η θ<η <η { f θ θ )k + )g η η ) = k θ θ η )η ) θ + )k + η) θ<θ <η Replace in all three sums the right variable of summation by θ 2 Note also that k + θ 2 )θ 2 + ) = η θ = k θ) + η k + ) k + θ 2 )θ 2 + ) Then to complete the proof of the lemma, we have only to observe that Note that 4d) k + ) 2 k + θ )θ + ) k+) k + )k θ 2 ) + k + )θ 2 k + ) 2 + k + θ 2 )θ 2 + ) = θ 2 k θ 2 ) θ η=θ+ k θ)k + θ ) k + η)k η) = θ θ ) = Lemma 43 If θ and η are given, η > θ, and A = then A = B Set and B = θ<θ < <θ s<η θ<θ < <θ s<η A = B = θ<θ < <θ s<η θ<θ < <θ s<η η θ θ ) θ θ η=θ+ θ + )θ ηη + ) θ + θ s +, θ + θ s + η θ s ), ηθ + ) θ θ + θ s +, θ + θ s + It suffices to show that A = B Clearly B = θ + θ s + η θ s ), A = θ<θ < <θ s <η θ<θ 2 < <θ s<η η θ + ) θ + ) θ 2 θ 2 + θ s + }

0 ROBERT P LANGLANDS Since ηθ + ) θ + ) = ηθ 2 θ ), θ 2 θ 2 the lemma follows by induction, for it is clearly true for s =, when B = η θ = A Lemma 44 If θ and η are given, η > θ and k θ)η η ) A =, k η ) k + η k + η s then A = B B = θ<η s< <η <η θ<η s< <η <η k + η ) k + η s ) η s θ ) This is the previous lemma in another guise Before we begin transforming the contributions of the intermediate segments, we treat the simplest case, that in which no intermediate sequence occurs in Then has concrete diagrams of the form θ θ s θs θ s+ θr+, and P ) is the sum over 0 < θ < < θ s < θ s+ < θ r+ < k + 2 of 4e) θ s+ θ s ) θ θ s k + 2 θ s+ k + 2 θ r+ The concrete diagrams of type with gaps are either of the form θ θ s θ s+ θ r+, in which there is a gap between θ s and θ s+ or of the form θ θ r+ In the first case the supplementary factors arising from the two internal arrows are /θ s +) and /k+ θ s+ ), together with a factor k+ coming from the gap This yields a contribution 4f) k + ) θ + 0 < θ < < θ r+ < k θ s + k + θ s+ k + θ r+ Substituting θ i for θ i + in this product we see that we obtain all possible sequences contributing to 4e) except those for which θ = or θ r+ = k + Subtracting a term 4f) from the corresponding term of 4e) we obtain θs k + 2 θ s+ ) ) θ θ s k + 2 θ s+ k + 2 θ r+ Breaking this into parts, cancelling either θ s or k + 2 θ s+, and then taking account of the multiplicities with which the missing θ s or θ s+ could occur, we see that we have contributions θ s+ θ s 2 ) θ θ s 2 k + 2 θ s+ k + 2 θ r+,

THE FACTORIZATION OF A POLYNOMIAL DEFINED BY PARTITIONS where 0 < < θ < < θ s 2 < θ s+ < k +, and θ s+2 θ s ) θ θ s k + 2 θ s+2 ) k + 2 θ r+ k + 2) k + ), where < θ < < θ s < θ s+2 < < k + 2 This accounts for all contributions to P ) except those for which θ =, θ k+ = k + However, concrete diagrams with no gap between θ s and θ s+ yield θ + θ s 2 + k + θ s+2 k + θ r+ Taking account of the multiplicity θ s+2 θ s 2 with which the missing θ s = θ s+ can occur, we see that we obtain exactly those contributions to P ) associated to sequences θ =, θ r+ = k + We now suppose that there is at least one intermediate segment, and treat the contribution of the first of these together with that of the initial segment The junction of the two segments has the form θ θ 2 θ s θ s+ξ s+ θ t ξ t θ η θµ η µ The arrow following upon η µ is of the form Suppose it begins at η If u = let η = η, but if u > we let η = ν 2 If t = s +, let θ = θ s ; otherwise let it be ξ t If the initial segment is empty, take θ = 0 In the same way let η = k if it is otherwise undefined Then Lemma 42 transforms the contribution of the interval [θ, η ] to 4g) θ <θ <η θ θ + θ + )k + θ ) k θ k + η The θ +)k + θ ) in the denominator will not be touched If t > s+ we take θ /θ +) together with the rest of the contribution of the interval [θ t, ξ t ] obtaining θ ξ t + θt + ξ t k θ t Summing over ξ t we obtain θ θ t k θ t The contributions of the other intervals [θ i, ξ i ], s + i < k then yield the sum of 4h) and 4i) θ θ t k θ θ s <θ s+ < <θ t <θ t k θ t + k + k θ s+ +, θ θ t k θ θ s <θ s+2 < <θ t <θ t k θ t + k + k θ s+2 + θ s + ) The first factor is there so that in both cases we can use /θ s + ) as the contribution from the final arrow in the initial segment

2 ROBERT P LANGLANDS If t is s +, this manner of expressing the contribution is not obviously meaningful It is better to take it as ) ) ) θ θ t k + θ θ s 4j) + θ s + ) k θ t k + θ t k θ s θ s <θ t <θ Lemma 45 The sum 4j) is equal to θ s <θ t <θ Write the numerator in the first sum as θ t k + θ t k + )k θ t ) k + )k + θ ) The first term yields k + k + θ θ s <θ t <θ t The second may easily be summed in closed form to yield k + )k + θ ) k + θ k θ s Adding to this the final term in 4j) we obtain k + )θ θ s ) + θ θ s )θ s ) ) /k θ s ) = θ θ s ) Since θ θ s = θ s <θ t <θ k + θ t k + θ t, the lemma follows To deal with the case that t > s +, we use Lemma 44 to write 4h) as ) ) ) θs+2 θ s+ k + ), k θ θ s <θ s+ < <θ t <θ s+ k + θ t k + θ s+ and 4i) as θ s <θ s+2 < <θ t <θ θs+2 θ s+ Applying Lemma 45 we obtain k θ s+ θ s <θ s+ < <θ t <θ θ s+ ) θ s + ) k + θ t k + θ t ) ) ) k + θ s+ k + θ s+2 Thus the conclusion is the same in all cases We put these contributions together with the contributions from the initial segment, writing θ s+ as θ s+ θ s + θ s + This yields a sum of two terms The first is θ + θ s + θ s+ θ s ) k + θ s+ ) k + θ t ; )

THE FACTORIZATION OF A POLYNOMIAL DEFINED BY PARTITIONS 3 the second, in which the multiplicity of the missing θ s is taken into account, is θ + θ s 2 + θ s+ θ s 2 ) k + θ s+ k + θ t Observe that upon replacing θ i + by θ i these products correspond exactly to the initial contributions to P ), the second corresponding to θ = We now return to 4g), and work towards the right; only the contribution k θ )/k+ η ) being pertinent If there is only one intermediate segment, so that the complete diagram has the form θ θ s θ s+ θ t η η u η u+2 η v then the contribution from the right is treated like that from the left and is the sum of ) ) ) ) η u+2 η u ) η 2 η u + k + η u+2 k + η v and ) η 2 + ) η u+3 η u ) ) η u + k + η u+3 k + η v The second corresponds to the contribution to P ) in which the final θ is k + Putting all contributions together, first multiplying the two parts and then adding over all possible sequences, and not forgetting θ + ) k + θ ) from 4g) we see that we obtain P ) Suppose, however, that there is a second intermediate segment, so that where they abut the diagram has the form θ θ s η ηt ν The contribution up to η is calculated as before For example, if s = it, or rather the part coming from the right of θ, is k θ k + η More generally, using Lemma 43 and the obvious modification of Lemma 45, we obtain θ 2 + ) θ s + ) k θs k + η The product ) ) θ 2 + θ s + corresponds exactly to what we need for the comparison with the contributions to P ) The final factor is to be put together with the contribution from η on to yield ) ) ) ) k θs ν ηt k + η k + η 2 k + η t k η t )ν θ s<η < <η t<ν ) )

4 ROBERT P LANGLANDS The final factor is the contribution previously calculated for a diagram Lemma 44 replaces this with ) ) η θ s ) k + η k + η t ν The initial terms correspond exactly to what is needed for the comparison Keep the final two for proceeding further to the right Choose θ, η as for 4g) Thus θ is either η t or θ s Then we have a contribution 4k) k + η θ <η t<ν η t ) ν f η ν) The sum is over η t and ν Lemma 46 The sum 4k) is equal to θ + )k + θ ) k θ k + η θ <θ <η This is an immediate consequence of 4b) The factor /θ + )k + θ ) is what we need for the comparison with the contribution to P ) The factor k θ k + η, which we have seen before, is what we need to treat the second intermediate segment like the first, and then inductively to proceed all across the diagram, thereby proving the proposition 5 Completion of the Proof The proof of Lemma 32 will now be reduced to Proposition 4 Although the value of P ) or S ) depends on the directions of the uncircled arrows in it does not depend on the directions of the circled arrows They are important only when calculating P k+2 a, a, b, b) or S k a, a, b, b) Thus we sometimes indicate a circled arrow simply by the symbol Lemma 59 a) P ) = P ) k+ b) P ) = k+ P ) + P ), k+ c) P ) = P ) + P ), k+ k+ d) P 2 ) = P k+ 2 ) + P k+ 2 ) + e) S 2 ) = k+ S 2 ) + k+ S 2 ) + P k+ 2 ) S k+ 2 ) In the formula e) for S both and 2 may be empty, but in the formula d) for P they must not be, as must not be in formulas b) and c) Since P ) =, P ) = k +, the first formula is clear Consider the second The contribution of a concrete diagram θ is of the form A /θ The contribution of θ θ

THE FACTORIZATION OF A POLYNOMIAL DEFINED BY PARTITIONS 5 to P ) is A /θ)k + θ), while that of θ to P ) is A The formula c) is of course proved in exactly the same way For d) the verification is also similar The diagram θ θ 2 2 contributes a term A /θ ) /k + 2 θ 2 ) B The contributions of the three diagrams appearing on the right are respectively: A θ 2 θ ) B; A B; A B θ k + 2 θ 2 θ k + 2 θ 2 Proving the final formula is just a little less simple because we cannot operate entirely with concrete diagrams The pertinent part of the concrete diagram for the left side of e) is θ θ θ 2 η θ and θ 2 are the endpoints of and θ and η are the closest endpoints of the arrows in or 2 If is empty then θ = 0 and if 2 is empty then η = k The contribution from the interior of the interval [θ, η] is f θ θ ) g η η ) k θ )η θ θ <η η By this we mean that the factors /θ and /k η) are not taken into account On the other hand, replacing the undirected arrow in the interval θ, θ 2 by the directed arrow, we obtain f θ θ ) k + η g η η ) k θ )η Taking instead, we obtain θ θ <η η θ θ <η η f θ θ ) θ + k θ )η g η η ) Next, inside the same interval [θ, η] we insert two opposing arrows We have to take the sum θ θ θ <η θ 2 <η 2 η θ θ <θ 2 <η 2 η θ η θ 2 η 2 ) θ + f θ θ ) g θ2 η ) k θ )η η k + η2 k θ 2 )η 2 ) g η η 2 ) Use 4b) to sum over η to obtain ) ) k + η2 f θ θ ) g η η 2 ) k + θ 2 k θ 2 )η 2

6 ROBERT P LANGLANDS Then sum over θ 2 to obtain θ θ <η 2 η f θ θ ) η 2 θ k θ )η 2 g η η 2 ) The last formula of the lemma follows immediately on replacing η 2 in this sum by η, for θ + ) + k + η ) + η θ ) = k + It is clear that the expansion permitted by this lemma can be iterated so that P k+2 a, a, b, b) becomes a weighted sum of P ), where is a diagram with no circled arrows, and with its extreme arrows pointing inwards The diagrams that we obtain have distinguished subdiagrams of the type,, or, each provided with a supplementary orientation Suppose there are c, c +, c distinguished subdiagrams of the three types with negative orientation and d, d +, d with positive orientation Then a = c + c + + c, d = d + d + + d In addition, P ) is to be provided with the weight k + ) a b Since the weight is independent of it can often be ignored Each that occurs is actually of the form with a = a, b = b By Proposition 4 we may replace k + ) a b P ) by k + ) 2 a b S ) There are many types of diagrams that contribute to the sum of Lemma 32, and it is best to introduce a supplementary label, because the same diagram 2 may contribute more than once This supplementary label is one of the diagrams: ; ; ; ; ; ; ; ; Each of the diagrams defines two numbers e, the number of negatively oriented circled arrows, and f, the number of positively oriented circled arrows If a 2 = a 2 ), b 2 = b 2 ) then a 2 + e = a, b 2 + f = b and the weight attached to the contribution with the double label is k + ) 2 e f For example, the term 2S k a, a, b, b) is the sum of contributions from pairs 2, ) and pairs 2, ), while S k a, a, b, b) is the sum of contributions from pairs 2, ) Using the lemma to expand, we obtain the common weight k + ) 2 a b The terms of the expansion are labeled by the same supplementary diagram 3, and by a diagram 3 with no circled arrows but with a certain number of distinguished subdiagrams of the form,, or Each of these subdiagrams is provided with an orientation, corresponding to the orientation of the circled arrow from which it arose Let there be i, i +, i negatively oriented arrows of the three types and j, j +, j positively oriented Then a 2 = i+i + +i, b 2 = j+j + +j We have to establish a bijection between the diagrams, taken with multiplicity, and the diagrams 3, 3), also taken with multiplicity Suppose is obtained from = Thus is obtained by introducing one of the three diagrams,,, in place of each of the circled arrows Let D,, D s be the introduced diagrams of the form, so that has the form D D s Thus there are s + sequences S i of arrows, from the beginning to the beginning of D, from the end of D to the beginning of D 2, and so on In S i, i < s, let there be p i positively directed arrows and q i negatively directed arrows Let p i of the p i arrow arise from positively directed circled arrows by the substitution of for, let p i negatively directed circled arrows, and let p i be original arrows Define q i, q i, q i arise from similarly

THE FACTORIZATION OF A POLYNOMIAL DEFINED BY PARTITIONS 7 Define p s, q s, p s, p s, p s, q s, q s, q s in the same way, except that the two end sequences are put together for the counting Then the multiplicity with which the diagram with given locations of the D i and given S i, as well as given p i, p i, p i, q i, q i, q i contributes is s p i! p i!p i!p i! q i! q i!q i!q i! i= Between the center of D i and that of D i+, i < s there is at least one diagram Let the first be E i If there is such a diagram after D s, let E s be the first Consider the number of ways of assigning to the arrows between the centers of D i and D i+ that do not lie in E i both circles and circled directions, and in such a way that the total number of each is as before The number is p i! p i!p i!p i! q i! q i!q i!q i! Notice that we have begun to describe the diagrams 3 for which E,, E s, and E s if it has been assigned, are the diagrams introduced in the expansion If E s does not exist, then the multiplicity with which we can make the various assignments up to the center of D and after the center of D s is p s! p s!p q s! q s!q s!q s! s!p s! Notice that the extreme arrows of no longer play a role; they are replaced by the first arrow of D and the last of D s To make the comparison, we note that if E s does not exist then D s is determined as the final subdiagram of the form We also agree that E i and D i, i < s are to be obtained from circled arrows with the same orientation Moreover if E s does not exist, then we take 3 to be or, according to the circled orientation of the arrow yielding D s We finally note that D i is determined by E i We simply move to the left from E i to the first diagram Thus the bijection with multiplicity is established between diagrams in which D s is the final diagram in and diagrams 3, 3) in which 3 has only a single arrow If D s is not the final diagram then E s exists, and we take it as coming from a circled arrow with the same orientation as D s The only difference in the counting of the multiplicities is that for the contribution to S s we remove the arrows in E s as well as the extreme arrows and only add the first arrow of D and the last of D s To make the count come out correctly, we adjoin the supplementary 3 with two arrows, each of which has three states that can be interpreted as circled with positive orientation, circled with negative orientation, and uncircled Observe that this argument is also valid for the case that s = 0

8 ROBERT P LANGLANDS A pair of tables for the case r =, a = a = b =, b = 0 may help Diagrams with the same label, which lies between i) and v), are matched in the bijection Initial Expanded s i) 0 iv) 0 v) ii) 0 v) iii) 0 iv) Initial 2 Expanded 3 3 i) ii) iii) v) iv) v) iv) Appendix The Virasoro algebra g as an infinite-dimensional Lie algebra over C with basis L k, k Z, and C and is defined by the conditions: i) C is central ii ii) [L i, L j ] = i j)l i+j + δ 2 ) i, j C 2 The facts reviewed below can be found in [4] The Verma modules are infinite-dimensional vector spaces V h,c on which g acts and are attached to two real parameters h and c They are defined by the condition that they be universal with respect to the following property V h,c is generated by a vector v φ satisfying: Thus V h,c has a basis Cv φ = cv φ, L 0 v φ = hv φ, L n v φ = 0, n > 0 v k,k 2,,k r = L k L kr v φ, k k r > 0 However it may have other convenient bases as well It carries a unique hermitian form u, v satisfying i) v φ, v φ = ; ii) L k u, v = u, L k v Let P n) be the number of partitions of n Then the space V n spanned by {v k,,k r k i = n} has dimension P n) If {, } is the hermitian form defined by {v k,,k r, v l,,l s } = 0 unless r = s, k = l,, k r = l r then the matrix H n h, c) of, on V n with respect to {, } is a polynomial in h and c whose determinant is a constant times h h p,q ) P n pq) pq n

THE FACTORIZATION OF A POLYNOMIAL DEFINED BY PARTITIONS 9 If we introduce m by the condition c = 6/mm + ), then h p,q = h p,q m) = m + )p mq)2 4mm + ) p, q N In particular if n = pq then det H n vanishes on the curve h = h p,q m) A null vector is obtained by taking some row c k,,k r m) of the matrix adjoint to H n, and then setting w p,q m) = c k,,k r m)v k,,k r k + +k r=m Choose the row so that the vector c k,,k r m)) does not vanish identically Since the coordinates of this vector are rational functions of m, we may write c k,,k r m) ) as the product of a rational function of m and a vector u p,q m) = d k,,k r m) ) with coefficients that are polynomials in m whose greatest common divisor is To stress the dependence on p, q, for it is important, I write d k,,k r m) = d p,q k,,k r m) To pass to a more convenient notation we take this p, q to be p, q and with another p, q we set = h p,q m) We form the rational functions of m, Y, defined by and by a k,,k r m, Y, ) = k r + + k 2 + y + k )k r + + k 3 + Y + k 2 ) Y + k r ) P p,q m, Y, ) = a k,,krm, Y, )d k kr>0 k + +k r=p q p,q k,,k r m) The highest power of Y that appears in P p,q m, Y, ) is Y n, where n = p q, and it appears with coefficient d p,q,,m) On the other hand, set Y p,q r,s = h p,q m) h p r,q sm) Conjecture If = h p,q, then P p,q m, Y, ) = dp,q,,m) r+ p mod 2), r <p s+ q mod 2), s <q Y Y p,q r,s m) ) It is important to observe that p, q and p, q play utterly different roles in this identity Before explaining the significance of this conjecture, I observe that for generic m the null space of H n h, c), h = h p,q m), c = cm) is of dimension Moreover, for all k,, k r such that k i = n the vector v k,,k r = L k L kr v φ lies in V n, whether k,, k r are in decreasing order or not In addition, it is not difficult to show that e k,,k r a k,,k r m, Y, ) depends only on the vector k + +kr=n k 0 k + +k r=n e k,,k r v k,,k r

20 ROBERT P LANGLANDS Thus if ek,,krm)v k,,kr is any vector with values in the null space of H n c, h) the function P m, Y, ) = e k,,k r m)a k,,k r m, Y, ) is determined by the coefficient pm, ) of Y n Provided that this is not zero, the conjecture is tantamount to P m, Y, ) = pm, ) Y Y p,q r,s m) ) r,s In the two extreme cases, p = or q =, Benoit and Saint-Aubin [BSA] have found an explicit formula for e k,,k r m): a) q = ) n r { m + ) r A) e k,,k r m) k + + k i )k i+ + + k r )}, m b) p = A2) i= e k,,k r m) m ) n r { r k + + k i )k i+ + + k r )} m + i= The conjecture in these extreme cases follows immediately from these formulas in Theorem The quotient of the Verma module V h,c by the space of null vectors is an irreducible module M h,c Select two parameters,, as well as a third parameter A primary holomorphic field attached to these parameters is a formal series Φz) = z k Z ϕ k z k Here ϕ k is a matrix ϕ k,n,n, n 0, n 0, n, n Z and ϕ k,n,n : M n M n We have set M = M,c, M = M,c, c = cm), and M n = {v M L 0 v = + n )v}, M n = {v M L 0 v = + n )v} Moreover ϕ k,n,n = 0 unless k = n n, so we write ϕ n,n for ϕ n n,n,n The formal series Φz) is said to define a primary holomorphic field of weight if the identity Aa) L k Φ ΦL k = z k+ d dz Φ + k + )zk Φ is valid for all k Z The formal identity translates immediately into real identities for the operators ϕ n,n between finite-dimensional vector spaces Although it is usually ignored, a basic problem is to decide for what values of,, and a primary field exists This is particularly important for the discrete series parameters m 2, m Z, h = h a,b m), a < m, b < n + Thus,, are all to belong to this set, = h p,q, = h p,q, = h p,q It appears that it is not difficult to prove the existence of Φz) satisfying Aa) provided one can construct ϕ 0,k, ϕ k,0 for all k 0, satisfying the conditions implied by Aa) It is

THE FACTORIZATION OF A POLYNOMIAL DEFINED BY PARTITIONS 2 moreover easy to see that ϕ n,n is the adjoint of the operator ϕ n,n attached not to, but to, and the same Thus the necessary and sufficient condition for the existence of Φz) is that ϕ 0,k exist for all k for the parameters, and ϕ 0,k for the parameters, It is clearly enough to determine the conditions for the first problem Normalize Φ so that ϕ 0,0 : v φ v φ A simple calculation shows that ϕ 0,k v k,,k r = a k,,k r m,, )v φ, k = k i Thus a necessary and sufficient condition for the existence of ϕ 0,k is that imply that Ab) u = c k,,k r v k,,k r = 0 ck,,k r a k,,k r m,, ) = 0 It will probably be easy to show that if the condition Ab) is satisfied by one null vector, then it is satisfied for all null vectors obtained from it by repeatedly applying elements of the Virasoro algebra After that, it should not be too difficult, using results of Feigin and Fuchs [FF], to show that for the discrete series it is enough to verify it for u = u p,q and u = u m p,m+ q Provided that,q dp,,m) and d m p,m+ q,, m) are not zero, and this seems likely, although I am not at the moment clear as to how it is to be proved, then the conjecture implies that the operators ϕ 0,k exists for all k and only if Ac) = Y p,q r,s m) and Ad) = Y m p,m+ q r 2,s 2 m), for some pairs r, s, r 2, s 2 satisfying r p +, r 2 m p +, s q +, s 2 m q modulo 2, and r < p, s < q, r 2 < m p, s 2 < m + q For the present it is sufficient to examine the first equation, our only purpose being to verify that it leads to explicit conditions on p, q, p, q, and p, q Set p 0 = p r, q 0 = q s Since = h p,q h p,q, we infer from Ac) that p q ) 2 m 2 + 2p + q )p m + p 2 = p 0 q 0 ) 2 m 2 + 2p 0 q 0 )p 0 m + p 2 0 This equation is readily seen to be equivalent to the condition that either p q ) p 0 q 0 )m + p p 0 ) = p p 0 )m + ) q q 0 )m = 0 or p q ) + p 0 q 0 )m + p + p 0 ) = p + p 0 )m + ) q + q 0 )m = 0 The second equation is obtained from the first on substituting p m p, q m + q Since all quantities involved are integers, all solutions of the first equation are of the form p = p 0 + am, q = q 0 + am + ), a Z Since 0 < p, p, p < m, 0 < q, q, q < m + ), the integer a must be 0, ± although not all these values are necessarily allowed The conclusion is that the conjecture leads to explicit, albeit somewhat elaborate, necessary and sufficient conditions on p, q, p, q, p, q for the existence of a primary conformally invariant holomorphic field There is a close connection between the problems of existence and the

22 ROBERT P LANGLANDS problem of establishing fusion rules The conditions derived from the conjecture are close to those the attentive reader of the discussion of fusion rules in [BPZ] would expect, although perhaps not exactly the same References [] Belavin, A A, Polyakov, A M, Zamolodchikov, A B: Infinite conformal symmetry in two-dimensional quantum field theory, Nucl Phys B24, 333 380 984) [2] Benoit, L, Saint-Aubin, Y: Explicit expressions for the null vectors ϕ p, and ϕ,q of the discrete series representations of the Virasoro algebra, Phys Lett B25, 57 522 978) [3] Feigin, BL, Fuchs, D B: Verma modules over the Virasoro algebra, In: Topology, SLN 060 982) [4] Kac, V, Raina, A: Lectures on highest-weight representations of infinite-dimensional Lie algebras Singapore: World Scientific 987 Note added in proof After this paper was submitted two preprints came to my attention that render the combinatorial arguments in it superfluous from some points of view, although not necessarily redundant First of all, G Felder in BRST Approach to Minimal Models has used the BRST method to construct primary fields and the conjecture of the appendix follows readily from his conclusions Moreover, B L Feigin and D B Fuchs in Cohomology of some nilpotent subalgebras of the Virasoro and Kac-Moody Lie algebras take the direct algebraic approach of the Appendix to the existence of primary fields, but deal with the whole matter much more efficiently, more generally, and more elegantly It is in particular clear from their discussion that the conjecture is an easy consequence of results already in [3]

Compiled on April 30, 208 6:33pm -04:00