Every square matrix is a root of its own characteristic equation, surprisingly enough.

Every square matrix is a root of its own characteristic equation, surprisingly enough.
Image: Intellect (generated)

In short: In linear algebra, the Cayley-Hamilton theorem reveals a hidden symmetry: if you take a square matrix and plug it into its own characteristic polynomial, the result is always a zero matrix. This elegant property allows mathematicians to express high-order matrix powers as simple linear combinations of lower-order ones.

The Cayley-Hamilton theorem states that any square matrix A, when substituted into its characteristic polynomial, yields a zero matrix. The characteristic polynomial is derived from the determinant of the matrix subtracted from a scalar variable multiplied by the identity matrix. Because this polynomial is monic and of degree n, replacing the scalar variable with the matrix itself creates a matrix polynomial that effectively collapses to zero.

The historical development of this result was gradual. William Rowan Hamilton first proved a specific version in 1853, focusing on quaternions. Arthur Cayley later discussed the concept for two-by-two and three-by-three matrices in 1858, though he famously declined to provide a formal proof for the general case, citing the labor involved. It was not until 1878 that Ferdinand Frobenius provided the first rigorous proof for matrices of any size.

Beyond its theoretical elegance, the theorem has practical utility. It allows for the expression of high powers of a matrix, such as A to the power of n, as a linear combination of its lower powers. Furthermore, when dealing with invertible matrices, the theorem provides a method to express the inverse of a matrix as a polynomial in A. The coefficients of these polynomials are deeply connected to the eigenvalues of the matrix, specifically through the trace of its powers and Newton identities.

The theorem also establishes a fundamental link between the minimal polynomial and the characteristic polynomial of a matrix. In fields, the theorem implies that the minimal polynomial must be a divisor of the characteristic polynomial. This relationship underscores how the internal structure of a matrix—its eigenvalues and traces—dictates its behavior under polynomial operations, turning complex matrix algebra into a manageable system of identities.

Opens the Intellect+ feed with this card first. Swipe up for the next one.

Sources

To cite this card, link to https://intellectplus.co.uk/app/science-cayley-hamilton-theorem.

How we source, check and correct cards: Editorial standards.

General information, not professional advice. Spotted an error? Flag the card or see corrections and complaints.

Intellect Plus is a visual educational discovery platform for exploring fascinating facts and ideas. Brain Food, Not Brain Rot. What is Intellect Plus?

Related

Finding something worth knowing…