Patrick Lei

All notes

Lie Algebras

Lectures by Eric Sommers, UMass, Fall 2019.

Abstract

The goal of the course is the classification of semisimple Lie algebras over the complex numbers and an introduction to their representation theory. The classification is essentially the same as that for simply-connected compact Lie groups, which are central objects in mathematics and physics. Topics covered include representations of sl(2), Jordan decomposition, structure theorems, Weyl groups, roots systems, Dynkin diagrams, complete reducibility, finite-dimensional representations and their characters formulas.

Disclaimer: Any errors in these notes are mine and not the instructor’s. In addition, these notes are picture-free (but will contain commutative diagrams) and may not be exactly the same as the lectures (I tend to leave out boring computations, streamline certain things, and use category theory).

1 Lecture 1 (Sep 3)

We will be using the book by Humphreys in this course, but we will not be following the book too closely. Homework will be approximately weekly, with the first due in two weeks.

1.1 Overview

First we will discuss symmetry. Recall the platonic structures and their dual structure. We can consider the finite reflection group that preserves the object, which leads us to the following question:

Question 1.

What are the finite reflection groups?

In the case of Lie Algebras, we will need our groups to preserve integer lattices (root systems), so we specialize the question:

Question 2.

What are the finite reflection groups that can be represented by integer matrices?

In two dimensions, only the dihedral group for the triangle, square, and hexagon are representable by integer matrices. We will reduce the classification of semisimple Lie algebras to the above question.

Intimately related to Lie algebras are Lie groups, which are just group objects in 𝐃𝐢𝐟𝐟. We will not need Lie groups in this course. However, it is worth mentioning that Lie algebras arise as the tangent space at the identity of a Lie group G. We can also pass to algebraic groups, which are just group objects in a category of varieties. The advantage of this approach is that we can work over arbitrary fields.

1.2 Basic Notions

We will now define Lie algebras. First recall that a k-algebra A is a k-vector space A with a bilinear map A⊗A→A. If A is unital, we call it central. If A is associative, then A is a monoid in 𝐕𝐞𝐜𝐭k.

Example 3.

An example of an associative algebra is a matrix algebra Mn⁢(k).

Definition 4.

A Lie Algebra 𝔤 is a k-algebra with a multiplication

satisfying the Jacobi identity:

Example 5.

From any associative algebra A, we can build a Lie algebra using the commutator as the Lie bracket. In particular, Mn⁢(k) can be turned into a Lie algebra 𝔤⁢𝔩n.

The notion of a morphism of Lie algebras is entirely analogous to the case of rings, so we can define Lie subalgebras.

Example 6.

Some subalgebras of 𝔤⁢𝔩n are the set of diagonal matrices, which is abelian, the set of strictly upper triangular matrices, and the set of upper triangular matrices 𝔟.1.

Definition 7.

A Lie algebra is abelian if [−,−]=0.

Example 8.

An important subalgbebra of 𝔤⁢𝔩n is the set 𝔰⁢𝔩n of matrices of trace 0.

Remark 9.

𝔰⁢𝔩n is what is called a simple Lie algebra whose Weyl group is Sn.

2 Lecture 2 (Sep 5)

2.1 Derivations

First we discuss derivations.

Definition 10.

Let A be a k-algebra. Then δ∈End⁡A is a derivation if

for all a,b∈A.

We will denote the derivations of 𝔤 by Der⁡𝔤.

Remark 11.

Der⁡𝔤 is a Lie subalgebra of End⁡𝔤.

The Jacobi identity is related to derivations. Recall the adjoint representation of a Lie algebra 𝔤.

Definition 12.

For x∈𝔤, write adx for the adjoint map

Now observe that

so we see that adx is a derivation.

2.2 Basic Examples

We will now expand our set of examples of Lie algebras.

Example 13.

The orthogonal group O⁡(n) is the set of matrices that preserve a Hermitian inner product. Equivalently, O⁡(n) is defined by the equation Xt⁢X=I.

Remark 14.

On the Lie group side, we may define subgroups of G⁢Ln via Xt⁢J⁢X=J for invertible matrices J. For Lie algebras, this differentiates to Xt⁢J+J⁢X=0.

Example 15.

For k=ℂ, the orthogonal Lie algebra is denoted by 𝔬⁡(n) and is given by J=I. We may also define the symplectic Lie algebra 𝔰⁢𝔭⁢(2⁢n) by

Remark 16.

The orthogonal groups behave differently in even and ood dimension. In fact, they are given by different classes of Dynkin diagrams.

Remark 17.

The four infinite families of simple Lie algebras are 𝔰⁢𝔭2⁢n,𝔬2⁢n,𝔬2⁢n+1,𝔰⁢𝔩n. There are five other exceptional simple Lie algebras.

2.3 More Basic Notions

We will now consider the basic structure of a Lie algebra.

Definition 18.

The derived subalgebra [𝔤,𝔤] of 𝔤 is the span of all elements of the form [x,y].

This is clearly a subalgebra of 𝔤, but in fact it is an ideal.

Definition 19.

An ideal I of 𝔤 is a subalgebra satisfying [𝔤,I]⊂I.

Example 20.

The center of a Lie algebra is an ideal. To see this, note that [A,X]=0 for all A∈𝔤 and X∈Z⁡(𝔤). Also, it is easy to see that the derived subalgebra is an ideal.

Definition 21.

A Lie algebra 𝔤 is nilpotent if the lower central series

eventually becomes 0.

Example 22.

Clearly all abelian Lie algebras are nilpotent because [𝔤,𝔤]=0.

Definition 23.

A Lie algebra 𝔤 is solvable if the upper central series

eventually becomes 0.

Example 24.

We note that all nilpotent Lie algebras are solvable because the upper central series is contained in the lower central series.

Example 25.

The set of all upper triangular matrices is solvable, and the set of strictly upper triangular matrices is nilpotent.

Definition 26.

The radical Rad⁡𝔤 is the maximal solvable ideal in 𝔤.

Definition 27.

A Lie algebra 𝔤 is semisimple if Rad⁡𝔤=0.

Definition 28.

A Lie algebra 𝔤 is simple if it has no nontrivial ideals and dimk𝔤≠1.

Example 29.

The simplest example of a simple Lie algebra is 𝔰⁢𝔩2.

Homomorphisms and quotients are defined entirely analogously to the case of rings or groups. Checking this is well-defined is left to the reader.

Remark 30.

The first isomorphism theorem holds for Lie algebras.

Recall that a representation of a finite group G is a morphism G→G⁢L⁢(V) for some vector space V. Alternately, this is a functor ℬ⁢G→𝐕𝐞𝐜𝐭k.

Definition 31.

A representation of a Lie algebra 𝔤 is a morphism 𝔤→End⁡V for some vector space V. Alternatively, we can define this as a 𝔤-module.2

3 Lecture 3 (Sep 10)

Recall the adjoint representation of a Lie algebra 𝔤. This is a very important representation. For a simple Lie algebra, ad is an isomorphism onto its image. In general, we will write ad⁡𝔤 for the image of the adjoint map. In general, the kernel of ad is the center.

Remark 32.

When we define the E8 algebra, which has dimension 248, we will have a 248-dimensional subalgebra of a 2482-dimensional Lie algebra.

Remark 33.

From now on, we will only consider finite-dimensional Lie algebras.

3.1 Nilpotent Lie Algebras

Notation 34.

We will denote the set of all strictly upper triangular matrices by 𝔫n⁢(k).

Eric then proceeded to spend time computing products and Lie brackets of matrices of the form ei⁢j.3 It is then clear that 𝔫 is nilpotent because bracketing shifts nonzero entries towards the top right corner.

We now discuss some properties of nilpotent Lie algebras.

Proposition 35.

The following hold for nonzero nilpotent Lie algebras:

  1. 1.

    Subalgebras and quotients of nilpotent Lie algebras are nilpotent.

  2. 2.

    If 𝔤/Z⁡(𝔤) is nilpotent, then so is 𝔤.

  3. 3.

    If 𝔤 is nilpotent, it has nonzero center.

Proof of these is easy and is omitted.

Remark 36.

The adjoint representation of a nilpotent Lie algebra consists entirely of nilpotent matrices.

Theorem 37 (Engel).

If adx is nilpotent for all x∈𝔤, then 𝔤 is a nilpotent Lie algebra.

First, we need the following lemma:

Lemma 38.

Suppose 𝔤⊂𝔤⁢𝔩⁢(V) consists of nilpotent endomorphisms. Then there exists v∈V∖0 such that z⁢v=0 for all z∈𝔤.

Proof of Engel’s Theorem.

Take the adjoint representation of 𝔤. By hypothesis, this consists of nilpotent endomorphisms. By Lemma 38, then we have a common eigenvector, which is in the center. Thus ad⁡𝔤 has smaller dimension than 𝔤.

