Rank of Matrix
The rank of a matrix is a core concept in linear algebra, particularly in engineering mathematics. It serves as a measure of the non-degeneracy of a system of linear equations. Understanding how to calculate the rank of a matrix is crucial for solving various mathematical problems, including those involving systems of linear equations, transformations, and vector spaces.
In this blog, we will explore what the rank of a matrix is, how to find the rank of a matrix, particularly by using the echelon form, and work through some rank of matrix questions with solutions.
1.0What is the Rank of a Matrix?
The rank of a matrix is the maximum number of linearly independent(L.I) row vectors or column vectors within the matrix. It indicates the dimension of the vector space spanned by its rows or columns. In simple terms, the rank gives the number of independent equations in a system of linear equations represented by the matrix.
The matrix A is said to be of rank r, if
- There is at least one minor of A of order r which does not vanish.
- Every minor of A of order (r + 1) or higher vanishes.
Rank = Number of non-zero row in upper triangular matrix.
In brief, the rank of a matrix is determined by the largest order of any non-zero minor within the matrix.
From the above definition of the rank of a matrix we have the following two useful results-
- If a matrix has a non- zero minor of order r, its rank is ≥ r.
- If all minors of a matrix of order r + 1 are zero, its rank is ≤ r.
The rank of a matrix A shall be denoted by ρ(A). Here
The rank of a matrix A is denoted by ρ(A). The symbol ρ is a Greek letter pronounced as "rho," so ρ(A) should be read as "rho of A" or "rank of A."
2.0Why is the Rank of a Matrix Important?
In engineering mathematics, the rank of a matrix helps in determining:
- Whether a system of linear equations has a unique solution, infinitely many solutions, or no solution at all.
- The invertibility of a matrix (a square matrix is invertible if and only if its rank is equal to its size).
- The dimension of the image of a linear transformation represented by the matrix.
3.0How to Calculate the Rank of a Matrix?
The rank of a matrix can be determined using three different methods. Among these, the simplest method is converting the matrix into echelon form. The three methods are:
- Minor Method
- Echelon Form Method
- Normal Form Method
1. Minor Method:
Here are the steps to determine the rank of a matrix A using the minor method:
- Calculate the Determinant: If A is a square matrix, first find its determinant. If det(A) ≠ 0, then the rank of A is equal to the order of the matrix.
- Check Minors: If det(A) = 0 (in the case of a square matrix) or if A is a rectangular matrix, look for a non-zero minor of the largest possible order. If such a non-zero minor exists, the rank of A is equal to the order of that minor.
- Reduce and Repeat: If all minors of the largest possible order are zero, reduce the order by one and repeat the process. Continue this until you find a non-zero minor, and the rank of A will be the order of that minor.
2. Echelon Form Method:
A matrix A = (aij)mn is said to be in Echelon form, If
- Every row of A which has all its entries 0 occurs below every row which has a non-zero entry.
- The number zero preceding the first non-zero element in a row is less than that the number of such zeroes in the succeeding (or next) row.
- The first non-zero element in every row is unity.
The echelon form of a matrix is a form where the matrix has been simplified to a step-like structure, which makes it easier to identify the number of linearly independent rows. To find the rank of a matrix by echelon form, follow these steps:
- Transform the matrix into echelon form: This involves using elementary row operations (such as row swapping, scaling rows, and adding/subtracting multiples of rows) to simplify the matrix into a form where each leading entry (the first non-zero number from the left in a row) is 1 and is to the right of the leading entry in the previous row.
- Count the number of non-zero rows: The count of non-zero rows in the echelon form gives the rank of the matrix.
When a matrix is converted in Echelon form, then the number of non-zero rows of the matrix is known as the rank of the matrix A.
For example, is in the echelon matrix.
3. Normal form Method:
Every non-zero matrix [say A = (aij)mn] of rank r, by a sequence of elementary transformations can be reduced to the form.
Where I, is a r × r unit matrix of order r and 0 represented null matrix of any order.
These forms are said to be the normal form of canonical form of the given matrix A.
4.0Applications of Rank in Engineering Mathematics
The concept of rank is not only theoretical but also has practical applications in various fields, including:
- Control Systems: In control theory, the rank of a matrix helps in determining the controllability and observability of a system.
- Signal Processing: The rank of matrices is used in algorithms for noise reduction and data compression.
- Finite Element Analysis: In structural engineering, the rank of matrices is used to analyze the stiffness and stability of structures.
5.0Solved Example of Rank of a Matrix
Example 1: Given the matrix
Solution:
Transform the matrix into echelon form.
Perform row operations to simplify the matrix:
2R2 – R1 and 3R3 – R2
This resuts in:
Count the number of non-zero rows.
In this case, there is 1 non-zero row. Therefore, the rank of the matrix A is 1.
Example 2: Find the Rank of the Following
Solution:
Transform the matrix into echelon form by performing elementary row operations.
Count the non-zero rows.
Here, there are 2 non-zero rows, so the rank of the matrix is 2.
Example 3: Obtain the Echelon Form Method Matrix: and find its matrix.
Solution:
- Convert the matrix to row echelon form using elementary row operations.
R2 = R2 –2R1
- Identify the number of non-zero rows. Here, there are two non-zero rows.
The rank of the matrix A is 2.
Example 4: Using the Minor Method , find rank of matrix B.
Solution:
- Calculate the determinant of B:
det(B) = 1(5 9 – 6 × 8) – 2(4× 9 –6 × 7) + 3(4 × 8 – 5 × 7)
det(B) = 1(45 – 48) – 2(36 –42) + 3(32 – 35)
det(B) = –3 + 12 –9
det(B) = 0
Since det(B) = 0, the matrix is not of full rank. The rank is less than 3.
- Check the minors of order 2 (i.e., 2 × 2 submatrices). Let's check the minor formed by the first two rows and the first two columns:
Calculate the determinant of M:
det(M) = 1 × 5 – 2 × 4
= 5 –8
= –3
Since this minor is non-zero, the rank of the matrix B is 2.
The rank of the matrix B is 2.
Example 5: Using the Normal Form Method Matrix: , find rank of matrix C.
Solution:
- Perform row operations to convert C into its normal form.
Swap Row 1 and Row 2 to bring a 1 to the pivot position:
R2 = R2 + 2R1, R3 = R3 –3R1
- Count the number of non-zero rows. There are three non-zero rows.
The rank of the matrix C is 3.
6.0Practice Questions on Rank of a Matrix
- Using Echelon Form Method find the rank of the following matrix A:
- Using Minor Method determine the rank of the matrix B using the minor method:
- Using Normal Form Method find the rank of the matrix C using the normal form method:
- Find the rank of the matrix D where
- Determine the rank of the square matrix E:
Table of Contents
- 1.0What is the Rank of a Matrix?
- 2.0Why is the Rank of a Matrix Important?
- 3.0How to Calculate the Rank of a Matrix?
- 4.0Applications of Rank in Engineering Mathematics
- 5.0Solved Example of Rank of a Matrix
- 6.0Practice Questions on Rank of a Matrix
Frequently Asked Questions
The rank of a matrix is the greatest number of linearly independent(L.I) rows or columns it contains. It reflects the dimension of the vector space formed by these rows or columns.
The rank of a matrix can be determined using several methods, including: Echelon Form Method: Convert the matrix into row echelon form or reduced row echelon form and count the number of non-zero rows. Minor Method: Identify the largest non-zero minor in the matrix. Normal Form Method: Use elementary row operations to reduce the matrix to its normal form.
The rank of a matrix provides information about the linear independence of the rows or columns, the solution of linear equations, and the dimensionality of the matrix's vector space. It also helps determine if a system of linear equations has a unique solution, infinite solutions, or no solution.
The maximum rank a matrix can have is equal to the smaller of its number of rows or columns. For an m × n matrix, the rank is at most min (m, n).
The rank of a matrix measures the number of linearly independent rows or columns, while the determinant is a scalar value that can only be computed for square matrices. The determinant can indicate whether a square matrix is invertible (if the determinant is non-zero, the matrix is of full rank).
Yes, the rank of a matrix can be zero if and only if the matrix is a zero matrix (i.e., all its elements are zero).
If the rank of a matrix equals the number of rows (or columns), it means that all rows (or columns) are linearly independent, and the matrix is of full rank. In this case, the matrix has no redundant rows or columns.
If a matrix has more columns than rows, its rank is at most the number of rows. This is because the rank is limited by the number of linearly independent rows or columns, and a matrix cannot have more independent rows than the number of rows it has.
Join ALLEN!
(Session 2025 - 26)