Problem 99
Question
Let \(A=\left[a_{i j}\right]\) be an \(n \times n\) matrix. The matrix \(A-\lambda I\) is called the characteristics matrix of \(A\), where \(\lambda\) is a scalar and \(I\) is the identity matrix. The determinant \(|A-\lambda I|\) is a non-null polynomial of degree \(n\) in \(\lambda\) and is called the characteristic polynomial of \(A\). The equation \(|A-\lambda I|=0\) is called the characteristic equation of \(A\) and its roots are called the characteristic roots or latent roots or eigen values of \(A\). The set of all eigenvalues of the matrix \(A\) is called the spectrum of \(A\). The product of the eigenvalues of a matrix \(A\) is equal to the determinant \(A\). Which of the following statements are correct? (A) If \(A, B\) are \(n\) rowed square matrices and \(A\) is non-singular, then \(A^{-1} B\) and \(B A^{-1}\) has same character-istic roots. (B) If \(A\) and \(P\) are square matrices of same order and \(P\) is non-singular, then \(A\) and \(P^{-1} A P\) have same characteristic roots. (C) If \(A\) and \(B\) be two square matrices of same order, then \(A B\) and \(B A\) have same characteristic roots. (D) All of these
Step-by-Step Solution
VerifiedKey Concepts
Characteristic Polynomial
To find the characteristic polynomial, you calculate the determinant of this characteristic matrix, \|A- lambda I|\. This determinant gives you a polynomial of degree \(n\) in \lambda\, known as the characteristic polynomial. The roots of this polynomial, i.e., the values of \lambda\ for which \|A- lambda I|=0\, are called the eigenvalues of the matrix.
- The characteristic polynomial provides critical information about the matrix's behavior and properties.
- The degree of the characteristic polynomial matches the number of eigenvalues, counted with their multiplicities.
- This polynomial helps predict stability in systems of differential equations and in systems theory, among other applications.
Determinant of a Matrix
This number tells us several important things:
- If the determinant is zero, the matrix is singular, meaning it does not have an inverse.
- If it's non-zero, the matrix is non-singular and has an inverse.
In terms of eigenvalues, it is noteworthy that the product of a matrix's eigenvalues is equal to its determinant. This property can simplify calculations tremendously, especially when dealing with larger matrices, providing a direct way to check for singularity or to find numerical solutions of matrix equations.
Matrix Similarity
An essential property to remember about similar matrices is that they always share the same eigenvalues. This is because the characteristic polynomial is invariant under similarity transformations:
- This means that even though the actual matrix representation (i.e., the form of the matrix) might change, the eigenvalues -- which are fundamentally related to the matrix's structure -- remain the same.
- The similarity transformation can simplify complex matrix computations by transforming a matrix to a more convenient form without altering its spectrum (set of eigenvalues).
Non-Singular Matrix
Determining whether a matrix is non-singular is straightforward: a matrix is non-singular if its determinant is non-zero. This property makes non-singular matrices extremely useful:
- They allow solving systems of linear equations using matrix operations.
- In various computations, the availability of an inverse simplifies solving matrix equations.