In discrete mathematics, matrices are widely used to represent and manipulate data, especially in areas such as graph theory, relations, and computer algorithms. A matrix is a rectangular arrangement of numbers organized in rows and columns.
Among different types of matrices, an important classification is based on whether a matrix is singular or non-singular.
A singular matrix is a square matrix whose determinant is equal to zero.
A square matrix A is said to be singular if:
det(A) = 0
When a matrix is singular:
Consider the matrix:
A = | 1 2 |
| 2 4 |
For a 2×2 matrix:
det(A) = (1 × 4) − (2 × 2)
= 4 − 4
= 0
Since det(A) = 0, the matrix is singular.
Observe the rows:
This means:
A matrix is singular if:
A singular matrix represents a transformation that:
Collapses space into a lower dimension
Example:
| Feature | Singular Matrix | Non-Singular Matrix |
|---|---|---|
| Determinant | 0 | Non-zero |
| Inverse | Does not exist | Exists |
| Rows/Columns | Dependent | Independent |
| Solutions (Ax = b) | No unique solution | Unique solution |
Determines whether a system has: