Minimal vs Characteristic Polynomials

Click For Summary
In a linear operator T on an n-dimensional vector space V with n distinct eigenvalues, the minimal polynomial and the characteristic polynomial are identical up to a factor of +/- 1. The characteristic polynomial is defined as det(A - λI), while the minimal polynomial is the polynomial of least degree such that p(A) = 0. If T has n independent eigenvectors, the minimal polynomial must include factors corresponding to each eigenvalue, making it equal to the characteristic polynomial. However, the characteristic polynomial can differ from the minimal polynomial if an eigenvalue has different algebraic and geometric multiplicities. The discussion highlights the importance of understanding eigenvalue properties in determining polynomial relationships.
cadillacclaire
Messages
2
Reaction score
0
Let T:V to V be a linear operator on an n-dimensional vector space V. Let T have n distinct eigenvalues. Prove that the minimal polynomial and the characteristic polynomial are identical up to a factor of +/- 1

I'm probably over thinking this, but it seems that if you have n distinct eigenvalues then the minimal polynomial would have to be EXACTLY the same as the characteristic. How could it be different?

Thanks in advance!
 
Physics news on Phys.org
The characteristic polynomial for a matrix is the polynomial det(A- \lambda I). The minimal polynomial is the polynomial of least degree, p, such that p(A)= 0.

Yes, if an n by n matrix has n distinct eigevalues, \{\lambda_i\}, then, since eigenvectors corresponding to distinct eigenvalues are independent, there exist a basis for the space, \{\vec{v}_i\}, consisting of eigenvectors. In order that p(A)= 0 we must have p(A)(\vec{v}_i)= 0 for every such eigenvector and that means p(A) must have a factor of the form (x- \lambda_i) which, in turn, means that the minimal polynomial is the characteristic polynomial.

In fact, it is not necessary that all eigenvalues be distinct. If an n by n matrix has n independent eigenvectors (if it is diagonalizable) then the characteristic polynomial is the same as the minimal polynomial. If an eigenvalue, \lambda, has "algebraic multiplicity" (the number of factors of the form (x- \lambda) in the characteristic polynomial) n, then, by definition, the charactaristice polynomial has a factor of (x- \lambda)^n. If an eigenvalue, \lambda has "geometric multiplicity" (the dimension of the subspace of eigenvectors corresponding to the eigenvalue) m, then the minimal polynomial contains the factor (x-\lambda)^m.

So the characteristic polynomial is the same as the minimal polynomial if and only if the geometric multiplicity of every eigenvalue is the same as it algebraic multiplicity.
 
Thanks for the quick reply. I think the problem itself was not worded very well and that's what threw me off. Good to know that I'm on the right track!
 
Question: A clock's minute hand has length 4 and its hour hand has length 3. What is the distance between the tips at the moment when it is increasing most rapidly?(Putnam Exam Question) Answer: Making assumption that both the hands moves at constant angular velocities, the answer is ## \sqrt{7} .## But don't you think this assumption is somewhat doubtful and wrong?

Similar threads

  • · Replies 24 ·
Replies
24
Views
4K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 10 ·
Replies
10
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
Replies
5
Views
2K
  • · Replies 3 ·
Replies
3
Views
4K
Replies
6
Views
2K
  • · Replies 4 ·
Replies
4
Views
4K
  • · Replies 7 ·
Replies
7
Views
4K