Idempotent matrix

Idempotent matrix

Komal MiglaniUpdated on 02 Jul 2025, 06:34 PM IST

A matrix (plural: matrices) is a rectangular arrangement of symbols along rows and columns that might be real or complex numbers. Thus, a system of m x n symbols arranged in a rectangular formation along m rows and n columns is called an m by n matrix (which is written as m x n matrix). There are special types of matrices like Orthogonal matrices, Unitary matrices, and Idempotent matrices. In real life, we use unitary matrices in quantum mechanics.

This Story also Contains

  1. Square matrix
  2. Idempotent matrix
  3. Properties of Idempotent Matrix
  4. Solved Examples Based on Idempotent Matrices
Idempotent matrix
Idempotent matrix

In this article, we will cover the concept of unitary matrices. This category falls under the broader category of Matrices, which is a crucial Chapter in class 12 Mathematics. It is not only essential for board exams but also for competitive exams like the Joint Entrance Examination(JEE Main) and other entrance exams such as SRMJEE, BITSAT, WBJEE, BCECE, and more. A total of twelve questions have been asked on this topic in JEE MAINS(2013 - 2023) including one in 2021 and one in 2023.

Square matrix

The square matrix is the matrix in which the number of rows = number of columns. So matrix $A=\left[a_{i j}\right]_{m \times n}$ is said to be a square matrix when $m=n$.

$
\left[\begin{array}{lll}
a_{11} & a_{12} & a_{13} \\
a_{21} & a_{22} & a_{23} \\
a_{31} & a_{32} & a_{33}
\end{array}\right]_{3 \times 3} \text { or, }\left[\begin{array}{cc}
2 & -4 \\
7 & 3
\end{array}\right]_{2 \times 2}$

Idempotent matrix

An idempotent matrix is defined as a square matrix that remains unchanged when multiplied by itself.

A square matrix is said to be an idempotent matrix if it satisfies the condition A2 = A.

Properties of Idempotent Matrix

1) Every identity matrix is also an idempotent matrix, as the identity matrix gives the same matrix when multiplied by itself.

2) All idempotent matrices are singular matrices, except for the identity matrix.

3) The determinant of an idempotent matrix is either one or zero. If A is an idempotent matrix then |A| = 1 or 0.

4) The non-diagonal entries of an idempotent matrix can be non-zero entries.

5) The trace of an idempotent matrix is always an integer and equal to the rank of the matrix

6) The relationship between idempotent and involuntary matrices is if A is a square matrix “A” is said to be an idempotent matrix if and only if P = 2A − I is an involuntary matrix.

Recommended Video Based on Ídempotent Matrices


Solved Examples Based on Idempotent Matrices

Eaxmple 1: What is an index of the idempotent matrix

$
A=\left[\begin{array}{ccc}
2 & 5 & 14 \\
1 & 3 & 8 \\
-1 & -2 & -6
\end{array}\right]
$

1) 2
2) 3
3) 4
4) 5

Solution: We know that the idempotent matrix - $A^2=A$

$
A^2=\left[\begin{array}{ccc}
2 & 5 & 14 \\
1 & 3 & 8 \\
-1 & -2 & -6
\end{array}\right]\left[\begin{array}{ccc}
2 & 5 & 14 \\
1 & 3 & 8 \\
-1 & -2 & -6
\end{array}\right]=\left[\begin{array}{ccc}
-5 & -3 & 16 \\
-3 & -2 & -10 \\
2 & 1 & 6
\end{array}\right]
$

now if we multiply $A^2 \times A^2$
we get $A^4=I$.
Thus A is an idempotent matrix of order $=4$
Hence, the answer is the option (3).

Example 2: Which of the following matrices is idempotent?