To complete the proof with induction, we need to show that nilpotent matrices are sent to milpotent matrices by ad. However, this is clear from the definition of commutator and nilpotence of the original matrix. Now, by induction, ad⁡𝔤 is a nilpotent Lie algebra. Because ad⁡𝔤≃𝔤/Z⁡(𝔤), we use part 2 of Proposition 35 to conclude that 𝔤 is nilpotent. □

Proof of Lemma 38.

If K⊂𝔤 is a proper maximal subalgebra, then the adjoint representation of K descends to 𝔤/K. Then ad⁡z is nilpotent for z∈K. Therefore the image of K in 𝔤⁢𝔩⁢(𝔤/K) consists of nilpotent endomorphisms. By induction on dimension, there is a common engenvector w for K.

Now consider w=l+K. Then K+k⋅l must generate all of 𝔤 with K an ideal of 𝔤. Viewing K⊂𝔤⊂𝔤⁢𝔩⁢(V), induction gives us an eigenvector in V for K. Define W to be the subspace spanned by the eigenvectors of K. Then it is easy to check that l preserves W. Now choose v∈W an eigenvector of l, and then K+k⋅l annihlates v. Thus L annihlates v. □

4 Lecture 4 (Sep 12)

We began class ( 30 minutes) by finishing the class of Lemma 38 from last time.

4.1 More Nilpotent Lie Algebras

Corollary 39.

Let L⊂𝔤⁢𝔩⁢(V) consist of nilpotent endomorphisms. Then there exists a basis of V such that L is strictly upper triangular in this basis.4

Proof.

By Lemma 38, there exists a nonzero v1∈V such that L annihlates v1. Then L is nilpotent on V/⟨v1⟩. Now induct. □

Corollary 40.

If L is a nilpotent Lie algebra, and 0≠K⊂L is an ideal, then K∩Z⁡(L)≠0.

4.2 Solvable and Semisimple Lie Algebras

We now discuss solvable Lie algebras. We know already that nilpotent implies solvable. Recall that Rad⁡L is defined to be the maximal solvable ideal of L. This is unique and contains all solvable ideals.

Definition 41.

L is semisimple if Rad⁡L=0.5

Proposition 42.

Simple implies semisimple.

Proof.

[L,L]=L because L is simple, so L cannot be solvable. Therefore there are no nonzero solvable ideals. □

Now we will define a symmetric bilinear form κ:S2⁢(L)→k given by

known as the Killing form.6

From now on, we will work in an algebraically closed field of characteristic 0.

Theorem 43 (Killing).

L is semisimple if and only if κ is non-degenerate.

Theorem 44 (Lie).

If L⊂𝔤⁢𝔩⁢(V) is solvable, then there exists a common eigenvector for L.

We concluded class with a linear algebra review. Specifically, observe the following:

  1. 1.

    Diagonalizable is equivalent to semisimple;

  2. 2.

    If [x,y]=0, then:

    • •

      x,y nilpotent implies x+y nilpotent;

    • •

      x,y semisimple implies x+y semisimple.

  3. 3.

    If W⊂V and x⁡(W)⊂W, then:

    • •

      x|W is semisimple if x is semisimple.

    • •

      x|W is nilpotent if x is nilpotent.

5 Lecture 5 (Sep 17)

5.1 Jordan Decomposition

Class began with a discussion of the Jordan canonical form. In particular, recall:

Proposition 45.

x∈End⁡V can be written x=xs+xn where xs is semisimple and xn is nilpotent, and [xs,xn]=0. In particular, they are both polynomials in x with constant term 0. Finally, x⁡(B)⊂A if and only if xs⁢(B),xn⁢(B)⊂A for subspaces A⊂B⊂V.

Proof of this can be found in any standard algebra text. In addition, the decomposition is unique.

Now we would like to have the notion of Jordan decomposition in an arbitrary Lie algebra. This only has nice properties for semisimpe Lie algebras. In particular, we want:

  1. 1.

    If L⊂𝔤⁢𝔩⁢(V), then the Jordan decomposition agrees with that of 𝔤⁢𝔩⁢(V).

  2. 2.

    The Jordan decomposition respects morphisms.

Definition 46.

For a semisimple Lie algebra, an abstract Jordan decomposition is a Jordan decomposition of ad⁡x=ad⁡xs+ad⁡xn

Corollary 47.

Let x∈𝔤⁢𝔩⁢(V) with x=xs+xn. Then (ad⁡x)s=ad⁡xs and (ad⁡x)n=ad⁡xn.

Proof.

Note that if x is nilpotent, then ad⁡x is also nilpotent. In addition, if x is semisimple, choose a basis of V such that x is diagonal. Then it is easy to see that ad⁡x is semisimple. Finally, note that because xs,xn commute, so do their adjoint operators. □

Recall the symmetric bilinear form ⟨−,−⟩:Mn⊗Mn→𝔽 given by A⊗B↦tr⁡(A⁢B). We can verify that this is associative with respect to the Lie bracket:

Also, it is easy to verify that this bilinear form is nondegenerate. Now recall the Killing form on L given by

This is an associative symmetric bilinear form, but in general, it is degenerate.

Next time, we will show that

Theorem 48.

L is semisimple if and only if the Killing form is nondegenerate.

6 Lecture 6 (Sep 19)

6.1 Proof of Theorem 48

Today we begin with the proof of Theorem 48.

Lemma 49.

Let A⊂B be subspaces of 𝔤⁢𝔩⁢(V). Define

Suppose x∈M satisfies tr⁡(x⁢y)=0 for all y∈M. Then x is nilpotent.

Proof of this fact is in Humphreys and uses the Jordan canonical form and the fact that our field has characteristic 0.

Theorem 50 (Cartan’s Criterion).

Let L⊂𝔤⁢𝔩⁢(V). Suppose tr⁡(x⁢y)=0 for all x∈[L,L],y∈L. Then L is solvable.

Proof.

Note that it is enough to show that x∈[L,L] is nilpotent. We will apply Lemma 49 to A=[L,L],B=L. Note that L⊂M. We know that [L,L] is generated by [y,z] for all y,z∈L. Let m∈M. We know that

by hypothesis. Because [y,z] is a generator of [L,L], we know that tr⁡(x⁢m)=0 for all x∈[L,L],m∈M. By Lemma 49, x is nilpotent. □

Corollary 51.

Let L be a Lie algebra such that tr⁡(adx⁡ady)=0 for all x∈[L,L],y∈L. Then L is solvable.

Proof.

ad⁡L is solvable by the theorem. Then L is solvable because L≃L/Z⁡(L). □

Lemma 52.

Let I be an ideal of L and κI be the Killing form for I as a Lie algebra. Then κI=κ|I⊗I.

Proof of this amounts to the fact that the product respects the block form. To review some linear algebra, given a symmetric bilinear form β:V⊗V→𝔽, the radical is the kernel of the induced map x↦β⁡(x,−). Then β is nondegenerate if the radical is trivial. Then note that if β is a symmetric bilinear associative form on a Lie algbera, the radical is an ideal.

Proof of Theorem 48.

Let S be the radical of κ. Then it is easy to see that S is solvable by Corollary 51. Thus S⊂Rad⁡L. Thus if L is semisimple, S=0.

In the other direction, note that being semisimple is equivalent to having no nonzero abelian ideals. Let I be a nonzero abelian ideal of L. Choose x∈I,y∈L. Then L→ad⁡yL→ad⁡xI→ad⁡yI→ad⁡x0. Thus ady⁡adx is nilpotent, so it has trace 0. Thus x∈S and thus I⊂S. In particular, if κ is nondegenerate, then S=0, so every abelian ideal is zero. Therefore L is semisimple. □

Theorem 53.

L is semisimple if and only if there exists L1,…,Lt ideals of L which are simple such that L=L1⊕⋯⊕Lt. Here the direct sum is just the coproduct.

Also, note that every simple ideal in L coincides with some Li and that the direct sum decomposition is unique.

Proof.

Suppose L is semisimple. If L is simple, we are done. Otherwise, consider I⊂L a proper nonzero ideal. Then it is easy to see that I⟂ is an ideal and that L=I⊕I⟂. By induction, L is a direct sum of simple Lie algebras.

In the other direction, Note that [L,L]=⨁[Li,Li]=⨁Li=L. Also note that Rad⁡L=⨁Rad⁡Li=0. This gives semisimplicity. □

7 Lecture 7 (Sep 24)

We began class by finishing the proof of Theorem 53. Everything is in the notes from last time.

Remark 54.

If I is an ideal in L1⊕L2, then I=I1⊕I2.

Remark 55.

Let L be semisimple and I⊂L an ideal. Then I=Li1⊕⋯⊕Lik. In particular, the Li are the only simple ideals in L.

