Are all square roots of diagonalizable matrices diagonalizable? If a matrix is normal/unitarily diagonalizable, then its square roots are readily computed by taking the square roots of its eigenvalues (in the complex plane if needed).
Any square root computed in this way is clearly going to also be normal.
However, are all square roots of a normal matrix $A$ also going to be normal, or more generally, diagonalisable? If this is the case, how can it be proven? How can the non-diagonal square roots be computed?
(The question could probably be generalized to refer to any inverse of a matrix function, but I am not sure about that).

Some related questions:


*

*Determine all $2\times2$ matrices $A$ such that $A^2=0$.

*Families of Square Roots of Identity Matrices

*Are there sometimes only finitely many square roots of a positive matrix?
 A: Silly example: the zero matrix is clearly normal, but has
$$ \begin{pmatrix} 0 & 1 \\ 0 & 0 \end{pmatrix} $$
as a square root.
A: No. While $A:=\left(\begin{array}{cc}
\cos x & k\sin x\\
k^{-1}\sin x & -\cos x
\end{array}\right)$ is a square root of $I_2$,$$AA^T=\left(\begin{array}{cc}
\cos^{2}x+k^{2}\sin^{2}x & \left(k^{-1}-k\right)\sin x\cos x\\
\left(k^{-1}-k\right)\sin x\cos x & k^{-2}\sin^{2}x+\cos^{2}x
\end{array}\right).$$ Applying $k\mapsto k^{-1}$ obtains $A^T A$ as something different if $k\ne\pm 1$.
A: The notion of normality is not relevant here. Let $A\in M_n(\mathbb{C})$ be diagonalizable.
$\textbf{Poposition}$. If $\dim(\ker(A))\leq 1$, then each of its square roots is diagonalizable. Otherwise, there is at least one square root that is not diagonalizable.
$\textbf{Proof}$.

*

*Case 1: Suppose that $\dim(\ker(A))=1$; we may assume that $$A=\operatorname{diag}(0,\lambda _1 I_{p_1},\cdots,\lambda_{n-1} I_{p_{n-1}}),$$ where the $(\lambda_i)$ are non-zero, distinct and $1+p_1+\cdots+p_{n-1}=n$. If $B$ is a square root of $A$, then $AB=BA$ and $B$ is in the form $\operatorname{diag}(0,B_1,\cdots,B_{n-1})$, where $B_i^2=\lambda_i I_{p_i}$. Then each $B_i$ is diagonalizable and $B$ too. We solve the case $A$ invertible in the same way.


*Case 2: If $\dim(\ker(A))=k\geq 2$, then $A_{|\ker(A)}=0$ admits a square root in the form $$\operatorname{diag}\left(\begin{pmatrix}0&1\\0&0\end{pmatrix},0_{k-2}\right),$$ that is not diagonalizable. Therefore we obtain some $B$ that is not diagonalizable.
Remark. Of course, we can generalize the previous result even further. Let $f$ be a holomorphic function and consider the equation $f(B)=A$. Then the solutions $B$ are diagonalizable iff, for every $\lambda\in \operatorname{spectrum}(A)$, the equation $f(x)=\lambda$ has only simple roots OR has multiple roots but, in this case, the eigenvalue $\lambda$ is simple.
