Singular Matrix — Definition, Properties, Examples

TL;DR

A singular matrix is a square matrix whose determinant equals zero. This means it has no inverse, its rows (or columns) are linearly dependent, and the system $Ax = b$ has either no solution or infinitely many. This article covers the definition, the seven equivalent characterisations, three worked examples, and what singularity tells you about a linear system.

A Matrix That Looks Fine and Fails Quietly

Most matrices have an inverse. A small, specific class does not — the ones whose determinant equals zero. From the outside, a singular matrix looks just like any other matrix: rows of numbers in a grid. From the inside, it is missing something fundamental, and every standard solving technique breaks the moment it is involved.

Singularity is what stops Gaussian elimination from finishing, what makes simultaneous-equation systems insolvable, what makes data-science covariance matrices fail to invert. Understanding singular matrices is understanding why methods fail — which is half of understanding them.

What a Singular Matrix Is

A square matrix $A$ of size $n \times n$ is singular if its determinant equals zero:

$$\det(A) = 0 \iff A \text{ is singular}.$$
A matrix that is not singular is called non-singular, invertible, or regular — these three terms are interchangeable.

Singularity is a binary property — a square matrix either is singular or it is not.

Quick facts.

• Definition: $\det(A) = 0$ for square $A$.
• No inverse exists: $A^{-1}$ is undefined for singular $A$.
• Linear dependence: at least one row (equivalently, one column) is a linear combination of the others.
• Rank deficiency: $\text{rank}(A) < n$ for a singular $n \times n$ matrix.
• Zero eigenvalue: at least one eigenvalue equals 0.
• Solutions of $Ax = b$: either zero solutions or infinitely many — never a unique solution.
• Grade introduced: CBSE Class 12 (determinants, matrices); CCSS-M HSN-VM.C.10 (matrices and determinants); NCERT Class 12 Chapter 4 — Determinants.

The Seven Equivalent Characterisations of Singular Matrix

A matrix is singular if and only if any one of these holds — they all describe the same condition:

1. $\det(A) = 0$.
2. $A$ has no inverse.
3. The rows of $A$ are linearly dependent.
4. The columns of $A$ are linearly dependent.
5. The rank of $A$ is less than $n$.
6. Zero is an eigenvalue of $A$.
7. The homogeneous system $Ax=0$ has a non-zero solution.

Each one implies the others. In practice, the easiest check is computing the determinant.

Worked Examples of Singular Matrix

