Companion matrix
From Wikipedia, the free encyclopedia
Contents |
[edit] Definition
In linear algebra, the companion matrix of the monic polynomial
is the square matrix defined as
With this convention, and writing the basis as , one has Cvi = Ci − 1v1 = vi + 1 (for i < n), and v1 generates V as a K[C]-module: C cycles basis vectors.
Some authors use the transpose of this matrix, which (dually) cycles coordinates, and is more convenient for some purposes, like linear recursive relations.
[edit] Characterization
The characteristic polynomial as well as the minimal polynomial of C(p) are equal to p; in this sense, the matrix C(p) is the "companion" of the polynomial p.
If A is an n-by-n matrix with entries from some field K, then the following statements are equivalent:
- A is similar to a companion matrix over K
- the characteristic polynomial of A coincides with the minimal polynomial of A
- there exists a cyclic vector v in V = Kn for A, meaning that {v, Av, A2v,...,An-1v} is a basis of V. Equivalently, such that V is cyclic as a K[A]-module (and V = K[A] / (p(A))); one says that A is regular.
Not every square matrix is similar to a companion matrix. But every matrix is similar to a matrix made up of blocks of companion matrices. Furthermore, these companion matrices can be chosen so that their polynomials divide each other; then they are uniquely determined by A. This is the rational canonical form of A.
[edit] Diagonalizability
If p(t) has distinct roots λ1,...,λn (the eigenvalues of C(p)), then C(p) is diagonalizable as follows:
where V is the Vandermonde matrix corresponding to the λ's.
[edit] Linear recursive sequences
Given a linear recursive sequence with characteristic polynomial
the (transpose) companion matrix
generates the sequence, in the sense that
- .
It increments the series by 1.