In linear algebra, we divide square matrices into types based on their structural properties.Oftentimes, these types overlap, and a single matrix may belong to more than one category simultaneously.
The structural properties that define these categories - such as symmetry, orthogonality, or triangularity - can coexist within the same matrix, making the classification system interconnected rather than mutually exclusive.
For a better overview of the relationships between different types of square matrices, visit this page.
Being square matrix with elements of the main diagonal equal to 1 and all the rest equal to 0, identity matrix also qualifies for:
Diagonal Matrix: The identity matrix has elements aᵢⱼ = 0 for all i ≠ j and aᵢᵢ = 1, which fits the definition of diagonal matrix requiring all non-diagonal elements to be zero. This diagram shows the exact nature of relations between diagonal and identity matrices (and other types ) visually.Scalar Matrix: The identity matrix has equal elements λ = 1 on its main diagonal and zeros elsewhere, matching the form λI of scalar matrices.Symmetric Matrix: For identity matrix, aᵢⱼ = aⱼᵢ for all i,j since all off-diagonal elements are 0 and diagonal elements are all 1.Upper Triangular: The identity matrix has all elements below main diagonal equal to 0, satisfying the definition of upper triangular.Lower Triangular: The identity matrix has all elements above main diagonal equal to 0, satisfying the definition of lower triangular.
On the other hand, Identity Matrix never satisfies definition of :
Zero Matrix: The zero matrix requires all elements to be 0, while identity matrix must have 1s on main diagonal.
Skew-Symmetric Matrix: A skew-symmetric matrix requires aᵢⱼ = -aⱼᵢ for all i,j, which identity matrix violates with 1s on diagonal.