Companion matrix explained

In linear algebra, the Frobenius companion matrix of the monic polynomial$$p(x)=c\_0\; +\; c\_1\; x\; +\; \backslash cdots\; +\; c\_x^\; +\; x^n$$is the square matrix defined as

Some authors use the transpose of this matrix,

C(p) ^{T} , which is more convenient for some purposes such as linear recurrence relations (see below).C(p) is defined from the coefficients of p(x) , while the characteristic polynomial as well as the minimal polynomial of C(p) are equal to p(x) .^[1] In this sense, the matrix C(p) and the polynomial p(x) are "companions".

Similarity to companion matrix

Any matrix with entries in a field has characteristic polynomial

p(x) = \det(xI - A) , which in turn has companion matrix C(p) . These matrices are related as follows.

The following statements are equivalent:

• A is similar over F to

C(p) , i.e. A can be conjugated to its companion matrix by matrices in GL_n(F);

• the characteristic polynomial

p(x) coincides with the minimal polynomial of A, i.e. the minimal polynomial has degree n;

• the linear mapping

A:F ^{n\to} F ^{n} makes F ^{n} a cyclic F[A] -module, having a basis of the form \{v,Av,\ldots,A ^{n-1} v\} ; or equivalently F ^{n} \cong F[X]/(p(x)) as F[A] -modules.

If the above hold, one says that A is non-derogatory.

Not every square matrix is similar to a companion matrix, but every square matrix is similar to a block diagonal matrix made of companion matrices. If we also demand that the polynomial of each diagonal block divides the next one, they are uniquely determined by A, and this gives the rational canonical form of A.

Diagonalizability

The roots of the characteristic polynomial

p(x) are the eigenvalues of C(p) . If there are n distinct eigenvalues λ _{1,\ldots,λ} _{n} , then C(p) is diagonalizable as C(p) = V ^{-1} D V , where D is the diagonal matrix and V is the Vandermonde matrix corresponding to the 's: Indeed, an easy computation shows that the transpose C(p) ^{T} has eigenvectors v _{i=(1,λ} _{i,\ldots,λ} ^{n -1} ^{i} ) with C(p) ^{T(v} _{i)} = λ _{i} v _{i} , which follows from p( λ _{i)=c} _{0+c} _{1λ} _{i+ … +c} _{n-1} λ ^{n -1} _{i} +λ _{i} ^{n} = 0 . Thus, its diagonalizing change of basis matrix is V ^{T} = [v ^{T} _{1} \ldots v ^{T]} _{n} , meaning C(p) ^{T} = V ^{T} D (V ^{T)} ^{-1} , and taking the transpose of both sides gives C(p) = V ^{-1} D V .

We can read the eigenvectors of

C(p) with C(p)(w _{i)} = λ _{i} w _{i} from the equation C(p) = V ^{-1} D V : they are the column vectors of the inverse Vandermonde matrix V ^{-1} = [w ^{T} _{1} … w ^{T]} _{n} . This matrix is known explicitly, giving the eignevectors w _{i} = (L _{0i} , \ldots, L _{(n-1)i} ) , with coordinates equal to the coefficients of the Lagrange polynomials$$L\_i(x)\; =\; L\_\; +\; L\_x\; +\; \backslash cdots\; +\; L\_x^\; =\; \backslash prod\_\; \backslash frac\; =\; \backslash frac.$$Alternatively, the scaled eigenvectors \tilde w _{i} = p'( λ _{i)w} _{i} have simpler coefficients.

If

p(x) has multiple roots, then C(p) is not diagonalizable. Rather, the Jordan canonical form of C(p) contains one diagonal block for each distinct root, an m × m block with λ on the diagonal if the root λ has multiplicity m.

Linear recursive sequences

A linear recursive sequence defined by

a _{k+n} = - c _{0} a _{k} - c _{1} a _{k+1} … - c _{n-1} a _{k+n-1} for k \geq 0 has the characteristic polynomial p(x) = c _{0} + c _{1} x + … + c _{n-1} x ^{n-1} + x ^{n} , whose transpose companion matrix C(p) ^{T} generates the sequence:The vector v = ( 1 , λ , λ ^{2,\ldots,λ} ^{n-1} ) is an eigenvector of this matrix, where the eigenvalue λ is a root of p(x) . Setting the initial values of the sequence equal to this vector produces a geometric sequence a _{k} = λ ^{k} which satisfies the recurrence. In the case of n distinct eigenvalues, an arbitrary solution a _{k} can be written as a linear combination of such geometric solutions, and the eigenvalues of largest complex norm give an asymptotic approximation.

From linear ODE to first-order linear ODE system

Similarly to the above case of linear recursions, consider a homogeneous linear ODE of order n for the scalar function

