MHB Is this operator diagonalizable?

  • Thread starter Thread starter Jack3
  • Start date Start date
  • Tags Tags
    Operator
Jack3
Messages
9
Reaction score
0
Let M be the space of all 2 × 2 complex matrices,
satisfying 〖(X)bar〗^t = -X (skew-hermitian).
Consider M as a vector space over R.
Define a bilinear form B on M by B(X,Y) = -tr(XY)

(1) Show that B takes real values, is symmetric and positive definite.

(2) For any A ∈ M , define the operator ad_A: M → M by ad_A(X) = AX – XA.
Show that operator ad_A is diagonalizable.

(3) Let the matrix
A =
( i 1)
(-1 i) .
Compute the eigenvalues of operator ad_A.(For part (2), Maybe we should show there is a basis of M consisting of eigenvectors of ad_A?)Thanks.
 
Physics news on Phys.org
Hint: If $X,Y\in M$ then,

$X=\begin{bmatrix}{x_1i}&{x_2+x_3i}\\{-x_2+x_3i}&{x_4i}\end{bmatrix},\;Y=\begin{bmatrix}{y_1i}&{y_2+y_3i}\\{-y_2+y_3i}&{y_4i}\end{bmatrix}\quad(x_i,y_j\in \mathbb{R})$.

Now, verify: $B(X,Y)=-\mbox{trace }(XY)=\ldots=x_1y_1+x_2y_2+x_3y_3+x_4y_4$
 
##\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