Finding the Jordan decomposition

  • Thread starter Thread starter DeadOriginal
  • Start date Start date
  • Tags Tags
    Decomposition
Click For Summary
The discussion revolves around finding the Jordan decomposition of a linear transformation T defined by specific actions on a basis. The matrix A representing T is identified as a 2x2 matrix, and the user attempts to find a triangular matrix B and an invertible matrix S to satisfy the relationship SB=AS. A new basis is proposed, leading to a triangular matrix B with a specific form and a corresponding S matrix. Clarifications are provided regarding the definitions of matrices D and N in the context of Jordan decomposition, confirming that N is nilpotent and that the decomposition T=D+N is valid. The conversation highlights the distinction between diagonalizable and nilpotent transformations in the context of Jordan decomposition.
DeadOriginal
Messages
274
Reaction score
2

Homework Statement


I have a linear transformation T defined by
$$
T(v_{1})=v_{1}+iv_{2}\\
T(v_{2})=-iv_{1}+v_{2}\\
$$
and I want to find a triangular matrix B of T and an invertible matrix S such that SB=AS where A is the matrix of T with respect to the basis ##\{v_{1},v_{2}\}##.

The Attempt at a Solution


The matrix A is
$$
\begin{pmatrix}
1 & -i \\
i & 1 \\
\end{pmatrix}.
$$
From the proof of the triangular form theorem, I know that I need to find a new basis ##\{w_{1},w_{2}\}## such that ##Tw_{1}=0## and ##(T-2)w_{2}=0## since the minimal polynomial is ##m(T)=T(T-2)=0## but I must be messing something up because there is no way I can create a triangular matrix B from ##w_{1}## and ##w_{2}##. If I find a linear combination of ##v_{1},v_{2}## equal to ##w_{1}## such that ##Tw_{1}=0## then the first column of my matrix B would always be 0.
 
Physics news on Phys.org
It's okay to have zeros on the diagonal.
 
vela said:
It's okay to have zeros on the diagonal.

Hmm. I am choosing the new basis ##w_{1}=v_{1}-iv_{2}## and ##w_{2}=v_{1}+iv_{2}## which gives me
$$
B=\begin{pmatrix}
0 & 0 \\
0 & 2 \\
\end{pmatrix}
$$
and
$$
S=\begin{pmatrix}
1 & 1 \\
-i & i \\
\end{pmatrix}
$$
which gives me the SB=AS that I need but then when I do the Jordan decomposition is it okay to have
$$
D=\begin{pmatrix}
0 & 0 \\
0 & 2 \\
\end{pmatrix}
$$
and
$$
N=\begin{pmatrix}
0 & 0 \\
0 & 0 \\
\end{pmatrix}
$$
so that T=D+N?
 
I'm afraid I'm not familiar with what you're trying to do. D, I assume, is supposed to be a diagonal matrix. What is N defined to be?
 
vela said:
I'm afraid I'm not familiar with what you're trying to do. D, I assume, is supposed to be a diagonal matrix. What is N defined to be?

I am trying to find the Jordan Decomposition of T. That is what it is called in my book. From a quick search it doesn't look like it goes by the name of Jordan Decomposition on wikipedia.

In my book D is defined to be a diagonalizable linear transformation while N is defined to be a nilpotent linear transformation such that T=D+N.
 
Your N is definitely nilpotent, so that decomposition looks fine to me. Since the transformation you were given doesn't have degenerate eigenvalues, the associated eigenvectors will form a basis, and you should expect the similarity transformation to yield a diagonal matrix and to therefore have N=0.

If you had degenerate eigenvalues, it's then possible that the eigenvectors won't form a basis, and you'd have to resort to generalized eigenvectors. In this case, the similarity transformation would yield an almost-diagonal matrix, the so-called Jordan normal form, and N would have non-zero entries just above some of the diagonal elements.
 
DeadOriginal said:
I am trying to find the Jordan Decomposition of T. That is what it is called in my book. From a quick search it doesn't look like it goes by the name of Jordan Decomposition on wikipedia.
It seems to go by the name Jordan-Chevalley decomposition.
 

Similar threads

  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 6 ·
Replies
6
Views
1K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 2 ·
Replies
2
Views
1K
Replies
9
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 12 ·
Replies
12
Views
3K
Replies
4
Views
2K