Inequality Regarding Ranks of Matrices

Linear Algebra exam problems and solutions at University of California, Berkeley

Problem 58

Let $A$ be an $n \times n$ matrix over a field $K$. Prove that
\[\rk(A^2)-\rk(A^3)\leq \rk(A)-\rk(A^2),\] where $\rk(B)$ denotes the rank of a matrix $B$.

(University of California, Berkeley, Qualifying Exam)

LoadingAdd to solve later

Sponsored Links


Hint.

Regard the matrix as a linear transformation $A: K^n\to K^n$.
Then consider the restrictions
$A|_{\im(A)}:\im(A) \to K^n$ and $A|_{\im(A^2)}:\im(A^2) \to K^n$.

Use the rank-nullity theorem:
If $F: V\to W$ is a linear transformation from a vector space of dimension $n$, then we have

\[ \rk(F)+\nullity(F)=n.\] Or equivalently
\[ \dim(\im(F))+\dim(\ker(F))=\dim(V).\]


Another way to prove the problem is to use the quotient spaces $AK^n/A^2K^n$ and $A^2K^n/A^3K^n$.

We will give two proofs.

Proof 1.

We identify the matrix $A$ with the linear transformation from $K^n$ to itself whose matrix representation is $A$ with a fixed basis for $K^n$.

