logo

Fundamental Spaces of Matrices 📂Matrix Algebra

Fundamental Spaces of Matrices

Explanation1

Let’s assume that the matrix AA is given. Then, we can think of the following 6 spaces for AA.

Row space of AA, Row space of ATA^{T}

Column space of AA, Column space of ATA^{T}

Null space of AA, Null space of ATA^{T}

However, since the row vectors of AA are the column vectors of ATA^{T}, and the column vectors of AA are the row vectors of ATA^{T}, the row space of AA and the column space of ATA^{T} are the same. For the same reason, the column space of AA and the row space of ATA^{T} are the same, which allows us to think of the following 4 matrices.

Row space of AA, Column space of AA

Null space of AA, Null space of ATA^{T}

These 4 spaces are collectively called the fundamental spaces of matrix AA.

Theorem 1

For an arbitrary matrix AA,

rank(A)=rank(AT) \rank(A) = \rank(A^{T})

Proof

Since the row space of AA and the column space of ATA^{T} are the same, by the definition of rank,

rank(A)=dim(R(A))=dim(C(AT))=rank(AT) \rank(A) = \dim(\mathcal{R}(A)) = \dim(\mathcal{C}(A^{T})) = \rank(A^{T})

Theorem 2

Let AA be a matrix m×nm \times n.

(a) The null space of AA and the row space of AA are orthogonal complements of each other in Rn\mathbb{R}^{n}.

N(A)R(A)=Rn \mathcal{N}(A) \oplus \mathcal{R}(A) = \mathbb{R}^{n}

(b) The null space of ATA^{T} and the column space of AA are orthogonal complements of each other in Rm\mathbb{R}^{m}.

N(AT)C(A)=Rm \mathcal{N}(A^{T}) \oplus \mathcal{C}(A) = \mathbb{R}^{m}

Proof

Strategy: Use definitions to deduce directly. Only the proof for (a) is presented. The proof for (b) is essentially the same.


First, let’s show that N(A)=R(A)\mathcal{N} (A) = \mathcal{R} (A)^{\perp}. If we say xN(A)\mathbf{x} \in \mathcal{N} (A), by the definition of null space, it is as follows.

Ax=0 A \mathbf{x} = \mathbf{0}

Taking the dot product with yRn\mathbf{y} \in \mathbb{R}^{n}, it is as follows.

yT(Ax)=0 \mathbf{y}^{T} ( A \mathbf{x} ) = \mathbf{0}

By the associative law of matrix multiplication, (yTA)x=0( \mathbf{y}^{T} A ) \mathbf{x} = \mathbf{0}, and by the property of transpose matrices, (ATy)Tx=0( A^{T} \mathbf{y} ) ^{T} \mathbf{x} = \mathbf{0}, thus, by the definition of orthogonality, it is as follows.

ATyx A^{T} \mathbf{y} \perp \mathbf{x}

Then, by the definition of orthogonal complement, it is as follows.

xR(A) \mathbf{x} \in \mathcal{R} (A)^{\perp}

Summarizing this content, xN(A)    xR(A)\mathbf{x} \in \mathcal{N} (A)\implies \mathbf{x} \in \mathcal{R} (A)^{\perp}, so we get the following result.

N(A)R(A) \mathcal{N} (A) \subset \mathcal{R} (A)^{\perp}

Repeating this process in reverse, we can obtain N(A)R(A)\mathcal{N} (A) \supset \mathcal{R} (A)^{\perp}, so we get the following result.

N(A)=R(A) \mathcal{N} (A) = \mathcal{R} (A)^{\perp}

Taking ^{\perp}, it is as follows.

N(A)=R(A) \mathcal{N} (A)^{\perp} = \mathcal{R} (A)

Since both are subspaces of Rn\mathbb{R}^{n}, we obtain the following.

N(A)R(A)=Rn \mathcal{N}(A) \oplus \mathcal{R}(A) = \mathbb{R}^{n}


  1. Howard Anton, Elementary Linear Algebra: Aplications Version (12th Edition, 2019), p261-263 ↩︎