A matrix is a rectangular array of numbers arranged in rows and columns. A matrix with $m$ rows and $n$ columns is said to have order $m\times n$, and the entry in row $i$, column $j$ is written $a_{ij}$. Matrices give us a compact language for systems of equations, transformations and data tables.
Special types
| Type | Defining condition |
|---|---|
| Row matrix | only one row ($1\times n$) |
| Column matrix | only one column ($m\times 1$) |
| Square matrix | $m=n$ |
| Diagonal matrix | square, all off-diagonal entries $0$ |
| Scalar matrix | diagonal with all diagonal entries equal |
| Identity $I_n$ | scalar matrix with diagonal entries $1$ |
| Zero matrix $O$ | every entry $0$ |
Equality of matrices
Two matrices are equal only if they have the same order and every corresponding entry is equal: $A=B \iff a_{ij}=b_{ij}$ for all $i,j$. This single idea turns one matrix equation into a set of scalar equations — the standard way "find $x,y$" problems are solved.
How many entries?
An $m\times n$ matrix has $mn$ entries. If you must build a matrix with exactly $12$ entries, the possible orders are the factor pairs of $12$: $1\times12,\ 2\times6,\ 3\times4,\ 4\times3,\ 6\times2,\ 12\times1$ — six in all.