MHB Determining Value of a in Matrix A with $\lambda$ = 0

  • Thread starter Thread starter Yankel
  • Start date Start date
  • Tags Tags
    Matrix Value
Yankel
Messages
390
Reaction score
0
Hello all,

Given the following matrix,

\[A=\begin{pmatrix} 2 & 6\\ 1 & a \end{pmatrix}\]

and given that

\[\lambda =0\]

is an eigenvalue of A, I am trying to determine that value of a.

What I did, is to create the characteristic polynomial

\[(\lambda -2)*(\lambda -a)+6=0\]

and given

\[\lambda =0\]

I got that a is -3.

Somehow I am not sure. Is there a way of finding the second eigenvalue before calculating a ?

Thank you !
 
Physics news on Phys.org
You could use that the determinant is the product of the eigenvalues.
(Also, the trace is the sum of the eigenvalues, but in this case you do not need that to determine $a$. You could use it to determine the second eigenvalue, though.)
 
Last edited:
Yankel said:
Hello all,

Given the following matrix,

\[A=\begin{pmatrix} 2 & 6\\ 1 & a \end{pmatrix}\]

and given that

\[\lambda =0\]

is an eigenvalue of A, I am trying to determine that value of a.

What I did, is to create the characteristic polynomial

\[(\lambda -2)*(\lambda -a)+6=0\]

and given

\[\lambda =0\]

I got that a is -3.

Somehow I am not sure. Is there a way of finding the second eigenvalue before calculating a ?

Thank you !
Check the signs in that calculation! I think that it should be $-6$ in the characteristic polynomial.
 
Opalg, you are correct, it is -6 and therefore a=3. Am I correct ?
 
Yankel said:
Somehow I am not sure. Is there a way of finding the second eigenvalue before calculating a ?

As Krylov pointed out, the trace is the sum of the eigenvalues.
So if one eigenvalue is 0, then the other is $\operatorname{Tr}A=2+a$.

And yes, a=3 is the correct solution.
 
##\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