Constructing a matrix for a prescribed eigenspace

  • Thread starter Thread starter morsel
  • Start date Start date
  • Tags Tags
    Matrix
morsel
Messages
29
Reaction score
0

Homework Statement


Find a 2x2 matrix A for which E1 = span [ 2 1 ] (vertical matrix) is the only eigenspace.


Homework Equations





The Attempt at a Solution


I don't know how to begin this problem.. Any hints?
 
Physics news on Phys.org
Do you understand that there are an infinite number of answers? If the "eigenspace" can be spanned by a single vector, then there cannot be two independent eigenvectors- and that means, in turn, that there cannot be two distinct eigenvalues. But since you are not given the single eigenvalue, it can be anything. And if a 2 by 2 matrix has only a one independent eigenvector, it is similar to a "Jordan Normal Form"
\begin{bmatrix} a & 1 \\ 0 & a\end{bmatrix}
where a is the eigenvalue.

Then you can construct a matrix, P, having the given eigenvector <2, 1>, as first column, and just choose a second row that it easy to find the inverse of P.
Then P^{-1}AP will be a matrix having that only multiples of <2, 1> as eigenvectors. Even after you have done that, you will be able to choosed a to be whatever you want.
 
Last edited by a moderator:
Yes, I know that there's an infinite number of answers but I was wondering whether there was a structured method for finding one.

Thank you for your explanation!
 
Thread 'Use greedy vertex coloring algorithm to prove the upper bound of χ'
Hi! I am struggling with the exercise I mentioned under "Homework statement". The exercise is about a specific "greedy vertex coloring algorithm". One definition (which matches what my book uses) can be found here: https://people.cs.uchicago.edu/~laci/HANDOUTS/greedycoloring.pdf Here is also a screenshot of the relevant parts of the linked PDF, i.e. the def. of the algorithm: Sadly I don't have much to show as far as a solution attempt goes, as I am stuck on how to proceed. I thought...
Back
Top