MHB Finding Eigenvalues of Matrix A: Wrong Answer, What Am I Doing Wrong?

Yankel
Messages
390
Reaction score
0
Hello all,

I have a matrix A and I am looking for it's eigenvalues. No matter what I do, I find that the eigenvalues are 0, 1 and (k+1), while the answer of both the book and Maple is 0 and (k+2). I tried two different technical approaches, both led to the same place.

The matrix is:

\[A=\begin{pmatrix} 1 &1 &k \\ 1 &1 &k \\ 1 &1 &k \end{pmatrix}\]

I have stated with calculating

\[\lambda I-A\]

which is

\[A=\begin{pmatrix} \lambda -1 &-1 &-k \\ -1 &\lambda -1 &-k \\ -1 &-1 &\lambda -k \end{pmatrix}\]

Now I calculate the determinant of this matrix. Whatever I do, I get the wrong answer. Can you please assist ?

Thank you.
 
Physics news on Phys.org
Hi Yankel,

I believe you actually want to find $\text{det }(A-\lambda I)=0$ in order to calculate the eigenvalues. What do you get when you try that?
 
Is your determinant [math]\lambda ^3 - \lambda ^2(k + 2)[/math]?

-Dan
 
Last edited by a moderator:
Yankel said:
Hello all,

I have a matrix A and I am looking for it's eigenvalues. No matter what I do, I find that the eigenvalues are 0, 1 and (k+1), while the answer of both the book and Maple is 0 and (k+2). I tried two different technical approaches, both led to the same place.

The matrix is:

\[A=\begin{pmatrix} 1 &1 &k \\ 1 &1 &k \\ 1 &1 &k \end{pmatrix}\]

I have stated with calculating

\[\lambda I-A\]

which is

\[A=\begin{pmatrix} \lambda -1 &-1 &-k \\ -1 &\lambda -1 &-k \\ -1 &-1 &\lambda -k \end{pmatrix}\]

Now I calculate the determinant of this matrix. Whatever I do, I get the wrong answer. Can you please assist ?

Thank you.
Check your calculations again! You should find that $\det(\lambda I - A) = \begin{vmatrix} \lambda -1 &-1 &-k \\ -1 &\lambda -1 &-k \\ -1 &-1 &\lambda -k \end{vmatrix} = \lambda^2(\lambda-k-2).$
 
Last edited:
##\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