Every matrix has directions it does not turn — it only stretches them. Find those, and powers, inverses and whole systems of planes fall out almost for free.
The system is , where each row of is the normal of one plane.
| What elimination gives | Solutions | The picture |
|---|---|---|
| a row of | infinitely many, forming a line | a sheaf: three distinct planes through one common line |
| a row of , | none | a triangular prism: each pair meets in a line, but the three lines are parallel and distinct — or two (or three) planes are parallel and distinct |
So the routine is always: eliminate down to the last row, then look at what that row says.
Consider the system .
Here and
so is singular whatever is. Subtracting adjacent equations:
Identical coefficient matrix, identical determinant, opposite conclusions. This is exactly why "" is never a complete answer.
. Expanding along the first row,
so there is exactly one solution. Eliminating gives . Check all three: ✓, ✓, ✓ — the three planes meet at the single point .
A non-zero vector is an eigenvector of , with eigenvalue , when
Rearranged, . A non-zero can only satisfy this if is singular — otherwise we could multiply by its inverse and force . Hence the characteristic equation
In this syllabus you only meet cases where its roots are real and distinct.
Find the eigenvalues and eigenvectors of .
So and — real and distinct.
: gives , i.e. . Take .
: gives . Take .
Always check: ✓ and ✓ — two multiplications, and your answer is certain.
Both rows of must give the same line. If they do not, your is wrong — a free error check built into the method.
In Topic 4 the invariant lines came from . That is the same condition as for : an eigenvector points along an invariant line through the origin, and says how far points slide along it. A negative flips them to the other side; leaves them fixed.
These one-line arguments are exactly the "simple properties" the syllabus asks you to prove.
Find the eigenvalues and eigenvectors of .
Characteristic equation. Expand along the top row:
Both terms carry a factor — take it out rather than expanding into a cubic:
So — real and distinct. ( appearing tells us immediately that .)
: reads . The first gives , the third , and the middle is then automatic. .
: gives and . .
: gives and , so . .
Check all three: ✓, ✓, ✓
A 3 × 3 characteristic determinant almost always has a visible common factor, or an obvious root such as or to test. Factorise as you expand. Multiplying out to and then hunting for roots wastes minutes and invites sign errors.
Put the eigenvectors in as the columns of , and the matching eigenvalues down the diagonal of in the same order. Then
because the middle terms telescope: . And is trivial — just raise each diagonal entry to the power .
For we found with , and with . So
Then :
Check : ✓ Check : , and ✓
Testing costs ten seconds and catches a swapped column of instantly.
If is the first column of , then must be the first diagonal entry of . Swap one and not the other and everything collapses.
Any non-zero multiple of an eigenvector is also an eigenvector, so would do just as well as ; changes but does not. Do not panic if your differs from the mark scheme by a scale factor.
If the characteristic equation of is , then
where — and this is where marks go — the constant becomes , not the scalar . For a 2 × 2, (the sum of the diagonal) and .
For the characteristic equation is , so
(a) Reducing powers. , and multiplying by again,
Check: , and multiplying ✓
(b) Finding the inverse. Rearrange to isolate and multiply through by :
Check against the standard 2 × 2 formula: , so ✓ — the same. For a 3 × 3, where the standard route means nine cofactors, this shortcut is a genuine time-saver.
The constant term of the characteristic equation is . So it is non-zero exactly when is invertible — which is exactly when you are allowed to divide by it. If that constant is , the matrix is singular and there is no inverse to find.
Spin the blue vector and watch its image . For most directions the two point different ways; along an eigendirection they line up exactly, and is the stretch factor. The panel checks , , , and Cayley–Hamilton — all numerically.
line them up ✎
The characteristic equation of is:
. Instant check: for a 2 × 2 the equation is ; here that is ✓ The last option swaps those two numbers over.
An eigenvector of corresponding to is:
✓ The second option is the eigenvector for ; the last is excluded by definition — satisfies for every , so it is never an eigenvector.
Three planes have a singular coefficient matrix, and elimination reduces the system to . Geometrically the planes:
is impossible, so the system is inconsistent — there is no common point. The picture is a triangular prism (or a pair of parallel planes). A row of instead would have given a sheaf with a common line; a single point requires .
Given satisfies , it follows that equals:
Multiply through by : , so . Check: ✓
The matrix has eigenvalues and .
(i) Find corresponding eigenvectors and write down and with . (ii) Hence find a formula for . (iii) Verify your formula at .
(i) For , gives , so . For , gives . Taking the eigenvectors as columns in the matching order,
Since , .
(ii) . First , and then
(iii) At the formula gives
and multiplying directly, ✓ The two agree.
(Testing as well is worth the ten seconds: it gives ✓)