Idempotent Matrix and its Eigenvalues

Idempotent Matrix Problems and Solutions in Linear Algebra

Problem 176

Let $A$ be an $n \times n$ matrix. We say that $A$ is idempotent if $A^2=A$.

(a) Find a nonzero, nonidentity idempotent matrix.

(b) Show that eigenvalues of an idempotent matrix $A$ is either $0$ or $1$.

(The Ohio State University, Linear Algebra Final Exam Problem)
 
LoadingAdd to solve later

Proof.

(a) Nonzero, nonidentity idempotent matrix

Let $A=\begin{bmatrix}
0 & 1\\
0 & 1
\end{bmatrix}$. Then $A$ is a nonzero, nonidentity matrix and $A$ is idempotent since we have
\[A^2=\begin{bmatrix}
0 & 1\\
0 & 1
\end{bmatrix}\begin{bmatrix}
0 & 1\\
0 & 1
\end{bmatrix}=\begin{bmatrix}
0 & 1\\
0 & 1
\end{bmatrix}=A.\]

(b) Eigenvalues of an idempotent matrix $A$ is either $0$ or $1$

Let $\lambda$ be an eigenvalue of the idempotent matrix $A$ and let $\mathbf{x}$ be an eigenvector corresponding to the eigenvalue $\lambda$.
Namely we have
\[A\mathbf{x}=\lambda \mathbf{x}, \mathbf{x}\neq \mathbf{0}. \tag{*} \] Then we compute $A^2\mathbf{x}$ in two ways.
First, since $A$ is idempotent we have $A^2=A$ and thus we have
\[A^2\mathbf{x}=A\mathbf{x}\stackrel{(*)}{=} \lambda \mathbf{x}.\]


Next, we compute as follows.
\begin{align*}
A^2\mathbf{x}=A(A\mathbf{x})\stackrel{(*)}{=}A(\lambda \mathbf{x})=\lambda (A\mathbf{x})\stackrel{(*)}{=}\lambda (\lambda \mathbf{x})=\lambda^2\mathbf{x}.
\end{align*}

Comparing these two computations, we obtain
\[\lambda \mathbf{x}=\lambda^2 \mathbf{x}.\] Since $\mathbf{x}$ is a nonzero vector (because $\mathbf{x}$ is an eigenvector), we must have
\[\lambda=\lambda^2.\] Hence solving $\lambda(\lambda-1)=0$, the possible values for $\lambda$ is either $0$ or $1$.
Thus, the idempotent matrix $A$ only have eigenvalues $0$ or $1$.

Final Exam Problems and Solution. (Linear Algebra Math 2568 at the Ohio State University)

This problem is one of the final exam problems of Linear Algebra course at the Ohio State University (Math 2568).

The other problems can be found from the links below.

  1. Find All the Eigenvalues of 4 by 4 Matrix
  2. Find a Basis of the Eigenspace Corresponding to a Given Eigenvalue
  3. Diagonalize a 2 by 2 Matrix if Diagonalizable
  4. Find an Orthonormal Basis of the Range of a Linear Transformation
  5. The Product of Two Nonsingular Matrices is Nonsingular
  6. Determine Whether Given Subsets in ℝ4 R 4 are Subspaces or Not
  7. Find a Basis of the Vector Space of Polynomials of Degree 2 or Less Among Given Polynomials
  8. Find Values of $a , b , c$ such that the Given Matrix is Diagonalizable
  9. Idempotent Matrix and its Eigenvalues
  10. Diagonalize the 3 by 3 Matrix Whose Entries are All One
  11. Given the Characteristic Polynomial, Find the Rank of the Matrix
  12. Compute $A^{10}\mathbf{v}$ Using Eigenvalues and Eigenvectors of the Matrix $A$
  13. Determine Whether There Exists a Nonsingular Matrix Satisfying $A^4=ABA^2+2A^3$

LoadingAdd to solve later

