Characteristic Polynomial for A with a=-1

keddelove
Messages
3
Reaction score
0
And again a question:

L is a field for which a \in L. The matrix

<br /> A = \frac{1}{2}\left( {\begin{array}{*{20}c}<br /> 1 &amp; 1 &amp; 1 &amp; 1 \\<br /> 1 &amp; a &amp; { - 1} &amp; { - a} \\<br /> 1 &amp; { - 1} &amp; 1 &amp; { - 1} \\<br /> 1 &amp; { - a} &amp; { - 1} &amp; a \\<br /> \end{array}} \right)<br />

has the characteristic polynomial

<br /> x^4 - \left( {a + 1} \right)x^3 + \left( {a - 1} \right)x^2 + \left( {a + 1} \right)x - a<br />

I need to show that this information is correct for a=1 in any field.

My problem is that when i calculate the polynomial for a=-1 I end up with another characteristic polynomial than the one given. Maybe I'm going about it the wrong way. Suggestions or pointers are very welcome
 
Physics news on Phys.org
I don't understand the question...

And if you want to show something is correct for a=1, then why are you looking at a=-1?
 
i conjecture he meant the characteristic polynomial is accurate for a any element of any field, and yet it failed for a = -1.
 
Oops, should have stated:

Show that this is correct for a=-1 in any field.
 
##\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