Rank of a Matrix: Definition, Formula, and How to Find It

The rank of a matrix is the number of linearly independent rows or columns it contains, which indicates the dimension of the space they span. In practical terms, it shows how many independent equations exist in a given system. The rank is usually determined by converting the matrix into row-echelon form and counting the non-zero rows, or by identifying the largest square submatrix with a non-zero determinant. It is commonly denoted as rank(A) or rk(A). 

This blog explains the rank of a matrix, its definition, key properties, and importance. Learn step-by-step methods to calculate rank, with solved examples for square and rectangular matrices and its role in linear systems. 

Take your understanding of linear algebra beyond theory. Learn how matrices power real data projects with upGrad’s Data Science Certification Program. 

What Is the Rank of a Matrix? 

The rank of a matrix is defined as the maximum number of linearly independent rows or columns in the matrix. It helps describe how much unique information the matrix contains and indicates the dimension of the vector space formed by its rows or columns. 

Key points: 

• Represents the number of linearly independent rows or columns 
• Shows the dimension of the row space or column space 
• Helps determine whether rows or columns are redundant or independent 
• Commonly denoted as rank(A) or rk(A) 

Row Rank vs Column Rank 

In matrix theory, rank can be understood in two closely related ways: 

• Row rank: Number of linearly independent rows in a matrix 
• Column rank: Number of linearly independent columns in a matrix 

Important facts: 

• Row rank and column rank are always equal 
• This equality is guaranteed by a fundamental result in linear algebra known as the rank theorem 
• Because of this, the rank of a matrix can be computed using either rows or columns, depending on convenience 

Also Read: Scope of Operations Research: Levels, Applications, and Future Opportunities 

Why Is the Rank of a Matrix Important? 

The rank of a matrix is important because it reveals how much independent information a matrix contains. It helps determine the behavior of linear systems, the structure of vector spaces, and whether equations or variables are redundant. 

Role of Matrix Rank in Linear Algebra 

The rank of a matrix plays a central role in linear algebra because it describes the structural properties of a matrix and the systems it represents. It helps determine the dimension of the vector spaces associated with a matrix and explains relationships between rows and columns. 

Key theoretical roles: 

• Defines the dimension of the row space and column space 
• Indicates the number of linearly independent vectors 
• Helps analyze the solvability of systems of linear equations 
• Connects directly to core concepts such as vector spaces, basis, and dimension 

Applications of Rank of a Matrix 

The rank of a matrix is widely used across technical and computational fields to analyze and simplify complex systems. 

Key applications include: 

• Engineering systems: Used to check system controllability, stability, and redundancy in electrical and mechanical models 
• Computer science: Applied in algorithms, graph theory, image processing, and data compression 
• Data science and machine learning: Helps detect feature redundancy, reduce dimensionality, and improve model efficiency. 

“Boost your skills in linear algebra! Explore the best free online courses with certificates and start learning today.” 

Properties of the Rank of a Matrix 

The properties of the rank of a matrix help explain how rank behaves under different conditions and transformations. These rules make it easier to analyze matrices and solve linear algebra problems efficiently. 

Key Properties You Should Know 

• Rank is bounded by matrix size 
  The rank of a matrix is always less than or equal to the smaller of the number of rows or columns, i.e., 
  rank(A) ≤ min(m, n) for an m × n matrix. 
• Rank of a zero matrix 
  A zero matrix has no linearly independent rows or columns, so its rank is 0. 
• Rank of an identity matrix 
  An identity matrix of order n has n linearly independent rows and columns, giving it a rank of n. 
• Effect of elementary row operations 
  Elementary row operations (row swapping, scaling, or row addition) do not change the rank of a matrix. This property allows rank to be computed using row-reduction methods. 

How to Find Rank of a Matrix? 

Finding the rank of a matrix involves identifying the number of linearly independent rows or columns it contains. Depending on the matrix size and complexity, different methods can be used to calculate the rank efficiently. 

There are multiple standard methods used to determine the rank of a matrix. Each method is suitable for different types of matrices and problem contexts. 

Common methods include: 

1. Using elementary row operations 
2. Converting the matrix into row echelon form 
3. Finding the rank using determinants (minors) 
4. Using Gaussian elimination 

Rank of a Matrix Using Elementary Row Operations 

This is the most widely used and reliable method to find the rank of a matrix, especially for larger or rectangular matrices. 

Step-by-step approach: 