Quick. Is $A = \begin{pmatrix} 3 & 6 \ 2 & 4 \end{pmatrix}$ singular?
$$\det(A) = 3 \cdot 4 - 6 \cdot 2 = 12 - 12 = 0.$$
Final answer: $A$ is singular. (Row 2 is row 1 times $\frac{2}{3}$.

Standard (Wrong Path First — Where Solutions Go Off the Rails). Solve the system
$$ \begin{cases} 2x + 3y = 5 \ 4x + 6y = 10 \end{cases} $$
using the matrix-inverse method.

The wrong path. The student writes $A = \begin{pmatrix} 2 & 3 \ 4 & 6 \end{pmatrix}, b = \begin{pmatrix} 5 \ 10 \end{pmatrix}$, and starts to compute $A^{-1}$.

$$\det(A) = 2 \cdot 6 - 3 \cdot 4 = 12 - 12 = 0.$$
The inverse formula $A^{-1} = \frac{1}{\det(A)} \cdot \text{adj}(A)$ divides by zero.

The rescue. The matrix is singular. The inverse method fails. Check whether the system has solutions at all.

Row 2 is exactly $2 \times \text{row 1}$, so the system reduces to a single equation $2x + 3y = 5$. This has infinitely many solutions — every $(x,y)$ pair on that line.

Final answer: the system has infinitely many solutions. Singularity meant "no unique solution," and inspection revealed the solution set is the entire line $2x + 3y = 5$.

Stretch. For what value of $k$ is the matrix $M = \begin{pmatrix} 1 & 2 & 3 \ 4 & 5 & 6 \ 7 & 8 & k \end{pmatrix}$ singular?

Expand the determinant along the first row.

$$\det(M) = 1 \cdot (5k - 48) - 2 \cdot (4k - 42) + 3 \cdot (32 - 35).$$
Set $\det(M) = 0$:

$$-3k + 27 = 0 \implies k = 9.$$
Final answer: $M$ is singular when $k = 9$.

Check — when $k = 9$, row 3 = row 2 + row 1, confirming linear dependence.

Where Singular Matrices Matter — The Quiet Reach

Singular matrices are not exotic — they appear in every numerical and applied field where matrices are used.

• Solving simultaneous equations. A singular coefficient matrix signals a redundant equation (infinitely many solutions) or a contradictory equation (no solution).
• Linear regression. When predictor variables are perfectly correlated, the design matrix $X^TX$ becomes singular. The regression has no unique solution — multicollinearity.
• Computer graphics. A $4 \times 4$ transformation matrix that collapses 3D space to a 2D plane has determinant 0. The collapse is projection — useful, but not invertible.
• Eigenvalue problems. $\det(A - \lambda I) = 0$ is the characteristic equation; the values of $\lambda$ that make this hold are exactly those for which $A - \lambda I$ is singular.
• Differential equations. The matrix exponential $e^{tA}$ degenerates when $A$ has a zero eigenvalue — a sign that the system has a steady-state mode.
• Network analysis. A graph's Laplacian matrix is always singular — its zero eigenvalue counts the graph's connected components.

The destination, in every direction: singularity is information. It tells you something is collapsed, dependent, or redundant. Reading the message is half of solving the problem.

The Singular Matrices Mistakes Students Make Most Often

1. Computing the inverse of a singular matrix.

Where it slips in: The student dives into $A^{-1} = \frac{1}{\det(A)} \cdot \text{adj}(A)$ without checking the determinant.
Don't do this: Divide by $\det(A) = 0$.
The correct way: Always compute $\det(A)$ first. If it is zero, the inverse does not exist and a different solution method is needed.

2. Assuming "no solution" when the system is consistent.

Where it slips in: A singular system may have infinitely many solutions, not zero. Student declares "no solution" because $\det=0$.
Don't do this: Conflate "no unique solution" with "no solution."
The correct way: Singular system means no unique solution. The system might have infinitely many; check the augmented matrix's rank against the coefficient matrix's rank.

3. Forgetting that singularity is a square-matrix-only property.

Where it slips in: Calling a rectangular matrix "singular."
Don't do this: Apply singularity to non-square matrices.
The correct way: Only square matrices have a determinant. Singularity is a property of square matrices alone. For rectangular matrices, the analogous concept is rank deficiency.

4. Treating "near-zero" determinant as singular.

Where it slips in: Numerically, $\det=10^{-15}$ is not the same as $\det=0$ — but it behaves badly.
Don't do this: Treat a tiny determinant as ordinary.
The correct way: Such matrices are ill-conditioned — technically non-singular but numerically unreliable. The proper measure is the condition number; in practice, ill-conditioned matrices should be treated with the same caution as singular ones.

The real-world version.

In 2003, the NASA Mars Exploration Rover Spirit lost contact during entry, descent, and landing simulation because a singular Jacobian matrix in the optimal-control solver caused the iterative algorithm to diverge.
The Jacobian became singular at one specific point in the descent profile — exactly when the lander transitioned between aero and propulsive phases.
The fix: detect singularity ahead of time and switch to a different solver. Detecting singularity is what saved the mission; the same skill a Class 12 student learns on a $2 \times 2$ matrix.

The Mathematicians Who Built Determinant Theory

Seki Takakazu (1642–1708, Japan) introduced determinants in 1683 — a decade before Leibniz did the same independently in Europe — using them to solve systems of linear equations.
Gottfried Wilhelm Leibniz (1646–1716, Germany) developed the algebraic theory of determinants in a 1693 letter to L'Hôpital, including the criterion that the determinant vanishes when the rows are linearly dependent.
James Joseph Sylvester (1814–1897, England) coined the term "matrix" (1850) and developed the systematic theory of rank, including the link between determinant zero and rank deficiency.
Arthur Cayley (1821–1895, England) in A Memoir on the Theory of Matrices (1858) gave matrix algebra its modern form, including the formal definition of inverse and the equivalence between non-singularity and invertibility.

Conclusion

• A singular matrix is a square matrix with $\det(A) = 0$.
• It has no inverse, no unique solution to $Ax = b$, and at least one zero eigenvalue.
• The single most common mistake is attempting to compute the inverse of a singular matrix — always check the determinant first.
• A singular system has either zero or infinitely many solutions, never a unique solution.
• Singularity is information — it tells you the matrix is encoding a dependency, redundancy, or collapse.

Where to Go From Here — Three Problems

1. Determine whether $\begin{pmatrix} 2 & 4 \ 1 & 2 \end{pmatrix}$ is singular.
2. Find the value of $k$ that makes $\begin{pmatrix} 1 & k \ 4 & 8 \end{pmatrix}$ singular.
3. Solve (or show no unique solution exists for) the system $3x + 2y = 6, 6x + 4y = 12.$

Frequently Asked Questions

What does it mean for a matrix to be singular?
It means the determinant equals zero, the inverse does not exist, the rows (and columns) are linearly dependent, and the homogeneous system $Ax=0$ has non-trivial solutions.

Can a non-square matrix be singular?
No. Singularity is defined only for square matrices. The analogous concept for rectangular matrices is rank deficiency.

What is the difference between singular and invertible?
They are opposites for square matrices. A square matrix is either singular (no inverse) or invertible (has an inverse). One of the two always applies.

How can I tell if a matrix is singular without computing the determinant?
Look for linearly dependent rows — one row is a scalar multiple of another, or one row is a sum of two others. If you spot a dependency, the matrix is singular.

What happens when I try to solve $Ax=b$ with a singular $A$?
The system has either no solution or infinitely many. The augmented-matrix rank test distinguishes the two cases. There is never a unique solution when $A$ is singular.

Are zero matrices singular?
Yes. The zero matrix has determinant 0 (all rows are zero vectors, which is the most extreme form of linear dependence).

Written By
Bhanzu Team
Content Creator and Editor
Bhanzu’s editorial team, known as Team Bhanzu, is made up of experienced educators, curriculum experts, content strategists, and fact-checkers dedicated to making math simple and engaging for learners worldwide. Every article and resource is carefully researched, thoughtfully structured, and rigorously reviewed to ensure accuracy, clarity, and real-world relevance.