Suppose 𝔤 is abelian, so the bracket is zero. Then adX=0 for all X , so K(X,Y)=0 for all X and Y . The Killing form was introduced to equip 𝔤 with some interesting geometry, and defining the dot product of two vectors to be identically zero isn't an interesting geometry, so we want to focus on examples where this doesn't happen.
Dual Killing form
Killing form
Recall that any Lie algebra admits a symmetric bilinear form called the Killing form K(X,Y)=Tr(adXadY).
A symmetric bilinear form K
is called
We say that 𝔤
is
I'm being immoral here. The correct definition of semisimplicity is actually quite different from this, involving diagonalisability of certain matrices. It's then a theorem ("Cartan's criterion") that semisimplicity is equivalent to nondegeneracy of the Killing form. However, the way I've set things up, we don't need to know the usual definition of semisimplicity, but we do need to know about nondegeneracy of the Killing form.
Compact groups
Here is a theorem (which we won't prove; it will be an exercise) which gives a large class of examples of semisimple Lie algebras.
If G is a compact group then the Killing form K:𝔤×𝔤→𝐑 is (real-valued and) negative semidefinite, i.e. K(X,X)≤0 for all X∈𝔤 . Moreover K(X,X)=0 if and only if adX=0 , i.e. if X commutes with everything in the Lie algebra.
The
Recall that the centre Z(G) of a group G is the set of all elements g which commute with every other element of the group. It's possible to have Lie groups with nontrivial centre but where the Lie algebra has trivial centre, for example SU(2) has Z(SU(2))={±I} while Z(𝔰𝔲(2))={0} .
If G is compact and Z(𝔤)=0 then 𝔤 is semisimple.
Since Z(𝔤)=0 , K(X,X)<0 for all X∈𝔤∖{0} , so 𝔤 is semisimple.
Assume Z(𝔤)=0 . Let T⊂G be a maximal torus. Let 𝔱 be the Lie algebra of T . Let 𝔥=𝔱⊗𝐂 and 𝔥𝐑=i𝔱 . Then K|𝔥𝐑 is positive definite.
K(X,X)<0 , so K(iX,iX)=-K(X,X)>0 (unless X=0 ).
Another name for a positive-definite symmetric bilinear form K:V×V→𝐑
is a
The dual
Definition
Remember that our weight diagram lives in 𝔥*𝐑 , not in 𝔥𝐑 .
If K:V×V→𝐂 is a nondegenerate symmetric bilinear form then V* inherits a symmetric bilinear form K*:V*×V*→𝐂 .
-
There is an isomorphism ♯:V*→V (its inverse is called ♭:V→V* ) defined in the following way: K(α♯,v)=α(v) for all α∈V* and v∈V .
This uniquely determines the map ♯ because K is nondegenerate (it will be an exercise to see this).
-
Define K*(α,β)=K(α♯,β♯) .
More concretely...
To make this a little less abstract, let's write out what this means in terms of matrices. Pick a basis e1,…,en of V and define a matrix K whose i,j entry is Kij=K(ei,ej) . Then K(v,w)=K(∑iviei,∑jwjej)=∑i,jviwjKij.
Given α∈V* , we can think of α as a row vector (α1⋯αn) and we want to produce a column vector α♯=(α♯1⋮α♯n) such that K(α♯,v)=α(v) for all v∈V .
We have α(v)=∑αjvj K(α♯,v)=∑Kijα♯ivj. Now taking coefficients of vj on both sides we get αj=∑iKijα♯i.
Since Kij is symmetric, this implies αj=∑iKjiα♯i , which we can write as αT=Kα♯. Hence α♯=K-1αT.
This only makes sense if Kij is invertible, and this turns out to be equivalent to nondegeneracy. The flat map is then given by v♭=(Kv)T , which makes sense even if K is degenerate.
Finally, let's define K*ij by K*(α,β)=∑K*ijαiβj . Since K*(α,β):=K(α♯,β♯) , we have ∑K*ijαiβj=∑KijK-1ipαpK-1jqβq=∑K-1pqαpβq.
Therefore K*ij=K-1ij . So if we want to compute the matrix of the dual symmetric bilinear form K* (with respect to the dual basis), we first compute the matrix of K , then we invert it.
Example
For SU(3) , we calculated K(H13,H13)=K(H23,H23)=12 and K(H13,H23)=6 for the Killing form on 𝔥𝐑 (spanned by e1=H13 and e2=H23 ). So, as a matrix Kij=K(ei,ej) , we get K=(126612).
On the dual space 𝔥*𝐑 , we therefore get K*=1108(12-6-612). Let e♭1 and e♭2 be the dual basis of 𝔥*𝐑 . Then |e♭i|=1/3,e♭1⋅e♭2=-6/108, so if ϕ is the angle between these two vectors then cosϕ=-6×9/108=-1/2 , and ϕ is 120 degrees.
This is why I was drawing my k and ℓ axes at 120 degrees to one another in SU(3) weight diagrams.