1

Proof that if a matrix has no eigenvalues, it'll not be invertible:

$$ \det(A-\lambda I) = 0 \Rightarrow \begin{pmatrix} a_{1,1}-\lambda & a_{1,2} & \cdots & a_{1,n} \\ a_{2,1} & a_{2,2}-\lambda & \cdots & a_{2,n} \\ \vdots & \vdots & \ddots & \vdots \\ a_{n,1} & a_{n,2} & \cdots & a_{n,n}-\lambda \end{pmatrix} $$

If all $\lambda=0$, we would get that our $\det(A) = 0$, hence, it would not be invertible.

Is this proof correct?!

Bruno Reis
  • 2,306

2 Answers2

1

Hint:

the determinant of a matrix is the product of its eigenvalues. For a simple proof see Show that the determinant of $A$ is equal to the product of its eigenvalues..

So, if one (not all) eigenvalue is zero the determinant is zero and the matrix is not invertible.

Emilio Novati
  • 62,675
0

If det (A)=0, then A has the eigenvalue 0

Fred
  • 77,394