Diagonalizing a square matrix with degenerate eigenvalues

Click For Summary

Discussion Overview

The discussion revolves around the diagonalization of a 3x3 matrix with degenerate eigenvalues, specifically focusing on the case where the eigenvalues are 0, 0, and 5. Participants explore the implications of having multiple eigenvectors for the zero eigenvalue and how to construct a diagonalizing matrix in this context, particularly within the framework of Quantum Mechanics.

Discussion Character

  • Technical explanation
  • Conceptual clarification
  • Debate/contested

Main Points Raised

  • Vivek introduces the problem of diagonalizing a matrix with degenerate eigenvalues and notes the challenge of determining eigenvectors for the zero eigenvalue, which has infinitely many solutions.
  • Some participants suggest that while there are infinitely many eigenvectors for an eigenvalue, not all are linearly independent, emphasizing the need for three linearly independent eigenvectors to diagonalize the matrix.
  • Vivek proposes selecting specific eigenvectors, (1, 0, 0)' and (0, 1, 0)', for the zero eigenvalue and inquires if this approach is valid.
  • Another participant questions the correctness of the method of "plugging in" the eigenvectors into the diagonalizing matrix and emphasizes the importance of constructing the matrix P accurately.
  • Vivek clarifies that by "plugging them in," they mean to construct a matrix P with the selected linearly independent eigenvectors, including the eigenvector corresponding to the eigenvalue 5.

Areas of Agreement / Disagreement

Participants generally agree on the necessity of having linearly independent eigenvectors for diagonalization, but there is some uncertainty regarding the selection and correctness of the eigenvectors for the degenerate eigenvalue. The discussion remains unresolved regarding the specific eigenvectors to use and the method of constructing the diagonalizing matrix.

Contextual Notes

The discussion highlights the dependence on the choice of eigenvectors for the zero eigenvalue and the implications of linear independence in the context of diagonalization. There are unresolved aspects regarding the uniqueness of eigenvectors and the construction of the matrix P.

maverick280857
Messages
1,774
Reaction score
5
Hi

This is more of a math question but in the context of Quantum Mechanics, hence I posted it here. Suppose I have a matrix A of order 3x3 with three eigenvalues: 0, 0, 5. I am supposed to find the diagonalizing matrix for A.

I know that in general, if P denotes the matrix of eigenvectors of A, then PAP^{-1} will be a diagonal matrix.

In my particular example, for the eigenvalue 0,

AX = 0

gives infinitely many solutions for X, so the eigenvector with eigenvalue 0 cannot be uniquely determined.

How do I diagonalize such a matrix?

Thanks in advance,

Cheers
Vivek
 
Physics news on Phys.org
There are infinitely many different eigenvectors for an eigenvalue, but are they all linearly independent? Remember that you only need 3 linearly independent eigenvectors for this. Just pick a simple eigenvector associated with the zero eigenvalue.
 
Ok, let's say I take (1, 0, 0)' and (0, 1, 0)' as the eigenvectors for the zero eigenvalue. And then I just plug them along with the eigenvector for the eigenvalue 5...and that's it, right?
 
Well, that's provided you "plug them in" correctly, doesn't it?
 
Defennder said:
Well, that's provided you "plug them in" correctly, doesn't it?

Yes, as the problem asks to find the diagonalizing matrix, I was wondering what to write as the eigenvectors are not uniquely determined here. By "plug them in", I meant that I construct a matrix P whose columns are precisely the Linearly independent eigenvectors of the matrix A...in this case I select two Linearly independent eigenvectors for the zero eigenvalue and the third column is the eigenvector for the eigenvalue 5.

Thanks for your help Defennder :smile:
 

Similar threads

  • · Replies 33 ·
2
Replies
33
Views
3K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 2 ·
Replies
2
Views
9K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
6K
  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 12 ·
Replies
12
Views
2K