Matrix, Order and the Addressing Scheme
What a matrix is
A matrix is a rectangular array of numbers (or functions), arranged in rows and columns and enclosed in brackets. The entries are its elements. Matrices compress bookkeeping: the numbers of men and women in three families, the marks of a class in four subjects, the coefficients of a system of equations — each becomes a single object that can be computed with.
Order and addressing

A matrix with rows and columns has order (read " by " — rows first, always) and elements. We write where is the entry sitting in row , column . So lives in the second row, third column — the first subscript never means column.
Counting possible orders. A matrix with 8 elements can have any order with : namely — one order per ordered factor pair. A matrix with a prime number of elements (say 13) has only the two extreme orders and .
Building a matrix from a rule
Exam staple: construct the matrix whose entries obey a formula.
Worked construction. Build the matrix with .
Step 1 — list the addresses: rows and columns .
Step 2 — evaluate each:
Step 3 — assemble (rows across, columns down): first row ; second row ; third row .
The only real danger is swapping and — always evaluate with the address order (row, column).
Types of Matrices and Equality
The type gallery
Column matrix — one column, order . Row matrix — one row, order .
Square matrix — rows columns, called "of order ". Its entries form the diagonal.
Diagonal matrix — square with every off-diagonal entry zero: for . (Diagonal entries may be anything, including zero.)
Scalar matrix — a diagonal matrix whose diagonal entries are all equal to some constant .
Identity matrix — the scalar matrix with : ones on the diagonal, zeros elsewhere. Every identity matrix is scalar; a scalar matrix is an identity matrix only when .
Zero (null) matrix — all entries zero, of any order (not necessarily square).
The chain worth remembering:
Equality of matrices
Definition. and are equal exactly when (i) they have the same order, and (ii) for every address .
Equality is entry-by-entry, so a single matrix equation unpacks into a system of scalar equations — the chapter's standard "find the values" problem.
Worked unpacking. Find if
Step 1 — equate corresponding entries: , , , .
Step 2 — solve in a smart order: subtracting the first from the third: ; then , , .
Answer: .
Consistency matters. If the system unpacked from a matrix equation is inconsistent, the matrices simply cannot be equal for any values — "not possible to find" is then the correct answer, and one such question is famous enough to appear in the exercises.
Common mistakes to avoid
Mistake 1 — reading as (column, row). The first index is the row. and are different entries.
Mistake 2 — order written backwards. A matrix with 3 rows and 4 columns is , never .
Mistake 3 — comparing matrices of different orders. A matrix is never equal to a matrix, however similar the entries look.
Mistake 4 — 'diagonal' in a non-square matrix. The diagonal, and hence diagonal/scalar/identity types, exist only for square matrices; the zero matrix is the one special type of arbitrary shape.
Mistake 5 — solving only some of the unpacked equations. Every entry gives an equation; a candidate solution must satisfy all of them (else the correct verdict may be "not possible").
Solved Examples
Example 1 — Reading off order and entries
For , find (i) the order, (ii) the number of elements, (iii) the entries .
Step 1 — order: 3 rows, 4 columns: .
Step 2 — count: elements.
Step 3 — address each entry (row first):
Answer: order ; 12 elements; values as above.
Example 2 — Counting possible orders
If a matrix has 8 elements, what are its possible orders? What if it has 5 elements?
Step 1 — factor pairs of 8: — four possible orders.
Step 2 — 5 is prime: only and — two orders.
Answer: 8 elements allow ; 5 elements allow only and . (Ordered pairs: and are different orders.)
Example 3 — Construction from a rule
Construct the matrix with .
Step 1 — evaluate all four addresses:
Step 2 — assemble:
Answer: as above — note the symmetry, inevitable since the rule depends only on .
Example 4 — A data matrix
A shop stocks 15 red pens, 20 blue pens in its first branch and 12 red, 28 blue in its second. Record the stock as a matrix and state what represents.
Step 1 — choose the convention: rows = branches, columns = colours (red, blue):
Step 2 — interpret: is the entry in row 2 (second branch), column 1 (red pens).
Answer: = red pens in the second branch. A matrix is only meaningful together with its row/column convention — state it.
Example 5 — Classify the types
Classify: , , , , .
Step 1 — work down the chain: all five are square. : off-diagonal zeros, unequal diagonal → diagonal (not scalar). : diagonal with equal entries 4 → scalar (not identity). : scalar with → identity. : all zeros → zero matrix (also diagonal and scalar with ). : a matrix is simultaneously diagonal and scalar.
Answer: diagonal, scalar, identity, zero — the gallery in action, with the inclusions identity scalar diagonal visible.
Example 6 — Equality: solving the system
Find if .
Step 1 — unpack: , , (and is automatic).
Step 2 — solve: ; and , make the roots of : .
Answer: and (either assignment) — matrix equality routinely produces small nonlinear systems like this.
Example 7 — Equality: the inconsistent case
Can values of and make and equal?
Step 1 — unpack all four equations: , , , .
Step 2 — test consistency: the first gives ; the fourth gives — contradiction (the two -equations agree on , but cannot satisfy both of its equations).
Answer: not possible — no values of and make the matrices equal. Checking every equation is the entire point of this classic.