1) \( \begin{pmatrix} 1 & 0 \\ 0 & 1 \end{pmatrix} \)
2) \( \begin{pmatrix} 1 & 1 \\ 0 & 1 \end{pmatrix} \)
3) \( \begin{pmatrix} 0 & 1 \\ 1 & 0 \end{pmatrix} \)
4) \( \begin{pmatrix} 0 & 0 \\ 0 & 1 \end{pmatrix} \)

Solution:
A matrix \( A \) is idempotent if \( A^2 = A \).

1. Matrix A: \( \begin{pmatrix} 1 & 0 \\ 0 & 1 \end{pmatrix} \)

$A^2 = \begin{pmatrix} 1 & 0 \\ 0 & 1 \end{pmatrix} \begin{pmatrix} 1 & 0 \\ 0 & 1 \end{pmatrix} = \begin{pmatrix} 1 & 0 \\ 0 & 1 \end{pmatrix}$

\( A^2 = A \), so Matrix A is idempotent.

2. Matrix B: \( \begin{pmatrix} 1 & 1 \\ 0 & 1 \end{pmatrix} \)

$B^2 = \begin{pmatrix} 1 & 1 \\ 0 & 1 \end{pmatrix} \begin{pmatrix} 1 & 1 \\ 0 & 1 \end{pmatrix} = \begin{pmatrix} 1 & 2 \\ 0 & 1 \end{pmatrix}$

\( B^2 \neq B \), so Matrix B is not idempotent.

3. Matrix C: \( \begin{pmatrix} 0 & 1 \\ 1 & 0 \end{pmatrix} \)

$ C^2 = \begin{pmatrix} 0 & 1 \\ 1 & 0 \end{pmatrix} \begin{pmatrix} 0 & 1 \\ 1 & 0 \end{pmatrix} = \begin{pmatrix} 1 & 0 \\ 0 & 1 \end{pmatrix}$

\( C^2 \neq C \), so Matrix C is not idempotent.

4. Matrix D: \( \begin{pmatrix} 0 & 0 \\ 0 & 1 \end{pmatrix} \)

$D^2 = \begin{pmatrix} 0 & 0 \\ 0 & 1 \end{pmatrix} \begin{pmatrix} 0 & 0 \\ 0 & 1 \end{pmatrix} = \begin{pmatrix} 0 & 0 \\ 0 & 1 \end{pmatrix}$

\( D^2 = D \), so Matrix D is idempotent.

Hence, matrices that are idempotent are 1 and 4.

Example 3: Which of the following is a property of an idempotent matrix \( A \)?

1) \( A \) is invertible.
2) \( A \) has a trace equal to its rank.
3) The eigenvalues of \( A \) are purely imaginary.
4) \( A \) is always diagonalizable.

Solution:
1. False. An idempotent matrix is not necessarily invertible. For instance, a matrix with eigenvalue 0 is not invertible.
2. True. For an idempotent matrix, the trace (sum of eigenvalues) equals the rank because the eigenvalues are either 0 or 1.
3. False. The eigenvalues of an idempotent matrix are 0 and 1, which are not purely imaginary.
4. False. An idempotent matrix is not necessarily diagonalizable, though it can be.

Hence, the answer is option 2.

Example 4: Find the value of a for which the matrix $\left[\begin{array}{ccc}2 & -2 & -4 \\ -1 & 3 & 4 \\ a & -2 & -3\end{array}\right]$ is idempotent.

1) 2

2) -1

3) 1

4) 0

Solution: We know that, For Idempotent A2=A

$\begin{aligned} & A^2=\left[\begin{array}{ccc}2 & -2 & -4 \\ -1 & 3 & 4 \\ a & -2 & -3\end{array}\right] \times\left[\begin{array}{ccc}2 & -2 & -4 \\ -1 & 3 & 4 \\ a & -2 & -3\end{array}\right]=\left[\begin{array}{ccc}4+2-4 a & -4-6+8 & -8-8+12 \\ -2-3+4 a & 2+9-8 & 4+12-12 \\ 2 a+2-3 a & -2 a-6+6 & -4 a-8+9\end{array}\right] \\ & A^2=\left[\begin{array}{ccc}6-4 a & -2 & -4 \\ 4 a-5 & 3 & 4 \\ -a+2 & -2 & -3\end{array}\right]=A=\left[\begin{array}{ccc}2 & -2 & -4 \\ -1 & 3 & 4 \\ a & -2 & -3\end{array}\right]\end{aligned}$

