A diagonal matrix has non-zero elements only on its main diagonal. All other entries must be 0: $\begin{bmatrix} \color{red}a & 0 & 0 \\ 0 & \color{red}b & 0 \\ 0 & 0 & \color{red}c \end{bmatrix}$.
 These matrices are particularly easy to work with as operations like multiplication become simple element-wise operations on the diagonal.

The identity matrix acts like the number 1 in multiplication - any matrix multiplied by identity stays unchanged. $I_n = \begin{bmatrix} \color{red}1 & 0 & 0 \\ 0 & \color{red}1 & 0 \\ 0 & 0 & \color{red}1 \end{bmatrix}$.
 Just as 1 is the neutral element for multiplication of numbers, the identity matrix is the neutral element for matrix multiplication.

Lower triangular matrices have all entries above the main diagonal equal to 0. The entries below can be any number: $\begin{bmatrix} \color{red}a & 0 & 0 \\ \color{red}b & \color{red}c & 0 \\ \color{red}d & \color{red}e & \color{red}f \end{bmatrix}$.
 These matrices are fundamental in LU decomposition and Gaussian elimination.

A random matrix has entries chosen at random, often from a specific probability distribution. Here's an example: $\begin{bmatrix} 3 & 7 & 2 \\ 5 & 1 & 9 \\ 4 & 6 & 8 \end{bmatrix}$.
 These matrices are essential in statistical analysis, quantum mechanics, and machine learning, especially for initializing neural networks.

A scalar matrix is an identity matrix multiplied by some number λ. It always takes the form: $\begin{bmatrix} \color{red}λ & 0 & 0 \\ 0 & \color{red}λ & 0 \\ 0 & 0 & \color{red}λ \end{bmatrix}$ For example, when λ = 3: $\begin{bmatrix} 3 & 0 & 0 \\ 0 & 3 & 0 \\ 0 & 0 & 3 \end{bmatrix}$.
 These matrices commute with all other matrices of compatible size.

In a skew-symmetric matrix, each entry (i,j) equals the negative of entry (j,i). The main diagonal must be 0: $\begin{bmatrix} 0 & \color{red}a & \color{red}b \\ \color{red}{-a} & 0 & \color{red}c \\ \color{red}{-b} & \color{red}{-c} & 0 \end{bmatrix}$.
 These matrices represent rotations and angular velocities in physics.

A symmetric matrix is equal to its transpose - it mirrors across its main diagonal. If entry (i,j) is x, then entry (j,i) must also be x: $\begin{bmatrix} a & \color{red}b & \color{blue}c \\ \color{red}b & d & \color{green}e \\ \color{blue}c & \color{green}e & f \end{bmatrix}$.
 These matrices are crucial in optimization and quadratic forms. Notice how elements of the same color must be equal, showing the mirror property across the diagonal.

Upper triangular matrices have all entries below the main diagonal equal to 0. The entries above can be any number: $\begin{bmatrix} \color{red}a & \color{red}b & \color{red}c \\ 0 & \color{red}d & \color{red}e \\ 0 & 0 & \color{red}f \end{bmatrix}$.
 These matrices appear naturally in many matrix decomposition methods.

The zero matrix is the matrix equivalent of the number 0. Every entry is zero, making it the additive identity for matrices. $0 = \begin{bmatrix} 0 & 0 & 0 \\ 0 & 0 & 0 \\ 0 & 0 & 0 \end{bmatrix}$.
 Adding or subtracting a zero matrix from any matrix leaves the original matrix unchanged.

Visual Tools

Calculators

Generators

Converters

Tables

Other Tools

Square Matrix Types Generator