Non-Singular Matrix — Definition, Properties, and Examples

#Algebra
TL;DR
A non-singular matrix is a square matrix whose determinant is not zero (det⁡A≠0\det A \neq 0), which means it is invertible. This article defines the non-singular matrix, contrasts it with a singular matrix, lists its properties, shows how to test a matrix, and works through 2×2 and 3×3 examples.
MV
Madhukar VLast updated on July 18, 20268 min read

What Is a Non-Singular Matrix?

A non-singular matrix is a square matrix AA whose determinant is not equal to zero, that is, det⁡A≠0\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×nn \times n) can be singular or non-singular, since only square matrices have a determinant.

Quick Reference:

Definition: A square matrix AA with det⁡A≠0\det A \neq 0.

Also called: invertible matrix

Condition: det⁡A≠0\det A \neq 0 (equivalently, rank =n= 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≠0⇒\det A \neq 0 \Rightarrow non-singular.

  • Rank test: a matrix of order nn is non-singular if and only if its rank equals nn, 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\det A = 0; it is not invertible, and its rows or columns are linearly dependent.

Feature

Non-singular matrix

Singular matrix

Determinant

det⁡A≠0\det A \neq 0

det⁡A=0\det A = 0

Inverse

exists (invertible)

does not exist

Rank (order nn)

rank =n= n

rank <n< n

Rows / columns

linearly independent

linearly dependent

System AX=BAX = 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:

  1. Confirm the matrix is square (equal number of rows and columns). A non-square matrix is neither singular nor non-singular.

  2. Compute the determinant.

  3. If the determinant is non-zero, the matrix is non-singular; if it is zero, the matrix is singular.

For a 2×22 \times 2 matrix A=[ab cd]A = \begin{bmatrix} a & b \ c & d \end{bmatrix}, the determinant is det⁡A=ad−bc\det A = ad - bc. For a 3×33 \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)\det(AB) = \det(A)\det(B), and neither factor is zero.

  • If AA is non-singular, so is any non-zero scalar multiple kAkA (for k≠0k \neq 0).

  • The inverse A−1A^{-1} of a non-singular matrix is itself non-singular.

  • The transpose ATA^{T} of a non-singular matrix is non-singular, since det⁡AT=det⁡A\det A^{T} = \det A.

  • The identity matrix is non-singular, with det⁡I=1\det I = 1.

Examples of Non-Singular Matrix

Example 1

Is A=[1−4 35]A = \begin{bmatrix} 1 & -4 \ 3 & 5 \end{bmatrix} non-singular?

Apply det⁡A=ad−bc\det A = ad - bc:

det⁡A=(1)(5)−(−4)(3)\det A = (1)(5) - (-4)(3) =5+12=17= 5 + 12 = 17

Since 17≠017 \neq 0, AA is non-singular (invertible).

Final answer: Non-singular, det⁡A=17\det A = 17.

Example 2

Is B=[36 24]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)\det B = (3)(4) - (6)(2) =12−12=0= 12 - 12 = 0

The determinant is zero, so BB is singular, not non-singular. The reason is visible once you look: the second row (2,4)(2, 4) is 23\tfrac{2}{3} of the first row (3,6)(3, 6), so the rows are linearly dependent. You cannot judge singularity by eye; you compute.

Final answer: Singular, det⁡B=0\det B = 0.

Example 3

Is C=[20 07]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\det C = (2)(7) = 14

Since 14≠014 \neq 0, CC is non-singular. A diagonal matrix is non-singular exactly when no diagonal entry is zero.

Final answer: Non-singular, det⁡C=14\det C = 14.

Example 4

Is D=[4−10 235 −172]D = \begin{bmatrix} 4 & -1 & 0 \ 2 & 3 & 5 \ -1 & 7 & 2 \end{bmatrix} non-singular?

Expand along the first row:

det⁡D=4∣35 72∣−(−1)∣25 −12∣+0\det D = 4\begin{vmatrix} 3 & 5 \ 7 & 2 \end{vmatrix} - (-1)\begin{vmatrix} 2 & 5 \ -1 & 2 \end{vmatrix} + 0

Compute each minor:

∣35 72∣=(3)(2)−(5)(7)=6−35=−29\begin{vmatrix} 3 & 5 \ 7 & 2 \end{vmatrix} = (3)(2) - (5)(7) = 6 - 35 = -29 ∣25 −12∣=(2)(2)−(5)(−1)=4+5=9\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\det D = 4(-29) + 1(9) + 0 = -116 + 9 = -107

Since −107≠0-107 \neq 0, DD is non-singular.

Final answer: Non-singular, det⁡D=−107\det D = -107.

Example 5

Find kk so that E=[k2 36]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\det E = 6k - 6 = 0 k=1k = 1

So EE is singular only when k=1k = 1; for every other value of kk, det⁡E≠0\det E \neq 0 and EE is non-singular.

Final answer: Singular at k=1k = 1; non-singular for all k≠1k \neq 1.

Example 6

If AA and BB are non-singular with det⁡A=5\det A = 5 and det⁡B=−2\det B = -2, is ABAB non-singular?

Use the product rule for determinants:

det⁡(AB)=det⁡(A)det⁡(B)=(5)(−2)=−10\det(AB) = \det(A)\det(B) = (5)(-2) = -10

Since −10≠0-10 \neq 0, the product ABAB is non-singular.

Final answer: Non-singular, det⁡(AB)=−10\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=BAX = B has a unique solution X=A−1BX = A^{-1}B exactly when AA 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 [36 24]\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\det A = ad - bc. That matrix has determinant 00 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×32 \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 [20 07]\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 1414. 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≠0\det A \neq 0, and it is always invertible.

  • Its opposite, the singular matrix, has det⁡A=0\det A = 0 and no inverse.

  • Test by computing the determinant (or checking that rank =n= 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

Frequently Asked Questions

Is every square matrix either singular or non-singular?
Yes. Every square matrix has a determinant, and that determinant is either zero (singular) or non-zero (non-singular) — there is no third case.
Why is a non-singular matrix called invertible?
Because a non-zero determinant guarantees an inverse A−1A^{-1} exists. "Non-singular" and "invertible" describe the same matrices.
Can a non-singular matrix have negative entries?
Yes. Sign of entries has nothing to do with singularity — only whether the determinant is zero matters. [1−4 35]\begin{bmatrix} 1 & -4 \ 3 & 5 \end{bmatrix} has determinant 1717 and is non-singular.
What is the relationship between rank and non-singularity?
A matrix of order nn is non-singular if and only if its rank equals nn, meaning all rows and columns are linearly independent.
Is the identity matrix non-singular?
Yes. The identity matrix has determinant 11, so it is always non-singular, and it is its own inverse.
✍️ Written By
Madhukar V
Madhukar V
Math Columnist & Analyst
I see mathematics as more than just numbers and formulas—it is a way of thinking, questioning, and understanding the world around us. I work at the intersection of mathematics, EdTech, technology, and AI-powered learning, I enjoy exploring how mathematical ideas can be made simple, meaningful, and relatable. Through my articles, I aim to present mathematics with curiosity and a practical perspective, helping readers see the beauty and relevance behind every concept in a Bhanzu way.
LinkedIn
Related Articles
Book a FREE Demo ClassBook Now →