Nonsingular Matrix — Definition, Formula & Examples
A nonsingular matrix is a square matrix whose determinant is not zero, which guarantees that its inverse exists. It is also called an invertible or non-degenerate matrix.
A square matrix of order is nonsingular if and only if , or equivalently, if there exists a matrix such that , where is the identity matrix.
Key Formula
Where:
- = A square matrix of order n × n
- = The determinant of A
- = The multiplicative inverse of A
How It Works
To determine whether a matrix is nonsingular, compute its determinant. If the determinant is nonzero, the matrix is nonsingular and you can find its inverse. A nonsingular matrix has full rank, meaning all its rows (and columns) are linearly independent. In the context of a linear system , a nonsingular coefficient matrix guarantees exactly one solution: .
Worked Example
Problem: Determine whether the matrix A is nonsingular, where A = [[2, 3], [1, 4]].
Compute the determinant: For a 2×2 matrix [[a, b], [c, d]], the determinant is ad − bc.
Check if the determinant is nonzero: Since det(A) = 5 ≠ 0, the matrix is nonsingular and its inverse exists.
Answer: A is nonsingular because det(A) = 5 ≠ 0. Its inverse is (1/5)[[4, −3], [−1, 2]].
Why It Matters
Nonsingularity is the key condition for solving linear systems uniquely. In engineering and data science, checking whether a matrix is nonsingular determines if a system of equations has a single solution. Techniques like Cramer's Rule and computing matrix inverses require the coefficient matrix to be nonsingular.
Common Mistakes
Mistake: Assuming a matrix with no zero entries must be nonsingular.
Correction: A matrix can have all nonzero entries yet still be singular. For example, [[1, 2], [2, 4]] has det = 0 because the rows are proportional. Always compute the determinant to check.
