Logarithm Of A Matrix

In mathematics, a logarithm of a matrix is another matrix such that the matrix exponential of the latter matrix equals the original matrix. It is thus a generalization of the scalar logarithm and in some sense an inverse function of the matrix exponential. Not all matrices have a logarithm and those matrices that do have a logarithm may have more than one logarithm. The study of logarithms of matrices leads to Lie theory since when a matrix has a logarithm then it is in an element of a Lie group and the logarithm is the corresponding element of the vector space of the Lie algebra.

Definition

The exponential of a matrix ''A'' is defined by
:$e^ \equiv \sum_^ \frac$.
Given a matrix ''B'', another matrix ''A'' is said to be a matrix logarithm of . Because the exponential function is not bijective for complex numbers (e.g. $e^ = e^ = -1$), numbers can have multiple complex logarithms, and as a consequence of this, some matrices may have more than one logarithm, as explained below.

Power series expression

If ''B'' is sufficiently close to the identity matrix, then a logarithm of ''B'' may be computed by means of the following power series:
:$\log(B)= \sum_^\infty =(B-I)-\frac+\frac-\frac+\cdots$.
Specifically, if $\left\, B-I\right\, <1$, then the preceding series converges and $e^=B$.

Example: Logarithm of rotations in the plane

The rotations in the plane give a simple example. A rotation of angle ''α'' around the origin is represented by the 2×2-matrix

:$A = \begin \cos(\alpha) & -\sin(\alpha) \\ \sin(\alpha) & \cos(\alpha) \\ \end.$

For any integer ''n'', the matrix

:$B_n=(\alpha+2\pi n) \begin 0 & -1 \\ 1 & 0\\ \end,$

is a logarithm of ''A''.

$log(A) =B_n~$⇔$~~e^ =A$

$e^ = \sum_^\inftyB_n^k ~$ where

$(B_n)^0= 1~I_2,$

$(B_n)^1= (\alpha+2\pi n)\begin 0 & -1 \\ +1 & 0\\ \end,$

$(B_n)^2= (\alpha+2\pi n)^2\begin -1 & 0 \\ 0 & -1 \\ \end,$

$(B_n)^3= (\alpha+2\pi n)^3\begin 0 & 1 \\ -1 & 0\\ \end,$

$(B_n)^4= (\alpha+2\pi n)^4~I_2$

…

$\sum_^\inftyB_n^k =\begin \cos(\alpha) & -\sin(\alpha) \\ \sin(\alpha) & \cos(\alpha) \\ \end =A~.$


qed.

Thus, the matrix ''A'' has infinitely many logarithms. This corresponds to the fact that the rotation angle is only determined up to multiples of 2''π''.

In the language of Lie theory, the rotation matrices ''A'' are elements of the Lie group SO(2). The corresponding logarithms ''B'' are elements of the Lie algebra so(2), which consists of all skew-symmetric matrices. The matrix

:$\begin 0 & 1 \\ -1 & 0\\ \end$

is a generator of the Lie algebra so(2).

Existence

The question of whether a matrix has a logarithm has the easiest answer when considered in the complex setting. A complex matrix has a logarithm if and only if it is invertible. The logarithm is not unique, but if a matrix has no negative real eigenvalues, then there is a unique logarithm that has eigenvalues all lying in the strip . This logarithm is known as the ''principal logarithm''.

The answer is more involved in the real setting. A real matrix has a real logarithm if and only if it is invertible and each Jordan block belonging to a negative eigenvalue occurs an even number of times. If an invertible real matrix does not satisfy the condition with the Jordan blocks, then it has only non-real logarithms. This can already be seen in the scalar case: no branch of the logarithm can be real at -1. The existence of real matrix logarithms of real 2×2 matrices is considered in a later section.

Properties

If ''A'' and ''B'' are both positive-definite matrices, then
:$\operatorname = \operatorname + \operatorname.$

Suppose that ''A'' and ''B'' commute, meaning that ''AB'' = ''BA''. Then
:$\log = \log+\log. \,$
if and only if $\operatorname(\mu_j) + \operatorname(\nu_j) \in (- \pi, \pi]$, where $\mu_j$ is an eigenvalue of $A$ and $\nu_j$ is the corresponding eigenvalue of $B$. In particular, $\log(AB) = \log(A) + \log(B)$ when ''A'' and ''B'' commute and are both Definite matrix, positive-definite. Setting ''B'' = ''A⁻¹'' in this equation yields
:$\log = -\log.$

