What Is a Non-Singular Matrix?
A non-singular matrix is a square matrix $A$ whose determinant is not equal to zero, that is, $\det A \neq 0$. 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 $n \times n$) can be singular or non-singular, since only square matrices have a determinant.
Quick Reference:
Definition: A square matrix $A$ with $\det A \neq 0$.
Also called: invertible matrix
Condition: $\det A \neq 0$ (equivalently, rank $= n$; 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: $\det A \neq 0 \Rightarrow$ non-singular.
Rank test: a matrix of order $n$ is non-singular if and only if its rank equals $n$, 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 $\det A = 0$; it is not invertible, and its rows or columns are linearly dependent.
Feature | Non-singular matrix | Singular matrix |
|---|---|---|
Determinant | $\det A \neq 0$ | $\det A = 0$ |
Inverse | exists (invertible) | does not exist |
Rank (order $n$) | rank $= n$ | rank $< n$ |
Rows / columns | linearly independent | linearly dependent |
System $AX = B$ | 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 $2 \times 2$ matrix $A = \begin{bmatrix} a & b \ c & d \end{bmatrix}$, the determinant is $\det A = ad - bc$. For a $3 \times 3$ 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: $\det(AB) = \det(A)\det(B)$, and neither factor is zero.
If $A$ is non-singular, so is any non-zero scalar multiple $kA$ (for $k \neq 0$).
The inverse $A^{-1}$ of a non-singular matrix is itself non-singular.
The transpose $A^{T}$ of a non-singular matrix is non-singular, since $\det A^{T} = \det A$.
The identity matrix is non-singular, with $\det I = 1$.
Examples of Non-Singular Matrix
Example 1
Is $A = \begin{bmatrix} 1 & -4 \ 3 & 5 \end{bmatrix}$ non-singular?
Apply $\det A = ad - bc$:
$$\det A = (1)(5) - (-4)(3)$$ $$= 5 + 12 = 17$$
Since $17 \neq 0$, $A$ is non-singular (invertible).
Final answer: Non-singular, $\det A = 17$.
Example 2
Is $B = \begin{bmatrix} 3 & 6 \ 2 & 4 \end{bmatrix}$ 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:
$$\det B = (3)(4) - (6)(2)$$ $$= 12 - 12 = 0$$
The determinant is zero, so $B$ is singular, not non-singular. The reason is visible once you look: the second row $(2, 4)$ is $\tfrac{2}{3}$ of the first row $(3, 6)$, so the rows are linearly dependent. You cannot judge singularity by eye; you compute.
Final answer: Singular, $\det B = 0$.
Example 3
Is $C = \begin{bmatrix} 2 & 0 \ 0 & 7 \end{bmatrix}$ non-singular?
For a diagonal matrix, the determinant is the product of the diagonal entries:
$$\det C = (2)(7) = 14$$
Since $14 \neq 0$, $C$ is non-singular. A diagonal matrix is non-singular exactly when no diagonal entry is zero.
Final answer: Non-singular, $\det C = 14$.
Example 4
Is $D = \begin{bmatrix} 4 & -1 & 0 \ 2 & 3 & 5 \ -1 & 7 & 2 \end{bmatrix}$ non-singular?
Expand along the first row:
$$\det D = 4\begin{vmatrix} 3 & 5 \ 7 & 2 \end{vmatrix} - (-1)\begin{vmatrix} 2 & 5 \ -1 & 2 \end{vmatrix} + 0$$
Compute each minor:
$$\begin{vmatrix} 3 & 5 \ 7 & 2 \end{vmatrix} = (3)(2) - (5)(7) = 6 - 35 = -29$$ $$\begin{vmatrix} 2 & 5 \ -1 & 2 \end{vmatrix} = (2)(2) - (5)(-1) = 4 + 5 = 9$$
Substitute:
$$\det D = 4(-29) + 1(9) + 0 = -116 + 9 = -107$$
Since $-107 \neq 0$, $D$ is non-singular.
Final answer: Non-singular, $\det D = -107$.
Example 5
Find $k$ so that $E = \begin{bmatrix} k & 2 \ 3 & 6 \end{bmatrix}$ is singular, and state the range that keeps it non-singular.
Set the determinant to zero to find the singular case:
$$\det E = 6k - 6 = 0$$ $$k = 1$$
So $E$ is singular only when $k = 1$; for every other value of $k$, $\det E \neq 0$ and $E$ is non-singular.
Final answer: Singular at $k = 1$; non-singular for all $k \neq 1$.
Example 6
If $A$ and $B$ are non-singular with $\det A = 5$ and $\det B = -2$, is $AB$ non-singular?
Use the product rule for determinants:
$$\det(AB) = \det(A)\det(B) = (5)(-2) = -10$$
Since $-10 \neq 0$, the product $AB$ is non-singular.
Final answer: Non-singular, $\det(AB) = -10$.
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 $AX = B$ has a unique solution $X = A^{-1}B$ exactly when $A$ 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 $\begin{bmatrix} 3 & 6 \ 2 & 4 \end{bmatrix}$ is non-singular because its entries look unrelated.
The correct way: Always compute $\det A = ad - bc$. That matrix has determinant $0$ 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 $2 \times 3$ 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 $\begin{bmatrix} 2 & 0 \ 0 & 7 \end{bmatrix}$ singular because it has zeros.
The correct way: A matrix full of individual zeros can still have a non-zero determinant — this one is $14$. 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 $\det A \neq 0$, and it is always invertible.
Its opposite, the singular matrix, has $\det A = 0$ and no inverse.
Test by computing the determinant (or checking that rank $= n$).
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