|
|
|
|
nilpotent matrix
|
(Definition)
|
|
|
The square matrix is said to be nilpotent if
for some positive integer (here
denotes the matrix where every entry is 0).
Theorem 1 (Characterization of nilpotent matrices) A matrix is nilpotent iff its eigenvalues are all 0.
Since the determinant is the product of the eigenvalues it follows that a nilpotent matrix has determinant 0. Similarly, since the trace of a square matrix is the sum of the eigenvalues, it follows that it has trace 0.
One class of nilpotent matrices are the strictly triangular matrices (lower or upper), this follows from the fact that the eigenvalues of a triangular matrix are the diagonal elements, and thus are all zero in the case of strictly triangular matrices.
Note for matrices the theorem implies that is nilpotent iff
or
.
Also it is worth noticing that any matrix that is similar to a nilpotent matrix is nilpotent.
|
"nilpotent matrix" is owned by jgade.
|
|
(view preamble)
Cross-references: similar, implies, strictly, diagonal, triangular matrix, class, sum, trace, product, determinant, Cayley-Hamilton theorem, polynomial, induction, vector, eigenvalue, eigenvalues, iff, matrix, integer, positive, nilpotent, square matrix
There are 4 references to this entry.
This is version 14 of nilpotent matrix, born on 2002-10-16, modified 2006-06-13.
Object id is 3520, canonical name is NilpotentMatrix.
Accessed 19635 times total.
Classification:
| AMS MSC: | 15-00 (Linear and multilinear algebra; matrix theory :: General reference works ) |
|
|
|
|
|
|
Pending Errata and Addenda
|
|
|
|
|
|
|
|
|
|
|