For a square matrix , the minimal polynomial is the monic polynomial of least degree such that . It divides the characteristic polynomial and shares the same roots, yet reflects deeper information about repeated eigenvalues and the structure of .
For a 2×2 matrix, the characteristic polynomial takes the form . Let the eigenvalues be and . If they are distinct, . If equals , the minimal polynomial is either or depending on whether is diagonalizable.
The calculator first computes the trace and determinant of your matrix. From these it derives the eigenvalues using the quadratic formula. If the eigenvalues are distinct, the minimal polynomial coincides with the characteristic polynomial. When they coincide, the script checks whether is the zero matrix. If not, the minimal polynomial is squared to reflect the defective nature of the matrix.
Take = . The eigenvalue calculation yields a repeated root . Because is not already , the minimal polynomial is . Applying the polynomial to indeed produces the zero matrix.
The minimal polynomial reveals the size of Jordan blocks associated with each eigenvalue. In turn, this information determines whether the matrix is diagonalizable and helps classify linear transformations up to similarity. The polynomial also enters the Cayley–Hamilton theorem, matrix functions, and solution formulas for differential equations.
By exploring various matrices, you can see how repeated eigenvalues alter the minimal polynomial and connect to geometric multiplicity. This understanding is fundamental when analyzing systems that cannot be fully diagonalized.
Compute the discrete Hilbert transform of a sequence to build an analytic signal and study amplitude and phase.
Compute eigenvalues and eigenvectors of a symmetric 2x2 matrix and display its spectral decomposition.
Test the Cauchy-Schwarz inequality for two vectors and explore its geometric interpretation with an in-depth explanation.