Having trouble understanding minimal polynomial problems

catsarebad
Messages
69
Reaction score
0
i understand how to find minimal poly. if a matrix is given. i am curious if you can find the matrix representation if minimal polynomial is given.

i'm not exactly sure how you could since you can possibly lose repeated e-values when you write minimal polynomial. how can u create a n dimensional matrix from a polynomial with possibly lower power? idk just a dumb thought.
 
Physics news on Phys.org
Two distinct matrices (even of different sizes) can have the same minimal polynomial. So there is no "matrix representation" of a minimal polynomial.
 
Even if all eigenvalues were of "multiplicity" 1, they could correspond to different eigenvectors so to different matrices.
 
catsarebad said:
i understand how to find minimal poly. if a matrix is given. i am curious if you can find the matrix representation if minimal polynomial is given.

i'm not exactly sure how you could since you can possibly lose repeated e-values when you write minimal polynomial. how can u create a n dimensional matrix from a polynomial with possibly lower power? idk just a dumb thought.

I wouldn't call it a dumb thought, it is good that you are trying to develop a deeper understanding.

As was mentioned by other posters, distinct matrices can have the same minimal polynomial. In fact, similar matrices have the same minimal polynomial.

Given a minimal polynomial, you can construct particularly nice block matrices which are called rational canonical forms. Now for a given minimal polynomial for some nxn matrix, there is potentially more than one rational canonical forms you could construct. You would need to know more than just the minimal polynomial for your given transformation to determine which rat. canon. form is right for your transformation.
 
Let your vector space be polynomials modulo then given polynomial. Let the operator be multiplication by x. The matrix of the operator will have the desires minimal polynomial (of course not unique).
 
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
Back
Top