Matrix Rank

Matrix rank and invertibility are two of the most important structural ideas in linear algebra. Rank tells you how much “independent information” a matrix carries, and it controls whether systems of equations have solutions, whether transformations are injective or surjective, and whether a matrix can be inverted. If you are comfortable with these two concepts, a large portion of linear algebra falls into place.

Contents

Definition

The rank of a matrix is the maximum number of linearly independent rows or columns in a matrix. It essentially determines the dimensionality of the vector space formed by the rows or columns of the matrix, i.e. the unique information the matrix contains.

Who

Matrix rank appears in many professions as a practical measure of “how much independent information or capability is really present.” Below are the most common ways it is used, grouped by field.

Data Science, Machine Learning & AI

Dimensionality reduction (PCA, SVD): Rank tells you the true number of independent features. You keep only the top singular values and discard the rest, compressing data while preserving most of the signal.
Recommendation systems: User–item rating matrices are usually low-rank. Algorithms exploit this to predict missing ratings (i.e., the classic Netflix problem).
Matrix completion & robust PCA: Separate a low-rank background from sparse foreground (e.g., removing moving objects from video, or cleaning corrupted data).
Multicollinearity detection: In regression, the rank of the design matrix reveals whether features are linearly dependent; a drop in rank signals redundant predictors.
AI & Machine Learning: Neural networks process massive datasets using matrices. Weights, biases, and input data are stored in matrices (often called tensors), and training an AI model involves billions of matrix multiplications.

Engineering & Control Systems

Controllability and observability: The rank of the controllability matrix tells an engineer whether a system can be driven to any desired state with the available inputs. The same idea applies to observability (i.e., Can you reconstruct the full state from sensor measurements?).
Structural analysis: Rank of incidence or stiffness matrices indicates whether a truss or circuit is rigid / uniquely determined.

Computer Vision & Graphics

Camera geometry: The rank of the fundamental or essential matrix (always 2) encodes the geometric relationship between two views; algorithms enforce this rank constraint to recover 3-D structure.
Structure-from-motion and SLAM: Low-rank approximations help recover camera poses and 3-D points from many images.
Computer Graphics & Gaming: Every 3D video game uses matrices to handle rotations, scaling, and translations of characters and environments. When a camera angle moves, a matrix multiplication repositions every vertex in the digital world.
Image Processing: Digital images are literally matrices of pixels. Applying filters (like blurring or sharpening), compressing files (like JPEGs), and performing facial recognition all rely on matrix operations.

Statistics & Experimental Design

Data Science & Statistics: Matrices organize tables of user data (like rows of customers and columns of purchasing habits). Algorithms use this to spot trends and run predictive analytics.
Rank of the design matrix determines the degrees of freedom and whether a linear model is identifiable. A deficient rank means some parameters cannot be uniquely estimated.

Finance & Economics

Portfolio risk and factor models: Covariance or return matrices are often low-rank; the rank (or effective rank) indicates how many independent risk factors actually drive the market.
Input–output models: Rank conditions guarantee that production systems have unique solutions.
Economics: The Leontief input-output model (developed by Russian-American economist Wassily Leontief, who was awarded the Nobel Prize in Economic Sciences in 1973) uses matrices to track how different industries in an economy depend on each other for raw materials and products.

Signal Processing & Communications

Source separation and array processing: The rank of a data covariance matrix reveals the number of independent signal sources (e.g., how many speakers or radio emitters are present).
Channel estimation: Rank constraints improve recovery of wireless channel matrices.
Cryptography: Secure data transmission relies on matrix cryptography. Text is converted into numbers, multiplied by a secret “encoding matrix,” and can only be read if the receiver has the matching “decoding matrix.”

Network Science & Operations Research

Rank of adjacency or incidence matrices relates to connectivity, number of independent cycles, and solvability of flow problems.

What

What Is the Rank of a Matrix?

The rank of a matrix is the maximum number of linearly independent rows or columns in a matrix. It essentially determines the dimensionality of the vector space formed by the rows or columns of the matrix, i.e. the unique information the matrix contains.

Think of a matrix as a machine or a set of instructions made up of columns (or rows). Each column is a vector pointing in some direction.

