Exponentials
Arun Ram
Department of Mathematics and Statistics
University of Melbourne
Parkville, VIC 3010 Australia
aram@unimelb.edu.au
Last update: 04 August 2012
Abstract.
This is a typed version of I.G. Macdonald's lecture notes from lectures at the University of California San Diego from January to March of 1991.
Lattices
Let be a real vector space of dimension A lattice in is a subgroup of (hence closed under addition and subtraction) that spans and is generated by elements (which are therefore a basis of ). So the elements of are all linear combinations
Let be another lattice in with basis and suppose that Then each hence we have equations
The matrix is a nonsingular matrix of integers, because it transforms one basis of into another.
is a finite abelian group of order
|
|
Proof.
|
|
By elementary transformations on rows and columns we can find matrices of integers with determinant such that is a diagonal matrix, say
where the are positive integers. (We can even arrange that
though we shan't need that fact here.)
Let
so that the (resp. the ) are a basis of (resp. ). From (Exp 1) we have
and therefore
So have bases
and therefore
is a direct sum of cyclic groups of orders hence
since have determinant
|
Now suppose carries a positive definite scalar product and let be a lattice in as before. Let
Let be a basis of and let be the dual basis of
Then
so that is a lattice in with basis is called the dual of We have (because has basis ).
If we have because if we have for all and a fortiori for all
is the dual (or character group) of
(In particular
— but not canonically.)
|
|
Proof.
|
|
Let and define
If we have
i.e. is constant on the cosets of in and therefore defines a character of the finite abelian group Moreover if then
(because
for ). Hence
defines a mapping of into the character group of Check that it is an isomorphism.
|
The root lattice and the weight lattice
Let be a reduced root system, spanning and let be the subgroup of generated by the roots: so the elements of are all linear combinations
If is a basis of every and hence every is uniquely of the form
with integer coefficients
so that is a lattice in called the root lattice. Likewise
From above, is the dual of
hence is also a lattice, called the weight lattice of Since
for all (integrality axiom (R1)) it follows that
(and likewise
).
Let
be the basis of dual to
The are a basis of the weight lattice they are called the fundamental weights. They span the Weyl chamber
Recall that is the Cartan matrix, where
Example.
What are the fundamental weights?
So
say
So
hence
Exercise:
Calculate the for types
We have
and hence from Proposition 1.1
(We know from before that is positive.)
The positive integer is traditionally denoted by and called the index of connection:
by Proposition 1.2, since and are respectively the duals of and
Finally, acts on everything: it acts on and on hence on and hence on and Let
Then
hence (1.21).
Every orbit in meets in exactly one point.
The are called the dominant weights.
Let
- for all
-
for all
|
|
Proof.
|
|
- We have
because
Hence
Since is generated by the it follows that
for all
- Recall (1.24) the partial order on iff where is the cone spanned by the simple roots We have
Now if we have
for all (1.24)
using (i).
|
Recall
is such that
(1.9). Hence
Likewise let
(warning: is not a good notation, because
).
By (1.9) applied to we have
because (1.23)
is a basis of Hence
For all
For if
then
is the "altimeter".
Exponentials
If is a group (finite or infinite) and is a commutative ring, the group algebra consists of all formal sums
with coefficients only finitely many non-zero (i.e. is the free module with as basis). So in particular each is an element of Add and multiply in the obvious way: if
is another element of then
i.e. the multiplication in is just the multiplication in extended by linearity.
If however the group operation in is addition ( rather than ) we have to change our notation and write e.g. for the element of corresponding to the are "formal exponentials" and satisfy
The elements of are now written
and add and multiply as indicated.
This applies in particular to the group the weight lattice. Let denote the group algebra of over So the elements of are finite sums
where
The are an basis of
The ring is easily described. The fundamental weights
form a basis of so that each is uniquely of the form
Hence if we put we have
and therefore
is the algebra of Laurent polynomials in (i.e. polynomials in the and their inverses). Since
is a unique factorization domain, so is
Let be linearly independent (i.e. not proportional). Then
and
are coprime in
|
|
Proof.
|
|
This amounts to showing that if are not proportional, then
and
have no common factor. Left as exercise.
|
The Weyl group acts on hence on
is
- invariant (or symmetric) if all
- skew (or alternating) if all
We shall start by considering the skew elements of Let be the linear mapping defined by
We have
- is the space of skew elements of
- If and for some then
- The
form an basis of
|
|
Proof.
|
|
- Let Then is skew, because if we have
Conversely if is skew then
- We have
hence
and therefore
- Suppose
Then
and therefore
Since each orbit in meets in just one point (Prop. 2.2) it follows that
Now is of the form
with If for some then
and hence
so that
by (ii). Hence in (*) the sum is restricted to
with each hence (Prop. 2.5)
with So is a linear combination of the
with and these are clearly linearly independent (the orbits are disjoint).
|
Next let
- and is skew (H. Weyl).
- Each is divisible in by and is invariant. Moreover is a bijection of onto the invariants.
(So
plays the same role here as
did for polynomials.)
|
|
Proof.
|
|
- permutes the positive roots other than and (1.9). Hence
from which it follows that Hence (Prop. 3.2)
where coefficient of in Now on expansion we have
say; hence coefficient of in and if we have so that from (ExpWeyl 2) the coefficient of in is zero. So if and hence (ExpWeyl 1) shows that
- By Prop. 3.1 and Prop. 3.2 it is enough to show that
is divisible by for each Let
then
(disjoint union). Then
It is enough to show that each term in this sum is divisible by
i.e. that
is divisible by Now
say, where hence
and if say then
and the conclusion is the same as before. (Finally
if )
Finally, if is skew then is symmetric. Conversely if then which proves the last statement of Proposition 3.3 (ii).
|
The formula
or explicitly
is Weyl's denominator formula. I will give an alternative, more combinatorial proof.
Example.
of type roots
We have
Let then Weyl's formula is in this case
Multiply both sides by
and we get
Exercise:
Write it down explicitly for the other of classical type
For the second proof of Proposition 3.3 (i) we need a lemma, which will come in useful later:
For each subset let
Suppose that is a regular element of (i.e. does not lie in any hyperplane ). Then
for some and
|
|
Proof.
|
|
We have
for some ( the Weyl chamber), hence
Now
where
i.e. is of the form
Hence so is
hence
for some depending on and and which we could describe explicitly if we needed. So we have
hence
is and hence for each But
hence
and therefore also
so that
for all But hence
hence (and so ). From (ExpLem 3) it now follows that
i.e.,
Moreover, since
it follows from (ExpLem 1) that
Hence for each
Hence from (ExpLem 2) and (ExpLem 4)
i.e. so
|
|
|
Second proof of Proposition 3.3 (i).
|
|
Now consider
on multiplying out. But is skew, hence
If is not regular,
by Proposition 3.2 (ii). If is regular, then and
for some So
since
and
so that
and hence
as required.
|
The same technique can be used to prove the following identity. For each let be an indeterminate, and for each subset let
Then we have
|
|
Proof.
|
|
Let denote the left-hand side of Proposition 3.5, so that
and therefore
on multiplying out the product, i.e.,
Now by Proposition 3.2 we have
if is not regular, and if is regular then by Proposition 3.4
for some Hence (since
)
and
So we can cancel from either side of (ExpId 1) and obtain
|
In particular, if for all
Here the right hand side is independent of the so we may specialize them in any way we please. Define
by
so that
and therefore
What about
when In that case some
is a negative root say, so that
some and then
so that (Exp 3) is zero when Hence from Proposition 3.6 we obtain
another multiplicative formula for the Poincaré polynomial
of the harmonics. From Proposition 3.7 and (3.31) it follows that
where is the number of roots of height Since (the roots of height 1 being the ) it follows that
so that
for each i.e.
is a partition of
the multiplicity of as part of the conjugate partition so that
The partitions
and
where
are conjugate (Shapiro, Kostant).
So the degrees (or the exponents ) can be read off from the root system.
Exercise:
Check Proposition 3.8 for the classical root systems (i.e. compute the ).
Bases of
Let
be the subring of invariants of I will list several bases of generalizing familiar objects from the theory of symmetric functions.
Orbit-sums (monomial symmetric functions)
Suppose
Then for all we have
so that
i.e. the coefficients are constant on each orbit in By Proposition 2.2 each such orbit is of the form
so that
from which it follows that
The orbit-sums
are an basis of (indeed, a basis of
).
Weyl characters
For each we define
By Proposition 3.3 (ii) we have
The are Weyl characters. Since (Prop. 3.2 (iii)) the
form an basis of the space of skew elements of hence by Proposition 3.3 (ii) the
are an basis of
We have
where by lower terms is meant a linear combination of with (because if then
i.e. ). Hence, as is symmetric, we can write
In fact the coefficients are non-negative integers, (because they are the multiplicities of the weights in the simple module indexed by ).
Problem.
Prove directly (i.e. without recourse to representation theory of Lie groups or Lie algebras) that the are ).
Example.
(so that ). Since
is an integer for all it follows that
for all but the individual need not be integers: in general they will be rational numbers with denominators dividing as we say last time from computing the fundamental weights. In particular,
(and ).
So any partition
of length determines a dominant weight
So we have a surjective (but not bijective) mapping
of the set of partitions of length onto the cone of dominant weights for the root system
As before put
Then the Weyl characters are essentially Schur functions: to be precise, if is a partition of length then
(because it must have degree 0 as a polynomial in the ). In particular, since
Return to the general case
For each let be an element of of the form
Examples.
[When
is of type
these are the same, but in general they aren't.]
Then we have
and the are algebraically independent over
|
|
Proof.
|
|
Consider a monomial
( integers ). From (Exp 5) it follows that if
we have
for certain coefficients Hence the transition matrix between the and the orbit sums is unitriangular, hence invertible. So by Proposition 4.1 the are a basis of (even over ), which proves Proposition 4.3.
|
Note that the are defined for all not just
Hall-Littlewood analogs
Next, we have analogs of the Hall-Littlewood symmetric functions. Let be an indeterminate, let and define
Notation
so in particular
by Proposition 3.6. We have
which shows that
Let
be the subgroup of that fixes Since
is generated by the
Let be the root system with basis
Then
Now permutes
and also permutes
if Hence permutes
if and hence permutes
Now let be a set of left coset representatives of in so that each is uniquely with and Then
from what we have just observed. By Proposition 3.6 it follows that
and hence all the coefficients of (which are polynomials in ) are divisible by
and we can define
Particular case:
- then
- then
So the
include the orbit sums
and the Weyl characters
as particular cases.
Kostka polynomials
These are defined by
Then
and
and the are analogs of weight multiplicities. For let
summed over all families
of non-negative integers such that
(So unless )
-
(Kato)
- Let
Then the transpose of is the matrix of the operator
where the are raising operators:
Constant term conjectures
(SIAM J. Math. Analysis 13 (1982) 988-1007)
Let be a reduced root system, an integer
the degrees of the Weyl group of If
the constant term of is
- (C1) The constant term in
is
- (C1q) The constant term in
is
where
is the binomial coefficient or Gaussian polynomial.
Clearly (C1q)⇒(C1) by setting Consider the simplest nontrivial case, i.e. Then
Since we have
so the constant term is
which is (C1) for
Next, when we have to consider the constant term in
Hence
constant term in
But we have just seen that the constant term in
is hence
Formal exponentials as functions on
Let We may regard as a (complex-valued) function on as follows
where the on the right is the usual one: 2.718...
Now let
Then
and
module integers, so that
Let
and let
be the canonical mapping Then (Exp 8) shows that defines a function on
Since
it follows that is a direct sum (or direct product) of copies of the circle group:
i.e., is an dimensional torus: a compact commutative topological group.
Let be the parallelepiped
so that the projection restricted to is a bijection
Now let be a complex-valued continuous function on Lifting it back to we get a continuous function on
i.e.
is periodic:
Hence
can be expanded as a convergent Fourier series:
— now in general an
infinite series — where
and
— integration from 0 to 1 in each
So in particular the constant term of is
These considerations apply to the conjectures (C1) and (C1q). Consider the latter. Introduce the notation
whenever the product makes sense. Then if is an integer
So in (C1q) we seek the constant term in
Think of now as a real number, The infinite product
converges uniformly on to a continuous function (because
converges). So does
for any real or complex
moreover it does not vanish anywhere on unless one of the factors
does, and this can happen only if is an integer So if is not an integer the expression (Exp 9) is a continuous function on the torus and its constant term is therefore well-defined.
To make sense of the other side when is not an integer we introduce the gamma function. Suppose first that is an integer then
is the limit as of
This makes sense whenever is not a negative integer (it has poles at the negative integers). We now interpret the Gaussian polynomial
(The +1s in the notation are a nuisance, but it is 200 years too late to change.)
Kostant's partition function
If let
(So unless .) Clearly
Define by
and by
-
-
|
|
Proof.
|
|
- is the coefficient of in
So we must have
i.e.
and hence we get
- We have
and therefore is the coefficient of in the left hand side of (Exp Kos), i.e. in
So we must have
i.e.
and hence we get the formula (ii).
|
References
I.G. Macdonald
Issac Newton Institute for the Mathematical Sciences
20 Clarkson Road
Cambridge CB3 OEH U.K.
Version: March 12, 2012
page history