Rank and Nullity of a Nonsingular Matrix

Q: How many extra constraints do I need to fix a singular system?

Exactly the rank deficiency $d$, and they must be independent of the existing rows. Fewer leaves the matrix singular; more over-determines the system and introduces spurious reactions. Checking independence means confirming that each new constraint is not orthogonal to the null space, which the null space basis makes immediate.

Overview

Nonsingularity is defined by a property of the null space: a square matrix $A$ of size $n$ is nonsingular when the only solution of $A\vec{x} = \vec{0}$ is the zero vector. Once dimension is available, that definition acquires two numerical restatements. The null space is trivial exactly when its dimension is zero, and by the rank-nullity accounting that happens exactly when the rank attains its maximum possible value $n$ . Nonsingular, full rank and zero nullity are one condition wearing three labels.

The value of the restatement is that rank and nullity are computed rather than argued about. A single row reduction returns both, so the question "is this matrix invertible?" is answered by counting pivots, and the same reduction that answers it also produces the null space basis that explains any deficiency. For a matrix that fails the test, the nullity is not merely a flag but a measurement: it says exactly how many independent directions the matrix destroys.

This result is the sixth in a growing chain of equivalent characterisations of a nonsingular matrix, and the chain is the reason nonsingularity is the organising concept of the subject. Row reduction to the identity, triviality of the null space, unique solvability for every right-hand side, independence of the columns, invertibility, a column space filling the whole of $\mathbb{C}^n$ , columns forming a basis, rank $n$ and nullity zero are all the same statement. Any one may be substituted for any other inside a proof or a program.

In practice the binary answer is rarely the whole story. Matrices assembled from measurements are almost never exactly singular, yet many are so close to singular that the distinction is meaningless at working precision. The engineering discipline therefore replaces the yes-or-no test with a continuous one: the smallest singular value, or equivalently the condition number, which measures how far a matrix is from the nearest singular matrix and how many digits of the solution survive.

Definition

Rank and Nullity of a Nonsingular Matrix

RNNSM

Let $A$ be a square matrix of size $n$ . The following three statements are equivalent.

$A$ is nonsingular.
The rank of $A$ is $n$ : $\operatorname{rank}(A) = n$ .
The nullity of $A$ is zero: $\operatorname{nullity}(A) = 0$ .

Because equivalence is transitive, establishing any one of the three establishes the other two.

The statement is restricted to square matrices. Nonsingularity is undefined for a rectangular matrix, and for such a matrix full rank splits into two distinct notions.

Full Rank

A matrix has full rank when its rank attains the largest value its shape permits, namely $\min(m, n)$ . For a square matrix of size $n$ this means $\operatorname{rank}(A) = n$ , which is precisely nonsingularity. For a rectangular matrix it means full column rank when $m \ge n$ and full row rank when $m \le n$ ; the two coincide only in the square case.

Rank Deficiency

The rank deficiency of a square matrix $A$ of size $n$ is $d = n - \operatorname{rank}(A)$ . By the rank-nullity identity, $d = \operatorname{nullity}(A)$ , so the deficiency is simultaneously the shortfall in achievable output directions and the number of independent input directions annihilated. A nonsingular matrix has $d = 0$ .

Nonsingular Matrix Equivalences

NSME

For a square matrix $A$ of size $n$ the following statements are all equivalent.

$A$ is nonsingular.
$A$ row-reduces to the identity matrix.
The null space of $A$ contains only the zero vector: $\mathcal{N}(A) = \{\vec{0}\}$ .
The system $A\vec{x} = \vec{b}$ has a unique solution for every choice of $\vec{b}$ .
The columns of $A$ form a linearly independent set.
$A$ is invertible.
The column space of $A$ is all of $\mathbb{C}^n$ : $\mathcal{C}(A) = \mathbb{C}^n$ .
The columns of $A$ form a basis of $\mathbb{C}^n$ .
The rank of $A$ is $n$ .
The nullity of $A$ is zero.

Concepts

Proving the three-way equivalence as a cycle

Rather than prove six implications, close a cycle of three. Suppose $A$ is nonsingular. Then its column space is all of $\mathbb{C}^n$ , and since $\dim(\mathbb{C}^n) = n$ , the rank — being the dimension of the column space — is $n$ .

