Sage can be used to do standard computations for Lie groups and Lie algebras. The following categories of representations are equivalent:
.
. This is a
real Lie algebra, so representations are not required to be complex
linear maps.
. This
is a complex Lie algebra and representations are required to be
complex linear transformations.
having
as its Lie algebra.
.
.For example, we could take
,
,
and
. Because these categories are the same, their
representations may be studied simultaneously. The above equivalences
may be expanded to include reductive groups like
and
with a bit of care.
Here are some typical problems that can be solved using Sage:
is a subgroup of
, study the restriction of modules for
to
. The solution to this problem is called a branching rule.In addition to its representations, which we may study as above, a Lie group has various related structures. These include:
.Sage contains methods for working with these structures.
If there is something you need that is not implemented, getting it added to Sage will likely be possible. You may write your own algorithm for an unimplemented task, and if it is something others will be interested in, it is probably possible to get it added to Sage.
Sage supports a great many related mathematical objects. Some of these properly belong to combinatorics. It is beyond the scope of these notes to cover all the combinatorics in Sage, but we will try to touch on those combinatorial methods which have some connection with Lie groups and representation theory. These include:
.
and the affine Weyl group.