Diagonalizable Matrix: How to Approach?

  • Context: MHB 
  • Thread starter Thread starter Yankel
  • Start date Start date
  • Tags Tags
    Matrix
Click For Summary

Discussion Overview

The discussion revolves around the conditions under which the matrix \(\begin{pmatrix} 6 & 0\\ -3 & a \end{pmatrix}\) is diagonalizable, specifically focusing on the value of \(a\). Participants explore the implications of different values of \(a\) on the diagonalizability of the matrix, considering eigenvalues and eigenvectors as part of their analysis.

Discussion Character

  • Exploratory
  • Technical explanation
  • Debate/contested
  • Mathematical reasoning

Main Points Raised

  • Some participants suggest that the trace and determinant of the matrix can provide insights into the eigenvalues, with the trace being \(6 + a\) and the determinant being \(6a\).
  • There is a discussion about the Jordan normal form and its relevance to diagonalizability, with some participants noting that a matrix is guaranteed to be diagonalizable if its eigenvalues are distinct.
  • One participant emphasizes that a matrix is diagonalizable if it has a complete set of eigenvectors, which requires two independent eigenvectors.
  • It is noted that if \(a\) equals \(6\), the eigenvalues are not distinct, which raises questions about the independence of the eigenvectors.
  • Participants express uncertainty about how to determine the value of \(a\) that ensures diagonalizability.

Areas of Agreement / Disagreement

Participants generally agree on the importance of eigenvalues and eigenvectors in determining diagonalizability, but there is no consensus on the specific value of \(a\) that guarantees diagonalizability. Multiple competing views remain regarding the implications of different values of \(a\).

Contextual Notes

Participants mention the Jordan normal form and its relation to diagonalizability, but there are unresolved questions about how to apply these concepts to find the value of \(a\). The discussion includes assumptions about the independence of eigenvectors based on the values of \(a\) without definitive conclusions.

Yankel
Messages
390
Reaction score
0
Hello all

I have this matrix:

\[\begin{pmatrix} 6 & 0\\ -3 & a \end{pmatrix}\]

And I am told it is diagonalizable. Therefore, the value of a is:

1) a=0
2) a not= 0
3) a not=6
4) a=6
5) a not=0,6

How should I approach this? Is there a "trick" or should I find eigenvalues and eigenvectors for both values of a?

Thank you.
 
Physics news on Phys.org
Yankel said:
Hello all

I have this matrix:

\[\begin{pmatrix} 6 & 0\\ -3 & a \end{pmatrix}\]

And I am told it is diagonalizable. Therefore, the value of a is:

1) a=0
2) a not= 0
3) a not=6
4) a=6
5) a not=0,6

How should I approach this? Is there a "trick" or should I find eigenvalues and eigenvectors for both values of a?

Thank you.

Hi Yankel! ;)

Are you familiar with the Jordan normal form?
If so, what are the possibilities for the Jordan normal form?

Furthermore, a "trick" is that the trace ($6+a$) is equal to the sum of the eigenvalues, and the determinant is equal to the product of the eigenvalues.
 
Hi,

So 6a is the product of the eigenvalues and 6+a is the sum.

if a=0, the product is 0 and the sum is 6

if a=6 the product is 36 and the sum is 12

how does that help me find a ?

what is Jordan normal form?
 
Yankel said:
Hi,

So 6a is the product of the eigenvalues and 6+a is the sum.

if a=0, the product is 0 and the sum is 6

if a=6 the product is 36 and the sum is 12

how does that help me find a ?

what is Jordan normal form?

More specifically, the eigenvalues are $6$ and $a$.

And if you're not familiar with the Jordan normal form, you're probably supposed to indeed find the eigenvalues and the eigenvectors to do the diagonalization.

For the record, every matrix is similar to a Jordan normal form.
It tells us something about how diagonalizable a matrix is, and how to categorize matrices..
Note that a diagonalizable matrix is defined as a matrix that is similar to a diagonal matrix.

The possibilities for the Jordan normal form are:
$$\begin{pmatrix}\lambda_1 & 1 \\ 0 & \lambda_1\end{pmatrix},
\begin{pmatrix}\lambda_1 & 0 \\ 0 & \lambda_1\end{pmatrix},
\begin{pmatrix}\lambda_1 & 0 \\ 0 & \lambda_2\end{pmatrix}
$$
It means that the matrix is guaranteed to be diagonalizable if the eigenvalues are different.
And if the eigenvalues are the same, we cannot tell yet. We'll have to check further.
 
A matrix is "diagonalizable" if and only if it has a "complete set" of eigenvectors. That is, that there exist a basis for the vector space consisting of Eigen vectors. Here, that means that there must be two independent eigenvectors.

It is obvious that the two eigenvalues are "6" and "a". If a is any number other than "6" the two eigenvectors will be independent (eigenvectors corresponding to distinct eigenvalues are always independent). Since this a "triangular" matrix, it is obvious that if a= 6, there are not two independent eignvectors.
 

Similar threads

  • · Replies 10 ·
Replies
10
Views
2K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 9 ·
Replies
9
Views
4K
  • · Replies 52 ·
2
Replies
52
Views
4K
  • · Replies 7 ·
Replies
7
Views
4K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 4 ·
Replies
4
Views
1K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 34 ·
2
Replies
34
Views
2K