You are on page 1of 3

3.

6 (a) Start with the Pauli matrices  


  0 −1 0 0
1 0 1  −1
σ = 0 0 0 
1 0 Γ7 = i σ 10 = 
 0

0 0 1 
0 0 1 0
   
2 0 −i 3 1 0
σ = σ =
i 0 0 −1 
0 i 0 0

The 4 × 4 γn matrices are given by  −i 0 0 0 
  Γ8 = i σ 20 = 
 0 0 0 −i 

0 σn
γn = 0 0 i 0
−σn 0
 
and   −1 0 0 0
0 I  0 1 0 0 
(2×2) Γ9 = σ 21 =  0 0 −1 0 

γ0 =  
I 0
(2×2) 0 0 0 1
The “normalizing constant” for γn are merely  
factors of i in choosing each ΓA so that the right- −1 0 0 0
0 1 0 0 
Γ10 = i σ 30 = 

hand-side of 
 0 0 1 0 
(1) Tr[ΓA ΓB ] = 4δ AB 0 0 0 −1
is not negative. ie, Tr[γ 3 γ 3 ] = −4. The ΓA ma-  
0 −i 0 0
trices are:
i 0 0 0 
Γ11 = σ 31 = 
  
1 0 0 0

 0 0 0 −i 
 0 1 0 0  0 0 i 0
Γ1 = I =   0 0 1 0 

(4×4)

0 0 0 1
 
0 −1 0 0
 −1 0 0 0 
Γ12 = σ 32
 
0 0 1 0 = 
 0 0 0 −1 
 0 0 0 1 
Γ2 = γ 0 =   0 0 −1 0
 1 0 0 0 
0 1 0 0  
0 0 i 0
   0
0 0 0 i 13 0 5 0 0 i 
Γ = iγ γ =  −i 0

 0 0 i 0  0 0 
Γ3 = i γ 1 =  0 −i 0 0 

0 −i 0 0
−i 0 0 0  
  0 0 0 1
0 0 0 1 14 1 5
 0 0 1 0 
 0 0 −1 0  Γ =γ γ =  0 1 0

Γ4 = i γ 2 =   0 
 0 −1 0 0  1 0 0 0
1 0 0 0  
  0 0 0 −i
0 0 i 0  0 0 i 0 
 0 0 0 −i  Γ15 = γ2 γ5 =  
Γ5 = i γ 3 =  −i 0 0 0 
  0 −i 0 0 
i 0 0 0
0 i 0 0
   
−1 0 0 0 0 0 1 0
 0 −1 0 0   0 0 0 −1 
Γ6 = γ 5 =   0
 Γ16 = γ3 γ5 =  
0 1 0   1 0 0 0 
0 0 0 1 0 −1 0 0
1
2

Now, to prove (1). The matrix ΓA · ΓB is tedious  


to compute, but Tr[ΓA · ΓB ] is easy to compute. 1 0 0 0
Here’s how: We write it out in index form: 2 0 1 0 0 
(Γ8 ) = 


 0 0 1 0 
Tr[ΓA · ΓB ] = ΓA µν ΓB νµ 0 0 0 1
 
This basically means we take matrix ΓA and a 1 0 0 0
transposed matrix ΓB and multiply each corre- 2 0 1 0 0 
(Γ9 ) = 


sponding element and sum. ie, top-left element  0 0 1 0 
multiply top-left element and sum down to bottom- 0 0 0 1
right element multiplied by bottom-right element. 
1 0 0 0

Most will be obviously zero unless the entries 2 0 1 0 0 
(Γ10 ) = 

match position such as Γ2 and Γ16 . You can do  0 0 1

0 
it by eye (and use proof-by-example after you get 0 0 0 1
bored of doing it). The other alternative is to let  
maple do it. Here are some of the more important 1 0 0 0
2 0 1 0 0 
(Γ11 ) = 

ones: 
   0 0 1 0 
1 0 0 0
2  0 1 0 0  0 0 0 1
(Γ1 ) =    
 0 0 1 0  1 0 0 0
0 0 0 1 2 0 1 0 0 
(Γ12 ) = 


   0 0 1 0 
1 0 0 0 0 0 0 1
2  0 1 0 0 
(Γ2 ) = 
 
 0 0 1 0 
 1 0 0 0
2 0 1 0 0 
(Γ13 ) = 

0 0 0 1  0

0 1 0 
0 0 0 1
 
1 0 0 0
 0 1 0 0   