If every column points in a completely new direction that cannot be replicated by combining the other columns, then every column is useful. The rank is equal to the total number of columns.
If one column is just a duplicate, a scaled-up version (like multiplying by 2), or a combination of other columns, it does not add any new geometric dimension or fresh information. It is redundant. You subtract it from your count, which lowers the rank.

We can picture the rank of a matrix in three ways.

As Independent Directions (Vectors): The rank is the maximum number of column vectors (or row vectors) that are linearly independent—meaning no single vector can be written as a mix of the others.
As Preserved Space (Transformation): If a matrix acts as a transformation on 3D space, a rank of 3 means it keeps the space 3D. A rank of 2 means it squashes the 3D space flat into a 2D plane (like a shadow). A rank of 1 squashes it onto a 1D line, and a rank of 0 squashes everything down to a single point.
As Non-Redundant Data: If you have a table of measurements where two columns of data are exact duplicates or strict multiples of each other, that extra column gives you zero new facts. The rank counts only the non-redundant variables.

Properties of the Matrix Rank

We will list some important properties and implications of the rank, assuming that the matrix is a matrix.

The rank of a m × n matrix is an integer and cannot be greater than either m or n. Formally, we can write: rank(A) ≤ min(m, n).
If the rank of the matrix is equal to min(m, n), then we say that the matrix has a full rank.
A square matrix A is invertible if and only if it has a full rank.
A matrix A and its transpose have the same rank, i.e., rank(A) = rank(A^T).
Furthermore, a matrix A multiplied by its transpose has the same rank as the matrix A itself. This leads to the following equalities:

rank(A^TA) = rank(AA^T) = rank(A) = rank(A^T)

What is an Intuitive Explanation of the Rank of a Matrix?

A matrix is a collection of vectors. You can intuitively imagine a vector as a point in space. If you want, you can draw a line from the origin to that point, and put a little arrow on the tip.

Normally, we imagine vectors in 2 or 3 dimensions:

Above, you see the vector [7, 3, 5]. Intuitively, you can imagine an arrow that goes from the origin to the point that’s 7 units in the x direction, then 3 units in the y direction, and 5 units in the z direction.

Now imagine just two of these 3D vectors. You can imagine adding these vectors by taking the tip of one, and using it as the origin of the other. That would give you some new vector.

Above, we added the original vector [7, 3, 5] (now purple) [-2, -1, 5] (blue), and got [5, 2, 10] (red).

You may notice that the new vector lies in the plane of the original two. It’s no coincidence. If we scale the original vectors by some constant, we could shorten or increase their lengths. We could even scale them by a negative amount, and point them in the opposite direction. However, they’d still point in the same directions. When you add them, they’d still pick some new point on that same plane.

Above, I scaled the original vector [7, 3, 5] by 1/2, resulting in [3.5, 1.5, 2.5]. Though the new vector after addition is a different point [1.5, 0.5, 7.5], it still lies in the same plane.

Now, imagine you took all possible combinations of the two vectors. The set of all possible points you could reach by scaling and adding these two vectors (including zero of each) is the entire plane that passes through the two vectors and the origin.

When we do this, we are imagining the space that the vectors “span”. In this case, it’s a plane. Imagine the two vectors we started with were actually pointed in the same direction.

[7, 3, 5] and [-3.5, -1.5, -2.5] are two distinct vectors, but they point in the same direction. No amount of combining these two would ever escape the line they both lie on. Thus, the space “spanned” by the two vectors is a single line, rather than a plane.

In each case, we had two vectors, but the number of independent directions made the difference between spanning a plane vs a line. The “rank” of a matrix is the dimension of that space spanned by the vectors it contains.

If we put the two vectors [7, 3, 5] and [-2, -1, 5] into a matrix:

\left[ \begin{array}{l} 7& \hspace{0.25cm} -2\\ 3& \hspace{0.25cm} -1\\ 5& \hspace{0.25cm} -5\\ \end{array} \right]

the rank of the matrix is the dimension of the space that you get by taking all combinations of the vectors. We’ve already done that, and saw that the space spanned by [7, 3, 5] and [-2, -1, 5] was a plane. In this case, the rank is 2 (because a plane is 2 dimensional).

Let’s put the two vectors [7, 3, 5] and [-3.5, -1.5, -2.5] into a matrix:

\left[ \begin{array}{l} 7& \hspace{0.25cm} -3.5\\ 3& \hspace{0.25cm} -1.5\\ 5& \hspace{0.25cm} -2.5\\ \end{array} \right]

As we already saw, these two vectors span a line. The rank of this matrix would be the same idea: it’s the dimension of the space you get by taking all combinations of the vectors. In this case, that space is just a line, so the rank is 1 (because a line is 1 dimensional).

The same idea applies in higher dimensions. It just gets harder to visualize intuitively. However, even in arbitrarily high dimensions, the rank of the matrix is the dimension of the space spanned by the vectors that make up the matrix.

[ ℰ ] Salvatore, John. “What is an intuitive explanation of the rank of a matrix?” Quora, 2015. https://qr.ae/pFJVcH.

Why

Matrices are used in many fields because they provide a powerful, unified mathematical language to organize, compress, and manipulate large amounts of data simultaneously. Instead of solving complex problems one piece at a time, matrices allow computers and researchers to treat thousands of variables as a single object, vastly speeding up calculations.

See Theoretical Knowledge Vs Practical Application.

How

Three methods can be used to get the rank of any given matrix. These methods are as follows:

Minor Method
Using Elementary Operations
- Row Echelon Form
- Normal Form

Many of the References and Additional Reading websites and Videos will assist you with understanding and applying matrix rank.

As some professors say: “It is intuitively obvious to even the most casual observer.“

References

[ ℰ ] “Matrix Rank and Inverse Operations, MATH 415 – Study Notes – on Fabric.” fabric.so, Accessed September 30, 2026. https://fabric.so/p/matrix-rank-and-inverse-operations-math-415-study-notes-67J9BJYTgAgZbQTOLrfqXf?expandedFdocId=483a9b56-cfeb-422b-bc5b-34ba921c4f33.

Gould, William. “Understanding Matrices Intuitively, Part 1.” The Stata Blog, March 3, 2011. https://blog.stata.com/2011/03/03/understanding-matrices-intuitively-part-1/.

“Rank of a Matrix.” GeeksforGeeks, September 13, 2023. https://www.geeksforgeeks.org/maths/rank-of-matrix/.

