When isnt a matrix diagonalizable?

  • Thread starter stunner5000pt
  • Start date
  • Tags
    Matrix
In summary, the diagonalizability of a matrix A depends on whether its eigenvectors span the vector space. This is equivalent to the eigenvectors being the generalized eigenvectors and the dimension of the span of the generalized eigenvectors being equal to the multiplicity of each eigenvalue. In the case of a square matrix A, the dimension of E_{\lambda}(A) equals the multiplicity of that eigenvalue for every eigenvalue if and only if A is diagonalizable.
  • #1
stunner5000pt
1,461
2
when isn't a matrix diagonalizable?
the text refers to something like
[itex] dim[E_{\lambda}(A)] [/itex] equals the multiplicity for every lambda for every square matrix A.

i m not sure how to interpret this...
ok let's say we have a matrix
1 0
0 2
whose eigenvalues are 1 and 2
the multiplicity of E1 and E2 are 1. So waht does that mean to the diagonalizability?
 
Physics news on Phys.org
  • #2
No, the multiplicities of [itex]\lambda _1 = 1[/itex] and [itex]\lambda _2 = 2[/itex] are 1. [itex]E_1[/itex] and [itex]E_2[/itex] are subspaces: they don't have multiplicities, they have dimensions. The multiplicity for each [itex]\lambda[/itex] gives you the dimension of the subspaces spanned by the eigenvectors corresponding to that [itex]\lambda[/itex]. Since, in general, the subspace spanned by the eigenvectors corresponding to [itex]\lambda[/itex] is a subspace of [itex]E_{\lambda} (A)[/itex], if the generalized eigenspace has dimension equal to the multiplicity of the eigenvalue, then it has dimension equal to the dimension of the eigenspace, hence it is the eigenspace. Since, in general, the generalized eigenvectors span the corresponding vector space, and since in this particular case, the generalized eigenvectors are the eigenvectors, the eigenvectors span the vector space. Thus, as you should know, this means that A is diagonalizable.

So to clarify:

A is diagonalizable iff the eigenvectors span the vector space
In general, the generalized eigenvectors span the vector space
Therefore, A is diagonalizable iff the eigenvectors are the generalized eigenvectors
In general, the span of the eigenvectors forms a subspace of the span of generalized eigenvectors
Therefore, the generalized eigenvectors are the eigenvectors iff the dimension of the span of the generalized eigenvectors is equal to the dimension of the span of the eigenvectors
In general, given an eigenvalue, the dimension of the span of the corresponding eigenvectors is equal to the multiplicity of that eigenvalue, (in the characeristic polynomial)
Therefore, given an eigenvalue, the span of the generalized eigenvectors equals the span of the eigenvectors iff the span of the generalized eigenvectors has dimension equal to the multiplicity of that eigenvalue.

So, where A is a square matrix, [itex]dim(E_{\lambda}(A))[/itex] equals the multiplicity of [itex]\lambda[/itex] for each [itex]\lambda[/itex] iff A is diagonalizable.

In your example, E1 = Span{e1} = Span{(1 0)T}. This has dimension 1, and the eigenvalue 1 has multiplicity 1 in the characteristic polynomial (x - 1)(x - 2). E2 = Span{e2} = Span{(0 1)T}. This has dimension 1, and the multiplicity of 2 is 1, so for every eigenvalue of A, the dimension of the corresponding generalized eigenspace equals the multiplicity of the eigenvalue, so from what we proved above, A is diagonalizable. Of course, look at A: it is already diagonal! We know it's diagonalizable without doing all this, but hopefully this illustrated the point.

EDIT: If you look at the second paragraph above, you can find a number of conditions that are equivalent to the diagonalizability of A. With this, it's easy to find a number of conditions that are equivalent to the non-diagonalizability of A. Find these, and hopefully that answers your question as to when A is not diagonalizable.
 
Last edited:

1. When is a matrix diagonalizable?

A matrix is diagonalizable if it can be transformed into a diagonal matrix through a similarity transformation, meaning that it has enough linearly independent eigenvectors to form a basis for the vector space.

2. What does it mean for a matrix to be diagonalizable?

A diagonalizable matrix can be simplified into a diagonal matrix, making it easier to compute and analyze. It also has distinct eigenvalues, which represent the scaling factors of the corresponding eigenvectors.

3. When isn't a matrix diagonalizable?

A matrix is not diagonalizable if it does not have enough linearly independent eigenvectors to form a basis for the vector space. This usually occurs when the matrix has repeated eigenvalues or when the eigenvectors are not orthogonal.

4. How can I determine if a matrix is diagonalizable?

To determine if a matrix is diagonalizable, you can calculate its eigenvalues and corresponding eigenvectors. If the number of distinct eigenvalues is equal to the dimension of the matrix, then it is diagonalizable. Additionally, a matrix can be diagonalizable if it is symmetric or if it has a full set of linearly independent eigenvectors.

5. Can a non-square matrix be diagonalizable?

No, only square matrices can be diagonalizable. Non-square matrices do not have eigenvalues or eigenvectors, which are necessary for diagonalization. However, a non-square matrix may be similar to a diagonal matrix if it has a full set of linearly independent eigenvectors.

Similar threads

  • Calculus and Beyond Homework Help
Replies
2
Views
391
  • Calculus and Beyond Homework Help
Replies
6
Views
302
  • Calculus and Beyond Homework Help
Replies
2
Views
525
  • Calculus and Beyond Homework Help
Replies
1
Views
1K
  • Calculus and Beyond Homework Help
Replies
1
Views
249
  • Calculus and Beyond Homework Help
Replies
7
Views
1K
  • Math Proof Training and Practice
Replies
2
Views
2K
  • Calculus and Beyond Homework Help
Replies
2
Views
1K
  • Calculus and Beyond Homework Help
Replies
4
Views
841
  • Calculus and Beyond Homework Help
Replies
14
Views
596
Back
Top