Mathematics
The Characteristic Polynomial and the Cayley–Hamilton Theorem
Quick fact
The Cayley–Hamilton theorem states that every square matrix satisfies its own characteristic equation; for example, if A is a 2x2 matrix with characteristic polynomial p(λ)=λ² - (trace A)λ + det A, then p(A)=A² - (trace A)A + (det A)I = 0. This result holds for all matrices over any commutative ring, not just real or complex matrices.
Why this is interesting
Imagine a matrix as a machine that transforms vectors. Could there be a polynomial that, when evaluated on the matrix itself, gives zero—like a magic button that always returns the same result?