1.4 Matrices
- Syllabus
- 9231–2028–2029
- Topic
- 1.4
- Level
- AS
| Operation | Condition | Result |
|---|---|---|
| A±B | A and B have the same dimensions | Add/subtract corresponding entries; same dimensions |
| AB | columns of A = rows of B | If A is m×n and B is n×p, AB is m×p |
| AO or OA | dimensions make the product valid | Zero matrix of the resulting dimensions |
| AI or IA | I has the matching square order | A |
Entry (i,j) of AB is row i of A dotted with column j of B. This rule works for non-square matrices and is not entry-by-entry multiplication. AB may exist when BA does not; if both exist, they need not be equal.
A=\begin{pmatrix}1&2&0\-1&3&1\end{pmatrix},\quad B=\begin{pmatrix}2&1\0&-2\4&3\end{pmatrix}AB=\begin{pmatrix}1(2)+2(0)+0(4)&1(1)+2(-2)+0(3)\-1(2)+3(0)+1(4)&-1(1)+3(-2)+1(3)\end{pmatrix}=\begin{pmatrix}2&-3\2&-4\end{pmatrix}.
The zero matrix is shape-specific, while the identity matrix is square. Always write dimensions before multiplying; matching the visible number of entries is not enough.
A square matrix M is non-singular exactly when detM=0; then one unique inverse satisfies MM−1=M−1M=I. If detM=0, M is singular and no inverse exists.
ForM=\begin{pmatrix}a&b\c&d\end{pmatrix},\qquad \det M=ad-bc,and, when $ad-bc\ne0$,M^{-1}=\frac1{ad-bc}\begin{pmatrix}d&-b\-c&a\end{pmatrix}.
For a 3×3 matrix, evaluate the determinant by a signed cofactor expansion. Find the inverse either by M−1=adj(M)/detM (cofactor matrix, then transpose) or by row-reducing [M∣I] to [I∣M−1]. Finish by multiplying back to I.
ForM=\begin{pmatrix}1&1&0\0&1&1\0&0&2\end{pmatrix},\quad \det M=2,soMisnon−singular.RowreductiongivesM^{-1}=\begin{pmatrix}1&-1&1/2\0&1&-1/2\0&0&1/2\end{pmatrix},and direct multiplication gives $MM^{-1}=I$.
Do not take reciprocals entry by entry. A negative determinant still permits an inverse; only zero makes the matrix singular.
Fornon−singularAandB,(AB)^{-1}=B^{-1}A^{-1},because(AB)(B^{-1}A^{-1})=A(BB^{-1})A^{-1}=I.Moregenerally,(A_1A_2\cdots A_k)^{-1}=A_k^{-1}\cdots A_2^{-1}A_1^{-1}.
A product applies the rightmost action first. Its inverse must undo the last applied action first, so every factor and the whole order reverse. This is not a commutativity shortcut; associativity lets the neighbouring inverse pairs cancel.
LetA=\begin{pmatrix}1&2\0&1\end{pmatrix},\quad B=\begin{pmatrix}3&0\0&1\end{pmatrix},\quad AB=\begin{pmatrix}3&2\0&1\end{pmatrix}. ThenB^{-1}A^{-1}=\begin{pmatrix}1/3&0\0&1\end{pmatrix}\begin{pmatrix}1&-2\0&1\end{pmatrix}=\begin{pmatrix}1/3&-2/3\0&1\end{pmatrix}=(AB)^{-1}.
The rule requires square non-singular factors. Do not write A−1B−1 unless that product independently happens to equal the correct reverse-order result.
For column vectors, the columns of a 2×2 matrix M are the images of (1,0)T and (0,1)T. This gives a direct way to build or identify the transformation, including unfamiliar linear transformations.
| Transformation about the origin | Matrix |
|---|---|
| Rotation anticlockwise by θ | (cosθsinθ−sinθcosθ) |
| Reflection in x-axis / line y=x | (100−1) / (0110) |
| Enlargement factor k | kI |
| Stretch parallel to x-axis, factor k | (k001) |
| Shear x′=x+ky | (10k1) |
If B acts first and A second, the composite matrix is AB. For a stretch parallel to the x-axis by 3 followed by reflection in $y=x$,A=\begin{pmatrix}0&1\1&0\end{pmatrix},\quad B=\begin{pmatrix}3&0\0&1\end{pmatrix},\quad AB=\begin{pmatrix}0&1\3&0\end{pmatrix}.
If M is non-singular, M−1 represents the inverse transformation. The area scale factor is ∣detM∣; a negative determinant records orientation reversal, not negative area. A zero determinant collapses area and has no inverse transformation.
Products act right-to-left on column vectors: AB means B then A. A stretch is directional, whereas an enlargement scales every direction equally.
| Object | Meaning under M | Equation |
|---|---|---|
| Invariant (fixed) point v | The point itself does not move | Mv=v, so (M−I)v=0 |
| Invariant line | Every point of the line maps somewhere on the same line | For a line through the origin, its direction v satisfies Mv=λv for some scalar λ |
| Line of invariant points | Every point on the line is fixed | Mv=v for every direction/point on it, so the relevant eigenvalue is 1 |
Every linear matrix transformation fixes the origin. Non-zero fixed points exist only when M−I is singular. Solve the simultaneous equations from (M−I)(x,y)T=0 and describe the full set, which may be just the origin or an entire line of fixed points.
For $M=\begin{pmatrix}a&b\\c&d\end{pmatrix}$ and a candidate line $y=mx$, the direction $(1,m)^T$ maps to $(a+bm,c+dm)^T$. Invariance requires parallel directions:c+dm=m(a+bm). Also check a vertical line separately using direction $(0,1)^T$.
ForM=\begin{pmatrix}4&-1\2&1\end{pmatrix},2+m=m(4-m)\iff m^2-3m+2=0,so $m=1$ or $m=2$. Thus $y=x$ and $y=2x$ are invariant lines through the origin; points on them are generally scaled, not fixed.
Do not impose Mv=v when the question asks only for an invariant line: that would find fixed points and miss directions that remain on the same line while being stretched or reversed.