M = (1 1; 0 1), M²
(1 2; 0 1)
Top-right 2.
For the shear matrix , the powers are . Induction proves this for every positive integer .
This page is easier if you are comfortable with:
The base case is just the matrix itself. For the step, assume and multiply by once more using the rule for matrix multiplication: .
Geometrically, is a shear that slides each point sideways by its height, and applying it times slides it times as far; see enlargement, stretch and shear matrices. A shear has determinant 1, so it preserves area, as explained in area scale factor.
The matrix has the single repeated eigenvalue 1 and cannot be diagonalised, so it appears as a Jordan block; see Jordan normal form and eigenvalues of a 2 × 2 matrix. The general proof method is in the structure of induction.
A shear slides every point sideways in proportion to its height. Repeating it n times slides it n times as far.
The top edge slides one unit to the right; two shears would slide it two units.
These examples are worked by hand, step by step, so you can compare your own working.
Find .
Find applied to .
Multiply by .
A few situations come up again and again. Knowing them saves time and helps you spot answers that cannot be right.
(1 2; 0 1)
Top-right 2.
n
5.
(1 n; 0 1)(1 1; 0 1) = (1 n+1; 0 1)
n = 4: 5.
1
1.
For M = (1 1; 0 1), Mⁿ = (1 n; 0 1). Induction: Mᵏ⁺¹ = MᵏM = (1 k; 0 1)(1 1; 0 1) = (1 k + 1; 0 1).
Top-right entry: 1·1 + 1·1.
Top-right entry of M⁵.
k = 4: top-right of Mᵏ⁺¹ = k + 1.
det M⁵ = 1·1 − 5·0.
(1 1; 0 1)ⁿ entrywise ✗
matrix power ✓
Not entrywise.
wrong ✗
n ✓
Linear.
MMᵏ vs MᵏM ✗
same here ✓
Powers commute.
skip ✗
n = 1: M itself ✓
Check.
Try each one on paper, then open the answer. Use the solver above to see the full working.
3
8
10
5
6
2
Unlimited fresh questions with instant marking. Choose a level, work it out on paper, then type your answer.
Solve: …
(1 n; 0 1).
By induction: Mᵏ⁺¹ = MᵏM.
1.
Adds n times y to x.
induction: Σr·r!.
More in Further pure maths and the formula sheets.