Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Companion matrix
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
==Similarity to companion matrix== Any matrix {{mvar|A}} with entries in a [[field (mathematics)|field]] {{mvar|F}} has characteristic polynomial <math> p(x) = \det(xI - A) </math>, which in turn has companion matrix <math> C(p) </math>. These matrices are related as follows. The following statements are equivalent: * ''A'' is [[similar (linear algebra)|similar]] over ''F'' to <math> C(p) </math>, i.e. ''A'' can be conjugated to its companion matrix by matrices in GL''<sub>n</sub>''(''F''); * the characteristic polynomial <math> p(x) </math> coincides with the minimal polynomial of ''A'' , i.e. the minimal polynomial has degree ''n''; * the linear mapping <math>A:F^n\to F^n</math> makes <math>F^n</math> a [[Cyclic module|cyclic]] <math>F[A]</math>-module, having a basis of the form <math>\{v,Av,\ldots,A^{n-1}v\} </math>; or equivalently <math>F^n \cong F[X]/(p(x))</math> as <math>F[A]</math>-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 [[Frobenius normal form|rational canonical form]] of ''A''.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)