For the linear map on the finite-dimensional vector space , the rank-nullity theorem implies that injectivity and surjectivity are equivalent. Consequently is invertible if and only if .
Using the permitted equivalence between invertibility and a nonzero determinant, we obtain
We use the monic polynomial convention for the characteristic polynomial of an matrix:
It has degree , since the only contribution to the coefficient of in the determinant is the product of the diagonal terms . The alternative convention has the same polynomial roots.
A scalar is an eigenvalue of if and only if there is a nonzero vector with . By the preceding kernel criterion,
The last condition is , exactly the definition of a polynomial root. For a real matrix, this proves the assertion for real eigenvalues; the same proof over the complex numbers gives the usual complex version.
Write . Since and is a linear map, the multilinearity of the determinant gives, for any column position ,
If for , the corresponding columns also agree, so . Thus is an alternating multilinear map of the columns of , even when is not invertible.
We have . Define a function of the columns of by
It is an alternating multilinear map, because both summands are, and . Hence is a normalized determinantal function. By the asserted uniqueness of the determinant, for every . Rearranging yields
This argument also covers without dividing by it.

Articles by others on the same topic (0)

There are currently no matching articles.