Singular matrix

Applications

In mechanical and robotic systems, singular Jacobian matrices indicate kinematic singularities. For example, the Jacobian of a robotic manipulator (mapping joint velocities to end-effector velocity) loses rank when the robot reaches a configuration with constrained motion. At a singular configuration, the robot cannot move or apply forces in certain directions.

In graph theory and network physics, the Laplacian matrix of a graph is inherently singular (it has a zero eigenvalue) because each row sums to zero. This reflects the fact that the uniform vector is in its nullspace.

In machine learning and statistics, singular matrices frequently appear due to multicollinearity. For instance, a data matrix ${\displaystyle X}$ leads to a singular covariance or ${\displaystyle X^{T}X}$ matrix if features are linearly dependent. This occurs in linear regression when predictors are collinear, causing the normal equations matrix ${\displaystyle X^{T}X}$ to be singular. The remedy is often to drop or combine features, or use the pseudoinverse. Dimension-reduction techniques like Principal Component Analysis (PCA) exploit SVD: singular value decomposition yields low-rank approximations of data, effectively treating the data covariance as singular by discarding small singular values.

Certain transformations (e.g. projections from 3D to 2D) are modeled by singular matrices, since they collapse a dimension. Handling these requires care (one cannot invert a projection). In cryptography and coding theory, invertible matrices are used for mixing operations; singular ones would be avoided or detected as errors.

History

The study of singular matrices is rooted in the early history of linear algebra. Determinants were first developed in Japan by Seki in 1683 and in Europe by Leibniz and Cramer in the 1690s as tools for solving systems of equations. Leibniz explicitly recognized that a system has a solution precisely when a certain determinant expression equals zero. In that sense, singularity (determinant zero) was understood as the critical condition for solvability. Over the 18th and 19th centuries, mathematicians (Laplace, Cauchy, etc.) established many properties of determinants and invertible matrices, formalizing the notion that ${\displaystyle det(A)=0}$ characterizes non-invertibility.

The term "singular matrix" itself emerged later, but the conceptual importance remained. In the 20th century, generalizations like the Moore–Penrose pseudoinverse were introduced to systematically handle singular or non-square cases. As recent scholarship notes, the idea of a pseudoinverse was proposed by E. H. Moore in 1920 and rediscovered by R. Penrose in 1955, reflecting its longstanding utility. The pseudoinverse and singular value decomposition became fundamental in both theory and applications (e.g. in quantum mechanics, signal processing, and more) for dealing with singularity. Today, singular matrices are a canonical subject in linear algebra: they delineate the boundary between invertible (well-behaved) cases and degenerate (ill-posed) cases. In abstract terms, singular matrices correspond to non-isomorphisms in linear mappings and are thus central to the theory of vector spaces and linear transformations.

Example

Consider ${\displaystyle A=\left[\begin{array}{cc}1& -3\\ 2& -6\end{array}\right]}$. As the second column is a multiple of the first, the determinant is zero, and so is singular. Alternatively, applying Gaussian elimination on ${\displaystyle A\overrightarrow{x}=\overrightarrow{b}}$,

$${\displaystyle \left[\begin{array}{rrr}1& -3& a\\ 2& -6& b\end{array}\right]\to \left[\begin{array}{rrr}1& -3& a\\ 0& 0& b-2a\end{array}\right],}$$

we see ${\displaystyle \mathrm{rank}(A)<2}$, constraints ${\displaystyle b-2a=0}$, and multiple solutions ${\displaystyle x-3y=a}$, unlike invertible matrices with unique solutions.