Nilpotent Matrices: How to Determine If Matrix is Nilpotent

  • Thread starter Thread starter Dragonfall
  • Start date Start date
  • Tags Tags
    Matrices
Click For Summary
To determine if an nxn matrix is nilpotent, compute its eigenvalues and verify if they are all zero. When dealing with multiple matrices, checking the rank of each can help eliminate invertible ones, focusing on the nullspace vectors of the remaining matrices. A product of matrices can yield zero if the columns of the invertible matrices lie in the nullspace of the singular ones. However, this method is considered a rough approach. Ultimately, the complexity of the problem may lead to undecidable scenarios in certain cases.
Dragonfall
Messages
1,023
Reaction score
5
Given an nxn matrix, how do I know whether it's nilpotent?
 
Physics news on Phys.org
Compute the eigenvalues and check if they are all zero.
 
Why is it that when you have 30 15x15 matrices, it is impossible to find out whether some chain of them will multiply out to be 0?
 
I wonder if it's easier to just compute powers of the matrix to decide if it's nilpotent?


Anyways, for your new question, that sounds like a variant on the word problem. The direct translation of the word problem into matrices would be to tell if a product of some given matrices gives you the identity -- I have no idea if using zero instead makes a difference.
 
well a quick and dirty solution would be checking the rank of each and every matrix and remove the invertible chains. Then you can concentrate on the nullspace vectors of those remaining. I know it really doesn't sound nice.

Singular value decomposition should be doable for 30 of them in a row.
 
You can't eliminate the invertible ones. Consider the following set of 2x2 matrices:

<br /> \left( \begin{array}{cc} 0 &amp; 1 \\ 1 &amp; 0 \end{array} \right)<br /> \qquad \qquad<br /> \left( \begin{array}{cc} 1 &amp; 0 \\ 0 &amp; 0 \end{array} \right)<br />

There is a product of these matrices that gives zero... but it requires use of the invertible matrix.
 
Damn. If I were given something like this to work on for my thesis, and it turns out to be undecidable, that'll suck.
 
Hurkyl said:
You can't eliminate the invertible ones. Consider the following set of 2x2 matrices:

<br /> \left( \begin{array}{cc} 0 &amp; 1 \\ 1 &amp; 0 \end{array} \right)<br /> \qquad \qquad<br /> \left( \begin{array}{cc} 1 &amp; 0 \\ 0 &amp; 0 \end{array} \right)<br />

There is a product of these matrices that gives zero... but it requires use of the invertible matrix.

No it is not zero. Again after obtaining the nullspace vectors you can reduce the number of conditions to check...
 
If you name the first matrix A and the second B, then ABAB is zero.
 
  • #10
I did not understand that you meant multiple products of the same matrices.

But, that is exactly what I am saying. Because a column of A is in the kernel of B. Instead of checking ABAB...AB you can check if the columns of product of the invertible ones are in the nullspace of the singular ones. If not whatever happens the product is nonzero.

Note that I said it is just a dirty way of doing it.
 

Similar threads

  • · Replies 4 ·
Replies
4
Views
2K
Replies
9
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 25 ·
Replies
25
Views
4K
  • · Replies 14 ·
Replies
14
Views
3K
  • · Replies 14 ·
Replies
14
Views
3K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 5 ·
Replies
5
Views
1K