Thus our goal for this class is to classify the simple Lie algebras.

7.1 Some Classical Computations

Now recall the definition of the orthogonal Lie algebra. We will take J to be the identity matrix. For n=2, we have the set of matrices such that At+A=0, which is one-dimensional. However, we will consider n=4 with matrix

Proposition 56.

𝔰⁢𝔬4≃𝔰⁢𝔩2⊕𝔰⁢𝔩2.

Now we will compute the Killing form of 𝔰⁢𝔩2 explicitly. We will use the standard basis e,h,f. By the standard relations, we have:

Now we can see that

Now recall that a bilinear form is nondegenerate if and only if its matrix is nonsingular. In addition, a nondegenerate bilinear form gives an isomorphism to V∗. Thus we can construct a dual basis in V.

To motivate the dual basis, we can define a Casimir operator as follows: Choose a basis {xi} for L, and then choose a dual basis {yi}. Then in the universal enveloping algebra UL, consider Ω=∑xi⁢yi. Then Ω∈Z⁡(UL).

Now recall Schur’s Lemma:

Lemma 57 (Schur).

If V is an irreducible representation, then any nonzero equivariant endomorphism of V is a scalar.

8 Lecture 8 (Sep 26)

8.1 Representations of Lie Algebras

Recall the definition of a representation of a Lie algebra L. Note that this is equivalent to the notion of a module over L. Then recall that a representation is completely reducible (or semisimple) if it is a direct sum of irreducible representations.

Theorem 58 (Weyl).

If L is semisimple, then any representation of V is semisimple.

For finite groups, we have the analogous statement:

Theorem 59 (Maschke).

Let G be a finite group. If char⁡k∤|G|, then any k-representation of G is semisimple.

Remark 60.

The original proof of Weyl’s theorem was analytic and uses the unitary trick.

Note that if L is not semisimple, Weyl’s theorem can fail. For example, consider the standard two-dimensional representation of the set of upper triangular matrices. Then the x-axis is a subrepresentation, but there is no other common eigenvector.

Now we construct a representation structure on Hom⁡(V,W) by (x.f)(v)=x.f(v)−f(x.v), so L−𝐦𝐨𝐝 is enriched over itself. In particular, the dual space of a representation is also a representation. Finally, we may construct a tensor product representation by x.(v⊗w)=(w.v)⊗w+v⊗(x.w).

Remark 61.

The isomorphism V∗⊗W≃Hom⁡(V,W) holds in L-𝐦𝐨𝐝.

Remark 62.

The tensor-hom adjunction holds for representations of Lie algebras, so L-𝐦𝐨𝐝 is closed monoidal.

Proof of Schur’s Lemma.

Let 0≠π:V→W be a morphism of irreducible representations. Consider the kernel. For a nonzero morphism, this must be the source. In addition, the image must be nonzero, so it is the entire target.

To show any nonzero endomorphism is a scalar, use algebraic closure to find an eigenvalue. Then the kernel of π−λ⁢I is nonzero, so it must be all of V. □

Remark 63.

When we prove Weyl’s theorem, we use β⁡(x,y)=tr⁡(ϕ⁡(x)⁢ϕ⁡(y)). This is nondegenerate when the kernel is nonzero.

8.2 Jordan decomposition for Semisimple Lie Algebras

For an arbitrary Lie algebra L, call x∈L semisimple if ad⁡x is semisimple, and nilpotent if ad⁡x is nilpotent. Then we can decompose ad⁡x=(ad⁡x)s+(ad⁡x)n. What we will show is that

Lemma 64.

If δ∈Der⁡L, then δs,δn∈Der⁡L.

Lemma 65.

If L is semisimple, then Der⁡L=ad⁡L.

Now we can form an abstract Jordan decomposition of any semisimple Lie algebra.

Theorem 66.

Let ϕ be a representation of L and x=s+n be the Jordan decomposition in L. Then ϕ⁡(x)=ϕ⁡(x)+ϕ⁡(n) is the Jordan decomposition in 𝔤⁢𝔩⁢(V).

9 Lecture 9 (Oct 1)

9.1 Jordan Decomposition Continued

Proof of Lemma 65.

Recall that if L is semisimple, then L≃ad⁡L. Then we know that κ on ad⁡L is non-degenerate. Also, ad⁡L⊂Der⁡L is an ideal. Now take (ad⁡L)⟂ and note that ad⁡L∩(ad⁡L)⟂=0. Thus Der⁡L=ad⁡L⊕(ad⁡L)⟂. Then, by perpendicularity, the direct sub holds as Lie algebras.

We now recall that [δ,ad⁡x]=ad⁡δ⁡(x). Now for δ∈(ad⁡L)⟂, we have

However, L is semisimple, so δ⁡(x)=0 for all x. The desired result follows.. □

As a consequence, we can describe an abstract Jordan decomposition on a semisimple Lie algebra.

Corollary 67 (Jordan Decomposition).

Given x∈L, then the Jordan decomposition ad⁡x=(ad⁡x)s+(ad⁡x)n restricts to

for some xs,xn∈L. In particular, x=xs+xn.

Now note that [xs,xn]=0 because

by the usual Jordan decomposition and because L is semisimple.

Remark 68 (Eric’s Research).

Consider the group G=S⁢L2⁢(ℂ) with Lie algebra 𝔤=𝔰⁢𝔩2⁢(ℂ). Now G acts on 𝔤 by conjugation. We consider the following question:

What are the orbits of G on the set of nilpotent elements in 𝔤?

We find that there are two orbits of 𝔰⁢𝔩2 and that the set of nilpotents is a closed subvariety of 𝔤.

Theorem 69.

Let L⊂𝔤⁢𝔩⁢(V) be semisimple. Then the usual Jordan decomposition in 𝔤⁢𝔩⁢(V) agrees with the abstract Jordan decomposition in L.

Corollary 70.

Let ϕ:L→𝔤⁢𝔩⁢(V) be any representation of L. Let x=xs+xn be the abstract Jordan decomposition. Then ϕ⁡(x)=ϕ⁡(xs)+ϕ⁡(xn) is the usual Jordan decomposition in 𝔤⁢𝔩⁢(V).

9.2 Representations of 𝔰⁢𝔩2

We will classify irreducible representations of 𝔰⁢𝔩2. 7 Let V be some finite-dimensional representation of 𝔰⁢𝔩2. Recall that 𝔰⁢𝔩2 has standard basis e,h,f with the usual relations.

Now we note that h is semisimple in 𝔰⁢𝔩2, so ϕ⁡(h) is semisimple for any representation ϕ. Then we can take the eigenspace decomposition

Lemma 71.

If v∈Vλ, then e.v∈Vλ+2 and f.v∈Vλ−2.

Proof.

and

□

Next, because V has finite dimension, then there is an eigenspace Vλ that is killed by e. We will call any v0∈Vλ a maximal vector. Now define vi=1i!⁢fi.v0.

We will study the span of {vm,…,v1,v0}, where f.vm=0 but vm≠0.

Example 72.

Consider the usual 2-dimensional representation. Then e1 has eigenvalue 1 and e2 has eigenvalue −1. In addition, f.e1=e2 and e.e2=e1.

For the adjoint representation, f,h,e have weights −2,0,1.

We will show that ⟨vm,…,v0⟩⊂V is a subrepresentation:

Proposition 73.

The following are true:

  1. 1.

    h.vi=(λ−2⁢i).vi;

  2. 2.

    f.vi=(i+1)⁢vi+1;

  3. 3.

    e.vi=(λ−i+1)⁢vi−1.

Proof.

We only need to prove the third claim. Here, we note that

Corollary 74.

If V is irreducible, then Vλ is one-dimensional. In particular, V=⟨vm,…,v0⟩.

Now all we need to do is classify the highest weights and the dimensions for irreducible representations. Here we observe that

Because m is nonnegative and vm is nonzero, m=λ. Thus we have proved:

Theorem 75.

For an irreducible representation V, λ is a nonnegative integer and V has weights λ,λ−2,…,−λ.

Next time we will construct a representation with these weights.

10 Lecture 10 (Oct 3)

10.1 Representation Theory of 𝔰⁢𝔩2 Continued

Last time, we proved the following result:

Theorem 76.

There is at most one irreducible representation of 𝔰⁢𝔩2⁢(ℂ) of a given finite dimension. Furthermore, its weights are m,m−2,…,2−m,−m where m=dimV−1. In addition, all weight spaces are 1-dimensional and there is a unique maximal weight space.

This time, we will show:

Theorem 77.

There exists a unique irreducible representation of each positive dimension.

Proof 1.

We write down three matrices:

Checking this is left to the reader.8 □

Proof 2.

