Since , its minimal polynomial divides . The polynomial is an irreducible polynomial over the rational numbers: a reducible quadratic would have a rational root, whereas for every .
Because , the constant polynomial one evaluates to the nonzero identity matrix , so . Both and are monic polynomials; hence the only remaining divisor is
The nonconstant invariant factors of a linear operator satisfy . By part (a)(i), is an irreducible polynomial, so every must equal . Their polynomial degrees sum to , giving .
The companion matrix of , in the basis of , is
Therefore, for each fixed even , every such has rational canonical form
There are no such matrices when is odd. This is an instance of the rational canonical form with irreducible minimal polynomial principle; equality of minimal polynomials alone does not determine rational canonical form in general.
Let be nonzero. If the columns were linearly dependent over the rational numbers, then for some . Applying once more would give
so . Since , this forces , impossible in . Thus the two columns are linearly independent, and the square matrix
is an invertible matrix.
In the basis , the linear map given by sends to the second basis vector and sends to . Equivalently,
Multiplying on the left by the matrix inverse gives
This change of basis produces the companion matrix found in part (a)(ii).

Articles by others on the same topic (0)

There are currently no matching articles.