Proving an Identity Involving Gamma Matrices

AI Thread Summary
The discussion revolves around proving the identity involving gamma matrices: tr(γ^μ γ^ν γ^ρ γ^σ) = 4(η^μν η^ρσ - η^μρ η^νσ + η^μσ η^νρ). Participants highlight the importance of understanding the properties of gamma matrices and their anticommutation relations to simplify products. Key points include the ability to reduce products to forms where each gamma matrix appears only once, and the trace of products yielding values of +4, 0, or -4 based on the number of gamma matrices involved. A request for examples to clarify the proof process indicates a need for practical application of these theoretical principles. The conversation emphasizes foundational knowledge in Clifford algebras and gamma matrix properties for successful derivation.
Kalimaa23
Messages
277
Reaction score
1
Greetings,

I've been asked to prove the following identity

tr(\gamma^{\mu} \gamma^{\nu} \gamma^{\rho} \gamma^{\sigma}) = 4 (\eta ^{\mu \nu} \eta ^{\rho \sigma} - \eta ^{\mu \rho} \eta ^{\nu \sigma} + \eta ^{\mu \sigma} \eta ^{\nu \rho})

I know that

tr(\gamma^{\mu} \gamma^{\nu}) = 4 \eta^{\mu \nu}

which means I would expect something of the form

tr(\gamma^{\mu} \gamma^{\nu} \gamma^{\rho} \gamma^{\sigma}) = 4 \eta^{\mu \nu} \eta^{\rho \sigma}

Any suggestions?
 
Physics news on Phys.org
This is standard stuff.It's in every book.

Trace\left(\gamma^{\mu}\gamma^{\nu}\gamma^{\rho}\gamma^{\sigma}\right)=Trace\left[\left(2\eta^{\mu\nu}-\gamma^{\nu}\gamma^{\nu}\right)\gamma^{\rho}\gamma^{\sigma}\right]=8\eta^{\mu\nu}\eta^{\rho\sigma}-Trace\left[\gamma^{\nu}\left(2\eta^{\mu\rho}-\gamma^{\rho}\gamma^{\mu}\right)\gamma^{\sigma}\right] =...

I hope u can carry on.

Daniel.
 
Dear Dimitri;

Re tr(\gamma^{\mu} \gamma^{\nu} \gamma^{\rho} \gamma^{\sigma}) = 4 (\eta ^{\mu \nu} \eta ^{\rho \sigma} - \eta ^{\mu \rho} \eta ^{\nu \sigma} + \eta ^{\mu \sigma} \eta ^{\nu \rho})

While it's possible to solve this problem without understanding a damned thing about what you did, it is also possible to learn something about gamma matrices and Clifford algebras.

Here are some useful facts about gamma matrices that will allow the above calculation to be made without pain:

(1) Given any product of gamma matrices, it is possible to get it into a form where each different gamma matrix appears only once or not at all. You do this by anticommutation, with each anticommutation bringing out a factor of -1 to multiply the product. If you have more than one gamma matrix of a given type, then you can cancel it in pairs, with the squares of spatial gamma matrices giving +1 and the square of the temporal gamma matrix giving -1, unless you are on the opposite coast signature.

(2) There are therefore 16 possible products of gamma matrices, i.e.
2\times 2\times 2 \times 2, where the nth 2 determines whether or not the nth gamma matrix is present or not. Of these sixteen gamma matrix products (which some call bilinear forms), only one has a nonzero trace, and that is the unity matrix, \hat{1}, which of course has trace 4.

(3) Therefore, the only possible answers you can get for your trace problem is +4, 0 or -4.

(4) You will only get 4 or -4 if the product includes each gamma matrix an even number of times, so that the product reduces to \pm \hat{1}. In all other cases, the product will be nonzero, but your trace will be zero.

(5) To determine whether you get +4 or -4, you need to count the number of times you have to anticommute, and the number of times you end up with a factor of -1 from squaring a gamma matrix.

I hope that this was not too simple to be useful to you. It is stuff that I was not really aware of when I was a grad student.

Anyway, using the above comments you may be able to derive your equation without having to make use of anything that is not completely obvious in and of itself.

Carl

By the way, a Clifford algebra may be thought of as starting with a given number of generalized gamma matrices (more or less than the usual 4), with the usual anticommutation rules and with each of these squaring to either 1 or -1.
 
CarlB said:
(1) Given any product of gamma matrices, it is possible to get it into a form where each different gamma matrix appears only once or not at all. You do this by anticommutation, with each anticommutation bringing out a factor of -1 to multiply the product. If you have more than one gamma matrix of a given type, then you can cancel it in pairs, with the squares of spatial gamma matrices giving +1 and the square of the temporal gamma matrix giving -1, unless you are on the opposite coast signature.

Carl

Hi guys,

i know this is a very old topic...so, sorry to reactivate it. But i would like to know if there is an example somewhere to prove this statement. I tried to write down the product of three different gamma matrices in this way, but i can't bring it into a form where each gamma matrix appears only once or not at all. So, i'd welcome some illumination on this :)

Cheers,
earth2
 
I multiplied the values first without the error limit. Got 19.38. rounded it off to 2 significant figures since the given data has 2 significant figures. So = 19. For error I used the above formula. It comes out about 1.48. Now my question is. Should I write the answer as 19±1.5 (rounding 1.48 to 2 significant figures) OR should I write it as 19±1. So in short, should the error have same number of significant figures as the mean value or should it have the same number of decimal places as...
Thread 'A cylinder connected to a hanging mass'
Let's declare that for the cylinder, mass = M = 10 kg Radius = R = 4 m For the wall and the floor, Friction coeff = ##\mu## = 0.5 For the hanging mass, mass = m = 11 kg First, we divide the force according to their respective plane (x and y thing, correct me if I'm wrong) and according to which, cylinder or the hanging mass, they're working on. Force on the hanging mass $$mg - T = ma$$ Force(Cylinder) on y $$N_f + f_w - Mg = 0$$ Force(Cylinder) on x $$T + f_f - N_w = Ma$$ There's also...

Similar threads

Replies
2
Views
987
Replies
6
Views
2K
Replies
2
Views
1K
Replies
7
Views
2K
Back
Top