Let ℂ2 be the standard representation. Then note that (ℂ2)∗≃ℂ2. Thus we can consider the infinite-dimensional representation S⁡(V∗)=S⁡(ℂ2).9

Now we can take our representations to be Sk−1⁢(ℂ2). Then we can check that

Therefore we have the correct weights, so we are done. □

Now, Weyl tells us that a general representation of 𝔰⁢𝔩2 is a sum of the form

To find the multiplicities, just find the largest eigenvalue of h and take away weights of h.

10.2 Maximal Tori

Consider 𝔰⁢𝔩n and denote the set of diagonal elements by 𝔥. This is an abelian subalgebra, so we will find an analog for arbitrary semisimple Lie algebras.

Definition 78.

A subalgebra of L consisting of semisimple elements is a toral subalgebra..

Theorem 79.

Toral subalgebras are abelian.

Proof.

Let T be a toral subalgebra and choose x∈T. Because x is semisimple, ad⁡x is semisimple as a map T→T. Thus ad⁡x|T is semisimple.

Choosing an eigenvector y∈T, let yi be a basis of eigenvectors for ad⁡y. Now we write x=∑ci⁢yi, we have

which implies that [x,y]=0. □

We consider the action of H on L. Because ad⁡h are commuting semisimple operators, they are simultaneously diagonalizable.

Definition 80.

Define the root space

where α∈H∗.

Note that H⊂L0. In particular, L0=CL⁢(H) and

Example 81.

In 𝔰⁢𝔩n, [h,ei⁢j]=αi⁢j⁢(ti−tj)⁢ei⁢j. Thus

We conclude that H is a maximal torus and that H=L0.

11 Lecture 11 (Oct 08)

Recall our discussion of toral subalgebras from last time.

11.1 Tori in sln

Proposition 82.

tr⁡(ad⁡x⁢ad⁡y)=2⁢n⁢tr⁡(x⁢y) for x,y∈𝔥.

Proof.

Note ad⁡x has eigenvalues ti−tj and ad⁡y has eigenvalues ui−uj. Then

□

Corollary 83.

κ is nondegenerate on H.

Proposition 84.

H=CL⁢(H).

Proof.

Let x=∑ai⁢j⁢ei⁢j. Then

If x∉H, then ai⁢j≠0 for some i≠j. But then there exiss h∈H such that αi⁢j⁢(h)=ti−tj. □

Theorem 85.

In general, H=CL⁢(H) for any maximal torus H in a semisimple Lie algebra L.

11.2 The General Case

Take H⊂L to be a maximal torus.

Proposition 86.
  1. 1.

    For all α,β∈H∗, [Lα,Lβ]⊂Lα+β.

  2. 2.

    For x∈Lα with α≠0, ad⁡x is nilpotent.

  3. 3.

    For α,β∈H∗ with α+β≠0, Lα⟂Lβ.

Proof.
  1. 1.

    [h,[xα,xβ]]=[[h,xα],xβ]+[xα,[h,xβ]]=(α⁡(x)+β⁡(x))⁢[xα,xβ].

  2. 2.

    This follows from finite dimensionality of L.

  3. 3.

    −α⁡(h)⁢κ⁡(x,y)=κ⁡([x,h],y)=κ⁡(x,[h,y])=β⁡(h)⁢κ⁡(x,y). □

Corollary 87.

κ is nondegenerate on CL⁢(H).

Proof.

If κ⁡(x,y)=0 for all y∈CL⁢(H)=L0, then κ⁡(x,z)=0 for all z∈L. Thus x=0. □

Lemma 88.

If x is nilpotent and [x,y]=0, then κ⁡(x,y)=0.

Proof.

ad⁡x is nilpotent by definition, and because it commutes with ad⁡y, ad⁡x⁢ad⁡y must also be nilpotent. □

Proof of Theorem 85.

If x∈CL⁢(H), then adX⁡(H)=0. Therefore ad⁡xs⁢(H)=ad⁡xn⁢(H)=0, so xs,xn∈C.

Now suppose x∈CL⁢(H) is semisimple. Then H+𝔽⁢x is abelian and is toral because it consists of commuting semisimple elements. Thus x∈H.

Next we show κ is nondegenerate on H. Suppose κ⁡(h,h′)=0 for all h′∈H. Then choose z∈CL⁢(H). Because zn commutes with H, κ⁡(h,zn)=0 by Lemma 88. Thus h=0 by Corollary 87.

We now show CL⁢(H) is nilpotent. For z∈CL⁢(H), zs∈H, so ad⁡zs=0. On the other hand, ad⁡zn is nilpotent. Thus ad⁡z is nilpotent because zs,zn commute. By Engel, CL⁢(H) is nilpotent.

Next we show that H∩[CL⁢(H),CL⁢(H)]=0. Choosing [x,y]∈[CL⁢(H),CL⁢(H)] and h∈H, we see κ⁡([x,y],h)=κ⁡(x,[y,h])=0, so [CL⁢(H),CL⁢(H)]⟂H. Because κ is nondegenerate on H, H∩[C,C]=0.

Next note that Z⁡(CL⁢(H))∩[CL⁢(H),CL⁢(H)]≠0. Choose a nonzero z∈Z⁡(CL⁢(H))∩[CL⁢(H),CL⁢(H)]. Thus zs,zn∈Z⁡(CL⁢(H)). However, [CL⁢(H),CL⁢(H)] is an ideal, so zs∈[CL⁢(H),CL⁢(H)]∩H. Thus zs=0. Therefore κ⁡(z,CL⁢(H))=0. Thus z=0. Therefore CL⁢(H) is abelian.

Finally, we show that H=CL⁢(H). Choose z∈CL⁢(H). Then zn∈CL⁢(H), so κ⁡(zn,CL⁢(H))=0, so zn=0. Thus z=zs∈H. □

Corollary 89.

κ is nondegenerate on H.

Now we may identify H with H∗ using κ.10 In addition, we may write L=H⊕⨁α≠0Lα. We define the set of roots Φ={α∈H∗∣Lα≠0,α≠0.}.

12 Lecture 12 (Oct 10)

Last time we proved that κ is nondegenerate on H and that CL⁢(H)=H. Thus we may associate tα∈H to every α∈H∗.

Proposition 90.
  1. 1.

    Φ spans H∗.

  2. 2.

    If α∈H, then −α∈Φ.

  3. 3.

    If α∈Φ, x∈Lα,y∈L−α, then [x,y]=κ⁡(x,y)⁢tα.

  4. 4.

    If α∈Φ, then [Lα,L−α] is 1-dimensional.

  5. 5.

    α⁡(tα)=κ⁡(tα,tα)≠0 for all α∈Φ.

  6. 6.

    The span of Lα,L−α,tα is a copy of 𝔰⁢𝔩2.

  7. 7.

    hα=2⁢tακ⁡(tα,tα) and hα=h−α.

Proof.
  1. 1.

    If not, then thee exists h∈H such that α⁡(h)=0 for all α∈Φ. But this implies h∈Z⁡(L), which is a contradiction for nonzero h.

  2. 2.

    Recall that Lα⟂Lβ if α+β≠0. Thus κ⁡(Lα,L−α)≠0, so L−α is nonempty.

  3. 3.

    Just evaluate κ⁡(h,[x,y]). We have

  4. 4.

    Follows from the previous part.

  5. 5.

    The first part follows from the definition. Then if the inner product is zero, [tα,x]=0=[y,tα] for all x∈Lα,y∈L−α. Choosing nonzero x,y such that κ⁡(x,y)≠0, rescale so κ⁡(x,y)=1. Then [x,y]=tα. Then the subalgebra S spanned by x,tα,y is solvable. By Lie’s theorem, [adL⁡S,adL⁡S] consists of nilpotent matrices. Then tα is ad-nilpotent, so it must be 0, which is a contradiction.

  6. 6.

    Choose hα a multiple of tα such that [hα,x]=2⁢x. Now let c be such that hα=c⁢tα and choose yα such that κ⁡(yα,yα)=c.

  7. 7.

    c2⁢κ⁢(tα,tα)=κ⁡(hα,hα)=c⁢κ⁢(hα,tα)=2⁢c.

□

We will call the hα coroots and denote the set of coroots by Φ∨.

Example 91.

In 𝔰⁢𝔩n, α⁡(h)=ti−tj. Then hα=ei⁢i−ej⁢j.

Now let Sα be the 𝔰⁢𝔩2 associated to α. Then we consider L as an Sα-module. In particular, consider M=H⊕⨁cLcα. We can then write M=ker⁡(α)⊕Sα⊕M′, where M′ has all of the odd weights. Also, this shows that the Lα are one-dimensional.

Now we can also observe that if α∈Φ, no other positive multiple of α is in Φ.

13 Lecture 13 (Oct 17)

