Is it true that for any $A\in M(n,\mathbb{C})$there exist a $B\in M(n,\mathbb{C})$ such that $A = B^2$? I think this is not true (but I don't know nay example), and then is it possible to characterize such $A$?

7See Wikipedia  [Square root of a matrix](http://en.wikipedia.org/wiki/Square_root_of_a_matrix). The case $n=2$ is discussed here: [For every matrix $A\in M_{2}( \mathbb{C}) $ there's $X\in M_{2}( \mathbb{C})$ such that $X^2=A$?](http://math.stackexchange.com/questions/57292/foreverymatrixainm2mathbbctheresxinm2mathbbcs) – Martin Sleziak Oct 04 '12 at 07:34

I'll copy here also J.M.'s comment an older question [How to find the square root of a matrix?](http://math.stackexchange.com/questions/180638/howtofindthesquarerootofamatrix), which is now deleted. Higham's book *Functions of Matrices: Theory and Computation* devotes [an entire chapter](http://books.google.com/books?hl=en&id=S6gpNn1JmbgC&pg=PA133) to the subject. Which algorithm to use depends on the structure of your matrix, about which you have not yet said anything. – Martin Sleziak Oct 04 '12 at 07:37

by Starting to compute the Jourdan reduction of your matrix. you juste have to determine whether or not a matrix of the form $\lambda * I_n +N$ with $N$ a reduced nilpotent matrix has a square root or not. it seem that when $\lambda$ is non zero it's always the case. So in the end you have to find a way to know when a reduced nilpotent matrix has a square root or not, this seem to be a purely combinatorics question, and the answer will only depend on the dimension. (so the general answer will depend on the dimmension of the jordan block of the 0 eigenvalue) – Simon Henry Oct 04 '12 at 09:01

Thanks for all the comments. I still don't know sufficient condition but my understanding is much better now. – M. K. Oct 04 '12 at 19:21
2 Answers
No, it is not true that every complex square (no pun intended) matrix is the square of at least one other such matrix. The simplest counterexample is $\left(\begin{smallmatrix}0&1\\0&0\end{smallmatrix}\right)$.
Here is a rapid analysis. Any square root of $A$ will commute with $A$, so it will stabilise all its generalised eigenspaces (kernels of $(A\lambda)^k$ for appropriate $\lambda\in\mathbf C$, $k\in\mathbf N$), and therefore the direct sum decomposition of the whole space into such subspaces. This means we can focus on individual generalised eigenspaces, which amounts to assuming that $A$ has only one eigenvalue $\lambda$.
If $A$ has a single eigenvalue $\lambda\neq0$ then we can write $A=\lambda(I+N)$ where $N$ is a nilpotent matrix, and in this case a square root is given by $\sqrt\lambda\sqrt{I+N}$ where $\sqrt\lambda$ denotes one of the complex square roots of $\lambda$, and $\sqrt{I+N}$ is given by Newton's binomial formula $$ \sqrt{I+N}=\sum_{k=0}^\infty\binom{1/2}kN^k, $$ which is actually a finite sum since $N$ is nilpotent.
So we are left with the case that $A$ is itself nilpotent, and here a square root does not always exist. On a suitable basis $A$ will be in Jordan normal form, and whether $A$ has a square root depends on the sizes of the Jordan blocks. A square root will in any case itself be nilpotent, so it is useful to look what happens with the sizes of the Jordan blocks when we take the square. It is easy to see that any Jordan block of size $d>1$ gives upon squaring two Jordan blocks of sizes $\lceil\frac d2\rceil$ and $\lfloor\frac d2\rfloor$. Inversely therefore, a nilpotent matrix has a square root if and only if the sizes of its Jordan blocks can be grouped two at a time, with possibly an isolated block of size $1$, such that two block sizes grouped together never differ by more than$~1$. So the above example which has a single block of size $2$ has no square root, but if we extend it to size $3\times3$ by a row and column of entries $0$ it does: $$ \begin{pmatrix}0&1&0\\0&0&0\\0&0&0\end{pmatrix} = \begin{pmatrix}0&0&1\\0&0&0\\0&1&0\end{pmatrix}^2. $$ A single nilpotent Jordan block of size $3$ however will remain without square root even if we make it arbitrarily large by extending with zeros. In general, the criterion for nilpotent matrices is that between any pair of absent block size values, the number of blocks with intermediate sizes must be even for a square root to exist. For instance for sizes $7,6,4,4,4,3,3,1,1,1$ no square root exists, because between the absent sizes $5$ and $2$ there are five blocks, of sizes $4$ or $3$.
 107,679
 7
 148
 306
The Cholesky decomposition is loosely related to the concept of taking the square root of a matrix. If $A$ is a positivedefinite Hermitian matrix, then $$ A = B B^{*} $$, where $B$ is lower triangular with positive diangonal elements where $B^*$ is the conjugate transpose of B.
 471
 3
 6

Thanks for the answer, Bryce. I will take a look at the Cholesky decomposition. – M. K. Dec 27 '12 at 05:20