Using the convention of the question, the characteristic polynomial and characteristic equation are
For
one has
Direct multiplication gives
entry by entry. Thus , verifying the Cayley-Hamilton theorem for matrices.
If denotes the matrix obtained by deleting row and column , then the adjugate matrix is
For nonsingular ,
Therefore, when and are nonsingular,
The determinant is a polynomial in with leading term , so it is not the zero polynomial and has only finitely many roots. Hence one may choose smaller than every positive root, if any. Then
Each entry of is, up to sign, the determinant of an minor whose entries are affine polynomials in . The Leibniz formula for determinants therefore makes each adjugate entry a polynomial in of degree at most .
For arbitrary , choose positive sequences for which and are nonsingular. The nonsingular identity from part (b) applies to their product:
Every entry is a polynomial, hence continuous, in the matrix entries. Letting proves
for all square matrices.
Define
The Cayley-Hamilton theorem for
gives
If is nonsingular, multiplication by shows .
For arbitrary , apply the nonsingular result to for a sequence of nonzero avoiding the finitely many singular values. Both the characteristic coefficients and the adjugate entries depend polynomially on the matrix entries, so the limit gives

Articles by others on the same topic (0)

There are currently no matching articles.