NETMaths
The bookUnit 1 · Eigenvalues and Canonical Forms23 / 83

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 pricing

See it move

What a matrix does to a vectorinteractive

Sweep a direction and watch Av swing — except on the eigendirections, where it only stretches. Det appears as the area of the image.

Unlock interactive visuals

The trap here

“Same characteristic polynomial ⇒ similar” — false

0 matrix and [[0,1],[0,0]]

Both have char poly x2x^{2}, different minimal polynomials (x vs x2)x^{2}).

More on this →

Check yourself — select all that apply

Let A be a 4×4 complex matrix with characteristic polynomial (x1)2(x2)2(x - 1)^{2}(x - 2)^{2} and minimal polynomial (x1)(x2)2(x - 1)(x - 2)^{2}. 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