All revision notes topics

MatricesIB MYP Maths Extended: Revision notes

Section 1

Matrices and their order

A matrix is a rectangular array of numbers called entries, written in brackets. Its order is m×nm\times n: mm rows and then nn columns. For example (123401)\begin{pmatrix}1&2&3\\ 4&0&1\end{pmatrix} has 2 rows and 3 columns, so its order is 2×32\times3. A matrix with the same number of rows and columns is square. A matrix with one column, such as (2512)\begin{pmatrix}2\\ 5\\ 12\end{pmatrix}, has order 3×13\times1. Two matrices are equal only if they have the same order and equal entries.

Key termsmatrixentryordersquare matrix
Common mistake

Writing the order as columns ×\times rows. It is always rows first.

Section 2

Adding, subtracting and scalar multiples

You can only add or subtract matrices of the same order. Do it entry by entry. To multiply by a number (a scalar), multiply every entry. Worked example. With A=(2−103)\mathbf A=\begin{pmatrix}2&-1\\ 0&3\end{pmatrix} and B=(14−25)\mathbf B=\begin{pmatrix}1&4\\ -2&5\end{pmatrix}: 2A−B=(4−206)−(14−25)=(3−621).2\mathbf A-\mathbf B=\begin{pmatrix}4&-2\\ 0&6\end{pmatrix}-\begin{pmatrix}1&4\\ -2&5\end{pmatrix}=\begin{pmatrix}3&-6\\ 2&1\end{pmatrix}. Adding is commutative (A+B=B+A\mathbf A+\mathbf B=\mathbf B+\mathbf A).

Key termsscalarentry by entry
Common mistake

Multiplying only one entry by a scalar. Every entry is multiplied.

Section 3

Multiplying matrices

The product AB\mathbf{AB} exists only if the number of columns of A\mathbf A equals the number of rows of B\mathbf B. If A\mathbf A is m×nm\times n and B\mathbf B is n×pn\times p, then AB\mathbf{AB} is m×pm\times p. Each entry of AB\mathbf{AB} is a row of A\mathbf A times a column of B\mathbf B: multiply matching entries and add. Worked example. M=(123401)\mathbf M=\begin{pmatrix}1&2&3\\ 4&0&1\end{pmatrix} is 2×32\times3 and N=(21031−1)\mathbf N=\begin{pmatrix}2&1\\ 0&3\\ 1&-1\end{pmatrix} is 3×23\times2, so MN\mathbf{MN} is 2×22\times2. The entry in row 2, column 1 is 4(2)+0(0)+1(1)=94(2)+0(0)+1(1)=9. In full, MN=(5493)\mathbf{MN}=\begin{pmatrix}5&4\\ 9&3\end{pmatrix}. Matrix multiplication is not commutative: AB\mathbf{AB} and BA\mathbf{BA} are usually different. For A=(2−103)\mathbf A=\begin{pmatrix}2&-1\\ 0&3\end{pmatrix} and B=(14−25)\mathbf B=\begin{pmatrix}1&4\\ -2&5\end{pmatrix}, AB=(43−615)\mathbf{AB}=\begin{pmatrix}4&3\\ -6&15\end{pmatrix} but BA=(211−417)\mathbf{BA}=\begin{pmatrix}2&11\\ -4&17\end{pmatrix}.

Key termsproductnot commutative
Common mistake

Multiplying matching entries (aij×bija_{ij}\times b_{ij}). Use row times column.

Exam tip

Write the orders side by side first: (2×3)(3×2)(2\times3)(3\times2). The inner numbers must match.

Section 4

Using matrices in real situations

Matrix multiplication organises totals. If S\mathbf S shows items sold (rows: shops, columns: products) and P\mathbf P is a column of prices, then SP\mathbf{SP} gives the takings of each shop. Worked example. S=(12080409010060)\mathbf S=\begin{pmatrix}120&80&40\\ 90&100&60\end{pmatrix} and P=(2512)\mathbf P=\begin{pmatrix}2\\ 5\\ 12\end{pmatrix} gives SP=(11201400)\mathbf{SP}=\begin{pmatrix}1120\\ 1400\end{pmatrix}: Dubai takes 1120 AED and Sharjah 1400 AED. A matrix scaled by 1.2 models a 20% rise in every entry. Always say what the rows and columns mean, and what assumptions the model makes.

Key termsmodelassumption
Exam tip

Label the rows and columns, so you can interpret each entry of the answer.

Section 5

Adjacency matrices

A network is made of points (vertices) joined by lines (edges). Its adjacency matrix has one row and column for each vertex. The entry is the number of direct routes between the two vertices, so 1 if joined and 0 if not. For a two-way network the matrix is symmetrical. Worked example. Towns W,X,Y,ZW, X, Y, Z with routes WXWX, WYWY, XYXY, YZYZ give M=(0110101011010010).\mathbf M=\begin{pmatrix}0&1&1&0\\ 1&0&1&0\\ 1&1&0&1\\ 0&0&1&0\end{pmatrix}.

Key termsnetworkadjacency matrixvertex
Common mistake

Keeping the rows and columns in different orders. Use the same order for both.

Section 6

Counting paths

The entries of Mn\mathbf M^n give the number of different journeys using exactly nn routes. For M2\mathbf M^2, each entry is a row of M\mathbf M times a column of M\mathbf M. M2=(2111121111301101)\mathbf M^2=\begin{pmatrix}2&1&1&1\\ 1&2&1&1\\ 1&1&3&0\\ 1&1&0&1\end{pmatrix} The entry from WW to ZZ is 1: the only two-route journey is W→Y→ZW\to Y\to Z. The entry from YY to YY is 3: Y→W→YY\to W\to Y, Y→X→YY\to X\to Y and Y→Z→YY\to Z\to Y. For three routes, work out M3=MM2\mathbf M^3=\mathbf M\mathbf M^2.

Key termspathjourney
Exam tip

Check a count by listing the journeys. It should match the entry.

That's the notes covered.

Carry on to the next subtopic.

Exam questions on Matrices

  1. The matrices A\mathbf A and B\mathbf B are given by A=(2−103)\mathbf A=\begin{pmatrix}2&-1\\ 0&3\end{pmatrix} and B=(14−25)\mathbf B=\begin{pmatrix}1&4\\ -2&5\end{pmatrix}.
    Find A2\mathbf A^2.2 marks
  2. M=(123401)\mathbf M=\begin{pmatrix}1&2&3\\ 4&0&1\end{pmatrix} and N=(21031−1)\mathbf N=\begin{pmatrix}2&1\\ 0&3\\ 1&-1\end{pmatrix}.
    Find the matrix MN\mathbf{MN}.2 marks
  3. Four towns WW, XX, YY and ZZ are joined by two-way bus routes. The only direct routes are WW to XX, WW to YY, XX to YY, and YY to ZZ.
    Write down the adjacency matrix M\mathbf M for the network, using the order WW, XX, YY, ZZ for the rows and columns, and state its order.3 marks
See the full worksheet

Written by the Exaim team, led by Shaun Daswani (Head of Upper Secondary, Improve ME Institute; MSc Financial Mathematics, Imperial College London; BSc, UCL) and Jason Daswani (operational lead, Improve ME Institute; LSE).