I have this matrix below:
Eigenvalues is 0 and the eigenvector is (0,1) what i don't understand is why this Matrix is not Diagonzible and i have found some answer here on Math Stackexchange but i don't understand what it means below:
"A matrix is diagonalizable if and only if for each eigenvalue the dimension of the eigenspace is equal to the multiplicity of the eigenvalue."
What does it means multiplicity of the eigenvalue?? Should i apply the Rank-Theorem??

The multiplicity of an eigenvalue $\lambda$ is the largest natural number $m$ such that the polynomial $(t-\lambda)^m$ divides the characteristic polynomial $\det(A-tI)$. The rank theorem, whatever that is, doesn't seem relevant in computing said multiplicity. In this case, I would just factor the characteristic polynomial, if I were you.
Remark: Many authors call this multiplicity "algebraic multiplicity", as opposed to the "geometric multiplicity" which would be the dimension of the eigenspace of $\lambda$.