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"
35 #include "operators.h"
43 GINAC_IMPLEMENT_REGISTERED_CLASS_OPT(clifford, indexed,
44 print_func<print_dflt>(&clifford::do_print_dflt).
45 print_func<print_latex>(&clifford::do_print_latex))
47 GINAC_IMPLEMENT_REGISTERED_CLASS_OPT(diracone, tensor,
48 print_func<print_dflt>(&diracone::do_print).
49 print_func<print_latex>(&diracone::do_print_latex))
51 GINAC_IMPLEMENT_REGISTERED_CLASS_OPT(diracgamma, tensor,
52 print_func<print_dflt>(&diracgamma::do_print).
53 print_func<print_latex>(&diracgamma::do_print_latex))
55 GINAC_IMPLEMENT_REGISTERED_CLASS_OPT(diracgamma5, tensor,
56 print_func<print_dflt>(&diracgamma5::do_print).
57 print_func<print_latex>(&diracgamma5::do_print_latex))
59 GINAC_IMPLEMENT_REGISTERED_CLASS_OPT(diracgammaL, tensor,
60 print_func<print_context>(&diracgammaL::do_print).
61 print_func<print_latex>(&diracgammaL::do_print_latex))
63 GINAC_IMPLEMENT_REGISTERED_CLASS_OPT(diracgammaR, tensor,
64 print_func<print_context>(&diracgammaR::do_print).
65 print_func<print_latex>(&diracgammaR::do_print_latex))
68 // default constructors
71 clifford::clifford() : representation_label(0)
73 tinfo_key = TINFO_clifford;
76 DEFAULT_CTOR(diracone)
77 DEFAULT_CTOR(diracgamma)
78 DEFAULT_CTOR(diracgamma5)
79 DEFAULT_CTOR(diracgammaL)
80 DEFAULT_CTOR(diracgammaR)
86 /** Construct object without any indices. This constructor is for internal
87 * use only. Use the dirac_ONE() function instead.
89 clifford::clifford(const ex & b, unsigned char rl) : inherited(b), representation_label(rl)
91 tinfo_key = TINFO_clifford;
94 /** Construct object with one Lorentz index. This constructor is for internal
95 * use only. Use the dirac_gamma() function instead.
97 clifford::clifford(const ex & b, const ex & mu, unsigned char rl) : inherited(b, mu), representation_label(rl)
99 GINAC_ASSERT(is_a<varidx>(mu));
100 tinfo_key = TINFO_clifford;
103 clifford::clifford(unsigned char rl, const exvector & v, bool discardable) : inherited(sy_none(), v, discardable), representation_label(rl)
105 tinfo_key = TINFO_clifford;
108 clifford::clifford(unsigned char rl, exvector * vp) : inherited(sy_none(), vp), representation_label(rl)
110 tinfo_key = TINFO_clifford;
117 clifford::clifford(const archive_node &n, lst &sym_lst) : inherited(n, sym_lst)
120 n.find_unsigned("label", rl);
121 representation_label = rl;
124 void clifford::archive(archive_node &n) const
126 inherited::archive(n);
127 n.add_unsigned("label", representation_label);
130 DEFAULT_UNARCHIVE(clifford)
131 DEFAULT_ARCHIVING(diracone)
132 DEFAULT_ARCHIVING(diracgamma)
133 DEFAULT_ARCHIVING(diracgamma5)
134 DEFAULT_ARCHIVING(diracgammaL)
135 DEFAULT_ARCHIVING(diracgammaR)
138 // functions overriding virtual functions from base classes
141 int clifford::compare_same_type(const basic & other) const
143 GINAC_ASSERT(is_a<clifford>(other));
144 const clifford &o = static_cast<const clifford &>(other);
146 if (representation_label != o.representation_label) {
147 // different representation label
148 return representation_label < o.representation_label ? -1 : 1;
151 return inherited::compare_same_type(other);
154 bool clifford::match_same_type(const basic & other) const
156 GINAC_ASSERT(is_a<clifford>(other));
157 const clifford &o = static_cast<const clifford &>(other);
159 return representation_label == o.representation_label;
162 static bool is_dirac_slash(const ex & seq0)
164 return !is_a<diracgamma5>(seq0) && !is_a<diracgammaL>(seq0) &&
165 !is_a<diracgammaR>(seq0) && !is_a<diracgamma>(seq0) &&
166 !is_a<diracone>(seq0);
169 void clifford::do_print_dflt(const print_dflt & c, unsigned level) const
171 // dirac_slash() object is printed differently
172 if (is_dirac_slash(seq[0])) {
173 seq[0].print(c, level);
176 this->print_dispatch<inherited>(c, level);
179 void clifford::do_print_latex(const print_latex & c, unsigned level) const
181 // dirac_slash() object is printed differently
182 if (is_dirac_slash(seq[0])) {
184 seq[0].print(c, level);
185 c.s << "\\hspace{-1.0ex}/}";
187 this->print_dispatch<inherited>(c, level);
190 DEFAULT_COMPARE(diracone)
191 DEFAULT_COMPARE(diracgamma)
192 DEFAULT_COMPARE(diracgamma5)
193 DEFAULT_COMPARE(diracgammaL)
194 DEFAULT_COMPARE(diracgammaR)
196 DEFAULT_PRINT_LATEX(diracone, "ONE", "\\mathbb{1}")
197 DEFAULT_PRINT_LATEX(diracgamma, "gamma", "\\gamma")
198 DEFAULT_PRINT_LATEX(diracgamma5, "gamma5", "{\\gamma^5}")
199 DEFAULT_PRINT_LATEX(diracgammaL, "gammaL", "{\\gamma_L}")
200 DEFAULT_PRINT_LATEX(diracgammaR, "gammaR", "{\\gamma_R}")
202 /** This function decomposes gamma~mu -> (1, mu) and a\ -> (a.ix, ix) */
203 static void base_and_index(const ex & c, ex & b, ex & i)
205 GINAC_ASSERT(is_a<clifford>(c));
206 GINAC_ASSERT(c.nops() == 2);
208 if (is_a<diracgamma>(c.op(0))) { // proper dirac gamma object
211 } else if (is_a<diracgamma5>(c.op(0)) || is_a<diracgammaL>(c.op(0)) || is_a<diracgammaR>(c.op(0))) { // gamma5/L/R
214 } else { // slash object, generate new dummy index
215 varidx ix((new symbol)->setflag(status_flags::dynallocated), ex_to<idx>(c.op(1)).get_dim());
216 b = indexed(c.op(0), ix.toggle_variance());
221 /** Contraction of a gamma matrix with something else. */
222 bool diracgamma::contract_with(exvector::iterator self, exvector::iterator other, exvector & v) const
224 GINAC_ASSERT(is_a<clifford>(*self));
225 GINAC_ASSERT(is_a<indexed>(*other));
226 GINAC_ASSERT(is_a<diracgamma>(self->op(0)));
227 unsigned char rl = ex_to<clifford>(*self).get_representation_label();
229 ex dim = ex_to<idx>(self->op(1)).get_dim();
230 if (other->nops() > 1)
231 dim = minimal_dim(dim, ex_to<idx>(other->op(1)).get_dim());
233 if (is_a<clifford>(*other)) {
235 // Contraction only makes sense if the represenation labels are equal
236 if (ex_to<clifford>(*other).get_representation_label() != rl)
239 // gamma~mu gamma.mu = dim ONE
240 if (other - self == 1) {
242 *other = dirac_ONE(rl);
245 // gamma~mu gamma~alpha gamma.mu = (2-dim) gamma~alpha
246 } else if (other - self == 2
247 && is_a<clifford>(self[1])) {
252 // gamma~mu gamma~alpha gamma~beta gamma.mu = 4 g~alpha~beta + (dim-4) gamam~alpha gamma~beta
253 } else if (other - self == 3
254 && is_a<clifford>(self[1])
255 && is_a<clifford>(self[2])) {
257 base_and_index(self[1], b1, i1);
258 base_and_index(self[2], b2, i2);
259 *self = 4 * lorentz_g(i1, i2) * b1 * b2 * dirac_ONE(rl) + (dim - 4) * self[1] * self[2];
265 // 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
266 } else if (other - self == 4
267 && is_a<clifford>(self[1])
268 && is_a<clifford>(self[2])
269 && is_a<clifford>(self[3])) {
270 *self = -2 * self[3] * self[2] * self[1] - (dim - 4) * self[1] * self[2] * self[3];
277 // gamma~mu S gamma~alpha gamma.mu = 2 gamma~alpha S - gamma~mu S gamma.mu gamma~alpha
278 // (commutate contracted indices towards each other, simplify_indexed()
279 // will re-expand and re-run the simplification)
281 exvector::iterator it = self + 1, next_to_last = other - 1;
282 while (it != other) {
283 if (!is_a<clifford>(*it))
290 while (it != next_to_last) {
295 *self = 2 * (*next_to_last) * S - (*self) * S * (*other) * (*next_to_last);
296 *next_to_last = _ex1;
301 } else if (is_a<symbol>(other->op(0)) && other->nops() == 2) {
303 // x.mu gamma~mu -> x-slash
304 *self = dirac_slash(other->op(0), dim, rl);
312 /** Perform automatic simplification on noncommutative product of clifford
313 * objects. This removes superfluous ONEs, permutes gamma5/L/R's to the front
314 * and removes squares of gamma objects. */
315 ex clifford::eval_ncmul(const exvector & v) const
320 // Remove superfluous ONEs
321 exvector::const_iterator cit = v.begin(), citend = v.end();
322 while (cit != citend) {
323 if (!is_a<clifford>(*cit) || !is_a<diracone>(cit->op(0)))
328 bool something_changed = false;
331 // Anticommute gamma5/L/R's to the front
333 exvector::iterator first = s.begin(), next_to_last = s.end() - 2;
335 exvector::iterator it = next_to_last;
337 exvector::iterator it2 = it + 1;
338 if (is_a<clifford>(*it) && is_a<clifford>(*it2)) {
339 ex e1 = it->op(0), e2 = it2->op(0);
341 if (is_a<diracgamma5>(e2)) {
343 if (is_a<diracgammaL>(e1) || is_a<diracgammaR>(e1)) {
345 // gammaL/R gamma5 -> gamma5 gammaL/R
347 something_changed = true;
349 } else if (!is_a<diracgamma5>(e1)) {
351 // gamma5 gamma5 -> gamma5 gamma5 (do nothing)
352 // x gamma5 -> -gamma5 x
355 something_changed = true;
358 } else if (is_a<diracgammaL>(e2)) {
360 if (is_a<diracgammaR>(e1)) {
362 // gammaR gammaL -> 0
365 } else if (!is_a<diracgammaL>(e1) && !is_a<diracgamma5>(e1)) {
367 // gammaL gammaL -> gammaL gammaL (do nothing)
368 // gamma5 gammaL -> gamma5 gammaL (do nothing)
369 // x gammaL -> gammaR x
371 *it = clifford(diracgammaR(), ex_to<clifford>(*it).get_representation_label());
372 something_changed = true;
375 } else if (is_a<diracgammaR>(e2)) {
377 if (is_a<diracgammaL>(e1)) {
379 // gammaL gammaR -> 0
382 } else if (!is_a<diracgammaR>(e1) && !is_a<diracgamma5>(e1)) {
384 // gammaR gammaR -> gammaR gammaR (do nothing)
385 // gamma5 gammaR -> gamma5 gammaR (do nothing)
386 // x gammaR -> gammaL x
388 *it = clifford(diracgammaL(), ex_to<clifford>(*it).get_representation_label());
389 something_changed = true;
397 if (next_to_last == first)
403 // Remove equal adjacent gammas
405 exvector::iterator it, itend = s.end() - 1;
406 for (it = s.begin(); it != itend; ++it) {
409 if (!is_a<clifford>(a) || !is_a<clifford>(b))
412 const ex & ag = a.op(0);
413 const ex & bg = b.op(0);
414 bool a_is_diracgamma = is_a<diracgamma>(ag);
415 bool b_is_diracgamma = is_a<diracgamma>(bg);
417 if (a_is_diracgamma && b_is_diracgamma) {
419 const ex & ia = a.op(1);
420 const ex & ib = b.op(1);
421 if (ia.is_equal(ib)) { // gamma~alpha gamma~alpha -> g~alpha~alpha
422 a = lorentz_g(ia, ib);
423 b = dirac_ONE(representation_label);
424 something_changed = true;
427 } else if ((is_a<diracgamma5>(ag) && is_a<diracgamma5>(bg))) {
429 // Remove squares of gamma5
430 a = dirac_ONE(representation_label);
431 b = dirac_ONE(representation_label);
432 something_changed = true;
434 } else if ((is_a<diracgammaL>(ag) && is_a<diracgammaL>(bg))
435 || (is_a<diracgammaR>(ag) && is_a<diracgammaR>(bg))) {
437 // Remove squares of gammaL/R
438 b = dirac_ONE(representation_label);
439 something_changed = true;
441 } else if (is_a<diracgammaL>(ag) && is_a<diracgammaR>(bg)) {
443 // gammaL and gammaR are orthogonal
446 } else if (is_a<diracgamma5>(ag) && is_a<diracgammaL>(bg)) {
448 // gamma5 gammaL -> -gammaL
449 a = dirac_ONE(representation_label);
451 something_changed = true;
453 } else if (is_a<diracgamma5>(ag) && is_a<diracgammaR>(bg)) {
455 // gamma5 gammaR -> gammaR
456 a = dirac_ONE(representation_label);
457 something_changed = true;
459 } else if (!a_is_diracgamma && !b_is_diracgamma && ag.is_equal(bg)) {
462 varidx ix((new symbol)->setflag(status_flags::dynallocated), ex_to<idx>(a.op(1)).minimal_dim(ex_to<idx>(b.op(1))));
463 a = indexed(ag, ix) * indexed(ag, ix.toggle_variance());
464 b = dirac_ONE(representation_label);
465 something_changed = true;
471 return clifford(diracone(), representation_label) * sign;
472 if (something_changed)
473 return reeval_ncmul(s) * sign;
475 return hold_ncmul(s) * sign;
478 ex clifford::thiscontainer(const exvector & v) const
480 return clifford(representation_label, v);
483 ex clifford::thiscontainer(exvector * vp) const
485 return clifford(representation_label, vp);
492 ex dirac_ONE(unsigned char rl)
494 return clifford(diracone(), rl);
497 ex dirac_gamma(const ex & mu, unsigned char rl)
499 if (!is_a<varidx>(mu))
500 throw(std::invalid_argument("index of Dirac gamma must be of type varidx"));
502 return clifford(diracgamma(), mu, rl);
505 ex dirac_gamma5(unsigned char rl)
507 return clifford(diracgamma5(), rl);
510 ex dirac_gammaL(unsigned char rl)
512 return clifford(diracgammaL(), rl);
515 ex dirac_gammaR(unsigned char rl)
517 return clifford(diracgammaR(), rl);
520 ex dirac_slash(const ex & e, const ex & dim, unsigned char rl)
522 // Slashed vectors are actually stored as a clifford object with the
523 // vector as its base expression and a (dummy) index that just serves
524 // for storing the space dimensionality
525 return clifford(e, varidx(0, dim), rl);
528 /** Check whether a given tinfo key (as returned by return_type_tinfo()
529 * is that of a clifford object with the specified representation label. */
530 static bool is_clifford_tinfo(unsigned ti, unsigned char rl)
532 return ti == (TINFO_clifford + rl);
535 /** Check whether a given tinfo key (as returned by return_type_tinfo()
536 * is that of a clifford object (with an arbitrary representation label). */
537 static bool is_clifford_tinfo(unsigned ti)
539 return (ti & ~0xff) == TINFO_clifford;
542 /** Take trace of a string of an even number of Dirac gammas given a vector
544 static ex trace_string(exvector::const_iterator ix, size_t num)
546 // Tr gamma.mu gamma.nu = 4 g.mu.nu
548 return lorentz_g(ix[0], ix[1]);
550 // 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 )
552 return lorentz_g(ix[0], ix[1]) * lorentz_g(ix[2], ix[3])
553 + lorentz_g(ix[1], ix[2]) * lorentz_g(ix[0], ix[3])
554 - lorentz_g(ix[0], ix[2]) * lorentz_g(ix[1], ix[3]);
556 // Traces of 6 or more gammas are computed recursively:
557 // Tr gamma.mu1 gamma.mu2 ... gamma.mun =
558 // + g.mu1.mu2 * Tr gamma.mu3 ... gamma.mun
559 // - g.mu1.mu3 * Tr gamma.mu2 gamma.mu4 ... gamma.mun
560 // + g.mu1.mu4 * Tr gamma.mu3 gamma.mu3 gamma.mu5 ... gamma.mun
562 // + g.mu1.mun * Tr gamma.mu2 ... gamma.mu(n-1)
566 for (size_t i=1; i<num; i++) {
567 for (size_t n=1, j=0; n<num; n++) {
572 result += sign * lorentz_g(ix[0], ix[i]) * trace_string(v.begin(), num-2);
578 ex dirac_trace(const ex & e, unsigned char rl, const ex & trONE)
580 if (is_a<clifford>(e)) {
582 if (!ex_to<clifford>(e).get_representation_label() == rl)
584 const ex & g = e.op(0);
585 if (is_a<diracone>(g))
587 else if (is_a<diracgammaL>(g) || is_a<diracgammaR>(g))
592 } else if (is_exactly_a<mul>(e)) {
594 // Trace of product: pull out non-clifford factors
596 for (size_t i=0; i<e.nops(); i++) {
597 const ex &o = e.op(i);
598 if (is_clifford_tinfo(o.return_type_tinfo(), rl))
599 prod *= dirac_trace(o, rl, trONE);
605 } else if (is_exactly_a<ncmul>(e)) {
607 if (!is_clifford_tinfo(e.return_type_tinfo(), rl))
610 // Substitute gammaL/R and expand product, if necessary
611 ex e_expanded = e.subs(lst(
612 dirac_gammaL(rl) == (dirac_ONE(rl)-dirac_gamma5(rl))/2,
613 dirac_gammaR(rl) == (dirac_ONE(rl)+dirac_gamma5(rl))/2
614 ), subs_options::no_pattern).expand();
615 if (!is_a<ncmul>(e_expanded))
616 return dirac_trace(e_expanded, rl, trONE);
618 // gamma5 gets moved to the front so this check is enough
619 bool has_gamma5 = is_a<diracgamma5>(e.op(0).op(0));
620 size_t num = e.nops();
624 // Trace of gamma5 * odd number of gammas and trace of
625 // gamma5 * gamma.mu * gamma.nu are zero
626 if ((num & 1) == 0 || num == 3)
629 // Tr gamma5 gamma.mu gamma.nu gamma.rho gamma.sigma = 4I * epsilon(mu, nu, rho, sigma)
630 // (the epsilon is always 4-dimensional)
632 ex b1, i1, b2, i2, b3, i3, b4, i4;
633 base_and_index(e.op(1), b1, i1);
634 base_and_index(e.op(2), b2, i2);
635 base_and_index(e.op(3), b3, i3);
636 base_and_index(e.op(4), b4, i4);
637 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();
641 // I/4! * epsilon0123.mu1.mu2.mu3.mu4 * Tr gamma.mu1 gamma.mu2 gamma.mu3 gamma.mu4 S_2k
642 // (the epsilon is always 4-dimensional)
643 exvector ix(num-1), bv(num-1);
644 for (size_t i=1; i<num; i++)
645 base_and_index(e.op(i), bv[i-1], ix[i-1]);
647 int *iv = new int[num];
649 for (size_t i=0; i<num-3; i++) {
651 for (size_t j=i+1; j<num-2; j++) {
653 for (size_t k=j+1; k<num-1; k++) {
655 for (size_t l=k+1; l<num; l++) {
657 iv[0] = i; iv[1] = j; iv[2] = k; iv[3] = l;
660 for (size_t n=0, t=4; n<num; n++) {
661 if (n == i || n == j || n == k || n == l)
666 int sign = permutation_sign(iv, iv + num);
667 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))
668 * trace_string(v.begin(), num - 4);
674 return trONE * I * result * mul(bv);
676 } else { // no gamma5
678 // Trace of odd number of gammas is zero
682 // Tr gamma.mu gamma.nu = 4 g.mu.nu
685 base_and_index(e.op(0), b1, i1);
686 base_and_index(e.op(1), b2, i2);
687 return trONE * (lorentz_g(i1, i2) * b1 * b2).simplify_indexed();
690 exvector iv(num), bv(num);
691 for (size_t i=0; i<num; i++)
692 base_and_index(e.op(i), bv[i], iv[i]);
694 return trONE * (trace_string(iv.begin(), num) * mul(bv)).simplify_indexed();
697 } else if (e.nops() > 0) {
699 // Trace maps to all other container classes (this includes sums)
700 pointer_to_map_function_2args<unsigned char, const ex &> fcn(dirac_trace, rl, trONE);
707 ex canonicalize_clifford(const ex & e)
709 // Scan for any ncmul objects
711 ex aux = e.to_rational(srl);
712 for (size_t i=0; i<srl.nops(); i++) {
718 if (is_exactly_a<ncmul>(rhs)
719 && rhs.return_type() == return_types::noncommutative
720 && is_clifford_tinfo(rhs.return_type_tinfo())) {
722 // Expand product, if necessary
723 ex rhs_expanded = rhs.expand();
724 if (!is_a<ncmul>(rhs_expanded)) {
725 srl[i] = (lhs == canonicalize_clifford(rhs_expanded));
728 } else if (!is_a<clifford>(rhs.op(0)))
732 v.reserve(rhs.nops());
733 for (size_t j=0; j<rhs.nops(); j++)
734 v.push_back(rhs.op(j));
736 // Stupid recursive bubble sort because we only want to swap adjacent gammas
737 exvector::iterator it = v.begin(), next_to_last = v.end() - 1;
738 if (is_a<diracgamma5>(it->op(0)) || is_a<diracgammaL>(it->op(0)) || is_a<diracgammaR>(it->op(0)))
740 while (it != next_to_last) {
741 if (it[0].compare(it[1]) > 0) {
742 ex save0 = it[0], save1 = it[1];
744 base_and_index(it[0], b1, i1);
745 base_and_index(it[1], b2, i2);
746 it[0] = (lorentz_g(i1, i2) * b1 * b2).simplify_indexed();
751 sum -= ncmul(v, true);
752 srl[i] = (lhs == canonicalize_clifford(sum));
760 return aux.subs(srl, subs_options::no_pattern).simplify_indexed();