Problem 33 - Differential Equations and Linear Algebra

Question

Let \(A\) be a nondefective matrix and let \(S\) be a matrix such that \(S^{-1} A S=\operatorname{diag}\left(\lambda_{1}, \lambda_{2}, \ldots, \lambda_{n}\right)\) (a) Prove that if \(Q=\left(S^{T}\right)^{-1},\) then $$Q^{-1} A^{T} Q=\operatorname{diag}\left(\lambda_{1}, \lambda_{2}, \ldots, \lambda_{n}\right)$$ (b) If \(M_{C}\) denotes the matrix of cofactors of \(S,\) prove that the column vectors of \(M_{C}\) are linearly independent eigenvectors of \(A^{T} .\) [Hint: Use the adjoint method to determine \(S^{-1} .]\)

Step-by-Step Solution

Answer

We have a nondefective matrix A and a matrix S such that \(S^{-1}AS=\operatorname{diag}(\lambda_1, \lambda_2, ..., \lambda_n)\). We are tasked with proving two statements: (a) If \(Q = (S^T)^{-1}\), then \(Q^{-1} A^T Q = \operatorname{diag}(\lambda_1, \lambda_2, ..., \lambda_n)\). This is proven by transposing both sides of the given condition and applying transpose properties to obtain the desired result. (b) The column vectors of the matrix of cofactors of S are linearly independent eigenvectors of \(A^T\). This is proven by using the adjoint method to find \(S^{-1}\), applying this to the given condition, and relating the equation with \(A^T\). Then we show that the column vectors of \(M_C\) are eigenvectors of matrix \(A^T\) and are also linearly independent.

Step 1: Write the given condition for matrix S

Given that \(S^{-1}AS = \operatorname{diag}(\lambda_1, \lambda_2, ..., \lambda_n)\), we will try to relate this with \(Q^{-1} A^T Q\).

Step 2: Transpose both sides of the given condition

Transpose both sides of the equation \(S^{-1}AS = \operatorname{diag}(\lambda_1, \lambda_2, ..., \lambda_n)\): \[(S^{-1}AS)^T = (\operatorname{diag}(\lambda_1, \lambda_2, ..., \lambda_n))^T\]

Step 3: Simplify the transposed equation

Apply the transpose properties for the left side and note that the transpose of a diagonal matrix is itself: \[S^T A^T (S^{-1})^T = \operatorname{diag}(\lambda_1, \lambda_2, ..., \lambda_n)\]

Step 4: Replace Q in the equation

Replace the left side of the equation with Q as follows: \[Q^{-1} A^T Q = \operatorname{diag}(\lambda_1, \lambda_2, ..., \lambda_n)\] Thus, statement (a) is proven. Proving Statement (b):

Step 1: Use the adjoint method to find \(S^{-1}\)

For any matrix A, the inverse of A can be found using the adjoint method as follows: \[A^{-1} = \frac{1}{\det(A)} \operatorname{adj}(A)\] Where \(\operatorname{adj}(A)\) is the adjoint of matrix A as \(\operatorname{adj}(A) = M_C^T\), where \(M_C\) is the matrix of cofactors.

Step 2: Apply the inverse to the given condition

Using the adjoint method, the inverse of S can be determined as: \[S^{-1} = \frac{1}{\det(S)} M_C^T\] Substitute this into the given condition: \[\frac{1}{\det(S)} M_C^T A S = \operatorname{diag}(\lambda_1, \lambda_2, ..., \lambda_n)\]

Step 3: Cancel out factors

Since S is a non-defective matrix, we know that its determinant is nonzero. So, we can multiply both sides of the equation by the determinant of S: \[M_C^T A S = \det(S)\operatorname{diag}(\lambda_1, \lambda_2, ..., \lambda_n)\]

Step 4: Relate the equation with \(A^T\)

Take the transpose of both sides of the equation: \[(M_C A S^T)^T = (\det(S)\operatorname{diag}(\lambda_1, \lambda_2, ..., \lambda_n))^T\] Apply transpose properties and note that the transpose of a diagonal matrix is itself: \[S M_C^T A^T = \operatorname{diag}(\lambda_1, \lambda_2, ..., \lambda_n) \det(S)\]

Step 5: Show column vectors of M_C are eigenvectors of \(A^T\)

We can rewrite the above equation as follows: \[A^T S M_C^T = S M_C^T \operatorname{diag}(\lambda_1, \lambda_2, ..., \lambda_n)\] This shows that the column vectors of \(M_C\) are eigenvectors of matrix \(A^T\).

Step 6: Prove that the column vectors of M_C are linearly independent

Since S is nondefective, its eigenvectors are linearly independent. Therefore, the column vectors of \(M_C^T\) are linearly independent, and since the column vectors of \(M_C^T\) are the row vectors of \(M_C\), we can conclude that the column vectors of \(M_C\) are linearly independent as well. Thus, statement (b) is proven.

Key Concepts

Linear Independence

In mathematics, the concept of linear independence is key when discussing eigenvectors and eigenvalues, especially in matrices. Vectors are said to be linearly independent if no vector in the set is a linear combination of the others. This means that each vector adds a unique direction in the vector space.

Why this matters in matrices:

• When finding eigenvectors, it is crucial they are linearly independent to ensure the matrix can be diagonalized.
• Linear independence assures that we have a full basis for our vector space when each eigenvector corresponds to a unique eigenvalue.

In the context of the problem, the matrix \( M_C \), which is the cofactor matrix of \( S \), has column vectors that are linearly independent eigenvectors of \( A^T \). This property is tied to \( S \) being non-defective, indicating that it has a full set of linearly independent eigenvectors.

Transpose Matrix

The transpose of a matrix is obtained by swapping its rows and columns. For a matrix \( A \), its transpose is denoted as \( A^T \). This operation is crucial for many mathematical and geometric applications.

Important properties of transpose matrices include:

• The transpose of the transpose retrieves the original matrix: \( (A^T)^T = A \).
• It reflects linear transformations over symmetrical lines.
• The transpose of a product is the product of the transposes in reversed order: \( (AB)^T = B^T A^T \).

In context, the analysis involves the transpose to show that if \( S^{-1}AS \) is diagonal, then \( Q^{-1} A^T Q \) is also diagonal. This equivalence is critical for proving statement (a) where \( Q \) is defined in terms of \( S^T \).

Adjoint Matrix

The adjoint, or adjugate, of a matrix is key to finding matrix inverses. For any square matrix \( A \), its adjoint is the transpose of its cofactor matrix (\( M_C \)).

The adjoint plays a significant role in the formula for matrix inversion:

• The inverse of \( A \) can be found when \( A^{-1} = \frac{1}{\det(A)} \text{adj}(A) \).
• It is useful in proving various algebraic properties and solving matrix equations.

In problem statement (b), the adjoint method is employed to express \( S^{-1} \), showcasing how cofactor matrices' properties are leveraged to prove that eigenvectors of \( A^T \) are linearly independent.

Cofactor Matrix

A cofactor matrix is constructed from the minors of a matrix. It is pivotal in calculating the adjoint of a matrix, which in turn is used to find the inverse. Each element of the cofactor matrix is a minor, which is the determinant of a submatrix, with particular signs considered.

Some key usages of cofactor matrices include:

• Determining the adjoint: The adjoint of a matrix is the transpose of its cofactor matrix.
• Calculating matrix determinants and inverses.
• Establishing linear independence and eigenvector calculations as seen in this problem.

Here, the cofactor matrix \( M_C \) is shown to consist of linearly independent column vectors, functioning as eigenvectors of \( A^T \), playing a crucial role in statement (b) of the problem.