Linear Algebra - Showing a Matrix is not Diagonalizable

Click For Summary
SUMMARY

The matrix A, defined as A = [k 0; 0 k], is not diagonalizable because it lacks two linearly independent eigenvectors. The only eigenvalue is k, leading to the characteristic equation resulting in a 2x2 zero matrix when substituting λ = k. This indicates that the eigenspace has only the trivial solution (0,0), confirming that A does not meet the criteria for diagonalizability as it fails to provide the necessary number of independent eigenvectors. Additionally, despite being symmetric, the matrix remains non-diagonalizable due to the absence of sufficient eigenvectors.

PREREQUISITES
  • Understanding of eigenvalues and eigenvectors
  • Familiarity with matrix diagonalization concepts
  • Knowledge of triangular matrices and their properties
  • Basic linear algebra, including the rank-nullity theorem
NEXT STEPS
  • Study the properties of triangular matrices in linear algebra
  • Learn about the rank-nullity theorem and its implications for eigenvectors
  • Explore the conditions under which a matrix is diagonalizable
  • Investigate the relationship between symmetry and diagonalizability in matrices
USEFUL FOR

Students and educators in linear algebra, mathematicians analyzing matrix properties, and anyone seeking to deepen their understanding of diagonalization and eigenvector theory.

Rockoz
Messages
30
Reaction score
0

Homework Statement


Show that the matrix A is not diagonalizable. Explain your reasoning.

A=\begin{bmatrix}k&0\\0&k\\\end{bmatrix}

Homework Equations


Important theorem: A nxn matrix is diagonalizable if and only if it has n linearly independent eigenvectors.


The Attempt at a Solution


Since A is triangular, the eigenvalues are the entries on the main diagonal. In this case the only eigenvalue is k. So then I solve for B = (λI - A) where λ=k, which turns out to equal a 2x2 zero matrix. Then I solve Bx = 0 to try and find the eigenvectors. Here is where I think I'm going wrong. Since B is the zero matrix, I believe that x1 = t, x2 = s, where t and s are any real number. So I find that the vector x is equal to t(1,0) + s(0,1) which would indicate to me that the matrix has two linearly independent eigenvectors and should be diagonalizable.

But this is the opposite of which I wished to prove! So clearly my thinking must be wrong. The solution for this problem says that a basis for the eigenspace is simply {(0,0)}, so since A does not have two linearly independent eigenvectors, it does not satisfy the theorem I have above and cannot be diagonalizable.

My problem is that I don't see how you can say from Bx=0 where B is the 2x2 zero matrix that x can only be (0,0) and thus the basis for the eigenspace is only {(0,0)}. Can't x be any vector?

Thank you.

EDIT: Another point. Isn't this matrix also symmetric (A=Atranspose)? Then shouldn't it be diagonalizable (it's already diagonal anyways)?
 
Last edited:
Physics news on Phys.org
I would go with your EDIT, this is already a diagonal matrix.

Are you sure the matrix is written correctly?
 
Thank you for replying. Yes, it is written correctly.

There must be some idea I'm missing here in solving the problem. I have trouble believing the book is incorrect on this, since I'm usually wrong on such things.
 

Similar threads

  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
Replies
2
Views
1K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 8 ·
Replies
8
Views
2K
Replies
2
Views
2K