Notes
Categories

Singular Matrices in Discrete Mathematics [ English ]

< Prev Next >

1. Introduction to Matrices

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.


2. Definition of Singular Matrix

A singular matrix is a square matrix whose determinant is equal to zero.

Formal Definition:

A square matrix A is said to be singular if:

det(A) = 0

3. Meaning of Singularity

When a matrix is singular:


4. Example of Singular Matrix

Consider the matrix:

A = | 1  2 |
    | 2  4 |

Step 1: Compute Determinant

For a 2×2 matrix:

det(A) = (1 × 4) − (2 × 2)
       = 4 − 4
       = 0

Conclusion:

Since det(A) = 0, the matrix is singular.


5. Why is this Matrix Singular?

Observe the rows:

This means:


6. General Condition for Singularity

A matrix is singular if:


7. Geometric Interpretation

A singular matrix represents a transformation that:


8. Singular vs Non-Singular Matrix

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

9. Applications in Discrete Mathematics

(a) Graph Theory

(b) Systems of Equations

(c) Computer Science


10. Key Observations


11. Summary

< Prev Next >