Introduction

This chapter gives functionality for direct sums of highest weight representations (or modules). This is an important class of representations of (almost) semisimple Lie algebras (Chapter LIE ALGEBRAS) and connected reductive algebraic groups (Chapter GROUPS OF LIE TYPE). This class includes all finite dimensional representations if the base field is the complex field.

The representations we are considering are in bijection with sets of dominant weights with multiplicities. Such sets are called decomposition multisets. Many interesting computations in representation theory can be done combinatorially with weight multisets, without the need to construct the module itself. Examples of the things we can compute include: module dimension, the multiset of all the weights, and decomposition multisets for symmetric powers, alternating powers, and tensor products. We can also restrict a decomposition multiset to a subgroup or induce it to a supergroup.

The code for such combinatorial computations is based on the LiE software package [vLCL92]. The algorithms for computing the actual representations are from [dG01] in the Lie algebra case, and from [CMT04] in the group case.

Highest Weight Modules

This introduction is inspired by the LiE manual [vLCL92].

First consider connected reductive Lie groups over the complex field. If G is a connected reductive complex Lie group, then it is a homomorphic image G=ξ(G'), where ξ is a Lie-group homomorphism with finite kernel and G' is the direct product of a simply connected group and a torus. Recall that a simply connected group is a direct product of simple simply connected groups. In particular, such groups are determined by their Cartan name and the dimension of the torus. For example, we denote the direct product of the group of type A₄ C₃ B₂ with a two dimensional torus by A₄ C₃ B₂ T₂. Most of the code ported from LiE works only for groups of this form. Similar terminology is used for the root datum corresponding to a group.

Connected reductive complex Lie groups have a very pleasing representation theory:

--

Every module decomposes as a direct sum of irreducible representations.

--

The (finite dimensional) irreducible representations correspond to dominant weights.

Multisets of weights can be used for other purposes as well: The multiset of all weights occurring in a module M is called the character multiset. Since the Weyl group permutes the weights occurring in the character of M, it suffices to consider only the dominant weights with their multiplicities. This is called the dominant character multiset. In the LiE system, multisets of weights are represented by polynomials: for example, the decomposition multiset is called a decomposition character.

When using the functions in this section, it is important to keep track of which kind of multiset you are using. For example, if you input a decomposition multiset to a function that expects a dominant character multiset, the output is meaningless.

We often abbreviate decomposition multiset to decomposition, and similarly for character multisets. Write R_D for the root datum of the group of the decomposition D. Denote the irreducible module for the group with root datum R with highest weight v by V^R_v, or to V_v if R is clear from the context.

It is often useful to define consider virtual multisets, which allow weights to have negative multiplicities. We call a virtual multiset proper if its weights all have nonnegative multiplicities. A decomposition corresponds to an actual module if and only if it is proper.

Toral Elements

Many functions use a special syntax for finite-order elements of the torus of a Lie group G (we are rarely interested in infinite-order elements). Recall that a weight is in fact a mapping from the torus T to C^star, and thus a weight λ can be evaluated at an element t ∈T. The resulting element is written t^λ. A set of fundamental weights ω₁, ..., ω_r has the property that any element t ∈T is uniquely determined by the values t^ω₁, ..., t^ω_r. Therefore, we may represent t as a vector (a₁, ..., a_r, n), with the property that t^ω_i = e^{2 π i a_i / n} = ζ_n^a_i, where ζ_n = e^{2 π i / n} is the canonical n-th root of unity. An example of a function which uses this syntax for toral elements is Spectrum. This function also provides a means to convert toral elements into a more natural form: see Example H114E10.

Other Highest Weight Representations

Magma can also construct highest weight representations for:

--

(Almost) reductive Lie algebras (Chapter LIE ALGEBRAS); and

--

Split groups of Lie type (Chapter GROUPS OF LIE TYPE).

For groups of Lie type, we consider projective representations (i.e., homomorphisms to a projective general linear group). Suppose G is a split group of Lie type defined over the field k and r is the least common multiple of the nonzero abelian-group invariants of the coisogeny group of G (see Section Isogeny of Split Reduced Root Data). Let K be an extension of k containing at least one rth root of each element of k (i.e., K contains a Kummer extension). Then highest weight representations are projective representations defined over K, and are constructed using polynomial functions and rth roots.

If k already contains all rth roots, then no extension is needed and the representation will be linear rather than projective. This happens when r=1, i.e., the coisogeny group is torsion free. This includes direct products of a simply connected group and a torus. The general linear group also has this property. It also happens when k is the complex field or field of algebraic numbers, when k is the real field and r is odd, and when k is finite and |k| - 1 is coprime to r.

The functions give a warning when the representation is not linear, but this can be avoided using the optional parameter NoWarning. Note that an appropriate extension K can be constructed for all fields other than rational function fields, fields of Laurent series, and local fields. In these cases, as well as for nonfields, the representations can only be computed when r=1. [Next][Prev] [Right] [____] [Up] [Index] [Root]