In homological algebra, Whitehead's lemmas (named after J. H. C. Whitehead) represent a series of statements regarding representation theory of finite-dimensional, semisimple Lie algebras in characteristic zero. Historically, they are regarded as leading to the discovery of Lie algebra cohomology.
One usually makes the distinction between Whitehead's first and second lemma for the corresponding statements about first and second order cohomology, respectively, but there are similar statements pertaining to Lie algebra cohomology in arbitrary orders which are also attributed to Whitehead.
The first Whitehead lemma is an important step toward the proof of Weyl's theorem on complete reducibility.
Without mentioning cohomology groups, one can state Whitehead's first lemma as follows: Let
ak{g}
f\colonak{g}\toV
f([x,y])=xf(y)-yf(x)
v\inV
f(x)=xv
x\inak{g}
H1(ak{g},V)=0
Similarly, Whitehead's second lemma states that under the conditions of the first lemma, also
H2(ak{g},V)=0
Another related statement, which is also attributed to Whitehead, describes Lie algebra cohomology in arbitrary order: Given the same conditions as in the previous two statements, but further let
V
ak{g}
ak{g}
ak{g} ⋅ V ≠ 0
Hq(ak{g},V)=0
q\geq0
As above, let
ak{g}
\pi:ak{g}\toak{gl}(V)
Let
ak{g}=\operatorname{ker}(\pi) ⊕ ak{g}1
ak{g}1
ak{g}
ak{g}1
(x,y)\mapsto\operatorname{tr}(\pi(x)\pi(y))
\pi
ak{g}1
ei
ak{g}1
ei
c
c=\sumieiei,
akg1
\pi
\pi(c)=\sumi\pi(ei)\circ\pi(ei):V\toV
\pi(ak{g})
\pi(x)\pi(c)=\pi(c)\pi(x)
x\inak{g}
\operatorname{tr}(\pi(c))=\sum
i)) | |
\operatorname{tr}(\pi(e | |
i)\pi(e |
=\dimak{g}1.
Now, by Fitting's lemma, we have the vector space decomposition
V=V0 ⊕ V1
\pi(c):Vi\toVi
i=0
i=1
\pi(c)
\pi(ak{g})
Vi
ak{g}
V=V0
V=V1
First, suppose
\pi(c)
\dim(ak{g}/\operatorname{ker}(\pi))=\operatorname{tr}(\pi(c))=0
\pi
ak{g}=[ak{g},ak{g}]
f
f(x)=0
x\inak{g}
v=0
Second, suppose
\pi(c)
\pi
xv=\pi(x)v
( ⋅ , ⋅ )
w=\sumeif(ei)
V
xw=\sumieixf(ei)+\sumi[x,ei]f(ei).
[x,ei]=\sumj([x,ei],ej)ej=-\sumj([x,ej],ei)ej
[x,ej]=\sumi([x,ej],ei)ei
xw
-\sumjejf([x,ej])=-\sumiei(xf(ei)-eif(x)).
xw=\sumieieif(x)=cf(x).
c
c-1
x
v=c-1w
\square