Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

I wish to prove that any $2\times 2$ matrix $T$ with only one eigenvalue $ \lambda$ of geometric multiplicity 1 is similar to one of the form

$\left[\begin{array}{cc} \lambda & 1 \\ 0 &\lambda \end{array}\right]$.

Now if I choose my basis to be $v$, where $v$ is some eigenvector of $\lambda$ and any vector $w$ not in null $(T - \lambda I)$ this should work. It is obvious in this basis how the first column of the matrix above comes about,

and for the second column, we note that

$T(w) = (T-\lambda I)w + \lambda w$ and by Cayley-Hamilton it is clear that $(T - \lambda I)w$ is an eigenvector of $T$. However this only means that in the matrix above I have a constant, not necessarily 1 in the slot where it is sitting.

How can I choose $w$ so that $(T-\lambda I)w$ is an eigenvector of $T$ of eigenvalue 1?

Thanks.

share|improve this question

1 Answer 1

up vote 2 down vote accepted

Once you have $\left[\begin{array}{cc} \lambda & c \\ 0 &\lambda \end{array}\right]$ with $c\neq0$, you can use

$$\begin{bmatrix}c^{-1}&0\\0&1\end{bmatrix}\begin{bmatrix}\lambda&c\\0&\lambda\end{bmatrix}\begin{bmatrix}c&0\\0&1\end{bmatrix}=\begin{bmatrix}\lambda&1\\0&\lambda\end{bmatrix}\;.$$

share|improve this answer
1  
You're right, so my basis instead of being $\{v,w\}$ would now be $\{cv,w \}$ for $c\neq 0$. –  user38268 Oct 13 '11 at 6:27
    
@Benjamin: Whether a vector is an eigenvector of an operator is basis-independent. I didn't look at what you wrote about eigenvectors in detail; I understood your problem to be that you could reach the form $\left[\begin{array}{cc} \lambda & c \\ 0 &\lambda \end{array}\right]$ but not $\left[\begin{array}{cc} \lambda & 1 \\ 0 &\lambda \end{array}\right]$, so that's what I addressed. –  joriki Oct 13 '11 at 7:21

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.