Learn with Amar
Teaching video
A teaching recording for this chapter has not been published yet. Start with the worked example below and explore the related animations where available.
Undergraduate chapters and video availability01 · Read and understand
What you will learn
- Use diagonalization to avoid repeated matrix multiplication.
- Justify the conclusion "Aⁿ(2,0)=(3ⁿ+1,3ⁿ−1)" using the stated assumptions.
Before you start
Eigenvalues and change of basis.
Keep paper nearby. Read the question once for the context, then again to identify what is known and what you need to find.
Start with a question
For A=[[2,1],[1,2]], compute Aⁿ(2,0) for n≥0.
Why this math matters
Use diagonalization to avoid repeated matrix multiplication. This worked micro-lesson connects a precise mathematical condition to a conclusion you can check. The transfer task asks you to change the setting and decide which parts of the reasoning still apply.
Set up the model
A useful answer starts with clear assumptions:
- n is a nonnegative integer.
- The two eigenvectors form a basis.
02 · Work through the example
Follow the reasoning, one step at a time.
Try to predict the next step before reading it. After each calculation, explain why the operation makes sense and how it helps answer the original question.
Work through it with Amar
See this example unfold.
The complete worked example, one idea at a time.
Compute a large matrix power through its eigenbasis
PausedQuestion: Start with the question. Paused.
Question
Start with the question
For A=[[2,1],[1,2]], compute Aⁿ(2,0) for n≥0.
Before you calculate
Read what is known and what you need to find. Make a prediction before moving to the first calculation.
Starts paused. Play advances through the full text at a reading pace; pause whenever you need more time. Previous, Next, and the phase buttons let you set your own pace. Playback pauses when this walkthrough leaves the screen or you switch tabs.
Your device’s reduced-motion setting keeps each phase still. Manual controls remain available. The full written solution stays below.
Build the model
(2,0)=(1,1)+(1,−1)
Decompose the starting vector in the eigenbasis.
Work through the mathematics
Aⁿ(1,1)=3ⁿ(1,1); Aⁿ(1,−1)=(1,−1)
Each application multiplies an eigenmode by its eigenvalue.
Check the conclusion
Aⁿ(2,0)=(3ⁿ+1,3ⁿ−1)
Recombining the modes gives a closed form that also checks at n=0.
The result
Aⁿ(2,0)=(3ⁿ+1,3ⁿ−1)
Recombining the modes gives a closed form that also checks at n=0.
Common mistakes to catch
- Matrix powers do not mean raising each entry to that power.
- The inverse basis change must be applied in the correct order.
03 · Practice independently
Try it before revealing the answer.
Use paper or a calculator as needed. Write your units and reasoning, then open the hint or explanation to check your approach.
Practice 1
Evaluate the formula at n=2.
Show a hint
Use 3²=9.
Reveal answer and explanation
(10,8)
Two direct matrix multiplications give the same result.
Practice 2
What condition permits A=PDP⁻¹?
Show a hint
Count independent eigenvectors.
Reveal answer and explanation
A full eigenvector basis
Without such a basis, a diagonal representation may not exist.
Take the idea with you
Use mode decomposition to compare the long-term contributions of two growth factors.
04 · Reflect and continue
Can you explain it in your own words?
Before moving on, explain the main idea without looking at the worked example. Try both practice questions, check your reasoning, and name one mistake you now know how to avoid. Return to a step if you still need support.
Up next: Keep the dominant direction of a rectangular map
Completion is your own study record, not a test score. It stays in this browser, does not sync to another device, and can be removed by clearing browser data.