Rank and Nullity

Rank and Nullity are two essential concepts related to matrices in Linear Algebra. The nullity of a matrix is determined by the difference between the order and rank of the matrix. The rank of a matrix is the number of linearly independent row or column vectors of a matrix. If n is the order of the square matrix A, then the nullity of A is given by n – r. Thus, the rank of a matrix is the number of linearly independent or non-zero vectors of a matrix, whereas nullity is the number of zero vectors of a matrix.

The rank of matrix A is denoted as ρ(A), and the nullity is denoted as N(A). Evidently, if the rank of the matrix is equal to the order of the matrix, then the nullity of the matrix is zero.

Rank and Nullity Theorem for Matrix

The rank and nullity theorem for matrices is one of the important theorems in linear algebra and a requirement to derive many more results. Before discussing the theorem, we must know the concept of null spaces.

Nullspace

Let A be a real matrix of order m × n, the set of the solutions associated with the system of homogeneous equation AX = 0 is said to be the null space of A.

Nullspace of A = { x ∈ Rn | Ax = 0}. Then the nullity of A will be the dimension of the Nullspace of A.

If the rank of A is r, there are r leading variables in row-reduced echelon form of A and n – r free variables, which are solutions of the homogeneous system of equation AX = 0. Thus, n – r is the dimension of the null space of A. This fact motivates the rank and nullity theorem for matrices.

Row-reduced Echelon Form of A

Rank and Nullity

Rank and Nullity Theorem

If A is a matrix of order m × n, then

Rank of A + Nullity of A = Number of columns in A = n

Proof: We already have a result, “Let A be a matrix of order m × n, then the rank of A is equal to the number of leading columns of row-reduced echelon form of A.”

Let r be the rank of A, and then we have two cases as follows:

Case I: If A is a non-singular matrix, then r = n as the row-reduced echelon form will have no zero rows. Then, x = 0 will be the trivial solution of AX = 0; that is, the nullity of A will be zero.

Hence, rank of A + nullity of A = n + 0 = n = Number of columns in A

Case II: If A is singular, then rank of will less than the order of A, that is, r < n. Therefore, there are r non-zero or r leading columns of the row-reduced echelon form. Consequently, there will n – r zero rows, which contributes to the solution of AX = 0, which means the nullity of A is n – r.

Hence, rank of A + nullity of A = r + n – r = n = Number of columns in A.

In both cases, we get the same result which proves our claim.

Important Facts on Rank and Nullity

  • The rank of an invertible matrix is equal to the order of the matrix, and its nullity is equal to zero.
  • Rank is the number of leading column or non-zero row vectors of row-reduced echelon form of the given matrix, and the number of zero columns is the nullity.
  • The nullity of a matrix is the dimension of the null space of A, also called the kernel of A.
  • If A is an invertible matrix, then null space (A) = {0}.
  • The rank of a matrix is the number of non-zero eigenvalues of the matrix, and the number of zero eigenvalues determines the nullity of the matrix.

Related Articles

Solved Examples on Rank and Nullity

Example 1:

Verify the rank and nullity theorem for the matrix

\(\begin{array}{l}A=\begin{bmatrix}1 & 1 & 2 & 3 \\3 & 4 & -1 & 2 \\-1 & -2 & 5 & 4 \\\end{bmatrix}\end{array} \)

Solution:

Given

\(\begin{array}{l}A=\begin{bmatrix}1 & 1 & 2 & 3 \\3 & 4 & -1 & 2 \\-1 & -2 & 5 & 4 \\\end{bmatrix}\end{array} \)

Let us reduce this in row reduced echelon form

Applying R2 → R2 + (-3)R1 and R3 → R3 + R1

\(\begin{array}{l}A\sim\begin{bmatrix}1 & 1 & 2 & 3 \\0 & 1 & -7 & -7 \\0 & -1 & 7 & 7 \\\end{bmatrix}\end{array} \)

Applying R3 → R3 + R2

\(\begin{array}{l}A\sim\begin{bmatrix}1 & 1 & 2 & 3 \\0 & 1 & -7 & -7 \\0 & 0 & 0 & 0 \\\end{bmatrix}\end{array} \)

Applying C2 → C2 + C1, C3 → C3 + (-2)C1 and C4 → C4 + (-3)C1

\(\begin{array}{l}A\sim\begin{bmatrix}1 & 0 & 0 & 0 \\0 & 1 & -7 & -7 \\0 & 0 & 0 & 0 \\\end{bmatrix}\end{array} \)

Applying C3 → C3 + 7C2 and C4 → C4 + 7C2

\(\begin{array}{l}A\sim\begin{bmatrix}1 & 0 & 0 & 0 \\0 & 1 & 0 & 0 \\0 & 0 & 0 & 0 \\\end{bmatrix}\end{array} \)

Clearly, rank(A) = 2 and nullity(A) = 2

Therefore, rank(A) + nullity(2) = 2 + 2 = 4 = Number of columns.

Example 2:

Find the nullity of the matrix

\(\begin{array}{l}A=\begin{bmatrix}1 & 3 & 4 & 3 \\3 & 9 & 12 & 9 \\1 & 3 & 4 & 1 \\\end{bmatrix}\end{array} \)

Solution:

Given matrix

\(\begin{array}{l}A=\begin{bmatrix}1 & 3 & 4 & 3 \\3 & 9 & 12 & 9 \\1 & 3 & 4 & 1 \\\end{bmatrix}\end{array} \)

Applying elementary operations, R21(-3) and R31(-1)

\(\begin{array}{l}A\sim \begin{bmatrix}1 & 3 & 4 & 3 \\ 0 & 0 & 0 & 0 \\0 & 0 & 0 & -2 \\\end{bmatrix}\end{array} \)

Applying elementary operations, R3(-½)

\(\begin{array}{l}A\sim \begin{bmatrix}1 & 3 & 4 & 3 \\ 0 & 0 & 0 & 0 \\0 & 0 & 0 & 1 \\\end{bmatrix}\end{array} \)

Applying elementary operations, C24, we get

\(\begin{array}{l}A\sim \begin{bmatrix}1 & 3 & 4 & 3 \\ 0 & 1 & 0 & 0 \\0 & 0 & 0 & 0 \\\end{bmatrix}\end{array} \)

Applying elementary operations, C21(-3), C31(-4) and C41(-3) we get

\(\begin{array}{l}A\sim \begin{bmatrix}1 & 0 & 0 & 0 \\ 0 & 1 & 0 & 0 \\0 & 0 & 0 & 0 \\\end{bmatrix}\end{array} \)

Thus, Rank of matrix A = 2 and Nullity = Number of columns – rank = 4 – 2 = 2.

Frequently Asked Questions on Rank and Nullity

Q1

What is the rank of the matrix?

The number of linearly independent row or column vectors of a matrix is the rank of the matrix.

Q2

What is the nullity of the matrix?

The dimension of the nullspace or kernel of the given matrix is the nullity of the matrix.

Q3

What is the rank and nullity theorem for matrices?

For any matrix A of order m by n, rank(A) + nullity(A) = n = number of columns in A.

Q4

What is the nullity of an invertible matrix?

The nullity of an invertible matrix is zero.

Comments

Leave a Comment

Your Mobile number and Email id will not be published.

*

*

close
close

Play

&

Win