Optimal systems of Lie subalgebras: A computational approach

Abstract

Lie groups of symmetries of differential equations constitute a fundamental tool for constructing group-invariant solutions. The number of subgroups is potentially infinite and so the number of invariant solutions; thus, it is crucial to obtain a classification of subgroups in order to have an optimal system of inequivalent solutions from which all other solutions can be derived by action of the group itself. Since Lie groups are intimately connected to Lie algebras, a classification of inequivalent subgroups induces a classification of inequivalent Lie subalgebras, and vice versa. A general method for classifying the Lie subalgebras of a finite–dimensional Lie algebra uses inner automorphisms that are obtained by exponentiating the adjoint groups. In this paper, we present an effective algorithm able to automatically determine optimal systems of Lie subalgebras of a generic finite–dimensional Lie algebra abstractly assigned by means of its structure constants, or realized in terms of matrices or vector fields, or defined by a basis and the set of non-zero Lie brackets. The algorithm is implemented in the computer algebra system Wolfram Mathematica™; some meaningful and non-trivial examples are considered.