Thu, 15/12/2011 - 04:07 — root

## Incomplete proof

## Complete proof

There are plenty of cases where a proof written down by a physicist is worse than a proof written down by a mathematician, but this is a particularly bad one. In one of my courses, we got to derive the Dirac matrices, which are instrumental in describing spin 1/2 particles. These four matrices are written as with an index. One definition of them says that they should satisfy the anti-commutation relations of the Clifford algebra:

where is the Minkowski metric from special relativity.

How big do our matrices have to be in order to satisfy this? They obviously cannot be 1x1 matrices because these are just numbers that commute. It turns out that they have to be at least 4x4 but all published sources I have seen fail at explaining why. I will go through the physics proof that is often given and then set the record straight by writing a real proof. If it appears nowhere else, let it appear here!

I will depart from the convention of calling the matrices and . For some reason I like and better. The relations above basically say that:

and distinct Dirac matrices anti-commute. If we look at the equation and take the determinant of both sides, we get: . If something is equal to times itself, must be even. This rules out 3x3 Dirac matrices and the question becomes *why can't we represent the Clifford algebra with 2x2 matrices?*. Most physics textbooks seem to be okay with this part of the proof.

Some people say that the largest possible set of anti-commuting 2x2 matrices has only three elements. Is this supposed to be easy to show? Is the maximal anti-commuting set known for matrices of any size? There is a paper about that from 1932. It is 11 pages and only proves the 4x4 case so I highly doubt it. Anyway, here is how other sources proceed to "prove" this result:

We know that the three Pauli matrices anti-commute so let three of our Dirac matrices be Pauli matrices. Also, if we take the three Pauli matrices and adjoin the identity, we get a basis for the vector space of 2x2 matrices. Therefore our fourth Dirac matrix must be expressed as:

Since the Pauli matrices anti-commute, the product of distinct Pauli matrices will be traceless (as is a single Pauli matrix). The trace of a squared Pauli matrix is 2. Therefore by linearity, . However, also has to anti-commute with meaning that should be traceless. This forces and to all be zero meaning is the identity. The identity commutes with every matrix so the fourth matrix we set out to find doesn't exist.

This works if you restrict yourself to a ridiculously special case but who ever said that three of the four anti-commuting matrices should be Pauli matrices? Maybe if you start off with a different set of three anti-commuting matrices there suddenly will be room for a fourth. The proof above would only be complete if it cited some theorem that this never happens. Since I am not aware of such a theorem, I will split our search into two cases and show that in each case we can only find three matrices with the desired properties, not four.

Notice that the equations defining our Dirac matrices are invariant under similarity transformations. If is an invertible matrix,

so without loss of generality, we can assume that is in Jordan canonical form. Case 1: assume that is diagonalizable. You get the identity by squaring so the diagonal entries in it can only be . If both diagonal entries had the same sign, we would be left with a matrix that commutes with everything. Therefore in this case, . Denote the components of by and . The fact that anti-commutes with says that:

In other words, being diagonal forces the spatial Dirac matrices to be anti-diagonal. Now we will let have the entry in the upper right and in the lower left. If these matrices all anti-commute, the equations that this gives us are:

where the last equation comes from squaring the spatial Dirac matrices. Multiply the first equation by . This gives . If we substitute this into the second equation we get . Now substituting this into the third equation, comes out to , contradicting the last equation. Therefore starting with a diagonal leads to a contradiction.

Case 2: if is not diagonalizable, its Jordan form is:

However, the square of this matrix has in an off-diagonal entry. We know is diagonal so it is necessary to have but this is not sufficient to give us . The square of the above matrix with will be the zero matrix, not the identity. Therefore this 2x2 Dirac matrix assumption is a contradiction too and we must use matrices that are 4x4 or larger.

This completes the proof without automatically assuming that everything is a Pauli matrix. It is worth noting however that the Dirac matrices can be expressed quite nicely in terms of the Pauli matrices. It is easy to check that the following expressions satisfy the Clifford algebra relations:

This close resemblance explains why I want to treat the Dirac and Pauli matrices symmetrically. I learned about the Pauli matrices first which were subscripted using x, y, z instead of 1, 2, 3. This is why I reject the idea of using numbers instead of letters on the Dirac matrices. I also refuse to call them "gamma matrices" because no one ever used "sigma matrix" to refer to a Pauli matrix. No I will not dare to compare myself to Dirac even though he used his own "symmetry conventions" to decide on terminology. Oh wait, I just did.

## Comments

## Nice blog Connor!

Nice blog Connor!

## Thanks!

As far as I know, you're the second person to discover it.

## Thanks.

Nice proof, helped a lot

## There is a short proof that

There is a short proof that the largest set of

nonsingularanticommuting 2x2 matrices has three elements. First show that any anticommuting matrix is traceless:(* = inverse)

tr(A) = tr(ABB*) = -tr(BAB*) = -tr(AB*B) = -tr(A)

therefore tr(A) = 0

Then show that any set of anticommuting nonsingular matrices is linearly independent. You can do this inductively.

({} = anticommutator)

Suppose set(A1 ... An) is linearly independent and mutually anticommuting. Then try to add a linearly

dependentanticommuting elementM = a1A1 + ... + anAn.

But {M,A1} = a1A1^2 = 0 so a1 = 0, similarly a2 ... an = 0 so M is singular, a contradiction.

Now since the largest subspace of traceless 2x2 matrices is 3-dimensional, there can be at most three anticommuting 2x2 nonsingular matrices.

## There is a short proof that

There is a short proof that the largest set of

nonsingularanticommuting 2x2 matrices has three elements. First show that any anticommuting matrix is traceless:(* = inverse)

tr(A) = tr(ABB*) = -tr(BAB*) = -tr(AB*B) = -tr(A)

therefore tr(A) = 0

Then show that any set of anticommuting nonsingular matrices is linearly independent. You can do this inductively.

({} = anticommutator)

Suppose set(A1 ... An) is linearly independent and mutually anticommuting. Then try to add a linearly

dependentanticommuting elementM = a1A1 + ... + anAn.

But {M,A1} = a1A1^2 = 0 so a1 = 0, similarly a2 ... an = 0 so M is singular, a contradiction.

Now since the largest subspace of traceless 2x2 matrices is 3-dimensional, there can be at most three anticommuting 2x2 nonsingular matrices.

## Post new comment