Now suppose $\operatorname{rank}(A) = n$ . The rank-nullity identity gives $\operatorname{nullity}(A) = n - \operatorname{rank}(A) = n - n = 0$ . Finally suppose $\operatorname{nullity}(A) = 0$ . A subspace of dimension zero has the empty set as a basis and contains only the zero vector, so $\mathcal{N}(A) = \{\vec{0}\}$ , which is the definition of nonsingularity. The cycle closes and all three statements are equivalent.

Why the square hypothesis cannot be dropped

The step from nonsingularity to rank $n$ uses the fact that the column space, a subspace of $\mathbb{C}^m$ , equals the whole of $\mathbb{C}^n$ — which only makes sense when $m = n$ . For a tall matrix with $m > n$ , the columns can be independent, giving nullity zero and rank $n$ , while the column space is a proper subspace and the system $A\vec{x} = \vec{b}$ is unsolvable for most $\vec{b}$ .

For a wide matrix with $m < n$ , the rank is at most $m < n$ , so the nullity is at least $n - m > 0$ and there is always a non-trivial null space regardless of the entries. Neither rectangular case admits a single notion of full rank that delivers unique solvability, which is why nonsingularity is reserved for square matrices and the rectangular cases are handled by least squares and minimum-norm solutions instead.

The equivalence chain as an engineering toolkit

The ten equivalent statements are not redundant; each is cheap to check in a different situation. Independence of columns is natural when the columns are measurement patterns. Unique solvability is natural when the matrix is a plant model. Rank $n$ is natural when a numerical library has already computed a decomposition. Reduction to the identity is natural for hand computation on small integer matrices.

Substituting one for another is what makes many arguments short. A proof that a change-of-basis matrix is invertible becomes a proof that its columns are independent; a check that a calibration is identifiable becomes a rank check on a Jacobian; a test that a network has a unique nodal solution becomes a test that the admittance matrix has trivial null space. Recognising which formulation is cheapest for the case at hand is a substantial part of applied skill.

Reading a deficiency rather than a flag

When a square matrix fails the test, the useful output is not the failure but its size and direction. The deficiency $d = n - \operatorname{rank}(A)$ counts the independent ways in which the matrix is defective, and the null space basis names them. A stiffness matrix assembled without boundary conditions has $d$ equal to the number of rigid-body modes — three in plane problems, six in space — and the null space vectors are those very modes.

A nodal admittance matrix for a circuit with no reference node has $d = 1$ , with the null space spanned by the all-ones vector, because shifting every node potential by a constant changes no current. In both cases the correct remedy is dictated by the null space: constrain exactly $d$ independent degrees of freedom, no more and no fewer.

Near-singularity: the continuous replacement for the test

Nonsingularity is a discontinuous property. The set of singular matrices has measure zero, so a matrix perturbed by rounding is nonsingular with probability one, and an exact-zero test on floating-point data will almost always report success even for a matrix that is numerically useless. The binary question has to be replaced by a graded one.

The smallest singular value $\sigma_n$ measures the distance to the nearest singular matrix in the spectral norm, and the condition number $\kappa(A) = \sigma_1 / \sigma_n$ measures the factor by which relative errors in the data are amplified in the solution. A working rule for binary64 is that roughly $\log_{10}\kappa(A)$ significant decimal digits are lost, so $\kappa(A) \approx 10^{8}$ leaves about eight digits and $\kappa(A) \approx 10^{16}$ leaves none.

Structured matrices and cheaper certificates

Some structures certify nonsingularity without a general reduction. A strictly diagonally dominant matrix is always nonsingular, which is why well-formed finite difference and admittance matrices can be trusted before any factorisation. A symmetric matrix with all positive eigenvalues is nonsingular, and the successful completion of a Cholesky factorisation is itself the certificate — the factorisation fails precisely when positive definiteness fails.

These shortcuts are valuable because they are structural: they hold for the whole family of matrices arising from a modelling assumption, so the certificate is established once at design time rather than checked at every solve. Where such structure exists, exploiting it typically halves the factorisation cost as well.

Decision path: is a square matrix nonsingular, and if not, how badly?

Confirm the matrix is squareNonsingularity is defined only for square matrices. For a rectangular matrix, ask instead about full column rank or full row rank.

