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 : rows and then columns. For example has 2 rows and 3 columns, so its order is . A matrix with the same number of rows and columns is square. A matrix with one column, such as , has order . Two matrices are equal only if they have the same order and equal entries.
Writing the order as columns 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 and : Adding is commutative ().
Multiplying only one entry by a scalar. Every entry is multiplied.
Section 3
Multiplying matrices
The product exists only if the number of columns of equals the number of rows of . If is and is , then is . Each entry of is a row of times a column of : multiply matching entries and add. Worked example. is and is , so is . The entry in row 2, column 1 is . In full, . Matrix multiplication is not commutative: and are usually different. For and , but .
Multiplying matching entries (). Use row times column.
Write the orders side by side first: . The inner numbers must match.
Section 4
Using matrices in real situations
Matrix multiplication organises totals. If shows items sold (rows: shops, columns: products) and is a column of prices, then gives the takings of each shop. Worked example. and gives : 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.
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 with routes , , , give
Keeping the rows and columns in different orders. Use the same order for both.
Section 6
Counting paths
The entries of give the number of different journeys using exactly routes. For , each entry is a row of times a column of . The entry from to is 1: the only two-route journey is . The entry from to is 3: , and . For three routes, work out .
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
- The matrices and are given by and .Find .2 marks
- and .Find the matrix .2 marks
- Four towns , , and are joined by two-way bus routes. The only direct routes are to , to , to , and to .Write down the adjacency matrix for the network, using the order , , , for the rows and columns, and state its order.3 marks
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).