LieARTA Mathematica application for Lie algebras and representation theory ?
We present the Mathematica application LieART (LieAlgebras and Representation Theory) for computations frequently encountered in Lie algebras and representation theory, such as tensor product decomposition and subalgebra branching of irreducible representations. LieART can handle all classical and exceptional Lie algebras. It computes root systems of Lie algebras, weight systems and several other properties of irreducible representations. LieARTs user interface has been created with a strong focus on usability and thus allows the input of irreducible representations via their dimensional name, while the output is in the textbook style used in most particle-physics publications. The unique Dynkin labels of irreducible representations are used internally and can also be used for input and output. LieART exploits the Weyl reflection group for most of the calculations, resulting in fast computations and a low memory consumption. Extensive tables of properties, tensor products and branching rules of irreducible representations are included as online supplementary material (see Appendix A). Program title: LieART Catalogue identifier: AEVL_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEVL_v1_0.html Program obtainable from: CPC Program Library, Queens University, Belfast, N. Ireland Licensing provisions: GNU Lesser General Public License No. of lines in distributed program, including test data, etc.: 183178 No. of bytes in distributed program, including test data, etc.: 411658 Distribution format: tar.gz Programming language: Mathematica. Computer: x86, x86_64, PowerPC. Operating system: cross-platform. RAM: ? ? 1 GB recommended. Memory usage depends strongly on the Lie algebras rank and type, as well as the dimensionality of the representations in the computation. Classification: 4.2, 11.1. External routines: Wolfram Mathematica 8-10 Nature of problem:  The use of Lie algebras and their representations is widespread in physics, especially in particle physics. The description of nature in terms of gauge theories requires the assignment of fields to representations of compact Lie groups and their Lie algebras. Mass and interaction terms in the Lagrangian give rise to the need for computing tensor products of representations of Lie algebras. The mechanism of spontaneous symmetry breaking leads to the application of subalgebra decomposition. This computer code was designed for the purpose of Grand Unified Theory (GUT) Model building, where compact Lie groups beyond the U(1), SU(2) and SU(3) of the Standard Model of particle physics are needed. Tensor product decomposition and subalgebra decomposition have been implemented for all classical Lie groups SU(N) ( N ) , SO(N) ( N ) and Sp(2N) ( 2 N ) and the exceptionals E6, E7, E8, F4 and G2. Solution method:  LieART generates the weight system of an irreducible representation (irrep) of a Lie algebra by exploiting the Weyl reflection groups, which is inherent in all simple Lie algebras. Tensor products are computed by the application of Klimyks formula, except for SU(N) ( N ) s, where the Young-tableaux algorithm is used. Subalgebra decomposition of SU(N) ( N ) s are performed by projection matrices, which are generated from an algorithm to determine maximal subalgebras as originally developed by Dynkin [1, 2]. Restrictions: Internally irreps are represented by their unique Dynkin label. LieARTs default behavior in TraditionalForm is to print the dimensional name, which is the labeling preferred by physicists. Most Lie algebras can have more than one irrep of the same dimension and different irreps with the same dimension are usually distinguished by one or more primes (e.g. 175 and 175? of A4). To determine the need for one or more primes of an irrep a brute-force loop over other irreps must be performed to search for irreps with the same dimensionality. Since Lie algebras have an infinite number of irreps, this loop must be cut off, which is done by limiting the maximum Dynkin digit in the loop. In rare cases for irreps of high dimensionality in high-rank algebras, if the cutoff used is too low, then the assignment of primes will be incorrect, but the problem can be avoided by raising the cutoff. However, in either case, this can only affect the display of the irrep because all computations involving this irrep are correct, since the internal unique representation of Dynkin labels is used. Running time: From less than a second to hours depending on the Lie algebras rank and type and/or the dimensionality of the representations in the computation. References: [1] E. Dynkin, Semisimple subalgebras of semisimple Lie algebras, Trans. Am. Math. Soc. 6 (1957) 111. [2] E. Dynkin, Maximal subgroups of the classical groups, Trans. Am. Math. Soc. 6 (1957) 245.
lie algebra representation theory tensor product irreducible representation branching rule lie group gut model building