TITLE: A criteria for Jordan decomposition of a matrix over a general ring
QUESTION [14 upvotes]: When I look at different proofs of the Jordan-Chevalley decomposition of a matrix, the minimal hypothesis I usually found is about the perfection of the field over which such decomposition occurs (e.g. Wikipedia article). But it seems to me that the gist of the proofs is not about the field but about the type of characteristic polynomial of the matrix.
More precisely, by using the two following definitions for a general ring $A$
Definition 1 A $n\times n$-matrix $M$ with coefficients in the ring A is semisimple if $A^n$ is a semi-simple $A[M]$-module (here I am using the definition provided in the answer of @ಠ_ಠ below)
Definition 2 A separable polynomial $P$ of $A[X]$ is a polynomial whose discriminant is invertible in $A$
Then is the following statement true?
A matrix $M$ over $A$ have a unique Jordan-Chevalley decomposition if its characteristic polynomial divides a power of a separable polynomial.
Edit By Jordan decomposition I mean here the additive one, i.e. there exist $M_s$ and $M_n$, two $n\times n$ $A$-matrices respectively semi-simple and nilpotent, such that
$$M=M_s+M_n$$ 
If it is not, what kind of general property should the ring $A$ have to make it true (like $A$ is a domain, etc.)
Edit 2 I believe my definition 1 is equivalent in a domain to the fact that the matrix is diagonalizable in an algebraic extension of the fraction field which is equivalent to the fact that the matrix is cancelled by a separable polynomial (definition 2) in $A[X]$

REPLY [2 votes]: Let $A\in M_n(R)$ where $R$ is some commutative ring, $p$ be the "square free" polynomial that divides $\chi_A$ (the characteristic polynomial of $A$) and $p'$ be the derivative of $p$.
We consider the pseudo Newton algorithm
$X_0=A , X_{k+1}=X_k-p(X_k)(p'(X_k))^{-1}$. When $R$ is a perfect field, after a finite number of iterations, $X_k=D$, the semi simple part of $A$.
Of course, we have to give conditions on $R$, for example, as assumed by Minseon Shin, 
"Let $R$ be an integral domain whose fraction field $K$ is perfect".
We can chain the iterations iff $p'(X_k)$ is invertible over $M_n(R)$, that is, if $\det(p'(X_k))$ is an invertible of $R$. In fact, at each iteration, $\det(p'(X_k))=\det(p'(A))$ and the invertibility of $\det(p'(A))$ suffices. It is not difficult to see that $\det(p'(A))$ is a divisor of a power of $discrim(p)$.
Finally, if $discrim(p)$ is an invertible (that is equivalent to the condition considered by the OP), then we can chain the iterations.
When $R=\mathbb{Z}/m\mathbb{Z}$, the entire algorithm seems to work; I did not find any counter-examples. 
EDIT. Answer to the OP. 
Assume that $R$ is an integral domain. If $p\in R[x]$, then $discrim(p)\not= 0$ implies that $p,p'$ have no common roots over an algebraically closed field containing $R$, that implies that $p$ has only simple roots. If moreover, $discrim(p)$ is invertible and $p$ divides $\chi_A$, then I think that the above  algorithm formally works and that we obtain $D$ s.t. $p(D)=0$ and $A-D$ nilpotent. 
However, practically, how to find such a $p$ ? A priori, $R[x]$ is not an UFD; on the other hand,it seems difficult to work over a field that contains $R$ and the roots of $\chi_A$; how to prove that $p$ divides $\chi_A$ if $R$ is not euclidean or not pincipal?
Anyway, in general, $p=\dfrac{\chi_A}{gcd(\chi_A,\chi'_A)}$. Note that if $R$ is an UFD, then the gcd always exists in $R[x]$; yet, in general, there is no algorithm to do that.
Finally, if $R$ is an Euclidean domain, I think that we can explicitly calculate $D,N$. However, in theory, perhaps the hypothesis UFD suffices...