When p(A)=0 iff p(B)=0 for any polynomial,why same minimal polynomial?

td21
Gold Member
Messages
177
Reaction score
8
For two matrices A and B, when p(A)=0 iff p(B)=0 for any polynomial, what will happen? i read that A and B have the same minimal polynomial, why?
 
Physics news on Phys.org
td21 said:
For two matrices A and B, when p(A)=0 iff p(B)=0 for any polynomial, what will happen? i read that A and B have the same minimal polynomial, why?

Let m_A, m_B be the minimal polynimials of A and B. Then m_A (A) = 0\Rightarrow m_A (B) = 0 \Rightarrow m_B / m_A^{(1)}
and
m_B (B) = 0\Rightarrow m_B (B) = 0 \Rightarrow m_A / m_B ^{(2)}
\overset {(1), (2)}{\Rightarrow} m_A = k \cdot m_B
with k a constant.
But m_A, m_B are both monic polynomials so, k=1
and finally m_A = m_B.
 
Pretty much the same thing but in slightly differentwords:

Suppose PA(x), of degree n, is the minimal polynomial for A. Then PA(A)= 0 so PA(B)= 0. If This is not the minimal polynomial for B, there exist a polynomial PB, of degree m< n, such that PB(A)= 0. But then PB(A)= 0 contradicting the fact that the mininal polynomial of A has degree n> m.
 
##\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