Last update: 2 September 2013
Let be a Cartan matrix corresponding to a simple Lie algebra. The dimension, of the Cartan matrix is called the rank (note that this has nothing to do with the rank of the Cartan matrix). Let be linearly independent vectors spanning a vector space denoted by The elements of are called weights. The are called the fundamental weights. If we use the notation for i.e. The weight lattice is the lattice The elements of are called integral weights and the dominant integral weights are the weights in the set where denotes the nonegative integers. Define vectors the simple roots, by
There is a partial ordering on the weights given by defining if for nonnegative integers This is called the dominance partial order.
For each define a linear transformation by for each The Weyl group is the group generated by the There is a partial order on the Weyl group induced by the dominance ordering on weights and given by Here and This partial order on is called the Bruhat order. The weight is called the half-sum of the positive roots.
Fix a (simple) Cartan matrix and define to be the associative algebra (over with 1 generated by with relations (Serre relations, see [Hum1972]) Here and One shows easily that We will use the following notations:
Remark. Note that we could have defined the algebra using only the generators and
Let be a module. A vector is called a weight vector if, for each for some constant We associate to the weight and write Let denote the weight of a weight vector Given a weight the weight space corresponding to is the subspace of given by A vector in is a highest weight vector if is a weight vector and if, for each
If is a finite dimensional module then contains a weight vector.
Proof. | |
The proof is by induction. Since is finite dimensional it contains an eigenvector for The induction step is as follows. Suppose that is a weight vector for i.e. there are constants such that Let Since for each and all is an eigenspace for each of the But takes into itself. Thus, since is finite dimensional, there is an eigenvector of in Since is in it is also an eigenvector for all the |
If is a weight vector then
(1) | is a weight vector and |
(2) | is a weight vector and |
(3) | is a weight vector, and |
(4) | is a weight vector, and |
Proof. | |
We have giving (1). (2) is proved similarly. (3) and (4) follow from (1) and (2) respectively, by induction. |
If is a finite dimensional module then contains a highest weight vector.
Proof. | |
We know contains a weight vector If there exists such that then let Repeating this process constructs a sequence of weight vectors Since these vectors have different weights, i.e. different “eigenvalues” they must be linearly independent. Since is finite dimensional we know that this sequence must be finite, i.e. for some we have that for all Then is a highest weight vector. |
Let be a module and let be a weight vector. Let Then for each we have
Proof. | |
The proof is by induction. The statement is easy for The induction step is as follows. Using Lemma (3.2) and the fact that we have that |
If is finite dimensional and is a highest weight vector then
Proof. | |
Since is finite dimensional we know that for some Let be minimal such that this is true. By the previous lemma we have that Since we must have that |
Let be a module (not necessarily assumed to be finite dimensional). Suppose that contains a highest weight vector Note that is a submodule of If (in particular, when is irreducible) then
(1) | where denotes a monomial in the of the form |
(2) | is a direct sum of its weight spaces, |
Proof. | |
(1) For each we have that and that for some constant Using Lemma (3.6) we have that for some for some constant Thus by induction we have that and for each and each monomial (2) The are the weight spaces under the action of i.e. they are eigenspaces with different eigenvalues. So they must decompose as a direct sum. The monomials have weight exactly when Since and each we have that |
If is an irreducible module then can have at most one highest weight vector (up to multiplication by a constant).
Proof. | |
Suppose that is an irreducible module that contains highest weight vectors and Since is irreducible By () But we also have that So i.e., for some |
We did not prove the following three results in class.
There is a unique finite dimensional irreducible representation of corresponding to each dominant weight
Let be the irreducible module with highest weight vector of weight Then the defining relations for and the relations are a complete set of relations determining the irreducible module
(Weyl) Every finite dimensional representation of is a direct sum of irreducible representations.
Symmetry
Let be a finite dimensional module and define the following operator on
Proof. | |
For each is a bijection from the weight space to the weight space
Proof. | |
is a bijection since it is invertible with inverse Using Lemma (3.11) we have that Using the relations we can express the action of and on the subspace in terms of the matrices From this one easily computes that This gives that So we have that if then Then |
[Bou1968] N. Bourbaki, Groupes et algèbres de Lie, Chapitres 4, 5 et 6, Elements de Mathématique, Hermann, Paris, 1968. MR 39:1590
[Hum1972] J.E. Humphreys, Introduction to Lie Algebras and Representation Theory, Springer-Verlag, New York 1972.
[Kac1985] V. Kac, Infinite dimensional Lie algebras, Cambridge University Press 1985.
[Mac1991] I.G. Macdonald, Lecture Notes, University of California, San Diego, Spring 1991.
[Mac1979] I.G. Macdonald, Hall Polynomials and Symmetric Functions, Oxford Univ. Press, 1979.
Positive and negative roots
The roots are the elements of the set The positive roots and the negative roots are the roots in the sets respectively.
Let be a finite dimensional module.
1) | If is a weight of and then is a weight of |
2) | If is a weight of and then is a weight of |
Proof. | |
Let Using the defining relations for we can expand to write the action of on in the form Since the weight of is we get that and Since is a bijection so Thus is a weight of proving 1). 2) is proved similarly. |
Let be the irreducible module corresponding to the weight
1) | If is a weight of then |
2) | If is a weight of then |
3) | and cannot both be weights of |
4) | if and only if neither nor is a weight of |
5) | cannot hold for all |
Proof. | |
If is a weight so is But we know that all weights of are So proving 1). 2) is proved similarly. To prove 3) we see from 1) and 2) that and giving that But this implies that This is a contradiction (provided that the row of the Cartan matrix is not all zeros). Assume that If is a weight then is also a weight which is a contradiction to 3). The same argument shows that can not be a weight. This proves the forward implication of 4). Conversely, if neither nor are weights then and for any This shows that i.e., that Prove 5) by contradiction. If for all then for all Since this is true on a basis we have that But this implies that which is a contradiction. |
All roots are either positive or negative, i.e.,
Proof. | |
Let and let then by Lemma(5.2) 5),we know that there exists such that Then by Lemma (5.2) 1) and 2) we have that is either positive or negative. |
Let be a positive integer greater than 1. is not a root for any
Proof. | |
Suppose that is a root and let and be such that Consider the irreducible where Then is a weight of So is a root of But we know that all weights of are of the form where the are positive integers. Thus we have a contradiction since is not of this form. |
1) | permutes the set |
2) |
Proof. | |
1) Let Then for nonnegative integers Furthermore we know that since we must have for some Since we have that also has Thus, since is a root it must be a positive root. Let We show that This implies that So |
The Weyl chamber
The Weyl chamber is the subset of given by Note that
Every has a unique image in the Weyl chamber, i.e., there exists such that and that if then
Proof. | |
If then there exists such that and so in dominance. In this way we can construct a sequence of weights where in each case we have that for some If the Weyl group is finite this must stop, call the last element Then Now suppose that is also in Then Let be the irreducible module corresponding to let be a highest weight vector and let Since we have that for all This implies that for all Then by Lemma (5.1) 2) and Lemma (5.2) 3) and 4) we have that is not a weight of This implies that for all Thus is a highest weight vector. As has only one highest weight |
Length in the Weyl group
Since the Weyl groupW is generated by the simple transpositions every element can be written in the form is a reduced word for if is minimal. In this case is called the length of and denoted The sign of is defined to be One can also view as the homomorphism
Let and let be a simple reflection corresponding to the simple root
1) | |
2) |
Proof. | |
2) follows from 1) by replacing by |
If then
Proof. | |
For each
Proof. | |
By Lemmas () and () and induction on the length of |
Let be a reduced decomposition of Set for each Then the roots are distinct, and Furthermore every root such that is one of the
Proof. | |
If then there exists such that Since permutes the set we have that So This shows that But by Lemma () the cardinalities of these two sets are the same. |
Let be a finite dimensional irreducible module of highest weight and let be a highest weight vector.
Let and let be a reduced decomposition of Let denote is well defined up to scalar since we know that and that i.e., up to scalar multiples does not depend on the reduced decomposition of The Schubert image is the module
Let denote the identity element of and let
1) | |
2) | If then Furthermore if |
3) | If is such that for all then |
Proof. | |
Since is a highest weight vector giving 1). To prove 2), suppose that and let Then Since for some constant Thus The fact that the inclusion is proper if follows from the fact that all weights of are To show 3) we see that since for all then it follows from Lemma (5.2) 3) and 4) that then is not a weight of for any This means that for all So is a lowest weight vector, giving that |
Let be an irreducible module of highest weight Then there is a filtration of by Schubert images in the form Furthermore this filtration can be chosen such that for each there is no Schubert image with
Proof. | |
Construct a chain of elements in the following fashion. Let Inductively is defined to be where is such that In this way in dominance. This process must stop since is finite dimensional. We shall call the last element in this chain The various parts of Lemma (6.1) show that we have a filtration If there existed some Schubert image such that then we must have that as these are the lowest weights in this chain of Schubert images. Assume that and that Let be such that and let so that we get Since the form a basis we have that for and This shows that where Then we would have that both and are weights of which is a contradiction to Lemma (5.2) 3). |
Corresponding to each we write formally so that we have (Essentially we are just working with the group just using multiplication as our operation instead of addition.) Define for each element Define The ring is called the ring of Weyl group symmetric functions or the character ring. Define the character of a representation of to be where is the weight space of corresponding to Note that is an element of since, by Proposition (3.12), for every and
If then for all we have so that i.e. the coefficients are constant on each in By Proposition (5.6) each is of the form for a unique so that from which it follows that the orbit sums are an basis of (indeed a basis of
Let us use to denote the character of the irreducible is in a sense a generating function for the values since by definition The values are completely determined by the values and that
(Weyl character formula) Let be a dominant weight. The character of the irreducible representation corresponding to is given by where
Alternating symmetric functions functions)
A polynomial is or alternating, if Let be the linear mapping defined by for all If then
1) | is the space of elements of |
2) | If and for some then |
3) | The elements form a basis of |
Proof. | |
1) Let Then is because if we have by (7.3). Conversely if is then so that 2) If then and so 3) Suppose Then and therefore Since each in meets in just one point it follows that Now is of the form with If for some then and hence so that by 2). Hence in the sum is restricted to with each hence if we define then with So is a linear combination of the with and these are linearly independent since the orbits are disjoint (Proposition (5.6)). |
If and then
Proof. | |
We will use the assumption that the Cartan matrix is symmetrizable and let be the bilinear form on given by Then the fact that means that for all The fact that means that where the are integers Then which implies that |
(Weyl denominator formula)
Proof. | |
Let Then So is Thus, by Proposition (7.4) 3), can be written in the form where is the coefficient of in On expansion of we have that is in the form giving that (the coefficient of furthermore if for then we must have i.e. that By Lemma (7.5) this cannot be. Thus we have that |
If are not proportional then and are coprime in i.e. and have no common factors that are not units in
Proof. | |
This is proved in Bourbaki [Bou1968] Ch. VI, §3, Lemma 1. |
Each is divisible in by and is Furthermore the map is a bijection of onto the
Proof. | |
First show that for each divides for each Suppose that Define Note that and that Let be a system of representatives of the left cosets of the subgroup Then Thus it is sufficient to show that is divisible by for all Let so that we have that This shows that divides for all By Lemma (5.4) and Lemma (7.7) we know that the factors are pairwise coprime giving that divides The map is a bijection as it is invertible with inverse given by It is clear that if then since |
Since, (7.4) 3), the form an of the space of elements of hence by (7.8) the given by the Weyl character formula (7.2) are an of
The Demazure operator
The proof of Proposition (7.8) encourages us to define the following operator. For each simple root define the Demazure operator on the ring by Let Define where is a reduced word for It is sometimes helpful to view as an element of the group ring of the Weyl group over the ring of fractions of
is well defined and does not depend on the reduced decomposition of
Proof. | |
I do not know an easy proof of this. It follows from Theorem () below (which I will not prove either). |
1) | |
2) |
Proof. | |
The computation gives 1). 2) follows from the fact that if and is a reduced decomposition of then is a reduced decomposition of The second part follows similarly after interchanging with |
Let be such that for all Then
1) | For each |
2) | where the coefficients are elements in the field of fractions of |
Proof. | |
By Lemma () 2) we have that for all So and subtracting from each side gives 1). Let be a reduced decomposition of Let Then one gets easily by multiplying where the coefficients are rational functions in Re-expressing we get It follows from Proposition () that |
Let and let where Then
Proof. | |
Let be a simple reflection. Then using Lemma () ) This shows that for all giving that This means that But since is a minimal idempotent in the group algebra of we have that must be a multiple of follows by using Lemma () to compare coefficients of |
For each define another operator on by Note that one can define by defining for each and then defining where is a reduced word for
Let be such that for all and recall that denotes the Weyl character given by the Weyl character formula. Then one has
Proof. | |
Using Lemma () we have that The result follows from the Weyl character formula. |
We shall finish with the following deep and amazing theorem.
(Demazure character formula) For any subspace of a finite dimensional define where Then for every Schubert image
Proof. | |
We shall not prove this as this is much too deep a theorem to prove in a short time. The most accessible proof I know of is in [Jos1985]. |
Roots and weights
[Bou1968] N. Bourbaki, Groupes et algèbres de Lie, Chapitres 4, 5 et 6, Elements de Mathématique, Hermann, Paris, 1968. MR 39:1590
[Mac1991] I.G. Macdonald, Lecture Notes, University of California, San Diego, Spring 1991.
Enveloping algebra and representations
[Hum1972] J.E. Humphreys, Introduction to Lie Algebras and Representation Theory, Springer-Verlag, New York 1972.
[Kac1985] V. Kac, Infinite dimensional Lie algebras, Cambridge University Press 1985.
The character ring
[Bou1968] N. Bourbaki, Groupes et algèbres de Lie, Chapitres 4, 5 et 6, Elements de Mathématique, Hermann, Paris, 1968. MR 39:1590
[Mac1979] I.G. Macdonald, Hall Polynomials and Symmetric Functions, Oxford Univ. Press, 1979.
Schubert images and Demazure operators
[Dem1974] M. Demazure, Désingularisation des variétés de Schubert généralisées, Ann. Sci. École Norm. Sup. 7 (1974), 53–88.
[Dem1974-2] M. Demazure, Une nouvelle formule des characteres, Bull. Sc. Math. 98, (1974) 163-172.
[Jos1985] A. Joseph, On the Demazure character formula, Ann. Scient. Ec. Norm. Sup. 18, (1985) 389-419.
[LSe1986] V. Lakshmibai and C.S. Seshadri, Geometry of , J. of Algebra 100 (1986), 462-557.
This is a copy of lectures notes for 18.318 Topics in Combinatorics, MIT Spring 1992, Prof. G.-C. Rota, given by Arun Ram.