Constructing algebraic groups from their Lie algebras. (Q1030253)

Let \(F\) be a field of characteristic \(0\), with algebraic closure \(K\). A connected algebraic group \(G\) over \(F\) is uniquely determined by its Lie algebra \(\mathfrak g\). Given an algebraic Lie algebra \(\mathfrak g\) over \(F\) (i.e., one which is the Lie algebra of an algebraic group over \(F\)), the author gives an algorithm for computing the unique connected algebraic group \(G\) with Lie algebra \(\mathfrak g\). Here, \(\mathfrak g\) is given as a set of basis vectors inside \(\mathfrak{gl}(n,F)\) for some \(n\). The algorithm then returns a set of defining polynomials for the group \(G\). The algorithm may be implemented in a computer algebra system, such as MAGMA. The algorithm consists of a number of subalgorithms. The first step is to decompose \(\mathfrak g\) into a semisimple part \(\mathfrak l\), a toral subalgebra \(\mathfrak t\), and an ideal \(\mathfrak n\) consisting of nilpotent matrices. Then algorithms are given to construct algebraic groups corresponding to a reductive, a semisimple, a toral, or a nilpotent Lie algebra. The reductive group is not necessarily connected; for the user who does not require connectedness, this algorithm produces a group corresponding to a reductive Lie algebra directly. Finally, the author gives an algorithm for putting the groups corresponding to these subalgebras together to obtain (defining polynomial equations for) the (connected) algebraic group corresponding to an arbitrary algebraic Lie algebra \(\mathfrak g\). In the last section, he describes some of his experiences with the implementation, in particular, the practical performance of the algorithm.