Skip to main content
WAMathematics ApplicationsSyllabus dot point

How can a grid of numbers store data and model change over time?

Perform matrix operations, find determinants and inverses of 2x2 matrices, solve matrix equations, and apply transition matrices to model systems.

How to add, multiply and invert matrices, solve matrix equations with the inverse, and use transition matrices and steady states to model populations and market share.

Generated by Claude Opus 4.78 min answer

Reviewed by: AI editorial process; not yet individually human-reviewed

Have a quick question? Jump to the Q&A page

Jump to a section
  1. What this dot point is asking
  2. Matrix operations
  3. Determinant and inverse of a 2x2 matrix
  4. Solving matrix equations
  5. Transition matrices

What this dot point is asking

This dot point tests matrix arithmetic, the inverse of a 2Γ—22\times 2 matrix, solving systems with matrices, and applying transition (Markov) matrices to real contexts.

Matrix operations

Addition and subtraction work entry by entry and require matrices of the same order. Scalar multiplication multiplies every entry by the scalar. Matrix multiplication is the key operation: the entry in row ii, column jj of ABAB is the dot product of row ii of AA with column jj of BB.

Determinant and inverse of a 2x2 matrix

For A=[abcd]A = \begin{bmatrix} a & b \\ c & d \end{bmatrix}, the determinant is

det⁑(A)=adβˆ’bc\det(A) = ad - bc

and the inverse, which exists only when det⁑(A)β‰ 0\det(A) \neq 0, is

Aβˆ’1=1adβˆ’bc[dβˆ’bβˆ’ca]A^{-1} = \frac{1}{ad - bc}\begin{bmatrix} d & -b \\ -c & a \end{bmatrix}

The inverse satisfies AAβˆ’1=Aβˆ’1A=IA A^{-1} = A^{-1} A = I, where I=[1001]I = \begin{bmatrix} 1 & 0 \\ 0 & 1 \end{bmatrix} is the identity.

Solving matrix equations

A system of linear equations can be written AX=BAX = B. If Aβˆ’1A^{-1} exists, premultiply both sides:

X=Aβˆ’1BX = A^{-1} B

Transition matrices

A transition matrix TT describes how proportions move between states each period. The state vector updates by Sn+1=TSnS_{n+1} = T S_n, so Sn=T nS0S_n = T^{\,n} S_0. Columns of TT each sum to 1 because every member must end up in some state.

The system often settles to a steady state SS where TS=ST S = S; you can find it by computing T nT^{\,n} for large nn on the calculator.