Recall our discussion of root systems from last time. We showed that all root spaces are one-dimensional and that if α is a root, no other positive multiple of α is a root. It is easy to show that:

Proposition 92.
  1. 1.

    [Lα,Lβ]=Lβ+α if α+β is a root.

  2. 2.

    β⁡(hα)∈ℤ and β−β⁡(hα)⁢α∈Φ.

  3. 3.

    The Lα generate L.

  4. 4.

    Say β+q⁢α∈Φ but β+q′⁢α∉Φ for q′>q. In addition, suppose β−r⁢α∈Φ but β−r′⁢α∉Φ for r′>r. Then β+i⁢α∈Φ for all −r≤i≤q.

Proof.

Consider the space M=⊕Lβ+i⁢α. Then M is an Sα-module. Then note the eigenvalues of hα are β⁡(hα)+2⁢i. Thus β⁡(hα)∈ℤ. In addition, the eigenvalues of hα are distinct and have the same parity. Thus the last part is true. To complete the second part, note that (β−β⁡(hα)⁢α)⁢(hα)=−β⁡(hα). To do the first part, note that ad⁡xα is surjective if and only if β+α is a root (because M is irreducible). Finally, the third part follows from the fact that the α span H∗. □

13.1 An Example: The symplectic Lie algebra

Use the standard symplectic form. Then a matrix X=(ABCD) is symplectic if and only if AT=−D,BT=B,CT=C. Thus 𝔰⁢𝔭2⁢n has dimension 2⁢n2+n. We can define H to be the set of diagonal matrices. Then everything simply restricts from 𝔰⁢𝔩2⁢n.

Restricting to 𝔰⁢𝔭4, we have four roots: t1−t2,2⁢t1,2⁢t2,t1+t2. Note that H∗ is an F-vector space. Now consider the ℚ-vector space Eℚ spanned by Φ.

Proposition 93.

dimℚEℚ=dimFH∗.

Proof.

Choose an F-basis of H∗ from Φ. Then for β∈Φ, we have β=∑ci⁢αi. Then taking the inner product with β and using that β⁡(hα)∈ℤ, we are done. □

Remark 94.

The inner product on Eℚ is positive-definite. Thus we can extend scalars to ℝ to obtain a Euclidean space.

14 Lecture 14 (Oct 22)

Last time, we defined the real Euclidean space associated to the root system Φ. Now we define the axioms of a root system.

14.1 Root Systems

Definition 95.

A root system is a collection of finitely many nonzero vectors Φ⊂E in a Euclidean space that satisfies:

(R1):

Φ spans E;

(R2):

If α∈Φ and c⁢α∈Φ, then c=±1.

(R3):

For α∈Φ, σα⁢(Φ)=Φ, where σα is the reflection through α.

(R4):

If α,β∈Φ, then ⟨β,α⟩≔2⁢(β,α)α,α∈ℤ.

Remark 96.

If we relax (R2), then our definition is called “reduced.” If we relax (R4), then our definition is called “crystallographic.”

Proposition 97.

Φ⊂E attached to L is a root system.

Proposition 98.

We showed last time that ⟨β,α⟩=β⁡(hα)∈ℤ. Also we showed that the root strings are unbroken and that β−β⁡(hα)⁢α is a root. We already knew that the inner product was positive-definite and that (R1) and (R2) hold.

Example 99.

In 𝔰⁢𝔩n+1, the roots are simply the εi−εj and we use the usual Euclidean structure on ℝn induced from 𝔤⁢𝔩n. Checking the axioms is easy.11

14.2 Classifying Root Systems

Note that (R4) limits the possibilities for ⟨β,α⟩. In addition, we can analyze the Weyl group. We can also consider ⟨β,α⟩⁢⟨α,β⟩=4⁢cos2⁡θα,β. This constrains the angles between the roots to be π/2,π/6,π/3,π/4,3⁢π/4,2⁢π/3,5⁢π/6,0,π.

Definition 100.

A root system E,Φ is reducible if E=E1⊕E2 and all roots are contained in either E1 or E2.

Example 101.

If dimE=1, then we only have one root system, A1. If dimE=2, then one possibility is the root system A1⊕A1, which is just an orthonormal basis. In addition, we have the case where α,β have angle 2⁢π/3, which is the A2 root system. If α,β have angle 3⁢π/4, then one has length 2 and the other has length 1. This is the root system B2. Finally, if θ=5⁢π/6, we have G2.

Definition 102.

The Weyl group is the group generated by the σα.

It is easy to see that W⊂SΦ. In particular, W is finite.

Example 103.

The Weyl group of An is Sn+1.

15 Lecture 15 (Oct 24)

Recall that the group S⁢Ln acts transitively on flags in ℂn. Then the stabilizer of any flag is the group B of upper triangular matrices. Then the set of all flags can be identified with G/B. This has a left action on G/B, so we have

Theorem 104 (Bruhat).

The orbits of B on G/B are indexed by the Weyl group.

A standard fact is that the orbit Xw is an affine space of dimension ℓ⁡(w). Here ℓ⁡(w) is the smallest number adjacent transpositions needed to write w. In addition, the closure of Xw is no longer smooth, and we can study its singularities, where Kazhdan-Lusztig polynomials appear.12.

15.1 Weyl Groups continued

Recall that the Weyl group preserves the inner product. Today we will discuss the analogue of the adjacent transpositions that allow us to define the length of an element in the Weyl group.

Remark 105.

Any irreducible root system has a corresponding semisimple Lie algebra.

Definition 106.

A set of simple roots Δ⊂Φ is a set of roots such that every root γ∈Φ can be written γ=∑Δcα⁢α, where all cα have the same sign. Also, Δ must span E.

Example 107.

α,α+β form a set of simple roots in A2.

Proposition 108.

W acts transitively on the set of bases.

Proposition 109.

Every root system has a base.

Proof.

Choose γ∈E to not be orthogonal to any root. Now define Φ+⁢(γ) to be the set of roots with positive inner product with γ. Now call β∈Φ+ indecomposable if β cannot be written as α1+α2 for positive roots αi. Now choose Δ⁡(γ) to be the set of indecomposable roots in Φ+⁢(γ).

Now we show that Δ⁡(γ) is a base and every base is of this form. It is easy to see that any positive root not in Δ is decomposable, so then it must be a sum of β1+β2. Then using the inner product and well-ordering, β must be a nonnegative sum.

Next we show that if α≠β∈Δ⁡(γ), then (α,β≤0). This is because otherwise, α−β is a root. Now either α−β or β−α is a positive root, which implies that either α or β is decomposible.

Next, we show that Δ⁡(γ) is linearly independent. If not, then we can take the inner product of some vector τ with itself to see that τ=0.

To show that every base is of this form, we can choose γ such that (α,γ)>0 for all α∈Δ. By construction, Δ⊂Φ+⁢(γ). Now note that Φ+ is the set of nonnegative combinations of Δ, so it is contained in Φ+⁢(γ). Also Φ−⊂−Φ+⁢(γ). By uniqueness of β=∑cα⁢α, Δ consists of indecomposable elements. Because both Δ,Δ⁡(γ) are bases of E, they must be the same. □

Now denote α⟂ by Pα. Then the connected components of E∖∪Pα are called Weyl chambers.

Theorem 110.

Let Δ be a base of Φ. Then W acts transitively on the set of Weyl chambers and on the set of bases. In addition, each base corresponds to a unique Weyl chamber. In fact, the action of W on the set of Weyl chambers is faithful.

16 Lecture 16 (Oct 29)

Let Δ be a base of Φ. Then define W′⊂W to be the subgroup generated by the simple reflections. Our goal is to show that W′=W. Then for any w∈W′, we define ℓ⁡(w) to be the smallest t such that w=σ1⁢⋯⁢σt.

Lemma 111.

For α∈Δ, σα permutes Φ+∖{α}.

Proof.

Note that σα only changes the α coefficient of any positive root β. However, this coefficient remains nonnegative. □

Lemma 112.

Let δ=12⁢∑α∈Φ+α. Then ⟨δ,α⟩=1.

Proof.

Write δ=12⁢(∑β≠αβ+α), apply σα, and then use the previous lemma. □

Lemma 113.

Suppose w=σi1⁢⋯⁢σit is reduced, then σi1⁢⋯⁢σit−1⁢(αt) is a negative root.

Now we define a partial order on ℤ⁡[Φ] where α≤β if β−α has positive coefficients in Δ. We write α>0 if α is a positive root.

Proposition 114.

W acts transitively on bases.

Proof.

First we show this for W′. Choose two bases Δ⁡(γ),Δ⁡(γ′). Then note that σ⁡(Δ⁡(γ))=Δ⁡(σ⁡(γ)). Also, σ sends positive roots to positive roots.

