Questing about eigenvector order

  • Thread starter Thread starter 939
  • Start date Start date
  • Tags Tags
    Eigenvector
Physics news on Phys.org
The equation he obtains is
$$
\left( \begin{array}{cc} 8 & 1 \\ -8 & -1 \end{array} \right) \left( \begin{array}{c} x \\ y \end{array} \right) = 0
$$
##(x,y) = (1, -8)## is a solution, but not ##(x,y) = (-8, 1)##. Try it for yourself: substitue the possible solutions in the above equation, and see what works.

By the way, there is an infinite number of possible solutions: any vector ##a (1, -8)## is also a solution (with ##a## a scalar). Which one to choose is arbitrary. In the video, he could have chosen ##y=1## instead, and found ##(x,y) = (-1/8, 1)## (you can check for yourself that solution also).
 
  • Like
Likes 1 person
You talk here, and in a similar question in the homework section as if the "eigenvector" were just two numbers in arbitrary order. It is not- it is a vector which, in this case, can be represented[/b] as an ordered pair of numbers.

You should, yourself, have done the multiplication
\begin{pmatrix}8 & 1 \\ -8 & -1\end{pmatrix}\begin{pmatrix}-8 \\ 1\end{pmatrix}= \begin{pmatrix}-64+ 1 \\ 64- 1\end{pmatrix}= \begin{pmatrix}-63 \\ 63\end{pmatrix}
which is NOT
0\begin{pmatrix}-8 \\ 1 \end{pmatrix}
 
  • Like
Likes 1 person
##\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