← Hub FP1 · 04 · Matrices 0%
Paper 1 · Further Pure 1 ✦

Matrices & Transformations

A matrix is a machine that moves the plane. Learn to read the geometry straight off the numbers — and to spot what the machine leaves untouched.

Syllabus 1.4At most 3 × 3MF19 gives you nothing here

What the examiner expects you to do

§1 The algebra you must be fluent in

◇ The rules
  • Addition / subtraction: only for matrices of the same order; work entry by entry.
  • Multiplication: (m×n)(n×p)=(m×p). The inner numbers must match, and they vanish; the outer numbers give the order of the answer. Entry (i,j) is row i of the first dotted with column j of the second.
  • Identity 𝐈: ones down the leading diagonal, zeros elsewhere. 𝐀𝐈=𝐈𝐀=𝐀.
  • Zero matrix 𝟎: all entries zero. Careful — 𝐀𝐁=𝟎 does not force 𝐀=𝟎 or 𝐁=𝟎.
◆ Associative, but not commutative

Matrix multiplication is associative, so (𝐀𝐁)𝐂=𝐀(𝐁𝐂) and a product of three or more can be built up in any grouping. It is not commutative — in general

𝐀𝐁𝐁𝐀.

Order is not a technicality here; it is the whole geometry, as §3 shows.

✎ Worked example — order matters

With 𝐀=(1201) and 𝐁=(0110):

𝐀𝐁=(2110),𝐁𝐀=(0112).

Same two matrices, different products. Always read the question for which comes first.

★ A* tip — check the order before you multiply

Write the orders side by side first: (2×3)(3×2) is fine and gives 2×2; (3×2)(3×2) is undefined. Examiners set at least one product a year that simply does not exist, and the mark is for saying so.

§2 Determinant, singularity and the inverse

◆ 2 × 2
𝐌=(abcd)  det𝐌=adbc,𝐌1=1adbc(dbca).

Swap the leading diagonal, negate the other diagonal, divide by the determinant. 𝐌 is singular when det𝐌=0 — and then 𝐌1 does not exist.

◆ 3 × 3 — determinant by expansion along the first row

With the alternating sign pattern ++, each entry is multiplied by the 2×2 determinant left when you delete its row and column (its minor):

det(abcdefghi)=a|efhi|b|dfgi|+c|degh|.

You may expand along any row or column — choose the one with the most zeros — provided you use the matching signs from the chequerboard

(+++++).
◇ 3 × 3 inverse — the four-step recipe
  1. Minors: replace each entry by the 2×2 determinant of what is left when you delete its row and column.
  2. Cofactors: apply the ++ chequerboard of signs.
  3. Adjugate: transpose the cofactor matrix (reflect it in the leading diagonal).
  4. Divide by det𝐌. So 𝐌1=1det𝐌adj𝐌.

Forgetting the transpose in step 3 is the classic error — and it is invisible unless you check.

✎ Worked example — a full 3 × 3 inverse

Invert 𝐌=(201110011).

Determinant (first row): 2(1101)0(1100)+1(1110)=2+0+1=30, so 𝐌 is non-singular.

Cofactors (minors with the signs already applied):

𝐂=(111122112)adj𝐌=𝐂𝖳=(111121122).

Divide by the determinant:

𝐌1=13(111121122).

Always check one row: row 1 of 𝐌 times column 1 of the adjugate is 2(1)+0(1)+1(1)=3, and 3÷3=1. ✓ That single line catches a lost transpose.

◆ The reversal law
(𝐀𝐁)1=𝐁1𝐀1

Inverses come off in the opposite order.

Why the order reverses (and why it is obvious once you see it)

Multiply 𝐀𝐁 by the candidate 𝐁1𝐀1 and use associativity:

(𝐀𝐁)(𝐁1𝐀1)=𝐀(𝐁𝐁1)𝐀1=𝐀𝐈𝐀1=𝐀𝐀1=𝐈,

and in the same way (𝐁1𝐀1)(𝐀𝐁)=𝐈. Since the inverse is unique, (𝐀𝐁)1=𝐁1𝐀1.

Geometrically: 𝐀𝐁 does 𝐁 then 𝐀. To undo it you must undo 𝐀 first, then 𝐁 — socks on, shoes on; shoes off, socks off.

§3 2 × 2 matrices as transformations

◆ The one idea that generates every transformation matrix

Because (abcd)(10)=(ac) and (abcd)(01)=(bd):