Choose σ∈W′ such that (σ⁡(γ),δ) is as large as possible. Then for α∈Δ, (σα⁢σ⁢(γ),δ)≤(σ⁡(γ),δ). This implies that (σ⁡(γ),α)≥0. Because γ is regular, so is σ⁡(γ). Therefore σ⁡(γ) is in the Weyl chamber associated to Δ, as desired. □

Next, any root β is part of some base, so it can be obtained from some simple root by a series of simple reglections. Next, we want to show that W′=W. This follows from the fact that g⁢σv⁢g−1=σg⁡(v) for any g∈O⁡(E).

Finally, we will show that W acts simply transitively on bases. Choosing a reduced expression for w, we have w⁡(αit)<0 if t≥1. However, w⁡(Δ)=Δ, so w⁢(α)it>0. This is a contradiction, so w=1.

This discussion defines a length function W→ℤ≥0. Then for w∈W, define Φ+⁢(w)={α∈Φ+∣w⁡(α)<0}. For example, Φ+⁢(1)=∅ and Φ+⁢(σα)={α}.

Proposition 115.

There exists a unique w0∈W such that Φ+⁢(w0)=Φ+.

Proof.

If Δ is a base, then so is −Δ. □

Lemma 116.

ℓ⁡(w)=#⁢Φ+⁢(w).

17 Lecture 17 (Oct 31)

The projector is on and the screen is down over the board. I do not know what Eric plans to do with the computer.

Recall that last time we defined the length function. We need to prove Lemma 116.

Proof of Lemma 116.

