Can we still diagnolize a matrix if its eigenvectors matrix is singular?

AdrianZ
Messages
318
Reaction score
0
well, if a matrix has n linearly independent eigen-vectors then it's easy, what if a matrix is not diagnolizable in that way? Can we still diagnolize it by other means?
And what if a matrix is not diagonalizable at all? Are there still ways to find its exponential matrix?
 
Physics news on Phys.org
If you don't have enough eigenvectors you can't diagonalize it. There is a theorem that says: An n-by-n matrix A is diagonalizable if and only if the sum of the dimensions of its eigenspaces is equal to n.

However, you can 'almost' diagonalize any matrix you want. One way to do this is to use something called Jordan normal forms (http://en.wikipedia.org/wiki/Jordan_normal_form).

Since you are asking about exponential matrices, you might be interested in the Jordan–Chevalley decomposition which allows you to compute the exponential of a matrix by writing it as the sum of a diagonalizable matrix and nilpotent matrix.
 
##\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