Papers
Topics
Authors
Recent
Search
2000 character limit reached

Closed Form of the Baker-Campbell-Hausdorff Formula for the Generators of Semisimple Complex Lie Algebras

Published 20 Apr 2015 in math-ph, hep-ph, hep-th, math.MP, math.RT, and quant-ph | (1504.05174v2)

Abstract: Recently it has been introduced an algorithm Baker-Campbell-Hausdorff (BCH) formula, which extends the Van-Brunt and Visser recent results, leading to new closed forms of BCH formula. More recently, it has been shown that there are {\it 13 types} of such commutator algebras. We show, by providing the explicit solutions, that these include the generators of the semisimple complex Lie algebras. More precisely, for any pair, $X$, $Y$ of the Cartan-Weyl basis, we find $W$, linear combination of $X$, $Y$, such that $$ \exp(X) \exp(Y)=\exp(W) $$ The derivation of such closed forms follows, in part, by using the above mentioned recent results. The complete derivation is provided by considering the structure of of the root system. Furthermore, if $X$, $Y$ and $Z$ are three generators of the Cartan-Weyl basis, we find, for a wide class of cases, $W$, linear combination of $X$, $Y$ and $Z$, such that $$ \exp(X) \exp(Y) \exp(Z)=\exp(W) $$ It turns out that the relevant commutator algebras are {\it type 1c-i}, {\it type 4} and {\it type 5}. A key result concerns an iterative application of the algorithm leading to relevant extensions of the cases admitting closed forms of the BCH formula. Here we provide the main steps of such an iteration that will be developed in a forthcoming paper.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.