This document covers matrix operations, determinants, inverses, 3x3 matrices, linear
Transformations, and an introduction to eigenvalues and eigenvectors.
:::info Matrices provide a compact and powerful notation for systems of linear equations, geometric
Transformations, and many applications in science and engineering.
:::
1. Matrix Operations
1.1 Definitions
An m × n m \times n m × n matrix A A A is a rectangular array of numbers with m m m rows and n n n columns. The
Entry in row i i i Column j j j is written a i j a_{ij} a ij .
Addition. If A A A and B B B are both m × n m \times n m × n Then ( A + B ) i j = a i j + b i j (A + B)_{ij} = a_{ij} + b_{ij} ( A + B ) ij = a ij + b ij .
Scalar multiplication. ( c A ) i j = c a i j (cA)_{ij} = ca_{ij} ( c A ) ij = c a ij .
Matrix multiplication. If A A A is m × n m \times n m × n and B B B is n × p n \times p n × p Then C = A B C = AB C = A B is
m × p m \times p m × p with:
c i j = ∑ k = 1 n a i k b k j c_{ij} = \sum_{k=1}^{n} a_{ik}\,b_{kj} c ij = ∑ k = 1 n a ik b k j
1.2 Properties of matrix multiplication
Matrix multiplication is:
Associative: ( A B ) C = A ( B C ) (AB)C = A(BC) ( A B ) C = A ( B C ) .
Distributive over addition: A ( B + C ) = A B + A C A(B + C) = AB + AC A ( B + C ) = A B + A C .
NOT commutative: , A B ≠ B A AB \neq BA A B = B A .
Proof that matrix multiplication is not commutative. Consider:
A = ( 1 0 0 0 ) , B = ( 0 1 0 0 ) A = \begin{pmatrix} 1 & 0 \\ 0 & 0 \end{pmatrix}, \quad B = \begin{pmatrix} 0 & 1 \\ 0 & 0 \end{pmatrix} A = ( 1 0 0 0 ) , B = ( 0 0 1 0 )
A B = ( 0 1 0 0 ) , B A = ( 0 0 0 0 ) AB = \begin{pmatrix} 0 & 1 \\ 0 & 0 \end{pmatrix}, \quad BA = \begin{pmatrix} 0 & 0 \\ 0 & 0 \end{pmatrix} A B = ( 0 0 1 0 ) , B A = ( 0 0 0 0 )
A B ≠ B A AB \neq BA A B = B A . ■ \blacksquare ■
1.3 The identity matrix
The n × n n \times n n × n identity matrix I n I_n I n has 1 1 1 S on the main diagonal and 0 0 0 S elsewhere. For any
n × n n \times n n × n matrix A A A : A I n = I n A = A AI_n = I_n A = A A I n = I n A = A .
1.4 Worked example
Problem. Given A = ( 2 − 1 3 4 ) A = \begin{pmatrix} 2 & -1 \\ 3 & 4 \end{pmatrix} A = ( 2 3 − 1 4 ) and
B = ( 1 5 − 2 0 ) B = \begin{pmatrix} 1 & 5 \\ -2 & 0 \end{pmatrix} B = ( 1 − 2 5 0 ) Find A B AB A B and B A BA B A .
A B = ( 2 ( 1 ) + ( − 1 ) ( − 2 ) 2 ( 5 ) + ( − 1 ) ( 0 ) 3 ( 1 ) + 4 ( − 2 ) 3 ( 5 ) + 4 ( 0 ) ) = ( 4 10 − 5 15 ) AB = \begin{pmatrix} 2(1) + (-1)(-2) & 2(5) + (-1)(0) \\ 3(1) + 4(-2) & 3(5) + 4(0) \end{pmatrix} = \begin{pmatrix} 4 & 10 \\ -5 & 15 \end{pmatrix} A B = ( 2 ( 1 ) + ( − 1 ) ( − 2 ) 3 ( 1 ) + 4 ( − 2 ) 2 ( 5 ) + ( − 1 ) ( 0 ) 3 ( 5 ) + 4 ( 0 ) ) = ( 4 − 5 10 15 )
B A = ( 1 ( 2 ) + 5 ( 3 ) 1 ( − 1 ) + 5 ( 4 ) − 2 ( 2 ) + 0 ( 3 ) − 2 ( − 1 ) + 0 ( 4 ) ) = ( 17 19 − 4 2 ) BA = \begin{pmatrix} 1(2) + 5(3) & 1(-1) + 5(4) \\ -2(2) + 0(3) & -2(-1) + 0(4) \end{pmatrix} = \begin{pmatrix} 17 & 19 \\ -4 & 2 \end{pmatrix} B A = ( 1 ( 2 ) + 5 ( 3 ) − 2 ( 2 ) + 0 ( 3 ) 1 ( − 1 ) + 5 ( 4 ) − 2 ( − 1 ) + 0 ( 4 ) ) = ( 17 − 4 19 2 )
A B ≠ B A AB \neq BA A B = B A Confirming non-commutativity.
2. Determinants
2.1 2x2 determinant
det ( a b c d ) = a d − b c \det\begin{pmatrix} a & b \\ c & d \end{pmatrix} = ad - bc det ( a c b d ) = a d − b c
2.2 3x3 determinant
det ( a b c d e f g h k ) = a ∣ e f h k ∣ − b ∣ d f g k ∣ + c ∣ d e g h ∣ \det\begin{pmatrix} a & b & c \\ d & e & f \\ g & h & k \end{pmatrix} = a\begin{vmatrix} e & f \\ h & k \end{vmatrix} - b\begin{vmatrix} d & f \\ g & k \end{vmatrix} + c\begin{vmatrix} d & e \\ g & h \end{vmatrix} det a d g b e h c f k = a e h f k − b d g f k + c d g e h
= a ( e k − f h ) − b ( d k − f g ) + c ( d h − e g ) = a(ek - fh) - b(dk - fg) + c(dh - eg) = a ( e k − f h ) − b ( d k − f g ) + c ( d h − e g )
2.3 Properties of determinants
det ( A B ) = det ( A ) det ( B ) \det(AB) = \det(A)\det(B) det ( A B ) = det ( A ) det ( B ) .
det ( A T ) = det ( A ) \det(A^T) = \det(A) det ( A T ) = det ( A ) .
Swapping two rows (or columns) changes the sign of the determinant.
A matrix with a row (or column) of zeros has determinant zero.
Adding a multiple of one row to another does not change the determinant.
det ( c A ) = c n det ( A ) \det(cA) = c^n\det(A) det ( c A ) = c n det ( A ) for an n × n n \times n n × n matrix.
2.4 Geometric interpretation
For a 2 × 2 2 \times 2 2 × 2 matrix, ∣ det ( A ) ∣ |\det(A)| ∣ det ( A ) ∣ is the area scale factor of the transformation. If
det ( A ) = 0 \det(A) = 0 det ( A ) = 0 The transformation collapses the plane to a line or a point.
For a 3 × 3 3 \times 3 3 × 3 matrix, ∣ det ( A ) ∣ |\det(A)| ∣ det ( A ) ∣ is the volume scale factor.
2.5 Worked example
Problem. Find the determinant of
A = ( 2 1 3 0 − 1 4 1 2 0 ) A = \begin{pmatrix} 2 & 1 & 3 \\ 0 & -1 & 4 \\ 1 & 2 & 0 \end{pmatrix} A = 2 0 1 1 − 1 2 3 4 0 .
Expanding along the first row:
det A = 2 ∣ − 1 4 2 0 ∣ − 1 ∣ 0 4 1 0 ∣ + 3 ∣ 0 − 1 1 2 ∣ \det A = 2\begin{vmatrix} -1 & 4 \\ 2 & 0 \end{vmatrix} - 1\begin{vmatrix} 0 & 4 \\ 1 & 0 \end{vmatrix} + 3\begin{vmatrix} 0 & -1 \\ 1 & 2 \end{vmatrix} det A = 2 − 1 2 4 0 − 1 0 1 4 0 + 3 0 1 − 1 2
= 2 ( 0 − 8 ) − 1 ( 0 − 4 ) + 3 ( 0 + 1 ) = − 16 + 4 + 3 = − 9 = 2(0 - 8) - 1(0 - 4) + 3(0 + 1) = -16 + 4 + 3 = -9 = 2 ( 0 − 8 ) − 1 ( 0 − 4 ) + 3 ( 0 + 1 ) = − 16 + 4 + 3 = − 9
3. Inverses
3.1 Definition
The inverse of a square matrix A A A is a matrix A − 1 A^{-1} A − 1 such that:
A A − 1 = A − 1 A = I AA^{-1} = A^{-1}A = I A A − 1 = A − 1 A = I
An inverse exists if and only if det ( A ) ≠ 0 \det(A) \neq 0 det ( A ) = 0 . A matrix with no inverse is singular .
3.2 Inverse of a 2x2 matrix
( a b c d ) − 1 = 1 a d − b c ( d − b − c a ) \begin{pmatrix} a & b \\ c & d \end{pmatrix}^{-1} = \frac{1}{ad - bc}\begin{pmatrix} d & -b \\ -c & a \end{pmatrix} ( a c b d ) − 1 = a d − b c 1 ( d − c − b a )
Verification:
1 a d − b c ( d − b − c a ) ( a b c d ) = 1 a d − b c ( a d − b c 0 0 a d − b c ) = I \frac{1}{ad - bc}\begin{pmatrix} d & -b \\ -c & a \end{pmatrix}\begin{pmatrix} a & b \\ c & d \end{pmatrix} = \frac{1}{ad - bc}\begin{pmatrix} ad - bc & 0 \\ 0 & ad - bc \end{pmatrix} = I a d − b c 1 ( d − c − b a ) ( a c b d ) = a d − b c 1 ( a d − b c 0 0 a d − b c ) = I
3.3 Inverse of a 3x3 matrix
Method 1: Adjugate matrix. A − 1 = ◆ L B ◆ 1 ◆ R B ◆◆ L B ◆ det A ◆ R B ◆ a d j ( A ) A^{-1} = \dfrac◆LB◆1◆RB◆◆LB◆\det A◆RB◆\,\mathrm{adj}(A) A − 1 = L ◆ B ◆1◆ R B ◆◆ L B ◆ det A ◆ R B ◆ adj ( A ) Where the
Adjugate is the transpose of the cofactor matrix.
Method 2: Row reduction. Form the augmented matrix [ A ∣ I ] [A \mid I] [ A ∣ I ] and apply row operations to
Obtain [ I ∣ A − 1 ] [I \mid A^{-1}] [ I ∣ A − 1 ] .
3.4 Worked example: 3x3 inverse
Problem. Find the inverse of
A = ( 1 2 0 0 1 3 1 0 1 ) A = \begin{pmatrix} 1 & 2 & 0 \\ 0 & 1 & 3 \\ 1 & 0 & 1 \end{pmatrix} A = 1 0 1 2 1 0 0 3 1 .
det A = 1 ( 1 − 0 ) − 2 ( 0 − 3 ) + 0 = 1 + 6 = 7 \det A = 1(1 - 0) - 2(0 - 3) + 0 = 1 + 6 = 7 det A = 1 ( 1 − 0 ) − 2 ( 0 − 3 ) + 0 = 1 + 6 = 7 .
Cofactors: C_{11} = 1$$C_{12} = 3$$C_{13} = -1$$C_{21} = -2$$C_{22} = 1$$C_{23} = 2
C_{31} = 6$$C_{32} = -3$$C_{33} = 1 .
A − 1 = 1 7 ( 1 − 2 6 3 1 − 3 − 1 2 1 ) A^{-1} = \frac{1}{7}\begin{pmatrix} 1 & -2 & 6 \\ 3 & 1 & -3 \\ -1 & 2 & 1 \end{pmatrix} A − 1 = 7 1 1 3 − 1 − 2 1 2 6 − 3 1
3.5 Solving systems of linear equations
A system A x = b A\mathbf{x} = \mathbf{b} A x = b has a unique solution x = A − 1 b \mathbf{x} = A^{-1}\mathbf{b} x = A − 1 b if and
Only if det A ≠ 0 \det A \neq 0 det A = 0 .
If det A = 0 \det A = 0 det A = 0 : either no solution (inconsistent) or infinitely many solutions (dependent).
A 2 × 2 2 \times 2 2 × 2 matrix represents a linear transformation of the plane:
( x ′ y ′ ) = ( a b c d ) ( x y ) \begin{pmatrix} x' \\ y' \end{pmatrix} = \begin{pmatrix} a & b \\ c & d \end{pmatrix}\begin{pmatrix} x \\ y \end{pmatrix} ( x ′ y ′ ) = ( a c b d ) ( x y )
Key property: the origin is always mapped to the origin.
Transformation Matrix Reflection in x x x -axis ( 1 0 0 − 1 ) \begin{pmatrix} 1 & 0 \\ 0 & -1 \end{pmatrix} ( 1 0 0 − 1 ) Reflection in y y y -axis ( − 1 0 0 1 ) \begin{pmatrix} -1 & 0 \\ 0 & 1 \end{pmatrix} ( − 1 0 0 1 ) Reflection in y = x y = x y = x ( 0 1 1 0 ) \begin{pmatrix} 0 & 1 \\ 1 & 0 \end{pmatrix} ( 0 1 1 0 ) Rotation θ \theta θ anticlockwise ( cos θ − sin θ sin θ cos θ ) \begin{pmatrix} \cos\theta & -\sin\theta \\ \sin\theta & \cos\theta \end{pmatrix} ( cos θ sin θ − sin θ cos θ ) Enlargement scale k k k ( k 0 0 k ) \begin{pmatrix} k & 0 \\ 0 & k \end{pmatrix} ( k 0 0 k ) Stretch parallel to x x x (sf k k k ) ( k 0 0 1 ) \begin{pmatrix} k & 0 \\ 0 & 1 \end{pmatrix} ( k 0 0 1 )
If transformation A A A is followed by transformation B B B The combined transformation is B A BA B A .
Proof. If v ′ = A v \mathbf{v}' = A\mathbf{v} v ′ = A v and v ′ ′ = B v ′ \mathbf{v}'' = B\mathbf{v}' v ′′ = B v ′ Then
v ′ ′ = B ( A v ) = ( B A ) v \mathbf{v}'' = B(A\mathbf{v}) = (BA)\mathbf{v} v ′′ = B ( A v ) = ( B A ) v . ■ \blacksquare ■
4.4 Worked example
Problem. Find the matrix representing a rotation of 90 ∘ 90^\circ 9 0 ∘ anticlockwise about the origin
Followed by a reflection in the x x x -axis.
Rotation 90 ∘ 90^\circ 9 0 ∘ : R = ( 0 − 1 1 0 ) R = \begin{pmatrix} 0 & -1 \\ 1 & 0 \end{pmatrix} R = ( 0 1 − 1 0 ) .
Reflection in x x x -axis: S = ( 1 0 0 − 1 ) S = \begin{pmatrix} 1 & 0 \\ 0 & -1 \end{pmatrix} S = ( 1 0 0 − 1 ) .
Combined:
S R = ( 1 0 0 − 1 ) ( 0 − 1 1 0 ) = ( 0 − 1 − 1 0 ) SR = \begin{pmatrix} 1 & 0 \\ 0 & -1 \end{pmatrix}\begin{pmatrix} 0 & -1 \\ 1 & 0 \end{pmatrix} = \begin{pmatrix} 0 & -1 \\ -1 & 0 \end{pmatrix} S R = ( 1 0 0 − 1 ) ( 0 1 − 1 0 ) = ( 0 − 1 − 1 0 )
Check: this is equivalent to a reflection in the line y = − x y = -x y = − x .
4.5 Invariant points and lines
An invariant point satisfies A x = x A\mathbf{x} = \mathbf{x} A x = x I.e. ( A − I ) x = 0 (A - I)\mathbf{x} = \mathbf{0} ( A − I ) x = 0 .
An invariant line is a line that is mapped to itself (points on the line may move along the
Line). If v \mathbf{v} v is a direction vector of the line, then A v = λ v A\mathbf{v} = \lambda\mathbf{v} A v = λ v for
Some scalar λ \lambda λ .
5. Eigenvalues and Eigenvectors
5.1 Definition
For a square matrix A A A A scalar λ \lambda λ and a non-zero vector v \mathbf{v} v are an eigenvalue
And eigenvector of A A A if:
A v = λ v A\mathbf{v} = \lambda\mathbf{v} A v = λ v
Geometrically, A A A stretches or compresses the eigenvector by a factor of λ \lambda λ without changing
Its direction.
5.2 Finding eigenvalues
A v = λ v ⟹ ( A − λ I ) v = 0 A\mathbf{v} = \lambda\mathbf{v} \implies (A - \lambda I)\mathbf{v} = \mathbf{0} A v = λ v ⟹ ( A − λ I ) v = 0 .
For non-trivial solutions, we need det ( A − λ I ) = 0 \det(A - \lambda I) = 0 det ( A − λ I ) = 0 . This is the characteristic
Equation .
For a 2 × 2 2 \times 2 2 × 2 matrix:
det ( a − λ b c d − λ ) = ( a − λ ) ( d − λ ) − b c = 0 \det\begin{pmatrix} a - \lambda & b \\ c & d - \lambda \end{pmatrix} = (a - \lambda)(d - \lambda) - bc = 0 det ( a − λ c b d − λ ) = ( a − λ ) ( d − λ ) − b c = 0
λ 2 − ( a + d ) λ + ( a d − b c ) = 0 \lambda^2 - (a + d)\lambda + (ad - bc) = 0 λ 2 − ( a + d ) λ + ( a d − b c ) = 0
Key result: λ 1 + λ 2 = t r ( A ) = a + d \lambda_1 + \lambda_2 = \mathrm{tr}(A) = a + d λ 1 + λ 2 = tr ( A ) = a + d (the trace) and
λ 1 λ 2 = det A \lambda_1 \lambda_2 = \det A λ 1 λ 2 = det A .
5.3 Finding eigenvectors
For each eigenvalue λ i \lambda_i λ i Solve ( A − λ i I ) v = 0 (A - \lambda_i I)\mathbf{v} = \mathbf{0} ( A − λ i I ) v = 0 .
5.4 Worked example
Problem. Find the eigenvalues and eigenvectors of
A = ( 4 1 2 3 ) A = \begin{pmatrix} 4 & 1 \\ 2 & 3 \end{pmatrix} A = ( 4 2 1 3 ) .
Characteristic equation: ( 4 − λ ) ( 3 − λ ) − 2 = 0 (4 - \lambda)(3 - \lambda) - 2 = 0 ( 4 − λ ) ( 3 − λ ) − 2 = 0
λ 2 − 7 λ + 10 = 0 ⟹ ( λ − 5 ) ( λ − 2 ) = 0 \lambda^2 - 7\lambda + 10 = 0 \implies (\lambda - 5)(\lambda - 2) = 0 λ 2 − 7 λ + 10 = 0 ⟹ ( λ − 5 ) ( λ − 2 ) = 0
\lambda_1 = 5$$\lambda_2 = 2 .
For λ 1 = 5 \lambda_1 = 5 λ 1 = 5 :
( − 1 1 2 − 2 ) ( x y ) = ( 0 0 ) \begin{pmatrix} -1 & 1 \\ 2 & -2 \end{pmatrix}\begin{pmatrix} x \\ y \end{pmatrix} = \begin{pmatrix} 0 \\ 0 \end{pmatrix} ( − 1 2 1 − 2 ) ( x y ) = ( 0 0 )
− x + y = 0 ⟹ y = x -x + y = 0 \implies y = x − x + y = 0 ⟹ y = x . Eigenvector: ( 1 1 ) \begin{pmatrix} 1 \\ 1 \end{pmatrix} ( 1 1 ) .
For λ 2 = 2 \lambda_2 = 2 λ 2 = 2 :
( 2 1 2 1 ) ( x y ) = ( 0 0 ) \begin{pmatrix} 2 & 1 \\ 2 & 1 \end{pmatrix}\begin{pmatrix} x \\ y \end{pmatrix} = \begin{pmatrix} 0 \\ 0 \end{pmatrix} ( 2 2 1 1 ) ( x y ) = ( 0 0 )
2 x + y = 0 ⟹ y = − 2 x 2x + y = 0 \implies y = -2x 2 x + y = 0 ⟹ y = − 2 x . Eigenvector: ( 1 − 2 ) \begin{pmatrix} 1 \\ -2 \end{pmatrix} ( 1 − 2 ) .
5.5 Diagonalisation
If an n × n n \times n n × n matrix A A A has n n n linearly independent eigenvectors, it can be diagonalised:
A = P D P − 1 A = PDP^{-1} A = P D P − 1
Where P P P has the eigenvectors as columns and D D D is a diagonal matrix with the eigenvalues on the
Diagonal.
Worked example. For the matrix above:
P = ( 1 1 1 − 2 ) , D = ( 5 0 0 2 ) P = \begin{pmatrix} 1 & 1 \\ 1 & -2 \end{pmatrix}, \quad D = \begin{pmatrix} 5 & 0 \\ 0 & 2 \end{pmatrix} P = ( 1 1 1 − 2 ) , D = ( 5 0 0 2 )
det P = − 2 − 1 = − 3 , P − 1 = − 1 3 ( − 2 − 1 − 1 1 ) = 1 3 ( 2 1 1 − 1 ) \det P = -2 - 1 = -3, \quad P^{-1} = -\frac{1}{3}\begin{pmatrix} -2 & -1 \\ -1 & 1 \end{pmatrix} = \frac{1}{3}\begin{pmatrix} 2 & 1 \\ 1 & -1 \end{pmatrix} det P = − 2 − 1 = − 3 , P − 1 = − 3 1 ( − 2 − 1 − 1 1 ) = 3 1 ( 2 1 1 − 1 )
Verify:
P D P − 1 = 1 3 ( 1 1 1 − 2 ) ( 5 0 0 2 ) ( 2 1 1 − 1 ) PDP^{-1} = \dfrac{1}{3}\begin{pmatrix} 1 & 1 \\ 1 & -2 \end{pmatrix}\begin{pmatrix} 5 & 0 \\ 0 & 2 \end{pmatrix}\begin{pmatrix} 2 & 1 \\ 1 & -1 \end{pmatrix} P D P − 1 = 3 1 ( 1 1 1 − 2 ) ( 5 0 0 2 ) ( 2 1 1 − 1 )
= 1 3 ( 5 2 5 − 4 ) ( 2 1 1 − 1 ) = 1 3 ( 12 3 6 9 ) = ( 4 1 2 3 ) = A = \dfrac{1}{3}\begin{pmatrix} 5 & 2 \\ 5 & -4 \end{pmatrix}\begin{pmatrix} 2 & 1 \\ 1 & -1 \end{pmatrix} = \dfrac{1}{3}\begin{pmatrix} 12 & 3 \\ 6 & 9 \end{pmatrix} = \begin{pmatrix} 4 & 1 \\ 2 & 3 \end{pmatrix} = A = 3 1 ( 5 5 2 − 4 ) ( 2 1 1 − 1 ) = 3 1 ( 12 6 3 9 ) = ( 4 2 1 3 ) = A .
5.6 Powers of matrices
Diagonalisation allows efficient computation of A n A^n A n :
A n = P D n P − 1 A^n = PD^n P^{-1} A n = P D n P − 1
Since D n D^n D n is the diagonal matrix with each eigenvalue raised to the power n n n .
:::caution warning Not all matrices are diagonalisable. A matrix is diagonalisable if and only if it
Has a full set of linearly independent eigenvectors. A matrix with repeated eigenvalues may or may
Not be diagonalisable.
:::
6. Practice Problems
Problem 1
Find the inverse of A = ( 3 1 5 2 ) A = \begin{pmatrix} 3 & 1 \\ 5 & 2 \end{pmatrix} A = ( 3 5 1 2 ) and verify that
A A − 1 = I AA^{-1} = I A A − 1 = I .
Solution
det A = 6 − 5 = 1 \det A = 6 - 5 = 1 det A = 6 − 5 = 1 .
A − 1 = ( 2 − 1 − 5 3 ) A^{-1} = \begin{pmatrix} 2 & -1 \\ -5 & 3 \end{pmatrix} A − 1 = ( 2 − 5 − 1 3 ) .
A A − 1 = ( 3 1 5 2 ) ( 2 − 1 − 5 3 ) = ( 1 0 0 1 ) AA^{-1} = \begin{pmatrix} 3 & 1 \\ 5 & 2 \end{pmatrix}\begin{pmatrix} 2 & -1 \\ -5 & 3 \end{pmatrix} = \begin{pmatrix} 1 & 0 \\ 0 & 1 \end{pmatrix} A A − 1 = ( 3 5 1 2 ) ( 2 − 5 − 1 3 ) = ( 1 0 0 1 ) .
Verified.
Problem 2
Find the matrix representing a rotation of 60 ∘ 60^\circ 6 0 ∘ anticlockwise about the origin.
Solution
cos 60 ∘ = 0.5 \cos 60^\circ = 0.5 cos 6 0 ∘ = 0.5 , sin 60 ∘ = 3 / 2 \sin 60^\circ = \sqrt{3}/2 sin 6 0 ∘ = 3 /2 .
R = ( 0.5 − 3 / 2 3 / 2 0.5 ) R = \begin{pmatrix} 0.5 & -\sqrt{3}/2 \\ \sqrt{3}/2 & 0.5 \end{pmatrix} R = ( 0.5 3 /2 − 3 /2 0.5 ) .
Problem 3
Find the eigenvalues and eigenvectors of ( 5 − 2 2 1 ) \begin{pmatrix} 5 & -2 \\ 2 & 1 \end{pmatrix} ( 5 2 − 2 1 ) .
Solution
Characteristic equation: ( 5 − λ ) ( 1 − λ ) + 4 = 0 (5 - \lambda)(1 - \lambda) + 4 = 0 ( 5 − λ ) ( 1 − λ ) + 4 = 0
λ 2 − 6 λ + 9 = 0 ⟹ ( λ − 3 ) 2 = 0 \lambda^2 - 6\lambda + 9 = 0 \implies (\lambda - 3)^2 = 0 λ 2 − 6 λ + 9 = 0 ⟹ ( λ − 3 ) 2 = 0
λ = 3 \lambda = 3 λ = 3 (repeated eigenvalue).
( 2 − 2 2 − 2 ) ( x y ) = 0 ⟹ x = y \begin{pmatrix} 2 & -2 \\ 2 & -2 \end{pmatrix}\begin{pmatrix} x \\ y \end{pmatrix} = \mathbf{0} \implies x = y ( 2 2 − 2 − 2 ) ( x y ) = 0 ⟹ x = y .
Only one independent eigenvector: ( 1 1 ) \begin{pmatrix} 1 \\ 1 \end{pmatrix} ( 1 1 ) .
This matrix is not diagonalisable (only one eigenvector for a repeated eigenvalue).
Problem 4
Use the matrix ( 1 2 1 0 ) \begin{pmatrix} 1 & 2 \\ 1 & 0 \end{pmatrix} ( 1 1 2 0 ) to find a formula for the n n n -th
Fibonacci number.
Solution
Eigenvalues of A A A : λ 2 − λ − 2 = 0 ⟹ λ = ◆ L B ◆ 1 ± 3 ◆ R B ◆◆ L B ◆ 2 ◆ R B ◆ \lambda^2 - \lambda - 2 = 0 \implies \lambda = \frac◆LB◆1 \pm 3◆RB◆◆LB◆2◆RB◆ λ 2 − λ − 2 = 0 ⟹ λ = L ◆ B ◆1 ± 3◆ R B ◆◆ L B ◆2◆ R B ◆
So λ 1 = 2 \lambda_1 = 2 λ 1 = 2 , λ 2 = − 1 \lambda_2 = -1 λ 2 = − 1 .
Eigenvectors: for λ = 2 \lambda = 2 λ = 2 : ( 1 , 1 ) (1, 1) ( 1 , 1 ) ; for λ = − 1 \lambda = -1 λ = − 1 : ( − 2 , 1 ) (-2, 1) ( − 2 , 1 ) .
A n = P D n P − 1 A^n = P D^n P^{-1} A n = P D n P − 1 where P = ( 1 − 2 1 1 ) P = \begin{pmatrix} 1 & -2 \\ 1 & 1 \end{pmatrix} P = ( 1 1 − 2 1 )
P − 1 = 1 3 ( 1 2 − 1 1 ) P^{-1} = \frac{1}{3}\begin{pmatrix} 1 & 2 \\ -1 & 1 \end{pmatrix} P − 1 = 3 1 ( 1 − 1 2 1 ) .
( F n + 1 F n ) = A n ( 1 0 ) \begin{pmatrix} F_{n+1} \\ F_n \end{pmatrix} = A^n\begin{pmatrix} 1 \\ 0 \end{pmatrix} ( F n + 1 F n ) = A n ( 1 0 ) .
This gives F n = 2 n − ( − 1 ) n 3 F_n = \frac{2^n - (-1)^n}{3} F n = 3 2 n − ( − 1 ) n (the Lucas sequence). For the standard Fibonacci sequence
With A = ( 1 1 1 0 ) A = \begin{pmatrix} 1 & 1 \\ 1 & 0 \end{pmatrix} A = ( 1 1 1 0 ) The result is
F n = ◆ L B ◆ ϕ n − ψ n ◆ R B ◆◆ L B ◆ 5 ◆ R B ◆ F_n = \frac◆LB◆\phi^n - \psi^n◆RB◆◆LB◆\sqrt{5}◆RB◆ F n = L ◆ B ◆ ϕ n − ψ n ◆ R B ◆◆ L B ◆ 5 ◆ R B ◆ where
ϕ = ◆ L B ◆ 1 + 5 ◆ R B ◆◆ L B ◆ 2 ◆ R B ◆ \phi = \frac◆LB◆1+\sqrt{5}◆RB◆◆LB◆2◆RB◆ ϕ = L ◆ B ◆1 + 5 ◆ R B ◆◆ L B ◆2◆ R B ◆ .
7. Further Proofs and Key Results
7.1 Proof: det ( A B ) = det ( A ) det ( B ) \det(AB) = \det(A)\det(B) det ( A B ) = det ( A ) det ( B ) for 2 × 2 2 \times 2 2 × 2 matrices
Proof. Let A = ( a b c d ) A = \begin{pmatrix} a & b \\ c & d \end{pmatrix} A = ( a c b d ) and
B = ( e f g h ) B = \begin{pmatrix} e & f \\ g & h \end{pmatrix} B = ( e g f h ) .
A B = ( a e + b g a f + b h c e + d g c f + d h ) AB = \begin{pmatrix} ae + bg & af + bh \\ ce + dg & cf + dh \end{pmatrix} A B = ( a e + b g ce + d g a f + bh c f + d h )
det ( A B ) = ( a e + b g ) ( c f + d h ) − ( a f + b h ) ( c e + d g ) \det(AB) = (ae + bg)(cf + dh) - (af + bh)(ce + dg) det ( A B ) = ( a e + b g ) ( c f + d h ) − ( a f + bh ) ( ce + d g )
= a c e f + a d e h + b c f g + b d g h − a c e f − a d f g − b c e h − b d g h = acef + adeh + bcfg + bdgh - acef - adfg - bceh - bdgh = a ce f + a d e h + b c f g + b d g h − a ce f − a df g − b ce h − b d g h
= a d e h + b c f g − a d f g − b c e h = adeh + bcfg - adfg - bceh = a d e h + b c f g − a df g − b ce h
= a d ( e h − f g ) − b c ( e h − f g ) = ( a d − b c ) ( e h − f g ) = det ( A ) det ( B ) ■ = ad(eh - fg) - bc(eh - fg) = (ad - bc)(eh - fg) = \det(A)\det(B) \quad \blacksquare = a d ( e h − f g ) − b c ( e h − f g ) = ( a d − b c ) ( e h − f g ) = det ( A ) det ( B ) ■
7.2 Proof: det ( A ) ≠ 0 ⟺ A \det(A) \neq 0 \iff A det ( A ) = 0 ⟺ A is invertible
Proof. (⇒ \Rightarrow ⇒ ) If det ( A ) ≠ 0 \det(A) \neq 0 det ( A ) = 0 The adjugate formula gives
A − 1 = ◆ L B ◆ 1 ◆ R B ◆◆ L B ◆ det A ◆ R B ◆ a d j ( A ) A^{-1} = \dfrac◆LB◆1◆RB◆◆LB◆\det A◆RB◆\mathrm{adj}(A) A − 1 = L ◆ B ◆1◆ R B ◆◆ L B ◆ det A ◆ R B ◆ adj ( A ) So A A A is invertible.
(⇐ \Leftarrow ⇐ ) If A A A is invertible with A − 1 A^{-1} A − 1 Then
det ( A ) det ( A − 1 ) = det ( A A − 1 ) = det ( I ) = 1 \det(A)\det(A^{-1}) = \det(AA^{-1}) = \det(I) = 1 det ( A ) det ( A − 1 ) = det ( A A − 1 ) = det ( I ) = 1 . Since 1 ≠ 0 1 \neq 0 1 = 0 We must have det ( A ) ≠ 0 \det(A) \neq 0 det ( A ) = 0 .
■ \blacksquare ■
7.3 Proof: the trace equals the sum of eigenvalues
Theorem. For any 2 × 2 2 \times 2 2 × 2 matrix A A A , t r ( A ) = λ 1 + λ 2 \mathrm{tr}(A) = \lambda_1 + \lambda_2 tr ( A ) = λ 1 + λ 2 .
Proof. The characteristic equation is
det ( A − λ I ) = λ 2 − ( a + d ) λ + ( a d − b c ) = 0 \det(A - \lambda I) = \lambda^2 - (a + d)\lambda + (ad - bc) = 0 det ( A − λ I ) = λ 2 − ( a + d ) λ + ( a d − b c ) = 0 .
By Vieta’s formulas, the sum of the roots is the negative coefficient of λ \lambda λ :
λ 1 + λ 2 = a + d = t r ( A ) ■ \lambda_1 + \lambda_2 = a + d = \mathrm{tr}(A) \quad \blacksquare λ 1 + λ 2 = a + d = tr ( A ) ■
7.4 Proof: area scale factor via determinant
Theorem. The linear transformation represented by a 2 × 2 2 \times 2 2 × 2 matrix A A A scales areas by
∣ det ( A ) ∣ |\det(A)| ∣ det ( A ) ∣ .
Proof. The unit square with vertices
0 , e 1 , e 2 , e 1 + e 2 \mathbf{0}, \mathbf{e}_1, \mathbf{e}_2, \mathbf{e}_1 + \mathbf{e}_2 0 , e 1 , e 2 , e 1 + e 2 is mapped to a parallelogram
With vertices 0 , A e 1 , A e 2 , A e 1 + A e 2 \mathbf{0}, A\mathbf{e}_1, A\mathbf{e}_2, A\mathbf{e}_1 + A\mathbf{e}_2 0 , A e 1 , A e 2 , A e 1 + A e 2 .
The area of this parallelogram is the magnitude of the cross product (in 2D, the determinant):
Area = ∣ det ( a b c d ) ∣ = ∣ det A ∣ \text{Area} = \left|\det\begin{pmatrix} a & b \\ c & d \end{pmatrix}\right| = |\det A| Area = det ( a c b d ) = ∣ det A ∣
Any region can be tiled by infinitesimal parallelograms, so the general scale factor is ∣ det A ∣ |\det A| ∣ det A ∣ .
■ \blacksquare ■
8. Common Pitfalls
:::caution Common Pitfall
Matrix multiplication order: A B AB A B means “apply B B B first, then A A A .” When combining
transformations, the second transformation is written on the left. Always read right-to-left.
3x3 determinant sign errors: The cofactor expansion alternates signs + + + , − - − , + + + along the
first row. A common mistake is to forget the − - − sign on the middle term.
Singular matrix checks: Before finding an inverse, always verify det ( A ) ≠ 0 \det(A) \neq 0 det ( A ) = 0 . If the
determinant is zero, the matrix has no inverse and the system A x = b A\mathbf{x} = \mathbf{b} A x = b has
either no solutions or infinitely many.
Eigenvectors are not unique: Any non-zero scalar multiple of an eigenvector is also an
eigenvector. When diagonalising, ensure consistency: the columns of P P P must match the order of
eigenvalues in D D D .
Repeated eigenvalues: A repeated eigenvalue does not necessarily give two independent
eigenvectors. Check by attempting to solve ( A − λ I ) v = 0 (A - \lambda I)\mathbf{v} = \mathbf{0} ( A − λ I ) v = 0 .
9. Additional Exam-Style Questions
Question 5
The matrix A = ( 3 1 − 1 1 ) A = \begin{pmatrix} 3 & 1 \\ -1 & 1 \end{pmatrix} A = ( 3 − 1 1 1 ) represents a linear transformation.
(a) Find the eigenvalues and eigenvectors of A A A .
(b) Write down a matrix P P P and a diagonal matrix D D D such that P − 1 A P = D P^{-1}AP = D P − 1 A P = D .
(c) Hence find A 5 A^5 A 5 .
Solution
(a) Characteristic equation: ( 3 − λ ) ( 1 − λ ) + 1 = 0 (3 - \lambda)(1 - \lambda) + 1 = 0 ( 3 − λ ) ( 1 − λ ) + 1 = 0
λ 2 − 4 λ + 4 = 0 ⟹ ( λ − 2 ) 2 = 0 \lambda^2 - 4\lambda + 4 = 0 \implies (\lambda - 2)^2 = 0 λ 2 − 4 λ + 4 = 0 ⟹ ( λ − 2 ) 2 = 0
λ = 2 \lambda = 2 λ = 2 (repeated).
( 1 1 − 1 − 1 ) ( x y ) = 0 ⟹ x + y = 0 \begin{pmatrix} 1 & 1 \\ -1 & -1 \end{pmatrix}\begin{pmatrix} x \\ y \end{pmatrix} = \mathbf{0} \implies x + y = 0 ( 1 − 1 1 − 1 ) ( x y ) = 0 ⟹ x + y = 0 .
Eigenvector: ( 1 − 1 ) \begin{pmatrix} 1 \\ -1 \end{pmatrix} ( 1 − 1 ) .
Only one independent eigenvector, so A A A is not diagonalisable.
(b) Since A A A is not diagonalisable, we cannot find P P P and D D D in the usual way. The best we
Can do is Jordan form, which is beyond A-Level scope.
(c) For A n A^n A n with a non-diagonalisable 2 × 2 2 \times 2 2 × 2 matrix with repeated eigenvalue λ \lambda λ :
A n = λ n I + n λ n − 1 ( A − λ I ) A^n = \lambda^n I + n\lambda^{n-1}(A - \lambda I) A n = λ n I + n λ n − 1 ( A − λ I )
A − 2 I = ( 1 1 − 1 − 1 ) A - 2I = \begin{pmatrix} 1 & 1 \\ -1 & -1 \end{pmatrix} A − 2 I = ( 1 − 1 1 − 1 ) .
A 5 = 2 5 I + 5 ⋅ 2 4 ( 1 1 − 1 − 1 ) = ( 32 0 0 32 ) + ( 80 80 − 80 − 80 ) A^5 = 2^5 I + 5 \cdot 2^4 \begin{pmatrix} 1 & 1 \\ -1 & -1 \end{pmatrix} = \begin{pmatrix} 32 & 0 \\ 0 & 32 \end{pmatrix} + \begin{pmatrix} 80 & 80 \\ -80 & -80 \end{pmatrix} A 5 = 2 5 I + 5 ⋅ 2 4 ( 1 − 1 1 − 1 ) = ( 32 0 0 32 ) + ( 80 − 80 80 − 80 )
= ( 112 80 − 80 − 48 ) = \begin{pmatrix} 112 & 80 \\ -80 & -48 \end{pmatrix} = ( 112 − 80 80 − 48 ) .
Question 6
(a) Find the 3 × 3 3 \times 3 3 × 3 matrix M M M that represents a rotation of 90 ∘ 90^\circ 9 0 ∘ anticlockwise
About the x x x -axis.
(b) Verify that det ( M ) = 1 \det(M) = 1 det ( M ) = 1 .
(c) The point ( 1 , 1 , 0 ) (1, 1, 0) ( 1 , 1 , 0 ) is transformed by M M M . Find its image.
Solution
(a) A rotation of θ \theta θ about the x x x -axis leaves x x x unchanged and rotates the y y y -z z z
Plane:
M = ( 1 0 0 0 cos 90 ∘ − sin 90 ∘ 0 sin 90 ∘ cos 90 ∘ ) = ( 1 0 0 0 0 − 1 0 1 0 ) M = \begin{pmatrix} 1 & 0 & 0 \\ 0 & \cos 90^\circ & -\sin 90^\circ \\ 0 & \sin 90^\circ & \cos 90^\circ \end{pmatrix} = \begin{pmatrix} 1 & 0 & 0 \\ 0 & 0 & -1 \\ 0 & 1 & 0 \end{pmatrix} M = 1 0 0 0 cos 9 0 ∘ sin 9 0 ∘ 0 − sin 9 0 ∘ cos 9 0 ∘ = 1 0 0 0 0 1 0 − 1 0
(b) Expanding along the first row:
det M = 1 ∣ 0 − 1 1 0 ∣ − 0 + 0 = 0 − ( − 1 ) = 1 \det M = 1\begin{vmatrix} 0 & -1 \\ 1 & 0 \end{vmatrix} - 0 + 0 = 0 - (-1) = 1 det M = 1 0 1 − 1 0 − 0 + 0 = 0 − ( − 1 ) = 1 . Verified.
(c)
( 1 0 0 0 0 − 1 0 1 0 ) ( 1 1 0 ) = ( 1 0 1 ) \begin{pmatrix} 1 & 0 & 0 \\ 0 & 0 & -1 \\ 0 & 1 & 0 \end{pmatrix}\begin{pmatrix} 1 \\ 1 \\ 0 \end{pmatrix} = \begin{pmatrix} 1 \\ 0 \\ 1 \end{pmatrix} 1 0 0 0 0 1 0 − 1 0 1 1 0 = 1 0 1 .
The image is ( 1 , 0 , 1 ) (1, 0, 1) ( 1 , 0 , 1 ) .
Question 7
The transformation T T T is defined by the matrix A = ( 2 3 0 2 ) A = \begin{pmatrix} 2 & 3 \\ 0 & 2 \end{pmatrix} A = ( 2 0 3 2 ) .
(a) Find the invariant points of T T T .
(b) Show that the line y = 0 y = 0 y = 0 is an invariant line of T T T .
(c) Find another invariant line of T T T .
Solution
(a) Invariant points satisfy A x = x A\mathbf{x} = \mathbf{x} A x = x :
( 2 3 0 2 ) ( x y ) = ( x y ) \begin{pmatrix} 2 & 3 \\ 0 & 2 \end{pmatrix}\begin{pmatrix} x \\ y \end{pmatrix} = \begin{pmatrix} x \\ y \end{pmatrix} ( 2 0 3 2 ) ( x y ) = ( x y )
2 x + 3 y = x ⟹ x + 3 y = 0 2x + 3y = x \implies x + 3y = 0 2 x + 3 y = x ⟹ x + 3 y = 0 And 2 y = y ⟹ y = 0 2y = y \implies y = 0 2 y = y ⟹ y = 0 .
So x = 0 x = 0 x = 0 and y = 0 y = 0 y = 0 . The only invariant point is the origin.
(b) Points on y = 0 y = 0 y = 0 have the form ( x , 0 ) (x, 0) ( x , 0 ) :
( 2 3 0 2 ) ( x 0 ) = ( 2 x 0 ) \begin{pmatrix} 2 & 3 \\ 0 & 2 \end{pmatrix}\begin{pmatrix} x \\ 0 \end{pmatrix} = \begin{pmatrix} 2x \\ 0 \end{pmatrix} ( 2 0 3 2 ) ( x 0 ) = ( 2 x 0 )
The image ( 2 x , 0 ) (2x, 0) ( 2 x , 0 ) also lies on y = 0 y = 0 y = 0 So y = 0 y = 0 y = 0 is an invariant line.
(c) For an invariant line y = m x y = mx y = m x We need
A ( 1 m ) = λ ( 1 m ) A\begin{pmatrix} 1 \\ m \end{pmatrix} = \lambda\begin{pmatrix} 1 \\ m \end{pmatrix} A ( 1 m ) = λ ( 1 m ) :
2 + 3 m = λ 2 + 3m = \lambda 2 + 3 m = λ and 2 m = λ m 2m = \lambda m 2 m = λm .
From the second equation: m ( 2 − λ ) = 0 m(2 - \lambda) = 0 m ( 2 − λ ) = 0 .
If m = 0 m = 0 m = 0 We get the line y = 0 y = 0 y = 0 (already found).
If λ = 2 \lambda = 2 λ = 2 : 2 + 3 m = 2 ⟹ m = 0 2 + 3m = 2 \implies m = 0 2 + 3 m = 2 ⟹ m = 0 again.
For a line not through the origin, try y = m x + c y = mx + c y = m x + c with c ≠ 0 c \neq 0 c = 0 :
( 2 3 0 2 ) ( x m x + c ) = ( ( 2 + 3 m ) x + 3 c 2 m x + 2 c ) \begin{pmatrix} 2 & 3 \\ 0 & 2 \end{pmatrix}\begin{pmatrix} x \\ mx + c \end{pmatrix} = \begin{pmatrix} (2 + 3m)x + 3c \\ 2mx + 2c \end{pmatrix} ( 2 0 3 2 ) ( x m x + c ) = ( ( 2 + 3 m ) x + 3 c 2 m x + 2 c )
For this to lie on y = m x + c y = mx + c y = m x + c : 2 m x + 2 c = m ( 2 + 3 m ) x + 3 m c + c 2mx + 2c = m(2 + 3m)x + 3mc + c 2 m x + 2 c = m ( 2 + 3 m ) x + 3 m c + c .
Comparing coefficients: 2 m = m ( 2 + 3 m ) ⟹ 3 m 2 = 0 ⟹ m = 0 2m = m(2 + 3m) \implies 3m^2 = 0 \implies m = 0 2 m = m ( 2 + 3 m ) ⟹ 3 m 2 = 0 ⟹ m = 0 .
Then: 2 c = c ⟹ c = 0 2c = c \implies c = 0 2 c = c ⟹ c = 0 .
The only invariant line is y = 0 y = 0 y = 0 .
10. Advanced Worked Examples
Example 10.1: 3x3 eigenvalues and eigenvectors
Problem. Find the eigenvalues and eigenvectors of
A = ( 2 1 0 1 3 1 0 1 2 ) A = \begin{pmatrix} 2 & 1 & 0 \\ 1 & 3 & 1 \\ 0 & 1 & 2 \end{pmatrix} A = 2 1 0 1 3 1 0 1 2 .
Solution. Characteristic equation:
det ( A − λ I ) = ∣ 2 − λ 1 0 1 3 − λ 1 0 1 2 − λ ∣ = 0 \det(A - \lambda I) = \begin{vmatrix} 2-\lambda & 1 & 0 \\ 1 & 3-\lambda & 1 \\ 0 & 1 & 2-\lambda \end{vmatrix} = 0 det ( A − λ I ) = 2 − λ 1 0 1 3 − λ 1 0 1 2 − λ = 0
Expanding along the first row:
( 2 − λ ) ∣ 3 − λ 1 1 2 − λ ∣ − 1 ∣ 1 1 0 2 − λ ∣ + 0 (2-\lambda)\begin{vmatrix} 3-\lambda & 1 \\ 1 & 2-\lambda \end{vmatrix} - 1\begin{vmatrix} 1 & 1 \\ 0 & 2-\lambda \end{vmatrix} + 0 ( 2 − λ ) 3 − λ 1 1 2 − λ − 1 1 0 1 2 − λ + 0
= ( 2 − λ ) [ ( 3 − λ ) ( 2 − λ ) − 1 ] − ( 2 − λ ) = (2-\lambda)[(3-\lambda)(2-\lambda)-1] - (2-\lambda) = ( 2 − λ ) [( 3 − λ ) ( 2 − λ ) − 1 ] − ( 2 − λ )
= ( 2 − λ ) [ ( 3 − λ ) ( 2 − λ ) − 2 ] = ( 2 − λ ) [ λ 2 − 5 λ + 4 ] = ( 2 − λ ) ( λ − 1 ) ( λ − 4 ) = (2-\lambda)[(3-\lambda)(2-\lambda) - 2] = (2-\lambda)[\lambda^2 - 5\lambda + 4] = (2-\lambda)(\lambda-1)(\lambda-4) = ( 2 − λ ) [( 3 − λ ) ( 2 − λ ) − 2 ] = ( 2 − λ ) [ λ 2 − 5 λ + 4 ] = ( 2 − λ ) ( λ − 1 ) ( λ − 4 )
Eigenvalues: \lambda_1 = 1$$\lambda_2 = 2$$\lambda_3 = 4 .
For λ 1 = 1 \lambda_1 = 1 λ 1 = 1 :
( 1 1 0 1 2 1 0 1 1 ) ( x y z ) = 0 \begin{pmatrix} 1 & 1 & 0 \\ 1 & 2 & 1 \\ 0 & 1 & 1 \end{pmatrix}\begin{pmatrix} x \\ y \\ z \end{pmatrix} = \mathbf{0} 1 1 0 1 2 1 0 1 1 x y z = 0
x + y = 0$$x + 2y + z = 0$$y + z = 0 . From the first: x = − y x = -y x = − y . From the third: z = − y z = -y z = − y .
Eigenvector: ( 1 − 1 1 ) \begin{pmatrix} 1 \\ -1 \\ 1 \end{pmatrix} 1 − 1 1 .
For λ 2 = 2 \lambda_2 = 2 λ 2 = 2 :
( 0 1 0 1 1 1 0 1 0 ) ( x y z ) = 0 \begin{pmatrix} 0 & 1 & 0 \\ 1 & 1 & 1 \\ 0 & 1 & 0 \end{pmatrix}\begin{pmatrix} x \\ y \\ z \end{pmatrix} = \mathbf{0} 0 1 0 1 1 1 0 1 0 x y z = 0
y = 0 y = 0 y = 0 , x + z = 0 x + z = 0 x + z = 0 . Eigenvector: ( 1 0 − 1 ) \begin{pmatrix} 1 \\ 0 \\ -1 \end{pmatrix} 1 0 − 1 .
For λ 3 = 4 \lambda_3 = 4 λ 3 = 4 :
( − 2 1 0 1 − 1 1 0 1 − 2 ) ( x y z ) = 0 \begin{pmatrix} -2 & 1 & 0 \\ 1 & -1 & 1 \\ 0 & 1 & -2 \end{pmatrix}\begin{pmatrix} x \\ y \\ z \end{pmatrix} = \mathbf{0} − 2 1 0 1 − 1 1 0 1 − 2 x y z = 0
− 2 x + y = 0 ⟹ y = 2 x -2x + y = 0 \implies y = 2x − 2 x + y = 0 ⟹ y = 2 x . y − 2 z = 0 ⟹ z = x y - 2z = 0 \implies z = x y − 2 z = 0 ⟹ z = x . Eigenvector:
( 1 2 1 ) \begin{pmatrix} 1 \\ 2 \\ 1 \end{pmatrix} 1 2 1 .
Example 10.2: Diagonalisation of a 3x3 matrix
Problem. Using the eigenvalues and eigenvectors from Example 10.1, diagonalise A A A and hence
Find A 4 A^4 A 4 .
Solution. P = ( 1 1 1 − 1 0 2 1 − 1 1 ) P = \begin{pmatrix} 1 & 1 & 1 \\ -1 & 0 & 2 \\ 1 & -1 & 1 \end{pmatrix} P = 1 − 1 1 1 0 − 1 1 2 1
D = ( 1 0 0 0 2 0 0 0 4 ) D = \begin{pmatrix} 1 & 0 & 0 \\ 0 & 2 & 0 \\ 0 & 0 & 4 \end{pmatrix} D = 1 0 0 0 2 0 0 0 4 .
det P = 1 ( 0 − ( − 2 ) ) − 1 ( ( − 1 ) − 2 ) + 1 ( 1 − 0 ) = 2 + 3 + 1 = 6 \det P = 1(0-(-2)) - 1((-1)-2) + 1(1-0) = 2 + 3 + 1 = 6 det P = 1 ( 0 − ( − 2 )) − 1 (( − 1 ) − 2 ) + 1 ( 1 − 0 ) = 2 + 3 + 1 = 6 .
P − 1 = 1 6 ( 2 0 2 3 0 − 3 1 2 1 ) P^{-1} = \frac{1}{6}\begin{pmatrix} 2 & 0 & 2 \\ 3 & 0 & -3 \\ 1 & 2 & 1 \end{pmatrix} P − 1 = 6 1 2 3 1 0 0 2 2 − 3 1
A 4 = P D 4 P − 1 A^4 = PD^4P^{-1} A 4 = P D 4 P − 1 :
D 4 = ( 1 0 0 0 16 0 0 0 256 ) D^4 = \begin{pmatrix} 1 & 0 & 0 \\ 0 & 16 & 0 \\ 0 & 0 & 256 \end{pmatrix} D 4 = 1 0 0 0 16 0 0 0 256
P D 4 = ( 1 16 256 − 1 0 512 1 − 16 256 ) PD^4 = \begin{pmatrix} 1 & 16 & 256 \\ -1 & 0 & 512 \\ 1 & -16 & 256 \end{pmatrix} P D 4 = 1 − 1 1 16 0 − 16 256 512 256
A 4 = 1 6 ( 1 16 256 − 1 0 512 1 − 16 256 ) ( 2 0 2 3 0 − 3 1 2 1 ) A^4 = \frac{1}{6}\begin{pmatrix} 1 & 16 & 256 \\ -1 & 0 & 512 \\ 1 & -16 & 256 \end{pmatrix}\begin{pmatrix} 2 & 0 & 2 \\ 3 & 0 & -3 \\ 1 & 2 & 1 \end{pmatrix} A 4 = 6 1 1 − 1 1 16 0 − 16 256 512 256 2 3 1 0 0 2 2 − 3 1
= 1 6 ( 2 + 48 + 256 512 − 768 + 512 2 − 48 + 256 − 2 + 512 1024 − 2 − 768 + 512 2 − 48 + 256 512 + 256 2 + 48 + 256 ) = \frac{1}{6}\begin{pmatrix} 2+48+256 & 512-768+512 & 2-48+256 \\ -2+512 & 1024 & -2-768+512 \\ 2-48+256 & 512+256 & 2+48+256 \end{pmatrix} = 6 1 2 + 48 + 256 − 2 + 512 2 − 48 + 256 512 − 768 + 512 1024 512 + 256 2 − 48 + 256 − 2 − 768 + 512 2 + 48 + 256
= 1 6 ( 306 256 210 510 1024 − 258 210 768 306 ) = ( 51 128 / 3 35 85 512 / 3 − 43 35 128 51 ) = \frac{1}{6}\begin{pmatrix} 306 & 256 & 210 \\ 510 & 1024 & -258 \\ 210 & 768 & 306 \end{pmatrix} = \begin{pmatrix} 51 & 128/3 & 35 \\ 85 & 512/3 & -43 \\ 35 & 128 & 51 \end{pmatrix} = 6 1 306 510 210 256 1024 768 210 − 258 306 = 51 85 35 128/3 512/3 128 35 − 43 51
Example 10.3: Reflection in an arbitrary line
Problem. Find the 2 × 2 2 \times 2 2 × 2 matrix representing reflection in the line y = m x y = mx y = m x .
Solution. The line y = m x y = mx y = m x makes angle θ = arctan m \theta = \arctan m θ = arctan m with the x x x -axis. The reflection
Matrix is obtained by:
Rotate by − θ -\theta − θ to align the line with the x x x -axis.
Reflect in the x x x -axis.
Rotate back by θ \theta θ .
R − θ = ( cos θ sin θ sin θ − cos θ ) R_{-\theta} = \begin{pmatrix} \cos\theta & \sin\theta \\ \sin\theta & -\cos\theta \end{pmatrix} R − θ = ( cos θ sin θ sin θ − cos θ )
Wait — the reflection matrix in a line at angle θ \theta θ to the x x x -axis is:
M = ( cos 2 θ sin 2 θ sin 2 θ − cos 2 θ ) M = \begin{pmatrix} \cos 2\theta & \sin 2\theta \\ \sin 2\theta & -\cos 2\theta \end{pmatrix} M = ( cos 2 θ sin 2 θ sin 2 θ − cos 2 θ )
This can be derived as R θ ( 1 0 0 − 1 ) R − θ R_\theta \begin{pmatrix} 1 & 0 \\ 0 & -1 \end{pmatrix} R_{-\theta} R θ ( 1 0 0 − 1 ) R − θ .
For m = 1 m = 1 m = 1 (θ = π / 4 \theta = \pi/4 θ = π /4 ): M = ( 0 1 1 0 ) M = \begin{pmatrix} 0 & 1 \\ 1 & 0 \end{pmatrix} M = ( 0 1 1 0 ) Which is
Reflection in y = x y = x y = x (consistent with the standard table).
Problem. The transformation T T T is represented by
A = ( 3 − 4 1 − 1 ) A = \begin{pmatrix} 3 & -4 \\ 1 & -1 \end{pmatrix} A = ( 3 1 − 4 − 1 ) . Find the invariant lines of T T T .
Solution. Characteristic equation: ( 3 − λ ) ( − 1 − λ ) + 4 = 0 (3-\lambda)(-1-\lambda) + 4 = 0 ( 3 − λ ) ( − 1 − λ ) + 4 = 0
− 3 − 3 λ + λ + λ 2 + 4 = 0 ⟹ λ 2 − 2 λ + 1 = 0 ⟹ ( λ − 1 ) 2 = 0 -3 - 3\lambda + \lambda + \lambda^2 + 4 = 0 \implies \lambda^2 - 2\lambda + 1 = 0 \implies (\lambda-1)^2 = 0 − 3 − 3 λ + λ + λ 2 + 4 = 0 ⟹ λ 2 − 2 λ + 1 = 0 ⟹ ( λ − 1 ) 2 = 0 .
λ = 1 \lambda = 1 λ = 1 (repeated). Eigenvector: ( A − I ) v = 0 (A-I)\mathbf{v} = \mathbf{0} ( A − I ) v = 0 :
( 2 − 4 1 − 2 ) ( x y ) = 0 ⟹ x − 2 y = 0 \begin{pmatrix} 2 & -4 \\ 1 & -2 \end{pmatrix}\begin{pmatrix} x \\ y \end{pmatrix} = \mathbf{0} \implies x - 2y = 0 ( 2 1 − 4 − 2 ) ( x y ) = 0 ⟹ x − 2 y = 0
Eigenvector: ( 2 1 ) \begin{pmatrix} 2 \\ 1 \end{pmatrix} ( 2 1 ) So the line y = x / 2 y = x/2 y = x /2 is invariant.
For non-trivial invariant lines not through the origin, try y = m x + c y = mx + c y = m x + c with c ≠ 0 c \neq 0 c = 0 :
( 3 − 4 1 − 1 ) ( x m x + c ) = ( ( 3 − 4 m ) x − 4 c ( 1 − m ) x − c ) \begin{pmatrix} 3 & -4 \\ 1 & -1 \end{pmatrix}\begin{pmatrix} x \\ mx+c \end{pmatrix} = \begin{pmatrix} (3-4m)x - 4c \\ (1-m)x - c \end{pmatrix} ( 3 1 − 4 − 1 ) ( x m x + c ) = ( ( 3 − 4 m ) x − 4 c ( 1 − m ) x − c )
For this to lie on y = m x + c y = mx + c y = m x + c : ( 1 − m ) x − c = m ( 3 − 4 m ) x − 4 m c + c (1-m)x - c = m(3-4m)x - 4mc + c ( 1 − m ) x − c = m ( 3 − 4 m ) x − 4 m c + c .
Comparing coefficients of x x x : 1 − m = m ( 3 − 4 m ) = 3 m − 4 m 2 1 - m = m(3 - 4m) = 3m - 4m^2 1 − m = m ( 3 − 4 m ) = 3 m − 4 m 2 .
4 m 2 − 4 m + 1 = 0 ⟹ ( 2 m − 1 ) 2 = 0 ⟹ m = 1 / 2 4m^2 - 4m + 1 = 0 \implies (2m - 1)^2 = 0 \implies m = 1/2 4 m 2 − 4 m + 1 = 0 ⟹ ( 2 m − 1 ) 2 = 0 ⟹ m = 1/2
Comparing constants: − c = − 4 m c + c ⟹ 4 m c = 2 c ⟹ c ( 2 m − 1 ) = 0 -c = -4mc + c \implies 4mc = 2c \implies c(2m - 1) = 0 − c = − 4 m c + c ⟹ 4 m c = 2 c ⟹ c ( 2 m − 1 ) = 0 .
Since m = 1 / 2 m = 1/2 m = 1/2 : c ( 0 ) = 0 c(0) = 0 c ( 0 ) = 0 Which is satisfied for all c c c .
Therefore every line of the form y = x / 2 + c y = x/2 + c y = x /2 + c is invariant under T T T .
Example 10.5: Matrix representation of rotation about an arbitrary point
Problem. Find the 3 × 3 3 \times 3 3 × 3 matrix (using homogeneous coordinates) that represents a rotation
Of θ \theta θ about the point ( a , b ) (a, b) ( a , b ) in the plane.
Solution. Using the homogeneous coordinate system where a point ( x , y ) (x, y) ( x , y ) is represented as
( x y 1 ) \begin{pmatrix}x\\y\\1\end{pmatrix} x y 1 :
Translate by ( − a , − b ) (-a, -b) ( − a , − b ) to move the centre to the origin.
Rotate by θ \theta θ .
Translate back by ( a , b ) (a, b) ( a , b ) .
M = ( 1 0 a 0 1 b 0 0 1 ) ( cos θ − sin θ 0 sin θ cos θ 0 0 0 1 ) ( 1 0 − a 0 1 − b 0 0 1 ) M = \begin{pmatrix} 1 & 0 & a \\ 0 & 1 & b \\ 0 & 0 & 1 \end{pmatrix}\begin{pmatrix} \cos\theta & -\sin\theta & 0 \\ \sin\theta & \cos\theta & 0 \\ 0 & 0 & 1 \end{pmatrix}\begin{pmatrix} 1 & 0 & -a \\ 0 & 1 & -b \\ 0 & 0 & 1 \end{pmatrix} M = 1 0 0 0 1 0 a b 1 cos θ sin θ 0 − sin θ cos θ 0 0 0 1 1 0 0 0 1 0 − a − b 1
= ( cos θ − sin θ a ( 1 − cos θ ) + b sin θ sin θ cos θ b ( 1 − cos θ ) − a sin θ 0 0 1 ) = \begin{pmatrix} \cos\theta & -\sin\theta & a(1-\cos\theta)+b\sin\theta \\ \sin\theta & \cos\theta & b(1-\cos\theta)-a\sin\theta \\ 0 & 0 & 1 \end{pmatrix} = cos θ sin θ 0 − sin θ cos θ 0 a ( 1 − cos θ ) + b sin θ b ( 1 − cos θ ) − a sin θ 1
Example 10.6: Determinant and area of a triangle
Problem. The vertices of a triangle are A(1, 2)$$B(4, 6)$$C(3, -1) . Find the area using
Determinants.
Solution.
Area = 1 2 ∣ det ( 1 2 1 4 6 1 3 − 1 1 ) ∣ \text{Area} = \frac{1}{2}\left|\det\begin{pmatrix} 1 & 2 & 1 \\ 4 & 6 & 1 \\ 3 & -1 & 1 \end{pmatrix}\right| Area = 2 1 det 1 4 3 2 6 − 1 1 1 1
Expanding along the third column:
= 1 2 ∣ 1 ⋅ ∣ 4 6 3 − 1 ∣ − 1 ⋅ ∣ 1 2 3 − 1 ∣ + 1 ⋅ ∣ 1 2 4 6 ∣ ∣ = \dfrac{1}{2}\left|1\cdot\begin{vmatrix} 4 & 6 \\ 3 & -1 \end{vmatrix} - 1\cdot\begin{vmatrix} 1 & 2 \\ 3 & -1 \end{vmatrix} + 1\cdot\begin{vmatrix} 1 & 2 \\ 4 & 6 \end{vmatrix}\right| = 2 1 1 ⋅ 4 3 6 − 1 − 1 ⋅ 1 3 2 − 1 + 1 ⋅ 1 4 2 6
= 1 2 ∣ ( − 4 − 18 ) − ( − 1 − 6 ) + ( 6 − 8 ) ∣ = 1 2 ∣ − 22 + 7 − 2 ∣ = 17 2 = \dfrac{1}{2}|(-4-18) - (-1-6) + (6-8)| = \dfrac{1}{2}|-22 + 7 - 2| = \dfrac{17}{2} = 2 1 ∣ ( − 4 − 18 ) − ( − 1 − 6 ) + ( 6 − 8 ) ∣ = 2 1 ∣ − 22 + 7 − 2∣ = 2 17
Example 10.7: Solving a system using the inverse
Problem. Solve the system x + 2y + z = 4$$2x + y + z = 3$$x + y + 2z = 5 .
Solution. The system is A x = b A\mathbf{x} = \mathbf{b} A x = b where:
A = ( 1 2 1 2 1 1 1 1 2 ) , b = ( 4 3 5 ) A = \begin{pmatrix} 1 & 2 & 1 \\ 2 & 1 & 1 \\ 1 & 1 & 2 \end{pmatrix}, \quad \mathbf{b} = \begin{pmatrix} 4 \\ 3 \\ 5 \end{pmatrix} A = 1 2 1 2 1 1 1 1 2 , b = 4 3 5
det A = 1 ( 2 − 1 ) − 2 ( 4 − 1 ) + 1 ( 2 − 1 ) = 1 − 6 + 1 = − 4 \det A = 1(2-1) - 2(4-1) + 1(2-1) = 1 - 6 + 1 = -4 det A = 1 ( 2 − 1 ) − 2 ( 4 − 1 ) + 1 ( 2 − 1 ) = 1 − 6 + 1 = − 4 .
Using Cramer’s rule:
x = ◆ L B ◆ det ( 4 2 1 3 1 1 5 1 2 ) ◆ R B ◆◆ L B ◆ − 4 ◆ R B ◆ = 4 ( 2 − 1 ) − 2 ( 6 − 5 ) + 1 ( 3 − 5 ) − 4 = 4 − 2 − 2 − 4 = 0 x = \frac◆LB◆\det\begin{pmatrix} 4 & 2 & 1 \\ 3 & 1 & 1 \\ 5 & 1 & 2 \end{pmatrix}◆RB◆◆LB◆-4◆RB◆ = \frac{4(2-1) - 2(6-5) + 1(3-5)}{-4} = \frac{4 - 2 - 2}{-4} = 0 x = L ◆ B ◆ det 4 3 5 2 1 1 1 1 2 ◆ R B ◆◆ L B ◆ − 4◆ R B ◆ = − 4 4 ( 2 − 1 ) − 2 ( 6 − 5 ) + 1 ( 3 − 5 ) = − 4 4 − 2 − 2 = 0
y = ◆ L B ◆ det ( 1 4 1 2 3 1 1 5 2 ) ◆ R B ◆◆ L B ◆ − 4 ◆ R B ◆ = 1 ( 6 − 5 ) − 4 ( 4 − 1 ) + 1 ( 10 − 3 ) − 4 = 1 − 12 + 7 − 4 = 1 y = \frac◆LB◆\det\begin{pmatrix} 1 & 4 & 1 \\ 2 & 3 & 1 \\ 1 & 5 & 2 \end{pmatrix}◆RB◆◆LB◆-4◆RB◆ = \frac{1(6-5) - 4(4-1) + 1(10-3)}{-4} = \frac{1 - 12 + 7}{-4} = 1 y = L ◆ B ◆ det 1 2 1 4 3 5 1 1 2 ◆ R B ◆◆ L B ◆ − 4◆ R B ◆ = − 4 1 ( 6 − 5 ) − 4 ( 4 − 1 ) + 1 ( 10 − 3 ) = − 4 1 − 12 + 7 = 1
z = ◆ L B ◆ det ( 1 2 4 2 1 3 1 1 5 ) ◆ R B ◆◆ L B ◆ − 4 ◆ R B ◆ = 1 ( 5 − 3 ) − 2 ( 10 − 3 ) + 4 ( 2 − 1 ) − 4 = 2 − 14 + 4 − 4 = 2 z = \frac◆LB◆\det\begin{pmatrix} 1 & 2 & 4 \\ 2 & 1 & 3 \\ 1 & 1 & 5 \end{pmatrix}◆RB◆◆LB◆-4◆RB◆ = \frac{1(5-3) - 2(10-3) + 4(2-1)}{-4} = \frac{2 - 14 + 4}{-4} = 2 z = L ◆ B ◆ det 1 2 1 2 1 1 4 3 5 ◆ R B ◆◆ L B ◆ − 4◆ R B ◆ = − 4 1 ( 5 − 3 ) − 2 ( 10 − 3 ) + 4 ( 2 − 1 ) = − 4 2 − 14 + 4 = 2
Solution: x = 0 x = 0 x = 0 , y = 1 y = 1 y = 1 , z = 2 z = 2 z = 2 .
11. Connections to Other Topics
11.1 Matrices and complex numbers
Complex numbers a + b i a + bi a + bi can be represented as ( a − b b a ) \begin{pmatrix}a & -b\\b & a\end{pmatrix} ( a b − b a ) .
Multiplication of complex numbers corresponds to matrix multiplication, and ∣ z ∣ 2 = det |z|^2 = \det ∣ z ∣ 2 = det of this
Matrix. See Complex Numbers .
11.2 Matrices and vectors
The cross product a × b \mathbf{a}\times\mathbf{b} a × b can be computed as a symbolic determinant with basis
Vectors i , j , k \mathbf{i}, \mathbf{j}, \mathbf{k} i , j , k . See
Vectors in 3D .
11.3 Eigenvalues and differential equations
Diagonalisation is used to solve systems of coupled linear differential equations. The eigenvalues
Determine the form of the solution. See
Differential Equations .
12. Additional Exam-Style Questions
Question 8
The matrix B = ( 1 0 2 0 2 0 2 0 1 ) B = \begin{pmatrix} 1 & 0 & 2 \\ 0 & 2 & 0 \\ 2 & 0 & 1 \end{pmatrix} B = 1 0 2 0 2 0 2 0 1 .
(a) Find the eigenvalues and eigenvectors of B B B .
(b) Verify that B B B is diagonalisable and write down P P P and D D D .
Solution
(a)
det ( B − λ I ) = ∣ 1 − λ 0 2 0 2 − λ 0 2 0 1 − λ ∣ = ( 2 − λ ) [ ( 1 − λ ) 2 − 4 ] \det(B - \lambda I) = \begin{vmatrix} 1-\lambda & 0 & 2 \\ 0 & 2-\lambda & 0 \\ 2 & 0 & 1-\lambda \end{vmatrix} = (2-\lambda)[(1-\lambda)^2 - 4] det ( B − λ I ) = 1 − λ 0 2 0 2 − λ 0 2 0 1 − λ = ( 2 − λ ) [( 1 − λ ) 2 − 4 ]
= ( 2 − λ ) ( λ 2 − 2 λ − 3 ) = ( 2 − λ ) ( λ − 3 ) ( λ + 1 ) = (2-\lambda)(\lambda^2 - 2\lambda - 3) = (2-\lambda)(\lambda-3)(\lambda+1) = ( 2 − λ ) ( λ 2 − 2 λ − 3 ) = ( 2 − λ ) ( λ − 3 ) ( λ + 1 ) .
Eigenvalues: \lambda_1 = -1$$\lambda_2 = 2$$\lambda_3 = 3 .
λ = − 1 \lambda = -1 λ = − 1 :
( 2 0 2 0 3 0 2 0 2 ) v = 0 ⟹ x + z = 0 , y = 0 \begin{pmatrix} 2 & 0 & 2 \\ 0 & 3 & 0 \\ 2 & 0 & 2 \end{pmatrix}\mathbf{v} = \mathbf{0} \implies x + z = 0, y = 0 2 0 2 0 3 0 2 0 2 v = 0 ⟹ x + z = 0 , y = 0 .
Eigenvector: ( 1 0 − 1 ) \begin{pmatrix}1\\0\\-1\end{pmatrix} 1 0 − 1 .
λ = 2 \lambda = 2 λ = 2 :
( − 1 0 2 0 0 0 2 0 − 1 ) v = 0 ⟹ x = 2 z \begin{pmatrix} -1 & 0 & 2 \\ 0 & 0 & 0 \\ 2 & 0 & -1 \end{pmatrix}\mathbf{v} = \mathbf{0} \implies x = 2z − 1 0 2 0 0 0 2 0 − 1 v = 0 ⟹ x = 2 z .
Eigenvector: ( 2 1 1 ) \begin{pmatrix}2\\1\\1\end{pmatrix} 2 1 1 (using y y y as free variable too).
Actually: − x + 2 z = 0 ⟹ x = 2 z -x + 2z = 0 \implies x = 2z − x + 2 z = 0 ⟹ x = 2 z . y y y is free. Eigenvector:
( 0 1 0 ) \begin{pmatrix}0\\1\\0\end{pmatrix} 0 1 0 .
λ = 3 \lambda = 3 λ = 3 :
( − 2 0 2 0 − 1 0 2 0 − 2 ) v = 0 ⟹ x = z , y = 0 \begin{pmatrix} -2 & 0 & 2 \\ 0 & -1 & 0 \\ 2 & 0 & -2 \end{pmatrix}\mathbf{v} = \mathbf{0} \implies x = z, y = 0 − 2 0 2 0 − 1 0 2 0 − 2 v = 0 ⟹ x = z , y = 0 .
Eigenvector: ( 1 0 1 ) \begin{pmatrix}1\\0\\1\end{pmatrix} 1 0 1 .
(b) Three independent eigenvectors, so B B B is diagonalisable.
P = ( 1 0 1 0 1 0 − 1 0 1 ) , D = ( − 1 0 0 0 2 0 0 0 3 ) P = \begin{pmatrix} 1 & 0 & 1 \\ 0 & 1 & 0 \\ -1 & 0 & 1 \end{pmatrix}, \quad D = \begin{pmatrix} -1 & 0 & 0 \\ 0 & 2 & 0 \\ 0 & 0 & 3 \end{pmatrix} P = 1 0 − 1 0 1 0 1 0 1 , D = − 1 0 0 0 2 0 0 0 3
Question 9
Find the matrix representing an enlargement of scale factor 3 3 3 from the point ( 1 , 2 ) (1, 2) ( 1 , 2 ) Using
Homogeneous coordinates.
Solution
In homogeneous coordinates, this is the composite of translate by ( − 1 , − 2 ) (-1, -2) ( − 1 , − 2 ) Enlarge by 3 3 3 And
Translate back by ( 1 , 2 ) (1, 2) ( 1 , 2 ) :
M = ( 1 0 1 0 1 2 0 0 1 ) ( 3 0 0 0 3 0 0 0 1 ) ( 1 0 − 1 0 1 − 2 0 0 1 ) = ( 3 0 − 2 0 3 − 4 0 0 1 ) M = \begin{pmatrix} 1 & 0 & 1 \\ 0 & 1 & 2 \\ 0 & 0 & 1 \end{pmatrix}\begin{pmatrix} 3 & 0 & 0 \\ 0 & 3 & 0 \\ 0 & 0 & 1 \end{pmatrix}\begin{pmatrix} 1 & 0 & -1 \\ 0 & 1 & -2 \\ 0 & 0 & 1 \end{pmatrix} = \begin{pmatrix} 3 & 0 & -2 \\ 0 & 3 & -4 \\ 0 & 0 & 1 \end{pmatrix} M = 1 0 0 0 1 0 1 2 1 3 0 0 0 3 0 0 0 1 1 0 0 0 1 0 − 1 − 2 1 = 3 0 0 0 3 0 − 2 − 4 1
Question 10
Prove that if A A A has eigenvalues λ 1 , λ 2 \lambda_1, \lambda_2 λ 1 , λ 2 with λ 1 ≠ λ 2 \lambda_1 \neq \lambda_2 λ 1 = λ 2 Then A A A
is diagonalisable.
Solution
Since λ 1 ≠ λ 2 \lambda_1 \neq \lambda_2 λ 1 = λ 2 The eigenvectors v 1 \mathbf{v}_1 v 1 and v 2 \mathbf{v}_2 v 2 satisfy
( A − λ 1 I ) v 1 = 0 (A - \lambda_1 I)\mathbf{v}_1 = \mathbf{0} ( A − λ 1 I ) v 1 = 0 and ( A − λ 2 I ) v 2 = 0 (A - \lambda_2 I)\mathbf{v}_2 = \mathbf{0} ( A − λ 2 I ) v 2 = 0 .
Suppose v 1 \mathbf{v}_1 v 1 and v 2 \mathbf{v}_2 v 2 are linearly dependent: v 2 = c v 1 \mathbf{v}_2 = c\mathbf{v}_1 v 2 = c v 1 for
Some scalar c c c .
Then ( A − λ 2 I ) v 1 = 0 (A - \lambda_2 I)\mathbf{v}_1 = \mathbf{0} ( A − λ 2 I ) v 1 = 0 (dividing by c c c ), which means λ 1 \lambda_1 λ 1 and
λ 2 \lambda_2 λ 2 are both eigenvalues with eigenvector v 1 \mathbf{v}_1 v 1 . But
( A − λ 1 I ) v 1 = 0 (A - \lambda_1 I)\mathbf{v}_1 = \mathbf{0} ( A − λ 1 I ) v 1 = 0 and ( A − λ 2 I ) v 1 = 0 (A - \lambda_2 I)\mathbf{v}_1 = \mathbf{0} ( A − λ 2 I ) v 1 = 0
Together give ( λ 1 − λ 2 ) v 1 = 0 (\lambda_1 - \lambda_2)\mathbf{v}_1 = \mathbf{0} ( λ 1 − λ 2 ) v 1 = 0 Contradicting
λ 1 ≠ λ 2 \lambda_1 \neq \lambda_2 λ 1 = λ 2 and v 1 ≠ 0 \mathbf{v}_1 \neq \mathbf{0} v 1 = 0 .
Therefore v 1 \mathbf{v}_1 v 1 and v 2 \mathbf{v}_2 v 2 are linearly independent, P P P is invertible, and
A = P D P − 1 A = PDP^{-1} A = P D P − 1 . ■ \blacksquare ■
13. Advanced Worked Examples
Example 13.1: Finding eigenvectors of a symmetric matrix
Problem. Find the eigenvalues and a set of orthonormal eigenvectors of
A = ( 4 2 2 1 ) A = \begin{pmatrix}4&2\\2&1\end{pmatrix} A = ( 4 2 2 1 ) .
Solution. det ( A − λ I ) = ( 4 − λ ) ( 1 − λ ) − 4 = λ 2 − 5 λ = 0 \det(A-\lambda I) = (4-\lambda)(1-\lambda)-4 = \lambda^2-5\lambda = 0 det ( A − λ I ) = ( 4 − λ ) ( 1 − λ ) − 4 = λ 2 − 5 λ = 0 .
λ = 0 , 5 \lambda = 0, 5 λ = 0 , 5 .
λ = 0 \lambda = 0 λ = 0 : ( 4 2 2 1 ) v = 0 ⟹ v 1 = − v 2 / 2 \begin{pmatrix}4&2\\2&1\end{pmatrix}\mathbf{v}=\mathbf{0} \implies v_1 = -v_2/2 ( 4 2 2 1 ) v = 0 ⟹ v 1 = − v 2 /2 .
Eigenvector: ( 1 , − 2 ) (1,-2) ( 1 , − 2 ) Normalised: ◆ L B ◆ 1 ◆ R B ◆◆ L B ◆ 5 ◆ R B ◆ ( 1 , − 2 ) \dfrac◆LB◆1◆RB◆◆LB◆\sqrt{5}◆RB◆(1,-2) L ◆ B ◆1◆ R B ◆◆ L B ◆ 5 ◆ R B ◆ ( 1 , − 2 ) .
λ = 5 \lambda = 5 λ = 5 : ( − 1 2 2 − 4 ) v = 0 ⟹ v 1 = 2 v 2 \begin{pmatrix}-1&2\\2&-4\end{pmatrix}\mathbf{v}=\mathbf{0} \implies v_1 = 2v_2 ( − 1 2 2 − 4 ) v = 0 ⟹ v 1 = 2 v 2 .
Eigenvector: ( 2 , 1 ) (2,1) ( 2 , 1 ) Normalised: ◆ L B ◆ 1 ◆ R B ◆◆ L B ◆ 5 ◆ R B ◆ ( 2 , 1 ) \dfrac◆LB◆1◆RB◆◆LB◆\sqrt{5}◆RB◆(2,1) L ◆ B ◆1◆ R B ◆◆ L B ◆ 5 ◆ R B ◆ ( 2 , 1 ) .
Orthogonality check: ( 1 ) ( 2 ) + ( − 2 ) ( 1 ) = 0 (1)(2)+(-2)(1) = 0 ( 1 ) ( 2 ) + ( − 2 ) ( 1 ) = 0 . ✓ The eigenvectors are orthogonal (as expected for a
Symmetric matrix).
Example 13.2: Using diagonalisation to compute a matrix power
Problem. Given A = ( 3 1 0 2 ) A = \begin{pmatrix}3&1\\0&2\end{pmatrix} A = ( 3 0 1 2 ) Find A 10 A^{10} A 10 .
Solution. Eigenvalues: ( 3 − λ ) ( 2 − λ ) = 0 ⟹ λ = 2 , 3 (3-\lambda)(2-\lambda) = 0 \implies \lambda = 2, 3 ( 3 − λ ) ( 2 − λ ) = 0 ⟹ λ = 2 , 3 .
λ = 3 \lambda = 3 λ = 3 :
( 0 1 0 − 1 ) v = 0 ⟹ v = ( 1 , 0 ) \begin{pmatrix}0&1\\0&-1\end{pmatrix}\mathbf{v}=\mathbf{0} \implies \mathbf{v}=(1,0) ( 0 0 1 − 1 ) v = 0 ⟹ v = ( 1 , 0 ) .
λ = 2 \lambda = 2 λ = 2 :
( 1 1 0 0 ) v = 0 ⟹ v = ( 1 , − 1 ) \begin{pmatrix}1&1\\0&0\end{pmatrix}\mathbf{v}=\mathbf{0} \implies \mathbf{v}=(1,-1) ( 1 0 1 0 ) v = 0 ⟹ v = ( 1 , − 1 ) .
P = ( 1 1 0 − 1 ) P = \begin{pmatrix}1&1\\0&-1\end{pmatrix} P = ( 1 0 1 − 1 ) , D = ( 3 0 0 2 ) D = \begin{pmatrix}3&0\\0&2\end{pmatrix} D = ( 3 0 0 2 )
P − 1 = ( 1 1 0 − 1 ) P^{-1} = \begin{pmatrix}1&1\\0&-1\end{pmatrix} P − 1 = ( 1 0 1 − 1 ) .
A 10 = P D 10 P − 1 = ( 1 1 0 − 1 ) ( 3 10 0 0 2 10 ) ( 1 1 0 − 1 ) A^{10} = PD^{10}P^{-1} = \begin{pmatrix}1&1\\0&-1\end{pmatrix}\begin{pmatrix}3^{10}&0\\0&2^{10}\end{pmatrix}\begin{pmatrix}1&1\\0&-1\end{pmatrix} A 10 = P D 10 P − 1 = ( 1 0 1 − 1 ) ( 3 10 0 0 2 10 ) ( 1 0 1 − 1 )
= ( 1 1 0 − 1 ) ( 59049 59049 0 − 1024 ) = ( 59049 58025 0 1024 ) = \begin{pmatrix}1&1\\0&-1\end{pmatrix}\begin{pmatrix}59049&59049\\0&-1024\end{pmatrix} = \boxed{\begin{pmatrix}59049&58025\\0&1024\end{pmatrix}} = ( 1 0 1 − 1 ) ( 59049 0 59049 − 1024 ) = ( 59049 0 58025 1024 )
Example 13.3: Rotation matrix properties
Problem. Show that
R θ = ( cos θ − sin θ sin θ cos θ ) R_\theta = \begin{pmatrix}\cos\theta&-\sin\theta\\\sin\theta&\cos\theta\end{pmatrix} R θ = ( cos θ sin θ − sin θ cos θ ) satisfies
R θ R ϕ = R θ + ϕ R_\theta R_\phi = R_{\theta+\phi} R θ R ϕ = R θ + ϕ and R θ − 1 = R − θ R_\theta^{-1} = R_{-\theta} R θ − 1 = R − θ .
Solution.
R θ R ϕ = ( cos θ cos ϕ − sin θ sin ϕ − cos θ sin ϕ − sin θ cos ϕ sin θ cos ϕ + cos θ sin ϕ − sin θ sin ϕ + cos θ cos ϕ ) R_\theta R_\phi = \begin{pmatrix}\cos\theta\cos\phi-\sin\theta\sin\phi&-\cos\theta\sin\phi-\sin\theta\cos\phi\\\sin\theta\cos\phi+\cos\theta\sin\phi&-\sin\theta\sin\phi+\cos\theta\cos\phi\end{pmatrix} R θ R ϕ = ( cos θ cos ϕ − sin θ sin ϕ sin θ cos ϕ + cos θ sin ϕ − cos θ sin ϕ − sin θ cos ϕ − sin θ sin ϕ + cos θ cos ϕ )
= ( cos ( θ + ϕ ) − sin ( θ + ϕ ) sin ( θ + ϕ ) cos ( θ + ϕ ) ) = R θ + ϕ = \begin{pmatrix}\cos(\theta+\phi)&-\sin(\theta+\phi)\\\sin(\theta+\phi)&\cos(\theta+\phi)\end{pmatrix} = R_{\theta+\phi} = ( cos ( θ + ϕ ) sin ( θ + ϕ ) − sin ( θ + ϕ ) cos ( θ + ϕ ) ) = R θ + ϕ .
✓
R θ − 1 = ◆ L B ◆ 1 ◆ R B ◆◆ L B ◆ cos 2 θ + sin 2 θ ◆ R B ◆ ( cos θ sin θ − sin θ cos θ ) = ( cos θ sin θ − sin θ cos θ ) = R − θ R_\theta^{-1} = \dfrac◆LB◆1◆RB◆◆LB◆\cos^2\theta+\sin^2\theta◆RB◆\begin{pmatrix}\cos\theta&\sin\theta\\-\sin\theta&\cos\theta\end{pmatrix} = \begin{pmatrix}\cos\theta&\sin\theta\\-\sin\theta&\cos\theta\end{pmatrix} = R_{-\theta} R θ − 1 = L ◆ B ◆1◆ R B ◆◆ L B ◆ cos 2 θ + sin 2 θ ◆ R B ◆ ( cos θ − sin θ sin θ cos θ ) = ( cos θ − sin θ sin θ cos θ ) = R − θ .
✓
Example 13.4: Determinant and area scaling
Problem. The triangle with vertices ( 1 , 0 ) (1,0) ( 1 , 0 ) , ( 0 , 2 ) (0,2) ( 0 , 2 ) , ( 3 , 4 ) (3,4) ( 3 , 4 ) is transformed by
T = ( 2 − 1 1 3 ) T = \begin{pmatrix}2&-1\\1&3\end{pmatrix} T = ( 2 1 − 1 3 ) . Find the area of the image.
Solution. Original area:
1 2 ∣ det ( 0 − 1 3 − 1 2 − 0 4 − 0 ) ∣ = 1 2 ∣ − 2 + 2 ∣ = 0 \dfrac{1}{2}\left|\det\begin{pmatrix}0-1&3-1\\2-0&4-0\end{pmatrix}\right| = \dfrac{1}{2}|-2+2| = 0 2 1 det ( 0 − 1 2 − 0 3 − 1 4 − 0 ) = 2 1 ∣ − 2 + 2∣ = 0 .
Wait, the points are collinear? Let me use ( 0 , 0 ) (0,0) ( 0 , 0 ) , ( 1 , 0 ) (1,0) ( 1 , 0 ) , ( 0 , 1 ) (0,1) ( 0 , 1 ) instead. Area = 1 2 = \dfrac{1}{2} = 2 1 .
det ( T ) = 6 + 1 = 7 \det(T) = 6+1 = 7 det ( T ) = 6 + 1 = 7 . Image area = 7 × 1 2 = 3.5 = 7 \times \dfrac{1}{2} = \boxed{3.5} = 7 × 2 1 = 3.5 .
Problem. The matrix S = ( 1 k 0 1 ) S = \begin{pmatrix}1&k\\0&1\end{pmatrix} S = ( 1 0 k 1 ) represents a shear. Find its
Eigenvalues and describe the invariant lines.
Solution. det ( S − λ I ) = ( 1 − λ ) 2 = 0 \det(S-\lambda I) = (1-\lambda)^2 = 0 det ( S − λ I ) = ( 1 − λ ) 2 = 0 . Repeated eigenvalue λ = 1 \lambda = 1 λ = 1 .
( S − I ) v = ( 0 k 0 0 ) v = 0 ⟹ v 2 = 0 (S-I)\mathbf{v} = \begin{pmatrix}0&k\\0&0\end{pmatrix}\mathbf{v} = \mathbf{0} \implies v_2 = 0 ( S − I ) v = ( 0 0 k 0 ) v = 0 ⟹ v 2 = 0 .
Only one eigenvector: ( 1 , 0 ) (1,0) ( 1 , 0 ) .
The x x x -axis (y = 0 y=0 y = 0 ) is the only invariant line through the origin. All lines y = c y = c y = c (for any
Constant c c c ) are invariant (but not through the origin, except y = 0 y=0 y = 0 ).
Example 13.6: Matrix equation A X = B AX = B A X = B
Problem. Solve A X = B AX = B A X = B where A = ( 1 2 3 5 ) A = \begin{pmatrix}1&2\\3&5\end{pmatrix} A = ( 1 3 2 5 ) and
B = ( 4 7 7 12 ) B = \begin{pmatrix}4&7\\7&12\end{pmatrix} B = ( 4 7 7 12 ) .
Solution. X = A − 1 B X = A^{-1}B X = A − 1 B . det ( A ) = 5 − 6 = − 1 \det(A) = 5-6 = -1 det ( A ) = 5 − 6 = − 1 .
A − 1 = ( − 5 2 3 − 1 ) A^{-1} = \begin{pmatrix}-5&2\\3&-1\end{pmatrix} A − 1 = ( − 5 3 2 − 1 ) .
X = ( − 5 2 3 − 1 ) ( 4 7 7 12 ) = ( − 20 + 14 − 35 + 24 12 − 7 21 − 12 ) = ( − 6 − 11 5 9 ) X = \begin{pmatrix}-5&2\\3&-1\end{pmatrix}\begin{pmatrix}4&7\\7&12\end{pmatrix} = \begin{pmatrix}-20+14&-35+24\\12-7&21-12\end{pmatrix} = \boxed{\begin{pmatrix}-6&-11\\5&9\end{pmatrix}} X = ( − 5 3 2 − 1 ) ( 4 7 7 12 ) = ( − 20 + 14 12 − 7 − 35 + 24 21 − 12 ) = ( − 6 5 − 11 9 )
14. Additional Exam-Style Questions
Question 11
The matrix M = ( 2 − 1 4 − 3 ) M = \begin{pmatrix}2&-1\\4&-3\end{pmatrix} M = ( 2 4 − 1 − 3 ) has eigenvalues λ 1 = 1 \lambda_1 = 1 λ 1 = 1 and
λ 2 = − 2 \lambda_2 = -2 λ 2 = − 2 . Find M 4 + 3 M M^4 + 3M M 4 + 3 M .
Solution
By Cayley—Hamilton: M 2 + M − 2 I = O ⟹ M 2 = − M + 2 I M^2 + M - 2I = O \implies M^2 = -M + 2I M 2 + M − 2 I = O ⟹ M 2 = − M + 2 I .
M 3 = M ( − M + 2 I ) = − M 2 + 2 M = − ( − M + 2 I ) + 2 M = 3 M − 2 I M^3 = M(-M+2I) = -M^2+2M = -(-M+2I)+2M = 3M-2I M 3 = M ( − M + 2 I ) = − M 2 + 2 M = − ( − M + 2 I ) + 2 M = 3 M − 2 I .
M 4 = M ( 3 M − 2 I ) = 3 M 2 − 2 M = 3 ( − M + 2 I ) − 2 M = − 5 M + 6 I M^4 = M(3M-2I) = 3M^2-2M = 3(-M+2I)-2M = -5M+6I M 4 = M ( 3 M − 2 I ) = 3 M 2 − 2 M = 3 ( − M + 2 I ) − 2 M = − 5 M + 6 I .
M 4 + 3 M = − 5 M + 6 I + 3 M = − 2 M + 6 I = − 2 ( 2 − 1 4 − 3 ) + 6 ( 1 0 0 1 ) = ( − 4 + 6 2 − 8 6 + 6 ) = ( 2 2 − 8 12 ) M^4+3M = -5M+6I+3M = -2M+6I = -2\begin{pmatrix}2&-1\\4&-3\end{pmatrix}+6\begin{pmatrix}1&0\\0&1\end{pmatrix} = \begin{pmatrix}-4+6&2\\-8&6+6\end{pmatrix} = \begin{pmatrix}2&2\\-8&12\end{pmatrix} M 4 + 3 M = − 5 M + 6 I + 3 M = − 2 M + 6 I = − 2 ( 2 4 − 1 − 3 ) + 6 ( 1 0 0 1 ) = ( − 4 + 6 − 8 2 6 + 6 ) = ( 2 − 8 2 12 ) .
Question 12
Prove that similar matrices have the same trace and determinant.
Solution
If B = P − 1 A P B = P^{-1}AP B = P − 1 A P Then det ( B ) = det ( P − 1 A P ) = det ( P − 1 ) det ( A ) det ( P ) = det ( A ) \det(B) = \det(P^{-1}AP) = \det(P^{-1})\det(A)\det(P) = \det(A) det ( B ) = det ( P − 1 A P ) = det ( P − 1 ) det ( A ) det ( P ) = det ( A ) .
tr ( B ) = tr ( P − 1 A P ) \text{tr}(B) = \text{tr}(P^{-1}AP) tr ( B ) = tr ( P − 1 A P ) . Using the cyclic property of trace:
tr ( A B C ) = tr ( C A B ) \text{tr}(ABC) = \text{tr}(CAB) tr ( A B C ) = tr ( C A B ) .
tr ( P − 1 A P ) = tr ( A P P − 1 ) = tr ( A ) \text{tr}(P^{-1}AP) = \text{tr}(APP^{-1}) = \text{tr}(A) tr ( P − 1 A P ) = tr ( A P P − 1 ) = tr ( A ) . ■ \blacksquare ■
Question 13
Find the reflection matrix in the line y = 2 x y = 2x y = 2 x .
Solution
The line y = 2 x y = 2x y = 2 x makes angle θ = arctan 2 \theta = \arctan 2 θ = arctan 2 with the x x x -axis.
R = ( cos 2 θ sin 2 θ sin 2 θ − cos 2 θ ) R = \begin{pmatrix}\cos 2\theta&\sin 2\theta\\\sin 2\theta&-\cos 2\theta\end{pmatrix} R = ( cos 2 θ sin 2 θ sin 2 θ − cos 2 θ ) .
cos θ = ◆ L B ◆ 1 ◆ R B ◆◆ L B ◆ 5 ◆ R B ◆ \cos\theta = \dfrac◆LB◆1◆RB◆◆LB◆\sqrt{5}◆RB◆ cos θ = L ◆ B ◆1◆ R B ◆◆ L B ◆ 5 ◆ R B ◆ , sin θ = ◆ L B ◆ 2 ◆ R B ◆◆ L B ◆ 5 ◆ R B ◆ \sin\theta = \dfrac◆LB◆2◆RB◆◆LB◆\sqrt{5}◆RB◆ sin θ = L ◆ B ◆2◆ R B ◆◆ L B ◆ 5 ◆ R B ◆ .
cos 2 θ = cos 2 θ − sin 2 θ = 1 − 4 5 = − 3 5 \cos 2\theta = \cos^2\theta-\sin^2\theta = \dfrac{1-4}{5} = -\dfrac{3}{5} cos 2 θ = cos 2 θ − sin 2 θ = 5 1 − 4 = − 5 3 .
sin 2 θ = 2 sin θ cos θ = 4 5 \sin 2\theta = 2\sin\theta\cos\theta = \dfrac{4}{5} sin 2 θ = 2 sin θ cos θ = 5 4 .
R = ( − 3 5 4 5 4 5 3 5 ) R = \begin{pmatrix}-\frac{3}{5}&\frac{4}{5}\\\frac{4}{5}&\frac{3}{5}\end{pmatrix} R = ( − 5 3 5 4 5 4 5 3 )
16. Further Advanced Topics
16.1 Orthogonal matrices
A matrix Q Q Q is orthogonal if Q T Q = Q Q T = I Q^TQ = QQ^T = I Q T Q = Q Q T = I .
Properties:
∣ det Q ∣ = 1 |\det Q| = 1 ∣ det Q ∣ = 1
Columns and rows form orthonormal bases
Q − 1 = Q T Q^{-1} = Q^T Q − 1 = Q T
Orthogonal transformations preserve lengths and angles
Every 2 × 2 2\times 2 2 × 2 orthogonal matrix with det = 1 \det = 1 det = 1 is a rotation; with det = − 1 \det = -1 det = − 1 it is a
Reflection.
16.2 Diagonalisation revisited
If A A A has n n n linearly independent eigenvectors, then A = P D P − 1 A = PDP^{-1} A = P D P − 1 where:
P P P has eigenvectors as columns
D D D has eigenvalues on the diagonal
Computing A k A^k A k : A k = P D k P − 1 A^k = PD^kP^{-1} A k = P D k P − 1 — much faster than repeated multiplication.
Computing e A e^A e A : e A = P e D P − 1 e^A = Pe^DP^{-1} e A = P e D P − 1 where e D e^D e D is the diagonal matrix of e λ i e^{\lambda_i} e λ i .
16.3 Cayley-Hamilton theorem
Every square matrix satisfies its own characteristic equation.
If p ( λ ) = det ( λ I − A ) p(\lambda) = \det(\lambda I - A) p ( λ ) = det ( λ I − A ) Then p ( A ) = O p(A) = O p ( A ) = O .
This can be used to express A n A^n A n for large n n n in terms of lower powers of A A A .
17. Further Exam-Style Questions
Question 16
Prove that if A A A is orthogonal, then det A = ± 1 \det A = \pm 1 det A = ± 1 .
Solution
det ( Q T Q ) = det ( Q T ) det ( Q ) = ( det Q ) 2 \det(Q^TQ) = \det(Q^T)\det(Q) = (\det Q)^2 det ( Q T Q ) = det ( Q T ) det ( Q ) = ( det Q ) 2 .
But Q T Q = I Q^TQ = I Q T Q = I So det ( I ) = 1 \det(I) = 1 det ( I ) = 1 .
Therefore ( det Q ) 2 = 1 ⟹ det Q = ± 1 (\det Q)^2 = 1 \implies \det Q = \pm 1 ( det Q ) 2 = 1 ⟹ det Q = ± 1 . ■ \blacksquare ■
Question 17
Find the eigenvalues and eigenvectors of A = ( 4 1 2 3 ) A = \begin{pmatrix}4&1\\2&3\end{pmatrix} A = ( 4 2 1 3 ) And hence find
A 5 A^5 A 5 .
Solution
det ( A − λ I ) = ( 4 − λ ) ( 3 − λ ) − 2 = λ 2 − 7 λ + 10 = ( λ − 5 ) ( λ − 2 ) \det(A-\lambda I) = (4-\lambda)(3-\lambda)-2 = \lambda^2-7\lambda+10 = (\lambda-5)(\lambda-2) det ( A − λ I ) = ( 4 − λ ) ( 3 − λ ) − 2 = λ 2 − 7 λ + 10 = ( λ − 5 ) ( λ − 2 ) .
Eigenvalues: λ 1 = 5 \lambda_1 = 5 λ 1 = 5 , λ 2 = 2 \lambda_2 = 2 λ 2 = 2 .
λ = 5 \lambda=5 λ = 5 :
( A − 5 I ) v = 0 ⟹ ( − 1 1 2 − 2 ) ( v 1 v 2 ) = 0 ⟹ v 1 = ( 1 1 ) (A-5I)\mathbf{v} = \mathbf{0} \implies \begin{pmatrix}-1&1\\2&-2\end{pmatrix}\begin{pmatrix}v_1\\v_2\end{pmatrix} = \mathbf{0} \implies \mathbf{v}_1 = \begin{pmatrix}1\\1\end{pmatrix} ( A − 5 I ) v = 0 ⟹ ( − 1 2 1 − 2 ) ( v 1 v 2 ) = 0 ⟹ v 1 = ( 1 1 ) .
λ = 2 \lambda=2 λ = 2 :
( A − 2 I ) v = 0 ⟹ ( 2 1 2 1 ) ( v 1 v 2 ) = 0 ⟹ v 2 = ( 1 − 2 ) (A-2I)\mathbf{v} = \mathbf{0} \implies \begin{pmatrix}2&1\\2&1\end{pmatrix}\begin{pmatrix}v_1\\v_2\end{pmatrix} = \mathbf{0} \implies \mathbf{v}_2 = \begin{pmatrix}1\\-2\end{pmatrix} ( A − 2 I ) v = 0 ⟹ ( 2 2 1 1 ) ( v 1 v 2 ) = 0 ⟹ v 2 = ( 1 − 2 ) .
P = ( 1 1 1 − 2 ) P = \begin{pmatrix}1&1\\1&-2\end{pmatrix} P = ( 1 1 1 − 2 ) , D = ( 5 0 0 2 ) D = \begin{pmatrix}5&0\\0&2\end{pmatrix} D = ( 5 0 0 2 )
P − 1 = 1 − 3 ( − 2 − 1 − 1 1 ) P^{-1} = \dfrac{1}{-3}\begin{pmatrix}-2&-1\\-1&1\end{pmatrix} P − 1 = − 3 1 ( − 2 − 1 − 1 1 ) .
A 5 = P D 5 P − 1 = 1 3 ( 1 1 1 − 2 ) ( 3125 0 0 32 ) ( 2 1 1 − 1 ) A^5 = PD^5P^{-1} = \dfrac{1}{3}\begin{pmatrix}1&1\\1&-2\end{pmatrix}\begin{pmatrix}3125&0\\0&32\end{pmatrix}\begin{pmatrix}2&1\\1&-1\end{pmatrix} A 5 = P D 5 P − 1 = 3 1 ( 1 1 1 − 2 ) ( 3125 0 0 32 ) ( 2 1 1 − 1 )
= 1 3 ( 3125 32 3125 − 64 ) ( 2 1 1 − 1 ) = 1 3 ( 6282 3093 6186 3189 ) = ( 2094 1031 2062 1063 ) = \dfrac{1}{3}\begin{pmatrix}3125&32\\3125&-64\end{pmatrix}\begin{pmatrix}2&1\\1&-1\end{pmatrix} = \dfrac{1}{3}\begin{pmatrix}6282&3093\\6186&3189\end{pmatrix} = \begin{pmatrix}2094&1031\\2062&1063\end{pmatrix} = 3 1 ( 3125 3125 32 − 64 ) ( 2 1 1 − 1 ) = 3 1 ( 6282 6186 3093 3189 ) = ( 2094 2062 1031 1063 ) .
Summary
This topic covers the mathematical techniques and concepts related to matrices and transformations
(extended), including key theorems, methods, and problem-solving approaches.
Key concepts include:
complex number arithmetic
Argand diagrams
modulus and argument
De Moivre’s theorem
roots of complex numbers
Regular practice with a variety of question types is essential to build fluency and confidence in
applying these mathematical techniques.
:::