Eigenvector for Complex Eigenvalue help

SeannyBoi71
Messages
84
Reaction score
0
In my lecture notes my prof used the eigenvalue c= 1 + i and ended up with the matrix with (5 3+i) as row 1, and the second row is zeroes. After that, he simply wrote that the basis for this eigenvalue c is (3+i,-5) (in column form) without explaining. How did he get that basis? I tried working it out and not sure what he did.
 
Physics news on Phys.org
I really don't understand what you are trying to say. You cannot start with an eigenvalue and just make a matrix out of it. Possibly, you are saying that 1+i is an eigenvalue of a given matrix and that the new matrix was constructed of corresponding eigenvectors. Also, it makes no sense to say "a basis for an eigenvalue" since only vector spaces have bases and an eigenvalue is a number. Perhaps you mean "basis for the subspace of all eigenvectors corresponding to the given eigenvalue".


What was the original matrix for which 1+ i was an eigenvalue? That is essential to understanding this.

(It is certainly true that the vectors (5, 3+i) and (3+ i, -5) are orthogonal. That may be relevant.)
 
HallsofIvy said:
Perhaps you mean "basis for the subspace of all eigenvectors corresponding to the given eigenvalue".)

Yes, this is what I meant. Sorry for any confusion.

In the example, A=(4 2) (row 1) and (-5 -2) (row 2) (my apologies, I don't know how to put actually make that into a matrix here). We found the characteristic polynomial, and that the roots were 1+i and 1-i. He took the eigenvalue 1+i, and proceeded to get the eigenvector for that eigenvalue. When he plugged in ((i+1)I_2 - A)) he then row reduced and got the matrix I said in my first post. He then wrote that the basis for this eigenvalue was (3+i, -5). I hope that clarifies. I was just confused on the arithmetic he did to get that basis.
 
It is because for a real operator eigenvalues and eigenvectors come in complex conjugate pairs.
so if we have the eigen pair
1 + i;(3+i,-5)
we also have the eigen pair
1 - i;(3-i,-5)
 
If you row reduce a 2x2 singular matrix, you will always get something of the form
\left(\begin{array}{c}a & b \\ 0 & 0\end{array}\right)
And if you want a non-zero solution to
\left(\begin{array}{c}a &amp; b \\ 0 &amp; 0\end{array}\right) <br /> \left(\begin{array}{c}x \\ y \end{array}\right)= <br /> \left(\begin{array}{c}0 \\ 0 \end{array}\right)
If sould be obvious it will be a multiple of
\left(\begin{array}{c}-b \\ a\end{array}\right)
 
Ok this all makes sense. Thank you
 
##\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