Is every matrix similar to a polynomial in a companion matrix?

preprint2013arXivOpen access

Abstract

Given a field FF, an integer n≥1n\geq 1, and a matrix A∈Mn(F)A\in M_n(F), are there polynomials f,g∈F[X]f,g\in F[X], with ff monic of degree nn, such that AA is similar to g(Cf)g(C_f), where CfC_f is the companion matrix of ff? For infinite fields the answer is easily seen to positive, so we concentrate on finite fields. In this case we give an affirmative answer, provided ∣F∣≥n−2|F|\geq n-2. Moreover, for any finite field FF, with ∣F∣=m|F|=m, we construct a matrix A∈Mm+3(F)A\in M_{m+3}(F) that is not similar to any matrix of the form g(Cf)g(C_f). Of use above, but also of independent interest, is a constructive procedure to determine the similarity type of any given matrix g(Cf)g(C_f) purely in terms of ff and gg, without resorting to polynomial roots in FF or in any extension thereof. This, in turn, yields an algorithm that, given gg and the invariant factors of any AA, returns the elementary divisors of g(A)g(A). It is a rational procedure, as opposed to the classical method that uses the Jordan decomposition of AA to find that of g(A)g(A). Finally, extending prior results by the authors, we show that for an integrally closed ring RR with field of fractions FF and companion matrices C,DC,D the subalgebra R<C,D>R< C,D> of Mn(R)M_n(R) is a free RR-module of rank n+(n−m)(n−1)n+(n-m)(n-1), where mm is the degree of gcd⁡(f,g)∈F[X]\gcd (f,g)\in F[X], and a presentation for R<C,D>R< C,D> is given in terms of CC and DD. A counterexample is furnished to show that R<C,D>R< C,D> need not be a free RR-module if RR is not integrally closed. The preceding information is used to study Mn(R)M_n(R), and others, as R[X]R[X]-modules.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.