91Ó°ÊÓ

Eigenvalues are crucial in understanding the behavior of matrices in linear algebra. An eigenvalue of a matrix \( A \) is a scalar, \( \lambda \), such that there exists a non-zero vector \( \mathbf{v} \) (the eigenvector), satisfying the equation \( A\mathbf{v} = \lambda \mathbf{v} \). This essentially means that applying matrix \( A \) to vector \( \mathbf{v} \) stretches or compresses it by the factor \( \lambda \), without changing its direction. In the context of invertible matrices, all eigenvalues must be non-zero because a zero eigenvalue would imply the existence of a vector \( \mathbf{v} \) for which \( A\mathbf{v} = 0 \), contradicting the definition of invertibility, which requires a full rank and non-zero determinant. Thus, invertible matrices have eigenvalues that are all non-zero, ensuring that no such vector is nullified by the matrix.

An invertible matrix, often referred to as a non-singular or non-degenerate matrix, is a square matrix that has an inverse. Only square matrices can possibly be invertible. For a matrix \( A \) to be invertible, there must exist a matrix \( A^{-1} \) such that the multiplication of \( A \) and \( A^{-1} \) yields the identity matrix \( I \), i.e., \( AA^{-1} = A^{-1}A = I \). The existence of an inverse means \( \det(A) eq 0 \), ensuring that the matrix can be reversed or undone. This concept is essential in solving linear systems and performing various matrix operations where reversing the transformation represented by the matrix is necessary. Furthermore, the properties of invertible matrices extend to the fact that their eigenvalues cannot be zero, as established earlier.

The characteristic polynomial of a matrix \( A \) provides a polynomial equation whose roots are the eigenvalues of the matrix. Given a matrix \( A \), the characteristic polynomial \( c_A(x) \) is defined by \( \det(xI - A) \), where \( I \) is the identity matrix of the same size as \( A \). Expanding this determinant typically results in a polynomial of degree \( n \) if \( A \) is \( n \times n \). Each root of this polynomial corresponds to an eigenvalue of \( A \). For instance, if the characteristic polynomial is \( (x - \lambda_1)(x - \lambda_2) \ldots (x - \lambda_n) \), the values \( \lambda_1, \lambda_2, \ldots, \lambda_n \) are the eigenvalues. This polynomial is not just a random mathematical construct; it forms the basis for understanding how the matrix scales space, providing critical insight into the stability and behavior of systems, particularly in differential equations and dynamic systems.

The inverse of a matrix \( A \) is another matrix \( A^{-1} \) such that when multiplied, they yield the identity matrix, i.e., \( AA^{-1} = I \) and \( A^{-1}A = I \). Not every matrix has an inverse; matrices that do are called invertible. To find the inverse of a matrix, it is essential to perform operations that conform to specific rules, often involving the adjugate (or adjoint) of the matrix and the determinant. The process can be intricate for higher-dimension matrices but is pivotal for solving linear systems where you need to isolate variables or revert transformations. The eigenvalues of \( A^{-1} \) are particularly interesting because they are simply the reciprocals of the eigenvalues of \( A \). For instance, if \( \lambda \) is an eigenvalue of \( A \), then \( \frac{1}{\lambda} \) is an eigenvalue of \( A^{-1} \). This allows transformational insights, enabling reverse engineering of matrix transformations applicable in various fields such as physics, computer graphics, and engineering.