Proving the Lie-Product formula

Let $A,B\in gl(n)$. Then prove $$e^{A+B} = \lim_{k\to\infty} \left (e^{\frac{A}{k}}e^{\frac{B}{k}}\right )^k$$

I found this theorem in this notes http://www4.ncsu.edu/~aalexan3/articles/liegroups.pdf but there is no proof. I am new to exponential of matrices and can't prove this by my own.

• Would you be happy with a more general proof assuming that $A$,$B$ are bounded operators on a Banach space? – user159517 Nov 25 '16 at 20:43
• @user159517 Sorry I have no knowledge on Banach space. But I don't mind seeing a more general proof. – Kenneth.K Nov 25 '16 at 20:50
• You can just read my answer thinking of $A,B$ as matrices and $\|.\|$ as some kind of matrix norm. – user159517 Nov 25 '16 at 20:52

Let $A,B \in \mathcal{B}(H)$ be bounded operators on some Banach space $H$. Define $C := e^{(A+B)/k}$ and $D := e^{A/k}e^{B/k}$. We have the following estimates for the norm of $C,D$: $$\|C\|, \|D\| \leq \exp\left[\frac{\|A\| + \|B\|}{k}\right] = \exp(\|A\| + \|B\|)^{1/k}$$ Applying the Cauchy-Product formula on $D$ yields $$D = e^{A/k}e^{B/k} = \sum_{i=0}^{\infty} \frac{(A/k)^{i}}{i!} \cdot \sum_{j=0}^{\infty} \frac{(B/k)^{j}}{j!} = \sum_{m=0}^{\infty} k^{-m} \sum_{i=0}^{m} \frac{A^{i}}{i!} \cdot \frac{B^{m-i}}{(m-i)!}$$ Which permits us to bound the norm of $C-D$ by \begin{align*} \|C-D\| &= \left\|\sum_{i=0}^{\infty} \frac{([A+B]/k)^{i}}{i!} - \sum_{m=0}^{\infty} k^{-m} \sum_{i=0}^{m} \frac{A^{i}}{i!} \cdot \frac{B^{m-i}}{(m-i)!} \right\| \\ &= \left\|\sum_{i=2}^{\infty} k^{-i} \frac{(A+B)^{i}}{i!} - \sum_{m=2}^{\infty} k^{-m} \sum_{i=0}^{m} \frac{A^{i}}{i!} \cdot \frac{B^{m-i}}{(m-i)!} \right\| \\ &\leq \frac{1}{k^2} \cdot\left[ \exp(\|A\| +\|B\|) + \sum_{m=2}^{\infty} \sum_{i=0}^{m} \frac{\|A\|^{i}}{i!} \cdot \frac{\|B\|^{m-i}}{(m-i)!}\right] \\ &= \frac{1}{k^2} \cdot\left[ \exp(\|A\| +\|B\|) + \sum_{m=2}^{\infty} \frac{1}{m!}\sum_{i=0}^{m} \binom{m}{i}\|A\|^{i} \cdot \|B\|^{m-i}\right]\\ &= \frac{1}{k^2} \cdot\left[ \exp(\|A\| +\|B\|) + \sum_{m=2}^{\infty} \frac{(\|A\|+\|B\|)^m}{m!}\right] \\ &\leq \frac{2}{k^2} \cdot \exp(\|A\| +\|B\|) \end{align*} We obtain $$\| C^{k} - D^{k} \| = \left\| \sum_{m=0}^{k-1} C^{m} (C-D) D^{k-m-1}\right\| \leq \exp(\|A\|+\|B\|)\cdot k \cdot \|C-D\|$$ where I used that $\|C\|^m\cdot \|D\|^{k-m-1} \leq \exp(\|A\|+\|B\|)^{\frac{k-1}{k}} \leq \exp(\|A\|+\|B\|).$ Together with the estimate for $\|C-D\|$, this yields $$\| C^{k} - D^{k} \| \leq \frac{2\exp(2\|A\| + 2\|B\|)}{k}$$ which proves the claim.
• Can you explain more on the last equation that $||C^k-D^k||=||\dots||\leq exp(||A||+||B||) k ||C-D||$? – Kenneth.K Nov 25 '16 at 21:38
• That's clearer. And for the last inequality, should it be $||C^k-D^k||\leq \frac{2\exp(2||A||+2||B||)}{k}$? – Kenneth.K Nov 25 '16 at 21:48