• Welcome! The new FreeMathHelp.com forum is live. We've moved from VB4 to Xenforo 2.1 as our underlying software. Hopefully you find the upgrade to be a positive change. Please feel free to reach out as issues arise -- things will be a little different, and minor issues will no doubt crop up.

Linear Algebra: Proving that a matrix is invertible


New member
Oct 7, 2014
We are given a square matrix A and the equal-sized identity matrix i. We are also given that n > 0 is the smallest whole integer for which real coefficients a_0 up until a_(n-1) exist, so that the following equation is valid:
A^n + a_(n-1)A^(n-1) + ... + a_1A + a_0 i = 0

Display that A is invertible if and only if a_0 =/= 0.

I have no idea which theorem I can use to solve this problem. If anyone could help me get started, that’d be great. We basically just learned about eigenvalues, eigenvectors, etc. So I assume that I have to do something with that, but I just don’t seem to he able to connect any of the theorems to this problem. Could anyone help?

EDIT: I managed to solve the problem by making the assumption that a_0 does, in fact, equal 0 and finding a proof by contradiction.
Last edited: