Diagonalizable Matrices with Eigenvalues of + or -1: A Proof

In summary, the conversation discusses how to prove that if all the eigenvalues of a diagonalizable matrix are either +1 or -1, then the matrix is equal to its inverse. The conversation goes through the steps of using a diagonal matrix with +1 and -1 along its main diagonal, finding the inverse of the matrix, and ultimately concluding that the inverse of the matrix is equal to the original matrix. The conversation also discusses the properties of the inverse of a product of matrices and how it can be used to show that the inverse of a diagonal matrix is equal to the original matrix.
  • #1
trojansc82
60
0

Homework Statement



Prove that if the eigenvalues of a diagonalizable matrix are all + or -1, then the matrix is equal to its inverse.

i) Let D = P-1AP, where D is a diagonal matrix with + or -1 along its main diagonal.

ii) Find A in terms of P, P-1, and D.

iii) Use the fact that D is the diagonal and the properties of the inverse of a product of matrices to expand to find A-1.

iv) Conclude that A-1 = A.



Homework Equations





The Attempt at a Solution



D * P-1 = P-1 AP *P-1

P * D * P-1 = P * P-1 A

PDP-1 = A

Not sure if I'm heading in the right direction. I am drawing a blank here.
 
Physics news on Phys.org
  • #2
Yes, [itex]PDP^{-1}= A[/itex]. Further more if D is invertible (and it clearly is since it does not have a 0 on its diagonal), so is A and [itex]A^{-1}= (PDP^{-1})^{-1}[/itex]

Now use the fact that [itex](ABC)^{-1}= C^{-1}B^{-1}A^{-1}[/itex].
 
  • #3
Ok, how do I show that D-1 = D ?
 
  • #4
What is the inverse of
[tex]\begin{bmatrix}a & 0 \\ 0 & b\end{bmatrix}[/tex]

What is the inverse of
[tex]\begin{bmatrix}a & 0 & 0 \\ 0 & b & 0 \\ 0 & 0 & c\end{bmatrix}[/tex]
 
  • #5
1. 1/ab * [tex]\begin{bmatrix}b & 0 \\ 0 & a\end{bmatrix}[/tex]

2. 1/abc * [tex]\begin{bmatrix}c & 0 & 0 \\ 0 & b & 0 \\ 0 & 0 & a\end{bmatrix}[/tex]
 

FAQ: Diagonalizable Matrices with Eigenvalues of + or -1: A Proof

What is a diagonalizable matrix?

A diagonalizable matrix is a square matrix that can be written in the form of P-1DP, where P is an invertible matrix and D is a diagonal matrix. This means that all the non-diagonal elements of the matrix are equal to 0.

How do you prove that a matrix is diagonalizable?

To prove that a matrix is diagonalizable, you have to show that it is similar to a diagonal matrix. This can be done by finding the eigenvalues and eigenvectors of the matrix and using them to construct the diagonal matrix D and the invertible matrix P.

Can a non-square matrix be diagonalizable?

No, a non-square matrix cannot be diagonalizable. Diagonalizable matrices must be square, meaning they have the same number of rows and columns.

What is the importance of diagonalizable matrices?

Diagonalizable matrices have many important applications in linear algebra and other fields of mathematics. They are used to simplify calculations and solve systems of linear equations. They are also important in the study of eigenvalues and eigenvectors.

Are all diagonalizable matrices invertible?

Not all diagonalizable matrices are invertible. A diagonalizable matrix is invertible if and only if all of its eigenvalues are non-zero. If any of the eigenvalues are equal to 0, the matrix will not be invertible.

Similar threads

Replies
8
Views
2K
Replies
3
Views
2K
Replies
7
Views
2K
Replies
1
Views
2K
Replies
11
Views
3K
Replies
3
Views
1K
Replies
1
Views
1K
Back
Top