𝐭𝐡𝐞 𝐜𝐨𝐥𝐮𝐦𝐧𝐬 𝐨𝐟 𝐭𝐡𝐞 𝐦𝐚𝐭𝐫𝐢𝐱 𝐚𝐫𝐞 𝐭𝐡𝐞 𝐢𝐦𝐚𝐠𝐞𝐬 𝐨𝐟 𝐢 𝐚𝐧𝐝 𝐣.

To build the matrix for any described transformation, just work out where (1,0) and (0,1) go and write them down as columns. Nothing on this topic is printed in MF19, so this is how you recover every result under exam pressure.

◇ The five named transformations
TransformationMatrixdet
Rotation about O, angle θ anticlockwise(cosθsinθsinθcosθ)1
Reflection in the line through O at angle θ to the x-axis(cos2θsin2θsin2θcos2θ)1
Enlargement, centre O, scale factor k(k00k)=k𝐈k2
Stretch factor k parallel to the x-axis (the y-axis is fixed)(k001)k
Shear, x-axis fixed, (0,1)(k,1)(1k01)1

Special cases worth recognising instantly: reflection in the x-axis (1001) (that is θ=0), reflection in y=x (0110) (θ=45), rotation by 90 (0110).

◆ Composition, inverses and area
  • 𝐀𝐁 means "do 𝐁 first, then 𝐀" — because (𝐀𝐁)𝐱=𝐀(𝐁𝐱). Matrices compose right to left.
  • 𝐀1 is the transformation that undoes 𝐀: rotate by θ, reflect in the same line again, enlarge by 1/k.
  • Area scale factor =|det𝐀|. A region of area S maps to one of area |det𝐀|S.
  • The sign of the determinant carries the orientation: det>0 keeps it, det<0 flips it (a reflection), det=0 collapses the whole plane onto a line — which is exactly why a singular matrix has no inverse.
✎ Worked example — a sequence of transformations

Find the matrix for "reflect in the x-axis, then rotate 90 anticlockwise about O".

Reflection 𝐑=(1001), rotation 𝐐=(0110). Reflection is first, so it goes on the right:

𝐐𝐑=(0110)(1001)=(0110),

which is reflection in y=x. Check with 𝐢: (1,0)(1,0)(0,1), and the answer matrix does send (1,0) to (0,1). ✓

The other order, 𝐑𝐐=(0110), is reflection in y=x — a different transformation.

✎ Worked example — area

A triangle of area 6 is transformed by 𝐀=(3112). Since det𝐀=61=5, the image has area 5×6=30.

§4 Invariant points and invariant lines

⚠ Two different things — do not blur them
  • An invariant point does not move: 𝐀𝐱=𝐱.
  • An invariant line maps onto itself as a whole. Its points are allowed to slide along it. A line of invariant points is the stronger condition where every point on it is fixed.
◆ Invariant points — solve (𝐀𝐈)𝐱=𝟎

𝐀𝐱=𝐱(𝐀𝐈)𝐱=𝟎. The origin always works, so the only question is whether anything else does:

  • det(𝐀𝐈)0 ⟹ the origin only.
  • det(𝐀𝐈)=0 (and 𝐀𝐈) ⟹ a whole line of invariant points through the origin; read it off either row.
✎ Worked example — a line of invariant points

Find the invariant points of 𝐀=(6523).

𝐀𝐈=(5522),det(𝐀𝐈)=1010=0,

so there is more than just the origin. The first row gives 5x+5y=0, i.e. y=x (the second row, 2x+2y=0, says the same thing — a good check).

Verify: (6523)(tt)=(6t5t2t3t)=(tt). ✓ Every point of y=x is fixed.

◆ Invariant lines through the origin — one quadratic

Take a general point (t,mt) on y=mx. Its image is (t(a+bm),t(c+dm)), and this lies on y=mx for all t exactly when c+dm=m(a+bm):

bm2+(ad)mc=0

Solve for m. Two roots ⟹ two invariant lines; a repeated root ⟹ one; no real roots ⟹ none. Then check the vertical line x=0 separately: it is invariant precisely when b=0.

Derive this on the spot — it takes three lines — rather than trusting a memorised formula with the signs the wrong way round.

✎ Worked example — two invariant lines, but only one invariant point

Find the invariant lines through the origin for 𝐀=(4121).

Here a=4, b=1, c=2, d=1, so bm2+(ad)mc=0 reads

m2+3m2=0  m23m+2=0  m=1 or m=2.

The invariant lines are y=x and y=2x. Verify y=2x: (t,2t)(4t2t,2t+2t)=(2t,4t), which is on y=2x. ✓ Note the points moved along the line — they were not fixed.

