3 * Implementation of GiNaC's clifford algebra (Dirac gamma) objects. */
6 * GiNaC Copyright (C) 1999-2003 Johannes Gutenberg University Mainz, Germany
8 * This program is free software; you can redistribute it and/or modify
9 * it under the terms of the GNU General Public License as published by
10 * the Free Software Foundation; either version 2 of the License, or
11 * (at your option) any later version.
13 * This program is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * GNU General Public License for more details.
18 * You should have received a copy of the GNU General Public License
19 * along with this program; if not, write to the Free Software
20 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
31 #include "numeric.h" // for I
34 #include "relational.h"
42 GINAC_IMPLEMENT_REGISTERED_CLASS(clifford, indexed)
43 GINAC_IMPLEMENT_REGISTERED_CLASS(diracone, tensor)
44 GINAC_IMPLEMENT_REGISTERED_CLASS(diracgamma, tensor)
45 GINAC_IMPLEMENT_REGISTERED_CLASS(diracgamma5, tensor)
46 GINAC_IMPLEMENT_REGISTERED_CLASS(diracgammaL, tensor)
47 GINAC_IMPLEMENT_REGISTERED_CLASS(diracgammaR, tensor)
50 // default ctor, dtor, copy ctor, assignment operator and helpers
53 clifford::clifford() : representation_label(0)
55 tinfo_key = TINFO_clifford;
58 void clifford::copy(const clifford & other)
60 inherited::copy(other);
61 representation_label = other.representation_label;
64 DEFAULT_DESTROY(clifford)
65 DEFAULT_CTORS(diracone)
66 DEFAULT_CTORS(diracgamma)
67 DEFAULT_CTORS(diracgamma5)
68 DEFAULT_CTORS(diracgammaL)
69 DEFAULT_CTORS(diracgammaR)
75 /** Construct object without any indices. This constructor is for internal
76 * use only. Use the dirac_ONE() function instead.
78 clifford::clifford(const ex & b, unsigned char rl) : inherited(b), representation_label(rl)
80 tinfo_key = TINFO_clifford;
83 /** Construct object with one Lorentz index. This constructor is for internal
84 * use only. Use the dirac_gamma() function instead.
86 clifford::clifford(const ex & b, const ex & mu, unsigned char rl) : inherited(b, mu), representation_label(rl)
88 GINAC_ASSERT(is_a<varidx>(mu));
89 tinfo_key = TINFO_clifford;
92 clifford::clifford(unsigned char rl, const exvector & v, bool discardable) : inherited(sy_none(), v, discardable), representation_label(rl)
94 tinfo_key = TINFO_clifford;
97 clifford::clifford(unsigned char rl, exvector * vp) : inherited(sy_none(), vp), representation_label(rl)
99 tinfo_key = TINFO_clifford;
106 clifford::clifford(const archive_node &n, const lst &sym_lst) : inherited(n, sym_lst)
109 n.find_unsigned("label", rl);
110 representation_label = rl;
113 void clifford::archive(archive_node &n) const
115 inherited::archive(n);
116 n.add_unsigned("label", representation_label);
119 DEFAULT_UNARCHIVE(clifford)
120 DEFAULT_ARCHIVING(diracone)
121 DEFAULT_ARCHIVING(diracgamma)
122 DEFAULT_ARCHIVING(diracgamma5)
123 DEFAULT_ARCHIVING(diracgammaL)
124 DEFAULT_ARCHIVING(diracgammaR)
127 // functions overriding virtual functions from base classes
130 int clifford::compare_same_type(const basic & other) const
132 GINAC_ASSERT(is_a<clifford>(other));
133 const clifford &o = static_cast<const clifford &>(other);
135 if (representation_label != o.representation_label) {
136 // different representation label
137 return representation_label < o.representation_label ? -1 : 1;
140 return inherited::compare_same_type(other);
143 bool clifford::match_same_type(const basic & other) const
145 GINAC_ASSERT(is_a<clifford>(other));
146 const clifford &o = static_cast<const clifford &>(other);
148 return representation_label == o.representation_label;
151 void clifford::print(const print_context & c, unsigned level) const
153 if (!is_a<diracgamma5>(seq[0]) && !is_a<diracgammaL>(seq[0]) &&
154 !is_a<diracgammaR>(seq[0]) && !is_a<diracgamma>(seq[0]) &&
155 !is_a<diracone>(seq[0])) {
157 // dirac_slash() object is printed differently
158 if (is_a<print_tree>(c))
159 inherited::print(c, level);
160 else if (is_a<print_latex>(c)) {
162 seq[0].print(c, level);
163 c.s << "\\hspace{-1.0ex}/}";
165 seq[0].print(c, level);
170 inherited::print(c, level);
173 DEFAULT_COMPARE(diracone)
174 DEFAULT_COMPARE(diracgamma)
175 DEFAULT_COMPARE(diracgamma5)
176 DEFAULT_COMPARE(diracgammaL)
177 DEFAULT_COMPARE(diracgammaR)
179 DEFAULT_PRINT_LATEX(diracone, "ONE", "\\mathbb{1}")
180 DEFAULT_PRINT_LATEX(diracgamma, "gamma", "\\gamma")
181 DEFAULT_PRINT_LATEX(diracgamma5, "gamma5", "{\\gamma^5}")
182 DEFAULT_PRINT_LATEX(diracgammaL, "gammaL", "{\\gamma_L}")
183 DEFAULT_PRINT_LATEX(diracgammaR, "gammaR", "{\\gamma_R}")
185 /** This function decomposes gamma~mu -> (1, mu) and a\ -> (a.ix, ix) */
186 static void base_and_index(const ex & c, ex & b, ex & i)
188 GINAC_ASSERT(is_a<clifford>(c));
189 GINAC_ASSERT(c.nops() == 2);
191 if (is_a<diracgamma>(c.op(0))) { // proper dirac gamma object
194 } else if (is_a<diracgamma5>(c.op(0)) || is_a<diracgammaL>(c.op(0)) || is_a<diracgammaR>(c.op(0))) { // gamma5/L/R
197 } else { // slash object, generate new dummy index
198 varidx ix((new symbol)->setflag(status_flags::dynallocated), ex_to<idx>(c.op(1)).get_dim());
199 b = indexed(c.op(0), ix.toggle_variance());
204 /** Contraction of a gamma matrix with something else. */
205 bool diracgamma::contract_with(exvector::iterator self, exvector::iterator other, exvector & v) const
207 GINAC_ASSERT(is_a<clifford>(*self));
208 GINAC_ASSERT(is_a<indexed>(*other));
209 GINAC_ASSERT(is_a<diracgamma>(self->op(0)));
210 unsigned char rl = ex_to<clifford>(*self).get_representation_label();
211 ex dim = ex_to<idx>(self->op(1)).get_dim();
213 if (other->nops() > 1)
214 dim = minimal_dim(dim, ex_to<idx>(self->op(1)).get_dim());
215 if (is_a<clifford>(*other)) {
217 // Contraction only makes sense if the represenation labels are equal
218 if (ex_to<clifford>(*other).get_representation_label() != rl)
221 // gamma~mu gamma.mu = dim ONE
222 if (other - self == 1) {
224 *other = dirac_ONE(rl);
227 // gamma~mu gamma~alpha gamma.mu = (2-dim) gamma~alpha
228 } else if (other - self == 2
229 && is_a<clifford>(self[1])) {
234 // gamma~mu gamma~alpha gamma~beta gamma.mu = 4 g~alpha~beta + (dim-4) gamam~alpha gamma~beta
235 } else if (other - self == 3
236 && is_a<clifford>(self[1])
237 && is_a<clifford>(self[2])) {
239 base_and_index(self[1], b1, i1);
240 base_and_index(self[2], b2, i2);
241 *self = 4 * lorentz_g(i1, i2) * b1 * b2 * dirac_ONE(rl) + (dim - 4) * self[1] * self[2];
247 // gamma~mu gamma~alpha gamma~beta gamma~delta gamma.mu = -2 gamma~delta gamma~beta gamma~alpha - (dim-4) gamam~alpha gamma~beta gamma~delta
248 } else if (other - self == 4
249 && is_a<clifford>(self[1])
250 && is_a<clifford>(self[2])
251 && is_a<clifford>(self[3])) {
252 *self = -2 * self[3] * self[2] * self[1] - (dim - 4) * self[1] * self[2] * self[3];
259 // gamma~mu S gamma~alpha gamma.mu = 2 gamma~alpha S - gamma~mu S gamma.mu gamma~alpha
260 // (commutate contracted indices towards each other, simplify_indexed()
261 // will re-expand and re-run the simplification)
263 exvector::iterator it = self + 1, next_to_last = other - 1;
264 while (it != other) {
265 if (!is_a<clifford>(*it))
272 while (it != next_to_last) {
277 *self = 2 * (*next_to_last) * S - (*self) * S * (*other) * (*next_to_last);
278 *next_to_last = _ex1;
283 } else if (is_a<symbol>(other->op(0)) && other->nops() == 2) {
285 // x.mu gamma~mu -> x-slash
286 *self = dirac_slash(other->op(0), dim, rl);
294 /** Perform automatic simplification on noncommutative product of clifford
295 * objects. This removes superfluous ONEs, permutes gamma5/L/R's to the front
296 * and removes squares of gamma objects. */
297 ex clifford::simplify_ncmul(const exvector & v) const
302 // Remove superfluous ONEs
303 exvector::const_iterator cit = v.begin(), citend = v.end();
304 while (cit != citend) {
305 if (!is_a<clifford>(*cit) || !is_a<diracone>(cit->op(0)))
310 bool something_changed = false;
313 // Anticommute gamma5/L/R's to the front
315 exvector::iterator first = s.begin(), next_to_last = s.end() - 2;
317 exvector::iterator it = next_to_last;
319 exvector::iterator it2 = it + 1;
320 if (is_a<clifford>(*it) && is_a<clifford>(*it2)) {
321 ex e1 = it->op(0), e2 = it2->op(0);
323 if (is_a<diracgamma5>(e2)) {
325 if (is_a<diracgammaL>(e1) || is_a<diracgammaR>(e1)) {
327 // gammaL/R gamma5 -> gamma5 gammaL/R
329 something_changed = true;
331 } else if (!is_a<diracgamma5>(e1)) {
333 // gamma5 gamma5 -> gamma5 gamma5 (do nothing)
334 // x gamma5 -> -gamma5 x
337 something_changed = true;
340 } else if (is_a<diracgammaL>(e2)) {
342 if (is_a<diracgammaR>(e1)) {
344 // gammaR gammaL -> 0
347 } else if (!is_a<diracgammaL>(e1) && !is_a<diracgamma5>(e1)) {
349 // gammaL gammaL -> gammaL gammaL (do nothing)
350 // gamma5 gammaL -> gamma5 gammaL (do nothing)
351 // x gammaL -> gammaR x
353 *it = clifford(diracgammaR(), ex_to<clifford>(*it).get_representation_label());
354 something_changed = true;
357 } else if (is_a<diracgammaR>(e2)) {
359 if (is_a<diracgammaL>(e1)) {
361 // gammaL gammaR -> 0
364 } else if (!is_a<diracgammaR>(e1) && !is_a<diracgamma5>(e1)) {
366 // gammaR gammaR -> gammaR gammaR (do nothing)
367 // gamma5 gammaR -> gamma5 gammaR (do nothing)
368 // x gammaR -> gammaL x
370 *it = clifford(diracgammaL(), ex_to<clifford>(*it).get_representation_label());
371 something_changed = true;
379 if (next_to_last == first)
385 // Remove equal adjacent gammas
387 exvector::iterator it, itend = s.end() - 1;
388 for (it = s.begin(); it != itend; ++it) {
391 if (!is_a<clifford>(a) || !is_a<clifford>(b))
394 const ex & ag = a.op(0);
395 const ex & bg = b.op(0);
396 bool a_is_diracgamma = is_a<diracgamma>(ag);
397 bool b_is_diracgamma = is_a<diracgamma>(bg);
399 if (a_is_diracgamma && b_is_diracgamma) {
401 const ex & ia = a.op(1);
402 const ex & ib = b.op(1);
403 if (ia.is_equal(ib)) { // gamma~alpha gamma~alpha -> g~alpha~alpha
404 a = lorentz_g(ia, ib);
405 b = dirac_ONE(representation_label);
406 something_changed = true;
409 } else if ((is_a<diracgamma5>(ag) && is_a<diracgamma5>(bg))) {
411 // Remove squares of gamma5
412 a = dirac_ONE(representation_label);
413 b = dirac_ONE(representation_label);
414 something_changed = true;
416 } else if ((is_a<diracgammaL>(ag) && is_a<diracgammaL>(bg))
417 || (is_a<diracgammaR>(ag) && is_a<diracgammaR>(bg))) {
419 // Remove squares of gammaL/R
420 b = dirac_ONE(representation_label);
421 something_changed = true;
423 } else if (is_a<diracgammaL>(ag) && is_a<diracgammaR>(bg)) {
425 // gammaL and gammaR are orthogonal
428 } else if (is_a<diracgamma5>(ag) && is_a<diracgammaL>(bg)) {
430 // gamma5 gammaL -> -gammaL
431 a = dirac_ONE(representation_label);
433 something_changed = true;
435 } else if (is_a<diracgamma5>(ag) && is_a<diracgammaR>(bg)) {
437 // gamma5 gammaR -> gammaR
438 a = dirac_ONE(representation_label);
439 something_changed = true;
441 } else if (!a_is_diracgamma && !b_is_diracgamma && ag.is_equal(bg)) {
444 varidx ix((new symbol)->setflag(status_flags::dynallocated), ex_to<idx>(a.op(1)).minimal_dim(ex_to<idx>(b.op(1))));
445 a = indexed(ag, ix) * indexed(ag, ix.toggle_variance());
446 b = dirac_ONE(representation_label);
447 something_changed = true;
453 return clifford(diracone(), representation_label) * sign;
454 if (something_changed)
455 return nonsimplified_ncmul(s) * sign;
457 return simplified_ncmul(s) * sign;
460 ex clifford::thisexprseq(const exvector & v) const
462 return clifford(representation_label, v);
465 ex clifford::thisexprseq(exvector * vp) const
467 return clifford(representation_label, vp);
474 ex dirac_ONE(unsigned char rl)
476 return clifford(diracone(), rl);
479 ex dirac_gamma(const ex & mu, unsigned char rl)
481 if (!is_a<varidx>(mu))
482 throw(std::invalid_argument("index of Dirac gamma must be of type varidx"));
484 return clifford(diracgamma(), mu, rl);
487 ex dirac_gamma5(unsigned char rl)
489 return clifford(diracgamma5(), rl);
492 ex dirac_gammaL(unsigned char rl)
494 return clifford(diracgammaL(), rl);
497 ex dirac_gammaR(unsigned char rl)
499 return clifford(diracgammaR(), rl);
502 ex dirac_gamma6(unsigned char rl)
504 return clifford(diracone(), rl) + clifford(diracgamma5(), rl);
507 ex dirac_gamma7(unsigned char rl)
509 return clifford(diracone(), rl) - clifford(diracgamma5(), rl);
512 ex dirac_slash(const ex & e, const ex & dim, unsigned char rl)
514 // Slashed vectors are actually stored as a clifford object with the
515 // vector as its base expression and a (dummy) index that just serves
516 // for storing the space dimensionality
517 return clifford(e, varidx(0, dim), rl);
520 /** Check whether a given tinfo key (as returned by return_type_tinfo()
521 * is that of a clifford object with the specified representation label. */
522 static bool is_clifford_tinfo(unsigned ti, unsigned char rl)
524 return ti == (TINFO_clifford + rl);
527 /** Check whether a given tinfo key (as returned by return_type_tinfo()
528 * is that of a clifford object (with an arbitrary representation label). */
529 static bool is_clifford_tinfo(unsigned ti)
531 return (ti & ~0xff) == TINFO_clifford;
534 /** Take trace of a string of an even number of Dirac gammas given a vector
536 static ex trace_string(exvector::const_iterator ix, unsigned num)
538 // Tr gamma.mu gamma.nu = 4 g.mu.nu
540 return lorentz_g(ix[0], ix[1]);
542 // Tr gamma.mu gamma.nu gamma.rho gamma.sig = 4 (g.mu.nu g.rho.sig + g.nu.rho g.mu.sig - g.mu.rho g.nu.sig
544 return lorentz_g(ix[0], ix[1]) * lorentz_g(ix[2], ix[3])
545 + lorentz_g(ix[1], ix[2]) * lorentz_g(ix[0], ix[3])
546 - lorentz_g(ix[0], ix[2]) * lorentz_g(ix[1], ix[3]);
548 // Traces of 6 or more gammas are computed recursively:
549 // Tr gamma.mu1 gamma.mu2 ... gamma.mun =
550 // + g.mu1.mu2 * Tr gamma.mu3 ... gamma.mun
551 // - g.mu1.mu3 * Tr gamma.mu2 gamma.mu4 ... gamma.mun
552 // + g.mu1.mu4 * Tr gamma.mu3 gamma.mu3 gamma.mu5 ... gamma.mun
554 // + g.mu1.mun * Tr gamma.mu2 ... gamma.mu(n-1)
558 for (unsigned i=1; i<num; i++) {
559 for (unsigned n=1, j=0; n<num; n++) {
564 result += sign * lorentz_g(ix[0], ix[i]) * trace_string(v.begin(), num-2);
570 ex dirac_trace(const ex & e, unsigned char rl, const ex & trONE)
572 if (is_a<clifford>(e)) {
574 if (!ex_to<clifford>(e).get_representation_label() == rl)
576 const ex & g = e.op(0);
577 if (is_a<diracone>(g))
579 else if (is_a<diracgammaL>(g) || is_a<diracgammaR>(g))
584 } else if (is_ex_exactly_of_type(e, mul)) {
586 // Trace of product: pull out non-clifford factors
588 for (unsigned i=0; i<e.nops(); i++) {
589 const ex &o = e.op(i);
590 if (is_clifford_tinfo(o.return_type_tinfo(), rl))
591 prod *= dirac_trace(o, rl, trONE);
597 } else if (is_ex_exactly_of_type(e, ncmul)) {
599 if (!is_clifford_tinfo(e.return_type_tinfo(), rl))
602 // Substitute gammaL/R and expand product, if necessary
603 ex e_expanded = e.subs(lst(
604 dirac_gammaL(rl) == (dirac_ONE(rl)-dirac_gamma5(rl))/2,
605 dirac_gammaR(rl) == (dirac_ONE(rl)+dirac_gamma5(rl))/2
607 if (!is_a<ncmul>(e_expanded))
608 return dirac_trace(e_expanded, rl, trONE);
610 // gamma5 gets moved to the front so this check is enough
611 bool has_gamma5 = is_a<diracgamma5>(e.op(0).op(0));
612 unsigned num = e.nops();
616 // Trace of gamma5 * odd number of gammas and trace of
617 // gamma5 * gamma.mu * gamma.nu are zero
618 if ((num & 1) == 0 || num == 3)
621 // Tr gamma5 gamma.mu gamma.nu gamma.rho gamma.sigma = 4I * epsilon(mu, nu, rho, sigma)
622 // (the epsilon is always 4-dimensional)
624 ex b1, i1, b2, i2, b3, i3, b4, i4;
625 base_and_index(e.op(1), b1, i1);
626 base_and_index(e.op(2), b2, i2);
627 base_and_index(e.op(3), b3, i3);
628 base_and_index(e.op(4), b4, i4);
629 return trONE * I * (lorentz_eps(ex_to<idx>(i1).replace_dim(_ex4), ex_to<idx>(i2).replace_dim(_ex4), ex_to<idx>(i3).replace_dim(_ex4), ex_to<idx>(i4).replace_dim(_ex4)) * b1 * b2 * b3 * b4).simplify_indexed();
633 // I/4! * epsilon0123.mu1.mu2.mu3.mu4 * Tr gamma.mu1 gamma.mu2 gamma.mu3 gamma.mu4 S_2k
634 // (the epsilon is always 4-dimensional)
635 exvector ix(num-1), bv(num-1);
636 for (unsigned i=1; i<num; i++)
637 base_and_index(e.op(i), bv[i-1], ix[i-1]);
639 int *iv = new int[num];
641 for (unsigned i=0; i<num-3; i++) {
643 for (unsigned j=i+1; j<num-2; j++) {
645 for (unsigned k=j+1; k<num-1; k++) {
647 for (unsigned l=k+1; l<num; l++) {
649 iv[0] = i; iv[1] = j; iv[2] = k; iv[3] = l;
652 for (unsigned n=0, t=4; n<num; n++) {
653 if (n == i || n == j || n == k || n == l)
658 int sign = permutation_sign(iv, iv + num);
659 result += sign * lorentz_eps(ex_to<idx>(idx1).replace_dim(_ex4), ex_to<idx>(idx2).replace_dim(_ex4), ex_to<idx>(idx3).replace_dim(_ex4), ex_to<idx>(idx4).replace_dim(_ex4))
660 * trace_string(v.begin(), num - 4);
666 return trONE * I * result * mul(bv);
668 } else { // no gamma5
670 // Trace of odd number of gammas is zero
674 // Tr gamma.mu gamma.nu = 4 g.mu.nu
677 base_and_index(e.op(0), b1, i1);
678 base_and_index(e.op(1), b2, i2);
679 return trONE * (lorentz_g(i1, i2) * b1 * b2).simplify_indexed();
682 exvector iv(num), bv(num);
683 for (unsigned i=0; i<num; i++)
684 base_and_index(e.op(i), bv[i], iv[i]);
686 return trONE * (trace_string(iv.begin(), num) * mul(bv)).simplify_indexed();
689 } else if (e.nops() > 0) {
691 // Trace maps to all other container classes (this includes sums)
692 pointer_to_map_function_2args<unsigned char, const ex &> fcn(dirac_trace, rl, trONE);
699 ex canonicalize_clifford(const ex & e)
701 // Scan for any ncmul objects
703 ex aux = e.to_rational(srl);
704 for (unsigned i=0; i<srl.nops(); i++) {
706 ex lhs = srl.op(i).lhs();
707 ex rhs = srl.op(i).rhs();
709 if (is_ex_exactly_of_type(rhs, ncmul)
710 && rhs.return_type() == return_types::noncommutative
711 && is_clifford_tinfo(rhs.return_type_tinfo())) {
713 // Expand product, if necessary
714 ex rhs_expanded = rhs.expand();
715 if (!is_a<ncmul>(rhs_expanded)) {
716 srl.let_op(i) = (lhs == canonicalize_clifford(rhs_expanded));
719 } else if (!is_a<clifford>(rhs.op(0)))
723 v.reserve(rhs.nops());
724 for (unsigned j=0; j<rhs.nops(); j++)
725 v.push_back(rhs.op(j));
727 // Stupid recursive bubble sort because we only want to swap adjacent gammas
728 exvector::iterator it = v.begin(), next_to_last = v.end() - 1;
729 if (is_a<diracgamma5>(it->op(0)) || is_a<diracgammaL>(it->op(0)) || is_a<diracgammaR>(it->op(0)))
731 while (it != next_to_last) {
732 if (it[0].compare(it[1]) > 0) {
733 ex save0 = it[0], save1 = it[1];
735 base_and_index(it[0], b1, i1);
736 base_and_index(it[1], b2, i2);
737 it[0] = (lorentz_g(i1, i2) * b1 * b2).simplify_indexed();
742 sum -= ncmul(v, true);
743 srl.let_op(i) = (lhs == canonicalize_clifford(sum));
751 return aux.subs(srl).simplify_indexed();