Highest Weight Paths

Highest Weight Paths

Arun Ram
Department of Mathematics and Statistics
University of Melbourne
Parkville, VIC 3010 Australia
aram@unimelb.edu.au
and

Department of Mathematics
University of Wisconsin, Madison
Madison, WI 53706 USA
ram@math.wisc.edu

Last updates: 28 January 2009

Highest weight paths

A highest weight path is a path p such that

eip=0,for all  1in.

A highest weight path is a path p such that, for each 1in,p is the head of the i-string Sip. Thus ptαi>-1 for all t and all 1in. So a path p is a highest weight path iff

pC-ρ,whereC-ρ=μ-ρ|μC.

Following the example at the end of Section 2, for the root system of the type C2 the picture is

Hα1+α2 Hα1 Hα2 Hα1+2α2 -ρ 0 C-ρ
the region C-ρ

If p is a highest weight path with wtpP then, necessarily, wtpP+. The following theorem gives an expression for the character of a crystal in terms of the basis sλ|λP+ of PW.

Let B be a crystal. Let charB be as defined in 'paths and i-strings' and sλ as in 'Schur functions'. Then

charB=pB,pC-ρswtp,
wherer the sum is over highest weight paths pB.

Proof.
Fix i, 1in . If pB let sip be the element of the -string of p which satisfies
wtsip=siwtp.

t h sip p Hαi

Then sisip=p and sicharB=pBXsiwtp=pBXwtsip=charB.

Hence charBPW

Let ε=wWdetwwso thataμ=εXμ,for μP

Since charBPW, charBaρ=charBεXρ=εcharBXρ and charB=1aρcharBaρ=εcharBXρaρ

=pBεXwtp+ρaρ=pBawtp+ρaρ=pBswtp.

There is some cancellation which can occur in this sum. Assume pB such that pC-ρ and let t be the first time that p leaves the cone C-ρ. In other words, let t>0 be minimal such that there exists an i with ptHαi,-1 where  Hαi,-1=λ𝔥*|λαi=-1.

Let i be the minimal index such that the point ptHαi,-1 and define sip to be the element of the i-string if p such that wtsip=sip

t h sip p Hαi,-1 Hαi

Note that since pitαi=-1,p is not the head of its i-string and sip is well defined. If q=sip then the first time t that q leaves the cone C-ρ is the same as the first time that p leaves the cone C-ρ and pt=qt. Thus siq=p and sisip=p Since swtsip=ssiwtp=swtp, the terms ssiwtp and swtp cancel in the sum in (3). Thus charB=pB,pC-ρswtp .

Recall the notations for Weyl characters, tensor product multiplicities, restriction multiplicities and paths from ELSEWHERE. For each λP+ fix a highest weight path pλ+ with endpoint λ and let Bλ  be the crystal generated bypλ+. Let λ,μ,νP+ and let J12...n. Then sλ=pBλXwtp,sμsν=qBν,pμ+qC-ρsμ+wtq,and  sλ=pBλ,pCj-ρJswtpJ.

Proof.

a) The path pλ+ is the unique ighest weight path in Bλ. Thus, by the previous theorem, charBλ=sλ.

b) By the "Leibnitz formula" for the root operators in Theorem ELSEWHERE, the set BμBν=pq|pBμ,qBν is a crystal. Since wtpq=wtp+wtq, sμsν=charBμcharBν=charBμBν=pqBμBν,pqC-ρswtp+wtq=qBν,pμ+qC-ρsμ+wtq, where the third equality is from the previous theorem and the last equality is because the path pμ+ has wtpμ+=μ is the only highest weight path in Bμ.

c) A J-crystal is a set of paths B which is closed under the operators ei, for jJ. Since sλ=charBλ the statement applies by applying the previous theorem to Bλ viewed as a J- crystal.

References [PLACEHOLDER]

[BG] A. Braverman and D. Gaitsgory, Crystals via the affine Grassmanian, Duke Math. J. 107 no. 3, (2001), 561-575; arXiv:math/9909077v2, MR1828302 (2002e:20083)