y = y(t) :$$y^\; +\; c\_y^\; +\; \backslash dots\; +\; c\_y^\; +\; c\_0\; y\; =\; 0\; .$$This can be equivalently described as a coupled system of homogeneous linear ODE of order 1 for the vector function z(t) = (y(t),y'(t),\ldots,y ^{(n-1)} (t)) :$$z\text{'}\; =\; C(p)^T\; z$$where C(p) ^{T} is the transpose companion matrix for the characteristic polynomial$$p(x)=x^n\; +\; c\_x^\; +\; \backslash cdots\; +\; c\_1\; x\; +\; c\_0\; .$$Here the coefficients c _{i} = c _{i(t)} may be also functions, not just constants.

If

C(p) ^{T} is diagonalizable, then a diagonalizing change of basis will transform this into a decoupled system equivalent to one scalar homogeneous first-order linear ODE in each coordinate.

An inhomogeneous equation$$y^\; +\; c\_y^\; +\; \backslash dots\; +\; c\_y^\; +\; c\_0\; y\; =\; f(t)$$is equivalent to the system:$$z\text{'}\; =\; C(p)^T\; z\; +\; F(t)$$with the inhomogeneity term

F(t) = ( 0 ,\ldots, 0 ,f(t)) .

Again, a diagonalizing change of basis will transform this into a decoupled system of scalar inhomogeneous first-order linear ODEs.

Cyclic shift matrix

In the case of

p(x) = x ^{n-1} , when the eigenvalues are the complex roots of unity, the companion matrix and its transpose both reduce to Sylvester's cyclic shift matrix, a circulant matrix.

Multiplication map on a simple field extension

Consider a polynomial

p(x) = x ^{n} + c _{n-1} x ^{n-1} + … + c _{1} x + c _{0} with coefficients in a field F , and suppose p(x) is irreducible in the polynomial ring F[x] . Then adjoining a root λ of p(x) produces a field extension K = F( λ ) \cong F[x]/(p(x)) , which is also a vector space over F with standard basis \{ 1 , λ , λ ^{2,\ldots,λ} ^{n-1} \} . Then the F -linear multiplication mappinghas an n × n matrix [m _{λ]} with respect to the standard basis. Since m ^{i)} _{λ ( λ} = λ ^{i+1} and m ^{n -1} _{λ ( λ} ) = λ ^{n} = - c _{0- … -c} _{n-1} λ ^{n-1} , this is the companion matrix of p(x) :$$[m\_\backslash lambda]\; =\; C(p).$$Assuming this extension is separable (for example if F has characteristic zero or is a finite field), p(x) has distinct roots λ _{1,\ldots,λ} _{n} with λ _{1} = λ , so that$$p(x)=(x-\backslash lambda\_1)\backslash cdots\; (x-\backslash lambda\_n),$$and it has splitting field L = F( λ _{1,\ldots,λ} _{n)} . Now m _{λ} is not diagonalizable over F ; rather, we must extend it to an L -linear map on L ^{n} \cong L ⊗ _{F} K , a vector space over L with standard basis \{ 1 { ⊗ } 1 , 1 { ⊗ } λ , 1 { ⊗ } λ ^{2,\ldots,1{ ⊗ }λ} ^{n-1} \} , containing vectors w = (\beta _{1,\ldots,\beta} _{n)} = \beta _{1{ ⊗ }} 1+ … + \beta _{n{ ⊗ }} λ ^{n-1} . The extended mapping is defined by m _{λ(\beta ⊗ \alpha)} = \beta ⊗ ( λ \alpha) .

The matrix

[m _{λ]} = C(p) is unchanged, but as above, it can be diagonalized by matrices with entries in L : $$[m\_\backslash lambda]=C(p)=\; V^\backslash !\; D\; V,$$for the diagonal matrix D = \operatorname{diag}( λ _{1,\ldots,λ} _{n)} and the Vandermonde matrix V corresponding to λ _{1,\ldots,λ} _{n\in} L . The explicit formula for the eigenvectors (the scaled column vectors of the inverse Vandermonde matrix V ^{-1} ) can be written as:$$\backslash tilde\; w\_i\; =\; \backslash beta\_\; 1+\backslash beta\_\; \backslash lambda\; +\backslash cdots\; +\; \backslash beta\_\; \backslash lambda^=\; \backslash prod\_\; (1\backslash lambda\; -\; \backslash lambda\_j\; 1)$$where \beta _{ij} \in L are the coefficients of the scaled Lagrange polynomial$$\backslash frac=\; \backslash prod\_\; (x\; -\; \backslash lambda\_j)\; =\; \backslash beta\_\; +\; \backslash beta\_\; x\; +\; \backslash cdots\; +\; \backslash beta\_\; x^.$$

See also

• Frobenius endomorphism
• Cayley–Hamilton theorem
• Krylov subspace

Notes and References

1. Book: Horn, Roger A. . Matrix Analysis . Charles R. Johnson . Cambridge University Press . 1985 . 0-521-30586-1 . Cambridge, UK . 146–147 . 2010-02-10.