Indeed det(𝐀𝐈)=|3120|=20, so the only invariant point is the origin. Two invariant lines, one invariant point — no contradiction.

★ A* extension — invariant lines that miss the origin

For y=mx+k, substitute (t,mt+k) and demand the image satisfies Y=mX+k for all t. Matching the t terms gives the same quadratic in m; matching the constants then fixes k.

Example: for 𝐀=(2112), the point (t,t+k) maps to (3t+k,3t+2k), and YX=k — so every line of gradient 1 is invariant, whatever k.

§5 Interactive: see the matrix move the plane

The faint square is the unit square; the blue parallelogram is its image. Its two edges from the origin are exactly the columns of the matrix. Watch the determinant become the signed area, and watch the invariant lines stay put.

unit square image invariant line line of invariant points

the columns are where i and j land ✎

§6 Examiner traps & A* checklist

⚠ The seven most common mark-losers
  • Multiplying in the wrong order for a sequence of transformations. Last one described goes furthest left.
  • Writing (𝐀𝐁)1=𝐀1𝐁1. It reverses.
  • Losing the transpose when forming the adjugate of a 3 × 3.
  • Sign slips in the ++ chequerboard, especially the middle entry of the top row.
  • Quoting the area scale factor as det𝐀 rather than |det𝐀| — an area is never negative.
  • Confusing an invariant line with a line of invariant points. Read the question wording exactly.
  • Forgetting to test x=0 separately when hunting invariant lines — the method with y=mx can never find a vertical line.
★ Before you turn the page
  • Did I check one row of my inverse against the original to confirm it gives 𝐈?
  • Does the sign of my determinant match the geometry (negative for anything involving a reflection)?
  • Have I described the transformation in words as well as giving the matrix, when asked?

§7 Video explainers (curated)

§8 Check yourself

Score 0 / 5
Q1 · singularity

The matrix (k32k1) is singular. The possible values of k are:

Solution

Singular means det=0: k(k1)6=0, so k2k6=0, (k3)(k+2)=0. Check k=2: (2323) has det=66=0. ✓

Q2 · inverse

The inverse of (4332) is:

Solution

det=89=1, so 𝐌1=11(2334)=(2334). The near-miss option is what you get if you forget to divide by the negative determinant. Check: 4(2)+3(3)=1 and 4(3)+3(4)=0. ✓

Q3 · area

A shape of area 6 is transformed by (3112). The image has area:

Solution

Area scale factor =|det|=|61|=5, so the image has area 5×6=30.

Q4 · invariant lines

The invariant lines through the origin for (3212) are:

Solution

bm2+(ad)mc=0 gives 2m2+m1=0, i.e. (2m1)(m+1)=0, so m=12 or m=1. Check m=12: (2,1)(3(2)+2(1),2+2(1))=(8,4), which is on y=12x. ✓

Q5 · full method — try it on paper first

The transformation T is a rotation of 90 anticlockwise about the origin, followed by a reflection in the x-axis.

(i) Find the matrix 𝐌 of T. (ii) Describe T as a single transformation. (iii) State the area scale factor. (iv) Find the invariant points. (v) Find the invariant lines through the origin.

Solution

(i) Rotation 𝐐=(0110) happens first, so it goes on the right of the reflection 𝐑=(1001):

𝐌=𝐑𝐐=(1001)(0110)=(0110).

Check with 𝐢: (1,0)rotate(0,1)reflect(0,1), and column 1 of 𝐌 is indeed (0,1). ✓

(ii) Comparing with (cos2θsin2θsin2θcos2θ) gives cos2θ=0, sin2θ=1, so 2θ=90 and θ=45: T is a reflection in the line y=x.

(iii) det𝐌=01=1, so the area scale factor is |1|=1 — areas are unchanged, but the negative sign says orientation is reversed, as it must be for a reflection.

(iv) 𝐌𝐈=(1111) has determinant 11=0, so there is a whole line of invariant points. Either row gives xy=0, i.e. y=x — the mirror line, exactly as expected. Verify: (t,t)(0t+(1)(t),(1)t+0(t))=(t,t). ✓

(v) With a=0, b=1, c=1, d=0, the quadratic bm2+(ad)mc=0 is m2+1=0, so m=±1. The invariant lines are y=x and y=x: the mirror itself (fixed pointwise) and the perpendicular through O (whose points swap sides but stay on the line). Since b=10, x=0 is not invariant.

FP1 · Topic 4 · Matrices