Rank-Nullity Theorem Proof

Statement: Let U and V be vector spaces over the field F and let T be a Linear Transformation (L.T.) from U into V. Suppose that U is finite-dimensional. Then, rank (T) + nullity (T) = dim U.

Proof:

Let N be a null space of T, then N is a subspace of U. Since U is finite-dimensional. Therefore, N is finite-dimensional.

Let dim N = nullity(T) = K and let {α1, α2,….., αk} be a basis for N

∵ {α1, α2,….., αk} is a linearly independent subset of U

∴ We can extend it to form a basis of U

Let dim U = n and let {α1, α2,….., αk, αk+1, αk+2,……, αn} be a basis of U

Vectors T(α1),…., T(αk), T(αk+1), T(αk+2),……., T(αn) are in the range of T

We shall show that {T(αk+1), T(αk+2),…., T(αn)} is a basis for the range of T

(I) First, we shall prove that the vectors T(αk+1), T(αk+2),….., T(αn) span the range of T

Let β ∈ range of T, then ∃ α ∈ U such that T(α) = β

Now α ∈ U ⇒ ∃ a1, a2,……, an ∈ F such that

α = a1α1 + a2α2+……+ anαn

⇒ T(α) = T(a1α1+a2α2+……+anαn)

⇒ T(α) = T(a1α1+a2α2+……+akαk+ak+1αk+1+……+anαn)

⇒ β = a1 T(α1)+……+ak T(αk)+ ak+1 T(αk+1)+……+ an T(αn)

⇒ β = ak+1 T(αk+1) + ak+2 T(αk+2) +…..+ an T(αn)

[∵ α1, α2,….., αk ∈ N ⇒ T(α1) = 0,…., T(αk) = 0]

∴ the vectors T(αk+1), T(αk+2),……, T(αn) span the range of T.

(II) Now we shall show that the vectors T(αk+1), T(αk+2),……, T(αn) are L.I.

Let ck+1, ck+2,…, cn ∈ F such that

ck+1T(αk+1) + ck+2T(αk+2) +…..+ cnT(αn) = 0

⇒ T(ck+1αk+1 + ck+2αk+2 +……+ cnαn) = 0

⇒ ck+1αk+1, ck+2αk+2,….., cnαn ∈ null space of T, i.e., N

⇒ ck+1αk+1 + ck+2αk+2 +…….+ cnαn = b1α1 + b2α2 +…+ bkαk

for some b1,b2,….., bk ∈ F.

[∵ Each vector in N can be expressed as a linear combination of the vectors α1,……, αn forming a basis of N]

⇒ b1α1 + b2α2 +…..+ bkαk – ck+1αk+1 – ck+2αk+2 -…….- cnαn = 0

⇒ b1 = b2 = …… = bk = ck+1 = ck+2 = ……. = cn = 0

[∵ α1, α2,…., αk, αk+1,……, αn are linearly independent being basis of U]

⇒ Vectors T(αk+1), T(αk+2),….., T(αn) are linearly independent.

∴ vectors T(αk+1), T(αk+2), …., T(αn) form a basis of the range of a T.

∴ Rank T = Dim range of T = n – k

Hence proved

Rank and Nullity

Rank and Nullity are essential concepts in linear algebra, particularly in the context of matrices and linear transformations. They help describe the number of linearly independent vectors and the dimension of the kernel of a linear mapping.

In this article, we will learn what Rank and Nullity, the Rank-Nullity Theorem, and their applications, advantages, and limitations.

Table of Content

  • What is Rank and Nullity?
  • Calculating Rank and Nullity
  • Rank-Nullity Theorem
  • Rank-Nullity Theorem Proof
  • Advantages of Rank and Nullity
  • Application of Rank and Nullity
  • Limitations of Rank and Nullity

Similar Reads

What is Rank and Nullity?

Rank of a Matrix is defined as the number of linearly independent row or column vectors of a matrix. It represents the number of non-zero eigenvalues of the matrix. The rank of a matrix is denoted as ρ(A)....

Calculating Rank and Nullity

The rank and nullity of a matrix can be calculated using the following steps:...

Rank-Nullity Theorem

Rank-Nullity Theorem is a theorem in linear algebra that states that for a matrix M with x rows and y columns over a field, the rank of M and the nullity (the dimension of the kernel) of M sum to y....

Rank-Nullity Theorem Proof

Statement: Let U and V be vector spaces over the field F and let T be a Linear Transformation (L.T.) from U into V. Suppose that U is finite-dimensional. Then, rank (T) + nullity (T) = dim U....

Advantages of Rank and Nullity

Aadvantages of understanding the rank and nullity of a matrix in linear algebra include:...

Application of Rank and Nullity

The rank and nullity of a matrix have various applications in linear algebra, including:...

Limitations of Rank and Nullity

While the rank and nullity of a matrix have numerous applications in linear algebra, there are some limitations to these concepts:...

Examples on Rank and Nullity

Some examples on rank and nullity are,...

Frequently Asked Questions on Rank and Nullity

What is the Rank of a Matrix?...

Contact Us