NRQM Class

R. Rogers
23 ,26
-

Prob 23:
The characteristic polynomials are:
1 0 0
A:(a)(+a)2 with roots a, a and eigenvectors 0 , m 1 +n 0
0 0 1
1 0 0
B: (b)2 (+b) with roots b,-b and eigenvectors m 0 +n i , i
0 1 1

a. Yes
b.

ab 0 0
The product is: 0 0 iab
0 i a b 0
from either side.

c.

1
Obviously 0 works for one eigenket and has eigenvlaues a,b respectively.
0
0
i works with eigenvalues -a,b
1

0
i works with eigenvalues -a,-b
1

0
Any vector v a can satisfy Av=-av .
b
but it is impossible for it to satisfy Bv= -bv=bv
Similiary we can satisfy Bv=bv but then Av =-av=av
Thus, because of the combinatorial properties for the (or any) common eigenvalues
there is only one set of solutions.

1
Prob 26:
   
1 1
Since Sz is already diagonal we can use the eigenkets of Sx , to form
  1 1
1 1 1
the Unitary matrix U = 2 and U Sx U = Sz
1 1

I will take a moment to digress into a matrix representation interpretation of 1.5.4

(for those of us who have problems interpreting the symbolism)
z x
 Let A , B be a column collection the normalized eigenkets of Az , Bx for instance
1 0
= S z for Sz
0 1
 
1 1
Similiarly for Sx S z = 12
1 1
The use of z, x in Az , B x is just for identification, the following is general.
(Az )Az = I and the same holds for B x because they are composed of normalized
eigenkets.
Then consider U = B z (Az ) (or Sz (S x ) in our case), note that U U = I.
Now we prove that |bl >= U |al > in matrix representation
Multiplying U on the right by eigenkets of A ,v will move a one around the output
of
(Az ) v depending upon the ordering of B. Now the wandering one will extract
z
exactly one of the eigenkets of B fromB    
x 1 0 1 1 1 1
Now evaluating Sz (S ) =
0 1 1 1 1 1

I guess I should apologize for using a crutch, matrix representation, but I have
problems following the flying summations and superscripts. Hopefully I will be
able to dispense with the crutch after a while; although it took me a long time to
do Linear Algebra in the abstract (and proper) form.