Suppose we have the following square matrix of order 3:
$$A = \begin{pmatrix} 1 & 3 & 3\\ -3 & -5 & -3 \\ 3 & 3 & 1 \end{pmatrix}$$
How can I prove that $\lambda=-2$ is eigenvalue without having to calculate the characteristic polynomial and diagonalization?
I know the definition of eigenvalue and I know how to diagonalize. But, I wouldn't know how to do that.
Here's a really goofy answer: observe that $$ (A - I) (A + 2I) = 0 $$ hence the minimal polynomial of $A$ must be $$ m(x) = (x-1)(x+2), $$ so that $-2$ must be an eigenvalue. (The question, as written, is wrong, and $+2$ is not an eigenvalue at all).
This meets the letter of the question without really teaching much, alas. How could one possibly guess that this product was going to be zero? Well, you could look at $I, A,$ and $A^2$, \begin{align} I &= \pmatrix{1 & 0 & 0 \\ 0 & 1 & 0 \\ 0 & 0 & 1}\\ A &= \pmatrix{1 & 3 & 3 \\ -3 & -5 & -3 \\ 3 & 3 & 1}\\ A^2 &= \pmatrix{1 & -3 & -3 \\ 3 & 7 & 3 \\ -3 & -3 & 1} \end{align} and notice, from the regularity of the entries, that $A^2 + A - 2I$ is the zero matrix, and this factors as $(A-I)(A+2I)$. But why would you even think that the minimal polynomial was quadratic rather than linear? Well, $A + 2I$ is so 'repetitive' that you might guess, as I did, that it had only rank $1$ rather than rank $2$.
In other words, if this is obvious to you, it's easy. :)