The study of matrices is a fundamental pillar of modern mathematics, providing compact methods for solving systems of linear equations and representing linear transformations. Matrices are widely utilized in computer graphics, cryptography, genetics, economics, and industrial management.
A matrix is an ordered rectangular array of numbers or functions. The numbers or functions are called the elements or the entries of the matrix. We denote matrices by capital letters (e.g., $A, B, C$).
In general, an $m \times n$ matrix has the following rectangular array representation:
$$A = \begin{bmatrix} a_{11} & a_{12} & \dots & a_{1j} & \dots & a_{1n} \\ a_{21} & a_{22} & \dots & a_{2j} & \dots & a_{2n} \\ \vdots & \vdots & & \vdots & & \vdots \\ a_{i1} & a_{i2} & \dots & a_{ij} & \dots & a_{in} \\ \vdots & \vdots & & \vdots & & \vdots \\ a_{m1} & a_{m2} & \dots & a_{mj} & \dots & a_{mn} \end{bmatrix}_{m \times n}$$Or compactly as $A = [a_{ij}]_{m \times n}$, where $1 \le i \le m$ and $1 \le j \le n$ ($i, j \in \mathbb{N}$). Here, $a_{ij}$ represents the element lying in the $i^{\text{th}}$ row and $j^{\text{th}}$ column.
A matrix having $m$ rows and $n$ columns is called a matrix of order $m \times n$ (read as "m by n" matrix). The total number of elements in an $m \times n$ matrix is equal to the product $mn$.
Mathematical Problem Statement: Construct a $3 \times 2$ matrix whose elements are given by $a_{ij} = \frac{1}{2}|i - 3j|$.
Step-by-Step Algorithmic Solution Trace:
- Identify the general form of a $3 \times 2$ matrix: $A = \begin{bmatrix} a_{11} & a_{12} \\ a_{21} & a_{22} \\ a_{31} & a_{32} \end{bmatrix}$.
- Compute each element using the formula $a_{ij} = \frac{1}{2}|i - 3j|$ for $i \in \{1, 2, 3\}$ and $j \in \{1, 2\}$:
- $a_{11} = \frac{1}{2}|1 - 3(1)| = \frac{1}{2}|-2| = 1$
- $a_{12} = \frac{1}{2}|1 - 3(2)| = \frac{1}{2}|-5| = \frac{5}{2}$
- $a_{21} = \frac{1}{2}|2 - 3(1)| = \frac{1}{2}|-1| = \frac{1}{2}$
- $a_{22} = \frac{1}{2}|2 - 3(2)| = \frac{1}{2}|-4| = 2$
- $a_{31} = \frac{1}{2}|3 - 3(1)| = \frac{1}{2}|0| = 0$
- $a_{32} = \frac{1}{2}|3 - 3(2)| = \frac{1}{2}|-3| = \frac{3}{2}$
Final Evaluation Output: $A = \begin{bmatrix} 1 & \frac{5}{2} \\ \frac{1}{2} & 2 \\ 0 & \frac{3}{2} \end{bmatrix}$
Matrices are classified into various types based on their structural configurations, dimensions, and element distributions.
| Matrix Type | Mathematical Definition / Structural Properties | Example Representation | Systemic Role & Constraints |
|---|---|---|---|
| Column Matrix | Has only one column: order $m \times 1$. Compact form: $A = [a_{ij}]_{m \times 1}$. | $\begin{bmatrix} 0 \\ \sqrt{3} \\ -1 \end{bmatrix}$ | Used to represent vectors in coordinate spaces. |
| Row Matrix | Has only one row: order $1 \times n$. Compact form: $B = [b_{ij}]_{1 \times n}$. | $\begin{bmatrix} -\frac{1}{2} & \sqrt{5} & 2 \end{bmatrix}$ | Represents row vectors or single-point coordinates. |
| Square Matrix | Number of rows equals number of columns: $m = n$. Order is simply referred to as $n$. | $\begin{bmatrix} 3 & -1 \\ 2 & 5 \end{bmatrix}$ | Forms the basis for determinants, inverses, and eigenvalues. Diagonal elements are $a_{ii}$. |
| Diagonal Matrix | A square matrix where all non-diagonal elements are zero: $b_{ij} = 0$ when $i \neq j$. | $\begin{bmatrix} -1.1 & 0 \\ 0 & 2 \end{bmatrix}$ | Simplifies matrix multiplication and power computations. |
| Scalar Matrix | A diagonal matrix whose diagonal elements are all equal: $b_{ij} = 0$ for $i \neq j$, and $b_{ii} = k$ (constant). | $\begin{bmatrix} \sqrt{3} & 0 \\ 0 & \sqrt{3} \end{bmatrix}$ | Acts as a scalar multiplier within matrix algebra. |
| Identity Matrix | A square matrix where diagonal elements are all $1$ and rest are $0$: $a_{ij} = 1$ if $i = j$, and $a_{ij} = 0$ if $i \neq j$. Denoted by $I_n$. | $\begin{bmatrix} 1 & 0 \\ 0 & 1 \end{bmatrix}$ | Serves as the multiplicative identity element: $AI = IA = A$. |
| Zero Matrix | All elements are zero. Denoted by $O$. Can be of any order $m \times n$. | $\begin{bmatrix} 0 & 0 \\ 0 & 0 \end{bmatrix}$ | Serves as the additive identity element: $A + O = A$. |
Two matrices $A = [a_{ij}]$ and $B = [b_{ij}]$ are said to be equal ($A = B$) if and only if:
Mathematical Problem Statement: Find the values of $a, b, c,$ and $d$ from the equation: $\begin{bmatrix} 2a + b & a - 2b \\ 5c - d & 4c + 3d \end{bmatrix} = \begin{bmatrix} 4 & -3 \\ 11 & 24 \end{bmatrix}$.
Step-by-Step Algorithmic Solution Trace:
- Equate corresponding elements to set up a system of linear equations:
- $2a + b = 4 \quad \text{--- (1)}$
- $a - 2b = -3 \quad \text{--- (2)}$
- $5c - d = 11 \quad \text{--- (3)}$
- $4c + 3d = 24 \quad \text{--- (4)}$
- Solve equations (1) and (2) for $a$ and $b$:
- From (1), $b = 4 - 2a$. Substitute into (2): $a - 2(4 - 2a) = -3 \implies 5a - 8 = -3 \implies 5a = 5 \implies a = 1$.
- Substitute $a = 1$ back: $b = 4 - 2(1) = 2$.
- Solve equations (3) and (4) for $c$ and $d$:
- From (3), $d = 5c - 11$. Substitute into (4): $4c + 3(5c - 11) = 24 \implies 19c - 33 = 24 \implies 19c = 57 \implies c = 3$.
- Substitute $c = 3$ back: $d = 5(3) - 11 = 4$.
Final Evaluation Output: $a = 1, b = 2, c = 3, d = 4$
Matrix algebra defines operations such as addition, scalar multiplication, subtraction, and matrix multiplication under specific dimensional constraints.
For matrices $A, B, C$ of the same order and scalars $k, l$:
| Property Name | Mathematical Formulation | Description / Constraints |
|---|---|---|
| Commutative Law | $A + B = B + A$ | Order of addition does not affect the resulting matrix. |
| Associative Law | $(A + B) + C = A + (B + C)$ | Grouping of matrices during addition does not affect the result. |
| Existence of Additive Identity | $A + O = O + A = A$ | The zero matrix $O$ acts as the identity element for addition. |
| Existence of Additive Inverse | $A + (-A) = (-A) + A = O$ | $-A$ is the unique additive inverse of $A$. |
| Distributive Law (Scalar) | $k(A + B) = kA + kB$ | Scalar multiplication distributes over matrix addition. |
| Distributive Law (Matrix) | $(k + l)A = kA + lA$ | Matrix multiplication distributes over scalar addition. |
The product $AB$ of two matrices $A$ and $B$ is defined if and only if the number of columns in $A$ is equal to the number of rows in $B$.
If $A = [a_{ij}]_{m \times n}$ and $B = [b_{jk}]_{n \times p}$, then their product $C = AB$ is an $m \times p$ matrix where each entry $c_{ik}$ is computed as:
$$c_{ik} = \sum_{j=1}^{n} a_{ij}b_{jk} = a_{i1}b_{1k} + a_{i2}b_{2k} + \dots + a_{in}b_{nk}$$The transpose of a matrix is formed by interchanging its rows and columns, altering its dimensions and structural properties.
If $A = [a_{ij}]_{m \times n}$, then the transpose of A, denoted by $A'$ or $A^T$, is defined as $A' = [a_{ji}]_{n \times m}$.
The transpose operation satisfies the following properties for any matrices $A$ and $B$ of suitable orders:
Square matrices exhibit unique properties under transpose operations, leading to symmetric and skew-symmetric classifications.
A square matrix $A$ is said to be symmetric if $A' = A$ (i.e., $a_{ij} = a_{ji}$ for all $i, j$).
A square matrix $A$ is said to be skew-symmetric if $A' = -A$ (i.e., $a_{ji} = -a_{ij}$ for all $i, j$).
Setting $i = j$ yields $a_{ii} = -a_{ii} \implies 2a_{ii} = 0 \implies a_{ii} = 0$. Thus, all diagonal elements of a skew-symmetric matrix are zero.
Mathematical Problem Statement: Express the matrix $B = \begin{bmatrix} 2 & -2 & -4 \\ -1 & 3 & 4 \\ 1 & -2 & -3 \end{bmatrix}$ as the sum of a symmetric and a skew-symmetric matrix.
Step-by-Step Algorithmic Solution Trace:
- Compute the transpose of $B$: $B' = \begin{bmatrix} 2 & -1 & 1 \\ -2 & 3 & -2 \\ -4 & 4 & -3 \end{bmatrix}$.
- Compute the symmetric part $P = \frac{1}{2}(B + B')$:$$P = \frac{1}{2} \left( \begin{bmatrix} 2 & -2 & -4 \\ -1 & 3 & 4 \\ 1 & -2 & -3 \end{bmatrix} + \begin{bmatrix} 2 & -1 & 1 \\ -2 & 3 & -2 \\ -4 & 4 & -3 \end{bmatrix} \right) = \begin{bmatrix} 2 & -\frac{3}{2} & -\frac{3}{2} \\ -\frac{3}{2} & 3 & 1 \\ -\frac{3}{2} & 1 & -3 \end{bmatrix}$$Verify $P' = P$ (Symmetric).
- Compute the skew-symmetric part $Q = \frac{1}{2}(B - B')$:$$Q = \frac{1}{2} \left( \begin{bmatrix} 2 & -2 & -4 \\ -1 & 3 & 4 \\ 1 & -2 & -3 \end{bmatrix} - \begin{bmatrix} 2 & -1 & 1 \\ -2 & 3 & -2 \\ -4 & 4 & -3 \end{bmatrix} \right) = \begin{bmatrix} 0 & -\frac{1}{2} & -\frac{5}{2} \\ \frac{1}{2} & 0 & 3 \\ \frac{5}{2} & -3 & 0 \end{bmatrix}$$Verify $Q' = -Q$ (Skew-Symmetric).
- Verify that $P + Q = B$:$$\begin{bmatrix} 2 & -\frac{3}{2} & -\frac{3}{2} \\ -\frac{3}{2} & 3 & 1 \\ -\frac{3}{2} & 1 & -3 \end{bmatrix} + \begin{bmatrix} 0 & -\frac{1}{2} & -\frac{5}{2} \\ \frac{1}{2} & 0 & 3 \\ \frac{5}{2} & -3 & 0 \end{bmatrix} = \begin{bmatrix} 2 & -2 & -4 \\ -1 & 3 & 4 \\ 1 & -2 & -3 \end{bmatrix}$$
Final Evaluation Output: $B = P + Q$, where $P$ is symmetric and $Q$ is skew-symmetric as computed above.
Invertibility is a property of square matrices analogous to reciprocals in real number algebra.
If $A$ is a square matrix of order $m$, and if there exists another square matrix $B$ of the same order $m such that $AB = BA = I$, then $B$ is called the inverse of $A$ (denoted by $A^{-1}$). In this case, $A$ is said to be invertible.
Note: A rectangular matrix does not possess an inverse matrix because the products $AB$ and $BA$ cannot both be defined and equal.
Historical Chronicle / Epigraph: Arthur Cayley & Georg Cantor