We first restrict the linear transformation $A:K^n \to K^n$ to the image of $A$ and obtain the linear transformation
\[A|_{\im(A)}:\im(A)\to K^n.\] Note that the image of $A|_{\im(A)}$ is $\im(A^2)$.
Thus by the rank-nullity theorem we have
\[\rk(A^2)+\dim(\ker(A|_{\im(A)})=\rk(A). \tag{1}\]

Similarly, we consider the restricted linear transformation $A|_{\im(A^2)}:\im(A^2)\to K^n$.
The image of $A|_{\im(A^2)}$ is $\im(A^3)$ and by the rank-nullity theorem we have
\[\rk(A^3)+\dim(\ker(A|_{\im(A^2)})=\rk(A^2).\tag{2}\]

Since $\im(A^2) \subset \im(A)$, we have
\[\ker(A|_{\im(A^2)}) \subset \ker(A|_{\im(A)}),\] and thus
\[\dim(\ker(A|_{\im(A^2)})) \leq \dim(\ker(A|_{\im(A)})). \tag{3}\] Combining (1), (2), and (3), we obtain
\[\rk(A^2)-\rk(A^3)\leq \rk(A)-\rk(A^2),\] as required.

Proof 2.

Here is another proof that uses quotient spaces.
Consider the quotient vector space $AK^n/A^2K^n$. The dimension of this space is \[\dim(AK^n/A^2K^n)=\rk(A)-\rk(A^2).\]

Also consider the quotient vector space $A^2K^n/A^3K^n$ whose dimension is \[\dim(A^2K^n/A^3K^n)=\rk(A^2)-\rk(A^3).\] The matrix multiplication by $A$ induces a surjective homomorphism from $AK^n/A^2k^n$ to $A^2K^n/A^3K^n$.
Therefore
\[\dim(AK^n/A^2K^n) \geq \dim(A^2K^n/A^3K^n)\] and we obtain
\[\rk(A^2)-\rk(A^3)\leq \rk(A)-\rk(A^2)\]

Comment.

The second proof used the fancier word “quotient space”, hence might be terse.
But in both proofs, the essential part is the rank-nullity theorem (or homomorphism theorem).


LoadingAdd to solve later

Sponsored Links

More from my site

  • Simple Commutative Relation on MatricesSimple Commutative Relation on Matrices Let $A$ and $B$ are $n \times n$ matrices with real entries. Assume that $A+B$ is invertible. Then show that \[A(A+B)^{-1}B=B(A+B)^{-1}A.\] (University of California, Berkeley Qualifying Exam) Proof. Let $P=A+B$. Then $B=P-A$. Using these, we express the given […]
  • A Matrix Having One Positive Eigenvalue and One Negative EigenvalueA Matrix Having One Positive Eigenvalue and One Negative Eigenvalue Prove that the matrix \[A=\begin{bmatrix} 1 & 1.00001 & 1 \\ 1.00001 &1 &1.00001 \\ 1 & 1.00001 & 1 \end{bmatrix}\] has one positive eigenvalue and one negative eigenvalue. (University of California, Berkeley Qualifying Exam Problem)   Solution. Let us put […]
  • Find the Rank of the Matrix $A+I$ if Eigenvalues of $A$ are $1, 2, 3, 4, 5$Find the Rank of the Matrix $A+I$ if Eigenvalues of $A$ are $1, 2, 3, 4, 5$ Let $A$ be an $n$ by $n$ matrix with entries in complex numbers $\C$. Its only eigenvalues are $1,2,3,4,5$, possibly with multiplicities. What is the rank of the matrix $A+I_n$, where $I_n$ is the identity $n$ by $n$ matrix. (UCB-University of California, Berkeley, […]
  • A Matrix Equation of a Symmetric Matrix and the Limit of its SolutionA Matrix Equation of a Symmetric Matrix and the Limit of its Solution Let $A$ be a real symmetric $n\times n$ matrix with $0$ as a simple eigenvalue (that is, the algebraic multiplicity of the eigenvalue $0$ is $1$), and let us fix a vector $\mathbf{v}\in \R^n$. (a) Prove that for sufficiently small positive real $\epsilon$, the equation […]
  • If Column Vectors Form Orthonormal set, is Row Vectors Form Orthonormal Set?If Column Vectors Form Orthonormal set, is Row Vectors Form Orthonormal Set? Suppose that $A$ is a real $n\times n$ matrix. (a) Is it true that $A$ must commute with its transpose? (b) Suppose that the columns of $A$ (considered as vectors) form an orthonormal set. Is it true that the rows of $A$ must also form an orthonormal set? (University of […]
  • Linear Dependent/Independent Vectors of PolynomialsLinear Dependent/Independent Vectors of Polynomials Let $p_1(x), p_2(x), p_3(x), p_4(x)$ be (real) polynomials of degree at most $3$. Which (if any) of the following two conditions is sufficient for the conclusion that these polynomials are linearly dependent? (a) At $1$ each of the polynomials has the value $0$. Namely $p_i(1)=0$ […]
  • Square Root of an Upper Triangular Matrix. How Many Square Roots Exist?Square Root of an Upper Triangular Matrix. How Many Square Roots Exist? Find a square root of the matrix \[A=\begin{bmatrix} 1 & 3 & -3 \\ 0 &4 &5 \\ 0 & 0 & 9 \end{bmatrix}.\] How many square roots does this matrix have? (University of California, Berkeley Qualifying Exam)   Proof. We will find all matrices $B$ such that […]
  • Prove that the Length $\|A^n\mathbf{v}\|$ is As Small As We Like.Prove that the Length $\|A^n\mathbf{v}\|$ is As Small As We Like. Consider the matrix \[A=\begin{bmatrix} 3/2 & 2\\ -1& -3/2 \end{bmatrix} \in M_{2\times 2}(\R).\] (a) Find the eigenvalues and corresponding eigenvectors of $A$. (b) Show that for $\mathbf{v}=\begin{bmatrix} 1 \\ 0 \end{bmatrix}\in \R^2$, we can choose […]

You may also like...

Please Login to Comment.

This site uses Akismet to reduce spam. Learn how your comment data is processed.

More in Linear Algebra
Problems and solutions in Linear Algebra
Characteristic Polynomials of $AB$ and $BA$ are the Same

Let $A$ and $B$ be $n \times n$ matrices. Prove that the characteristic polynomials for the matrices $AB$ and $BA$...

Close