7 SL3

7.9 Proof of theorem 7.28 — nonexaminable

Lemma 7.32.

Let (ρ,V) be a finite-dimensional representation of 𝔰𝔩3,C. Let vV be a highest weight vector of weight α, and let

W={ρ(Yn)ρ(Yn-1)ρ(Y1)v:n0,Yi{E21,E32}.

Then

  1. 1.

    W is a subrepresentation of V

  2. 2.

    Wα=v i.e. v is the unique weight vector in W of weight α, up to scaling.

  3. 3.

    W is irreducible.

Proof.
  1. 1.

    Let

    Wn={ρ(Ym)ρ(Ym-1)ρ(Y1)v:nm0,Yi{E21,E32}.

    Then

    W=n=0Wn.

    Firstly, it is clear that ρ(E21) and ρ(E32) take Wn to Wn+1, and so preserve W. Since

    ρ(E31)=ρ([E32,E21])=[ρ(E32),ρ(E21)]

    we see that ρ(E31) also preserves W.

    Secondly, every ρ(Ym)ρ(Ym-1)ρ(Y1)v is a weight vector (by the fundamental weight calculation) and so an eigenvector for all ρ(H), H𝔥. Thus ρ(H) preserves each Wn (and hence also W).

    Finally, we show that ρ(E12) preserves Wn. A similar proof then applies for ρ(E23), and then ρ(E13) preserves W by the same argument as for ρ(E31). We prove the statement for ρ(E12) by induction on n.

    For n=0, W0=v. Since v is a highest weight vector, ρ(E12)v=0 and so ρ(E12)(W0)W0.

    Suppose that the claim is true for n. Consider w=ρ(Yn+1)ρ(Y1)vWn+1 with Yi{E21,E32}. We must show that ρ(E12)wWn+1. Suppose first that Yn+1=E21. Then, as [E12,E21]=H12, we have

    ρ(E12)w =ρ(E12)ρ(E21)ρ(Yn)ρ(Y1)v
    =ρ(E21)ρ(E12)ρ(Yn)ρ(Y1)v+ρ(H12)ρ(Yn)ρ(Y1)v
    ρ(E21)ρ(E12)Wn+ρ(H12)Wn
    ρ(E21)Wn+Wn
    by the induction hypothesis and the fact that Wn is preserved by 𝔥
    Wn+1+Wn
    =Wn+1,

    as required. The proof in the case Yn+1=E32 is similar, using that [E12,E32]=0.

  2. 2.

    Note that if β the weight of ρ(Yn)ρ(Ym-1)ρ(Y1)v, with n and Yi as in the lemma, then a calculation using the fundamental weight calculation, as in the proof of lemma [[ref:lem-hwv-exists]], shows that

    l(β)=l(α)-n

    and so βα if n>0. Since these vectors span W, v is the unique (up to scalar) weight vector in W of weight α.

  3. 3.

    Suppose that W is reducible. By complete reducibility (Theorem [[ref:thm-complete-reducible-sl]]) we have

    W=UU

    for U,U nonzero proper subrepresentations of W. We must have v=u+u for unique uU,uU. The unicity implies that u and u are both weight vectors of weight α; by part 2, either u=0 or u=0. So without loss of generality v=uU. But then all ρ(Yn)ρ(Y1)vU as U is a subrepresentation, so W=U contradicting that U is a proper subrepresentation.

Remark 7.33.

It follows that W as in Lemma 7.32 is actually the subrepresentation generated by v, that is, the span of all vectors obtained by applying arbitrary elements of 𝔰𝔩3, some number of times. The content of the lemma is then that it suffices to apply only E21 and E32.

We are now ready to prove Theorem 7.28:

Proof.

First we show the existence. Let a,b0. Consider

V=Syma(3)Symb((3)*).

This has a highest weight vector v=e1a(e3*)b of weight aL1-bL3. Let W be the representation generated by v. Then W is irreducible by 7.32 part 3, and has a highest weight vector v of weight aL1-bL3. Thus we can take V(a,b)=W.

Next we show the uniqueness. Suppose that V,W are two irreducible representations with highest weight vectors v and w, respectively, of weight aL1-bL3. Let UVW be the representation generated by u=(v,w). Then U is irreducible by 7.32 part 3. The projection VWV sending (v,w) to v restricts to a homomorphism UV which sends u to v. This is therefore a nonzero homomorphism between irreducible representations, and so must be an isomorphism. Thus UV. Similarly UW, and so VW as required. ∎

In fact, it is possible to give an explicit description of the irreducible representations; see problem 97.

Theorem 7.34.

Let a,b0. Let V=3

ϕ:Syma(V)Symb(V*)Syma-1(V)Symb-1(V*)

be the map

(v1va)(λ1λb)i=1aj=1bλj(vi)(v1v^iva)(λ1λj^λb).

Then ϕ is a surjective 𝔰𝔩3,-homomorphism, and its kernel is the irreducible representation with highest weight aL1-bL3.