Eigenvalues, characteristic & minimal polynomials, Cayley–Hamilton
Why this is asked: Read eigen-structure off the characteristic and minimal polynomials without computing: diagonalisable ⇔ minimal polynomial has distinct linear factors; similar matrices share both polynomials but the converse fails; Cayley–Hamilton lets you compute inverses and high powers.
Characteristic vs minimal polynomial — what each tells you
The written notes for this page come with the Notes pack. The video, the visual and the practice below are free.
See pricingSee it move
The trap here
“Same characteristic polynomial ⇒ similar” — false
0 matrix and [[0,1],[0,0]]
Both have char poly , different minimal polynomials (x vs .
Check yourself — select all that apply
Let A be a 4×4 complex matrix with characteristic polynomial and minimal polynomial . Which of the following are true?
Next: Diagonalisability criteria
Create a free account to keep your place and have this feed your study plan.
Open this in the full syllabus view · Unit 1