Eigenvalues of AX - XA: Finding Eigenvectors for a Real 2x2 Symmetric Matrix

  • Thread starter Thread starter alchemik
  • Start date Start date
  • Tags Tags
    Eigenvalues
alchemik
Messages
2
Reaction score
0
Hi all,

Here is this problem that I have been at for some time now: find eigenvalues and corresponding eigenvectors of the following linear mapping on a vector space of real 2 by 2 matrices:

L(X) = AX - XA, where A is 2 by 2 symmetric matrix that is not a scalar multiple of identity.

It is clear that 0 is one eigenvalue of the above with an eigenspace consisting of all matrices X that commute with A, I do not know however what its algebraic multiplicity would be, except that it has to be less than 4. To find the other eigenvalues I looked at

AX - XA = \lambda X

a column at a time to obtain a 4 by 4 system.

Ax_{i} - \sum^{2}_{j = 1}a_{ji}x_{i} = \lambda x_{i}

for i = 1, 2, with j indexing the rows of A.

This approach requires me to find eigenvalues and eigenvectors of a 4 by 4 matrix, which may get messy if you have to do it by hand. Do you guys know any other, more efficient way of approaching this problem? I have attempted to use the fact that A can be orthogonally diagonalized in hopes of simplifying the above but with no success.

Thanks.
 
Physics news on Phys.org
Diagonalize A: let A = P-1DP, where D = diag(k1, k2). Given any matrix X, write
X = P^{-1} \begin{pmatrix}a&b\\c&d\end{pmatrix}P.
You can compute that
L(X) = P^{-1} \begin{pmatrix}0&(k_1-k_2)b\\(k_2-k_1)c&0\end{pmatrix}P.
You can now directly read off the eigenvalues of L: 0, 0, k1 - k2, and k2 - k1. The eigenvectors are also obvious.

The same process applies to arbitrary diagonalizable matrices. If A is a n × n diagonalizable matrix and L(X) = AX - XA, and A has eigenvalues k1, ..., kn, then the eigenvalues of L are ki - kj, for each pair of i, j from 1, ..., n.
 
This is indeed a lot more tractable, thanks a lot adriank!
 
Thread 'Determine whether ##125## is a unit in ##\mathbb{Z_471}##'
This is the question, I understand the concept, in ##\mathbb{Z_n}## an element is a is a unit if and only if gcd( a,n) =1. My understanding of backwards substitution, ... i have using Euclidean algorithm, ##471 = 3⋅121 + 108## ##121 = 1⋅108 + 13## ##108 =8⋅13+4## ##13=3⋅4+1## ##4=4⋅1+0## using back-substitution, ##1=13-3⋅4## ##=(121-1⋅108)-3(108-8⋅13)## ... ##= 121-(471-3⋅121)-3⋅471+9⋅121+24⋅121-24(471-3⋅121## ##=121-471+3⋅121-3⋅471+9⋅121+24⋅121-24⋅471+72⋅121##...
##\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...
Back
Top