1. Limited time only! Sign up for a free 30min personal tutor trial with Chegg Tutors
    Dismiss Notice
Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Diagonalizable matrix proof using minimal polynomial

  1. Sep 19, 2013 #1
    1. The problem statement, all variables and given/known data
    A matrix A[itex]\in[/itex]Mn(ℂ) is diagonalizable if and only if mA(x) has no repeated roots.

    2. Relevant equations
    If A[itex]\in[/itex]Hom(V,V) = {A:V→V | A is a linear map}, the minimal polynomial of A, mA(x), is the smallest degree monic polynomial f(x) such that f(A)=0.

    3. The attempt at a solution
    In one direction, want to prove if mA(x) has repeated roots, then there are not n linearly independent eigenvectors in A (with A n X n)
  2. jcsd
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook

Can you offer guidance or do you also need help?
Draft saved Draft deleted

Similar Discussions: Diagonalizable matrix proof using minimal polynomial