# Eigenvalues of a nxn matrix without calculations [duplicate]

I have a question about the following matrix:

$$\begin{bmatrix} 1 & 2 & 3 \\ 1 & 2 & 3 \\ 1 & 2 & 3 \\ \end{bmatrix}$$

Find the eigenvalues without calculations and define your answer. Now, I was thinking about this problem. And I thought, yeah ok if you try the vector (1,1,1), you can find 6 as one eigenvalue (and I know you have a double multiplicity 0 too). But than you are doing sort of guessing/calculation work.

I see that the columns are linearly dependant. So I know the dimension of the column space and of the null space.

Ok, so you find that the dimension of the null space is 2, so there are 2 eigenvectors when the eigenvalue is 0. Now my question is, can the dimension of the eigenspace be bigger than the amount of eigenvalues? I guess not. I know it can be smaller

• You didn't under stood me, I said you need to edit your question in the comment:" can the dimension of the eigenspace be bigger than the amount of eigenvalues"? It dosent make any sense. Jan 16, 2015 at 12:12
• If you have an eigenspace for $\lambda$ of dimension$~d$, then clearly $(X-\lambda)^d$ divides the characteristic polynomial. So the "amount of eigenvalues" (I suppose you mean the multiplicity of the eigenvalue as root of the characteristic polynomial) cannot be less than the dimension of the eigenspace. Jan 16, 2015 at 12:42
• That is what I meant. So to make it a hundred percent clear: You cannot have: 3 eigenvalues for example: lambda = 3,4,5 for a 3x3 matrix and have 4 linearly independent eigenvectors. Jan 16, 2015 at 13:44

Notice that rank=1 and hence $0$ is an eigenvalue of multiplicity $2$. Then trace=sum of eigenvalue and hence the last eigenvalue is $6$.
It is also rather easy to find all eigenvectors without a lot of work. For $6$ the vector is $(1,1,1)$. For $0$ you can take basis $(2,-1,0),(3,0,-1)$.
• That is right. This is the Null dimension of $A$ or the dimension of kernel $A$ when thinking of $A$ as operator. Jan 16, 2015 at 11:53