1. Introduction
When the term
chirality was introduced by Lord Kelvin [
1,
2], visibly, its definition targeted the case of the Euclidean space rather than the one of the spacetime, even in its classical version. Quoting Lord Kelvin:
I call any geometrical figure, or group of points, chiral, and say that it has chirality if its image in a plane mirror, ideally realized, cannot be brought to coincide with itself. This definition, which is still in use today, has a clear merit: it can be easily understood by a vast majority of people. However, it is not suitable for mathematical purposes, since the terms
figure,
ideally realized,
brought and
coincide have only an intuitive meaning.
Later, in order to calculate the wave function of the relativistic electron, Dirac [
3] introduced the matrices
,
(each
matrix has four lines an four columns), in the expression of what is called Dirac equation. In this equation, the unknown is no more a single complex function: it has four complex components, and solving the equation gave four wave functions, two for the electron, with respective spins +1/2 and −1/2, and two for the positron, with respective spins +1/2 and −1/2. The
matrices act on the space of Dirac spinors (also called bi-spinors), these latter having four components. This space must not be confused with the Minkowski spacetime (i.e., the space of special relativity), in which the elements, called 4-vectors, have also four components: three for the space, one for the time.
The set of the four gamma matrices was completed by a fifth one by Eddington [
4], but in fact the author redirected to an older paper from him [
5]. In the literature this fifth matrix was later denoted
, while the four gamma matrices were renumbered
,
. Then, Eddington [
6] used the word
chirality in reference to Kelvin’s term, but without a clear definition. An unambiguous use of the term was done by Watanabe [
7], who cited both Kelvin and the edition of 1949 of Eddington’s book. Watanabe considered
as a
chirality operator, and generalized it so that it can be applied not only to fermions, but also to bosons. This meaning of
seems to have been retained by many authors in the relativistic quantum mechanics literature. However, it was considered that
chirality is a bad name in the context of spinors [
8]. We show that the properties of
are coherent with the definition of chirality of Petitjean [
9,
10], which recovers the one of Lord Kelvin, and which is based on an unifying definition of symmetry [
11].
2. Motivation of the Work
This section is intended to summarize the goal of the current work for readers which are not experts of symmetry in quantum field theory. Chirality is an ubiquitous concept. Its definition, which goes back to 1894, targeted the Euclidean space, and it remains in use today. After the introduction of chirality in quantum field theory, physical requirements lead to retain the spinorial metric for the Dirac field. It led to conclusions about chirality which can be considered to be conflicting. Such conflicts have no physical impact, they are only terminological. The resulting ambiguous use of the chirality concept was propagated in the literature, and it is still part of several advanced physics courses. We exemplify it in the case of Dirac fermions, and we show how a recent general mathematical definition of chirality resolve the ambiguities.
Strictly speaking, we do not solve here a physics problem. Rather, we point out a confusion about symmetry (and thus about chirality), which appeared in the physics literature. Let us look at the following example in the real plane. The rotation of
around the origin is an isometry for the standard metric. Now, we consider the metric
. The rotation of
around the origin is no more an isometry. To see this, consider the distance to the origin from the point
. Before rotation, this distance is 1. After rotation, it is 1 for the standard metric, but it is
for the metric defined above. It means that the set of symmetry operators depends on the metric. And this is exactly the problem we outline further with several operators built as products of the gamma matrices. On one side the metric
is needed for physical reasons (see
Section 6), and on an other side, the distance induced by
is not preserved for all operators generated by the gamma matrices, whichever concrete representation is used for these gamma matrices. And it is the case for the chiral operator
, which can be even considered to be not a symmetry operator for the metric
. Thus we evidence (i) an abuse of language about symmetry (and thus about chirality), and (ii) we attract the attention of the readers about the risk of erroneous claims about symmetries. Our results hereafter lead to a by-product: we show that the main properties of the gamma matrices can be derived only from their group properties. In other words, we did not need the artillery of Clifford algebras: thus, fewer assumptions means stronger results. Our results apply to higher dimensional gamma matrices, and whichever concrete representation they have. The next section contains the proofs of several results issued from the group structure attached to gamma matrices.
3. Gamma Groups
We consider an abstract set , endowed with a binary operation, i.e., a function: , where p and q are two non-negative integers. We call this operation multiplication, and since there is no ambiguity we do not need to denote it by a symbol. The generators of are an element denoted and the elements of a set . These n elements are denoted , where is an index taking values in a finite set of n integers. Thus has generators. We assume that they are distinct. The rules defining the multiplication table of are as follows.
(R1) The multiplication is associative.
(R2) commutes with all elements of .
(R3) The neutral element of is and we denote it also .
Conventionally, any element of elevated at power 0 is equal to .
(R4) , either or .
According to increasing values of , the p first of these squares take the value , , and the q remaining ones take the value .
(R5) , , , .
We call this rule anticommutation.
Definition 1. is called a gamma group.
The group structure of is proved in Theorem 2.
We define the following subset of : .
Definition 2. Let x be an element of, written as follows. The expression of x can contain a heading element taken in. If it is, it must be alone. If it is not, either the heading term is lacking and a trailing term must exist, or the heading term is a single element of, followed or not by a trailing term. This trailing term is either a single element ofor a product of elements ofsorted in strictly increasing order of their indices in.
We call canonical such an expression of x.
When there are at least two elements in the trailing term, and they are sorted in strictly decreasing order of their indices in, we call the expression of x anticanonical.
Lemma 1. Any element ofcan be expressed in canonical form.
Proof. All generators of commute or anticommute. Consider an element x of expressed as a product of powers of elements of . Using rule (R2) for this product, we can shift together in a heading term all powers of , the trailing term being a product of powers of elements of . Using the anticommutation rule, we reorder the elements of the trailing term according to non-decreasing values of their indices in . From rule (R4), the even powers of elements of reduce to powers of , which we can shift in the heading term, and the odd powers of elements of reduce to the elements of themselves, ordered in increasing values of their indices in , while the elements appeared due to reordering are shifted from the trailing term to the heading term. The heading term reduces to one element of . It is either alone or followed by a product of elements of , ordered in increasing values of their indices in . When the heading term is it can be removed unless the ordered product of elements of is void. □
Theorem 1. Let x be the product of k distinct elements of,, the product being not necessarily sorted in canonical order. The product and its expression in reversed order differ from a factor.
Proof. The reversed expression of x can be generated through anticommutations of the k elements of . Each of these anticommutations generates one factor . □
Corollary 1. Let x be any element of, containing k elements ofin its canonical expression,. The anticanonical expression of x and its canonical one differ from a factor.
Proof. The corollary stands when . When , commute the headers and apply Theorem 1. □
Lemma 2. Any elementsatisfies to. The elements x andare inverses.
Proof. We put x in canonical form. When existing, we call y the product of the elements of in the canonical expression of x. We try to express in canonical form. When existing, the heading term in x appears four times in , thus its fourth power is . We put it as a heading term of . The trailing term of is . Let k be the number of elements of in the expression of y, . If the Lemma is proved. If , from rule (R4) the fourth power of an element of is , then the Lemma is proved. If , we decompose . In each square , the term y on the left is reordered in decreasing values of the indices of its elements of . From the anticommutation rule, appears times in each of the two terms , so that , and the neutral element can be put in the heading term of . Now, we write each of the two squares as a product of elements of in increasing values of their indices followed by the same product in the reversed order of their indices, together with terms due to the anticommutations. Applying k times rule (R4) in , these two products taken together reduce to a power of . But there are two squares in , and the square of a power of is again the neutral element, thus completing the proof. □
Theorem 2. is a finite group. It contains at mostelements.
Proof. From Lemma 1, any element of can be written as a product of at most terms, so is a finite set. In canonical form, either the heading term is alone, or it is one of the other three elements of , followed by possible products of elements of , or the heading term is lacking in which case there are possible non empty products of elements of . Total of possible canonical expressions: . From Lemma 2, any element x of has indeed an inverse, which is . It completes the proof that is a finite group. □
Corollary 2. The cyclic groupis a normal subgroup of.
Proof. From rule (R3), is obviously a cyclic group, and it is isomorphic to . Let h be an element of , g an element of , and consider the product . h commutes with all elements of , thus and y is in . □
Theorem 3. Except the neutral element and, no element of, written in its canonical expression, can be expressed as a square of an other element of, written in its canonical expression or not.
Proof. Consider an element x of containing in its canonical expression at least one element of , and written as the square of some element y of , i.e., . We try to express in canonical form. Using rule (R2) we can shift together in a heading term all powers of the elements of . Using the anticommutation rule, we can reorder in the trailing term the elements of ; thus each of these latter occurs twice or an even number of times in . In the trailing term it remains only powers of (due to reordering), and powers of or of , due to rule (R4). We shift all powers of in the heading term, which reduces to one element of , and there is no more element of in the canonical expression of , a contradiction. The result still works in the case where x is reduced to its heading element. □
Theorem 4. Let x and y be two elements of. Their canonical expressions contain respectivelyandelements of, and they have k of them in common. The productsandare such that.
Proof. The headers of and always commute. Then, observe that commuting successively each element of in the trailing term of either or of , needs anticommutations, minus k of them which are common to and . □
Definition 3. We defineas the non empty product of all n distinct elements of, the product being sorted in increasing values of the indices inof these n elements.
Corollary 3. Let y be any given element of. The productcommutes withwhen n is odd, andanticommutes withwhen n is even.
Proof. From Theorem 4, . □
Theorem 5. Lethaving m factors in its canonical expression, r of them squaring to,..
Proof. We assume first that z is canonically expressed as the product of m elements of , , without a heading term. We apply Theorem 1 to write with the product of its expression by its reversed one, then we replace each square of the m elements of by its value defined in rule (R4). .
Assuming now that the header of the canonical expression of z is not empty, it can be checked that the result stands again, and it still works in the case where z is reduced to its header. □
Corollary 4. .
Proof. Set and in Theorem 5. □
4. Comments on Gamma Groups
We did not enumerate the words of
because additional assumptions are needed to define its full multiplication table. However these additional assumptions are not required to establish the results of
Section 5. We show further that these results make sense for Dirac algebra. We intentionnally denoted the elements of
similarly to the contravariant notation of gamma matrices as used by most quantum physicists, so that it helps the reader to understand why gamma groups are relevant. The results of
Section 3 are based only on the group properties of
. We did not define an addition operator, nor its neutral element
zero, nor the minus sign, which usually denotes an inverse in the group defined by the addition. We did not define a set of scalars nor the product of an element of
by a scalar. However, we outline that the anticommutation is a cornerstone both for gamma groups and Clifford algebras.
While it seems unusual to build a group including the powers of
together with the gamma matrices, a similar approach exists in the case of the Pauli group [
12]. This latter is generated by a set of three
matrices
, which were introduced by Pauli [
13]. Denoting by
i the pure imaginary complex number of square
, the Pauli matrices are:
We define and , which is the identity matrix. Then we observe that generates a group , whereas the Pauli group has only 3 generators. The Pauli group is unambigously defined. However, whether or not it is a representation of cannot be decided without more assumptions about .
As shown in
Section 6, Theorem 3 is the key one to see whether or not the concept of chirality introduced for Dirac fermions is coherent with the more general definition of chirality in [
10]. This latter is based on the direct vs. indirect classification of isometries, i.e., direct isometries can be written as a product of squared isometries, while indirect isometries cannot. This classification was introduced in classical mechanics [
14] and in special relativity [
15], but it was unknown in the literature on relativistic quantum physics. We show in
Section 6 that it can be done with the help of Theorem 3 for several operators of interest, including
P (parity inversion) and
T (time reversal). Before that we need to exhibit more properties of gamma matrices.
5. Gamma Matrices and Dirac Spinors
Dirac spinors are defined in the context of special relativity, the
metric tensor of the Minkowski spacetime is diagonal, and there are
gamma matrices: one associated to the time component and three associated to the spatial components. According to [
16], the Dirac matrices are a set of
irreducible matrices of complex elements, which satisfy to anticommutation rules (the size
of the gamma matrices is related to algebraic considerations, not to the dimensionality of the spacetime). The squares of the four gamma matrices are equal either to the identity matrix or to its opposite, depending on the diagonal elements of the metric tensor. We retain (+,-,-,-) for the signature of the metric tensor, which corresponds to
, because it is an usual choice in special relativity. We set
, as it is usual in most textbooks dealing with gamma matrices. The set of the four gamma matrices is
. We denote by
the
identity matrix and we define the matrix
. Thus,
,
,
, and
.
Theorem 6. The setgenerates a gamma groupfor the matrix multiplication.
Proof. Consider the gamma matrices and write their squares and their anticommutations properties, respectively as in rule (R4) and (R5) in
Section 3. The rest of the proof is obvious. □
Theorem 6 does not specify which basis is used to write the concrete expressions of the elements of
. An instance of this group, containing 64 elements (see Theorem 2), was mentioned by Salingaros [
17] in the case of the
E-symbols of Eddington [
4].
There are three usual basis of gamma matrices mentioned in the literature: Dirac, Weyl, and Majorana (original papers: see [
3,
18,
19,
20]; see [
21] for a summary). Their respective expressions are explicited in function of Pauli matrices in Equations (
2)–(
4). These sets of gamma matrices are frequently used in the literature (e.g., see [
22,
23,
24,
25,
26,
27,
28,
29,
30]).
Given any set of gamma matrices, it is always possible to build other ones: each set is related to another by a similarity transformation, i.e.,
s being an arbitrary invertible matrix, each gamma matrix
becomes
,
[
22]. Given two irreducible sets of gamma matrices, this similarity matrix is unique, except for an arbitrary multiplicative factor [
31]. Examples of
s matrices are any of the gamma matrices (it generates a change of the sign of the other gamma matrices), or permutation matrices, etc. When existing, the Hermiticity property is not ensured after this transormation, except when
S is unitary [
21].
Hermiticity and unitary properties are related through Theorem 7. We denote by a dagger the conjugate transpose.
Theorem 7. The following four propositions are equivalent:
- (a)
The gamma matrices are either Hermitian or anti-Hermitian.
- (b)
The gamma matrices are either unitary or anti-unitary.
- (c)
All elements ofare either Hermitian or anti-Hermitian.
- (d)
All elements ofare either unitary or anti-unitary.
Proof. Obviously (c) ⇒ (a) and (d) ⇒ (b).
Assume that (a) stands and notice that is anti-Hermitian and commutes with all elements of . Then, consider an element , write its canonical expression, and use the anticommutation rules to see that x is either Hermitian or anti-Hermitian.
Thus, (a) ⇒ (c).
Similarly, assume that (b) stands and notice that is unitary and commutes with all elements of . Then, consider an element , write its canonical expression, expand the product and use the anticommutation rules to see that either or , and proceed similarly for .
Thus, (b) ⇒ (d).
Assume that (a) stands and consider an element . Compute , and see that either or .
Thus (a) ⇒ (b).
Assume that (b) stands and consider an element . From (b), see that either or , then use Lemma 2 to deduce the value of and conclude to the Hermiticity or anti-Hermiticity of .
Thus (b) ⇒ (a). □
Theorem 8. We consider an elementand we assume that at least one of the four propositions of Theorem 7 stands. Either (a), or (b).
(a) ⇒ (a1) and (a2). (a1) z Hermitian ⇔z unitary. (a2) z anti-Hermitian ⇔z anti-unitary.
(b) ⇒ (b1) and (b2). (b1) z Hermitian ⇔z is anti-unitary. (b2) z anti-Hermitian ⇔z unitary.
Proof. is either equal to or to : see Theorem 5.
Case (a): if then , and if then (see Lemma 2); if then , and if then .
Case (b): if then , and if then ; if then , and if then . □
Remark 1. The signature of the metric was not useful to establish the proofs of Theorems 7 and 8: these latter can be extended to higher dimensional gamma matrices.
Assuming that the gamma matrices are either Hermitian or anti-Hermitian is required for physical applications [
22]. This assumption is necessary due to the Hermiticity of the Hamiltonian in Dirac equation. In quantum mechanics, the Hamiltonian is Hermitian because the energy has to be real. It is why Assumption 1 is needed [
32,
33]:
Assumption 1. is Hermitian.,andare anti-Hermitian.
We consider that Assumption 1 is valid further in the text. It ensures that Theorems 7 and 8 apply.
Corollary 5. All elements ofare unitary.
Proof. The generator is unitary. Apply Theorem 8 to see that the gamma matrices of are unitary. Then consider any product of the generators of and proceed recursively. □
6. Symmetry Operators; Isometries
First, we outline that in our present approach, the gamma groups include the generator
, although in the literature it was used the product of gamma matrices by the scalar
i (see [
22,
23]), thus requiring to define an operation differing from the group one. Let
be the space of Dirac spinors. The group
acts on
. In order to identify the symmetry operators of
, we need to see if the action of
preserves some distance in
, i.e., we need a spinorial metric
M. We denote by
the inner product over
relative to
M, and we denote by a dagger the conjugate transpose. The bilinear form between two spinors
and
is:
The standard inner product is inadequate because the bilinear
is not Lorentz covariant. From physical considerations (invariant length and current density), Crawford outlined the need of normalizing the bilinear forms defining the spinorial metrics [
34,
35,
36]. He built metrics between Dirac spinors and their generalization in higher dimensional spaces [
35,
36,
37]. We retain the metric
in Equation (
5) because it was shown that
M generates bilinears satisfying to Lorentz invariance for length and current density [
25,
34,
35,
36,
38,
39,
40,
41,
42].
The operator
is sometimes called the Dirac adjoint of
(see [
25,
40,
42,
43]).
M is Hermitian and unitary (see Theorem 8). It was noticed that we can always choose a basis of gamma matrices so that
M is diagonal [
34,
36] (this is the case in the Dirac basis: see Equation (
2)), but there is no particular reason to retain the Dirac basis to ensure Lorentz covariance of the bilinears built from
M. The required properties of the metric is that it is Hermitian and that it render the gamma matrices self-adjoint [
37].
Strictly speaking,
M is not a true metric because it is not positive definite. This constraint is inherent to special relativity. The same constraint exists in the case of the Minkowski metric, for which isometries preserve inter-event intervals. It does not preclude the analysis of symmetries in terms of direct and indirect symmetries [
15].
Theorem 9. (a)is the subgroup ofcontaining the elements ofcommuting with.
(b) This subgroup is the group of symmetry operators acting on, which preserves the distance induced by the metric.
Proof. (a) Consider two elements x and y of which commute with . Obviously commutes also with and thus is a subgroup of .
(b) We consider an element , and we look at the bilinear . The distance induced by M is preserved when . This occurs under the condition that either z commutes with and is unitary or z anticommutes with and is anti-unitary. We know that z is always unitary (see Corollary 5), thus the condition reduces to the commutation of z with . If this condition is not satisfied, the sign of the bilinear is changed. □
7. Direct and Indirect Symmetry; Chirality
We can enumerate the 32 elements of
with the help of Theorem 9. We define:
contains 8 elements. We define also
, which contains the eight products by
of the elements of
. Similarly, we define
, which contains the eight products by
of the elements of
, and we define
, which contains the eight products by
of the elements of
.
Theorem 10. Except the neutral element and, the elements ofare indirect symmetry operators.
Proof. Apply Theorem 3. It is in agreement with the general definition of indirect symmetry in [
10], which states that a symmetry operator is direct if and only if it can be expressed as a product of squared isometries. □
The difference between the action on of and the action of either or or , is just due to a normalizing factor of the spinors, which, in scalar notation, is either i or or . So, this difference is meaningless in the context of symmetry operators. That could explain why some authors retain for symmetry operators expressions differing by a multiplicative factor such as i or or .
Parity inversion is defined by
(see [
21,
28,
44,
45,
46,
47]), or by
(see [
46]). In both cases,
, so
P is a mirror (as defined in [
10]: a mirror is an indirect symmetry which is an involution). Time reversal is defined by
(see [
21,
28,
44,
45]), the factor
being arbitrary [
45]. When
is part of the expression of
T,
, and
T is a mirror. Whichever of the expressions of
P and
T are retained, the product
commutes (see Theorem 4), and
is an indirect symmetry operator. When
is part of the expression of
T,
, so
is a mirror: this is in agreement with [
15], and
is sometimes called a
full reflection [
48].
Charge conjugation is defined by
(see [
49]) or
(see [
40,
45,
50]), or by
(see [
28,
51]) or
(see [
44]), or by
(see [
21]). It was even set
in Majorana basis [
51]. Apart the latter, whichever of these expressions is retained,
C is not considered to be a symmetry operator for the metric
, and the same conclusion apply to
,
and
. This may be seen as an unusual conclusion, but it was noticed that, in contrast with
P and
T,
C is not a spacetime discrete symmetry, and that its nature is strongly different from other discrete symmetries [
48].
The
chiral operator, denoted by
(or
in old papers), appears many times in the literature. It is defined by
, i.e.,
(see [
21,
27,
30,
40,
44,
46,
47,
49,
50,
51,
52,
53,
54]), or by
(see [
33,
54,
55]). From Corollary 3,
anticommutes with any of the other gamma matrices, and from Corollary 4,
. From Assumption 1, it can be deduced that
is Hermitian. It appears that
is not considered to be a symmetry operator for the metric
. This seemingly shocking conclusion about
, which is representation independent, can be easily explained.
First, the name
chiral operator is due to the following facts.
is splitted into two operators, which are, in matrix notation,
and
. In Weyl basis (Equation (
3)), each of these two operators projects the spinor
respectively on its so-called
right-handed part
and
left-handed part
, i.e.,
and
are the eigenvectors of
, with respective eigenvalues
and
(Equations (
7)–(
9)), whence the names
right-handed and
left-handed and whence the name
chiral operator, and whence the name of
chiral basis for the Weyl basis.
Now, the story becomes clear: the transformation of
into its opposite while
is unchanged was attributed in 1946 to a chiral property, in Kelvin’s sense [
6], then this terminology was propagated in the quantum field literature. But a change of sign does not suffice to conclude to chirality, because a symmetry operator must be defined relatively to a space and a metric. Here, the trouble comes from that
is a symmetry operator when defined from the metric induced by the standard inner product (in which case it would be a mirror, as a consequence of Theorem 3, and because
), but it is no more a symmetry operator for the quadratic form induced by the spinorial metric
.
However, if we relax the sign preservation condition for this quadratic form (see part (b) of Theorem 9 and its proof), then all elements of are symmetry operators, and is a mirror (it is a consequence of Thorem 3). Strictly speaking, a symmetry operator should be distance preserving, or, when the metric is not positive definite, it should preserve the value of the quadratic form induced by the metric. Due to the customs in quantum field theory, the change of sign of the quadratic form induced by upon the action of is ignored, and is called a chiral operator in the literature. Thus it can be considered that there is an abuse of language about chirality.
The metric
was shown to be relevant several decades after 1946 (at least, in 1990 [
34]). It is not the first time that an ambiguity about the metric induced opposite conclusions: a controversy happened in classical mechanics about rotating molecules, which was recently solved [
14]. In fact, it even happened that chirality needed to be clarified in the Euclidean case [
56]. Our own conclusion is that the chirality concept cannot be clearly understood as long as ambiguities remain in its use.