Check for exploitable structureStrict diagonal dominance or a successful Cholesky factorisation certifies nonsingularity directly and more cheaply than a general reduction.

Factor or reduceApply

L U

with partial pivoting, or row-reduce for exact arithmetic. The question is whether

n

pivots are found.

Are there $n$ pivots?If yes,

\operatorname{rank}(A) = n

\operatorname{nullity}(A) = 0

and

A

is nonsingular. If no, record the deficiency

d = n - r

If deficient, compute the null space basisThe

d

basis vectors name the input directions the matrix destroys and dictate exactly which constraints must be added.

If nonsingular, estimate the condition numberA matrix can pass the test and still be useless in floating point. Report

\kappa(A)

alongside the verdict.

Equations

The three-way equivalence

EQ-RNNSM-01

The three-way equivalence

Valid for square $A$ of size $n$ . Any one of the three may be established and the other two inferred.

Rank-nullity in the square case

EQ-RNNSM-02

Rank-nullity in the square case

The identity that ties the second and third statements together: maximising one forces the other to zero.

Column space of a nonsingular matrix

EQ-RNNSM-03

C (A) = ℂ^{n}, \dim (C (A)) = n

The step from nonsingularity to full rank. It is here that the square hypothesis is used and here that the rectangular case breaks down.

Reduction to the identity

EQ-RNNSM-04

A nonsingular \Leftrightarrow RREF (A) = I_{n}

The practical hand test. With $n$ pivot columns in an $n$ -column matrix, every column hosts a leading one and no free variables remain.

Rank deficiency

EQ-RNNSM-05

d = n - rank (A) = nullity (A) = \dim (N (A))

One number with three readings: shortfall in rank, dimension of the null space, and number of independent constraints required to restore nonsingularity.

Singular values and the distance to singularity

EQ-RNNSM-06

σ_{1} \geq σ_{2} \geq \dots \geq σ_{n} \geq 0, A singular \Leftrightarrow σ_{n} = 0

The continuous form of the test. The value $\sigma_n$ is exactly the spectral-norm distance from $A$ to the nearest singular matrix.

Condition number and digit loss

EQ-RNNSM-07

κ (A) = \frac{σ_{1}}{σ_{n}}, digits lost \approx \log_{10} κ (A)

The working rule for floating point. A nonsingular matrix with $\kappa(A) \approx 10^{16}$ delivers no correct significant digits in binary64.

Variable Definitions

Symbols used on this page
Symbol	Name	Meaning	Domain / type
$A$	Square matrix	The matrix of size $n$ whose nonsingularity is at issue	n x n complex matrix
$n$	Size	Common row and column count; the target value for the rank	positive integer
$rank (A)$	Rank	Dimension of the column space; equals $n$ exactly when $A$ is nonsingular	0 to n
$nullity (A)$	Nullity	Dimension of the null space; zero exactly when $A$ is nonsingular	0 to n
$d$	Rank deficiency	$n - \operatorname{rank}(A)$ ; the number of independent constraints needed to restore nonsingularity	0 to n
$N (A)$	Null space	Inputs annihilated by $A$ ; trivial exactly in the nonsingular case	subspace of C^n
$C (A)$	Column space	Achievable outputs; equals $\mathbb{C}^n$ exactly in the nonsingular case	subspace of C^n
$I_{n}$	Identity matrix	The reduced row-echelon form reached by every nonsingular matrix of size $n$	n x n matrix
$σ_{n}$	Smallest singular value	Distance to the nearest singular matrix; zero exactly when $A$ is singular	non-negative real
$κ (A)$	Condition number	Error amplification factor $\sigma_1/\sigma_n$ ; infinite for a singular matrix	1 to infinity

Worked Numerical Example

Problem statement

A four-node electrical network is described by a $4 \times 4$ conductance matrix. Establish whether the network has a unique nodal solution, then repeat the analysis after a modelling change that makes one node's coupling a difference of two others, and identify precisely what is lost.

