16.-Linear-Algebra-by-Kenneth-Hoffman · Problem 7.2.15

The Rational and Jordan Forms

Mathematics — Linear Algebra · minimal-polynomial-over-subfield

Problem

Let FF be a subfield of the field of complex numbers, and let AA be an n×nn \times n matrix over FF. Let pp be the minimal polynomial for AA. If we regard AA as a matrix over C\mathbb{C}, then AA has a minimal polynomial ff as an n×nn \times n matrix over C\mathbb{C}. Use a theorem on linear equations to prove p=fp = f. Can you also see how this follows from the cyclic decomposition theorem?

Related theory

Browse the problem library