
Cayley-Hamilton theorem states every matrix satisfies its own characteristic equation
Cayley-Hamilton theorem states every matrix satisfies its own characteristic equation
The Cayley-Hamilton theorem is a fundamental result in linear algebra that asserts every square matrix satisfies its own characteristic equation. This theorem provides a powerful tool for understanding the properties and behavior of matrices.
The characteristic polynomial of an n x n matrix A is defined as p_A(λ) = det(λI_n - A), where det represents the determinant operation, λ is a scalar variable, and I_n is the n x n identity matrix. This polynomial encapsulates important information about the matrix, such as its eigenvalues and eigenvectors.
Since each entry of the matrix (λI_n - A) is either constant or linear in λ, the characteristic polynomial is a polynomial in λ of degree n. According to the Cayley-Hamilton theorem, substituting the matrix A into its characteristic polynomial results in the zero matrix, demonstrating that the matrix satisfies its own characteristic equation.
Example
Consider a 2 x 2 matrix A = [[a, b], [c, d]]. The characteristic polynomial p_A(λ) = det(λI_2 - A) = det([[λ-a, -b], [c, λ-d]]) = (λ-a)(λ-d) - (-b)(c) = λ^2 - (a+d)λ + (ad-bc). According to the Cayley-Hamilton theorem, substituting A into its characteristic polynomial yields A^2 - (a+d)A + (ad-bc)I_2 = 0, showing that A satisfies its own characteristic equation.
Remember this
Understanding the Cayley-Hamilton theorem is crucial for solving matrix equations and analyzing the properties of matrices in linear algebra.
Text adapted from Wikipedia, licensed under CC BY-SA 4.0.
Riesz representation theorem
Riesz representation theorem connects Hilbert spaces with continuous dual spaces
Invertible matrix
Rank-nullity theorem: rank(A) + nullity(A) = n
the determinant tells you about volume scaling under a linear transformation
The determinant of a matrix representing a linear transformation indicates the factor by which volumes are scaled
Cholesky decomposition
Cholesky decomposition factors A = LL^T for symmetric positive definite matrices
Hahn–Banach theorem
Can you always stretch a stretchable fabric to cover a larger table?
Master theorem (analysis of algorithms)
Master theorem solves T(n) = aT(n/b) + f(n) recurrences
Swipe through 100 ML concepts daily
Open Pocket Polymath