Puzzled about characteristic polynomial output from my calc

AdamR
Messages
2
Reaction score
0
Hello everyone, first time poster, long time reader here!

I'm an ex-math major and while I'm no longer pursuing a degree anymore in mathematics, I still continue onwards in my spare time trying to learn as much as I can about it because it's always been something I've enjoyed partaking in and sharing the knowledge with others. I did manage to pull off three years of classes at my university while as a math major. I have a pretty firm grip with calc/odes/(beginning) pdes, intro linear algebra, basic proofs and logic, intro group theory, intro complex analysis, and some very basic topology.

I decided to treat myself with an early X-Mas present of a new calculator (ti-nspire cx cas); been trying to follow along with the examples given in the manual. Anyway, I'm just puzzled about the output on my calc regarding calculating char polynomials. It currently has the operation defined as p_{A}(\lambda) = det(\lambda * I - A) with I as the nxn ident matrix, A is any nxn square matrix. When I use the charPoly function on the calculator with the matrix A = \left(\begin{array}{ccc} 1 & 3 & 0\\ 2 & -1 & 0\\ -2 & 2 & 5 \end{array}\right), the calc outputs -\lambda^3+5\lambda^2+7\lambda-35

When I try to do it by hand, my answer is off by a factor of -1. Hopefully someone can point out to me where my mistake is:

So I get \lambda*I - A = \left(\begin{array}{ccc} \lambda-1 & -3 & 0\\ -2 & \lambda+1 & 0\\ 2 & -2 & \lambda-5 \end{array}\right)

det(\lambda*I - A) = (\lambda - 1) \left|\begin{array}{cc} \lambda+1 & 0\\ -2 & \lambda-5 \end{array}\right| + 3 \left|\begin{array}{cc} -2 & 0\\ 2 & \lambda-5 \end{array}\right|

= (\lambda-1)(\lambda+1)(\lambda-5)+3[-2(\lambda-5)]

= \lambda^3 -5\lambda^2 - 7\lambda + 35


Not really that big of a deal per se, just trying to find where I've made a mistake; any insight would be greatly appreciated.

P.S. Hands down, PF is one of the BEST sites out there! :!)
 
Physics news on Phys.org
Your calculation seems correct.

Somehow I think that your calculator defines the characteristic polynomial as \det(A-\lambda I). And not as \det(\lambda I -A) like the manual claims.

Can you test this by finding the characteristic polynomial of the 3\times 3 zero matrix?? Under your definition, it should be \lambda^3.
 
micromass said:
Your calculation seems correct.

Somehow I think that your calculator defines the characteristic polynomial as \det(A-\lambda I). And not as \det(\lambda I -A) like the manual claims.

Can you test this by finding the characteristic polynomial of the 3\times 3 zero matrix?? Under your definition, it should be \lambda^3.

Hmm this is quite funky...
\det(A-\lambda I) yields -\lambda^3, the same as if I were to output it with the charPoly() function. However, when I type in \det(\lambda I -A), it spits out \lambda^3

Even after clearing out any stored variables/history and resetting it, nothing changes. Wonder if it's a kink with the software?
 
It looks like a kink in the documentation, not the software.

The characteristic polymonial should be ##\det(A - \lambda I)##, as Micromass said.
 
Some texts define the characteristic polynomial as ##det(A-λI)##, others as ##det(λI-A)##. So both you and your software are correct, or rather, neither is more right than the other.
It has little practical significance, since these two only differ with a factor ##-1##, if ##n## (the size of the matrix) is odd.
 
It's the same thing. You can just multiply by -1. The polynomial is equal to 0, so yeah.
 
##\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...

Similar threads

Back
Top