More from my site

  • Determine Eigenvalues, Eigenvectors, Diagonalizable From a Partial Information of a MatrixDetermine Eigenvalues, Eigenvectors, Diagonalizable From a Partial Information of a Matrix Suppose the following information is known about a $3\times 3$ matrix $A$. \[A\begin{bmatrix} 1 \\ 2 \\ 1 \end{bmatrix}=6\begin{bmatrix} 1 \\ 2 \\ 1 \end{bmatrix}, \quad A\begin{bmatrix} 1 \\ -1 \\ 1 […]
  • Idempotent Matrices are DiagonalizableIdempotent Matrices are Diagonalizable Let $A$ be an $n\times n$ idempotent matrix, that is, $A^2=A$. Then prove that $A$ is diagonalizable.   We give three proofs of this problem. The first one proves that $\R^n$ is a direct sum of eigenspaces of $A$, hence $A$ is diagonalizable. The second proof proves […]
  • Unit Vectors and Idempotent MatricesUnit Vectors and Idempotent Matrices A square matrix $A$ is called idempotent if $A^2=A$. (a) Let $\mathbf{u}$ be a vector in $\R^n$ with length $1$. Define the matrix $P$ to be $P=\mathbf{u}\mathbf{u}^{\trans}$. Prove that $P$ is an idempotent matrix. (b) Suppose that $\mathbf{u}$ and $\mathbf{v}$ be […]
  • Idempotent (Projective) Matrices are DiagonalizableIdempotent (Projective) Matrices are Diagonalizable Let $A$ be an $n\times n$ idempotent complex matrix. Then prove that $A$ is diagonalizable.   Definition. An $n\times n$ matrix $A$ is said to be idempotent if $A^2=A$. It is also called projective matrix. Proof. In general, an $n \times n$ matrix $B$ is […]
  • Idempotent Matrices. 2007 University of Tokyo Entrance Exam ProblemIdempotent Matrices. 2007 University of Tokyo Entrance Exam Problem For a real number $a$, consider $2\times 2$ matrices $A, P, Q$ satisfying the following five conditions. $A=aP+(a+1)Q$ $P^2=P$ $Q^2=Q$ $PQ=O$ $QP=O$, where $O$ is the $2\times 2$ zero matrix. Then do the following problems. (a) Prove that […]
  • If $A$ is an Idempotent Matrix, then When $I-kA$ is an Idempotent Matrix?If $A$ is an Idempotent Matrix, then When $I-kA$ is an Idempotent Matrix? A square matrix $A$ is called idempotent if $A^2=A$. (a) Suppose $A$ is an $n \times n$ idempotent matrix and let $I$ be the $n\times n$ identity matrix. Prove that the matrix $I-A$ is an idempotent matrix. (b) Assume that $A$ is an $n\times n$ nonzero idempotent matrix. Then […]
  • Idempotent Linear Transformation and Direct Sum of Image and KernelIdempotent Linear Transformation and Direct Sum of Image and Kernel Let $A$ be the matrix for a linear transformation $T:\R^n \to \R^n$ with respect to the standard basis of $\R^n$. We assume that $A$ is idempotent, that is, $A^2=A$. Then prove that \[\R^n=\im(T) \oplus \ker(T).\]   Proof. To prove the equality $\R^n=\im(T) […]
  • Eigenvalues of a Hermitian Matrix are Real NumbersEigenvalues of a Hermitian Matrix are Real Numbers Show that eigenvalues of a Hermitian matrix $A$ are real numbers. (The Ohio State University Linear Algebra Exam Problem)   We give two proofs. These two proofs are essentially the same. The second proof is a bit simpler and concise compared to the first one. […]

You may also like...

7 Responses

  1. 01/04/2017

    […] Since $A$ has three distinct eigenvalues, $A$ is diagonalizable. (Or, algebraic multiplicities are the same as geometric multiplicities.) Since the matrix $A$ has $0$ as an eigenvalue. Thus $A$ is not invertible. If $A$ is idempotent matrix, then the eigenvalues of $A$ is either $0$ or $1$. Thus $A$ is not an idempotent matrix. (For a proof of this fact, see the post Eigenvalues of an idempotent matrix.) […]

  2. 05/25/2017

    […] only possible eigenvalues of an idempotent matrix are $0$ or $1$. (For a proof, see the post “Idempotent matrix and its eigenvalues“.) Let [E_0={mathbf{x}in R^n mid Amathbf{x}=mathbf{0}} text{ and } […]

  3. 08/02/2017

    […] the post ↴ Idempotent Matrix and its Eigenvalues for solutions of this […]

  4. 08/02/2017

    […] the post ↴ Idempotent Matrix and its Eigenvalues for […]

  5. 09/13/2017

    […] Idempotent Matrix and its Eigenvalues […]

  6. 09/28/2017

    […] Idempotent Matrix and its Eigenvalues […]

  7. 10/16/2017

    […] Idempotent Matrix and its Eigenvalues […]

Leave a Reply

Your email address will not be published. Required fields are marked *

More in Linear Algebra
Problems and solutions in Linear Algebra
Find All the Values of $x$ so that a Given $3\times 3$ Matrix is Singular

Find all the values of $x$ so that the following matrix $A$ is a singular matrix. \[A=\begin{bmatrix} x & x^2...

Close