Solving any element we get a=1

Hence, the answer is the option 3.

Example 5: Consider the matrix \( B \):
$B = \begin{pmatrix}
0 & 1 \\
0 & 0
\end{pmatrix}$
Is \( B \) an idempotent matrix?
1) Yes
2) No

Solution:
Compute \( B^2 \):
$B^2 = \begin{pmatrix}
0 & 1 \\
0 & 0
\end{pmatrix} \times \begin{pmatrix}
0 & 1 \\
0 & 0
\end{pmatrix} = \begin{pmatrix}
0 & 0 \\
0 & 0
\end{pmatrix}$
Since \( B^2 \neq B \), \( B \) is not idempotent.


Frequently Asked Questions (FAQs)

Q: How do idempotent matrices relate to the concept of matrix stability?
A:
Idempotent matrices (except for the zero matrix) are always marginally stable in the sense of Lyapunov stability. This is because their eigenvalues are either 0 or 1, lying on the boundary of the stable region in the complex plane.
Q: How do idempotent matrices behave under the Jordan canonical form?
A:
The Jordan canonical form of an idempotent matrix consists only of 1x1 Jordan blocks with eigenvalues 0 or 1. This simplified structure reflects the fact that idempotent matrices are diagonalizable and have only 0 and 1 as eigenvalues.
Q: What is the relationship between idempotent matrices and matrix polynomials?
A:
For an idempotent matrix A, any polynomial f(A) can be simplified to f(0)(I - A) + f(1)A. This is because A^n = A for all positive integers n, allowing higher powers to be reduced to the first power.
Q: How do idempotent matrices relate to the concept of matrix norms?
A:
For any idempotent matrix A, its spectral norm (the largest singular value) is always 1, unless A is the zero matrix. This property is a consequence of the fact that the eigenvalues of idempotent matrices are either 0 or 1.
Q: What is the significance of idempotent matrices in graph theory?
A:
In graph theory, idempotent matrices are used to represent certain graph properties. For example, the adjacency matrix of a graph raised to a power can be idempotent, indicating specific structural properties of the graph, such as bipartiteness.
Q: How do idempotent matrices behave under matrix logarithms?
A:
The matrix logarithm of an idempotent matrix A (excluding the zero matrix) is given by ln(A) = (A - I), where ln denotes the principal matrix logarithm. This simplified form is due to the special eigenvalue structure of idempotent matrices.
Q: How do idempotent matrices behave under the matrix sign function?
A:
The matrix sign function of an idempotent matrix A is equal to 2A - I. This simplified form is a consequence of the fact that idempotent matrices have only 0 and 1 as eigenvalues, allowing for a straightforward computation of the sign function.
Q: How do idempotent matrices relate to the concept of matrix conditioning?
A:
Idempotent matrices (excluding the zero matrix) always have a condition number of 1 with respect to the spectral norm. This is because their non-zero singular values are all equal to 1, making them well-conditioned matrices for numerical computations.
Q: How do idempotent matrices behave under matrix functions?
A:
For any analytic function f(x), the matrix function f(A) of an idempotent matrix A can be simplified to f(0)(I - A) + f(1)A. This property allows for easy computation of matrix functions for idempotent matrices, which is useful in various applications.
Q: What is the connection between idempotent matrices and matrix series?
A:
For an idempotent matrix A, many matrix series simplify significantly. For example, the geometric series I + A + A² + ... converges to (I - A)⁻¹ for ||A|| < 1, but for an idempotent A, it simplifies to I + A, regardless of the norm of A.