|
|
| Line 1: |
Line 1: |
| In [[mathematics]], a '''logarithm of a matrix''' is another [[matrix (mathematics)|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 a [[Lie group]] and the logarithm is the corresponding element of the [[Lie algebra]].
| | Greetings! I am Myrtle Shroyer. What I adore doing is performing ceramics but I haven't made a dime with it. I am a meter reader. For years he's been residing in North Dakota and his family members enjoys it.<br><br>Feel free to surf to my webpage ... [http://indianrajneet.com/groups/best-strategies-for-keeping-candida-albicans-from-increasing/ indianrajneet.com] |
| | |
| ==Definition==
| |
| | |
| A matrix ''B'' is a logarithm of a given matrix ''A'' if the [[matrix exponential]] of ''B'' is ''A'':
| |
| :<math> e^B = A. \, </math>
| |
| | |
| ==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
| |
| | |
| :<math> A =
| |
| \begin{pmatrix}
| |
| \cos(\alpha) & -\sin(\alpha) \\
| |
| \sin(\alpha) & \cos(\alpha) \\
| |
| \end{pmatrix}.
| |
| </math>
| |
| | |
| For any integer ''n'', the matrix
| |
| | |
| :<math>
| |
| B_n=(\alpha+2\pi n)
| |
| \begin{pmatrix}
| |
| 0 & -1 \\
| |
| 1 & 0\\
| |
| \end{pmatrix},
| |
| </math>
| |
| | |
| is a logarithm of ''A''. 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 [[circle group|SO(2)]]. The corresponding logarithms ''B'' are elements of the Lie algebra so(2), which consists of all [[skew-symmetric matrix|skew-symmetric matrices]]. The matrix
| |
| | |
| :<math>
| |
| \begin{pmatrix}
| |
| 0 & 1 \\
| |
| -1 & 0\\
| |
| \end{pmatrix}
| |
| </math>
| |
| | |
| 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 matrix has a logarithm [[if and only if]] it is [[invertible matrix|invertible]].<ref>{{harvtxt|Higham|2008}}, Theorem 1.27</ref> The logarithm is not unique, but if a matrix has no negative real [[eigenvalue]]s, then it has a unique logarithm whose eigenvalues lie all in the strip {''z'' ∈ '''C''' | −π < Im ''z'' < π}. This logarithm is known as the ''principal logarithm''.<ref>{{harvtxt|Higham|2008}}, Theorem 1.31</ref>
| |
| | |
| 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.<ref>{{harvtxt|Culver|1966}}</ref> 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: the logarithm of −1 is a non-real complex number. The existence of real matrix logarithms of real 2 x 2 matrices is considered in a later section.
| |
| | |
| ==Properties==
| |
| | |
| If ''A'' and ''B'' are both positive-definite matrices and ''A'' and ''B'' commute, i.e., ''AB'' = ''BA'', then
| |
| | |
| :<math>AB = e^{\ln(A)+\ln(B)}. \, </math>
| |
| | |
| For any invertible matrix, | |
| | |
| :<math>A^{-1} = e^{-\ln(A)}. \, </math>
| |
| | |
| ==Further example: Logarithm of rotations in 3D space==
| |
| | |
| A rotation <math> R\in {\rm SO(3)}</math> in <math> \mathbb{R}^3</math> is given by a 3x3 [[orthogonal matrix]]
| |
| | |
| The logarithm of the rotation matrix R can be computed with [[Rodrigues' rotation formula]] (see also [[Axis angle]]), except when R has eigenvalues equal to −1 where the log is not unique.
| |
| | |
| Note that, given rotation matrices A and B:
| |
| :<math> d_g(A,B) := \| \log(A^\top B)\|_F </math>
| |
| 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 [[eigenvector]]s of ''A'' (each column of ''V'' is an eigenvector of ''A'').
| |
| :Find the [[matrix inverse|inverse]] ''V''<sup>−1</sup> of ''V''.
| |
| :Let
| |
| ::<math> A' = V^{-1} A V.\, </math>
| |
| :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 <math> \ln A' </math>.
| |
| :Then
| |
| ::<math> \ln A = V ( \ln A' ) V^{-1}. \, </math>
| |
| | |
| 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 matrix|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
| |
| | |
| :<math>\begin{bmatrix}1 & 1\\ 0 & 1\end{bmatrix}.</math>
| |
| | |
| For such matrices one needs to find its [[Jordan normal form|Jordan decomposition]] and, rather than computing the logarithm of diagonal entries as above, one would calculate the logarithm of the [[Jordan matrix|Jordan block]]s.
| |
| | |
| The latter is accomplished by noticing that one can write a Jordan block as
| |
| :<math>B=\begin{pmatrix}
| |
| \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{pmatrix}
| |
| =
| |
| \lambda \begin{pmatrix}
| |
| 1 & \lambda^{-1} & 0 & 0 & \cdots & 0 \\
| |
| 0 & 1 & \lambda^{-1} & 0 & \cdots & 0 \\
| |
| 0 & 0 & 1 & \lambda^{-1} & \cdots & 0 \\
| |
| \vdots & \vdots & \vdots & \ddots & \ddots & \vdots \\
| |
| 0 & 0 & 0 & 0 & 1 & \lambda^{-1} \\
| |
| 0 & 0 & 0 & 0 & 0 & 1 \\\end{pmatrix}=\lambda(I+K)</math>
| |
| 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]]
| |
| | |
| :<math> \ln (1+x)=x-\frac{x^2}{2}+\frac{x^3}{3}-\frac{x^4}{4}+\cdots</math>
| |
| | |
| one gets
| |
| | |
| :<math>\ln B=\ln \big(\lambda(I+K)\big)=\ln (\lambda I) +\ln (I+K)= (\ln \lambda) I + K-\frac{K^2}{2}+\frac{K^3}{3}-\frac{K^4}{4}+\cdots</math>
| |
| | |
| This [[series (mathematics)|series]] in general does not converge for every matrix ''K'', as it would not for any real number with absolute value greater than unity, however, this particular ''K'' is a [[nilpotent matrix]], so the series actually has a finite number of terms (''K''<sup>''m''</sup> is zero if ''m'' is the dimension of ''K'').
| |
| | |
| Using this approach one finds
| |
| | |
| :<math>\ln \begin{bmatrix}1 & 1\\ 0 & 1\end{bmatrix}
| |
| =\begin{bmatrix}0 & 1\\ 0 & 0\end{bmatrix}.</math>
| |
| | |
| == A functional analysis perspective ==
| |
| | |
| A square matrix represents a [[linear operator]] on the [[Euclidean space]] '''R'''<sup>''n''</sup> where ''n'' is the dimension of the matrix. Since such a space is finite-dimensional, this operator is actually [[bounded operator|bounded]].
| |
| | |
| Using the tools of [[holomorphic functional calculus]], given a [[holomorphic function]] ''f''(''z'') defined on an [[open set]] in the [[complex plane]] and a bounded linear operator ''T'', one can calculate ''f''(''T'') as long as ''f''(''z'') is defined on the [[spectrum of an operator|spectrum]] of ''T''.
| |
| | |
| The function ''f''(''z'')=ln ''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'' (as such, if the spectrum of ''T'' is a circle with the origin inside of it, it is impossible to define ln ''T'').
| |
| | |
| Back to the particular case of a Euclidean space, the spectrum of a linear operator on this space 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), one obviously satisfies the path condition from the previous paragraph, and as such, the theory implies that ln ''T'' is well-defined. The non-uniqueness of the matrix logarithm then 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 group]]s, there is an [[exponential map]] from a [[Lie algebra]] ''g'' to the corresponding Lie group ''G''
| |
| | |
| : <math> \exp : g \rightarrow G. </math> | |
| | |
| For matrix Lie groups, the elements of ''g'' and ''G'' are square matrices and the exponential map is given by the [[matrix exponential]]. The inverse map <math> \log=\exp^{-1} </math> is multivalued and coincides with the matrix logarithm discussed here. The logarithm maps from the Lie group ''G'' into the Lie algebra ''g''.
| |
| Note that the exponential map is a local diffeomorphism between a neighborhood ''U'' of the zero matrix <math> \underline{0} \in g</math> and a neighborhood ''V'' of the identity matrix <math>\underline{1}\in G</math>.
| |
| Thus the (matrix) logarithm is well-defined as a map,
| |
| :<math> \log: V\subset G\rightarrow U\subset g. \, </math>
| |
| | |
| An important corollary of [[Jacobi's formula]] then is
| |
| :<math>\log (\det(A)) = \mathrm{tr}(\log A)~. </math>
| |
| | |
| ==Constraints in the 2 × 2 case==
| |
| If a 2 x 2 real matrix has a negative [[determinant]], it has no real logarithm. Note first that any [[2 × 2 real matrices|2 × 2 real matrix]] can be considered one of the three types of the complex number ''z'' = ''x'' + ''y'' ε, where ε² ∈ { −1, 0, +1 }. This ''z'' is a point on a complex subplane of the [[ring (mathematics)|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'' = ln 2 ; then cosh ''a'' = 5/4 and sinh ''a'' = 3/4.
| |
| For matrices, this means that
| |
| :<math>A=\exp \begin{pmatrix}0 & a \\ a & 0 \end{pmatrix} =
| |
| \begin{pmatrix}\cosh a & \sinh a \\ \sinh a & \cosh a \end{pmatrix} =
| |
| \begin{pmatrix}1.25 & .75\\ .75 & 1.25 \end{pmatrix}</math>.
| |
| So this last matrix has logarithm
| |
| :<math>\ln A = \begin{pmatrix}0 & \ln 2 \\ \ln 2 & 0 \end{pmatrix}</math>.
| |
| | |
| These matrices, however, do not have a logarithm:
| |
| :<math>\begin{pmatrix}3/4 & 5/4 \\ 5/4 & 3/4 \end{pmatrix},\
| |
| \begin{pmatrix}-3/4 & -5/4 \\ -5/4 & -3/4\end{pmatrix}, \
| |
| \begin{pmatrix}-5/4 & -3/4\\ -3/4 & -5/4 \end{pmatrix}</math>.
| |
| 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 a 2 by 2 matrix|square root of this matrix]] ''A'' is obtainable directly from exponentiating (ln''A'')/2,
| |
| :<math>\sqrt{A}= \begin{pmatrix}\cosh ((\ln 2)/2) & \sinh ((\ln 2)/2) \\ \sinh ((\ln 2)/2) & \cosh ((\ln 2)/2) \end{pmatrix} =
| |
| \begin{pmatrix}1.06 & .35\\ .35 & 1.06 \end{pmatrix} ~. </math>
| |
| | |
| For a richer example, start with a [[pythagorean triple]] (''p,q,r'')
| |
| and let {{math|''a'' {{=}} ln(''p'' + ''r'') − ln ''q''}}. Then
| |
| :<math>e^a = \frac {p + r} {q} = \cosh a + \sinh a</math>.
| |
| | |
| Now
| |
| :<math>\exp \begin{pmatrix}0 & a \\ a & 0 \end{pmatrix} =
| |
| \begin{pmatrix}r/q & p/q \\ p/q & r/q \end{pmatrix}</math>.
| |
| Thus
| |
| :<math>\tfrac{1}{q}\begin{pmatrix}r & p \\ p & r \end{pmatrix}</math>
| |
| has the logarithm matrix
| |
| :<math>\begin{pmatrix}0 & a \\ a & 0 \end{pmatrix}</math> ,
| |
| where {{math| ''a'' {{=}} ln(''p'' + ''r'') − ln ''q''}}.
| |
| | |
| ==See also==
| |
| | |
| *[[Matrix function]]
| |
| *[[Square root of a matrix]]
| |
| *[[Matrix exponential]]
| |
| | |
| ==Notes==
| |
| <references/>
| |
| | |
| ==References==
| |
| * {{Citation | last1=Gantmacher | first1=Felix R. | title=The Theory of Matrices | publisher=Chelsea | location=New York | year=1959 | volume=1 | pages=239–241}}.
| |
| * {{Citation | doi=10.1090/S0002-9939-1966-0202740-6 | last1=Culver | first1=Walter J. | title=On the existence and uniqueness of the real logarithm of a matrix | year=1966 | journal=[[Proceedings of the American Mathematical Society]] | issn=0002-9939 | volume=17 | issue=5 | pages=1146–1151}}.
| |
| * {{Citation | last1=Higham | first1=Nicholas | author1-link=Nicholas Higham | title=Functions of Matrices. Theory and Computation | publisher=[[Society for Industrial and Applied Mathematics|SIAM]] | isbn=978-0-89871-646-7 | year=2008}}.
| |
| | |
| {{DEFAULTSORT:Logarithm Of A Matrix}}
| |
| [[Category:Matrix theory]]
| |
| [[Category:Inverse functions]]
| |
| [[Category:Logarithms]]
| |