I J J J: Typeset by AMS-TEX
I J J J: Typeset by AMS-TEX
We fix a root system (E, (, ), R) and a set Π = {αi }i∈I of simple roots. Let
2(α ,α )
aij = (αji,αjj) .
Let F be the free Lie algebra on generators {ei , fi , hi |i ∈ I}. Let K be the ideal
of F generated by the elements
[hi , hj ], [ei , fj ] − δij hi , [hi , ej ] − aji ej , [hi , fj ] + aji fj .
Let F̄ = F/K. The images of ei , fi , hi in F0 are denoted by the same letters.
Let T be the tensor algebra on a vector space with basis {vi ; i ∈ I}. We write
vi1 vi2 . . . vis instead of vi1 ⊗ vi2 ⊗ . . . ⊗ vis . (These form a basis of T .) Define linear
maps hj , ej , fj : T − → T by:
hj (vi1 vi2 . . . vis ) = −(ai1 j + · · · + ais j )vi1 vi2 . . . vis ;
fj (vi1 vi2 . . . vis ) = vj vi1 vi2 . . . vis
Ps
ej (vi1 vi2 . . . vis ) = − k=1 δj,ik (aik+1 j + · · · + ais j )vi1 vi2 . . . v̂ik . . . vis .
Typeset by AMS-TEX
1
2 LIE ALGEBRAS
(c) Let f (s) be an iterated bracket of s elements fi1 , . . . , fis . Then [hj , f (s)] =
−(ai1 j + · · · + ais j )f (s) in F̄ .
As in (b).
(d) If s′ > s > 0 then [f (s), e(s′ )] is a linear combination of e(s′ − s).
Assume first that s = 1. We argue by induction on s′ . For s′ = 2 we have
[fj , [ei , ei′ ]] = [[fj , ei ], ei′ ] + [ei , [fj , ei′ ]] = [−δij hi , ei′ ] − [ei , δi′ ,j hj ] ∈ kei′ + kei .
Hence the result holds in this case. Assume now that s′ > 2. Then e(s′ ) =
[e(s′′ ), e(s̃′′ )] where s′′ +s̃′′ = s′ , s′′ < s′ , s̃′′ = s′ . If s′′ > 1, s̃′′ > 1 the result follows
from the induction hypothesis using Jacobi. If s′′ = 1 we have e(s′ ) = [ek , e(s′ −1)]
hence
[fj , [ek , e(s′ − 1)]] = [[fj , ek ], e(s′ − 1)] + [ek , [fj , e(s′ − 1)]] = const[hk , e(s′ −
1)] + [ek , lin.combe(s′ − 2)] = lin.combe(s′ − 1).
We now assume that s′ is fixed and use induction on s.
(e) If s > s′ > 0 then [f (s), e(s′ )] is a linear combination of f (s − s′ ).
Same proof as (d).
P
(f) For s ≥ 1, [f (s), e(s)] ∈ i khi .
Induction on s. If s = 1 this is clear. Assume that s ≥ 2. Then f (s) =
[f (s′ ), f (s − s′ )] where 0 < s′ < s. Then
[f (s), e(s)] = [[f (s′ ), e(s)], f (s − s′ )] + [f (s′ ), [f (s − s′ ), e(s)] = lin.comb.[e(s −
s′ ), f (s − s′ )] + lin.comb.[f (s′ ), e(s′ )] = lin.comb.hi .
(g) F̄ − + F̄ 0 + F̄ + is a Lie subalgebra of F̄ hence it is F̄ .
Follows from the previous points.
(h) The sum F̄ − + F̄ 0 + F̄ + is direct.
For λ ∈ E let
F̄λ = {x ∈ F̄ ; [hi , x] = 2(λ,α i)
(αi ,αi ) x∀i ∈ I}.
We have e(s) ∈ F̄αi1 +···+αis , f (s) ∈ F̄−αi1 −···−αis , hj ∈ F̄0 . It remains to observe
that αi1 + · · · + αis 6= 0 if s > 0.
Assume first that k 6= i. Then [ek , fi ] = 0 hence adek , adfi commute and
(adek )(adfi )−aji +1 (fj ) = (adfi )−aji +1 (adek )(fj ) = (adfi )−aji +1 [ek , fj ]. If k 6= j
this is 0 since [ek , fj ] = 0. If k = j this is (adfi )−aji +1 hj = (adfi )−aji aij fi . If
aji > 0 this is 0 since [fi , fi ] = 0. If aji = 0 this is also 0.
Assume next that k = i. Let m = −aji ≥ 0. One shows by induction on
t ≥ 1 that (adei )(adfi )t (fj ) = t(m − t + 1)(adfi )t−1 (fj ). Taking t = m + 1 gives
(adei )(adfi )t (fj ) = 0.
For i 6= j let Xij = (adei )−aji +1 (ej ), Yij = (adfi )−aji +1 (fj ) (in F̄ ).
Let J + be the ideal of F̄ + generated by the Xij . Let J − be the ideal of F̄ −
generated by the Yij . Let J be the ideal of F̄ − generated by the Xij , Yij . Let
L− = F̄ − /J − , L+ = F̄ + /J + , L0 = ⊕i khi , L = F̄ /J.
J + , J − are ideals of F̄ .
4 LIE ALGEBRAS
P
for all i. Then 0 = (λ, µ) = (w(λ), w(µ)) = i ki′ (αi , w(µ)). Hence some ki′ > 0,
some ki′ < 0.
If Lλ 6= 0 then either λ ∈ R or λ = 0.
We may assume that λ 6= 0. Then ±λ = αi1 + · · · + αin , n > 0. Assume that
λ is not a multiple of a root. Let w be as in the previous claim. We must have
Lw(λ) = 0. Hence Lλ = 0.
We have dim L = ♯(I) + ♯(R).
L is semisimple.
Let A bePan abelian ideal of L. Since A is stable under adhi we have A =
(A ∩ L0 ) + α∈R (A ∩ Lα ). Assume that Lα ⊂ A for some α. If i ∈ I we have
τi (A) ⊂ A hence Lri α ⊂ A. It follows that Lw(α) ⊂ A for any w ∈ W . Hence
Lαi ⊂ A for some i hence ei ∈ A. Since [fi , ei ] = hi we have hi ∈ A. Now
[hi , ei ] = 2ei 6= 0 contradicting the fact that [A, A] = 0. Thus we have A ∩ Lα = 0
0 0
for anyP α. Hence A = A ∩ L . Then P [Lαi , A] ⊂ Lαi ∩ LP= 0 for all i. Let
a = i ci hi ∈ A. For any j we have [ i ci hi , ej ] = 0 hence i ci aji = 0. By the
non-singularity of (aij ) we have ci = 0 for all i. Thus a = 0. We see that A = 0
hence L is semisimple.
L0 is a maximal toral subalgebra of L.
Clearly adx : L − → L is semisimple for any x ∈ L0 hence L is toral. Assume
that L is a toral subalgebra of L containing strictly L0 . Since L′ contains L0 , it is
′
a sum of L0 and some Lα . Thus L′ contains Lα for some α. Now any element of
Lα is nilpotent. (We can reduce this to the case where α = αi using a succession
of τj .) Since any element of L′ is semisimple we see that Lα = 0, contradiction.
Theorem. L is a semisimple Lie algebra whose root system with respect to L0 is
the given one.