A-Level Further Mathematics: Matrices

Matrices are not just grids of numbers; they are the fundamental language of describing and manipulating linear relationships, making them indispensable for advanced mathematics, computer graphics, and modelling complex systems. Mastering matrices allows you to encode geometric transformations, solve systems of equations efficiently, and understand the long-term behaviour of iterative processes.

Matrix Algebra: The Foundational Operations

A matrix is a rectangular array of numbers arranged in rows and columns. The algebra of matrices is governed by specific rules that differ subtly from ordinary arithmetic. You can add or subtract matrices only if they share the same dimensions, performed by adding corresponding entries.

Matrix multiplication is the first major conceptual leap. To multiply two matrices, the number of columns in the first matrix must equal the number of rows in the second. If matrix $A$ is $m\times n$ and matrix $B$ is $n\times p$, their product $AB$ will be an $m\times p$ matrix. The entry in the $i$th row and $j$th column of $AB$ is found by taking the dot product of the $i$th row of $A$ and the $j$th column of $B$. Crucially, matrix multiplication is not commutative: $AB\ne BA$ in general.

Finding the inverse of a matrix, denoted $A^{-1}$, is analogous to finding the reciprocal of a number. Only square matrices (same number of rows and columns) can have inverses, and only if their determinant is non-zero (these are called invertible or non-singular matrices). For a $2\times 2$ matrix: $$A=\left(\begin{array}{cc}a& b\\ c& d\end{array}\right),A^{-1}=\frac{1}{ad-bc}\left(\begin{array}{cc}d& -b\\ -c& a\end{array}\right).$$ The scalar $ad-bc$ is the determinant of $A$, $\det (A)$. For a $3\times 3$ matrix, the inverse can be found using the method of cofactors and the adjugate matrix: $A^{-1}=\frac{1}{\det (A)}\text{adj}(A)$. The defining property of the inverse is $A^{-1}A=A{A}^{-1}=I$, where $I$ is the identity matrix (ones on the main diagonal, zeros elsewhere).

Matrices as Linear Transformations

One of the most powerful applications of matrices is representing linear transformations in two and three dimensions. A transformation is linear if it preserves vector addition and scalar multiplication. Every linear transformation from ${\mathbb{R}}^n$ to ${\mathbb{R}}^n$ can be represented by a square matrix.

• In 2D, a transformation matrix $T$ acts on a position vector $\left(\begin{array}{c}x\\ y\end{array}\right)$ via multiplication: $T\left(\begin{array}{c}x\\ y\end{array}\right)$ gives the new coordinates.
• Standard matrices include: rotation by angle $\theta$: $\left(\begin{array}{cc}\cos \theta & -\sin \theta \\ \sin \theta & \cos \theta \end{array}\right)$; reflection (e.g., in the x-axis: $\left(\begin{array}{cc}1& 0\\ 0& -1\end{array}\right)$); and enlargement scale factor $k$: $\left(\begin{array}{cc}k& 0\\ 0& k\end{array}\right)$.

Combining transformations is achieved through matrix multiplication. If transformation $A$ is applied first, followed by transformation $B$, the combined transformation is represented by the matrix product $BA$. Notice the order: the matrix of the transformation that is applied second appears on the left. This aligns with the non-commutative nature of matrix multiplication – rotating then reflecting is generally different from reflecting then rotating.

Determinants and Their Geometric Meaning

The determinant of a square matrix is a single scalar value that provides critical information. For a $2\times 2$ matrix $A=\left(\begin{array}{cc}a& b\\ c& d\end{array}\right)$, $\det (A)=ad-bc$. For a $3\times 3$ matrix, you can calculate it via the rule of Sarrus or, more robustly, by expansion along a row or column using cofactors.

The geometric significance of the determinant is profound. It represents the scale factor of area (in 2D) or volume (in 3D) under the associated linear transformation. If $\det (A)=3$, the transformation represented by $A$ multiplies areas by a factor of 3. A determinant of zero indicates the transformation collapses the shape into a lower dimension (e.g., a 2D shape into a line), which is why such matrices are non-invertible. A negative determinant indicates that the transformation also includes a reflection, which reverses orientation.

Eigenvalues, Eigenvectors, and Diagonalisation

This is a cornerstone concept in Further Mathematics. For a square matrix $A$, a non-zero vector $\mathbf{v}$ is an eigenvector if multiplying it by $A$ only scales it, not changes its direction. That is, $A\mathbf{v}=\lambda \mathbf{v}$. The scalar $\lambda$ is the corresponding eigenvalue.

To find them, you solve the characteristic equation: $\det (A-\lambda I)=0$. For a $2\times 2$ matrix, this yields a quadratic in $\lambda$; for a $3\times 3$, a cubic. Each eigenvalue is then substituted back into the equation $(A-\lambda I)\mathbf{v}=0$ to find its associated eigenvector(s).

Matrix diagonalisation leverages these concepts. If an $n\times n$ matrix $A$ has $n$ linearly independent eigenvectors, it can be expressed as $A=PD{P}^{-1}$, where:

• $P$ is the matrix whose columns are the eigenvectors of $A$.
• $D$ is the diagonal matrix whose entries are the corresponding eigenvalues.

This is incredibly powerful. It simplifies computing powers of $A$: $A^k=P{D}^k{P}^{-1}$, and $D^k$ is trivial to compute as you just raise the diagonal eigenvalues to the power $k$. This makes diagonalisation the key technique for analysing iterative processes modelled by matrix equations, such as ${\mathbf{x}}_{n+1}=A{\mathbf{x}}_n$, allowing you to find the long-term behaviour of the system.

Common Pitfalls

1. Assuming Multiplication is Commutative: Always remember $AB\ne BA$. When finding a combined transformation matrix or solving matrix equations, the order of multiplication is critical. A good check is to ensure the dimensions of the product make sense.
2. Misapplying the Inverse: The inverse only exists for square matrices with a non-zero determinant. A common error is trying to use the $2\times 2$ inverse formula on a $3\times 3$ matrix or forgetting to divide by the determinant. Also, note that $(AB{)}^{-1}=B^{-1}{A}^{-1}$ – the order reverses.
3. Confusing Algebraic and Geometric Interpretations: When finding eigenvectors, any scalar multiple of your found vector is also an eigenvector. Geometrically, this represents the same line. Furthermore, a zero eigenvalue does not mean a zero eigenvector; the eigenvector must be non-zero by definition.
4. Forcing Diagonalisation: Not every matrix is diagonalisable. A matrix can only be diagonalised if it has a full set of linearly independent eigenvectors. A red flag is an eigenvalue with algebraic multiplicity (the number of times it appears as a root) greater than its geometric multiplicity (the number of linearly independent eigenvectors for that eigenvalue).

Summary

• Matrix Algebra follows specific rules: addition requires equal dimensions, multiplication requires compatible inner dimensions and is non-commutative, and inverses exist only for square matrices with non-zero determinants.
• Linear Transformations in 2D and 3D are represented by matrices. Successive transformations correspond to matrix multiplication, with the first transformation's matrix being on the right in the product.
• The Determinant is a scalar giving the area/volume scale factor of a transformation; a zero determinant means the matrix is non-invertible.
• Eigenvectors ($\mathbf{v}$) are vectors whose direction is unchanged by the matrix transformation, satisfying $A\mathbf{v}=\lambda \mathbf{v}$, where $\lambda$ is the corresponding eigenvalue.
• Diagonalisation ($A=PD{P}^{-1}$) simplifies computing matrix powers and analysing iterative systems, but is only possible for matrices with a complete set of linearly independent eigenvectors.