2
(Γ3 ) =   1 0 0 0
 0 0 1 0  2 0 1 0 0 
(Γ14 ) = 


0 0 0 1  0 0 1 0 
  0 0 0 1
1 0 0 0  
2  0 1 0 0  1 0 0 0
(Γ4 ) =   2 0 1 0 0 
 0 0 1 0  (Γ15 ) = 


 0 0 1 0 
0 0 0 1
0 0 0 1
 
1 0 0 0
 
1 0 0 0
2  0 1 0 0  0 1 0 0 
(Γ5 ) =  2
(Γ16 ) = 
 
 0 0 1 0   0 0 1

0 
0 0 0 1 0 0 0 1
 
1 0 0 0
2  0 1 0 0 
(Γ6 ) = 
 0 0 1 0 

0 0 0 1
 
1 0 0 0
2  0 1 0 0 
(Γ7 ) = 
 0 0 1 0 

0 0 0 1
3

3.6 (b) It is scarey enough to write


(ū1 ΓA u2 )(ū3 ΓB u4 ) = C AB M N (ū1 ΓM u4 )(ū3 ΓN u2 )
and it seems to be much worse in the form
(ū1α ΓA αβ u2β )(ū3γ ΓB γδ u4δ ) = C AB M N (ū1α ΓM αδ u4δ )(ū3γ ΓN γβ u2β )
but realize that the u1 , u2 , u3 and u4 are arbitrary and are not very important. That is, the above
equation is just a special-case of
ΓA αβ ΓB γδ = C AB M N ΓM αδ ΓN γβ
Multiply both sides by ΓC δα ΓD βγ and sum
ΓA αβ ΓB γδ ΓC δα ΓD βγ = C AB M N ΓM αδ ΓN γβ ΓC δα ΓD βγ
On the RHS, note that ΓM αδ ΓC δα is simply the trace of [ΓM ΓC ] and ΓN γβ ΓD βγ is the trace of
[ΓN ΓD ].
ΓA αβ ΓB γδ ΓC δα ΓD βγ = C AB M N Tr[ΓM ΓC ]Tr[ΓN ΓD ]
= C AB M N · 4δ M C · 4δ N D
Thus,
ΓA αβ ΓB γδ ΓC δα ΓD βγ = 16C AB CD
Rearranged, this is
ΓA αβ ΓD βγ ΓB γδ ΓC δα = 16C AB CD
The chain of summed indices are just the trace of the LHS
T r[ΓA ΓD ΓB ΓC ] = 16C AB CD
3.6 (c) With Γ1 = I ,
(4×4)

1
(ū1 Γ1 u2 )(ū3 Γ1 u4 ) = T r[ I ΓD I ΓC ](ū1 ΓC u4 )(ū3 ΓD u2 )
16 (4×4) (4×4)

1 CD
= 4δ (ū1 ΓC u4 )(ū3 ΓD u2 )
16
1
= (ū1 ΓC u4 )(ū3 ΓC u2 )
4
We start with
1
(ū1 γ α u2 )ηαβ (ū3 γ β u4 ) =
ηαβ T r[γ α ΓD γ β ΓC ](ū1 ΓC u4 )(ū3 ΓD u2 )
16
where η = diag(1, −1, −1, −1). There are identities such as
Tr[γ α γ β γ ρ γ σ ] = 4 η αβ η ρσ − η αρ η βσ + η ασ η βρ


but then I would have to consider the case for Γ1 separately from Γ2 · · · Γ5 , Γ6 as well as Γ7 · · · Γ12 ,
etc. . . So, I just got tired of thinking and let Maple do the work:
1
(ū1 γ α u2 )ηαβ (ū3 γ β u4 ) = − (ū1 Γ1 u4 )(ū3 Γ1 u2 ) + (ū1 Γ2 u4 )(ū3 Γ2 u2 )
2
+ (ū1 Γ6 u4 )(ū3 Γ6 u2 )
− (ū1 Γ7 u4 )(ū3 Γ7 u2 ) − (ū1 Γ8 u4 )(ū3 Γ8 u2 )
+ (ū1 Γ9 u4 )(ū3 Γ9 u2 ) − (ū1 Γ10 u4 )(ū3 Γ10 u2 )

+ (ū1 Γ11 u4 )(ū3 Γ11 u2 ) + (ū1 Γ12 u4 )(ū3 Γ12 u2 ) − 2(ū1 Γ13 u4 )(ū3 Γ13 u2 )

You might also like