Last updated on August 26th, 2025
If a square matrix becomes a zero matrix when raised to a certain power, then it is called a nilpotent matrix. In this article, we will learn how to find a nilpotent matrix, its properties, and applications.
A square matrix is called nilpotent if it becomes the zero matrix when raised to a specific power. For example:
Since we get A2 = 0, A is nilpotent with index 2.
To check whether a matrix is nilpotent or not, we need to confirm if it's a square matrix (nn). The next step is to raise the power of the base in increasing order to check if the result is a zero matrix. In other words, calculate the successive powers like A2, A3,... up to An. If any power k makes the matrix zero (Ak = 0), then it's nilpotent. For example;
As A2 is zero in every row except the first, calculate A3
A3 = 0, it is a zero matrix, we get A
Nilpotent matrices have rules that make them behave in certain ways. Understanding these properties makes it easier for us to work with them. Some of their properties are:
If a square matrix A turns into the zero matrix when raised to some power k (Ak = 0), so each eigenvalue of A satisfies k = 0. Each should be zero. Also, if all the eigenvalues of a matrix are zero, its characteristic polynomial will be xn. By the Cayley-Hamilton Theorem, if all eigenvalues are zero, the characteristic polynomial is n, so An = 0, confirming nilpotency.
We will check the eigenvalue by solving det(A– I) = 2 = 0, = 0.
A2 = 0, defining that it's nilpotent, and all eigenvalues are zero.
There are many uses of nilpotent in our real world in the fields of nature, architecture, biology, art, and design. Here are some examples of real-life applications of nilpotent matrices:
A nilpotent matrix is not an easy concept to understand; this could cause confusion and mistakes. However, with practice and perseverance, we can strive for excellence while dealing with nilpotent matrices. Let’s start by going through some common mistakes students make while handling nilpotent matrix, so that we can avoid these mistakes in the future:
Does a 22 matrices with zero on the diagonal and one above it become zero when squared?
Yes, such a matrix becomes zero when squared.
While squaring this matrix gives the zero matrix, so it's a nilpotent with index 2.
Is the 22 matrices with [2, -4: 1, -2] nilpotent?
Yes, it's nilpotent.
Squaring this produces the zero matrix, so it goes to the power of 2.
Is the 33 strictly upper-triangular matrix (zeros on diagonal, numbers above) nilpotent?
Yes, the 33 strictly upper-triangular matrix is nilpotent.
Such a matrix will always be zero when raised to the third power.
Is the 22 matrix with entries [2, -1: 4, -2] nilpotent?
Yes, the matrix is nilpotent of index 2, since the square matrix A2 = 0.
Squaring the matrix gives the zero matrix, so it is nilpotent with index 2.
Do a 33 strictly upper-triangular matrices (zeros below and diagonal, numbers above) become zero at the third power?
Yes, it becomes zero at the third power.
When we multiply it three times gives the zero matrix, so yes, it's nilpotent with index 3.