• Apply elementary row operations to simplify the matrix 
• Convert the matrix into row echelon form or reduced row echelon form 
• Identify rows that are non-zero 
• Count the number of non-zero rows; this count gives the rank of the matrix 

Key concept: 

• Elementary row operations do not change the rank of a matrix 

Rank of a Matrix Using Determinants 

This method determines the rank by examining the determinants of square submatrices, also known as minors. 

How it works: 

• Identify square submatrices within the given matrix 
• Compute their determinants 
• The rank is equal to the highest order of a non-zero minor 

Important notes: 

• Best suited for small matrices (2×2 or 3×3) 
• Becomes computationally expensive for larger matrices 
• Not practical for high-dimension or rectangular matrices 

How to Calculate Rank of a Matrix (Step-by-Step) 

The rank of a matrix can be calculated using different approaches depending on whether the matrix is square or rectangular. Determinants are commonly used for small square matrices, while row-reduction methods are preferred for larger or non-square matrices. 

H3: Rank of a Matrix for 2×2 Matrices 

For a 2×2 matrix, the rank is most easily determined using the determinant. 

Method: 

• Compute the determinant of the matrix 
• If the determinant is non-zero, the rank is 2 
• If the determinant is zero, check whether at least one row or column is non-zero 
• If yes, the rank is 1 
• If all entries are zero, the rank is 0 

• The matrix has one linearly independent row 
• Rank(A) = 1 

Rank of a Matrix for 3×3 Matrices 

For 3×3 matrices, both determinant and row-reduction methods can be applied. 

Determinant-based logic: 

• Calculate the determinant of the 3×3 matrix 
• If the determinant is non-zero, the rank is 3 
• If the determinant is zero, the rank is less than 3 and further analysis is required 

Row-reduction logic: 

• Apply elementary row operations 
• Convert the matrix into row echelon form 
• Count the number of non-zero rows to determine the rank 

Rank of a Matrix for Rectangular Matrices 

Rectangular (non-square) matrices do not have determinants, so row-reduction is the primary method used to calculate their rank. 

Method: 

• Apply elementary row operations to simplify the matrix 
• Reduce the matrix to row echelon or reduced row echelon form 
• Count the number of non-zero rows 
• The number of non-zero rows gives the rank of the matrix 

Rank(A) = 2 

Also Read: Operations Research Models: Types, Classification, Examples & Uses 

Rank of a Matrix and System of Linear Equations 

The rank of a matrix plays a key role in determining whether a system of linear equations has a solution and how many solutions are possible. This analysis is based on comparing the rank of the coefficient matrix with the rank of the augmented matrix. 

Rank and Consistency of Linear Systems 

To check whether a system of linear equations is consistent, the ranks of two matrices are compared: 

• Coefficient matrix: Matrix formed by the coefficients of the variables 
• Augmented matrix: Matrix formed by adding the constant terms as an extra column 

Conditions for consistency: 

• If rank(coefficient matrix) = rank(augmented matrix), the system is consistent 
• If rank(coefficient matrix) ≠ rank(augmented matrix), the system is inconsistent and has no solution 

Rank and Number of Solutions 

Once consistency is established, the number of solutions depends on the relationship between rank and the number of variables. 

• Unique solution 
• rank(coefficient matrix) = rank(augmented matrix) = number of variables 
• Infinite solutions 
• rank(coefficient matrix) = rank(augmented matrix) < number of variables 
• No solution 
• rank(coefficient matrix) ≠ rank(augmented matrix) 

Common Mistakes While Finding the Rank of a Matrix 

While calculating the rank of a matrix, small conceptual or procedural errors can lead to incorrect results. Being aware of common mistakes helps avoid misinterpretation and improves accuracy. 

Common mistakes include: 

• Misinterpreting zero rows 
  Counting rows that become zero after row reduction as independent rows can lead to an overestimated rank. 
• Incorrect row operations 
  Applying invalid or inconsistent elementary row operations may alter the matrix structure and produce wrong conclusions. 
• Misuse of determinants 
  Using determinant-based methods for large or rectangular matrices, or failing to check lower-order minors when the determinant is zero, can result in incorrect rank calculation. 

Conclusion 

The rank of a matrix is a fundamental concept in linear algebra that measures the number of linearly independent rows or columns in a matrix. It plays a crucial role in understanding matrix structure, solving systems of linear equations, and analyzing vector spaces.  
By using methods such as row reduction and determinants, the rank can be calculated accurately for both square and rectangular matrices. A clear understanding of matrix rank helps build a strong foundation for advanced topics in mathematics, engineering, and data science.