If A is a symmetric matrix whose eigenvalues have absolute values that are less than $1$, then: $$\det(I-A)\neq0$$ where $I$ is identity matrix.
Why is that inequality correct?
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It only takes a minute to sign up.
Sign up to join this communityIf A is a symmetric matrix whose eigenvalues have absolute values that are less than $1$, then: $$\det(I-A)\neq0$$ where $I$ is identity matrix.
Why is that inequality correct?
If you see "symmetric" (even normal is enough), diagonalize! \begin{align} \det(I - A) &= \det(UIU^* - U\Lambda U^*) \\&= \det(U(I-\Lambda) U^*) \\&= \det(U)\det(I-\Lambda)\det(U^*) \\&= \det(I-\Lambda) \\&= \prod\limits_{j=1}^n (1-\lambda_j) \\\det(I - A) &= 0 \iff \exists j\colon\lambda_j = 1 \end{align}
Mosquito-nuking solution: $$\rho(A) < 1\implies \sum_{n=0}^{\infty}A^n\text{ is convergent}$$ (see Neumann series and spectral radius) and $$(I - A)^{-1} = \sum_{n=0}^{\infty}A^n\text{ exists}.$$