Recall that denotes either or .
Let . We define
This series is convergent for all . Let be the matrix norm
This satisfies the triangle inequality and also — this can be proved using Cauchy–Schwarz. Then for any with , we have
In particular, we see that is uniformly absolutely convergent on all compact subsets of . It follows that is a continuous function.
We have (for all , ):
.
if . (This is NOT true in general).
is invertible, with inverse .
.
.
The first point is obvious. Let’s prove (2) from which (3) and (4) follow. By definition,
(using that and commute!) | ||||
(putting ) |
which is equal to the right hand side. Rearranging the sums is valid by absolute convergence. Finally, (5) follows from . ∎
In fact the exponential map is differentiable as a function of . For this, recall that a function is differentiable at a point if there is a (necessarily unique) linear map such that
and in this case is called the derivative of at . (This definition is independent of the choice of norms on and ).
The exponential map is differentiable at the origin (zero matrix), and its derivative at the origin is the identity map from to itself.
In the above definition we have, , , , and we claim is the identity. Thus we need to show
which follows from the definition of the exponential map. Indeed,
which tends to zero as . ∎
In fact, the exponential function has derivatives to all orders at all points; this follows from the fact that it is given by power series that converge absolutely at all points and all of whose (formal) derivatives also converge absolutely at all points.
By the inverse function theorem, it follows from the remark that
The exponential map is a local diffeomorphism at : there exist neighbourhoods containing and containing such that is a smooth homeomorphism onto with smooth inverse.
In face we can take . The inverse of in this neighbourhood is
which is convergent when .
Of course, is not injective in general. For example, for .
For the next result it will be useful to know the following facts from linear algebra.
Let . Then is conjugate to a matrix of the form where
is diagonal
is upper triangular with ‘1’s on the diagonal
and commute.
(nonexaminable) This follows from Jordan normal form. Here’s a direct proof. Firstly write as a direct sum of generalised eigenspaces for : if is an eigenvalue of then we can write the characteristic polynomial where does not have as a root and is an integer. Then the image of on is the generalised eigenspace of . The kernel of is preserved by and does not have an eigenvalue equal to since is not a root of , which must be the characteristic polynomial of acting on . Thus
and by the rank-nullity theorem
is a decomposition of as a direct sum of the generalised eigenspace and a subspace preserved by . Repeating for each eigenvector gives the required decomposition of . This reduces the proof of the statement to the case where has only one eigenvalue . In this case, we can inductively choose a basis of such that, for , the image of in is an eigenvector of with eigenvalue . With respect to this basis, is then diagonal with ’s on the diagonal, and we get the required decomposition with . ∎
The exponential function is surjective.
First prove it for and as in Lemma 4.10. The case of diagonal matrices is easy (homework!) whereas for you can use that the power series for in terms of powers of is actually a polynomial (homework!).
For general , by conjugating (homework!) we can reduce to the case where as above. If and then
because and commute (so long as you choose and carefully — note that isn’t injective — homework!). ∎
The lemma is not true over ; as we will see, the determinant of is positive for all real matrices .
We have
Conjugate so that is an upper triangular matrix with diagonal entries , and then note that is also diagonal with entries (in the lecture I overcomplicated this!).
Thus
∎
The next proposition will be useful when we discuss Lie algebras of linear Lie groups.
(Lie product formula) We have
Note that as , as follows by taking of the left hand side. Therefore
Now take the limit as . ∎