Similarly, for non-commuting $A$ and $B$, one can show that
:$\log = \log + t\int_0^\infty dz ~\frac B \frac + O(t^2).$
More generally, a series expansion of $\log$ in powers of $t$ can be obtained using the integral definition of the logarithm
:$\log - \log = \int_0^\lambda dz \frac,$
applied to both $X=A$ and $X=A+tB$ in the limit $\lambda\rightarrow\infty$.

Further example: Logarithm of rotations in 3D space

A rotation ∈ SO(3) in ℝ³ is given by a 3×3 orthogonal matrix.

The logarithm of such a rotation matrix can be readily computed from the antisymmetric part of Rodrigues' rotation formula, explicitly in Axis angle. It yields the logarithm of minimal Frobenius norm, but fails when has eigenvalues equal to −1 where this is not unique.

Further note that, given rotation matrices ''A'' and ''B'',
:$d_g(A,B) := \, \log(A^\top B)\, _F$
is the geodesic distance on the 3D manifold of rotation matrices.

Calculating the logarithm of a diagonalizable matrix

A method for finding ln ''A'' for a diagonalizable matrix ''A'' is the following:
:Find the matrix ''V'' of eigenvectors of ''A'' (each column of ''V'' is an eigenvector of ''A'').
:Find the inverse ''V''⁻¹ of ''V''.
:Let
::$A' = V^ A V.\,$
:Then ''A′'' will be a diagonal matrix whose diagonal elements are eigenvalues of ''A''.
:Replace each diagonal element of ''A′'' by its (natural) logarithm in order to obtain $\log A'$.
:Then
::$\log A = V ( \log A' ) V^. \,$

That the logarithm of ''A'' might be a complex matrix even if ''A'' is real then follows from the fact that a matrix with real and positive entries might nevertheless have negative or even complex eigenvalues (this is true for example for rotation matrices). The non-uniqueness of the logarithm of a matrix follows from the non-uniqueness of the logarithm of a complex number.

The logarithm of a non-diagonalizable matrix

The algorithm illustrated above does not work for non-diagonalizable matrices, such as

:$\begin1 & 1\\ 0 & 1\end.$

For such matrices one needs to find its Jordan decomposition and, rather than computing the logarithm of diagonal entries as above, one would calculate the logarithm of the Jordan blocks.

The latter is accomplished by noticing that one can write a Jordan block as
:$B=\begin \lambda & 1 & 0 & 0 & \cdots & 0 \\ 0 & \lambda & 1 & 0 & \cdots & 0 \\ 0 & 0 & \lambda & 1 & \cdots & 0 \\ \vdots & \vdots & \vdots & \ddots & \ddots & \vdots \\ 0 & 0 & 0 & 0 & \lambda & 1 \\ 0 & 0 & 0 & 0 & 0 & \lambda \\\end = \lambda \begin 1 & \lambda^ & 0 & 0 & \cdots & 0 \\ 0 & 1 & \lambda^ & 0 & \cdots & 0 \\ 0 & 0 & 1 & \lambda^ & \cdots & 0 \\ \vdots & \vdots & \vdots & \ddots & \ddots & \vdots \\ 0 & 0 & 0 & 0 & 1 & \lambda^ \\ 0 & 0 & 0 & 0 & 0 & 1 \\\end=\lambda(I+K)$
where ''K'' is a matrix with zeros on and under the main diagonal. (The number λ is nonzero by the assumption that the matrix whose logarithm one attempts to take is invertible.)

Then, by the Mercator series

:$\log (1+x)=x-\frac+\frac-\frac+\cdots$

one gets

:$\log B=\log \big(\lambda(I+K)\big)=\log (\lambda I) +\log (I+K)= (\log \lambda) I + K-\frac+\frac-\frac+\cdots$

This series has a finite number of terms (''K''^''m'' is zero if ''m'' is the dimension of ''K''), and so its sum is well-defined.

Using this approach one finds

:$\log \begin1 & 1\\ 0 & 1\end =\begin0 & 1\\ 0 & 0\end.$

A functional analysis perspective

A square matrix represents a linear operator on the Euclidean space R^''n'' where ''n'' is the dimension of the matrix. Since such a space is finite-dimensional, this operator is actually bounded.

Using the tools of holomorphic functional calculus, given a holomorphic function ''f'' defined on an open set in the complex plane and a bounded linear operator ''T'', one can calculate ''f''(''T'') as long as ''f'' is defined on the spectrum of ''T''.

The function ''f''(''z'')=log ''z'' can be defined on any simply connected open set in the complex plane not containing the origin, and it is holomorphic on such a domain. This implies that one can define ln ''T'' as long as the spectrum of ''T'' does not contain the origin and there is a path going from the origin to infinity not crossing the spectrum of ''T'' (e.g., if the spectrum of ''T'' is a circle with the origin inside of it, it is impossible to define ln ''T'').

The spectrum of a linear operator on R^''n'' is the set of eigenvalues of its matrix, and so is a finite set. As long as the origin is not in the spectrum (the matrix is invertible), the path condition from the previous paragraph is satisfied, and ln ''T'' is well-defined. The non-uniqueness of the matrix logarithm follows from the fact that one can choose more than one branch of the logarithm which is defined on the set of eigenvalues of a matrix.

A Lie group theory perspective

In the theory of Lie groups, there is an exponential map from a Lie algebra $\mathfrak$ to the corresponding Lie group ''G''

: $\exp : \mathfrak \rightarrow G.$

For matrix Lie groups, the elements of $\mathfrak$ and ''G'' are square matrices and the exponential map is given by the matrix exponential. The inverse map $\log=\exp^$ is multivalued and coincides with the matrix logarithm discussed here. The logarithm maps from the Lie group ''G'' into the Lie algebra $\mathfrak$.
Note that the exponential map is a local diffeomorphism between a neighborhood ''U'' of the zero matrix $\underline \in \mathfrak$ and a neighborhood ''V'' of the identity matrix $\underline\in G$.
Thus the (matrix) logarithm is well-defined as a map,
:$\log: G\supset V \rightarrow U\subset \mathfrak.$

An important corollary of Jacobi's formula then is
:$\log (\det(A)) = \mathrm(\log A)~.$

Constraints in the 2 × 2 case

If a 2 × 2 real matrix has a negative determinant, it has no real logarithm. Note first that any 2 × 2 real matrix can be considered one of the three types of the complex number ''z'' = ''x'' + ''y'' ε, where ε² ∈ . This ''z'' is a point on a complex subplane of the ring of matrices.

The case where the determinant is negative only arises in a plane with ε² =+1, that is a split-complex number plane. Only one quarter of this plane is the image of the exponential map, so the logarithm is only defined on that quarter (quadrant). The other three quadrants are images of this one under the Klein four-group generated by ε and −1.

For example, let ''a'' = log 2 ; then cosh ''a'' = 5/4 and sinh ''a'' = 3/4.
For matrices, this means that
:$A=\exp \begin0 & a \\ a & 0 \end = \begin\cosh a & \sinh a \\ \sinh a & \cosh a \end = \begin1.25 & .75\\ .75 & 1.25 \end$.
So this last matrix has logarithm
:$\log A = \begin0 & \log 2 \\ \log 2 & 0 \end$.

These matrices, however, do not have a logarithm:
:$\begin3/4 & 5/4 \\ 5/4 & 3/4 \end,\ \begin-3/4 & -5/4 \\ -5/4 & -3/4\end, \ \begin-5/4 & -3/4\\ -3/4 & -5/4 \end$.
They represent the three other conjugates by the four-group of the matrix above that does have a logarithm.

A non-singular 2 x 2 matrix does not necessarily have a logarithm, but it is conjugate by the four-group to a matrix that does have a logarithm.

It also follows, that, e.g., a square root of this matrix ''A'' is obtainable directly from exponentiating (log''A'')/2,
:$\sqrt= \begin\cosh ((\log 2)/2) & \sinh ((\log 2)/2) \\ \sinh ((\log 2)/2) & \cosh ((\log 2)/2) \end = \begin1.06 & .35\\ .35 & 1.06 \end ~.$

For a richer example, start with a Pythagorean triple (''p,q,r'')
and let . Then
:$e^a = \frac = \cosh a + \sinh a$.

Now
:$\exp \begin0 & a \\ a & 0 \end = \beginr/q & p/q \\ p/q & r/q \end$.
Thus
:$\tfrac\beginr & p \\ p & r \end$
has the logarithm matrix
:$\begin0 & a \\ a & 0 \end$ ,
where .

See also

*Matrix function
*Square root of a matrix
*Matrix exponential
* Baker–Campbell–Hausdorff formula
*Derivative of the exponential map

Notes

References

* .
*
* .
* .
*

{{DEFAULTSORT:Logarithm Of A Matrix
Matrix theory
Inverse functions
Logarithms