For , define their convolution byThe support restrictions make each sum finite: for fixed upper-cone representatives, the simple root coefficients in the two downward displacements are bounded nonnegative integers. This also proves closure in and associativity by finite reordering at each coefficient. The unit is , and .
With the source's negative root partition function, interpret and allow zero coefficients in the partitions. Write for , with multiplication meaning convolution. ThenThe denominator needed for the asserted character identities isThe repeated identical subscripts in the printed denominator would instead make it zero, so those literal factors cannot satisfy an inverse identity. Also the required inverse uses the negative shift. Geometric-series cancellation givesWith a positive shift the left side would be , which displays the second printed sign problem even after the denominator is repaired.
Poincaré-Birkhoff-Witt theorem gives , since each ordered negative root monomial lowers the highest weight by its corresponding partition. ThereforeThe remaining parts use for the intended Weyl denominator, while the private TeX preserves the printed signs.
For a finite-support formal character, use the same pullback rule ; equivalently . This specifies the action on the denominator, which is a finite delta sum rather than a polynomial function. The whole infinite-support completion need not be Weyl-stable, so no such claim is required.
A simple reflection permutes the positive roots other than and sends to . In the product defining , all factors are therefore permuted except the factor, whose sign reverses. Thus . Simple reflections generate , and each has determinant , so
Use the intended finite-dimensional irreducible highest weight module , with dominant integral highest weight . Its highest weight multiplicity is one. An arbitrary direct sum having that same largest representation weight would not in general satisfy this formula. Set and use the corrected denominator of part (a).
Restriction to each simple root decomposes into symmetric finite representation weight strings, so is Weyl-invariant. Consequently is Weyl-antisymmetric. We prove that no lower Weyl alternants occur, rather than assuming the desired character formula.
First establish the denominator identity itself. The finite sum has support in and coefficient one at . Antisymmetry kills all singular representation weight coefficients, since a reflection fixing the representation weight reverses their sign. Every remaining Weyl orbit has a unique regular dominant representative . If it occurs in , then . Since is integral and regular dominant, is dominant integral; it also belongs to . A dominant vector satisfies , so it must be zero. Thus the only possible orbit is . The leading coefficient givesFor the formal Laplacian , this implies .
Now choose root vectors dual under an invariant form, so with corresponding to the vector , and take the quadratic Casimirfor an orthonormal Cartan basis. On a highest vector its scalar is , hence it has this scalar throughout the cyclic highest weight module.
Here is the computation of the weighted trace of its radial identity. For a positive root, let be the formal weighted trace of and that of . Cyclicity of trace and representation weight shifting give , while their difference is the weighted trace of , namely . ThusTaking the trace of yieldsThe product expression for givesUsing and the product rule for the formal Laplacian therefore givesHence every representation weight in the support of has norm . Its support is also contained in , and it is antisymmetric. Any occurring regular dominant weight thus satisfies . If the inequality were strict, thenbecause the first factor is a nonzero nonnegative sum of simple roots and the second is strictly dominant. This contradicts the equal-norm condition. Only the orbit remains. Its leading coefficient is one, proving
Convolve the identity of part (c) with the inverse denominator found in part (a). Associativity givesTranslation by a Kronecker delta obeys . Taking the coefficient at therefore yieldsThis is the Kostant multiplicity formula in the paper's convention that counts negative root partitions. With a partition function counting positive root sums, each argument would have the opposite sign.
Articles by others on the same topic
There are currently no matching articles.