Diagonalisation and the Cayley-Hamilton theoremEdexcel A-Level Further Maths: Flashcards
Card 1 of 120 of 12 known
Question
How do you build $\mathbf{P}$ to diagonalise $\mathbf{A}$?
Tap or press Space to reveal
Tap card or press Space to flip
See all 12 cards
- How do you build to diagonalise ?
- Put the eigenvectors of as columns of .
- Result of ?
- The diagonal matrix of eigenvalues, in the same order as the columns of .
- If you swap the columns of , what changes in ?
- The diagonal entries swap too.
- Formula for using diagonalisation?
- What is for ?
- When can a matrix not be diagonalised?
- When it lacks two independent eigenvectors, for example a repeated eigenvalue with one eigenvector direction.
- What is a symmetric matrix?
- Two properties of a real symmetric matrix's eigenvalues and eigenvectors?
- Real eigenvalues; eigenvectors for distinct eigenvalues are perpendicular.
- What is an orthogonal matrix?
- , so ; columns are perpendicular unit vectors.
- Orthogonal diagonalisation of a symmetric matrix?
- with made of normalised eigenvectors.
- State the Cayley-Hamilton theorem for a matrix.
- How does Cayley-Hamilton give an inverse?
- Rearrange to , so .
Exam questions on Diagonalisation and the Cayley-Hamilton theorem
- The matrix has eigenvalues and , with eigenvectors and respectively. Let .Write down a matrix such that .2 marks
- The symmetric matrix .Find an orthogonal matrix and a diagonal matrix such that .2 marks
- The matrix .Find the characteristic equation of and hence show that .3 marks
Written by the Exaim team, led by Shaun Daswani (Head of Upper Secondary, Improve ME Institute; MSc Financial Mathematics, Imperial College London; BSc, UCL) and Jason Daswani (operational lead, Improve ME Institute; LSE).