State the first conductance matrix
Each column describes how a unit potential at one node drives current at the four nodes. The question of a unique nodal solution is the question of whether this matrix is nonsingular.
$A = [\begin{matrix} 2 & - 1 & 0 & 1 \\ 1 & 3 & - 2 & 0 \\ 0 & 1 & 4 & - 1 \\ 3 & 0 & 1 & 2 \end{matrix}]$
Reduce and count the pivots
Row-reduce to reduced row-echelon form. All four columns acquire a leading one, so there are four pivot columns and no free columns.
$RREF (A) = [\begin{matrix} 1 & 0 & 0 & 0 \\ 0 & 1 & 0 & 0 \\ 0 & 0 & 1 & 0 \\ 0 & 0 & 0 & 1 \end{matrix}] = I_{4}$
Report the rank, nullity and verdict
Four non-zero rows give $\operatorname{rank}(A) = 4 = n$ , and the rank-nullity identity gives $\operatorname{nullity}(A) = 4 - 4 = 0$ . Both conditions of the equivalence are met, so $A$ is nonsingular and the nodal system has exactly one solution for any injected current vector.
$rank (A) = 4, nullity (A) = 0, d = 0$
Introduce the modelling change
Suppose node 4's coupling pattern is now modelled as the difference of the patterns of nodes 1 and 2 — a plausible outcome when a component is replaced by a differential element. Column 4 becomes column 1 minus column 2, entrywise.
$A' = [\begin{matrix} 2 & - 1 & 0 & 3 \\ 1 & 3 & - 2 & - 2 \\ 0 & 1 & 4 & - 1 \\ 3 & 0 & 1 & 3 \end{matrix}]$
Reduce the modified matrix
The reduction now stalls: column 4 acquires no leading one, because it is a linear combination of columns 1 and 2 and contributes no new direction. One zero row appears.
$RREF (A') = [\begin{matrix} 1 & 0 & 0 & 1 \\ 0 & 1 & 0 & - 1 \\ 0 & 0 & 1 & 0 \\ 0 & 0 & 0 & 0 \end{matrix}]$
Quantify the deficiency
Three pivot columns give $\operatorname{rank}(A') = 3$ , so the deficiency is $d = 4 - 3 = 1$ and the nullity is $1$ . The matrix is singular, and the system either has no solution or infinitely many depending on the injected currents.
$rank (A') = 3, nullity (A') = 1, d = 1$
Identify the lost direction
Column 4 is free, so set $x_4 = 1$ and read the dependent variables from the reduced rows: $x_1 = -1$ , $x_2 = 1$ , $x_3 = 0$ . This single vector spans the null space and names the potential pattern that drives no current anywhere.
$N (A') = span ([\begin{matrix} - 1 \\ 1 \\ 0 \\ 1 \end{matrix}])$
Verify the null vector against the original matrix
Multiply row by row: $2(-1) + (-1)(1) + 0(0) + 3(1) = 0$ ; $1(-1) + 3(1) + (-2)(0) + (-2)(1) = 0$ ; $0(-1) + 1(1) + 4(0) + (-1)(1) = 0$ ; $3(-1) + 0(1) + 1(0) + 3(1) = 0$ . Every component vanishes, confirming the basis vector.
Prescribe the remedy from the deficiency
Because $d = 1$ , exactly one additional independent constraint restores nonsingularity — for example fixing one node potential relative to the pattern identified by the null vector. Adding two constraints would over-determine the system; adding a constraint that is itself a combination of existing rows would not help at all.

Result

The original network is nonsingular: rank four, nullity zero, one unique nodal solution for every excitation. The modified network is deficient by exactly one, and the null space names the culprit — a potential pattern raising nodes 2 and 4 while lowering node 1 produces no current at any node and is therefore invisible to the measurement. One well-chosen grounding constraint, aligned with that pattern, restores a unique solution; no amount of additional current measurement will.

Applications & Industry Use

Electrical engineering

Reference node in nodal analysis

A nodal admittance matrix formed without designating a reference node is singular with deficiency one, the null space spanned by the all-ones vector, because shifting every potential by a constant changes no branch current. Grounding one node removes exactly that direction and makes the matrix nonsingular. Recognising the deficiency as one, and its direction as uniform, is what tells the engineer that a single ground is both necessary and sufficient.

Structural engineering

Rigid-body modes in an unrestrained stiffness matrix

A finite element stiffness matrix assembled before boundary conditions is singular, with deficiency equal to the number of rigid-body modes: three in plane problems and six in three dimensions. The null space vectors are the translations and rotations themselves. Applying exactly that many independent restraints makes the matrix nonsingular; applying fewer leaves the solver to fail, and applying more introduces spurious reaction forces.

Robotics

Manipulator Jacobian singularities

A square manipulator Jacobian is nonsingular at configurations where every task-space velocity is achievable. At a singularity the rank drops, and the nullity gives the dimension of the space of joint velocities that produce no end-effector motion, while the deficiency in the range identifies the directions the manipulator cannot move in. Both are needed to plan a path that avoids or passes safely through the configuration.

Cryptography & coding

Invertible key matrices over a finite field

Classical matrix-based ciphers and many coding constructions require a key matrix that is nonsingular over a finite field, so that encoding is reversible. The test is the same row reduction, performed in modular arithmetic, and the condition is the same rank equal to size. Singularity here is not a numerical nuisance but a correctness failure: distinct messages would encode to the same ciphertext.

System identification & estimation

Identifiability from an information matrix

The parameters of a model are locally identifiable exactly when the associated information matrix is nonsingular. A rank deficiency of $d$ means a $d$ -dimensional family of parameter values fits the data equally well, and the null space names the combinations that cannot be separated. Diagnosing this before running an estimator saves a great deal of time otherwise spent interpreting an optimiser that will not converge.

Computational fluid dynamics

Pressure level in incompressible flow

Discretised incompressible flow problems determine pressure only up to an additive constant, so the pressure block of the system matrix is singular with deficiency one. Solvers either pin the pressure at a reference cell or project the constant mode out at each iteration. Both remedies are direct consequences of knowing the deficiency and the null space direction in advance.

Design Considerations

The binary test is necessary but rarely sufficient

A matrix that passes the nonsingularity test can still be numerically worthless. Report the condition number or the smallest singular value alongside the verdict, and set an application-specific threshold beyond which the matrix is treated as singular regardless of what the pivot count says. In binary64 a condition number above $10^{12}$ leaves fewer than four correct digits.

Interpret the deficiency, do not merely detect it

The value of $d$ tells the engineer how many independent constraints are missing, and the null space basis tells which ones. A solver that reports only "matrix is singular" forces a manual investigation that the computation has already performed. Return the deficiency and the basis together as a matter of course.

Prefer structural certificates where they apply

Strict diagonal dominance, symmetric positive definiteness and irreducible diagonal dominance all guarantee nonsingularity for entire families of matrices arising from a modelling assumption. Establishing such a property once at design time is far more robust than testing each assembled matrix at run time, and usually enables a cheaper factorisation as well.

Do not test nonsingularity by computing a determinant

The determinant is mathematically equivalent to the test but numerically unhelpful: it scales as the product of the singular values, so it underflows or overflows for moderately sized matrices and its magnitude says nothing about conditioning. A diagonal matrix with entries $10^{-2}$ and size 200 has a determinant below the smallest representable number yet is perfectly conditioned. Use a factorisation and a condition estimate.

Restore rank by adding information, not by regularising away the symptom

Adding a small multiple of the identity, or taking a pseudo-inverse, produces an answer from a deficient system, but the answer is chosen by the algorithm rather than by the physics. Where the deficiency reflects genuinely missing constraints — an ungrounded network, an unrestrained structure — the correct fix is to supply those constraints. Reserve regularisation for cases where the deficiency reflects noise rather than modelling omission.

Keep the square and rectangular cases separate

Nonsingularity, and this equivalence with it, applies only to square matrices. Applying the vocabulary to a rectangular matrix invites the assumption that full rank delivers unique solvability, which is false for both tall and wide matrices. Use full column rank and full row rank explicitly, and describe the solution behaviour in terms of least squares or minimum norm.

Standards & Codes

Notation, interchange and numerical standards that govern how this material is written down, stored and computed in production systems.

Applicable standards, conventions and reference implementations
Reference	Title	Relevance to this topic
`ISO 80000-2`	Quantities and units — Part 2: Mathematics	Fixes the notation for the identity matrix, the rank and nullity operators, and the convention that operator names are set upright while matrix symbols are italic.
`IEEE 754-2019`	IEEE Standard for Floating-Point Arithmetic	Defines the arithmetic in which the nonsingularity test degenerates into a conditioning question, and the exponent range that makes a determinant-based test prone to overflow and underflow.
`IEEE 1788-2015`	IEEE Standard for Interval Arithmetic	Provides the machinery for rigorously certifying that every matrix within a tolerance box is nonsingular, which a floating-point factorisation cannot do.
`LAPACK / BLAS reference`	Linear Algebra PACKage reference implementation	Supplies `xGETRF`, whose `info` return value flags an exactly zero pivot, and `xGECON`, which estimates the reciprocal condition number that the pivot count alone cannot provide.
`ISO/IEC 40314`	Mathematical Markup Language (MathML) Version 3.0	Encodes the equivalence lists, matrices and operator names on this page as semantic markup so they remain searchable and available to assistive technology.

Material Selection

For a mathematical topic, "material" is the numeric representation: the scalar field, storage format and precision the computation is built from.

Representation and precision selection
Representation	Select when	Trade-off
Exact rational arithmetic	Small structural, incidence or symbolic matrices where nonsingularity is a modelling fact to be certified rather than estimated.	Delivers an unambiguous verdict, but says nothing about conditioning, so an exactly nonsingular matrix may still be useless in a floating-point solver.
IEEE 754 binary64 with a condition estimate	Default for engineering system matrices assembled from physical parameters.	Fast and paired with a meaningful conditioning measure at about 1% extra cost over the factorisation itself; the verdict is a threshold decision rather than a certainty.
IEEE 754 binary32	Real-time control or graphics loops where a well-conditioned matrix is guaranteed by construction and throughput dominates.	Halves memory traffic but leaves about seven significant digits, so any matrix with a condition number above roughly $10^{3}$ should be promoted to double precision.
Interval arithmetic	Safety-critical certification that a matrix remains nonsingular across a whole range of parameter values or manufacturing tolerances.	Gives a rigorous guarantee over an entire box of matrices, at several times the cost and with results that can be pessimistically wide if the formulation is naive.
Finite field arithmetic modulo a prime	Cryptographic key matrices and coding constructions where the field is genuinely finite and invertibility is a correctness requirement.	Exact, fast and free of conditioning concerns, but invertibility over a finite field is unrelated to invertibility over the rationals and must be tested in the field actually used.
Symmetric positive definite storage with Cholesky	Stiffness, covariance, Gram and admittance matrices that are symmetric by construction.	Half the operations and half the storage of a general factorisation, and the factorisation's success is itself a nonsingularity certificate; but a failure gives less diagnostic detail than a general reduction.

Manufacturing Notes

Implementation notes — how the result is actually produced by hand, by algorithm and by library, including cost and numerical behaviour.

Cost of the test

An $L U$ factorisation with partial pivoting costs about $\tfrac{2}{3}n^3$ operations and settles nonsingularity as a side effect of the work needed to solve a system anyway. Full reduction to the identity costs roughly $n^3$ and is preferred only for exact hand computation. A condition estimate adds about $O(n^2)$ on top of an existing factorisation, which is negligible and should be treated as mandatory.

Hand procedure and early termination

Reduce left to right and stop as soon as a column has no non-zero entry at or below the current pivot row: the matrix is singular and there is no need to finish. For a nonsingular matrix the reduction runs to completion with a leading one in every column. Recording the pivot indices as they are found makes the final count trivial and guards against miscounting non-zero rows.

Library behaviour and error signalling

LAPACK's xGETRF returns a positive info when it encounters an exactly zero pivot, but this fires only for exact singularity and never for the far more common near-singular case; pair it with xGECON. NumPy's numpy.linalg.solve raises LinAlgError on an exactly singular factor and issues no warning otherwise, so call numpy.linalg.cond separately. SymPy's Matrix.is_invertible answers exactly over the rationals with no tolerance involved.

Verifying a nonsingularity verdict

For a claimed nonsingular matrix, solve $A\vec{x} = \vec{b}$ for a random $\vec{b}$ and check the residual $\|\vec{b} - A\vec{x}\|$ relative to $\|\vec{b}\|$ ; a small residual with a large condition number indicates a solution that satisfies the equations but is far from the true one. For a claimed singular matrix, verify each null space basis vector against the original matrix by direct multiplication.

Improving an accurate-but-conditioned solve

Iterative refinement recovers accuracy from a factorisation of a moderately ill-conditioned matrix: compute the residual in higher precision, solve for the correction with the existing factors, and update. Each pass costs $O(n^2)$ against the original $O(n^3)$ , and typically restores several digits when $\kappa(A)$ is within a few orders of the reciprocal of the machine epsilon.

Failure Modes & Common Mistakes

Failure modes, root causes and prevention
Failure mode / mistake	Impact	Root cause	Prevention & detection
Applying nonsingularity vocabulary to a rectangular matrix	high	A tall or wide matrix is described as nonsingular because it has full rank for its shape.	Reserve the term for square matrices; use full column rank or full row rank explicitly, and state solution behaviour in least-squares or minimum-norm terms.
Trusting an exact-zero pivot test on floating-point data	high	A factorisation completes without an exactly zero pivot, so a matrix with $\kappa(A) \approx 10^{17}$ is declared nonsingular.	Always compute a condition estimate alongside the factorisation and apply an application-level threshold.
Testing nonsingularity by determinant magnitude	high	A determinant that underflows to zero is read as singularity, or a large determinant as good conditioning.	Use a factorisation with a condition estimate. The determinant scales with the product of the singular values and carries no conditioning information.
Over-constraining a deficient system	medium	More constraints are applied than the deficiency requires, introducing spurious reactions or biasing the solution.	Compute $d$ and add exactly $d$ independent constraints, checking that they are independent of the existing rows.
Adding a constraint that lies in the row space	medium	An extra equation is supplied that is a combination of existing ones, so the rank does not increase and the matrix remains singular.	Verify that each added constraint raises the rank; equivalently, check it is not orthogonal to the null space basis before relying on it.
Regularising to hide a modelling omission	medium	A small multiple of the identity is added to make a stiffness or admittance matrix invertible, masking a missing boundary condition or reference node.	Inspect the null space first. If its vectors correspond to physical rigid-body or reference modes, supply the missing constraint instead of regularising.
Assuming symmetry implies nonsingularity	medium	A symmetric matrix is presumed invertible because symmetric matrices are well behaved in other respects.	Symmetry guarantees real eigenvalues, not non-zero ones. Test positive definiteness by attempting a Cholesky factorisation, which fails precisely when the assumption does not hold.
Reusing a nonsingularity verdict after the matrix changes	low	A cached certificate is applied to a matrix whose entries have since been updated by a parameter change or a re-assembly.	Tie the certificate to a version or hash of the matrix data and invalidate it on any modification.

FAQs

Why does rank

n

imply nullity zero for a square matrix?

Because rank and nullity always sum to the number of columns, which for a square matrix of size $n$ is $n$ . If the rank attains its maximum $n$ , the nullity is forced to $n - n = 0$ . The implication runs both ways, which is why either quantity alone settles the question.

Does this equivalence hold for rectangular matrices?

No. Nonsingularity is undefined for a rectangular matrix, and the two halves come apart. A tall matrix can have nullity zero while its column space is a proper subspace, so most systems are unsolvable. A wide matrix always has positive nullity, so solutions are never unique. Only in the square case do the two notions of full rank coincide.

What does a nullity of three tell me about a stiffness matrix?

That three independent displacement patterns produce no internal forces, which for an unrestrained plane structure are the two translations and one rotation. The remedy is to apply exactly three independent restraints. The null space basis identifies which motions are unconstrained, so the restraints can be chosen to remove precisely those.

Can a matrix be nonsingular and still unusable numerically?

Routinely. Nonsingularity is a discontinuous property that almost every floating-point matrix satisfies, while usefulness depends on the condition number. A matrix with $\kappa(A) = 10^{15}$ is nonsingular but leaves roughly one correct significant digit in binary64. Report the condition number with the verdict, and set a threshold appropriate to the application.

Why should I not just compute the determinant?

Because the determinant is the product of the singular values and therefore scales like the $n$ -th power of a typical entry. For moderate $n$ it overflows or underflows even for well-conditioned matrices, and its magnitude carries no information about conditioning. A diagonal matrix of size 200 with entries $10^{-2}$ has a determinant below the smallest representable double while being perfectly conditioned.

How many extra constraints do I need to fix a singular system?

Exactly the rank deficiency $d$ , and they must be independent of the existing rows. Fewer leaves the matrix singular; more over-determines the system and introduces spurious reactions. Checking independence means confirming that each new constraint is not orthogonal to the null space, which the null space basis makes immediate.

Is there a cheap way to certify nonsingularity without factorising?

For structured matrices, yes. Strict diagonal dominance guarantees nonsingularity and can be checked in $O(n^2)$ by inspection, and a successful Cholesky factorisation certifies a symmetric matrix as positive definite and therefore nonsingular. Both are properties of whole families of matrices arising from a modelling assumption, so the certificate can be established once at design time.

References

Beezer, R. A. A First Course in Linear Algebra, Version 0.70. University of Puget Sound, 2006. Section D, subsection RNNSM. Licensed under the GNU Free Documentation License v1.2.
ISO 80000-2:2019, Quantities and units — Part 2: Mathematics. International Organization for Standardization.
IEEE 754-2019, IEEE Standard for Floating-Point Arithmetic. Institute of Electrical and Electronics Engineers.
IEEE 1788-2015, IEEE Standard for Interval Arithmetic. Institute of Electrical and Electronics Engineers.
Higham, N. J. Accuracy and Stability of Numerical Algorithms, 2nd edition. Society for Industrial and Applied Mathematics, 2002.
Anderson, E. et al. LAPACK Users' Guide, 3rd edition. Society for Industrial and Applied Mathematics, 1999.

AI Suggested Questions

Show me a 5x5 matrix that is nonsingular but has a condition number above 10^13, and demonstrate how far the computed solution drifts.
Assemble an unrestrained plane truss stiffness matrix and confirm that its nullity is exactly three, identifying each rigid-body mode.
Explain why strict diagonal dominance guarantees nonsingularity, and give a matrix that is nonsingular without being diagonally dominant.
Compare LU with a condition estimate against SVD for deciding whether a 1000x1000 system matrix should be trusted.
For a singular 6x6 matrix with deficiency 2, work out the minimal set of extra constraints that restores nonsingularity.
How does invertibility of a matrix over the integers modulo 26 differ from invertibility over the rationals, using a Hill cipher key as the example?

Related Calculators

Nonsingularity Tester

Row-reduce a square matrix, report rank, nullity and deficiency, and return the null space basis when the matrix is singular.

Matrix Condition Number Calculator

Estimate $\kappa(A)$ and the smallest singular value, and report how many significant digits of a solution survive in binary64.

Rank Deficiency Diagnoser

Identify how many independent constraints a singular system is missing and which directions they must address.

Matrix Inverse Calculator

Compute $A^{-1}$ when the matrix is nonsingular, with a residual check on $AA^{-1} - I_n$ and a conditioning warning.

Overview

Definition

Rank and Nullity of a Nonsingular Matrix

Full Rank

Rank Deficiency

Nonsingular Matrix Equivalences

Concepts

Proving the three-way equivalence as a cycle

Why the square hypothesis cannot be dropped

The equivalence chain as an engineering toolkit

Reading a deficiency rather than a flag

Near-singularity: the continuous replacement for the test

Structured matrices and cheaper certificates

Decision path: is a square matrix nonsingular, and if not, how badly?

Equations

Variable Definitions

Worked Numerical Example

Problem statement

State the first conductance matrix

Reduce and count the pivots

Report the rank, nullity and verdict

Introduce the modelling change

Reduce the modified matrix

Quantify the deficiency

Identify the lost direction

Verify the null vector against the original matrix

Prescribe the remedy from the deficiency

Applications &amp; Industry Use

Reference node in nodal analysis

Rigid-body modes in an unrestrained stiffness matrix

Manipulator Jacobian singularities

Invertible key matrices over a finite field

Identifiability from an information matrix

Pressure level in incompressible flow

Design Considerations

The binary test is necessary but rarely sufficient

Interpret the deficiency, do not merely detect it

Prefer structural certificates where they apply

Do not test nonsingularity by computing a determinant

Restore rank by adding information, not by regularising away the symptom

Keep the square and rectangular cases separate

Standards &amp; Codes

Material Selection

Manufacturing Notes

Cost of the test

Hand procedure and early termination

Library behaviour and error signalling

Verifying a nonsingularity verdict

Improving an accurate-but-conditioned solve

Failure Modes &amp; Common Mistakes

FAQs

Related Engineering Topics

References

AI Suggested Questions

Related Calculators

Continue learning

Applications & Industry Use

Standards & Codes

Failure Modes & Common Mistakes