skip to content

Proof of Sylvester's Rank Inequality

/ 2 min read

Table of Contents

rank(AB)rank(A)+rank(B)n\operatorname{rank}(AB) \ge \operatorname{rank}(A) + \operatorname{rank}(B) - n

Where A:s×nB:n×mA: s \times n \quad B:n\times m

I. Using Block Matrices

[In0AIs][InBA0][InB0Im]=[In00AB]\begin{bmatrix} I_n & 0 \\ -A & I_{s} \end{bmatrix}\begin{bmatrix} I_n & B \\ A & 0 \end{bmatrix} \begin{bmatrix} I_n & -B \\ 0 & I_m \end{bmatrix} = \begin{bmatrix} I_n & 0 \\ 0 & -AB \end{bmatrix}

Therefore:

r(A)+r(B)r[InBA0]=r[In00AB]=n+r(AB)=n+r(AB)r(A) + r(B) \le r\begin{bmatrix} I_n & B \\ A & 0 \end{bmatrix} = r\begin{bmatrix} I_n & 0 \\ 0 & -AB \end{bmatrix} = n + r(-AB) = n + r(AB)

A similar approach can be used to prove a stronger conclusion (Frobenius Rank Inequality): r(AB)+r(BC)r(ABC)+r(B)r(AB) + r(BC) \le r(ABC) + r(B)

Proof:

r(ABC)+r(BC)=r[0BABC0]=r[BCBABC0]=r[BCB0AB]r(AB)+r(BC)r(ABC) + r(BC) = r\begin{bmatrix} 0 & B \\ ABC & 0 \end{bmatrix} = r\begin{bmatrix} -BC & B \\ ABC & 0 \end{bmatrix} = r\begin{bmatrix} -BC & B \\ 0 & AB \end{bmatrix} \ge r(AB) + r(BC)

By setting BC=InBC = I_n​, the original conclusion can be derived.

II. Using Equivalent Normal Form (Rank Normal Form)

Suppose there exist invertible matrices P and Q such that: PAQ=[Ir000]PAQ = \begin{bmatrix} I_r & 0 \\ 0 & 0 \end{bmatrix}

Where r=r(A)r = r(A).

Let:

Q1B=[B1B0]Q^{-1}B = \begin{bmatrix} B_1 \\ B_0 \end{bmatrix}

Where B1B_1​ is a matrix with r(A)r(A) rows.

Thus:

r(AB)=r(PAQQ1B)=r([Ir000][B1B0])=r[B10]r(AB) = r(PAQ Q^{-1}B) = r\left( \begin{bmatrix} I_r & 0 \\ 0 & 0 \end{bmatrix} \begin{bmatrix} B_1 \\ B_0 \end{bmatrix} \right) = r\begin{bmatrix} B_1 \\ 0 \end{bmatrix}

Since:

r[B10]+nr(A)r[B1B0]=r(Q1B)=r(B)r\begin{bmatrix} B_1 \\ 0 \end{bmatrix} + n - r(A) \ge r\begin{bmatrix} B_1 \\ B_0 \end{bmatrix} = r(Q^{-1}B) = r(B)

Therefore:

r(AB)+nr(A)r(B)r(AB) + n - r(A) \ge r(B)

III. Perspective of Linear Mappings

Consider A:RnRsB:RmRnA: R^n \to R^s\quad B: R^m \to R^n

By the Rank-Nullity Theorem: dimN(A)+dimR(A)=n,r(A)=dimR(A)\dim N(A) + \dim R(A) = n,\quad r(A) = \dim R(A)

To prove the conclusion:

r(AB)r(A)+r(B)nr(AB) \ge r(A) + r(B) - n

Which is equivalent to:

r(AB)nr(A)n+r(B)nr(AB) - n \ge r(A) - n + r(B) - n

This is equivalent to:

dimN(AB)dimN(B)+dimN(A)\dim N(AB) \le \dim N(B) + \dim N(A)

We know that:

N(AB)={xRmBxN(A)}N(AB) = \{ x \in \mathbb{R}^m \mid Bx \in N(A) \}

Thus:

dimN(AB)=dimN(B)+dim(R(B)N(A))dimN(B)+dimN(A)\dim N(AB) = \dim N(B) + \dim(R(B) \cap N(A)) \le \dim N(B) + \dim N(A)

Thus, the original proposition is proven.