[ ℰ ] [#] “Methods to Find Rank of a Matrix.” GeeksforGeeks, May 2, 2024. https://www.geeksforgeeks.org/maths/methods-to-find-rank-of-a-matrix/.

Eijkelboom, Floor and Tin Hadži Veljković. “Rank of a Matrix.” Math4AI. Accessed October 1, 2026. https://www.math4.ai/docs/essentials/rank_of_matrix.html.

“Rank of a Matrix – Definition.” CUEMATH. Accessed October 1, 2026. https://www.cuemath.com/algebra/rank-of-a-matrix/.

“Rank of Matrix.” BYJU’s, March 23, 2022. https://byjus.com/maths/rank-of-matrix/.

Margalit, Dan and Joseph Rabinoff. “The Invertible Matrix Theorem.” gatech.edu. Accessed October 1, 2026. https://textbooks.math.gatech.edu/ila/invertible-matrix-thm.html.

“Invertible Matrix – Theorems, Properties, Definition, Examples.” CUEMATH. Accessed October 1, 2026. https://www.cuemath.com/algebra/invertible-matrix/.

Austin, David. Understanding Linear Algebra. n.d. Accessed October 1, 2026. https://understandinglinearalgebra.org/sec-matrix-inverse.html.

“Inverses and Powers: Rules of Matrix Arithmetic.” University of Manitoba. Accessed October 1, 2026. https://linearalgebra.math.umanitoba.ca/math1220/section-21.html.

Additional Reading

Garza, Taylor. “How do I understand the basics of matrices?” Quora, 2024. https://qr.ae/pFJViZ.

dhalla, adam. “Linear Algebra 6: Rank, Basis, Dimension.” Medium, January 25, 2021. https://adamdhalla.medium.com/linear-algebra-6-rank-basis-dimension-282f34a71209.

“Rank (Matrix) — Definition, Formula & Examples.” Mathwords. Accessed October 1, 2026. https://www.mathwords.com/r/rank.htm.

Hussein, Jamal. “How to Find the Rank of a Matrix (with Examples).” mlforbeginners.com, November 29, 2025. https://mlforbeginners.com/rank-of-a-matrix/.

Nicholson, W. Keith. “5.4: Rank of a Matrix.” LibreTexts, March 5, 2021. https://math.libretexts.org/Bookshelves/Linear_Algebra/Linear_Algebra_with_Applications_(Nicholson)/05%3A_Vector_Space_R/5.04%3A_Rank_of_a_Matrix.

“Rank of Matrix by Minor Method.” onlinemath4all. Accessed October 1, 2026. https://www.onlinemath4all.com/rank-of-matrix-by-minor-method.html.

“Row Echelon Form & Reduced Row Echelon Form.” Statistics How To, January 29, 2021. https://www.statisticshowto.com/matrices-and-matrix-algebra/reduced-row-echelon-form/.

Videos

How to Find the Rank of a Matrix (with echelon form) | Linear Algebra

The rank of a matrix is the number of linearly independent rows or the number of linearly independent columns the matrix has. These definitions are equivalent. To find this number, we can reduce a matrix to row echelon form and count the nonzero rows, whose leading entries are called pivot numbers. We’ll solve five rank of a matrix examples in this lesson.

Linear Algebra – Lecture 32: The Rank of a Matrix

We introduce the rank of a matrix, which is the dimension of its range. Intuitively, the rank of a matrix measures the amount of non-degeneracy of the matrix, or the number of dimensions that the matrix does not squish away.

Textbook: https://njohnston.ca/publications/introduction-to-linear-and-matrix-algebra/
Blank course notes (lectures 30-33): http://www.njohnston.ca/la_week8.pdf
Annotated course notes (lectures 30-33): https://www.njohnston.ca/la_week8_annotated.pdf

Rank of a Matrix Explained Visually for Beginners

Have you ever struggled to grasp the true meaning behind linear algebra concepts, or wondered how to find the rank of a matrix without just memorizing formulas? This visually animated guide is designed to help you calculate rank of matrix equations while understanding the deep physical and geometric intuition behind it. We break down the rank of a matrix explained through clean animations, making it perfect for engineering students, data scientists, and anyone curious about how we measure information in high-dimensional spaces.

When we look at a large dataset, we often face an information illusion where the physical size of our grid does not match the actual substance of our data. By mastering the rank echelon form and learning how to find rank of the matrix, you can easily determine if your equations contain redundant information or if they span the full dimensional space. This mathematical concept is the backbone of modern data compression, singular value decomposition, and dimensionality reduction techniques used in artificial intelligence today.

In this video, you will learn:

– How to find the rank of a matrix by identifying linearly independent rows and columns.
– The fundamental difference between a full rank matrix and a deficient matrix in linear systems.
– Why the rank echelon form reveals the true dimensionality and hidden redundancies of your data.
– How the rank of a matrix applies directly to dimensionality reduction and machine learning algorithms.
– A complete worked example in 2D space to build an intuitive, visual mental model of matrix collapse.
– How to avoid the dangers of near-redundancy when dealing with real-world noisy datasets.

Rank of a Matrix Using Minors | Examples & Explanation

Rank of a Matrix Using Row Echelon Form (REF) | Elementary Row Operations Explained with Examples

Rank of a Matrix by Normal/Canonical Form | Step-by-Step Guide

Notes

Matrix Invertibility

An invertible (or non-singular) square matrix A is a matrix that has a matching inverse matrix A⁻¹ such that multiplying them yields the identity matrix: AA⁻¹ = A⁻¹A = I.

How to Tell if a Matrix is Invertible

Non-zero Determinant: The determinant det(A) ≠ 0. If det(A) = 0, the matrix is singular and cannot be inverted.
Row Reduction: The reduced row echelon form (RREF) of A is the identity matrix I_n.
Full Rank: An n × n matrix must have a full rank of n.
Linearly Independent Columns: All columns (and rows) of A must be linearly independent and span the space ℝⁿ.

Key Properties

Unique Inverse: If an inverse exists, it is unique.
Product Rule: The inverse of a product AB is (AB)⁻¹ = B⁻¹A⁻¹.
Double Inverse: (A⁻¹)⁻¹ = A.
Determinant of Inverse: det(A^-1) = 1/det(A).

[ ℰ ] This exceptional reference is highly recommended for your consideration.

⭐ I suggest that you read the entire reference. Other references can be read in their entirety but I leave that up to you.

The featured image on this page is by Marcel Moosbrugger.