What Is a Non-Singular Matrix?
A non-singular matrix is a square matrix whose determinant is not equal to zero, that is, . Because its determinant is non-zero, a non-singular matrix always has an inverse, which is why it is also called an invertible matrix. Only square matrices (order ) can be singular or non-singular, since only square matrices have a determinant.
Quick Reference:
Definition: A square matrix with .
Also called: invertible matrix
Condition: (equivalently, rank ; rows/columns linearly independent)
Type: property of a square matrix
Used in: solving linear systems, matrix inverses, computer graphics, machine learning
The two tests below always agree, so you can use whichever is easier for the matrix in front of you:
Determinant test: non-singular.
Rank test: a matrix of order is non-singular if and only if its rank equals , so every row (and column) is linearly independent.
Non-Singular vs. Singular Matrix
The cleanest way to hold the definition is by its opposite. A singular matrix has ; it is not invertible, and its rows or columns are linearly dependent.
Feature | Non-singular matrix | Singular matrix |
|---|---|---|
Determinant | ||
Inverse | exists (invertible) | does not exist |
Rank (order ) | rank | rank |
Rows / columns | linearly independent | linearly dependent |
System | unique solution | no unique solution |
For the singular side of the picture, see singular matrix — the two articles are exact mirror images.
How to Check If a Matrix Is Non-Singular
The procedure is short:
Confirm the matrix is square (equal number of rows and columns). A non-square matrix is neither singular nor non-singular.
Compute the determinant.
If the determinant is non-zero, the matrix is non-singular; if it is zero, the matrix is singular.
For a matrix , the determinant is . For a matrix, expand along any row or column using cofactors. See determinant of matrix for the full method.
Properties of Non-Singular Matrices
The product of two non-singular matrices of the same order is non-singular: , and neither factor is zero.
If is non-singular, so is any non-zero scalar multiple (for ).
The inverse of a non-singular matrix is itself non-singular.
The transpose of a non-singular matrix is non-singular, since .
The identity matrix is non-singular, with .
Examples of Non-Singular Matrix
Example 1
Is non-singular?
Apply :
Since , is non-singular (invertible).
Final answer: Non-singular, .
Example 2
Is non-singular?
The tempting shortcut is to glance at the numbers, see no obvious pattern, and assume it is non-singular. Watch how that goes wrong. Compute the determinant properly:
The determinant is zero, so is singular, not non-singular. The reason is visible once you look: the second row is of the first row , so the rows are linearly dependent. You cannot judge singularity by eye; you compute.
Final answer: Singular, .
Example 3
Is non-singular?
For a diagonal matrix, the determinant is the product of the diagonal entries:
Since , is non-singular. A diagonal matrix is non-singular exactly when no diagonal entry is zero.
Final answer: Non-singular, .
Example 4
Is non-singular?
Expand along the first row:
Compute each minor:
Substitute:
Since , is non-singular.
Final answer: Non-singular, .
Example 5
Find so that is singular, and state the range that keeps it non-singular.
Set the determinant to zero to find the singular case:
So is singular only when ; for every other value of , and is non-singular.
Final answer: Singular at ; non-singular for all .
Example 6
If and are non-singular with and , is non-singular?
Use the product rule for determinants:
Since , the product is non-singular.
Final answer: Non-singular, .
Why the Non-Singular Property Matters: "Can this be undone?"
The non-singular property answers one question that runs through all of linear algebra: is this transformation reversible? That question has real stakes.
Solving equations: a linear system has a unique solution exactly when is non-singular. A zero determinant means no unique answer.
Computer graphics: rotation and scaling matrices must be non-singular so a scene can be transformed and then transformed back.
Data and machine learning: many algorithms invert a matrix; a singular (or nearly singular) matrix breaks the computation, which is why data scientists check the determinant first.
The destination is the inverse of a matrix — a tool that only exists because a matrix is non-singular. Everything in this article is really the entry condition for that inverse.
What Are the Most Common Mistakes With Non-Singular Matrices?
Mistake 1: Judging singularity without computing the determinant
Where it slips in: Looking at a matrix and guessing from the size of its numbers.
Don't do this: Assuming is non-singular because its entries look unrelated.
The correct way: Always compute . That matrix has determinant and is singular. Students first testing matrices tend to trust their eyes; training the habit of computing the determinant every time prevents the error.
Mistake 2: Testing a non-square matrix
Where it slips in: Applying the singular/non-singular label to a rectangular matrix.
Don't do this: Trying to find the determinant of a matrix.
The correct way: Only square matrices have determinants, so only square matrices are singular or non-singular. Check the order first. The memorizer who recalls "det ≠ 0" without recalling "square only" is the one who trips here.
Mistake 3: Confusing zero entries with a zero determinant
Where it slips in: Seeing a matrix that contains zeros and concluding it must be singular.
Don't do this: Calling singular because it has zeros.
The correct way: A matrix full of individual zeros can still have a non-zero determinant — this one is . It is the determinant that must be zero for singularity, not any single entry. This is the same trap that once flattened a supposedly-safe transformation in early graphics engines: a matrix looked harmless but its determinant had quietly reached zero, collapsing the rendered object into a line. The number to watch is always the determinant.
Conclusion
A non-singular matrix is a square matrix with , and it is always invertible.
Its opposite, the singular matrix, has and no inverse.
Test by computing the determinant (or checking that rank ).
Products, transposes, and non-zero scalar multiples of non-singular matrices stay non-singular.
Never judge singularity by eye — the determinant is the deciding number.
To work through matrices and determinants with a teacher, explore Bhanzu's algebra tutor or a dedicated high school math tutor, supported by structured algebra classes.
Read More
Was this article helpful?
Your feedback helps us write better content
Frequently Asked Questions
Is every square matrix either singular or non-singular?
Why is a non-singular matrix called invertible?
Can a non-singular matrix have negative entries?
What is the relationship between rank and non-singularity?
Is the identity matrix non-singular?


