# Existence of Matrix Logarithm

Jump to navigation
Jump to search

This article needs to be tidied.In particular: Please take the time to familiarise yourself with house style. In particular: one sentence per line, and the layout of complex statements.Please fix formatting and $\LaTeX$ errors and inconsistencies. It may also need to be brought up to our standard house style.To discuss this page in more detail, feel free to use the talk page.When this work has been completed, you may remove this instance of `{{Tidy}}` from the code. |

This article needs to be linked to other articles.In particular: In particular the category. Also need a link to the definition of $e^S$.You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by adding these links.To discuss this page in more detail, feel free to use the talk page.When this work has been completed, you may remove this instance of `{{MissingLinks}}` from the code. |

## Theorem

Let $T$ be a square matrix of order $n$.

Then there exists a real matrix $S$ such that $e^S = T$ if and only if:

- $(1): \quad T$ is not a singular matrix

and:

- $(2): \quad $for every negative eigenvalue $\lambda$ of $T$ and for every positive integer $k$, the Jordan form of $T$ has an even number of $k \times k$ blocks associated with $\lambda$.

There are no source works cited for this page.Source citations are highly desirable, and mandatory for all definition pages.Definition pages whose content is wholly or partly unsourced are in danger of having such content deleted. To discuss this page in more detail, feel free to use the talk page. |