Section 5.8 Matrix Exponentials
How do you exponentiate matrices?
Recall the power series
which can famously be used to prove Euler's formula, namely
We can use this same strategy to exponentiate matrices, by using the corresponding power series. We therefore define
Let's consider some special cases. First consider a matrix \(M\) satisfying \(M^2=I\text{,}\) such as the Pauli matrices, see Section 5.6. For any such matrix, we have
For example,
and similarly
In fact, exponentiating a Hermitian matrix in this way always yields a unitary matrix, since
as can be verified by working term-by-term with the power series. The converse is also true; any unitary matrix \(U\) can be written as \(e^{iM\theta}\) for some Hermitian matrix \(M\text{.}\)
Remarkably, the eigenvector decompositions derived in the last section behave very nicely under exponentiation, as we now show.
Let \(M\) be Hermitian, and recall that we can expand \(M\) in terms of its eigenvectors and eigenvalues as
Notice that
since all cross terms cancel, and since each projection matrix squares to itself. Furthermore, recall that the projections add up to the identity matrix, that is,
Putting this all together, we see that
which shows explicitly how to relate the decompositions of Hermitian matrices and their corresponding unitary matrices. This remarkable result is much less surprising when expanded in terms of the given orthonormal basis, in which case \(M\) is diagonal, so that exponentiating the matrix is just exponentiating each of the eigenvalues.