
A companion matrix is a matrix with a prescribed characteristic polynomial.
I would like to show them from a broader perspective: companion matrices are the matrix version of a shift operator.
Pick a polynomial , which we normalise for convenience.
Now, as this polynomial generates an ideal in one can define the corresponding quotient .
We denote by
the corresponding projection.
Let us define
The set is now a vector space of the same dimension as the degree of the polynomial .
Let us define the shift operator by:
For instance, in the basis
the matrix of the shift operator is given by
This is the matrix called companion matrix.
It is well known that the spectrum of that matrix consists of the roots of the polynomial .
But let us look at the operator independently of the choice of basis.
This gives us a slick proof of that well-known fact.
So we set out to prove:
Theorem
The spectrum of consists of the roots of .
Indeed, if is an eigenvector of with eigenvalue , then
By definition of the quotient space , this means that there exists a polynomial such that:
or:
Now, is an irreducible polynomial so it divides either or .
Suppose first that it divides .
Then by dividing by we obtain:
,
which implies
,
but this is impossible since was supposed to be an eigenvector, thus nonzero.
We conclude that divides , so is a root of .
On the other hand, if is a root of , then , and is then an eigenvector with eigenvalue .
What is this good for?
Well, we can now define companion matrices in other bases, and we know that their spectrum will still be given by the roots of .
Consider the example of Newton polynomials. Given pairs of numbers for , an interpolation polynomial which interpolates these pairs can be written as
One can compute the coefficients using the following recursion formulae:
and
The companion matrix of that polynomial in the basis may now be written as: