• Nie Znaleziono Wyników

Denote by Irr(g) a set of representatives of the isomorphism classes of the irreducible represen- tations of g

N/A
N/A
Protected

Academic year: 2021

Share "Denote by Irr(g) a set of representatives of the isomorphism classes of the irreducible represen- tations of g"

Copied!
3
0
0

Pełen tekst

(1)

A NON-LEVI BRANCHING RULE IN TERMS OF LITTELMANN PATHS

BASED ON A TALK BY JACINTA TORRES

1. The branching problem

Let g be a semisimple Lie algebra over C. Denote by Irr(g) a set of representatives of the isomorphism classes of the irreducible represen- tations of g.

Theorem (Weyl). If V is a finite dimensional representation of g, there there exist uniquely determined nonnegative integers mσ such that

V ' M

σ∈Irr(g)

σmσ.

Note that Weyl’s theorem is an analogue of Mashke’s theorem from representation theory of finite groups.

Let l be a semisimple Lie subalgebra of g. The branching problem is to find, for an irreducible representation of g, the decomposition of resgl V . A similar problem in the case of the embedding Sm ⊆ Sn, m ≤ n, has a well-know solution, namely

resSn

SmV (λ) =M

µ

V (µ)m(λ,µ),

where m(λ, µ) is the number of paths from µ to λ in the Young lattice.

2. Notation for Lie algebras

Let g be a semisimple Lie algebra over C. We denote by h a Cartan subalgebra of g. For example, if g = sl(n, C) is the algebra of n × n matrices with trace 0, then h is the subspace of the diagonal n × n matrices with trace 0.

For α ∈ h, let

gα := {g ∈ g : [h, g] = α(h)g, for each h ∈ h}.

Then g0 = h. By R we denote the set of α ∈ h such that α 6= 0 and gα 6= 0. We call the elements of R the roots of g. We also denote by Λ a (chosen) set of simple roots. It is known that

g= h ⊕M

α∈R

gα,

which is called the root space decomposition of g.

Date: 14.01.2020.

1

(2)

2 JACINTA TORRES

For example, if g = sl(n, C), then

R = {εi− εj : i 6= j}, where εi(diag(a1, . . . , an)) = ai, and

gεi−εj = CEi,j.

Moreover, as Λ we may choose the set consisting of αi := εi − εi+1, i = 1, . . . , n − 1.

We call µ ∈ hR an integral dominant weight, if hµ, αi := 2(µ,α)(α,α) is a nonnegative integer, for each α ∈ ∆. The cone spanned by the integral dominant weights is called the fundamental Weyl chamber. It is known that the irreducible representations of g correspond bijectively to the integral dominant weights. If λ is an integral dominant weight, then we denote the corresponding representation by L(λ).

It is known that if g = sl(n, C), then the integral dominant weights correspond to the partitions with at most n−1 part, where the bijection is given by the formula

(a1, . . . , an−1) 7→ a1ε1+ a2ε2 + · · · + an−1εn−1.

Let L be an irreducible representation of g. For µ ∈ h, we put Lµ:= {l ∈ L : h · l = µ(h)l, for each h ∈ h}.

If weight(L) is the set of µ ∈ h such that Lµ6= 0, then

L = M

µ∈weight(L)

Lµ

and we call it the weight decomposition of L.

3. Littelmann pathmodel

Let L be an irreducible representation of a semisimple Lie algebra g. By a Littelmann pathmodel of L we mean a set P (L) of paths [0, 1] → hR such that the following conditions are satisfied:

(1) if µ ∈ weight(L), then the number of η ∈ P (L) with η(1) = µ equals dim Lµ;

(2) η(0) = 0, for each η ∈ P (L),

(3) P (L) is generated by a single path by applying certain opera- tions.

If L = L(λ), then we write P (λ) instead of P (L(λ)).

We present a construction of P (λ) in the case g = sl(n, C) and λ is a partition with at most n−1 part. Let T (λ) be the set of Young tableaux of shape λ filled with letters 1, 2, . . . , n in a nondecreasing order in each row and in a increasing order in each column. For T ∈ T (λ) we denote by w(T ) the word obtained from T be reading each column

(3)

A NON-LEVI BRANCHING RULE 3

(starting from the right) from the top to the bottom. For example, if T is the diagram

1 2 2 2 3

of shape (3, 2), then w(T ) = 22312. For i ∈ {1, . . . , n}, let πi: [0, 1] → h

R be given by πi(t) := tεi. If w(T ) = w1· · · ws, then πT := πw1 ∗ · · · ∗ πws.

Finally,

P (λ) := {πT : T ∈ T (λ)}.

The following two theorems due to Littelmann are a sample of the strength of this model. First, a generalized Littlewood–Richardson rule says that

L(λ) ⊗ L(µ) =M

η

L(η(1)),

where η runs through the paths of the form ν ∗ π with ν ∈ P (µ) and η ∈ P (λ), which are contained in the fundamental Weyl chamber.

Next, a Levi branching rule states that if ∆0 ⊆ ∆, then resg

g∆0L(λ) = M

η

L0(η(1)),

where η runs through the paths in P (λ), which are dominant for g0. 4. The main result

Let g = sl(2n, C) and σ be the automorphism of g given by folding the Dyning diagram of type A2n−1. The set gσ of fixed points of σ is a semisimple Lie algebra isomorphic to a symplectic Lie algebra.

Moreover, hσ is a Cartan subalgebra of gσ and the restrictions of the simple roots form a set of simple roots for gσ.

For a partition λ and π ∈ P (λ) we denote by res(π) the path given by restricting π to h

R. Let domres(λ) be the set of such restrictions, which are contained in the Weyl fundamental chamber for gσ (with respect to the given set of simple roots). The main result of the talk is the following.

Theorem (Schumann, Torres). In the above situation resggσL(λ) = M

λ∈domres(λ)

Lσ(η(1)).

Cytaty

Powiązane dokumenty

W a l f i s z, Weylsche Exponentialsummen in der neueren Zahlentheorie, Deutscher Verlag Wiss., Berlin, 1963.. Institute of Mathematics Department of

It is a well-known fact that if a nonconvex-valued multimap F, representing the nonlinear part of the inclusion (∗) satisfies the Lipschitz condition, then the relaxation theorem

Theorem 1.2 (E. 133]) it is known that cubic congruences are connected with binary quadratic forms... This concludes

(Given a Steiner tree for a set of k vertices, one possible closed walk through those vertices would trace each edge of the Steiner tree twice.) The k-Steiner distance plus one

If {0, 4} is blue, then by using similar methods to those in Case 1, we immediately obtain a contradiction.. But this coloring forces a red K 4 on the set {x, y, z, 2},

3, 2} is the set of all real num- bers ` such that the following holds: every tree having an eigenvalue which is larger than ` has a subtree whose largest eigenvalue is `..

Though we have (13) for all but finitely many k by Mahler’s result, it seems difficult to prove effective bounds approaching the above in strength (see Baker and Coates [1] for the

The Christensen measurable solutions of a generalization of the Go l¸ ab–Schinzel functional equation.. by Janusz Brzde ¸k