Singular matrix

An invertible matrix helps in the algorithm by providing an assumption that certain transformations, computations and systems can be reversed and solved uniquely, like Ax = B to x = A^{-1}B. This helps solver to make sure if a solution is unique or not. In Gaussian elimination, invertibility of the coefficient matrix A ensures the algorithm produces a unique solution. For example, when matrix is invertible the pivots are non-zero, allowing one to row swap if necessary and solve the system, however in case of a singular matrix, some pivots can be zero which can not be fixed by mere row swaps. This imposes a problem where the elimination either breaks or gives an inconsistent result. One more problem a singular matrix produces when solving a Gaussian Elimination is that it can not solve the back substitution because to back substitute the diagonal entries of the A matrix must be non-zero, i.e. \det(A)\neq0. However, in case of singular matrix the result is often infinitely many solutions. == 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 X leads to a singular covariance or X^TX matrix if features are linearly dependent. This occurs in linear regression when predictors are collinear, causing the normal equations matrix X^TX 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. == 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 \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 A = \begin{bmatrix} 1 & -3 \\ 2 & -6 \end{bmatrix}. As the second column is a multiple of the first, the determinant is zero, and so is singular. Alternatively, applying Gaussian elimination on A\vec{x} = \vec{b}, \left[\begin{array}{rr|r} 1 & -3 & a \\ 2 & -6 & b \end{array}\right] \to \left[\begin{array}{rr|r} 1 & -3 & a \\ 0 & 0 & b - 2a \end{array}\right], we see \operatorname{rank}(A) , constraints b - 2a = 0, and multiple solutions x - 3y = a, unlike invertible matrices with unique solutions. == References ==