We use induction. It is true for w=1 and for w a simple reflection, so then we use the fact that the expressions are reduced to write Φ+(w′)=σit(Φ+(w)∖{αit). Checking this simply follows from applying σit to Φ+⁢(w′). □

Lemma 117.

Let C be a Weyl chamber for Δ. Then for λ,μ∈C¯, w⁡(λ)=μ only if λ=μ.

Now given Δ, we may associate its Dynkin diagram. To each simple root, we associate a node. There is no connection if two roots are orthogonal, one line if ⟨β,α⟩,⟨α,β⟩ are both −1, two lines if one is −2, and three lines if one is −3. The arrow points to the shorter root.

Example 118.

Some Dynkin diagrams:

  • •

    An:

  • •

    Bn:

  • •

    Cn:

  • •

    Dn:

  • •

    G2:

Now it is easy to see that if Φ is irreducible, then Δ can not be decomposed in the same way. Thus irreducibility is captured by the Dynkin diagram.

Proposition 119.

If Φ is irreducible, there are at most two lengths of roots.

Proposition 120.

If Φ is ireducible, there exists a maximal positive root and it is long.

Next we will classify the irreducible Dynkin diagrams and then show the existence of each possible Lie algebra. For now, we can assume that all roots have the same length (simply laced). We will consider the affine Dynkin diagram, formed by adjoining −θ to the diagram. Finally, we can decorate the affine diagram by the coefficients of Θ=∑α∈ΦKα⁢α. Also, if β1,…,βk are the nodes connnected to α, we have 2⁢Kα=∑Kβi.

18 Lecture 18 (Nov 5)

Recall the construction of the Dynkin diagrams from last time. Note that Φ is irreducible if and only if the Dynkin diagram is connected. Our goal is to classify irreducible root systems, which is equivalent to classifying connected Dynkin diagrams. Later, we will see that L is simple if and only if Φ is irreducible. Today, we will classify simply-laced (ADE) Dynkin diagrams.

Theorem 121.

The simply-laced connected Dynkin diagrams are the ADE.

Proof.

We will use the highest root θ, which is maximal in the partial order. We know that θ is unique, has positive inner product with all positive roots, and is long. We may adjoin −θ to the Dynkin diagram to obtain the affine Dynkin diagram.

By definition, we will attach a coefficient of 1 on −θ. For the extended diagram, we have 2⁢ci−∑i−jcj=0. We will use this fact to construct the decorated extended diagrams.

Starting from the coefficient of −θ, note that we can either have a degree 2 vertex with label 1, where the other vertices are also 1, or a vertex with 1 attached to a vertex with label 2.

In the first case, it is easy to see that all vertices we attach have label 1, so to have a finite diagram, we must form a cycle. Then we have An.

In the second case, if we branch at the label 2 vertex, it is easy to see that we have Dn. If we do not branch, then we attach a vertex with label 3.

In this case, the next vertex can be either 2 or 4. If we have a 2, then we need a third vertex with label 2 and to each vertex of label 2, we attach a 1. This gives us E6. If the fourth vertex is a 4, then the next vertex can be 2,3,5. In the case of either 2 or 3, we have E7. In the case of a 5, the next vertex is forced to be 6, which gives us E8. □

For non-simply laced root systems, we can show existence by writing down the Dynkin diagrams, writing down a list of vectors in an integral lattice of a given length, and showing that the inner product is integral. Then reflecting keeps us in the lattice.

Alternatively, we could use the computer to generate all roots from the Cartan matrix. This gives us a set of roots which is stable under simple reflections. Then this set is also stable under all reflections, and the integrality follows from this.

Proposition 122.

If L is simple, then Φ is irreducible. In ddition, if L is semisimple, then the decomposition into simples gives an orthogonal decomposition of Φ.

Proof.

Suppose Φ=Φ1×Φ2 and that α∈Φ1,β∈Φ2. If α+β is a root, it is in either Φ1 or Φ2. However, α+β has nonzero inner product with both α,β, so α,β commute. Thus the subalgebra K generated by Φ1 commutes with β, so K is a proper subset of L. Then K must be an ideal, so L is not simple.

For the second part, consider the decomposition into irreduciblesLi. Then the maximal torus H in L is simply a direct sum of the Hi. □

Corollary 123.

Φ is irreducible if and only if L is simple.

19 Lecture 19 (Nov 7)

We know that each semisimple Lie algebra gives us a Dynkin diagram, but we have not shown whether each Dynkin diagram gives us a Lie algebra. Also, we need to show that all maximal tori are conjugate and that two Lie algebras are isomorphic iff they have the same root system.

Lemma 124.

All maximal Borels of L are conjugate via Aut⁡(L).

We know this to be true for 𝔰⁢𝔩n by Lie’s theorem.

Lemma 125.

In a solvable subalgebra of L, all toral subalgebras are conjugate.

To generate automorphisms of L, we can take x∈L nilpotent. Then take exp⁡(ad⁡x), which is an automorphism of L. Then we call the group Int⁡(L) the group generated by exp⁡(ad⁡x) for x nilpotent.

Proposition 126.

If σ:L→L′ is an isomorphism that takes H to H′, then it induces an isomorphism of Φ,Φ′.

Proof.

Let h∈H, x∈Lα. Then [h,x]=α⁡(h)⁢x=α∘σ−1⁢(σ⁡(h))⁢σ⁢(x). Therefore σ⁡(x)∈Lα∘σ−1. Thus α⁢σ−1∈Φ′. Then note that σ takes root strings to root strings, so we must have ⟨β,α⟩=⟨β′,α′⟩. Thus σ∗ is an isomorphism of root systems. □

Definition 127.

H⊂L is a Cartan subalgebra if H is nilpotent and NL⁢(H)=H.

Proposition 128.

If L is semisimple and H is maximal toral, then H is a Cartan subalgebra.

Proof of this uses the decomposition of L into eigenspaces for H.

Theorem 129.

If L is semisimple and H is a Cartan subalgebra, then H is maximal toral.

Define the group E⁡(L) to be the collection of exp⁡(ad⁡x), where ad⁡x is called strongly nilpotent. Here, strongly nilpotent means that x∈La⁢(ad⁡y) for some y∈L and nonzero a.

Theorem 130.

If L is solvable, then all Cartans are conjugate under E⁡(L).

Theorem 131.

If L is a general Lie algebra, then all Borels are conjugate under E⁡(L).

Corollary 132.

If H is maximal toral, then H=CL⁢(s) for some s∈L semisimple.

Definition 133.

s∈L is called regular semisimple if CL⁢(s) has minimal dimension among all semisimple elements.

Example 134.

In 𝔰⁢𝔩n, the regular semisimple elements are the ones with all distinct eigenvalues.

Corollary 135.

All Borels containing Harise from some choice of positive roots Φ+.

Definition 136.

A parabolic subalgebra is a subalgebra containing a Borel.

Theorem 137.

All parabolic subalgebra is conjugate under E⁡(L) to a standard parabolic (block upper-triangular).

20 Lecture 20 (Nov 12)

From a Lie algebra L, we will construct its universal enveloping algebra U⁡(L). This is the left adjoint to the Lie functor from associative algebras to Lie algebras.13

Definition 138.

A pair (i,U) is a universal enveloping algebra for L if U is an associative algebra over k with a representation i:L→U satisfying the following condition: for any associative algebra A, if j:L→A preserves the Lie bracket, then j factors uniquely through i.

Proposition 139.

The universal enveloping algebra is unique up to unique isomorphism.

This follows directly from the universal property (equivalently from being the adjoint of the Lie functor).

Now we will show existence of the universal enveloping algebra. We will construct this by taking the quotient of the tensor algebra T⁡(V) by the relations [x,y]=x⊗y−y⊗x, recalling that the tensor algebra is the left adjoint of the forgetful functor from associative algebras to vector spaces. Note that the universal enveloping algebra is not graded.

Remark 140.

Later, we will see that L is isomorphic to its image in U⁡(L) (the unit of the adjunction).

It is easy to see that i⁡([x,y])=i⁡(x)⁢i⁡(y)−i⁡(y)⁢i⁡(x). This follows directly from the definition of U⁡(L).

Now we will show that (i,U) is universal. Note that the map L→A factors uniquely through T⁡(L). Then the map from T⁡(L) kills anything of the form x⊗y−y⊗x−[x,y], so it factors uniquely through U⁡(L).

Now given any left ideal of U⁡(L), we may consider modules U⁡(L)/I. There are also representations of L. We will use this technique to construct representations of semisimple Lie algebras.

Example 141.

Let L=𝔰⁢𝔩2. Then we can construct U⁡(L), which is a filtered algebra.14. The filtration is given by

Then the associated graded algebra is G=U0⊕U1/U0⊕⋯ with multiplication induced from U⁡(L). It is easy to see that G is commutative. In addition, it is easy to see that the Casimir element is x⁢y+12⁢h2+y⁢x, which is contained in the center of U⁡(L).

Now we try to construct the two-dimensional representation as a quotient of U⁡(L). Consider the ideal I=⟨x,h−1,y2⟩. Then U/I is spanned by 1,y.

21 Lecture 21 (Nov 14)

Note that by the universal property of the universal enveloping algebra, a representation of L is the same thing as a representation of U⁡(L). In fact, once we see that L⊂U⁡(L), then this gives an equivalence of categories between the two notions.

Theorem 142 (Poincare-Birkhoff-Witt).

Choose an ordered basis x1<x2<⋯ for L. Then the products xi⁡(1)⁢xi⁡(2)⁢⋯⁢xi⁡(m) where 1≤i⁡(1)≤i⁡(2)≤⋯≤i⁡(m) form a basis for U⁡(L).

Corollary 143.
  1. 1.

    L⊂U⁡(L).

  2. 2.

    If H⊂L, then U⁡(H)⊂U⁡(L). In addition, U⁡(L) is a free U⁡(H)-module.

Now recall that a semisimple Lie algebra can be decomposed as H⊕N⊕N−, where N is the sum of the weight spaces of the positive roots.

Also recall the symmetric and exterior algebras and their graded pieces. Next, if L is semisimple, ⋀L splits as an an L-module. We may ask in what degrees the trivial representation appears because ⋀mL is an L-module. This allows us to construct a “Frobenius polynomial” by

By a result of Konstant, this polynomial is

where m1≤⋯≤mn.

Example 144.

⋀2𝔰⁢𝔩2 is the irreducible representation with highest weight 2, so the Frobenius polynomial is 1+q3.

Corollary 145.

The PBW theorem is equivalent to the following: the associated graded algebra for U⁡(L) is isomorphic to S⁡(L).

After this, we went into a discussion about the infinite-dimensional exercise from the last homework. Now consider the ideal I⊂U⁡(𝔰⁢𝔩2) generated by x,h−λ. Then note U/I is generated by the image of 1. By construction, x kills 1 and h⁢.1=λ. Unfortunately, this is infinite-dimensional, so we need to kill some power of y. By PBW, all powers of y are linearly independent, so U⁡(L)/Iλ≃Z⁡(λ).

Now let L be semisimple with Borel H⊕N. Then N has a basis {xα} given by the positive roots Φ+ and H has a basis given by hi for αi∈Δ. Then for any λ∈H∗, we can define

22 Lecture 22 (Nov 19)

Today we will begin the classification finite dimensional irreducible representations of L for L semisimple. Let V be a finite dimensional representation of L. Then restricting to H, we obtain that

We denote the μ-weight space of V by Vμ.

Now recall that the Borel is associated to a set of simple roots. It is easy to see that B is solvable. By Lie’s theorem, there exists v+∈V such that B.v+∈F.v+. In particular, N.v+=0 and h.v+=λ⁡(h).v+ for some λ∈H∗.

We will call v+ a maximal vector and λ is called the highest weight. Now we consider what weights may occur as highest weights. If β∈Φ+, then a choice of nonzero xβ∈Lβ we have a unique hβ∈H,yβ∈L−β such that xβ,hβ,yβ is the usual basis of 𝔰⁢𝔩2. Now let Si be the 𝔰⁢𝔩2 associated to the simple root αi. Then because v+ is an eigenvector for hi, λ⁡(hi) must be a nonnegative integer. In addition, v+ is maximal for Si.

Definition 146.
  1. 1.

    Any λ∈H∗ is called a weight.

  2. 2.

    If ⟨λ,αi⟩∈ℤ for all i, then λ is an integral weight.

  3. 3.

    If ⟨λ,αi⟩∈ℤ≥0, then λ is dominant integral. If ⟨λ,αi⟩∈ℤ>0, then λ is strictly dominant.

We will call Λ the set of integral weights and Λ+ the set of dominant integral weights. We focus on the integral weights, which must be rational combinations of the simple roots. We know that amongst the roots of L there are at most two dominant integral weights: the highest long root Θ and the short dominant root Θs.

It is also easy to see that Φ⊂Λ, so we have ℤ⁡[Φ]⊂Λ⊂E≃ℝn. We call ℤ⁡[Φ] the root lattice and Λ the weight lattice.

Example 147.

In A2, the dominant region is 0<θ<π/3. An example of a dominant weight is 13⁢α1+23⁢α2.

In addition, the dominant integral root is α1+α2. Therefore 𝔰⁢𝔩3 is a highest weight representation for Θ=α1+α2.

The standard representation has maximal vector (1,0,0) and highest weight 13⁢(α2+2⁢α1).

This suggests

Proposition 148.

If V is a finite dimensional irreducible representation, then λ∈Λ+.

First recall that if R is a rint and L is some left ideal, then M≃R/I is a left ideal. In adition, M is a cyclic module (generated by one element).

Definition 149.

V is a standard cyclic module if V is cyclic and B.v+=𝔽⁢v+, where v+ is the highest weight vector.

Note that any standard cyclic module is of the form U⁡(L)/I, where I contains the span of xi,hi−λ⁡(hi).

Theorem 150 (Theorem on standard cyclic modules of highest weight λ).
  1. (a)

    V is spanned by ∏β∈Φ+yβiβ and V is a direct sum of its weight spaces.

  2. (b)

    The weights are of the form μ=λ−∑i=1nKi⁢αi.

  3. (c)

    For all μ∈H∗, Vμ is finite dimensional and dimVλ=1.

Proof.

Write L=N−⊕B. Then if u∈U⁡(L), by PBW, we have ∑I∏yβiI⁢uI, where β runs over the positive roots and uI∈U⁡(B). Then u.v+=∑I∏βyβiI⁢cI.v+. Because cI is a constant we have the first part of (a).

Next note that v+∈Vλ implies that w has eigenfunctional λ−∑ik⁢βk. This implies (a). For (b), just write βi as a sum of the αi.

Finally, fix μ∈H∗. We need to solve μ=λ−∑ik⁢βk in nonnegative integers. This is the same as writing λ−μ=∑ik⁢βk. Because the positive roots are nonnegative combinations of simple roots, there are a finite number of solutions. In addition, there is one solution for λ−μ. □

Remark 151.

The number of solutions of λ−μ=∑ik⁢βk is called the Kostant partition function. This is given by

We will prove additional parts of the theorem on standard cyclic modules.

Proposition 152.

Each submodule of V is a direct sum of its weight spaces.

Proof.

Let W⊂V be a submodule. Then w∈W is given by w=v1+⋯+vn. Then acting by h repeatedly, we obtain that vn∈W. Then we use induction. □

Proposition 153.

V is indecomposable with a unique proper maximal submodule.

Proof.

Note that any proper submodule W⊂V lies in a sum of weight spaces not containing Vλ. Therefore V is indecomposable. In addition, the sum of all proper submodules is the unique maximal submodule. □

Corollary 154.

Standard cyclic modules have a unique irreducible quotient.

23 Lecture 23 (Nov 21)

Recall that V is standard cyclic if it has a maximal vector which generates V. Now let Φ be an irreducible root system. Then we define the fundamental weights to be the dual basis to 2⁢αi(⁢αi,αi). We call the final weights λi (or ϖ). Then the λi are a ℤ-basis of Λ and the ℤ≥0-monoid spanned by the λi is Λ+.

In general, the λi can be written as ∑dj⁢αj, where 0<dj∈ℚ. As a consequence, we have

Proposition 155.

For λ∈Λ+, the number of μ∈Λ+ with μ<λ is finite.

Recall from last time that weight spaces in standard cyclic modules are finite-dimensional and that V has a maximal proper submodule. Therefore it has a unique irreducible quotient.

It turns out that the standard cyclic module Z⁡(λ) is isomorphic to U⁡(L)⊗U⁡(B)Dλ, where xα.v=0,h.v=λ⁡(h)⁢v. This is called the Verma module of high weight λ. By PBW, we know U⁡(L) is free over U⁡(B).

It is easy to see that the map from Z⁡(λ) to the Verma module is an isomorphism. Then consider the unique irreducible quotient V⁡(λ).

Theorem 156.

If λ∈Λ+, then V⁡(λ) is finite dimensional.

Lemma 157.

Any V⁡(λ) has a unique maximal vector.

Proof.

If there are two maximal vectors with weights λ,μ, then it is easy to see that λ=μ. We also know that Vλ is one-dimensional. □

Lemma 158.
  1. 1.

    [xj,yik+1]=0.

  2. 2.

    [hj,yik+1]=−(k+1)⁢αi⁢(hj)⁢yjk+1.

  3. 3.

    [xi,yik+1]=−(k+1)⁢yik⁢(k−hi).

Proof of Theorem 156.

Choose mi=⟨λ,αi⟩∈ℤ≥0. First set w=yimi+1. Then by Lemma 158, we have xj.w=xi.w=0, so N.w=0. Thus w is a maximal vector, but it has weight λ−(mi+1)⁢αi, so w=0.

This implies that V⁡(λ) contains a nonzero finite-dimensional Si-module for each i=1,…,n. Next we observe that V is a sum of finite-dimensional Si-modules. Now let W⊂V⁡(λ) be a finite dimensional Si-submodule. Then consider the span of xα⁢W for all α∈Φ. This is finite-dimensional and is an Si-submodule because [xi,xα] is either hi or xα+αi.

Now let S′ be the sum of finite-dimensional Si-submodules. Then clearly S′ is L-stable. Therefore because V⁡(λ) is irreducible, S′=V⁡(λ). Therefore, for each i, V⁡(λ) is a sum of finite-dimensional Si-submodules. However, each weight space is finite dimensional, so it is contained in some finite sum of finite-dimensional Si-modules. Finaly, the sum

is a finite-dimensional Si-module. Thus we need to show that there are finitely many strings. By the standard theory of 𝔰⁢𝔩2, we know that the string runs between μ,si⁢(μ), where si is the reflection across αi. Also, dimVSi⁢(μ)=dimVμ. Also, there exists w such that w⁡(μ)∈Λ+. Therefore all weights in V⁡(λ) are W-conjugate to a dominant weight μ+, so there are only finitely many strings of the form given above. □

24 Lecture 24 (Dec 3)

We begin by finishing the proof of Theorem 156. This is given at the end of the previous lecture.

Corollary 159.

Note that dimV⁢(λ)μ=dimV⁢(λ)w⁡(μ) for w∈W.

Now it remains to compute the dimension of V⁢(λ)μ and the dimension of V⁡(λ). We have formulas of Weyl, Freudenthal, and Kostant.

Consider G=Int⁡L the group of automorphisms of L generated by ead⁡x for x nilpotent. Then construct the flag variety G/B and the line bundle ℒλ=G×Bℂλ, where ℂλ is given by the character xi⁢xj−1.

Then we have:

Theorem 160 (Borel-Weil-Bott).

For any weight λ, we have

In addition, if w⁡(λ+δ) is strictly dominant for some δ,w, then ℒλ has a unique nonzero cohomology group

Theorem 161 (Kostant’s Formula).

For weights λ,μ, recall that dimZ⁢(λ)μ is the number of ways to write λ−μ as a nonnegative sum of positive roots. Write p⁡(λ−μ)=dimZ⁢(λ)μ. We have

25 Lecture 25 (Dec 5)

Note that V⁡(λ) is finite dimensional iff λ is dominant integral. Today we will compute dimV⁡(λ) and dimV⁢(λ)μ. First, we will capture the action of H on V. Assume that V is a direct sum of weight spaces for H (this is always true if V is finite-dimensional). Consider the group ring ℤ⁡[Λ] where μ∈Λ is represented by eμ (so we do not confuse multiplication and addition).

Definition 162.

The character of V=⨁μ∈H∗Vμ is

Then recall that dimZ⁢(λ)μ=p⁡(λ−μ).

Example 163.

The dominant weights (for A2) less than 2⁢α1+2⁢α2 are 2⁢α1+α2,α1+2⁢α2,α1+α2. Then we obtain p⁡(2⁢α1+2⁢α2)=3. More generally, p⁡(a⁢α1+b⁢α2)=min⁡(a,b)+1.

Example 164.

Note that V⁡(α1+α2)=L. In the Verma module, we see that α1+α2,α1,α2,α1−α2,α2−α1 have dimension 1, 0,−α1,−α2 have dimension 2, and −α1−α2 has dimension 3.

Now consider V⁡(2⁢α1+2⁢α2). Applying s1, then we obtain −α1+2⁢α2, and applying s2, we obtain 2⁢α1−α2. Then note that 2⁢α1+2⁢α2,α1+2⁢α2,2⁢α1+α2 have dimension 1, and α1+α2 has dimension 2, and 0 has dimension 3. Then we put this together to find that dimV⁡(2⁢α1+2⁢α2)=27.

Recall the notion of a composition series for a finite group. We apply the same notion here for R-modules over any rings R. In addition, when composition series exist, a version of the Jordan-Hölder theorem holds.

Theorem 165.

Every Verma module has a composition series. In addition, simple quotients are of the form V⁡(μ), where μ+δ is w-conjugate to λ+δ.

Call μ∼λ (linked) if there exists w such that w⁡(λ+δ)=μ+δ. Then define the set of μ≤λ that are linked to λ by Θ⁡(λ). then we have

Corollary 166.

ch⁡Z⁡(λ)=∑μ∈Θ⁡(λ)cμ⁢ch⁡(V⁡(μ)), where cμ∈ℕ.

This formula comes from analyzing a short exact sequence. By some Möbius inversion-like process, we obtain ch⁡(V⁡(λ))=∑μ∈Θ⁡(λ)dμλ⁢ch⁡(Z⁡(μ)).

26 Lecture 26 (Dec 10)

We can define a q-analog of the Konstant partition function:

Then we may deine a q-analog of multiplicity. Then for dominant integral λ,μ, mμλ⁢(q) has nonzero coefficients and is a Kazhdan-Lusztig polynomial for the affine Weyl group of L.

Sketch of proof of Theorem 165.

Consider 𝒵=Z⁡(U⁡(L)). In addition, consider a maximal vector v+ of weight λ. Then h.z.v+=z.h.v+=λ⁡(h)⁢z.v+ and xα.z.v+=z.xα.v+=0, so z.v+ is a scalar multiple of v+. Then this scalar is χλ:𝒵→𝔽. In fact, z∈𝒵 acts by this scalar on all of Z⁡(λ).

Next choose αi such that ⟨λ,αi⟩=m≥0. Then yαim+1.v+ is a maximal vector of weight λ−(m+1)⁢αi=sαi⁢(λ+δ)−δ. Then, after taking the quotient, we can obtain that χsi⁢λ=χλ. Thus, χλ is invariant under W.

Now using Harish-Chandra, if Z⁡(λ) is not irreducible, then we have a proper submodule V⊂Z⁡(λ). Then choose v a maximal vector of some weight μ. Then we have a morphism Z⁡(μ)→U⁡(L).v, so χμ=χλ, and thus λ∼μ. There are only finitely many μ such that μ∼λ, and each Z⁢(λ)μ is finite dimensional, so the process terminates with a composition series. □

Theorem 167 (Harish-Chandra).

For λ∈H∗, if χλ=χμ, then λ∼μ.

Remark 168.

𝒵=U⁢(L)G. In addition, by PBW, 𝒵≃S⁢(L)G. Finally, S⁢(L)G≃S⁢(H)W and is a polynomial ring ℂ⁡[f1,…,fn]. In addition, |W|=∏deg⁡fi. We may also define a q-analog

Theorem 169 (Weyl Character Formula).

For λ dominant integral, we have

Example 170.

For 𝔰⁢𝔩2, the Weyl character is

Theorem 171 (Weyl Dimension Formula).

Choose an invariant inner product on H∗. Then we have