the matrix

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 PC[X], which we normalise for convenience.

P(X)=α0+α1X++αn1Xn1+Xn

Now, as this polynomial generates an ideal in C[X] one can define the corresponding quotient C[X]/P.

We denote by []:C[X]C[X]/P the corresponding projection.

Let us define E:=C[X]/P

The set E is now a vector space of the same dimension as the degree of the polynomial P.

Let us define the shift operator by: S:EE[Q][XQ]

For instance, in the basis ([1],[X],[X]2,,[X]n1) the matrix of the shift operator S is given by [0α0100α110α201αn21αn1]

This is the matrix called companion matrix. It is well known that the spectrum of that matrix consists of the roots of the polynomial P. But let us look at the operator S 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 S consists of the roots of P.

Indeed, if [Q]E is an eigenvector of S with eigenvalue λ, then S[Q]=λ[Q] By definition of the quotient space C[X]/P, this means that there exists a polynomial RC[X] such that: XQ=λQ+RP or: (Xλ)Q=RP

Now, (Xλ) is an irreducible polynomial so it divides either R or P.

Suppose first that it divides R. Then by dividing by (Xλ) we obtain: Q=RXλP, which implies [Q]=0, but this is impossible since [Q] was supposed to be an eigenvector, thus nonzero. We conclude that (Xλ) divides P, so λ is a root of P.

On the other hand, if λ is a root of P, then P=(Xλ)Q, and [Q] 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 P.

Consider the example of Newton polynomials. Given n+1 pairs of numbers (xi,yi) for 0in, an interpolation polynomial which interpolates these pairs can be written as P(x)=c0,0+c0,1(xx0)+c0,2(xx0)(xx1)++c0,n(xx0)(xxn1).

One can compute the coefficients c0,j using the following recursion formulae: ci,0=yi and ci,j=ci+1,j1ci,j1xi+jxi.

The companion matrix of that polynomial in the basis {0jk(xxj)}0kn1 may now be written as:

[x0c0,0/c0,n1x10c0,1/c0,n1x2c0,2/c0,n01xn2c0,n2/c0,n1Mxn1c0,n1/c0,n]